Section 8.12 · PDF pages 496–498
Where the arithmetic window enters the family links
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
8.12 Where the arithmetic window enters the family links
We now identify the quantitative link that actually uses the cohomology window. At a family member (x, i), write b = exp(x^{ε}), L = x^{ε}, and let f, m ≥1 be its two positive rank parameters. Let N_{c} ≥0 be its column budget and put B_{0} = fmbx^{ε}. For a lift index j, let d_{j} be its small-level rank, D_{0} the common reference rank, and set ∑
Selectable PDF notation • transcription unchecked
η_{j} = λ_{w}e_{w}η_{j,w}.w in the finite support
Selectable PDF notation • transcription unchecked
µw̸=µ_{0}Here λ_{w} is the logarithmic place weight, e_{w} the ramification index, and η_{j,w} the local colength appearing in the family. All are the same selected lattice and local maps used by the arithmetic comparison of Section 8; changing the selected lattices at this step would not preserve the inequality below.
Proposition 8.36 (The arithmetic-to-divisor bound). Suppose that, uniformly in all members of a family and all lift indices, one has d_{j} = D_{0} and
Selectable PDF notation • transcription unchecked
[ ∑ ∑ ]
η_{j} ≤d_{j}[C{fmbL^{2}+ log^{2}x N_{c}} + log ℓ s_{ℓ}(E, e)] (214)
Selectable PDF notation • transcription unchecked
ℓ 1≤e<t √
whenever the nonnegative prime sum converges. If the cohomology bound 𝒱(E, t, b) holds eventually, then, uniformly in the same indices,
Selectable PDF notation • transcription unchecked
η_{j} ≤D_{0}(|C| + 1)x^{ε}(B_{0} + N_{c})eventually.
Proof. For a nonnegative series, a common upper bound on every finite partial sum proves convergence and bounds its sum. Apply (200), setting the nonprime terms equal to zero. It proves both the required finiteness of the individual lengths and ∑
Selectable PDF notation • transcription unchecked
∑ √
log ℓ s_{ℓ}(E, e) ≤ b ≤b,
Selectable PDF notation • transcription unchecked
ℓ e
since b ≥1. Because ε > 0, eventually log^{2}x ≤x^{ε}. Put y = x^{ε}≥1. Then
fmbL^{2}= yB_{0}, log^{2}x N_{c} ≤yN_{c}, b ≤B_{0} ≤y(B_{0} + N_{c}).
Replace C by |C| in the upper bound in (214) and use d_{j} = D_{0}. Its bracket is at most
Selectable PDF notation • transcription unchecked
|C|y(B_{0} + N_{c}) + y(B_{0} + N_{c}).All thresholds can be replaced by their maximum, independently of the family index and lift.
Source: Development/AutomorphicArithmetic/CharacterBoxes/DivinNOfHypV.lean:17--130; Formalism/SharpRestriction/GlobalTheoremInputs.lean:31--63
This identifies exactly the contribution of the arithmetic branch: (214_{√}) is the family arithmetic compar-ison, the equality d_{j} = D_{0} is a separate rank statement, and 𝒱(E, t, b) is the output of the arithmetic window. None of these three follows formally from either of the other two.
Proposition 8.37 (The final family choice, with fixed exponents). Fix a requirement class ℰ. Suppose arbi-trarily large designs can be chosen in ℰ at every sufficiently small positive accuracy, with choice constant 3, member-size and determinant-factorisation bounds. Suppose the following properties are uniformly eventual over the containing design class:
(i) the arithmetic comparison (214), with its coefficient fixed for the whole family;
(ii) the local twisted-cover compatibility;
(iii) nonnegative irreducibility defect bounded by exp(−x^{ez/7});
(iv) the equality d_{j} = D_{0};
(v) the divisor-kernel construction, which, from the bound of Proposition 8.36 and the twisted cover, sup-plies the maps, heights and zero-above condition of the divisor estimate with absolute exponent 2;
(vi) fullness and the rank bounds for the selected lattices;
(vii) the local-to-global comparison for the same selected data;
(viii) near-orthogonality of the selected operators, with
Selectable PDF notation • transcription unchecked
‖K_{uu}′‖^{2}_{HS}≤(1 + η_{0})^{d}_{D}^{ud}_{∗}^{u′} (u ̸= u^{′}), ‖K_{uu} −1‖^{2}_{HS}≤e_{0}d_{u},
D_{all} ≤(1 + η_{1})D_{∗}, η_{0}, η_{1},^{√}e_{0} ≤e^{−xε/8}, e_{0} ≥0,under 1/3 ≤d_{u}Γ^{2}/D_{∗}≤3;
(ix) the global determinant construction, which turns these same arithmetic, divisor and operator data into
the actual tie of Proposition 3.13, with exponents e_{D} = 2, e_{L} = 0.
Selectable PDF notation • transcription unchecked
√
Suppose every member of ℰ has the eventual cohomology bound 𝒱(E, t, b). Then, at every sufficiently small positive accuracy, one family in ℰ has that tie on all its eventual windows, with the fixed exponents 2, 0. Consequently its level function satisfies
Selectable PDF notation • transcription unchecked
G_{Λ}(x) ≤x^{1/2+9ε}on those windows, provided its character requirement is the one in the analytic engine.
Proof. Combine the nine eventual conditions by Lemma 8.5, before choosing a family. Apply Proposi-tion 8.6 at the resulting largeness parameter. This selects one design F and one height constant for which all nine conditions hold. Its membership in ℰ gives the cohomology bound. Items (i) and (iv), together with that bound, give the divisor input by Proposition 8.36. Item (ii) and the implication in (v) supply the divisor maps and height bounds. The member-size and determinant-factorisation estimates, and (vi), control the finite-place determinant and member-dimension terms in those same lattices. Thus the local-to-global estimate (vii), the near-orthogonality inequalities (viii), irreducibility (iii), and the divisor estimate meet the premises of (ix). It supplies K, c_{HH}, e_{K}, C_{L}, x_{0} valid for all x ≥ x_{0} in the windows of this one family. The exponents in that construction are the already fixed 2, 0; they have not been chosen after ε. Apply
Corollary 3.14 to obtain the displayed bound.
Source: Development/AutomorphicArithmetic/CharacterBoxes/DesWin.lean:11--31; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/TopShape.lean:33--55
The shape-to-goal step adds no existential construction. Once a simultaneous class of choices satisfying the preceding hypotheses has been produced, apply the shape implication to that class and its specified choices. Raw choices must first be interpreted as the spectral selection, base-level choices, definite-height and column choices to which the nine implications refer; each interpretation uses the same raw choice. This is the content of the source’s shape-to-goal repackaging. It does not supply a missing simultaneous realisation or a missing estimate.
Source: Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/ShapeOf.lean:24--32
Branch closure status. Every closed-class family bridge at UpperTheory.Top.shape_closed_link_n_of_green (items (i)–(ix) of Proposition 8.37) is now proved unconditionally from its stated same-realization interface: the arithmetic bound 6.85, its transport 6.89, and its simultaneous realization on every com-patible setup (Theorem 6.101, routed into nRest via UpperTheory.GalC.final_alt_alt) discharge (i); Propositions 8.82, 8.79, and 8.80 prove the mathematical transports for (ii)–(iv), with the twisted-cover and small-level rank producers proved in Subsection 8.21 (Proposition 8.165) and the automorphic all-row cylinder counts, bad-tuple weights, and AllJoin/LinkIRR producer proved in Subsection 8.19 (Theo-rem 8.152); Subsection 8.22 (Lemma 8.168–Theorem 8.172) proves link_brest_alt/RestAll, closed_family_admissible_twist_link_alt, selection_closed_of_wu_decay_alt, wire_sel_alt, and closed_linkDIVt_of_closed_bridge_kernel, discharging (v) with absolute exponent 2; Subsection 8.20 (Theorem 8.159) proves the quantitative Fock no-kernel criterion and LinkG for (vii); Subsection 8.18 (Theorem 8.146) proves all four same-realization kernel bounds (236) for (viii) from the convergent unitary Siegel–Weil formula (Background fact 4.101); and Subsection 8.21 (Lemma 8.161–Theorem 8.166) proves GlobalTheory.Top.link_gl (LinkGL with fixed exponents e_{D} = 2, e_{L} = 0) and UpperTheory.Top.topDesWin, discharging (vi) and (ix). With the entire FAMILY bridge stream closed (alongside the deep-cover covolume bounds of Subsection 16.2, Theorem 16.36, closing the ROOT stream), the upstream suppliers inhabiting HypsAlt on a single selected realization class 𝒜 – namely the geometric row Row0b recT (Theorem 7.116), local reciprocity RecTExists (Theorem 5.18 and Proposition 7.115), theta comparison and local matching (Theo-rems 4.124 and 4.131), arithmetic two/three realization (Subsections 6.6 and 6.7), and the window stream VWin (Theorem 4.75) – are all discharged in their respective sections and combined into one compatible family-selection bundle in Proposition 17.4 and Theorem 17.5 (Section 17).