Section 8.18 · PDF pages 626–637
Same-realization kernel, mass, and loop estimates for the spectral link
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
8.18 Same-realization kernel, mass, and loop estimates for the spectral link
Proposition 8.85 derives the uniform spectral link LinkS from the four kernel bounds (236) and the total row-count estimate (237) on the same selected realization with thresholds independent of the index i. The abstract row-pair decomposition and its numerical closure are already proved in Lemmas 8.86–8.87 and Proposi-tion 8.88, while the local discrete-series compression, weighted reproducing kernel, Bessel integrability, and rank-one Bessel nonvanishing inputs are established in Propositions 8.90–8.116 and Theorems 8.125–8.138. In this subsection we reconstruct the full chain of same-realization Poincaré, mass–volume, multi-level re-cursion, carrier, loop, non-generic, and degenerate kernel estimates around theoremS_closedP that supply all four kernel bounds (236) uniformly along any selected family realization.
Throughout, let D be a tied datum (D7 with Ties D) with rank parameters r_{S}, m = 2r_{S}+2 ≥2, k ≥m+3, r = k + m −1, degree f = [F : ℚ] of the totally real subfield F ⊂E, split type primes g_{1} = D.host.g(0) and g_{2} = D.host.g(1), scale L = log b > 1, and spectral parameter Γ = exp(c_{Γ}m^{5}fL). A selected concrete realization at D is a tuple T ∈ STies(D) carrying a Hida/Poincaré datum X, adelic measure bridge h_{b}, full term system Y , standard additive character ψ of 𝔸_{F} /F, automorphic/measure compatibilities, and – whenever the finite-support predicate FinX T.Y holds – an isometric isomorphism h_{I} : SIso(D.s, sOf(h_{F} )) identifying the abstract kernel datum D.s with the concrete Poincaré term-operator system T.Y.tO(u, u^{′}) for every pair of words u, u^{′}.
Proposition 8.139 (Isometric transport and convergent Poincaré kernel expansion). Let T ∈ STies(D) sat-isfy STiesOK, meaning FinX T.Y, normalized level subgroup, neatness of K_{u}, Whittaker/Bessel decay WuDecayT.X, integrability of the archimedean test kernel, LocTied D, and TFrameAt D. Let h_{I} : SIso(D.s, sOf(h_{F} )) be the associated isometric isomorphism and let K_{u,u}′ := Kmat(D.s, u, u^{′}) and P_{u,u}′ := Kpp(D, u, u^{′}) denote the full and degenerate kernels on V_{u}′ = D.s.Cu(u^{′}) →V_{u} = D.s.Cu(u).
1. The concrete term system satisfies folding (FoldOKC), double-coset integrability (OOIntAllC), absolute convergence (AbsConvC), and the convergent kernel expansion (KExpansionC) K = ∑_{s}a_{M}(s) with a_{M}(s) embedded isometrically into the Hilbert–Schmidt space via hsEmb. Moreover, under the gap hypothesis GapHyp D (i.e. r ≥1801 and archimedean spectral gaps at least 16r^{19}), both WuDecay T.X and FinX T.Y hold unconditionally from Theorem 8.138, Lemma 8.92, and finite-dimensionality of the row spaces (RowsFinDim).
2. For all words u, u^{′}, writing tO_{u,u}′ := T.Y.tO(u, u^{′}) with degenerate term set degSet and non-degenerate part K_{0} = tO_{u,u}′.K_{0}, we have the exact Hilbert–Schmidt identities
‖P_{u,u}′‖_{HS}^{2} = ‖tO_{u,u}′.part(degSet)‖^{2},
‖K_{u,u}′ −P_{u,u}′‖^{2}_{HS}= ‖K_{0}‖^{2} whenever a_{t} = 0 for all t ∈ degSet, (287)
Selectable PDF notation • transcription unchecked
‖K_{u,u} −P_{u,u} −1‖^{2}_{HS}= ‖K_{0}−1_{u}‖^{2},and if a_{t} = 0 for every t ∈ degSet then P_{u,u}′ = 0.
Proof. For (1), finiteness of the Levi cosets (FinLeviC), strong approximation on the nilradical (nilradical_strong_approximation), and the level-subgroup conjugation identity give FoldOKC (FoldOKC_outright). Cov-ering the double cosets by slabs and applying the pointwise column majorant together with the slab count (OOLintSumC_holds) gives both OOIntAllC_outright and AbsConvC_outright, whence KExpansionC_holds fol-lows from slab covering, regrouping, neatness of K_{u}, and independence of the fundamental domain (kExpTiedS_holds, kExpTied_holds). Under GapHyp D, the local Bessel uniqueness bound UniqGap (CompanionTheory.Bmu.besselMapUniqGap), combined with Theorem 8.138 (TopClosed.besselNVG), local reproducing normalization (Lemma 8.91), and unimodularity of the unipotent radical, yields WuDecayOfGap (wuDecayOfGap_of_jsz, wuDecayOfGap_holds'); combining this with finite-dimensionality of automorphic row spaces (CompanionTheory.D.gk.RF.automorphic_forms_finite_dimensional, proved by reduction theory at infinity and convolution operators without external hypotheses) and FinLeviC gives FinX T.Y (finXC_of).
For (2), conjugation conjE(h_{I}, u, u^{′}) by the unitary equivalences h_{I}.eCu(u^{′}) and h_{I}.eCu(u) is a con-tinuous linear isometry preserving Hilbert–Schmidt norms (hsNormSq_conjE) and sending K_{u,u}′, 1_{u}, and P_{u,u}′ = KOf(D.s, u, u^{′}, Φ_{deg}) to Kmat(sOf(h_{F} ), u, u^{′}), 1, and KOf(sOf(h_{F} ), u, u^{′}, Φ_{C}). By absolute con-vergence (_{√}AbsConv), the indicator series ∑_{s} 1_{S}(s) a_{M}(s) converges unconditionally in operator norm (since ‖A‖_{op} ≤ dim‖A‖_{HS}, summable_ind_aM). Grouping the sum over the finite fibres of s →→s.toTerm (hF.fibFT) and applying the continuous linear transport tr(h_{F} .shBij(u), h_{F} .shBij(u^{′})) gives
Selectable PDF notation • transcription unchecked
( ∑ )
conjE(h_{I}, u, u^{′})(P_{u,u}′) = tr a_{M}(s)
Selectable PDF notation • transcription unchecked
s∈degSet
(conjE_Kpp). Because tr preserves Hilbert–Schmidt norms and hsEmb is a finite-dimensional linear isometry onto the Hilbert–Schmidt space (hsNormSq_tr, hsEmb_tsum), we obtain the first identity of (287). If every s ∈ degSet has hsEmb(a_{M}(s)) = 0, then a_{M}(s) = 0 (hsEmb_eq_zero), so every finite fibre sum vanishes and conjE(h_{I}, u, u^{′})(P_{u,u}′) = 0, giving P_{u,u}′ = 0 (kpp_zero). For the second identity, when a_{t} = 0 on degSet we have P_{u,u}′ = 0 and part(degSet) = 0; the third identity follows directly from the decomposition hsEmb(K) = tO_{u,u}.K = K_{0} + part(degSet) (valid by IdDegenerate, K_eq_parts), giving hsEmb(K −P − 1) = K_{0} −1_{u} and hence (287) (hsNormSq_off, hsNormSq_diag).
Source: Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/ThmSOwn.lean:118--380; Formal-ism/LocalToGlobal/SiegelLatticeTheory/ClosedVolumeStatements/FullExistsTiedHolds.lean:23--32; Formalism/LocalToGlobal/SiegelLatticeTheory/ClosedVolumeStatements/UnipotentInLevelSubgroup.lean:59--91; Formal-ism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/TheoremSConclusion.lean:84--93; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/FinXClosed.lean:26--28; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/WuDecayClosed.lean:27--55; CompanionTheory/AutomorphicTheory/LocalBesselUniqueness/BesselModels/MultiplicityOneUnitaryBranchingOfGapHyp.lean:8--12; CompanionTheory/HarishChandraModules/KFiniteAnalyticVectors/FundamentalDomainCusps/AutomorphicFormsFiniteDimensional.lean:13--28
We next establish the two exact algebraic and analytic pillars entering the main off-diagonal row es-timate: the constant-one cancellation of all intermediate mass and volume normalizations, and the sharp Euler-product bound for the top-level local representation density.
Lemma 8.140 (Mass–volume cancellation to constant one and Gram majorant). 1. Let B ∈ MassData(P)
be a finite-place mass–volume record (S3.MassData P) satisfying positivity (B.Pos) and the struc-tural volume identities MassDataHyp B, namely: Σ = ρ_{0} KV (InForm); KV ≤ supdens · n^{c}_{0}K_{top}V with 0 ≤ supdens ≤ e_{1} and K_{top}V ≥ 0; ρ_{0}n^{c}_{0} = AA := vol_{B}C_{∞}(MM/vol_{ZZ})/µ_{K} (InMass); c_{0}c_{0}^{′}K_{top}V ≤(1 + δ) Int_{N} with δ ≥0; Int_{N} ≤(vol_{ZZ}/U_{0})C_{∞}^{−1} deg^{−1} (InJacMod, InNu, InInfinity,
where U_{0} is the unit level volume); the local ratio product MM/U_{0} = (µ_{K}′′/(Γ_{1}µ_{S}′′µ^{′}_{S′′}))µ_{K} (InOrdinary, InTyped, InIndices); the column identities c^{−}_{0}^{1}= dµ_{S}′′/vol_{H,a} and (c^{′}_{0})^{−1} = d^{′}µ_{S}^{′}_{′′}/vol^{′}_{H,a} (InColumns, InLevelS, InMasses); the ambient volume identity vol_{B} = vol_{H,a}vol^{′}_{H,a}/vol_{G} (InVolumes); and D_{∗}= vol_{G} deg /µ_{K}′′. Then every intermediate volume cancels identically to constant one:
Selectable PDF notation • transcription unchecked
_{d d}′
Γ_{1}Σ ≤ (1 + δ) e_{1D∗}. (288)2. For every integer k ≥0 and real g ≥3,
Selectable PDF notation • transcription unchecked
∏k ( )_{3}
1 −g^{−i−1} ≤ 1 + . (289)
i=1^{g}Consequently, when the 2f split type primes P = TypX(X) divide equally into f places of residue cardinality∏ g_{1} ≥3 and f places of residue cardinality g_{2} ≥3, the Gram majorant satisfies P_{Gram} :=
Selectable PDF notation • transcription unchecked
_{p∈P}(1 + 3/g_{p}) = (1 + 3/g_{1})^{f}(1 + 3/g_{2})^{f}.Proof. For (1), since all positivity conditions hold (ρ_{0}, n^{c}_{0}, c_{0}, c_{0}^{′}, AA, vol_{ZZ}, U_{0}, C_{∞}, deg, Γ_{1}, µ_{K}, µ_{K}′′, µ_{S}′′, µ^{′}_{S′′}, vol_{H,a}, vol^{′}_{H,a}, vol_{G}> 0), chaining the displayed inequalities yields
Σ = ρ_{0} KV ≤ρ_{0} e_{1}n^{c}_{0}K_{top}V = e_{1} AA K_{top}V
_{1} (1 + δ) Int_{N0′−1} vol_{B} (MM/U_{0}) ≤e AA _{′} ≤(1 + δ) e_{1} (c_{0}c ) , c_{0}c_{0} µ_{K} deg
where vol_{ZZ} and C_{∞} cancel upon substituting the definition of AA and the upper bound on Int_{N} (form_signature_bound). Multiplying both sides by Γ_{1} > 0 and substituting the local ratio product, the two column identities, and the ambient volume identity gives
d^{′}µ^{′}_{S′′·} vol_{H,a}vol^{′}_{H,aµK}′′_{µK1d d}^{′}
Selectable PDF notation • transcription unchecked
Γ_{1}Σ ≤(1 + δ) e_{1} Γ_{1} ·^{dµS′′} · · · ,vol_{H,a} vol_{G} Γ µ ′′µ^{′} µ_{K} deg ^{= (1 + δ) e1} D vol^{′}_{H,a1SS′′}
Selectable PDF notation • transcription unchecked
∗
proving (288) (mass_formula_constant_one). ∏ For (2), since g ≥∑3 we have 0 < g^{−i}< 1 for every i ≥1. By induction on k, the elementary inequality ^{k}_{i=1}(1 −a_{i}) ≥1 −_{i}^{k}_{=1}a_{i} for a_{i} ∈[0, 1] gives
Selectable PDF notation • transcription unchecked
∏k ( ) ∑k_{g−1 g −2}
1 −g^{−i} ≥ 1 − g^{−i} > 1 −_{−1} = > 0.
i=1 i=1^{1 −gg −1}Taking reciprocals yields
Selectable PDF notation • transcription unchecked
∏k ( )_{g −11}
1 −g^{−i−1} ≤ = 1 + ≤ 1 + 3,
i=1^{g −2 g −2g}where the last step is equivalent to g ≤3(g−2), i.e. g ≥3. This proves (289) (t_GGNumeric). For a split type-prime set TypX(X), the bijection TypX(X) ≃{0, 1}×Inf(E) (exists_typ, massDataY_tt) partitions the 2f primes into two subsets of size f = |Inf(E)| with norms g_{1} and g_{2}, yielding the final product identity.
Source: Formalism/HermitianCurvature/MemParahoricTimesPrincipalCongruenceIff.lean:436--560; Formalism/HermitianCurvature/HermitianCurvatureProofs/LocalVolumePositivity.lean:140--208; Formalism/HermitianCurvature/StatementPB.lean:130--132; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/NuQPinExistsHolds.lean:32--55,99--130
Lemma 8.141 (Local representation densities and the unramified Euler-product bound). Assume k ≥2r_{S} + 2 + f + 5 and set n := k −2r_{S} −2 ≥f + 5 ≥2.
1. Let P be an index set of finite places of F with residue cardinalities q_{p} and residue characteristics ℓ_{p} (prime, ℓ_{p} ≤q_{p}), such that at most f places lie over any rational prime m. Then for every finite subset S ⊂P, ∑
Selectable PDF notation • transcription unchecked
q_{p}^{−n} ≤ 3f 2^{−n}. (290)
p∈S2. Consequently, if a nonnegative quantity sd satisfies the density hypothesis DensInput k rS f sd – meaning that every x < sd admits a finite subset S ⊂ P with x ≤ ∏_{p∈S} exp(4q_{p}^{−n}) – then e_{1} := max(sd, 1) satisfies
Selectable PDF notation • transcription unchecked
( )
1 ≤ e_{1} ≤ exp 12f 2^{−(k−2rS−2)} ≤ 2. (291)
3. For a tied datum D (LocTied D) and any pair u, u^{′} with T_{u} ≡T_{u}′ (mod g_{S}^{2}), at every finite place p the local representation density satisfies
Selectable PDF notation • transcription unchecked
α_{std}(E, 𝔭, r)dens_{p} = , 0 ≤c_{p} ≤2(r_{S} + 1),
Selectable PDF notation • transcription unchecked
α_{std}(E, 𝔭, k −1 −c_{p})where α∏_{std} is the standard unitary local density. The unramified normalization product α :=_{p}^{′} α_{p}(u, u^{′}) is strictly positive, and sd := supdens/α satisfies DensInput k rS f sd (densInputT_holds).
Proof. For (1), we first check by induction on M ≥0 that
Selectable PDF notation • transcription unchecked
M∑+2_{−231}
_{m=2}^{m≤} 4^{−}M + 2^{.}The base case M = 0 is equality 2^{−2}=^{3}_{4}−_{2}^{1}. For the step M →M + 1,
Selectable PDF notation • transcription unchecked
1_{−} 1_{−} 1_{ =} 1_{ > 0,}
M + 2 M + 3 (M + 3)^{2} (M + 2)(M + 3)^{2}so adding (M + 3)^{−2} to ^{3}_{4}−_{M}^{1}_{+2} gives at most ^{ 3}_{4}−_{M}^{1}_{+3} (sq_sum). For every integer m ≥2 and n ≥2, writing n = 2 + d with d ≥0 gives m^{−n}= m^{−2}m^{−d}≤m^{−2}2^{−d}= 4 · 2^{−n}m^{−2} (pow_bd). Grouping p ∈S by their residue characteristic ℓ_{p} ≥2 (each fiber having cardinality at most f) and setting M := max_{p∈S} ℓ_{p}, we obtain
Selectable PDF notation • transcription unchecked
∑ ∑ M∑+2 M∑+2_{3}
q_{p}^{−n}≤ ℓ^{−}_{p}^{n}≤f m^{−n}≤4f 2^{−n} m^{−2}≤4f 2^{−n}· = 3f 2^{−n},
p∈S p∈S m=2 m=2^{4 }proving (290) (densSum).
For (2), applying (290) to any finite S ⊂P yields
Selectable PDF notation • transcription unchecked
∏ ( ∑ ) ( )
exp(4q_{p}^{−n}) = exp 4 q_{p}^{−n} ≤ exp 12f 2^{−n} .
Selectable PDF notation • transcription unchecked
p∈S p∈S
If sd > exp(12f 2^{−n}), choosing x strictly between the two contradicts DensInput. Thus sd ≤ exp(12f 2^{−n}). Since n ≥f +5, we have f 2^{−f} ≤^{1}_{2} for all f ≥0 and therefore 12f 2^{−n} ≤12·2^{−5} ·(f 2^{−f}) ≤_{16}^{3} < log 2, giving exp(12f 2^{−n}) ≤2 and hence (291) (densChain).
For (3), at each finite place p, self-duality of the local lattice (LocSelfDual) and diagonaliza-tion of the local Gram block (GaPlusDiag) evaluate dens_{p} via local_density_corank as the ratio α_{std}(E, 𝔭, r)/α_{std}(E, 𝔭, k −1 −c_{p}) with corank c_{p} ≤ 2(r_{S} + 1), using LocTied D to match the lo-cal quadratic character η_{p} (densValAt_of, densProdValAt_of). Each unramified factor α_{p} = α_{p}(u, u^{′}) satisfies exp(−2q_{p}^{−n}) ≤ α_{p} ≤ exp(2q_{p}^{−n}) (alpBound_holds), so by (290) the series ∑_{p}| log α_{p}| is dominated by 2∑_{p}q_{p}^{−n}≤6f 2^{−n}< ∞; exponentiating gives α = exp(∑_{p} log α_{p}) > 0 (tprod_alpD_pos). The same ratio estimate bounds each local factor of dens_{p}/α_{p} by exp(4q_{p}^{−n}), establishing DensInput k rSf sd (densInputT_holds).
Source: Formalism/HermitianCurvature/HermitianCurvatureProofs/DensitySumsAndDomination.lean:150--260; Formalism/LocalToGlobal/SiegelLatticeTheory/CokernelGLCounts/RankPointCounts/DualFamilyCounting/DensAtD.lean:18--153; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/RowsSumCPf.lean:30--53
We now prove the core multi-level quadratic-form recursion engine (t_MainRow / pbApplied), which pro-duces the sharp generic-scalar bound A = (1 + δ)e_{1} feeding Proposition 8.88.
Proposition 8.142 (Multi-level quadratic-form recursion and the generic-scalar bound). Fix C_{4} ≥ 1 and C_{thr} ∈ℝ. There exist constants C_{A} ≥ max(C_{thr}, 1) and 0 ≤C ≤C_{A} such that for every C_{0} ≥1, C_{G} ≥0, C_{∆} > 4, c_{T} > 0, C_{b} > 0 with c_{T} C_{b} > 1, there exists k_{0} ∈ ℕ with the following property. Let E be an unramified CM extension of F (S6.Unram E), let D_{tb} ∈ TB.Data(E, W) be a tower datum instantiated from global size data G (J.Inst) satisfying LocalModel, RealInputs Dtb C4 jn Vt, DensInput G.k G.r G.f sd, RowsInput Dtb sd Vt c B, MassDataHyp B, and EnergyLink B jn sd C Th Dtb.r Dtb.f (so B.Int_{N} = j_{n}, B.e_{1} = max(sd, 1), and B.δ = C(r + 1)(C/Θ)^{f}). Assume G.k ≥ k_{0}, the size hypotheses J.SzHyp with threshold Θ > 0, and 16 ≤c_{Exp}(C_{∆}, c_{T} , C_{b}) C_{f} with C_{f} log b ≤G.f log G.k. Then
Selectable PDF notation • transcription unchecked
B.d B.d^{′} ( )B.Γ_{1} B.Σ ≤ (1+B.δ) B.e_{1} , 0 ≤B.δ ≤b^{−7}, 1 ≤B.e_{1} ≤ exp 12G.f 2^{−(G.k−2G.r−2)} .
Selectable PDF notation • transcription unchecked
B.D_{∗}
(292)Proof. We trace the five steps of t_MainRow.
Step 1: Local-to-global PSD theta domination (t_AxiomsOfLocalModel). By LocalModel, for each level i ∈ [0, r + 1] and finite point set Y ⊂ Pt(E), the arithmetic kernel D_{tb}.Kr_{i} factors over finitely many fi-nite places p as a diagonal scaling times a Hadamard product of block-diagonal local p-adic Gram kernels A_{5}.K_{p}(η_{p}(x), η_{p}(y)). By local positive semidefiniteness (jx_localKernelPSD), block-diagonal preservation (jx_blockDiagPSD), and the Schur product theorem (jx_schurProduct), D_{tb}.Kr_{i} is positive semidefinite on ev-ery finite Y (KrPSD). Likewise, at each level i ∈[1, r+1] and step s ∈[1, i], the local system sysOf(D_{tb}, i, s) factors into pullback, top, and outside local systems. Applying the local lattice-averaging theorem (lattice_average_induction, proved from single-block Parseval and Gauss-sum block diagonalization) to each local factor and combining by Schur products yields, for every tower T, a family of Hermitian PSD majorant kernels Θ_{i,s}(t; h, h^{′}) on T.X(i −s) which are periodic modulo the step lattice La(i −s + 1, s), dominate the level-i diagonal blocks Θ_{i,s}(t) ⪰ blk(Kr_{i}, s, t, t), and satisfy the sum bound
Selectable PDF notation • transcription unchecked
∑
Θ_{i,s}(t) ⪯ (1 + e_{i}) Kr_{i−s} on T.X(i −s)
Selectable PDF notation • transcription unchecked
t∈S
for every finite set S of distinct coset representatives modulo La(i−s+1, s), with e_{i} = 0 (DomAfter, KernelSupport).
Step 2: One-level quadratic-form recursion (OneLevelAfter). For a tower T, smoothing pa-rameter ε > 0, level i, and derivative word w within budget cnt(w) ≤ 4K(r + 1 − i), set
Selectable PDF notation • transcription unchecked
√
Q(T, ε, i, w) := wt(w)^{−1} Re ∑_{p,q∈T.X(i)} Kr_{i}(p, q) gram(ε, i, w, p, q), and let σ(j) bound Q(T, ε, j, w) uniformly over budget-admissible words for j < i. Partition T.X(i) by the last step size s ∈{1, . . . , i}. For s = 1, off-diagonal pairs t ̸= t^{′} are restricted by KernelSupport to t^{−1} −t^{′−1} ∈ Lap(i, 1) (and vanish identically at the top level i = r + 1), while diagonal pairs t = t^{′} are dominated by the La(i, 1)-periodic PSD majorant Θ_{i,1}(t). Summing over t in each coset via the Poisson summation step (PoissonStep, discharged from PoissonInput) and applying the Fourier decay bound EstWave over the dual lat-tice Lad√ (i) together with the lattice-sum estimate LatticeSums(ϵ_{lat}) bounds the s = 1 contribution by (1 + 3^{f}ϵ_{lat})(1 + 2^{f}ϵ_{lat})(1 + e_{i}) σ(i −√1). For 2 ≤s ≤i, the block-energy bound EstBlock(C_{4}) and lift
Selectable PDF notation • transcription unchecked
∏
bound EstLift yield the contribution (1 + 3^{f}ϵ_{lat})(1 + e_{i})C_{4}^{fss}_{s}^{−}′_{=1}^{1} vol(i −s + 1, s^{′}) σ(i −s). By the triangle inequality in the weighted Hilbert space,
Selectable PDF notation • transcription unchecked
√ √ ∑i √
Q(T, ε, i, w) ≤ (1 + 3^{f}ϵ_{lat})(1 + 2^{f}ϵ_{lat})(1 + e_{i}) σ(i−1)+ (1 + 3^{f}ϵ_{lat})(1 + e_{i})C_{4}^{fs}V_{i,s} σ(i−s),
^{s=2} (293)where V_{i,s} :=∏^{s}_{s}^{−}′_{=1}^{1} vol(i −s + 1, s^{′}).
Step 3: Geometric closure and top-level density scaling (TC.TheoremAAfter, TC.RecursionWithDens). From the size hypotheses J.SzHyp and J.Inst, the instantiated lattice-sum theorem (jx_instLatticeSums) pro-duces constants C_{1} ≥1 and ϵ_{lat} = (C_{1}Θ^{−(K−5/2)})^{f} (with K = 4 from J.Inst), while the size-to-recursion transfer (sz_sizesMain, jx_sizesToRecursion) ensures Θ ≥C^{′}, r(|C|/Θ)^{f} ≤1, and |C|(r +1)(|C|/Θ)^{f} ≤ b^{−7} for all G.k ≥k_{0} (with c_{Exp} = min((C_{∆}−4)/2, (c_{T} C_{b} −1)/4) and 16 ≤c_{Exp}C_{f}, C_{f} log b ≤f log k). Iterating (293) from level 0 (where Q(T, ε, 0, w) ≤ j_{n} by EstE jn) to level r + 1, passing to the limit ε∑ → 0 via Cutoff Vt, and scaling the top-level kernel by max(sd, 1) via RowsInput (which dominates
_{ρ∈R}c(ρ, p)c(ρ, q) by sd · Kr_{r+1}(p, q)) yields, for every finite set R ⊂ℕ,
Selectable PDF notation • transcription unchecked
∑‖‖‖∑ ‖‖‖2 ( )
c(ρ, p) V_{t}(p) ≤ 1 + B.δ B.e_{1} B.Int_{N}. (294)
Selectable PDF notation • transcription unchecked
ρ∈R p
Here 0 ≤ B.δ = |C|(r + 1)(|C|/Θ)^{f} ≤ b^{−7}, and Lemma 8.141(2) gives 1 ≤ B.e_{1} = max(sd, 1) ≤ exp(12G.f 2^{−(G.k−2G.r−2)}) ≤2.
Step 4: Mass–volume closure. Applying the fourth clause of RowsInput to (294) yields B.c_{0}B.c^{′}_{0}B.KV ≤ (1 + B.δ) B.e_{1} B.n_{0}^{c}B.Int_{N}. Substituting into Lemma 8.140(1) (jx_formGivesMain, mass_formula_constant_one) cancels every intermediate volume factor and proves (292).
Source: Formalism/HermitianCurvature/HermitianCurvatureProofs/GrowthOfBasic.lean:980--1185; Formalism/HermitianCurvature/HermitianCurvatureProofs/SecondDerivativeHolds.lean:13--75; Formalism/HermitianCurvature/HermitianCurvatureProofs/GermExpansionMatrixFunction.lean:1282; Formalism/HermitianCurvature/HermitianCurvatureProofs/RecursionWithDensities.lean:1122--1162; Formalism/HermitianCurvature/HermitianCurvatureProofs/SixteenMulLeTwoPow.lean:11--140; Formalism/HermitianCurvature/StatementTC.lean:72--99; Formalism/HermitianCurvature/StatementTB.lean:125--170; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/TheoremS.lean:19--49
Next we discharge all 19 concrete hypotheses of theoremS_closedP on a selected realization T ∈ STies(D).
Proposition 8.143 (Discharge of the carrier, row-form, and mass-data hypotheses). Assume the convergent unitary Siegel–Weil formula (Fact 4.101, supplying SWXS via swxs_of_siegelWeil) and the corank-one non-generic bound RowNGP (proved from the same Siegel–Weil input in Proposition 8.144 below). Then all 19 hy-potheses of TheoremSClosedHypotheses (Formalism.L2.SG.TheoremSConclusion.TheoremSClosedHypotheses) hold unconditionally:
1. Local model, density, and top-level PSD domination (LocalModelAt, DensInputAt, RowsInputP): At each finite place p, Haar-scaling compatibility (mod_{K} = mod^{2}_{F}) and local different-unit pinning (modK_alg, delta_unit) realize the arithmetic kernel d_{Of}(S, δ, M, u, u^{′}) as a LocalModel (localModelAt_holds). Lemma 8.141(3) gives DensInputAt. For any row labeling κ and finite point set Y , factoring out the diagonal weight matrix D_{φ} = diag(φ_{i}) conjugates (sd/α) Kr_{rS+1} − rowKer to
Selectable PDF notation • transcription unchecked
D_{φ}^{∗}((sd/α) K_{top} −∑ĉ_{ρ}ĉ^{∗}_{ρ})D_{φ} ⪰ 0, (295)
ρwhich is positive semidefinite by fiberwise comparison against the local density supremum (rowsDomAtP_of, NormProd_holds, CutLeavesDeep_outright).
2. Archimedean compact-test carrier (CarrierP): Using the dense K-finite vectors (KFinDenseMain), local Bessel multiplicity one (UniqGap), and Theorem 8.138 (besselNVG), for each archimedean place j the test matrix coefficient f_{j}(g) = ⟨a_{j}, σ_{j}(P_{j}gQ_{j})b_{j}⟩(c_{j} ξ_{j} ⊗ξ_{j}^{′∗}) with K-finite smooth vectors a_{j}, b_{j} and nonvanishing Bessel pairing ⟨Ba_{j}, ξ_{j}⟩⟨ξ_{j}^{′}, B^{′}b_{j}⟩̸= 0 satisfies the orbital-integral proportionality OrbInt(f_{j}, γ) = κ_{j}A_{j}.J(γ) with κ_{j} ̸= 0 (ampVec_genG) and the exact Capelli infinitesimal-character eigenidentity
Selectable PDF notation • transcription unchecked
( ) (∏ )
capelli_{H} u_{C}(Y ), f_{j} (g) = (Y + λ_{s}) f_{j}(g) (296)
Selectable PDF notation • transcription unchecked
s
(coefCap_carrierInT_own). Combined with the compact-model carrier bounds (carrierNeedsFromD, lemma_model), this supplies CarrierP with uniform constants C_{4} ≥1 and C_{A,0} (carrierP_of_compact_model, GlobalTheory.CarrierGap.carrierP).
3. Auxiliary choices, row-sum, row-form, mass-data, link, and split identities (ChoicesC, FormulaC, RowsSumC, RowFormAllP, MassDataHypAll, LinkAll, SplitAll): Pinned quotient Haar measures ν_{q} (nuQPinExists_holds), a nondegenerate Gram tuple X_{0}, local Hermitian spaces L_{sp}, DVR uniformizers ϖ_{p}, row labels κ, and real point representatives exist unconditionally (choicesC_holds). Local frame dual-ity and unramified binary Hermitian representation (HermRepUnram) give FormulaC (formulaCT_holds). Combining FormulaC, ∏^{′}_{p}α_{p} > 0 (Lemma 8.141(3)), finiteness of lattice automorphism groups, Witt extension, and chart-determined generic volumes (volume_determined) gives RowsSumC (rowsSumC_of). Vector independence VIndepAtAllP (via the joint compact-test tensor vIndepAtAllP_ofG) and positivity of the normalizing constants from CovolRef_outright, GaugeVolUD, RhsWLim, and SWXS (normalizing_constants_all) discharge RowFormAllP (rowFormAllP_of). Finally, SWXS, locFramePrim, realObj_inInfinityX_jsz, prodConvAll_holds, typedAll_holds, and Lemma 8.140(2) discharge MassDataHypAll, LinkAll, and SplitAll (massDataInputsAll_of, linkAll_holds, splitAll_holds).
Proof. Each of the 19 components of TheoremSClosedHypotheses is assembled in GlobalTheory.CarrierGap.theoremS_leaves_of_carrierG: h1=localModelAt_holds, h2=densInputT_holds, h3=rowsInputP_of_dataCut applied to NormProd_holds and CutLeavesDeep_outright (producing (295) by conjugation with D_{φ}), h4=hNG, h5=KppOffC_holds (proved in Proposition 8.145(1) below), h6=carrierP (constructed from ampVec_genG, coefCap_carrierInT_own giving (296), carrierNeedsFromD, and xLeavesP_of_pinsPG), h7=kExpTiedS_holds, h8–h10 from Proposition 8.139(1), h11=finXC_of and h12=wuDecayOfGap_of_uniqGap from Proposi-tion 8.139(1), h13=choicesC_holds, h14=formulaCT_holds, h15=rowsSum_of_formula_volume, h16=rowFormAllP_of with vIndepAtAllP_ofG and normalizing_constants_all, h17=massDataInputsAll_of, h18=linkAll_holds, and h19=splitAll_holds. In LinkAll and SplitAll, the Gram-matrix bound GGBound(P_{Gram}) with P = (1 + 3/g )^{f}(1 + 3/g )^{f} comes from Lemma 8.140(2), row orthogonality and positive corank
Gram 1 2 hold by rowOrth and corankPos_tO, and off-diagonal identity vanishing IdZero follows from idCellOffC_holds_of_vol (idZero_tO). All nine typeclass facts invoked in OffK0Closed.lean are unconditionally proved instances (FactsDS, FactsCC, FactsGV, HermRepUnram, KFinDenseMain, RhsWLimOfLeaves).
Source: Development/AbelianVarietyTheory/Proofs/FlagMeasures/OffK0Closed.lean:30--120,580--672; Formal-ism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/TheoremSClosedP.lean:204--255; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/TheoremSRecursion.lean:28--186; Formalism/LocalToGlobal/SiegelLatticeTheory/CokernelGLCounts/RankPointCounts/LocModelKSD.lean:19--120; Formalism/LocalToGlobal/SiegelLatticeTheory/CokernelGLCounts/RankPointCounts/RowsInputPOfTermsFiniteSig.lean:67--120; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/NuQPinExistsHolds.lean:32--201; Formalism/LocalToGlobal/SiegelLatticeTheory/CokernelGLCounts/RankPointCounts/DualFamilyCounting/NormalizingConstantPositiveAll.lean:28--73; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/MassDataPosAllOf.lean:67--80; Formalism/LocalToGlobal/SiegelLatticeTheory/WeightedGaugeFactors/FactsCC.lean:15--88; Formalism/LocalToGlobal/SiegelLatticeTheory/WeightedGaugeFactors/FactsDS.lean:16--40; Formalism/LocalToGlobal/SiegelLatticeTheory/WeightedGaugeFactors/FactsGV.lean:6; Development/AbelianVarietyTheory/Proofs/FlagMeasures/SwxsOfSiegelWeil.lean:8--10
We now establish the remaining three row-pair counting bounds required by both the off-diagonal ker-nel estimate (ClOff) and the diagonal non-degenerate estimate (ClDiag): the big-corank and nonscalar loop bounds, the corank-one non-generic bound, and the equal-word generic-scalar bound.
Proposition 8.144 (Same-realization loop, corank-one non-generic, and equal-word bounds). Assume the convergent unitary Siegel–Weil formula (Fact 4.101, supplying SWXS and MassRatioUnderVolume). Set m := 2r_{S} + 2, L := log b, and d_{u,u}′ := d_{u}d_{u}′/D_{∗}.
1. Loop bounds for big-corank and nonscalar pairs (LoopRowS): Along any selected realization sel of a family class 𝒞 satisfying TuSize (with twist selection TSel), for all sufficiently large family threshold constants and all x ≥x_{0} (uniform in i), every pair of words u, u^{′} satisfies
Selectable PDF notation • transcription unchecked
( 1 )
RowBig(ε_{L}, d_{u,u}′) and RowNotScalar(ε_{L}, d_{u,u}′), ε_{L} := exp −_{3}kf log k . (297)
2. Corank-one non-generic bound (RowNGP): There exists C_{4} ≥ 0 (depending only on the outer family constants) such that for all sufficiently large C^{′}, C_{ℓ} and every tied D satisfying Hyp0, Stand, ConcTie, and AbsConv,
Selectable PDF notation • transcription unchecked
( )
RowNG(ε_{NG}, d_{u,u}′), ε_{NG} := 2^{−(k−2rS−5)} exp C_{4}m^{5}fL . (298)
3. Equal-word generic-scalar bound (RowMainEqP): There exists C_{B} ≥ 0 (depending only on the outer family constants and A) such that for all sufficiently large C^{′}, C_{ℓ} and every tied D and word u satis-fying Cnt.Hyp for (u, u), ConcTie, and AbsConv,
Selectable PDF notation • transcription unchecked
( )
RowMain(γ_{B}, d_{u,u}), γ_{B} := exp C_{B}m^{5}fL .
Proof. For (1), by GapClosed.gapEv_closed_of (LinkSGap.gapRowT) the class 𝒞 eventually satisfies GapHyp (specifically, when C^{′}≥29 and C_{ℓ}≥16, k ≥C^{′}m^{5}fL ≥29·32·16 > 1801 and every archimedean gap is at least C_{ℓ}r^{19}f^{5}L ≥16r^{19}, gap_hypothesis_of_hypotheses). Passing to the raised family where both FinX and WuDecay hold (LoopRowSF.hyFG), the unconditional discrete-series pointwise coefficient bound (discreteSeriesCoef_pointwiseBound_unconditional) and Bessel uniqueness (bessel_multiplicity_one_large_gap_and_whittaker_bessel) yield the local and term loop data LoopLocDat and LoopTermDat (LoopRowSF.BG, LoopRowSF.MG), which together with the Siegel–Weil rank/frame bounds (ranks_and_frame_of_tied_class) pro-duce the three lattice-sum bounds RowsND, RowsDeg, and RowsOne on the pair set PP = big(nzSet)∪nsc(genSet). By Cauchy–Schwarz (pairAbs_le_ampSum), this supplies PB.LoopsInput with amplitude majorant
Selectable PDF notation • transcription unchecked
(^{ k}∑ ∑^{k6} ( )kf/2)A ndRow_{s} + Γ^{2} degRow_{s} + C^{f}H_{big}^{Cm3}Γe^{CmfL} Cg^{−(2rS+1)}k^{−rS} d_{u,u}′.
Selectable PDF notation • transcription unchecked
s=2 s=2
In t_LoopsJoint (GrowthOfBasic.lean:1191--1228), the three summands inside the parentheses are each bounded by exp(−kf log k/2) once C^{′} ≥ K_{0} and 6 log(3A) ≤ kf log k, so multiplying by 3A absorbs into exp(−kf log k/3) = ε_{L}. Monotonicity of pairAbs under subset inclusion (PB.SubFamily, rowLoops_of_input) separates PP into big(nzSet) and nsc(genSet), proving (297) (loop_evaluation_threshold_zero, loopRows_of_rowsFinDim).
For (2), each corank-one non-generic pair fails to be generic at a nonempty subset A ⊆Ω of bad finite places, where the local weighted amplitude square satisfies the local saving
Selectable PDF notation • transcription unchecked
∑w_{p}(d) |a_{N}(p, d)|^{2} ≤ H_{p}^{C1(rS+1)2}q_{p}^{−(k−2rS−5)}n_{p}
d(PN.LocalNG.NGAt) with q_{p} ≥2, while the local mass-to-generic ratio satisfies n_{p} ≤8H_{p}^{C0(rS+1)2+2m}n_{gen,p} (PN.LocalNG.MassRatioAt) via SWXS (swxs_of_siegelWeil). Since A ̸= ∅, the product over p ∈A saves at least one factor 2^{−(k−2rS−5)}, while the frame-passage identity (PN.FramePassage, PN.NormRe) converts the remaining archimedean point sum (analytic_pinnedTheoremB_uniform, bounded by exp(C_{B}^{′} m^{5}fL) I_{re}) and finite-place height products into exp(C_{4}m^{5}fL) d_{u,u}′. This proves (298) (rowNGP_of_siegelWeil).
For (3), for equal words u = u^{′} the generic scalar pairs are bounded without requiring the sharp (1+b^{−7}) saving of Proposition 8.142: the same PN.NGChain mass–frame comparison with SWXS (genericFamilyStep_of_siegelWeil) and the global archimedean point-sum bound bDat_theoremB_global yield the coarse expo-nential factor γ_{B} = exp(C_{B}m^{5}fL) (equalWordGenericBound_of_normalisedSteps, rowMainEqP_of_siegelWeil).
Source: Development/AbelianVarietyTheory/Proofs/FlagMeasures/LoopRowOfFiniteDim.lean:27--32; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/LoopRowSF.lean:21--120; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/LoopRowSB.lean:21--102; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/LoopRowSOf.lean:126--160; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/LoopEvaluationThresholdZero.lean:44--100; Formalism/LocalToGlobal/SiegelLatticeTheory/CokernelGLCounts/RowsOther.lean:85--160; Formalism/HermitianCurvature/HermitianCurvatureProofs/GrowthOfBasic.lean:1191--1228; Formalism/HermitianCurvature/StatementPN.lean:16--119; Development/AbelianVarietyTheory/Proofs/FlagMeasures/RowPositivityOfSiegelWeil.lean:10--16; Development/AbelianVarietyTheory/Proofs/FlagMeasures/RowMainEqPOfSiegelWeil.lean:10--17
We now establish the three companion kernel bounds – off-diagonal degenerate vanishing (ClKppOff), diagonal degenerate decay (ClKppDiag), and the diagonal non-degenerate estimate (ClDiag).
Proposition 8.145 (Degenerate vanishing, diagonal degenerate decay, and diagonal kernel bound). Let D be tied, T ∈ STies(D) satisfy STiesOK, and assume KTwoHypotheses (and, for (3), Cnt.Hyp for (u, u) together with the Siegel–Weil input of Proposition 8.144).
1. Off-diagonal degenerate vanishing (ClKppOff): For all sufficiently large C^{′}, C_{ℓ} and all distinct words u ̸= u^{′}, every term t ∈ degSet of tO_{u,u}′ has a_{t} = 0, and therefore P_{u,u}′ = 0.
2. Diagonal degenerate decay (ClKppDiag): For all sufficiently large C^{′}, C_{ℓ} and every word u,
‖P_{u,u}‖_{HS}^{2} ≤ d_{u} exp(−kf log k).
3. Diagonal non-degenerate bound (ClDiag): Let C_{4}, C_{B} ≥0 be the constants of Proposition 8.144(2)– (3). Whenever c_{Γ} ≥ max(C_{B}, C_{4}) + 1, g_{1}, g_{2} ≥ 3, and C^{′}, C_{ℓ} are sufficiently large, every word u satisfies
Selectable PDF notation • transcription unchecked
d^{2}‖K_{u,u} −P_{u,u} −1‖^{2}_{HS} ≤ Γ^{u}, Γ = exp(c_{Γ}m^{5}fL).
Selectable PDF notation • transcription unchecked
D_{∗}Proof. For (1), let t ∈ degSet for u ̸= u^{′}, so t is not an identity term and its Gram invariant vanishes (G(t) = 0). If t is not relevant, the character on the cocompact unipotent quotient inside its stabilizer is nontrivial (nonRelCharC_holds), so averaging over the cocompact subgroup vanishes (AvgCore_holds, LemmaVC_holds) and forces a_{t} = 0. If t is relevant with G(t) = 0, every element h in the infinite-place point-wise stabilizer decomposes as h = kn with n ∈ R_{set}(t) and k normalizing R_{set}(t) inside a compact subgroup (FixedDecomposition, realized by unitary block matrices U(k) ⊂ U(H_{ε})). For distinct words u ̸= u^{′}, the corresponding lowest-K-type parameters are distinct (DistinctWordsDistinctParameters), so Schur orthogonality on the compact factor combined with cocompact unipotent averaging forces the co-variant representative – and hence a_{t} – to vanish (covariantRepZero_of_lemmaV, schurNFC, KppOffC_holds).
Proposition 8.139(2) (kpp_zero) then gives P_{u,u}′ = 0.
For (2), let u be a word and consider tO_{u,u} on degSet. By Lemma 8.86 applied to the degenerate set (kppDiag_of_pairs) and Cauchy–Schwarz (pairsDeg_of_amp),
Selectable PDF notation • transcription unchecked
∑
‖P_{u,u}‖_{HS}^{2} = ‖tO_{u,u}.part(degSet)‖^{2} ≤P_{Gram}Γ_{1} ‖v_{t1}‖‖v_{t2}‖.
Selectable PDF notation • transcription unchecked
(t_{1},t_{2})∈allPairs(degSet)Since g_{j} ≥(kb)^{8}, b ≥2, k ≥1, and f ≤k, we have (kb)^{7}≥2^{7}= 128, hence g_{j} ≥256k ≥12f, so (1 + 3/g_{j})^{f} ≤ exp(3f/g_{j}) ≤e^{1/4} and therefore P_{Gram} ≤e^{1/4}·e^{1/4}= e^{1/2}≤2 (exp_quarter_mul_exp_quarter_le_two, pgLeC_of). Partitioning relevant degenerate terms by their rank j ∈[1, r_{S}] and leading-minor label δ = (δ_{0}, . . . , δ_{j}) (where δ_{0} = 1 and each δ_{l} is integral over ℤ by minorInt_conc), the unconditional type esti-mate rowsPos_typeP (from bessel_multiplicity_one_large_gap_and_whittaker_bessel) bounds each term amplitude by k_{2a}(j, δ) k_{2e}(j, δ) with C_{s} ≥ C_{p} + 4. Because ∆_{j}(δ) ≤ H_{b}(C) S_{j}(δ)^{2} (DelC_holds), mul-tiplying the two factors cancels the ∆_{j}(δ)^{k/2} powers and leaves S_{j}(δ)^{j+1+(Cp−Cs)k} ≤S_{j}(δ)^{−3rS} (label_sum∑). Summing S_{j}(δ)^{−3rS} over support subsets S ⊆[1, j] (cosets_sum_gen, kloostermanCosetSum_le) gives
_{δ}S_{j}(δ)^{−3rS} ≤ H_{b}(C_{c})^{CcrS}. Grouping the pair sum over (j^{′}, j^{′′}) ∈ [1, r_{S}]^{2} and using the dimension identity Γ_{1} mass_{C}(Y, u) d_{π}(X, u) ≤d_{u} (kappa_off_diagonal_dim_form_C) yields
Selectable PDF notation • transcription unchecked
(∑r_{S} )_{2}‖P_{u,u}‖^{2}_{HS} ≤ 2 d_{u} k_{2,A1}(C, C_{h}, C_{c}, j) ≤ 2 d_{u} k_{2,B}(C_{f}) ≤ d_{u} exp(−kf log k), (299)
Selectable PDF notation • transcription unchecked
j=1
where the final inequality (final_bound_closes) holds as soon as C_{ℓ}≥k_{2,C0}(C_{f}) using C_{ℓ}m^{6}L ≤k log k from KTwoHypotheses (pairs_degree_bound, kernel_diagonal_positive).
For (3), by Proposition 8.139(2) (hsNormSq_diag), ‖K_{u,u} −P_{u,u} −1‖^{2}_{HS} = ‖K_{0} −1_{u}‖^{2}. Because tO_{u,u}.part(idSet) = 1_{u} (idOneC_holds), the diagonal specialization of Lemma 8.86 (diag_of_abstract) ap-plied with the three bounds of Proposition 8.144 gives
Selectable PDF notation • transcription unchecked
(√ √ )_{2 d}2
‖K_{0} −1_{u}‖^{2} ≤ P_{Gram}(γ_{B} + 2ε_{L}) + P_{Gram}(ε_{L} + ε_{NG})_{D}^{u}_{∗}.Set t := m^{5}fL and M := max(C_{B}, C_{4}) ≥0. Since m ≥2, L > 1, and f ≥1, we have t ≥32f. Moreover g_{1}, g_{2} ≥ 3 implies 1 + 3/g_{j} ≤ 2 and hence P_{Gram} ≤ 4^{f}; also γ_{B} = e^{CBt} ≤ e^{Mt}, ε_{L} ≤ 1 ≤ e^{Mt}, and ε_{NG} = 2^{−(k−2rS−5)}e^{C4t}≤e^{Mt}. Using (^{√}x +^{√}y)^{2}≤2(x + y) and 40 ≤e^{32} (since e^{32}> 2^{32}> 40), we conclude
Selectable PDF notation • transcription unchecked
(√ √ )2
^{P}Gram^{(γ}B^{ + 2ε}L^{) +P}Gram^{(ε}L^{ + ε}NG^{)≤2P}Gram^{(γ}B^{ + 3ε}L^{ + ε}NG^{)}
Selectable PDF notation • transcription unchecked
≤2 · 4^{f}· 5e^{Mt}= 10 · 4^{f}e^{Mt}≤40^{f}e^{Mt}
≤e^{32f}e^{Mt}≤e^{t}e^{Mt}= e^{(M+1)t}≤e^{cΓt}= Γ, (300)which is diagNumC_holds and proves (3) (diagonal_positive_final).
Source: Formalism/LocalToGlobal/SiegelLatticeTheory/ClosedVolumeStatements/FullExistsTiedHolds.lean:36--41; Formalism/LocalToGlobal/SiegelLatticeTheory/CokernelGLCounts/RankPointCounts/KppOffCOfSteps.lean:36--64; Formalism/LocalToGlobal/SiegelLatticeTheory/CokernelGLCounts/RankPointCounts/FixedDecomposition.lean:20--160; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RowsPos.lean:95--246; Formalism/LocalToGlobal/SiegelLatticeTheory/CokernelGLCounts/RankPointCounts/KloostermanTermANonneg.lean:20--160; Formalism/LocalToGlobal/SiegelLatticeTheory/CokernelGLCounts/RankPointCounts/KloostermanCosetSumLe.lean:19--160; Formalism/LocalToGlobal/SiegelLatticeTheory/CokernelGLCounts/RankPointCounts/ExpQuarterMulExpQuarterLeTwo.lean:28--77; Formalism/LocalToGlobal/SiegelLatticeTheory/CokernelGLCounts/RankPointCounts/MainEqCut.lean:530--604; Development/AbelianVarietyTheory/Proofs/FlagMeasures/RowsPosTypeP.lean:9--10
Finally, we assemble the complete off-diagonal theorem theoremS_closedP together with Proposi-tions 8.139–8.145 to obtain all four kernel bounds (236) on the same selected realization with uniform family thresholds.
Theorem 8.146 (Same-realization four-kernel estimates and resulting uniform spectral link). Assume the convergent unitary Siegel–Weil formula (Fact 4.101). Let 𝒜 be a family class with selected realization sel, selS on 𝒞 := D_{3}(3, 𝒜) satisfying local tie compatibility (locTied), volume-signature independence and class-item compatibility (hInstR), and TuSize. Then the following hold uniformly in the family-threshold sense (Closed):
1. Pointwise off-diagonal bound (theoremS_closedP): There exist constants C_{4} ≥ 1, C_{A} ≥ 1, 0 ≤ C ≤ C_{A}, and for each admissible tuple (C_{0}, C_{G}, C_{∆}, c_{T} , C_{b}) a threshold k_{0} and for each (C_{g}, c_{b}, C_{w}, c_{Tf}, C_{T} , C_{0f}) constants C_{n} ≥0 and C_{0}^{′}, C_{ℓ,0} such that whenever C^{′} ≥C_{0}^{′}, C_{ℓ} ≥C_{ℓ,0}, and a tied realization T ∈ STies(D) satisfies SizesAt, Hyp0, Stand, KTwoHypotheses, GapHyp, LocTied, TFrameAt, and the loop bounds RowBig(ε_{L}, d_{u,u}′) and RowNotScalar(ε_{L}, d_{u,u}′) for u ̸= u^{′}, we have
Selectable PDF notation • transcription unchecked
‖(T.Y.tO(u, u^{′})).K_{0}‖^{2} ≤ (1 + b^{−6})^{ d}_{D}^{ud}_{∗}^{u′}.2. Uniform four-kernel estimates on the selected realization: With C_{0} = 3, for every family Fm ∈𝒞 whose constants exceed one finite supremum of threshold functions depending only on outer and middle family constants (in particular c_{Γ} ≥ max(C_{B}, C_{4}) + 1, C^{′} ≥ max(29, C_{0}^{′}, . . . ), C_{ℓ} ≥ max(40, C_{ℓ,0}, . . . )), there exists a single threshold x_{0}, independent of the index i and of the words u, u^{′}, such that for all x ≥x_{0}, every i ∈ Fm.Ix(x) in the selected dimension window (235), and all words u, u^{′}, the four kernel bounds hold on the same realization T = (selS)(x, i):
Selectable PDF notation • transcription unchecked
P_{u,u}′ = 0 (u ̸= u^{′}),‖P_{u,u}‖_{HS}^{2} ≤d_{u} exp(−kf log k),
Selectable PDF notation • transcription unchecked
‖K_{u,u}′ −P_{u,u}′‖^{2}_{HS}≤(1 + b^{−6})^{ d}_{D}^{udu′} (u ̸= u^{′}), (301)
_{ d}2^{∗}
‖K_{u,u} −P_{u,u} −1‖^{2}_{HS}≤Γ_{D}^{u}_{∗}.3. Passage to LinkS: If in addition the selected family satisfies the automorphic all-row count CountAllPointsClass PLevT' (supplying (237), tracked separately from the kernel bounds), then Propo-sition 8.85 applies on the same selected realization and yields LinkS Fm 3 (GlobalTheory.Top.link_alt_alt_bis).
Proof. For (1), Proposition 8.143 discharges all 19 parameters of theoremS_closedP (theoremS_leaves_of_carrierG). Given the hypotheses at (D, L, T, u, u^{′}), theoremS_closedP unpacks SizesAt to obtain (e, τ, C_{p}, Θ, C_{f}) with Θ > 0, invokes FinXC and WuDecayOfGap to build ConcTie T.X T.Y, selects auxiliary data (i_{0}, i^{′}_{0}, ν_{q}, X_{0}, L_{sp}, ϖ, κ, Q) via ChoicesC, deduces g_{1}, g_{2} ≥ 3 from PB.SizeNumbers (since k ≥ 32, b ≥16 gives kb ≥512, so g_{j} ≥(kb)^{8} ≥3), establishes AbsConv via Proposition 8.139(1) and degenerate vanishing part(degSet) = 0 via Proposition 8.145(1), constructs the archimedean carrier via CarrierP (theoremS_rec3P), supplies RowNG via Proposition 8.144(2) (theoremS_rec2P), and calls theoremS_rec → pbApplied → t_PairBoundFromLocal. By Proposition 8.142 (t_MainRow), the generic-scalar sum satisfies Γ_{1}Σ ≤ (1 + δ)e_{1}d_{u}d_{u}′/D_{∗} with 0 ≤ δ ≤ b^{−7} and 1 ≤ e_{1} ≤ exp(12f · 2^{−(k−2rS−2)}). Together with P = (1 + 3/g )^{f}(1 + 3/g )^{f} (Lemma 8.140(2)), RowBig, RowNotScalar, RowNG, and SizeNumbers, all Gram 1 2 hypotheses of Proposition 8.88 (t_PairBound) are satisfied, proving ‖K_{0}‖^{2}≤(1 + b^{−6})d_{u}d_{u}′/D_{∗} (theoremS_closedP, theoremS_of_conj).
For (2), take C_{0} = 3, C_{∆}= 5, c_{T} =^{1}_{2}, C_{b} = 3 (so C_{∆}> 4 and c_{T} C_{b} =^{ 3}_{2} > 1), and C_{g} = CYL + 1, c_{b} =^{1}_{4}, C_{w} = 3, c_{Tf} =^{ 1}_{2}, C_{T} = CTu. From the Siegel–Weil input, bothRowsFromSiegelWeil produces RanksRow 3 and TFrame uniformly on 𝒞, while SzHypFam (using FactsFD for the formal-degree Vandermonde identity DsigHC and ThresholdLevels.thrRow_holds) upgrades RanksRow 3 to SizesRowS 3 (uniform SizesAt) and Sizes3b with a_{Sz} = e^{3/4}·3e ≥1 once C_{ℓ}≥40. Proposition 8.144(1) yields LoopRowS 3 on the exact same selection (AtChoice.at_choice), and ResidEvFree.residEv_closed_free supplies residual eventuality ResidEv. Applying offDiagonalK0_of_rows to (1) with C^{′}, C_{ℓ}≥ max(29, . . . ) yields TheoremSSelected Fm 3 (OffK0Closed.offDiag), which via hypOwnS_off and Proposition 8.139(2) gives the third bound of (301). On the same selection SelOK, hypOwnE_kppOff, hypOwnE_kppDiagP, and hypOwnL_diagP apply Proposition 8.145(1)–(3) to produce the first, second, and fourth bounds of (301). Because Closed is closed under finite conjunction via supremum of threshold records (K.sup, closed_with), all four bounds hold simultaneously past one uniform threshold x_{0} = max(x_{1}, x_{2}, x_{3}, x_{4}) chosen before i and before u, u^{′}.
For (3), the selected realization T = (selS)(x, i) together with hInstR produces the matched automorphic row tie CountE.RowsTieP PLevT' (rowsTiePT'_of). Combining this with the external row-count input CountAllPointsClass PLevT' yields CountOwn (countOwn_of_rowsPEv), i.e. (237). Applying theoremS_transport_link_zero → theoremS_link_concrete → linkS_of_standing_hypotheses (Proposition 8.85) concludes LinkS Fm 3.
Source: Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/TheoremSClosedP.lean:20--320; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/TheoremSConclusion.lean:58--94; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/SpectralTiesReal.lean:147--286; For-malism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/LinkSFinalP.lean:18--142; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/LinkSPos.lean:17--162; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/ThmSOwn.lean:414--730; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/SzHypFam.lean:20--138; Formalism/LocalToGlobal/SiegelLatticeTheory/WeightedGaugeFactors/FactsFD.lean:15--100; Development/AbelianVarietyTheory/Proofs/FlagMeasures/OffK0Closed.lean:633--684; Development/AbelianVarietyTheory/Proofs/FlagMeasures/AtChoice.lean:15--29; Development/AbelianVarietyTheory/Proofs/FlagMeasures/RanksFramesOfSiegelWeil.lean:13--17; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/LinkAltAltBis.lean:16--48