Section 8.20 · PDF pages 651–661
Quantitative Fock no-kernel criterion and local-to-global family link
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
8.20 Quantitative Fock no-kernel criterion and local-to-global family link
We now reconstruct the quantitative Fock no-kernel supplier (TraceSpectra.stmtE and Formalism.L2.G.loc_proved) and the resulting local-to-global family link LinkG (link_of_local_closed, linkG_concrete5, and GlobalTheory.Top.closed_linkG_of_duty), which discharge item (vii) of Proposition 8.37 from the selected group-compatibility data and ChosenE.
Unramified quadratic setting and local operator rank. Fix a prime p ≥5, an even integer n^{′}≥2, and m ≥0. An unramified quadratic setting (W, ℚ_{q}, O, K_{f}, ι, σ, j, w) (UnramifiedQuadraticSetting) consists of:
(a) a complete discrete valuation ring W with fraction field ℚ_{q}, uniformizer p ∈ W, residue cardinality
|W/(p)| = p^{n′}, and an automorphism σ ∈ Aut(ℚ_{q}) of period σ^{n′}= 1 lifting Frobenius on W (σ(x) − x^{p}∈pW for x ∈W);
(b) a complete discrete valuation ring O with fraction field K_{f}, a finite ring homomorphism j : W →O
compatible with a field embedding ι : ℚ_{q} ↪→ K_{f}, and a uniformizer w ∈ O with w^{2} = p, residue cardinality |O/(w)| = p^{2n′}, and the property that every integer z ∈ℤ is a square in O.
For k = m + 1, a W-lattice L ⊂ ℚ^{k}_{q} is the W-column span of a matrix g ∈ GL_{k}(ℚ_{q}). An r-edge e = (L_{src}, L_{tgt}) (IsEdge) is a pair of W-lattices satisfying pL_{tgt} ⊆L_{src} ⊆L_{tgt} and |L_{tgt}/L_{src}| = p^{n′r}. Given a dominant weight tuple λ_{0} : Fin n^{′}→ Fin(m + 1) →ℤ (antitone in the second index), set
Selectable PDF notation • transcription unchecked
{ ∑λ_{0}(s, i), s even, ∑
Selectable PDF notation • transcription unchecked
λ_{at}(s, i) := ν(λ)_{t} := λ_{t} −λ_{m} ∈ℕ, A_{r}(λ_{0}) := λ_{at}(s, i).−λ_{0}(s, m −i), s odd,
Selectable PDF notation • transcription unchecked
⊗ s∈Fin n^{′}i<rLet V_{sp}(K_{f}, λ_{0}) :=_{s∈Fin n}′ ∇_{Kf}(ν(λ_{at}(s))) be the tensor product of dual Weyl modules (in-side the polynomial ring in n^{′}(m + 1)^{2} variables), of dimension d_{V} := dim_{Kf} V_{sp}(K_{f}, λ_{0}). For a W-lattice L, write ext_{O}(σ^{s}L) := O · (ι ∘ σ^{s})(L) ⊂ K_{f}^{k} and define the integral tensor lattice H_{L} := V_{sp}(K_{f}, λ_{0}) ∩H_{ten}(O, λ_{0}, (ext_{O}(σ^{s}L))_{s}). For an r-edge e = (L_{src}, L_{tgt}), form the intermediate lattices L_{e,s} := ext_{O}(σ^{s}L_{src}) + w^{−1} ext_{O}(σ^{s}(pL_{tgt})), the rescaled edge lattices R_{e} := w^{−Ar(λ0)}H_{Le} ⊂V_{sp} and R_{e}^{′} := w^{−Ar(λ0)}H_{L}^{∨}_{e}⊂V^{ ∗}_{sp}, and the rescaled pairing b_{e}(F, G) := G(p^{Ar(λ0)}F). For t ∈ℕ, set
Selectable PDF notation • transcription unchecked
N_{src}(t, L^{′′}) := w^{−t}H_{L}′′ ∩ ∩ R_{e}, N_{tgt}(t, L) := w^{−t}H_{L}^{∨}∩ ∩ R_{e}^{′}.
e_{e.} an_{src} r_{=}-edge_{L′′} e an_{e.tgt} r-edge_{=L}We say that the quantitative local rank condition LP^{′}(p, n^{′}, r, λ_{0}, t, D, κ, c^{∗}) (LPprime) holds if 4(D+1) ≤c^{∗} and for every W-lattice L ⊂ℚ^{m}_{q}^{+1} there exist M ∈ℕ, r-edges e_{1}, . . . , e_{M} with e_{i}.tgt = L, and elements F_{i} ∈N_{src}(t, e_{i}.src) such that:
(i) F_{i} ∈w^{c∗}R_{e}′ whenever e^{′} is an r-edge with e^{′}.src = e_{i}.src and e^{′}̸= e_{i};
(ii) there exist an integer n ≥ (1 −κ)d_{V} , an O-linear map u : O^{n} → N_{tgt}(t, L), and a matrix B ∈
M_{n×M}(O) satisfying
Selectable PDF notation • transcription unchecked
∑M
B_{j,i} b_{ei}(F_{i}, u(x)) = p^{D}x_{j} for all x ∈O^{n}, 1 ≤j ≤n. (314)
Selectable PDF notation • transcription unchecked
i=1
Twisted Laurent valuations and Frobenius digit extraction. Let K_{f} be a field, n ≥1, and LL a letter al-phabet on ι assigning to each letter i ∈ι a boolean parity LL.vec(i) ∈{true, false} (vector vs. covector). Let GLCoord(K_{f}, n) := K_{f}[X_{a,b}]_{a,b∈Fin n}[det(X)^{−1}] and GLLaurent(K_{f}, n) := GLCoord(K_{f}, n)[T, T^{−1}]. For j ∈ Fin n and k ∈ℤ, form the generic diagonal-conjugate matrix
M_{tw}(j, k) := g_{L} diag(T^{kδa,j})_{a∈Fin n}g_{L}^{−1}∈M_{n}(GLLaurent(K_{f}, n)),
where g_{L} = (X_{a,b}). Given S ⊆ ι, the twisted substitution twistSub_{LL,S,j} : K_{f}[ι × Fin n] → GLLaurent(K_{f}, n)[ι × Fin n] is the ring homomorphism acting as the canonical scalar map on K_{f} and on variables by
Selectable PDF notation • transcription unchecked
{∑⎪{_{b∈Fin n}M_{tw}(j, 1)_{b,a} X_{(i,b)}, i ∈S, LL.vec(i) = true,
Selectable PDF notation • transcription unchecked
∑
X_{(i,a)} −−→_{b∈Fin n}M_{tw}(j, −1)_{a,b} X_{(i,b)}, i ∈S, LL.vec(i) = false,
Selectable PDF notation • transcription unchecked
⎪{X_{(i,a)}, i /∈S.The twisted Laurent valuation val_{S}(LL, S, G) ∈ ℤ ∪{∞} (valS) is the minimum exponent k ∈ ℤ of T appearing with nonzero coefficient in any monomial coefficient of twistSub_{LL,S,n−1}(G) (with val_{S}(0) = ∞). For any predicate∑ Q : (ι →ℕ) → Prop, write filt_{Q}(F) for the sum of monomials of F whose ι-multidegree δ(i) =_{a}µ(i, a) satisfies Q(δ).
Lemma 8.153 (Valuation monotonicity under substitution, filtering, and digit extraction). Let K_{f} be a field and n ≥1.
(i) (TraceSpectra.valAeval) Let S, L ⊆ι, S^{′}⊆κ, f : ι →κ, and g : ι×Fin n →K_{f}[κ×Fin n]. Suppose F ∈ K_{f}[ι × Fin n] is supported on variables with first coordinate in L, and for every v = (v_{1}, v_{2}) with v_{1} ∈L: if v_{1} ∈S, then g(v) = X_{(f(v1),v2)} with f(v_{1}) ∈S^{′} and LL^{′}.vec(f(v_{1})) = LL.vec(v_{1}); if v_{1} /∈S, then g(v) is supported on variables with first coordinate outside S^{′}. Then
val_{S}(LL, S, F) ≤ val_{S}(LL^{′}, S^{′}, aeval_{g}(F)).
(ii) (TraceSpectra.valFilt) For any multidegree predicate Q : (ι →ℕ) → Prop and any F ∈K_{f}[ι ×
Fin n], val_{S}(LL, S, F) ≤ val_{S}(LL, S, filt_{Q}(F)).
(iii) (LetterSubstitution.phMon, compPh, fdigPh, fdigSum) Let Dt be signed chain data over a discrete
valuation ring O with fraction field K = Frac(O), parameters (p, r, J), model letters ML, target letters TL, and positive weights P(j, m) > 0. The Frobenius-power substitution Dt.ph sends each monomial cX^{M} to cX^{phExp(M)}, where phExp multiplies weight-chain exponents by P(j, m) and leaves light/label/top exponents unscaled; multidegree projection compD_{d} satisfies
Selectable PDF notation • transcription unchecked
( ) ( )
compD_{d} cX^{β}· Dt.ph(F) = cX^{β}· Dt.ph filt_{Qβ,d}(F) , (315)
where Q_{β,d}(δ) is the condition multideg(β) + phDeg(δ) = d; and the P-adic digit-extraction map Dt.Fdig_{ρ} is additive and satisfies, for every F supported on light and weight-chain letters (IsLW),
Selectable PDF notation • transcription unchecked
( ) {cXliftMon^{(β)}· F, if Dt.digOK(ρ, β), Dt.Fdig_{ρ} cX^{β}· Dt.ph(F) = (316) 0, otherwise.
Proof. For (i), let θ_{g} : GLLaurent(K_{f}, n)[ι × Fin n] → GLLaurent(K_{f}, n)[κ × Fin n] be the GLLaurent(K_{f}, n)-algebra map sending X_{v} →→g(v). We verify the commutation identity
Selectable PDF notation • transcription unchecked
( )
twistSub_{LL}′_{,S}′_{,j}(aeval_{g}(F)) = θ_{g} twistSub_{LL,S,j}(F) (317)
by checking equality of the two ring homomorphisms on K_{f} and on all generators X_{v} with v_{1} ∈L (twist_aeval). If v_{1} ∈S, both sides send X_{v} to ∑_{b}M_{tw}(j, ±1)_{∗,∗}X_{(f(v1),b)} with the same sign because f(v_{1}) ∈ S^{′} and LL^{′}.vec(f(v_{1})) = LL.vec(v_{1}). If v_{1} /∈ S, then twistSub_{LL,S,j}(X_{v}) = X_{v}, so the right-hand side is g(v) with coefficients embedded into GLLaurent(K_{f}, n); since g(v) uses only variables outside S^{′}, twistSub_{LL}′_{,S}′_{,j} fixes every variable in g(v) and hence matches the right-hand side. Now let ℱ_{t} be the additive filtration of polynomials whose coefficients in GLLaurent(K_{f}, n) are supported in Laurent de-grees ≥ t. Because θ_{g} acts as the identity on GLLaurent(K_{f}, n) and maps each X_{v} into degree-0 Lau-rent scalars times monomials, θ_{g}(ℱ_{t}) ⊆ℱ_{t} (thetaG_mem). Since t ≤ val_{S}(LL, S, F) is equivalent to twistSub_{LL,S,n−1}(F) ∈ℱ_{t}, (317) immediately implies val_{S}(LL, S, F) ≤ val_{S}(LL^{′}, S^{′}, aeval_{g}(F)).
For (ii), grouping the support of F by its ι-multidegree gives filt_{Q}(F) =∑_{δ:Q(δ)} homComp_{δ}(F), where the sum runs over the finite set of occurring multidegrees satisfying Q. Because twistSub_{LL,S,n−1} preserves the ι-multidegree of every monomial, the set of Laurent degrees occurring in homComp_{δ}(F) is a subset of those occurring in F (sDegs_polComp_subset), so val_{S}(LL, S, F) ≤ val_{S}(LL, S, homComp_{δ}(F)) for every δ. By ultrametric superadditivity of val_{S} on finite sums (valS_sum_ge), the same lower bound holds for filt_{Q}(F).
For (iii), Dt.ph(X_{v}) = X_{phV}^{w(v}_{(}^{)}_{v)} with w(v) = P(j, m) on weight-chain letters and w(v) = 1 otherwise;
induction on the exponent support gives Dt.ph(cX^{M}) = cX^{phExp(M)}. Since multideg(β + phExp(M)) = multideg(β) + phDeg(multideg(M)), applying compD_{d} termwise yields (315). Additivity of Dt.Fdig_{ρ} follows by rewriting the support sum over F.support ∪ G.support. Finally, if F is supported on light and weight-chain letters, every monomial M in F.support vanishes on label and top letters, so at every target coordinate (j, m, a) the shift phExp(M)(j, m, a) = P(j, m) M(wc(j, m), a) is a multiple of P(j, m) > 0. Hence adding phExp(M) leaves residues modulo P(j, m) invariant (so Dt.digOK(ρ, β + phExp(M)) ⇐⇒ Dt.digOK(ρ, β)) and increases the quotient ⌊·/P(j, m)⌋ by exactly M(wc(j, m), a) (so liftMon(β + phExp(M)) = liftMon(β) + M). Summing over M ∈F.support gives (316).
Source: Formalism/SharpRestriction/GrowthBounds/ObjPol.lean:75--130; Formalism/SharpRestriction/GrowthBounds/AevalValuation/PlDefs.lean:14--89; Formalism/SharpRestriction/GrowthBounds/AevalValuation/ValGen.lean:13--170; Formalism/SharpRestriction/GrowthBounds/MonomialSupport/PhMonomialMul.lean:16--268
Proposition 8.154 (Signed-chain valuation transfer, TraceSpectra.stmtE, and loc_proved). Let p be prime, n^{′}, r, K ≥ 1 with n^{′} even and m + 1 = r + K, O a discrete valuation ring with fraction field K_{0} of characteristic zero, Fr a valid frame system of period J ≥2, and Dt signed chain data tied to Fr. Suppose A_{i} ∈O[ℤ×Fin r] (0 ≤i < J) is supported on Fr.letters(i) and satisfies the twisted-valuation lower bounds val_{S}(LZ, {y < u_{j,i}}, A_{seg(j)}) ≥ t(j, i). Then for every label monomial l, plane-even monomial γ, target multidegree d_{Pl}, digit profile ρ^{′}, and chain index (j, i),
Selectable PDF notation • transcription unchecked
( )
val_{S} Dt.modelLet, Dt.chainML(j, i), Dt.Fdig_{ρ}′(compD_{dPl}(levP(z_{Pl}))) ≥ t(j, i). (318)
Consequently, for every design D ∈D_{7}:
(i) the closed-form local-operator theorem tableLineDegreeFive.ClosedFormOfAdmitted holds uncondi-tionally (TraceSpectra.stmtE);
(ii) the restricted local criterion SecondTheoremReduced holds unconditionally, establishing Formalism.L2.
G.loc_proved (Loc).
Proof. Set Π :=∏_{j}′_{∈ℤ/Jℤ}χ_{j}′(A_{seg(j}′_{)}). By the lifting factorization (restTr), levP(z_{Pl}) = X^{b} · Dt.ph(Π) where b vanishes at every odd-parity light letter (Dt.sgn(j, l) = false). Applying (315) gives
compD_{dPl}(levP(z_{Pl})) = X^{b}· Dt.ph(Π^{′}), Π^{′}:= filt_{Qb,dPl}(Π).
Fix (j, i) and set T := ⌈t(j, i)⌉∈ℤ. The geometric tie between Fr and Dt shows that on Fr.letters(seg(j)), the condition y < u_{j,i} is equivalent to mlOf(j, y) ∈ Dt.chainML(j, i) with matching letter parities (geo_chain), while for j^{′} ̸= j every letter of Fr.letters(seg(j^{′})) maps outside Dt.chainML(j, i) (chi_out). Ap-plying Lemma 8.153(i) to χ_{j} gives val_{S}(Dt.modelLet, Dt.chainML(j, i), χ_{j}(A_{seg(j)})) ≥ T, while the re-maining factors j^{′} ̸= j are supported outside Dt.chainML(j, i) and therefore have val_{S} ≥ 0 (LetterSubstitution.valNN). By superadditivity of val_{S} on products (flt_valS_mul_ge) and Lemma 8.153(ii), we obtain val_{S}(Dt.modelLet, Dt.chainML(j, i), Π^{′}) ≥T.
Next, let w be the set of label letters ML.lab(j^{′}, m^{′}). By definition of Dt.chainML(j, i) (which contains only weight-chain letters at j −1 and light letters at j of index < i), w is disjoint from Dt.chainML(j, i). Furthermore, Π^{′} has no top letters (mlOf_ne_tp). Decomposing Π^{′}=∑_{M}X^{M} ·wCoeff_{w}(M, Π^{′}) according to the w-projection M of each monomial, each factor wCoeff_{w}(M, Π^{′}) is supported exclusively on light and weight-chain letters (IsLW) and satisfies val_{S}(Dt.modelLet, Dt.chainML(j, i), wCoeff_{w}(M, Π^{′})) ≥ T (valS_wCoeff_of_disj). Applying Dt.ph, multiplying by X^{b}, and applying Dt.Fdig_{ρ}′ via Lemma 8.153(iii) turns the M-th summand into either 0 or XliftMon^{(b+phExp(M))}· wCoeff_{w}(M, Π^{′}). In the nonzero case, every
liftMon(b+phExp(M)) variable of X lying in Dt.chainML(j, i) has even parity: weight-chain letters always have parity true, and at any light letter with Dt.sgn(j, l) = false both b and M vanish, so the exponent is 0. Hence val_{S} ≥0 on the monomial prefactor by valNN, giving val_{S} ≥0 + T = T on each summand and therefore on the sum (chain_core, restChain_of), proving (318).
Combining (318) (TraceSpectra.restChain) with the companion link estimate PairMembershipBlocks.restLink gives RestPl. Applying operator-step filtration (restWord_of_steps), monomial membership (restMEM_of_last), and the quantitative Fock Gram valuation bound Proposition5Numerics.proposition5_holds (with explicit constants (26, 2, 24, 60)) yields tableLineDegreeFive.ClosedFormOfAdmitted (TraceSpectra.stmtE). In the core valuation step (value_core), splitting the normalized Fock pairing of a primitive polyno-mial G against the assembled test polynomial asm(Dt.ph(G_{p}), N_{0}) as
Selectable PDF notation • transcription unchecked
( ) ( ) ([ ] )
f G, asm(Dt.ph(G ), N ) = k B F , Dt.ph(G +R) + f (G, asm(Dt.ph(G +R), N ))−k B (F , Dt.ph(G +R)) −f (G, asm(Dt.ph(R), N )) fock p 0 0 form 2 p fock p 0 0 form 2 p fock 0
shows that the main term has p-adic valuation at most 2v_{p}(∏_{s}d_{s}!) + (C_{Dn} + C_{Dm}) large_{2} while the approximation error and the remainder R both have strictly larger p-adic valuation whenever (C_{Dn} + 3C_{Dm}) large_{2} < c_{P} , forcing the ultrametric triangle inequality to bound the normalized Fock pairing from below in p-adic norm. Finally, criterion_restricted_of_closed forgets the two extra existential clauses in SecondTheoremReduced to yield Formalism.L2.G.loc_proved.
Source: Formalism/SharpRestriction/GrowthBounds/AevalValuation/MemSupportedOf.lean:73--335; Formalism/SharpRestriction/GrowthBounds/AevalValuation.lean:9--14; Formalism/SharpRestriction/GrowthBounds/PlaneCoefficients.lean:28--61; Formalism/SharpRestriction/GrowthBounds/DiagonalSupport/Proposition5OfThree
Parts.lean:61--110; Formalism/SharpRestriction/GrowthBounds/DiagonalSupport.lean:13--17; Formalism/SharpRestriction/GrowthBounds/PlaneCountTheoremWithConstants.lean:1020--1027; Formalism/LocalToGlobal/GroupLattices/AdmissibleFamilyNoKernel.lean:36--38,284--285
Extremal projector tools and the two uniform local rank theorems. To turn loc_proved into uniform quantitative bounds across both small-prime (p < p_{0}(k)) and intermediate-prime (p_{0}(k) ≤p < X^{′}) regimes, the source assembles three unconditional local packages: ExtremalProjectorTools, Loc6, and Loc8.
Proposition 8.155 (Extremal projector, local model packages, and uniform local rank Theorems II and I). The following hold unconditionally (independently of the ambient design D):
(i) Extremal projector (extremal_projector_tools_of_loc, ExtremalProjector.extremal_projector_statement): For any finite-dimensional 𝔤𝔩_{n}-representation V over a field K of characteristic zero, any weight µ : Fin n →ℤ with µ_{a} −µ_{b} + b −a ≥1 for all a < b, any normal ordering of positive roots, and any truncation T ≥ dim_{K} V , the truncated extremal projector p(µ; T) preserves the µ-weight space V [µ], annihilates V [µ] ∩𝔫_{−}V , and acts as the identity on highest-weight vectors in V [µ]. Consequently (tool_statements_hold), all integral invariant-projection, ∇/∆-comparison, isotypic-projector denominator p^{N0(n)de}, filtered-projector, and hyperplane-rank bounds hold.
(ii) Uniform Theorem II (small primes p < p_{0}(k)) (second_theorem_absolute_constant, second_theorem_
closed_form): There exists an absolute constant C_{0} ≥ 0 such that for every unramified quadratic setting with p ≥ 13, r ≥ 2, good orbit TT ⊂ Fin n^{′} satisfying the orbit, gap, size, and dominant base-weight hypotheses of tableLineDegreeFive.ConclusionE, and every integer t ≥t_{II}(C_{0}),
Selectable PDF notation • transcription unchecked
)
LP^{′}(p, n^{′}, r, λ_{0}, t, D_{p}, C_{0}|TT|r^{2}(m + 1)/Y, c^{∗}
Selectable PDF notation • transcription unchecked
(
holds, where t_{II}(C) := Cr|TT| CN_{1}^{2}a log a/(pk) + ap^{−L1} + c_{0} + kp^{G′})+ 2rn^{′}c_{pp}. Hence on any family class 𝒞, SecondTheoremAtFamily is closed (Closed).
(iii) Uniform Theorem I (intermediate primes p_{0}(k) ≤ p < X^{′}) (first_theorem_threshold_functions,
first_theorem_closed_form): There exist an absolute threshold T_{0} > 0 and functions T_{2}, C : ℝ → ℝ_{>0} such that for all C_{0} ≥T_{0}, C_{H} ≥T_{2}(C_{0}), and all parameters satisfying flipOneThree.HypI, there exists a nonnegative box function κ : (TT →ℤ) × (TT →ℤ) →ℝ_{≥0} with box average
meanKap(κ) ≤ C(C_{0}) |TT| N_{1}/Y
such that for every unramified quadratic setting, every dominant base weight λ_{0} with box parameters (a_{w}, b_{w}), and every integer t ≥t_{I}(C_{0}, C(C_{0})),
Selectable PDF notation • transcription unchecked
)
LP^{′}(p, n^{′}, 1, λ_{0}, t, D_{p}, κ(a_{w}|_{TT} , b_{w}|_{TT} ), c^{∗}
holds, where
Selectable PDF notation • transcription unchecked
∑ ( a_{w}(y_{prev}(y))) ( a b^{′}_{I}a_{I}b^{′}) ( )t_{I}(C_{0}, C) := min b_{w}(y), +C|TT|N_{12} + +Λ +Λ +C|TT| Qc+kQ+k log_{p} a+c_{cl} +2n^{′}c_{cl}.
Selectable PDF notation • transcription unchecked
_{y∈TT} p^{dprev(y)} p p pk k
y oddHence on any family class 𝒞, FirstTheoremAtFamily is closed (Closed).
Proof. For (i), each individual root factor p_{ab}(µ; T) is built from divided powers E_{ba}^{k}E_{ab}^{k}/(k! ∏) and shifts weights by k(α_{ba} + α_{ab}) = 0, hence preserves V [µ]. Using the disjoint-root commutation relation (restComm) and the three-root Yang–Baxter relation (restYB, proved inductively by ybat_base and ybat_symm), any two normal orderings of the positive roots are connected by swap and braid moves that leave the composite operator unchanged on V [µ] (pp_step). Placing a given simple root (i, i + 1) leftmost in a normal order-ing shows E_{i,i+1}p(µ; T)x = 0 (raising_operators_kill_image), whence extremal_projector_statement. Combining this with the integral-form weight, exponent, and positivity identities gives tool_statements_hold.
For (ii), local_model_results fills every field of Loc6 from Proposition 8.154(ii) together with proved representation-theoretic and arithmetic inputs: rational-plane counting (( ) SelectionLemmas.Pf.secondPartClosed using the Gaussian binomial lower bound ^{k}_{rq} ≥ q^{r(k−r)} in rational_planes_count), the Weyl dimension, branching, and Pieri count rules (JointsLit), dual-height inclusions, perfect pairing, flatness, spanning, and integral-section product closure (DualInclusionLattices, LoBlockActComp, LetterWtAnti, MulMemRiemannRochSpaceAdd, TestSideFinal), the Witt identity (WittIdentPI), and p-adic Mahler unit decay (adm22). In second_theorem_closed_everywhere, these supply the plane-count constants (plane_count_theorem_with_constants), source-cleaning constants (derived_statements_with_constants), and split-gram constants (split_theorem_with_constants), which feed loc_proved to yield an absolute constant C_{0} > 0. Because tableLineDegreeFive.ConclusionE does not depend on D, second_theorem_absolute_constant lifts C_{0} uniformly over all D ∈D_{7}. Imposing the constant lower bound C_{0} on the middle and last design constants yields second_theorem_closed_form.
For (iii), local_flatness_results fills Loc8 from the Hermitian-tensor pairing theorem (flipOneThree.Pf.theorem_I_closed_form_holds), the Fock Gram minimal-vector window theorem (GramWindowAlt.theorem_A_closed_form_holds), the extended column-window theorem (ColumnSystems.Pf.extendedClosedForm), Cartan multiplication surjectivity/domain bounds (Cartan), flatness (flatHH), branching/Weyl dual-weight admissibility, saturated restriction dimensions, and residue-division transfer. Joining Loc6 and Loc8 via loc8All_of and taking maxima of nested parameter thresholds (thresholds_and, first_theorem_admitted_closed) feeds theorem_I_closed_form_holds to produce uniform thresholds T_{0} > 0 and functions T_{2}(C_{0}), C(C_{0}) > 0 independent of D (first_theorem_uniform_thresholds, first_theorem_threshold_functions). In first_theorem_closed_form, requiring T_{0} on the middle design constants (so T_{0} ≤ Λ_{G}) and max_{c∈cout∪cmid} max(2T_{2}(c), 2C(c)) on the last design constants (lmax) ensures T_{2}(Λ_{G}) ≤ k_{I}, D_{I}, 2T_{2}(Λ_{G}) ≤ρ, 2C(Λ_{G}) ≤κ_{th,1}, and C(Λ_{G}) ≤κ_{th,2}, yielding FirstTheoremAtFamily.
Source: Formalism/SharpRestriction/GrowthBounds/TruncatedChains.lean:13--20; Formalism/SharpRestriction/GrowthBounds/TruncatedChains/RaisingKillOfInterface.lean:15--184; Formalism/SharpRestriction/GrowthBounds/TableLineDegreeFive.lean:17--52,242--248; Formalism/SharpRestriction/GrowthBounds/ProjectionLemmaBaseLevel.lean:26--92; Formalism/SharpRestriction/GrowthBounds/PlaneCountTheoremWithConstants.lean:1005--1341,1740--1781; Formalism/LocalToGlobal/GroupLattices/AdmissibleFamilyNoKernel.lean:40--75
Weyl sandwich, invariant-factor shift, and ramified lattice length. The bridge from the local rank con-dition LP^{′} at served Frobenius orbits to the global lattice-length bound at a place w of residue characteristic p is a purely algebraic DVR invariant-factor argument.
Lemma 8.156 (Weyl sandwich, invariant-factor shift, and saturated ramified-lattice length). Let O be a discrete valuation ring with uniformizer ϖ, let p ∈O \ {0} with e_{p} := length_{O}(O/(p)), and let M ⊆M_{na} be O-submodules of a K_{f}-vector space X with M_{na} finitely generated and torsion-free over O, satisfying the sandwich
Selectable PDF notation • transcription unchecked
p^{e}M_{na} ⊆ M ⊆ M_{na} (319)for some e ∈ℕ. Let d := rank_{O}(M) and d_{na} := rank_{O}(M_{na}). Let VV be a finite index set, m ≥1, {y_{v}}_{v∈VV} pairwise commuting O-linear endomorphisms of X preserving both M_{na} and M, and S_{v} ∈ℕ with S_{v} ≤S for all v ∈ VV. For any O-submodule B ⊆X, define the product ideal
Selectable PDF notation • transcription unchecked
{ (∏ ) } ∑prodIdeal(B) := span_{O} p^{E(A)} y_{v}^{m} x : A ⊆ VV, x ∈B , E(A) := S_{v}.
Selectable PDF notation • transcription unchecked
v∈A v∈VV\A
Suppose κ : VV →ℝ_{≥0} satisfies Σ := m∑_{v∈VV}κ_{v} ≤1/2, and suppose that for every β ∈ℕ there exists a finite set C_{β} ⊆ M_{na} of size |C_{β}| ≤⌊d_{na}m^{β+1}e_{β+1}(κ)⌋ (where e_{j}(κ) is the j-th elementary symmetric polynomial) such that
p^{τ0+βS}M_{na} ⊆ prodIdeal(M_{na}) + span_{O}(C_{β}). (320)
Let V_{ram} ⊆X be an O-submodule such that M_{ram} := M ∩V_{ram} is saturated in M (i.e., px ∈M_{ram} with x ∈ M implies x ∈ M_{ram}), and put τ := e + τ_{0}. Then for any O-submodule NP_{f} ⊆ X containing prodIdeal(M), setting NP := NP_{f} ∩p^{τ}M ∩V_{ram}, we have
NP ⊆ p^{τ}M_{ram} and length_{O}(M_{ram}/NP) ≤ e_{p} d (τ + 2SΣ). (321)
Proof. Multiplication by p^{e} injects M_{na} into M by (319), so d_{na} ≤d (dna_le_d), and M is finite and free of rank d over the PID O. Put N_{na} := prodIdeal(M_{na}) ⊆ M_{na} and N := prodIdeal(M) ⊆ M. Since p^{e}M_{na} ⊆M and y_{v} is O-linear, p^{e}N_{na} ⊆N (prodIdeal_shift).
We first transfer (320) from (M_{na}, N_{na}) to (M, N) (invariant_factors_submodule, inverse_shift). Fix β ∈ℕ and set E_{β} := τ_{0}+βS and M^{′}:= M +N_{na} ⊆M_{na}. Consider the O-linear map f : O^{Cβ} →M_{na}/N_{na}
Selectable PDF notation • transcription unchecked
_{p}Eβgiven by a →→∑_{c∈Cβ}a_{c} (c + N_{na}), the image W := im(M^{′}−−→M_{na}/N_{na}), and U := f^{−1}(W) ⊆O^{Cβ}. Because O is a PID, U is free of rank n ≤|C_{β}|; choosing an O-basis b_{1}, . . . , b_{n} of U and lifts m_{i} ∈M^{′} with p^{Eβ}m_{i} ≡ f(b_{i}) (mod N_{na}) gives a subset C_{β}^{′} = {m_{1}, . . . , m_{n}} ⊆ M^{′} of size ≤|C_{β}| such that p^{Eβ}M^{′} ⊆ N_{na} + span_{O}(C_{β}^{′}). Multiplying by p^{e} on M ⊆ M^{′} and using p^{e}N_{na} ⊆ N ⊆ M shows that C_{β}^{′′}:= p^{e}C_{β}^{′} ⊆M has size ≤|C_{β}| and satisfies
p^{τ+βS}M ⊆ N + span_{O}(C_{β}^{′′}). (322)
Next, expanding (∑_{v∈VV}κ_{v})^{β+1} with κ_{v} ≥0 shows that each (β + 1)-subset product appears (β + 1)! times, so m^{β+1}e_{β+1}(κ) ≤Σ^{β+1}/(β + 1)! ≤Σ^{β+1}. Combined with d_{na} ≤d, this gives |C_{β}^{′′}| ≤d Σ^{β+1} for
all β ∈ℕ. Moreover, taking A = ∅ in the definition of N yields p^{E(∅)}M ⊆N, and E(∅) ≤|VV| · S, so
Selectable PDF notation • transcription unchecked
p^{|VV|·S}M ⊆N.Now apply Smith normal form over the DVR O to N ⊆ M: there exist an O-basis u_{1}, . . . , u_{d} of M and exponents q_{1}, . . . , q_{d} ∈ ℕ such that N = ⊕^{d}_{i=1}ϖ^{qi}Ou_{i}, with q_{i} ≤ e_{p}|VV| · S for all i. Since
Selectable PDF notation • transcription unchecked
⊕
p^{τ}M =_{i}^{d}_{=1}ϖ^{epτ}Ou_{i}, the intersection N ∩p^{τ}M = ⊕^{d}_{i=1}ϖ^{max(qi,epτ)}Ou_{i} satisfies
Selectable PDF notation • transcription unchecked
( ) ∑d ∑d
length_{O} M/(N ∩p^{τ}M) = max(q_{i}, e_{p}τ) = e_{p}dτ + (q_{i} −e_{p}τ)_{+}.
Selectable PDF notation • transcription unchecked
i=1 i=1
For each β ∈{0, . . . , |VV|−1}, (322) implies that the quotient (p^{τ+βS}M+N)/N^{∼}=⊕_{i:qi>ep(τ+βS)}O/(ϖ^{qi−ep(τ+βS)}) is generated over O by the image of C_{β}^{′′}; reducing modulo ϖ bounds the number of nontrivial cyclic sum-mands by #{i : q_{i} > e_{p}(τ + βS)} ≤|C_{β}^{′′}| ≤dΣ^{β+1}. If S = 0, then q_{i} = 0 ≤e_{p}τ for all i. If S ≥1, then since q_{i} ≤e_{p}|VV| · S ≤e_{p}(τ + |VV| · S), counting how many thresholds e_{p}(τ + βS) (0 ≤β < |VV|) fall
strictly below q_{i} gives (q_{i} −e_{p}τ)_{+} ≤e_{p}S · #{β < |VV| : q_{i} > e_{p}(τ + βS)}. Summing over i = 1, . . . , d and using 0 ≤Σ ≤1/2 yields (lengthFromAllBut)
Selectable PDF notation • transcription unchecked
∑d |VV∑|−1_{Σ}
(q_{i} −e_{p}τ)_{+} ≤ e_{p}S dΣ^{β+1} ≤ e_{p}Sd ≤ 2e_{p}SdΣ,
i=1( ) β=0^{1 −Σ}and therefore length_{O} M/(N ∩p^{τ}M) ≤e_{p}d(τ + 2SΣ).
Finally, saturation of M_{ram} = M ∩V_{ram} in M gives p^{τ}M ∩V_{ram} ⊆p^{τ}M_{ram}, proving the first assertion of (321). For the length bound, note that (N ∩p^{τ}M ∩V_{ram}) ⊆M_{ram} coincides with (N ∩p^{τ}M) ∩M_{ram}, so the canonical map M_{ram}/(N ∩p^{τ}M ∩V_{ram}) ↪→M/(N ∩p^{τ}M) is injective, while N ⊆ NP_{f} induces a surjection M_{ram}/(N ∩p^{τ}M ∩V_{ram}) ↠M_{ram}/NP. Hence
Selectable PDF notation • transcription unchecked
( ) ( )
length_{O}(M_{ram}/NP) ≤ length_{O} M_{ram}/(N∩p^{τ}M∩V_{ram}) ≤ length_{O} M/(N∩p^{τ}M) ≤ e_{p}d(τ+2SΣ).
Source: Formalism/ThetaLogCoordinates/ProductIdealMonotone/ProductIdealProofs/ElementarySymmetricExpBound.lean:13--103; Formalism/SharpRestriction/GrowthBounds/LatticeSystems.lean:654--669; Formalism/SharpRestriction/GrowthBounds/MultisetValuation/StabilizerCount.lean:120--204,254--358,384--491
Zero-chain kernel elimination and the family link LinkG. Recall from Formalism.MainNotions.LinkG that for a family Fm at accuracy ε > 0, the property LinkG asserts the existence of constants C, x_{0} ∈ ℝ and a function δ : ℝ →ℝ with lim_{x→∞}δ(x) = 0 such that for every x ≥x_{0} and i ∈Fm.Ix(x), writing D = Fm.D(x, i), L = Fm.L(x, i), X = Fm.Gx(x, i), K = Fm.GK, and bo = L.sc.b^{δ(x)}, all five clauses of LinkG_at hold:
(G1) For every u ∈D.Word and place w with p := resChar(w) ̸= T_{u}:
(a) local ideal containment 𝔭^{⌊}_{w}^{ewτw⌋}Λ_{ram}(u)_{w} ⊆ν_{u}(Λ_{ν}(u))_{w} (DV.LocLe);
(b) length bound lenMN(u, w) ≤d_{u} (τ_{w} + io_{w});
(c) empty-orbit vanishing: if VV_{p} = ∅, then τ_{w} = io_{w} = lenMN(u, w) = 0.
(G2) For every prime p and every served orbit t_{0} ∈ VV_{p}, S_{v}(p, t_{0}) ≤2mN_{v}(p, t_{0})a/p.
(G3) For every place w whose residue characteristic p = resChar(w) is inert or signal with p ≤ X^{′′}(n):
0 ≤ gain(j, w) ≤4|TT|a/p for all lifts j, and
Selectable PDF notation • transcription unchecked
∑ ∑ ( ) ∑
Λ_{cls}(j, t, p) − lo_{G}(L, C, bo, p) −m fl_{G}(L, C, p) ≤ gain(j, w) −τ_{w}, (323) j∈lifts t∈TTw j∈lifts
where fl_{G}(L, C, p) := CfN_{m}^{2} log_{p}a+Cf(log_{p}a)^{2} and lo_{G}(L, C, bo, p) is the explicit piecewise error term of Formalism.MainNotions.loG.
(G4) Served-orbit containment (ServedOrbitsContained).
(G5) Mean-kappa bound (MeanKappaBound).
A crucial observation of AdmissibleFamilyNoKernel.lean is that LinkG_at makes no reference to the kernel-chain component Y.Ch of a lattice instance Y ∈ LatInst(D). Defining the zero-chain instance zeroCh(Y ) (zeroCh) by retaining (Y.vOf, Y.Fl, Y.Lv, Y.Vram) and replacing Y.Ch with the identically zero chain (Ch = 0), the predicates LatTied, NP, VramDef, and LatticeLengthsAtPlace are unchanged, while
for m ≥ 1 we have (zeroCh(Y ).Ch).chainK(m, F) = 0 (chainK_zero), which lies in every scaled lattice ϖ^{k}· N (vKge_zero). This completely bypasses the auxiliary formal-group lower-term chains (LocalDataSystem) when proving LinkG.
Proposition 8.157 (Zero-chain family admissibility and local-to-global link linkG_fam_noKer). Let Fm be a family at accuracy ε > 0. Assume:
(i) SecondTheoremAtFamily and FirstTheoremAtFamily hold for Fm;
(ii) 0 < Λ_{G}, 1 ≤C_{e}, and eventually CbLarge and FamilyWindowLogBound hold;
(iii) eventually TrivialStabiliserFiniteClasses (h_{E}), Joints.StdSubAt (h_{S}), Adm2F (h_{2}), and NPDescF
(h_{d}) hold along Fm.
Then LinkG holds for Fm.
Proof. We verify all twelve family admissibility conditions of AuxBlock8.AdmF for the pair (Fm.Gx, zeroCh∘ Fm.Gy), and then invoke AuxBlock8.Pf.stmtF and linkG_at_of.
Step 1: Discharging the nine arithmetic, orbit, and sandwich hypotheses. Conditions h_{1}, h_{3}, h_{4}, h_{5} are unconditional consequences of the family parameters and window log-bound: h_{1} is family_first_lemma; h_{3} (family_orders_first_part) combines family_order_bound_holds at C_{4} = 100 with the CM-field or-der estimate UnusedSlot33.field_lemmas_except_seven; h_{4} (family_orders_bound_of_lemma) combines fam-ily_band_ratio_holds with the window log-bound; and h_{5} (family_sizes_bound) applies the elementary bound M(log x)^{3} ≤ x^{δ} (log_cube_le) to master_orbit_sizes_hold. Condition h_{2} is assumed. Condi-tions h_{6} and h_{8} follow from SecondTheoremAtFamily and FirstTheoremAtFamily via family_second_bound_of_theorem and family_first_bound_of_theorem, while h_{7} follows from the least-serving kappa definition (family_kappa_bound, kapIDefF). For h_{9} (Adm9F), at each single factor the integral Weyl module satisfies weyl_{O} ⊆ dualWeyl_{O} and p^{wexp(p,m,λ)} dualWeyl_{O} ⊆ weyl_{O} (Model.modelSandwichG_of_ties); tensoring over all (v, s) and using the exponent bound ∑_{v,s}w_{exp}(p, m, λ_{v,s}) ≤ ep(p) (Joints.expBound_of) yields
the global lattice sandwich p^{ep(p)}M_{na} ⊆M ⊆M_{na} (Joints.weyl_sandwich_of_factors), and therefore Cor-nerGLContinuity.LatticeSandwich (sandwich_of_exponent_clause).
Step 2: Local-to-global orbit lattice bounds and gluing via zeroCh. The local operators y_{v} preserve both M_{na} and M at every place (Model.operators_preserve_lattices). Using h_{6}, h_{7}, h_{S}, base change Model.lpBaseChange from the standard unramified setting to the local ring of D.gat, and the eventual orbit/window bounds hypIAt_ev, hypIIAt_fam, and CbLarge, Joints.linear_programming_input_of_hypotheses delivers OrbitLatticeBounds (supplying LP^{′} at every served orbit t_{0} ∈ VV_{p}, via h_{6} when p < p_{0}(k) and via h_{7} when p ≥p_{0}(k)). Together with h_{E} (giving MLatticeCond via stability_of_trivial_stabilisers), satura-tion of M ∩V_{ram} in M (saturated_ramified_lattice), and Lemma 8.156 (FormalGroupSystem.Pf.stmt6G via service_statement_of_stability), the gluing theorem TopChoiceBounds.gluing_statement_holds yields the first two clauses of admG1 at zeroCh(Fm.Gy):
NP ⊆ p^{Tp}M_{ram}, length_{O}(M_{ram}/NP) ≤ e_{p} d_{u} (τ_{p} + io_{p}),
where T_{p} := ⌈τ_{p}⌉_{+} and e_{p} = vUnit(G). Both unitBoundAtTwistedPlaces and the third (valuation) clause of admG1 hold automatically for zeroCh(Fm.Gy) by vKge_zero since m ≥1. Combining with eventually_sizes_admitted proves AuxBlock8.AdmF (admissible_family_no_kernel).
Step 3: Extracting LinkG_at via AuxBlock8.Pf.stmtF. Applying AuxBlock8.Pf.stmtF to (Fm.Gx, zeroCh∘ Fm.Gy) produces a constant C ≥0 and δ(x) = x^{−ε/2} →0 such that eventually AuxBlock8.Conclusion1, Conclusion2, and Conclusion0 hold with error parameter bo = L.sc.b^{δ(x)}. We verify (G1)–(G5) of LinkG_at at constant 4|C| + 1 (linkG_without_kernels, linkG_at_of, linkG_at_core):
• Clauses (G2), (G4), and (G5) are svBound_ev, served_orbits_in_set, and Conclusion2 respectively.
• For (G1)(c), when VV_{p} = ∅, τ_{w} = io_{w} = 0 by definition and lenMN(u, w) = 0 from sizeDataLat_ev (derived from h_{d}). For (G1)(a), when VV_{p} = ∅ this is DV.NuDef; when VV_{p} ̸= ∅, nuServed_of lifts each x ∈Λ_{ν}(u) to NP ⊆p^{Tp}M, divides by p^{Tp}, applies DVR descent (descent) along the comparison map to 𝒪_{L}, and uses p ∈𝔭^{e}_{w}^{w} together with ⌊e_{w}τ_{p}⌋≤e_{w}T_{p}. For (G1)(b) with VV_{p}̸= ∅, sizeDataLat_ev (from h_{d}) identifies length_{O}(M_{ram}/NP) = e_{p} lenMN(u, w), and dividing the length bound of Step 2 by e_{p} > 0 gives lenMN(u, w) ≤d_{u}(τ_{w} + io_{w}).
• For (G3), Conclusion1 supplies the gain bounds and the analogous inequality with ask_{G}, lo(C), and fl(C); replacing ask_{G} by Λ_{cls} = ask_{P} via Conclusion0 and inflating C to 4|C| + 1 (lo_le_loG, fl_le_flG) yields (323).
Source: Formalism/SharpRestriction/GlobalTheoremInputs.lean:97--141; Formalism/SharpRestriction/GrowthBounds/IsResidueClassZero.lean:412--482; Formalism/SharpRestriction/GrowthBounds/SmallOrderPrimes.lean:15--269; Formalism/SharpRestriction/GrowthBounds/LogarithmicSums.lean:98--103; Formalism/SharpRestriction/GrowthBounds/Joints.lean:1494--1545,2040--2128; Formalism/SharpRestriction/GrowthBounds/TopChoiceBounds.lean:1186--1187,1639--1648; Formalism/LocalToGlobal/GroupLattices/FockModels/Sandwich.lean:187--216; Formalism/LocalToGlobal/GroupLattices/FockModels/OperatorsPreserveLattices.lean:334--343; Formalism/SharpRestriction/GlobalSchurBounds/GlobalRankLatticeProofs/CMFieldLemmas.lean:21--26; For-malism/SharpRestriction/GrowthBounds/PlaneCountTheoremWithConstants.lean:664--865,941--973,1472--1539; Formalism/LocalToGlobal/GroupLattices/AdmissibleFamilyNoKernel.lean:166--270
Mertens discharge of Adm2F and top-level closed-class callers. We next discharge the bad-orbit hypoth-esis Adm2F directly from ChosenE.
Lemma 8.158 (Elementary Mertens bound for Adm2F). If a family Fm at accuracy ε > 0 satisfies ChosenE (for any C_{0}, C_{H}), then Adm2F holds for Fm.
Proof. By topsF_of_chosenE, ChosenE yields x_{a}, x_{b} ∈ℝ and C_{b} > 0 such that for x ≥x_{a} we have ^{1}_{2}δ_{1}n ≤ |TT| ≤ 2δ_{1}n, and for x ≥ x_{b} every large-order residue-class-zero prime p < X^{′} = exp(x^{ε/3}) satisfies |badTops_{p}| ≤4C_{b}x^{−2}δ_{1}n. For any T ≥0 and any finite set S of integers 1 ≤p < ⌈e^{T}⌉, we have log p ≤T and 1/p ≤2/(p + 1), hence
Selectable PDF notation • transcription unchecked
∑ ⌈e∑^{T}⌉−1log p 1 ( ) ≤ 2T ≤ 2T 1 + log⌈e^{T}⌉ ≤ 2T(T + 2),
Selectable PDF notation • transcription unchecked
_{p∈S} p_{k=0} k + 1using ⌈e^{T}⌉< e^{T}+1 ≤2e^{T} and log 2 ≤1. Take x ≥ max(x_{a}, x_{b}, x_{1} +1, (16C_{b} +2)^{3/ε}) and put T := x^{ε/3} and A := x^{−2}. Then T ≥16C_{b} + 2, so T^{2}−16C_{b}(T + 2) = T(T −16C_{b}) −32C_{b} ≥2T −32C_{b} ≥4 > 0, i.e., 16C_{b}(T + 2) ≤T^{2}. Summing over p ∈ largeOrderResiduePrimes (all of which satisfy 1 ≤p < ⌈e^{T}⌉) yields
BTT ≤ 4C_{b}Aδ_{1}n · 2T(T + 2) =^{1}_{2}δ_{1}nAT · 16C_{b}(T + 2) ≤_{2}^{1}δ_{1}nAT^{ 3} ≤|TT| x^{−2+ε},
since AT^{3}= x^{−2+ε} and ^{1}_{2}δ_{1}n ≤|TT|. This establishes AuxBlock8.adm2 uniformly for all large x.
Source: Formalism/SharpRestriction/SmoothDesignExistence/AdmissibleTopsMertens.lean:15--143
Theorem 8.159 (Closed-class local-to-global family link link_of_local_closed, linkG_concrete5, and top-level callers). (i)
(link_of_local_closed) For any family class 𝒞, if TrivialStabiliserFiniteClasses, Joints.StdSubAt, Adm2F, and NPDescF are closed on 𝒞, then LinkG is closed on 𝒞.
(ii) (linkG_concrete5) For any family class 𝒞, if GroupCompatibilityFamily and Adm2F are closed on 𝒞,
then LinkG is closed on 𝒞.
(iii) (GlobalTheory.Top.closed_linkG_of_duty, Formalism.L2.DIV.LinkGCl.closed_linkG) Let 𝒜 be a fam-
ily class equipped with a twist selection sel (and, in closed_linkG_of_duty, a duty witness hduty). Then LinkG is closed on D_{3}(3, 𝒜), supplying item (vii) of Proposition 8.37 at UpperTheory.Top.shape_closed_link_n_of_green.
Proof. For (i), apply Proposition 8.154(ii) to obtain loc_proved. Proposition 8.155(ii)–(iii) give closedness of SecondTheoremAtFamily and FirstTheoremAtFamily on 𝒞. The remaining scalar and window hypotheses (0 < Λ_{G}, 1 ≤C_{e}, CbLarge, and FamilyWindowLogBound) are unconditionally closed on 𝒞 by signs_closed, ones_closed, cb_closed, and family_log_bound_closed. Conjoining these six closed properties with the four assumed closed hypotheses via Lemma 8.5 and applying Proposition 8.157 yields Closed for LinkG.
For (ii), GroupCompatibilityFamily provides, for each large x and i, a concrete tied Hermi-tian/ring/comparison realization (GroupCompatibilityAll):
• gatEF_of_tied deduces TrivialStabiliserFiniteClasses from the level-0 Hermitian trivial-stabilizer lemma (Triv.trivStabU) and gatE_of_gatIs;
• stdSubF_of_tied deduces Joints.StdSubAt from ring isomorphism compatibility (stdSubAt_of_ring);
• npDescF_of_tied deduces NPDescF from rational valuation compatibility (CmpTied.valRat and npDescF_of_valRatF).
Substituting these three implications and loc_proved into (i) gives linkG_concrete_noKer and linkG_concrete5.
For (iii), every family Fm ∈ D_{3}(3, 𝒜) carries ChosenE, so Lemma 8.158 yields Closed for Adm2F on D_{3}(3, 𝒜). Meanwhile, the twist selection sel (via group_compatibility_of_second_layer_family in closed_linkG_of_duty, or gTiedF_of_sel_alt in LinkGCl.closed_linkG) yields GroupCompatibilityFamily on D_{3}(3, 𝒜). Applying (ii) gives Closed for LinkG on D_{3}(3, 𝒜).
Source: Formalism/LocalToGlobal/GroupLattices/AdmissibleFamilyNoKernel.lean:272--286; Formalism/LocalToGlobal/GroupLattices/StdSubAtOfRing.lean:36--90; Formalism/LocalToGlobal/GroupLattices/ComparisonMaps/NpDescFOfValRatF.lean:9--22; Formalism/LocalToGlobal/GroupLattices/LinkGConcreteNoKer.lean:13--57; Formalism/LocalToGlobal/Divisibility/DivisibilityRemainder/AdmissibleClasses/LinkGCl.lean:11--21; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/LinkG.lean:13--24; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/LinkgLinkGCl.lean:14--22; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/TopShape.lean:33--55
Remark 8.160. A transitive audit of the Lean source confirms zero axioms and zero sorries across all 2,477 local modules in the dependency cone of LinkGConcreteNoKer (including TraceSpectra.stmtE, loc_proved, link_of_local_closed, and linkG_concrete5), and across all 12,555 local modules supporting GlobalTheory.Top.closed_linkG_of_duty and Formalism.L2.DIV.LinkGCl.closed_linkG. Thus the quantitative Fock no-kernel criterion and the closed-class production of LinkG (item (vii) of Proposition 8.37) are completely unconditional once the selected realization class 𝒜 and its twist selection sel (supplying GroupCompatibilityFamily and ChosenE within D_{3}(3, 𝒜)) are provided; the simultaneous construction of that realization and the global tie LinkGL remain separate upstream inputs.