Skip to content

Section 8.22 · PDF pages 670–680

Selected primitive-period, lattice-realization, and divisor-kernel bridges

The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.

8.22 Selected primitive-period, lattice-realization, and divisor-kernel bridges

We now reconstruct the complete divisor-kernel and remainder-bound chain at UpperTheory.Top.shape_closed_link_n_of_green (Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/TopShape.lean:33--55): specifically the bridge-rest producer GlobalTheory.Top.link_brest_alt (RestAll.bRest_all_alt), the scalar and single-map helpers hCsz and oneMap, the admissible twist-valuation link closed_family_admissible_twist_link_alt (hA2), the Whittaker-decay selection closure selection_closed_of_wu_decay_alt (hC5), the divisor-kernel wiring wire_sel_alt, cut_of_stable, complement_two_of_items, and RemainingDivisionBounds.toRows_alt (hBR), and finally Formalism.L2.DIV.closed_linkDIVt_of_closed_bridge_kernel (hDIV), which discharges item (v) of Proposition 8.37 with absolute exponent C_{abs} = 2. We also record the exact interface of nRest (feeding item (i) of Proposition 8.37) and the callers of shape_closed_link_n_of_green. The companion global divisor-tie producer link_gl (LinkGL with exponents e_{D} = 2, e_{L} = 0) is proved in Subsection 8.21 (Theorem 8.166) immediately above and is not duplicated here.

Throughout this subsection, fix a family class 𝒜 with working design class D_{3}(3, 𝒜) and a si-multaneous selected realization tuple (sel, selS, selP, selDH, selC, selB) on 𝒜, writing selI:= indefiniteRealisationChoiceOfSelection(selB) and selK:= kernelChoiceOfSelection(selB). Ev-ery bridge below operates strictly on this same selected realization without replacing it by any unrelated realization of equal rank.

Lemma 8.168 (Base-to-sharp Hermitian lattice passage). Let K be a totally complex number field, G a finite group with log |G| ≤ λ_{0}, and R_{g} ⊂ K^{Dg} a full 𝒪_{K}-lattice equipped with invertible archimedean frames

X_{g} = (X_{g,v})_{v|∞} and a K-linear representation ρ : G → GL_{Dg}(K) preserving R_{g} and unitary for X_{g}. Let (P_{0}, ψ_{0}) and (P_{1}, ψ_{1}) be subgroup characters of G of orders h_{0} = |P_{0}| and h_{1} = |P_{1}| with projector matrices e_{P0}, e_{P1} in the good block ∑_{s∈S}e_{s} = 1 indexed by irreducible K[G]-representations (τ_{s})_{s∈S}. Put

L_{b} := R_{g} ∩ im(e_{Pb}) (b ∈{0, 1}), R_{s} := R_{g} ∩ im(e_{P0}e_{s}) (s ∈S),

assuming L_{0} ̸= 0 and L_{1} ̸= 0. Suppose that:

(i) τ_{s} has multiplicity 1 at (P_{0}, ψ_{0}) and multiplicity n_{s} ∈ℕ at (P_{1}, ψ_{1}), with (1 −δ)̄n ≤n_{s} ≤(1 + δ)̄n for some ̄n > 0 and 0 ≤δ ≤1/3;

(ii) for each b ∈{0, 1}, a K-linear injection ι_{b} : K^{Db} ↪→ K^{Dg} has image im(e_{Pb}), is isometric from

X_{E,b} to the scaled frame X^{(b)}:=^{√}h_{b} X_{g}, and satisfies the lattice sandwich h_{b}L_{b} ⊂ι_{b}(R_{b}) ⊂L_{b} for an 𝒪_{K}-lattice R_{b} ⊂K^{Db}.

Write µ(R_{b}), µ_{max}(R_{b}), and µ_{CC}(R_{b}) := −µ(R_{b}) for the mean slope, maximal slope, and dual mean slope of (R_{b}, X_{E,b}). Then, for every real H_{0} satisfying µ_{max}(R_{0}) ≤H_{0}, both passage inequalities hold:

Selectable PDF notation • transcription unchecked
µ_{max}(R_{1}) ≤H_{0} + 14λ_{0}, ( ) (329)
µ_{CC}(R_{1}) ≤µ_{CC}(R_{0}) + 3δ µ_{CC}(R_{0}) + H_{0} + 28λ_{0} + 28λ_{0}. (330)

Proof. We establish the three stages used in levelCompare_statement, levelAmb_transfer, and passage_from_levels.

Stage 1 (Sandwich and frame scaling). Let R^{′} ⊂ R ⊂ K^{Dg} be finitely generated 𝒪_{K}-modules with R^{′} ̸= 0 and hR ⊂ R^{′} for an integer h ≥ 1. Multiplication by h is injective and has operator norm h at every infinite place v of K, so its map height is htMap(h · id) = 2 log h. Moreover hR ⊂ R^{′} ⊂ R implies rk(R^{′}) = rk(R). Applying map_slope_mu and slope_inequality_mean to id : R^{′}↪→R (height 0) and h · id : R ↪→R^{′} (height 2 log h) yields

0 ≤µ_{Xg}(R) −µ_{Xg}(R^{′}) ≤2 log h, 0 ≤µ_{max,Xg}(R) −µ_{max,Xg}(R^{′}) ≤2 log h.

Selectable PDF notation • transcription unchecked
√ √

Rescaling the frame by_{√} h divides archimedean norms by h, hence shifts both µ and µ_{max} additively by 2 log h = log h (twist). With X^{(b)} =^{√}h_{b} X_{g}, this gives the symmetric comparison (levelCompare_statement):

Selectable PDF notation • transcription unchecked
|| ||

µ_{X}(b)(ι_{b}(R_{b}))−µ_{Xg}(L_{b})|| ≤ log h_{b} ≤ log |G|, µ_{max,X}(b)(ι_{b}(R_{b}))−µ_{max,Xg}(L_{b})|| ≤ log h_{b} ≤ log |G|.

By the isometry of ι_{b} and the sandwich h_{b}L_{b} ⊂ ι_{b}(R_{b}) ⊂ L_{b}, R_{b} is a full lattice in K^{Db} with µ(R_{b}) = µ_{X}(b)(ι_{b}(R_{b})), µ_{max}(R_{b}) = µ_{max,X}(b)(ι_{b}(R_{b})), and µ_{CC}(R_{b}) = −µ(R_{b}) (LevelAmb.levelFacts).

Stage 2 (Representation-theoretic lattice transfer). Because ρ preserves R_{g}, acts unitarily for X_{g}, and satisfies ∑_{s}e_{s} = id, the multiplicity-one and branching lattice transfer theorem all_parts_transfer_holds applied via levelAmb_transfer gives the rank identities and degree/slope inequalities

Selectable PDF notation • transcription unchecked
∑ ∑

rk(L_{0}) = rk(R_{s}), rk(L_{1}) = n_{s} rk(R_{s}),

Selectable PDF notation • transcription unchecked
∑s∈S ∑s∈S

deg_{Xg}(L_{0}) ≤ deg_{Xg}(R_{s}) + 2 log |G| rk(L_{0}), deg_{Xg}(L_{1}) ≥ n_{s} deg_{Xg}(R_{s}) −^{17}_{2} log |G| rk(L_{1}),

Selectable PDF notation • transcription unchecked
s∈S s∈S

together with µ_{max,Xg}(L_{1}) ≤µ_{max,Xg}(L_{0}) +^{17}_{2} log |G|.

Stage 3 (Maximal-slope and dual-mean-slope passage). Assume µ_{max}(R_{0}) ≤ H_{0}. By Stage 1, µ_{max,Xg}(L_{0}) ≤H_{0} + log |G|. Combining this with Stage 2 and Stage 1 at b = 1 gives

µ_{max}(R_{1}) ≤µ_{max,Xg}(L_{1}) + log |G| ≤µ_{max,Xg}(L_{0}) +^{19}_{2} log |G| ≤H_{0} +^{ 21}_{2} log |G| ≤H_{0} + 14λ_{0},

proving (329).

For (330), write r_{s} := rk(R_{s}), d_{s} := deg_{Xg}(R_{s}), W_{0} :=∑_{s}r_{s} = rk(L_{0}) > 0, and W_{1} := ∑_{s}n_{s}r_{s} = rk(L_{1}). Since R_{s} ⊂L_{0}, we have d_{s} ≤r_{s}µ_{max,Xg}(L_{0}) ≤r_{s}(H_{0}+log |G|) for every s ∈S. As n_{s} ≤(1+δ)̄n, the product of the two nonnegative quantities (H_{0}+log |G|)r_{s}−d_{s} and (1+δ)̄n−n_{s} is nonnegative; summing over s ∈S yields

Selectable PDF notation • transcription unchecked
∑ ( ∑ )

n_{s}d_{s} ≥(H_{0} + log |G|)W_{1} −(1 + δ)̄n (H_{0} + log |G|)W_{0} − d_{s} .

Selectable PDF notation • transcription unchecked
s∈S s∈S

By Stage 2, ∑_{s}d_{s} ≥ (µ_{Xg}(L_{0}) −2 log |G|)W_{0} and µ_{Xg}(L_{0}) ≤ H_{0} + 3 log |G|. Setting Y := H_{0} + 3 log |G| −µ_{Xg}(L_{0}) ≥0, we obtain (H_{0} + log |G|)W_{0} −∑_{s}d_{s} ≤Y W_{0}. Because 0 ≤δ ≤1/3, we have the exact identity (1 + 3δ)(1 −δ) −(1 + δ) = δ(1 −3δ) ≥0, hence (1 + δ)̄nW_{0} ≤(1 + 3δ)(1 −δ)̄nW_{0} ≤ (1 + 3δ)W_{1} using n_{s} ≥(1 −δ)̄n. Substituting into the lower bound for deg_{Xg}(L_{1}) and dividing by W_{1} > 0 gives

−µ_{Xg}(L_{1}) ≤^{17}_{2} log |G| −(H_{0} + log |G|) + (1 + 3δ)Y = −µ_{Xg}(L_{0}) + 3δY +^{ 21}_{2} log |G|.

By Stage 1, |µ(R_{b}) −µ_{Xg}(L_{b})| ≤ log |G| for b ∈{0, 1}, so Y ≤µ_{CC}(R_{0}) + H_{0} + 4 log |G| and

Selectable PDF notation • transcription unchecked
( )

µ_{CC}(R_{1}) ≤µ_{CC}(R_{0}) + 3δ µ_{CC}(R_{0}) + H_{0} + 4 log |G| +^{25}_{2} log |G|.

Since δ ≥0 and 0 ≤ log |G| ≤λ_{0}, we have 4 log |G| ≤28λ_{0} and ^{25}_{2} log |G| ≤28λ_{0}, yielding (330).

Source: Formalism/BranchSandwichDivisors/BranchIsometryProofs/MapScale.lean:124--290; Formalism/BranchSandwichDivisors/BranchIsometryProofs/TransferMean.lean:19--86; Formalism/BranchSandwichDivisors/BranchIsometryProofs/Transfer.lean:55--90; Formalism/LocalToGlobal/IndefiniteReal/LevelAmbTransfer.lean:13--55; Formalism/LocalToGlobal/GlobalTheory/DivPassageP.lean:75--229

We next assemble the primitive Hecke-period package and transport period rationality and remainder-lattice fullness along the selected realization. Notice that the exact prerequisites of Lemmas 6.86 and 6.87 are discharged strictly on the chosen realization selB, never on an unrelated realization.

Proposition 8.169 (Primitive Hecke-period package, column factorization, and rationality/fullness). Sup-pose on the selected realization tuple (sel, selS, selP, selDH, selC, selB) we are given:

• hPA : AllRealisationsPrimitive sel selI (combining PrimRows3 and TypesSep3 at every selected index);

• hDivG (DivRows3G) and hDcPtG (DcPtG) at every selected index;

• rRows : Closed (D3 3 A) supplying, for every Fm ∈D_{3}(3, 𝒜) and C_{H} ∈ℝ, a constant C ≥0 such that eventually along sel the bounds IndefiniteRealisationConstantBounds (w1, covol, onto under DIVinN, lamLow under SingleMapCondition, seeIso, miStar, fun0 under DIVinN, pass, and kap) and DefRowsFAlt hold.

Then:

(i) (complex_data_conditions_base_level_of_primitive_links, RankOfDivisionKernel) At every se-lected index, hPA together with WeakCharacterisation constructs ComplexDataConditionsBaseLevel, yielding RowsHold0_3 and the division-kernel datum RankOfDivisionKernel.

(ii) (packageOfPrimitiveLinks / primitivePackageFullHecke) At every selected index where CovolumeOnto

IsometryConditions and PassIn3 hold, the full indefinite Hecke package IndefPkgR is constructed and satisfies both passage inequalities (329)–(330) via passage3_of and cutPassage3S.

(iii) (indefinite_realisation_column_facts / colFacts_real) At every selected index where hPA, seeIso,

and miStar hold, there exist scalars ζ(u, t) ∈L^{×} with ζ(u, µ_{0}) = 1 and v_{w}(ζ(u, µ_{w})) = 0 for every finite place w of L such that ColFacts holds: well-formedness WF, base-type finiteness H0, bijectivity of every transition matrix ι_{t}, and exact period factorization P_{t}(u, t, φ, F) = ζ(u, t)^{−1}B_{def}(u, φ, ι_{t}P_{q,t}F) together with isometric period norms L1e.

(iv) (buRat_rrFull_closed_alt) The property

Selectable PDF notation • transcription unchecked
( ) ( )

∀hc : D_{3}(3, 𝒜)(Fm), TuSize(Fm) → DGamSize(Fm) → eventual BuRational ∧ eventual RRFull

is Closed on D_{3}(3, 𝒜).

Proof. For (i), PrimRows3 supplies the Hecke intertwining operators (PHecke), unitary group actions (PGUnit), group equivariance (PGEquiv), block membership, rational row and lift tests, surjectivity onto the unitary-two model (liftOnto), positivity, level types (PLevE, PLevW), principal level bijectivity, spectral identities PThmA/PThmB (with phase cancellation phase_cancel for unit-modulus twists), and Galois/dimension compat-ibilities. Running U2.unitary_two_package extracts the base-level eigensystem and type data (eig0, typ0), while RealDat3.height_change_of_D0 yields H0, assembling ComplexDataConditionsBaseLevel. Its stable, wf, levs, what2, ratMu, lifts0, ratTh, types0, and proviso0 fields construct IndefRows at base level (primRows3), giving RowsHold0_3 and hence RankOfDivisionKernel via SquareIntegrableColumns.toK.

For (ii), combining (i) with CovolumeOntoIsometryConditions (w1, covol, onto, lamLow, seeIso, miStar, fun0) produces PrimitiveStatementsBaseLiftsOnly via base_lifts_package_of_primitive_links. Given PassIn3 (CxPassIn3: rational µ at trivial level, good irreducible family τ realizing the character block, mul-tiplicity one at (P_{0}, ψ_{0}), near-constant multiplicities at (P_{1}, ψ_{1}) with defect δ, and λ_{0} = log |G|), steps3 verifies all ten conditions of In3.passage_of_steps, which invokes Lemma 8.168 (passage_from_levels) to supply Passage (passage3_of). Then basePackageFullHecke constructs IndefPkgR.

For (iii), MIstar2 gives a tuple d = (V, U, a, ζ_{ℂ}) where V acts isometrically on the sharp space E_{1}, U_{u} preserves the frame norm X_{c,u,v0}, ζ_{ℂ}(u, µ_{0}) = 1, every algebraic preimage of ζ_{ℂ}(u, µ_{w}) is a w-unit, and ζ_{ℂ}(u, t) σ_{0}(P_{t}(u, t, φ, F)) = a_{u}⟨s_{EE}(V (Θ_{t}(j_{R}(e_{V} F)))), P_{u}(U_{u}φ)⟩. At t = µ_{0}, using ζ_{ℂ}(u, µ_{0}) = 1 and a right inverse to the surjection P_{q,µ0} (rinv_spec), this identity yields σ_{0}(B_{def}(u, φ, y)) = a_{u}⟨s_{EE}(V (i_{C}(µ_{0}, y))), P_{u}(U_{u}φ)⟩ (embedding_pairing_eq_mul_inner) and van-ishing on ker P_{q,µ0} (base_tuple_vanishing_of_hypotheses). Comparing with the general-t identity through the rational transition matrix ι_{t} = rowMat(t) gives ζ_{ℂ}(u, t) σ_{0}(P_{t}(u, t, φ, F)) = σ_{0}(B_{def}(u, φ, ι_{t}P_{q,t}F)) (zetaC_mul_embedding_Pt). Whenever P_{t}(u, t, φ, F) ̸= 0, the ratio lies in L^{×} and equals ζ(u, t); otherwise both sides vanish (matrix_identity_of_unit_hypotheses). Combining with zetaOK_of_miUnit2, cutPairing, and isometric_periods_of_unit_hypotheses (which uses SEEIso) establishes PairingFactorsThroughPeriods and L1e, hence ColFacts (colFacts_real).

For (iv), start from rRows and take x ≥ max(x_{0}, (sel Fm hc).1, Fm.x_{1} + 1). From selB.Q, tup_all_used_of_realisation shows that all ambient tuples are used, upgrading hDivG and hDcPtG to DivRows3 and RowsHoldDcPt3. By (iii), ColFacts holds on the same realization. For RRFull, ColFacts.rr_lattice applies

Lemma 6.87 to the local lattices ι_{µw}(abelian_{2}(µ_{w})) (each full because ι_{t} is bijective and abelian_{2}(t) is a lattice by WF, and equal to the base lattice outside the finite support Tw by H0), and rrFull_of transports this full lattice along the L-linear isomorphism e_{RR}. For BuRational, buRational_of verifies all four hypotheses of Lemma 6.86: surjectivity of ι_{µ0} ∘P_{q,µ0} (from bij and Pq_surj), equality of im(op) with the complex span of the good-part basis (range_op_eq_span, lvlOp_range, and level_operator_fixes_image using ok1),

compatibility with ι_{µ0} (sharp_iota), and the period identity at base level (RowsHoldDcPt3 combined with PairingFactorsThroughPeriods and ζ(u, µ_{0}) = 1). Thus both BuRational and RRFull hold for all sufficiently large x uniformly on the same realization, and rRows.imp preserves Closed on D_{3}(3, 𝒜).

Source: Formalism/LocalToGlobal/IndefiniteReal/BaseLiftsPackageOfPrimitiveLinks.lean:199--348; Formal-ism/LocalToGlobal/IndefiniteReal/PackageFromPrimitiveStatements.lean:35--137; Formalism/LocalToGlobal/IndefiniteReal/NearConstantMultiplicities.lean:17--63; Formalism/LocalToGlobal/IndefiniteReal/PrimitivePackageFullHecke.lean:24--52; Formalism/LocalToGlobal/IndefiniteReal/IsometricPeriodsOfUnitHypotheses.lean:21--160; Formalism/LocalToGlobal/Divisibility/DivisibilityRemainder/RationalColumns/ColFacts.lean:20--113; Formalism/LocalToGlobal/Divisibility/DivisibilityRemainder/RationalColumns/BuRationalOf.lean:14--51; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/BurrbPlug.lean:23--56

We now close the sharp functional bound, the base-level slope cap, the level-wire frame-number bound, and the full RestAll/link_brest_alt assembly.

Proposition 8.170 (Sharp functional bound, frame-number bound, and link_brest_alt). Under the hypothe-ses of Proposition 8.169, assume in addition hRB (IndefiniteRealisationBoundedRows) at every selected in-dex and tie : Closed (D3 3 A) (fun Fm _ => RealPlaceSecondLayerConditions Fm). Then:

(i) (closed_funSharp_thr_alt) For any exponent functions E_{b}, E_{c}, there exists a closed family property on D_{3}(3, 𝒜) producing C_{F0} such that the threshold thrHH holds and, whenever TuSize, DGamSize, and DIVinN hold for Fm, eventually

µ_{max}(RR) + mean_{E}(log κ_{R}) ≤x^{CF 0}b. (331)

(ii) (SlopeMaxB.eventually_muMax_le_pow_ebMu_mul_of_tuSize) For every Fm ∈D_{3}(3, 𝒜) satisfying Tu

Size, setting E_{b}(c_{out}) := 4(max(C_{t}, 5) + 3) + 1, eventually for every word u,

Selectable PDF notation • transcription unchecked
µ_{max}(lat_{0}(u))≤x^{Eb}b. (332)

(iii) (LvlWire.hh_of_lvl, RestAll.bRest_all_alt, link_brest_alt) For every real C_{abs} (and in particular

C_{abs} = 2), GlobalTheory.Top.link_brest_alt establishes

Selectable PDF notation • transcription unchecked
( )

Closed D_{3}(3, 𝒜), fun Fm C_{H} ⇒∀hc, TuSize(Fm) → DGamSize(Fm) → RemainingDivisionBounds(Fm, 2, C_{H}) .

Proof. For (i), fix Fm ∈ D_{3}(3, 𝒜) with 0 ≤ C_{sz}, DGamSize (constant C_{d}, threshold x_{4}), rRows at C_{H} (constant C ≥ 0, threshold x_{1}), oneMap from hRB (threshold x_{2}), and DIVinN. For x ≥ max(x_{1}, x_{2}, x_{4}, x_{0F} , (sel Fm hc).1, 56), gamma_size_of_sizeData_alt provides the Γ-size input for Arith4S.arithClause_rec with parameters C_{0} = c_{0F} (C_{sz}, C_{c}, C_{Y L}, C_{t}) and c_{e} = c_{eF} (C, 0, 2 + 9 max(C_{d}, 0), C_{0}). Evaluating the resulting arithmetic clause at the base word u_{0} supplies Q ≥ 1 with 0 ≤ δ and 3δQ ≤ 1, whence δ ≤1/3 (third_of). Proposition 8.169(ii) therefore applies the first passage inequality (329) to the base-level bound µ_{max}(S_{0}.RR) ≤ x^{CH}b − mean(log κ) (fun0), giving via funSharp_pt_alt (using muMax_tie and meanEmb_eq_meanLog):

µ_{max}(RR) + mean_{E}(log κ_{R}) ≤x^{CH}b + 14λ_{0},

where λ_{0} = log |G|. Now lambda_zero_le_four_b verifies λ_{0} ≤ 4b: from the size hypotheses, A := x^{θ}L ≥ 1, f, r ≥ 1, fr^{2}A ≤ f^{5}r^{19}A ≤ b, fr^{2} ≤ b, log(2g_{0}) ≤ 1 + A, and λ_{0} ≤ 2fr^{2} log(2g_{0}) ≤ 2fr^{2}(1 + A) ≤4b. Since x ≥56 and b ≥1, Lemma 6.88 (pow_absorb) absorbs 14λ_{0} ≤56b into x^{d+1}b

with d := max(C_{H}, 1) (funSharp_fam_alt). Applying closed_atMid (via sharpThresholdTransform, which shifts the middle threshold coordinate by reExp) to rRows.and hCsz produces a family-independent exponent function f(ε, c_{out}); setting C_{F0}(ε, c_{out}) := max(f(ε, c_{out}), 1) + 1 gives closed_funSharp_alt, and closed_largeE imposes the explicit threshold thrHH to yield (i).

For (ii), colTies_of_sel_alt combines sel with stabF to give column-value ties tCVTies, whence tCV_of_ties and slopes_of_values (combining TuSize with the open-family slope inequalities lower_slope_inequality_family and slope_inequality_family_four) yield FrobeniusExpansionCongruence with a family constant C. Writing szPol(L) := 1+f +k+m+t+N_{m}+L ≥1, muMax_le_pol uses log(kv) ≤3 szPol(L), log T_{u} ≤|C_{Tu}|(szPol L)^{2} (from TuSize), a ≤(szPol L) b, and b^{′}+ S_{c} ≤2(szPol L) b to bound

µ_{max}(lat_{0}(u)) ≤|C|(12 + 2|C_{Tu}|)(szPol L)^{4}b.

For x ≥9, szPol_le_rpow yields szPol(L) ≤x^{max(Ct,5)+3}; hence for x ≥ max(9, |C|(12 + 2|C_{Tu}|)), bPol_le proves (332) with E_{b} = 4(max(C_{t}, 5) + 3) + 1.

For (iii), we combine (i), (ii), tie, and Theorem 8.159(iii) (LinkGCl.closed_linkG_of_tuSize_dGamSize, valid on D_{3}(3, 𝒜) from sel) to discharge FrameNumberBoundFamily (hh):

1. From tie and TuSize, LvlWire.lvlF_of_ties produces J.LvlF, whence nuFullF_of_lvl yields NuFullF;

together with proviso_of_working_class (extracting ChosenProviso Fm 3 from D_{3}(3, 𝒜)), muRank_of_lvl gives J.MuRank (in particular rk(Nu(u)) > 0 for every word u).

2. SlopeId.linkMu_of_full combines ZeroAbove (Wire.za_of), NuFullF, J.MuRank, TuSize (noting log T_{u} ≤

C_{Tu}mL ≤2|C_{Tu}|X^{′′}(n) since m ≤2n, L ≤x, and xn ≤X^{′′}(n)), and DGamSize to produce LinkMu.

3. Combining J.LvlF, TuSize, J.MuRank, LinkG, and LinkMu via slope_lemma_division_side yields Slope

LemmaFamily, giving for each word u the comparison µ_{max}(Nu(u)) ≤µ_{max}(lat_{0}(u))+G_{a} +F_{o} −E_{e}(u)+

Selectable PDF notation • transcription unchecked
C_{4}mB_{0}.

4. Given c2 : ComplementTwoFamily (constant C_{2}), negEe_le bounds −E_{e}(u) ≤C_{2}mB_{0}, and gauge_form_

bound_of_uniform_size combines this with ga_pow, fo_pow, and const_rank_base_le_poly_fourth to give G_{a} + F_{o} −E_{e}(u) ≤x^{Ec}b with E_{c} = 9(max(C_{t}, 5) + 3) + 2.

5. By hExpl6_lower_pow, −(h_{expl}(u) + mean_{E}(log κ_{R})) ≤x^{Ed}b with E_{d} = 9(max(C_{t}, 5) + 3) + 1, while

C_{4}mB_{0} ≤|C_{4}|(szPol L)^{4}b ≤x^{Ed}b for x ≥ max(9, |C_{4}|).

6. The thrHH largeness condition from (i) ensures C_{H} ≥E +1 where E := max(E_{b}, E_{c}, C_{F0}, E_{d}). Adding

the five bounds (ii), Step 4, Step 5, C_{4}mB_{0}, and (i) gives, for x ≥9 (so 5x^{E}b ≤x^{E+1}b ≤x^{CH}b) and using µ(Nu(u)) ≤µ_{max}(Nu(u)) (mu_le_muMax),

µ(Nu(u)) −h_{expl}(u) + µ_{max}(RR) ≤x^{CH}b (∀u).

Averaging over words with weights rk(Nu(u)) > 0 (height_bound_of_word_slopes) proves FrameNumberBoundFamily (hh_of_lvl).

Finally, conjoining hh with buRat_rrFull_closed_alt from Proposition 8.169(iv) and adding Wire.la_of (0 ≤ℒ_{a} = log(a rd(E)) from a ≥1, rd(E) ≥1) proves bRest_all_alt and link_brest_alt.

Source: Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/HefunFunTop.lean:28--140; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/HbmuSlopeMaxB.lean:14--25; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/BrestFinalAll.lean:25--59; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/

ThirdPlaceSeries/LinkBrest.lean:18--36; Formalism/LocalToGlobal/Divisibility/DivisibilityRemainder/NoColumnCase/LvlWire.lean:15--66; Formalism/LocalToGlobal/Divisibility/DivisibilityRemainder/LinkedMeasures/SlopeId.lean:12--53; Formalism/LocalToGlobal/Divisibility/DivisibilityRemainder/ValueBounds/SlopeMaxB.lean:17--170; Formalism/SharpRestriction/Divisibility/HookProducts/LambdaZeroLeFourB.lean:11--85; Formalism/SharpRestriction/Divisibility/HookProducts/GaugeFormBoundOfUniformSize.lean:12--92; Formalism/SharpRestriction/Divisibility/SlopeExcess/HeightBoundOfComponentBounds.lean:13--151

We next prove the two companion closed-class bridges in TopShape.lean:40--41: the admissible twist-valuation link hA2 and the Whittaker-decay selection closure hC5.

Proposition 8.171 (Admissible twist-valuation link and Whittaker-decay selection closure). (i) (Global

Theory.Top.closed_family_admissible_twist_link_alt) Suppose on D_{3}(3, 𝒜) the six closed eval-uation/period/column hypotheses aPt0, aPtTw, aPer0, aPerTw, aP10, aAtG and the selection service hypothesis hServ : SelectionServed (D3 3 A) sel hold. Then

Selectable PDF notation • transcription unchecked
( )

Closed D_{3}(3, 𝒜), fun Fm _ ⇒∃x_{0}, ∀x ≥x_{0}, Fm.x_{1} < x →∀i, adm2(Fm.D x i, Fm.L x i) .

(ii) (GlobalTheory.Top.selection_closed_of_wu_decay_alt) Assume hWu : WuDecayOfGap, hRF : RowsFin

Dim, the indefinite-realization join selJ, the closed base-vector surjectivity condition jOn (BaseVectorImageFull: ι_{µ0}(V_{0}(µ_{0})) = EE), and rRows. Then

Selectable PDF notation • transcription unchecked
( )

Closed D_{3}(3, 𝒜), fun Fm _ ⇒ ComplementCountFamily(Fm) ,

that is, eventual adm13 (isometric Bessel-period identification B_{u}(φ, F) = a_{u} bes_{S}(u, U_{u}φ, V F) with

Selectable PDF notation • transcription unchecked
a_{u} ̸= 0).

Proof. For (i), D3 3 A carries DGamSize automatically (hc.2.2.2). First, GServT.sumOverPrimesService_of_servT extracts SumOverPrimesHypotheses from hServ by evaluating pdv along sel, and sum_over_primes_service produces Closed for WeilJacquetShalikaLaw.ServF: it combines admissible_size_family (from szCt_fam, szEatI_fam, and DGamSize), G.num_closed, split_bound_eleven_one, orbit_admissible_of_split_bound (valid once x ≥ 3^{5/ez} so splitBound ≥ 3), theta_isometry_facts_hold, orbit_entry_bounds_hold, and four_orbit_conditions_of_proof into WeilJacquetShalikaLaw.serv_of. Second, closed_eventually_levelPrimeCoprimeStabiliser proves unconditionally on Des (WithChN A) 3 that T_{u} does not divide the stabilizer order for sufficiently large x: indeed, if T_{u} divided it, smoothness would yield T_{u} ≤2fN_{m}+1 < t^{5} (as f, m, k ≤t and t ≥7), contradicting the lower bound_{√} T_{u} ≥b^{m/2}≥b ≥t^{300}≥t^{5} implied by TuSize, m ≥2, and SizeCond (t^{150}≤ b).

Collecting all eight closed hypotheses into Adm2InU (D3 3 A) and applying Adm2InU.admissible_family_of_inclusion, fix a large x above the maximum of the thresholds and 3^{5/ez}, an index i, a word u, a finite place w of L, φ ∈ NuLat(u), and F ∈M̃_{µw} ∩V_{0}(µ_{w}). We partition finite places w into three exhaustive cases:

1. resChar(w) = T_{u} (admissible_at_twist_places). Since T_{u} is coprime to the stabilizer order, v_{w}(D_{Γ}) =

0. By NuAtTDef, φ lands in N_{λ}(u, w); aP10 supplies ColGe at level −m E_{at T} (u, w), and period_geTU (using aPt0, aPtTw, aPer0, aPerTw) yields y ∈L representing the period with y = 0 or v_{w}(y) ≥ ur_{w}(s_{g}(u, w)).

2. resChar(w) = g_{j} ̸= T_{u} (admissible_at_generator_places). By NuInM, there exists a w-unit s ∈𝒪_{L} \ w

with s · φ ∈M_{ram,L}(u). Applying aAtG (UsedTuplesBoundByConstant and familySizeBoundAtTypePrime) to s · φ and dividing the resulting value y ∈L by s preserves v_{w}(s^{−1}y) = v_{w}(y) because v_{w}(s) = 0, giving the unrounded bound at s_{g}(u, w).

3. resChar(w) /∈{T_{u}, g_{0}, g_{1}} (admissible_off_twist_places). Using NuInM, NuServedDef, and ServedHas

Model, nuIn(u, φ) lies in the local neighborhood InNP; ServF plus gainLe_of_fills and period_geTU give the unrounded valuation lower bound at s_{g}(u, w).

Rounding down via valuation_bound_of_unrounded gives adm2 uniformly for all large x, proving (i).

For (ii), GapClosed.gapEv_closed_of turns TuSize (present in D_{3}(3, 𝒜)) into GapHyp eventually along sel (jGap). Then Pf.finXC_of hWu hRF maps GapHyp at every selected point to the finiteness witness FinX ((selS...).Y), giving hFX via JoinSISel.closed_finX_of_gapHyp. Meanwhile rRows directly yields MIstar2 along sel (hM). Conjoining hM, hFX, and jOn in closed_complementFiveFamily_of_evSel_imageFull, take x above the maximum of their thresholds, (sel Fm hc).1, and x_{1} + 1. At each such (x, i):

• kernelJoin_of_multiplicity uses the unitary maps (d.V, d.U_{u}) from MIstar2 together with selJ (ChainTieT, RowTieT, ColNormT, PairTieT, and GoodPartHasComplexCoordinates) to construct unitary equivalences

Selectable PDF notation • transcription unchecked
∼

V_{1} : EE −→^{∼} EE and U_{1,u} : Mu_{u}−→ Mu_{u} verifying the bilinear kernel-join identity KerJoinS on all basis pairs and hence on all F ∈V_{0}(µ_{0}).

• besselId_of_joins combines KerJoinS, ColJoinS (colJoinS_of_sTiesR, providing unitary W_{u}), and the isometry SIso (S.hI hF). For any x^{′} ∈ EE, jOn (ι_{µ0}(V_{0}(µ_{0})) = EE) provides q ∈Q_{sp}(µ_{0}) = V_{0}(µ_{0}) ∩ U_{sp}(µ_{0})^{⊥} with ι_{µ0}(q) = x^{′} (exists_Q_iota), so sec_{µ0}(x^{′}) = q, and evaluating KerJoinS at q yields B_{u}(φ, x^{′}) = a_{u} bes_{S}(u, W_{u}U_{1,u}φ, V_{1}x^{′}) with a_{u} ̸= 0.

This establishes adm13 eventually, hence ComplementCountFamily closed on D_{3}(3, 𝒜).

Source: Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/ClosedFamilyAdmissibleTwistLink.lean:12--31; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/GServT.lean:13--34; Formalism/SharpRestriction/SmoothDesignExistence/SumOverPrimesHypotheses.lean:30--222; Formalism/SharpRestriction/GlobalSchurBounds/PlugDgt.lean:10--106; For-malism/LocalToGlobal/GroupLattices/AdmissibleAtGeneratorPlaces.lean:11--349; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/SelectionClosedOfWuDecay.lean:20--52; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/FinXRowOfGap.lean:29--34; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/AdmissibilityClosed.lean:25--45; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/AdmissibleOfTransported.lean:27--186; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/KerJoinS.lean:92--146

We now assemble the divisor-kernel wiring at TopShape.lean:42--47, establishing item (v) of Proposi-tion 8.37 with fixed absolute exponent 2, and record the exact role of nRest and the callers of shape_closed_link_n_of_green.

Theorem 8.172 (Divisor-kernel bridge with absolute exponent 2 and assembly at shape_closed_link_n_of_green). Assume the hypotheses of Propositions 8.170 and 8.171, together with:

• hTw (TieTwRec) at every selected index;

• hMt: eventual 𝒪_{L}-stability of M̃_{µ} for every tuple µ along every family in 𝒜;

• aC2 : Closed (D3 3 A) (fun Fm _ => FamilySecondComplementInputs Fm).

Then:

(i) (GlobalTheory.Top.wire_sel_alt / wire4F_alt) For every Fm ∈ D_{3}(3, 𝒜) and C_{H} ∈ ℝ satisfying 0 ≤ C_{sz}, DGamSize, RowsAtSelAlt, oneMap, eventual BuRational, and DIVinN, there exist constants C, x_{0} ∈ ℝ such that for every x ≥ x_{0} past the selection threshold and every index i, the kernel package DivisionPackageKernel' holds with fixed absolute exponent C_{abs} = 2.

(ii) (hBR, RemainingDivisionBounds.toRows_alt, closed_linkDIVt_of_closed_bridge_kernel) Combining

bRest, cut_of_stable, rRows, oneMap, hCsz, hA2, complement_two_of_items applied to aC2, hC5, and the unconditional third-complement bound RBCompl3.rbCompl3 yields

Selectable PDF notation • transcription unchecked
( )

Closed D_{3}(3, 𝒜), fun Fm C_{H} ⇒ TuSize(Fm) → DGamSize(Fm) → LinkDIVt(Fm, 2, C_{H}) ,

discharging item (v) of Proposition 8.37 with absolute exponent 2.

(iii) (Role of nRest and callers of shape_closed_link_n_of_green) In TopShape.lean:33--55, the remaining

arithmetic-comparison input nRest : Closed(D_{3}(3, 𝒜), fun Fm _ ⇒ LinkN(Fm)) supplies argument hN (item (i) of Proposition 8.37) to UpperTheory.Top.topDesWin, where Proposition 8.36 (divinN_of_hypV) converts LinkN, SmallLevelRankEq, and HypV into DIVinN, unlocking LinkDIVt(Fm,2,C_H) to pro-duce LinkDIV(Fm,2,C_H).

Proof. For (i), fix Fm ∈ D_{3}(3, 𝒜) and C_{H} ∈ ℝ under the stated hypotheses, with DIVinN constant C_{e} (threshold x_{3}), DGamSize constant C_{d} (threshold x_{4}), RowsAtSelAlt constant C ≥0 (threshold x_{1}), and oneMap threshold x_{2}. Put

C_{0} := c_{0F} (C_{sz}, C_{c}, C_{Y L}, C_{t}) ≥28, c_{e} := c_{eF} (C, C_{e}, 2 + 9 max(C_{d}, 0), C_{0}),

and set

Selectable PDF notation • transcription unchecked
( ) ( )

C_{pkg} := max 0, max(50C_{0} + 10, 60c_{e}) , x_{pkg} := max max(x_{1}, x_{2}), max(max(x_{3}, x_{4}), x_{0F} ) .

For every x ≥x_{pkg} past the selection threshold and every index i:

• tup_all_used_of_realisation upgrades hDivG and hDcPtG to DivRows3 and RowsHoldDcPt3, while indefi-nite_realisation_base_rank_eq supplies the base-rank equality D_{0} = d_{Z}(P_{0}, ψ_{0}, Z_{µ0}).

• Proposition 8.169(ii) builds IndefPkgR on the same selected realization, and Arith4S.arithClause_rec supplies the numerical datum NumFacts and arithmetic clause ArithAt (including 0 ≤δ, Q ≥1, 3δQ ≤1, and 28 ≤C_{0}).

• inpAt_of_alt combines inEta3_num (from DIVinN, hTw, and the base-rank equality), lift_exponent_of_least, ArithAt, and the definite-row datum DefRowsFAlt from rRows into DivInputs0R.

• In RecNums.ofNum_rhs and rhs_le_record, the numerical right-hand side is

R.rhs = MAIN(u)+(50C_{0}+10)|TT| a ℒ_{a}+60c_{e} m (B_{0}+N_{c}) x^{ε}≤ MAIN(u)+C_{pkg}|TT| a ℒ_{a}+C_{pkg} m (B_{0}+N_{c}) x^{2ε},

Selectable PDF notation • transcription unchecked
(333)

using 50C_{0} + 10 ≤ C_{pkg}, 60c_{e} ≤ C_{pkg}, 0 ≤ℒ_{a}, and x^{ε} ≤ x^{2ε} = x^{Cabsε} since x > 1, ε > 0, and

Selectable PDF notation • transcription unchecked
C_{abs} = 2 ≥1.

• ptK_of_real_alt and pkg_of_rowsK_alt (with fixedScale_tied and DivisionPackageColumns.ofTied) therefore assemble DivisionPackageKernel' at constant C_{pkg} and exponent 2, proving (i).

For (ii), first observe that the three auxiliary closed ingredients are discharged directly:

• cut_of_stable (cutUp_of_stable): if M̃_{µ} is stable under multiplication by 𝒪_{L}, then every 𝒪_{L}-linear com-bination of generators lies in M̃_{µ}, so any x ∈ M̃_{µ} ∩V_{0}(µ) is represented by the singleton set {x} with coefficient 1, proving CutUp for every used tuple µ.

• complement_two_of_items (secondComplement_family_of_inputs): turns aC2 into ComplementTwoFamily (adm11).

• RBCompl3.rbCompl3: for any two words u, u^{′}, all word-independent terms cancel in

Selectable PDF notation • transcription unchecked
( ( ∑ ) ) ( ( ∑ ) ) ∑m ∑( )

h (u)+ a (t) log T − h (u^{′})+ a (t) log T ′ = kerPlace(u, j, τ)−kerPlace(u^{′}, j, τ) . expl T u expl T u

Selectable PDF notation • transcription unchecked
t∈TT t∈TT j=1 τ

Since S_{c} +w_{j}(τ) ≤6x^{6}b (sc_add_wj_le), log(6x^{6}b) ≤5+6L/ε+L (log_M_le), kS_{c} ≤b, and | log Ω| ≤ 8L, the triangle inequality gives

Selectable PDF notation • transcription unchecked
|| ( ) ( )( )

||LHS ≤mfkS_{c} log(6x^{6}b) + | log Ω| ≤ 20 +^{6}_{ε} |TT| a ℒ_{a} + mB_{0} , (334)

establishing Compl3 uniformly for all x ≥x_{1} + 1 with constant 20 + 6/ε.

By Lemma 8.5, the conjunction of bRest (Proposition 8.170(iii)), cut_of_stable applied to hMt, rRows, oneMap, hCsz, hA2 and hC5 (Proposition 8.171), and aC2 is Closed on D_{3}(3, 𝒜). At any member Fm of this conjunction satisfying TuSize and DGamSize, RemainingDivisionBounds.toRows_alt invokes (i) to fill pkg and RBCompl3.rbCompl3 to fill c3, yielding all ten fields of DivisionKernelConstantBounds Fm (RankOfDivisionKernel ...) 2 CH (hBR).

Finally, closed_linkDIVt_of_closed_bridge_kernel converts hBR pointwise into LinkDIVt Fm 2 CH via linkDIVt_of_bridge_kernel and linkDIVt_of_rowsF. Specifically, given DIVinN Fm, taking M to be the max-imum of the twelve eventual thresholds (x_{1}, x_{3}, x_{H}, x_{2}, x_{5}, x_{b}, x_{r}, x_{l}, x_{a}, x_{o}, R_{k}.1, x_{1} +1) and uniform con-stant C^{′}:= max(max(C_{1}, C_{3}), max(C_{2}, 0)), at each x ≥M and index i the theorem DivisionPackageFace.wordFacts invokes linkDIV_L2R_face (divClausesR_of) as follows:

1. ServJointF.val2AllAtRF combines adm2 and CutUp (via perToVal2F) to supply the local valuation hypoth-

esis val2 at every finite place w of L, whence intoDual yields B_{u}(shiftLat(Nu, s_{g})) ⊂ RR^{∨} (OneMapIntoCC).

2. height_chain_atR and htMap_le_of_bound prove htMap(B_{u}) ≤R.h_{u} − mean(log κ) = h(u) whenever

Selectable PDF notation • transcription unchecked
B_{u} ̸= 0.

3. Combining the base-level dual-slope bound P.base.boundsMu with the second passage inequality (330)

of Lemma 8.168 (using 0 ≤ δ ≤ 1/3, 3δQ ≤ 1, and 28 ≤ C_{0} ≤ R.C_{0}), R.divIneq and (333) yield µ_{CC}(RR) + h(u) −F_{o} ≤ MAIN(u) + C^{′}|TT| a ℒ_{a} + C^{′}m(B_{0} + N_{c})x^{2ε}.

Inserting wordFacts together with Compl3, FrameNumberBound, adm11, BuRational and adm13 (giving BesselId), RRFull, and zero_gain_above_family (ZeroAbove) into linkDIV_at_words proves LinkDIV_at with fixed absolute exponent 2 for every x ≥M, establishing (ii).

Part (iii) follows by inspection of TopShapeAlt.lean:24,85, TopShape.lean:33--55, and DesWin.lean:11--31. In the source repository, shape_closed_link_n_of_green is invoked via GlobalTheory.Fc.forall_goal_of_shape_of_hyps (ShapeOf.lean:24--32) by UpperTheory.Top.zero_free_all_of_green_v_win and every_character_of_green_v_win (TopPlug.lean:12--18), which in turn are called by UpperTheory.Lit.every_character_of_theta_integrals_local_matching (SiegelEisensteinSecondTermHypotheses.lean:44--73) from EveryCharacterOfLiteratureOfVWin.lean:810--813 and MainConclusion.lean:7--14. Within that top-level assembly, HypothesesNonemptyOfUnramifiedExponents.lean:41--61 and NonemptyHypsOfAllRows.lean:19--101 supply HypsAlt.nRest from UpperTheory.GalC.final_alt_alt (CFinal.lean:19--22, LinkNFam.lean:37--86, fed by BoundAtTwoThreeFamilyFonAlt of Section 5/Theorem 6.101), while rRows.covol is supplied from CovolumeBoundOfX (Theorem 16.25).

Source: Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/WireSel.lean:20--50; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/

Wire4F.lean:26--98; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/PtKOfReal.lean:19--73; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/InpAtOf.lean:17--56; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/IndefiniteRealisationChoice.lean:56--120; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/DIVRecBridgeSel.lean:113--205; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/TopShape.lean:33--55; Formalism/LocalToGlobal/Divisibility/ConstantGeTwentyEight.lean:123--248; Formalism/LocalToGlobal/Divisibility/ArithClauseRec.lean:11--64; Formalism/LocalToGlobal/Divisibility/RecBridge.lean:128--346,540--704; Formalism/LocalToGlobal/GroupLattices/JointServices/Cut.lean:10--46; Formalism/LocalToGlobal/GroupLattices/ServJointF.lean:42--102; Formalism/SharpRestriction/Divisibility/HookProducts/Compl3Record.lean:15--288; Development/AutomorphicArithmetic/CharacterBoxes/DesWin.lean:11--31; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/TopPlug.lean:12--18; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/LinkNFam.lean:35--87

Remark 8.173. A transitive UTF-8 audit of the Lean source confirms zero axioms, zero sorries, and zero missing local imports across all 8,769 local modules in the core Formalism dependency cone (FinalAll, RecBridge, AdmissibleAtGeneratorPlaces, AdmissibilityClosed, DivPassageP) and across all 16,665 local modules in the full ThirdPlaceSeries dependency cone (LinkBrest, BrestFinalAll, ClosedFamilyAdmissibleTwistLink, SelectionClosedOfWuDecay, WireSel, DIVRecBridgeSel). Thus 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 item (v) of Proposition 8.37 with absolute exponent 2) are com-pletely unconditional given the same-realization interface inputs. Together with LinkGL (Subsection 8.21,

Theorem 8.166) and the deep-cover lift bounds LiftBadSet/LiftLowBound feeding CovolumeBoundOfX (Sub-section 16.2, Theorem 16.36), this closes every family-bridge obligation in Section 8. What remains outside this section are strictly the upstream inputs inhabiting HypsAlt: the simultaneous geometric/theta/bundle construction of the selected realization class 𝒜 and its evaluation/period/service hypotheses (GEO-*), and the rank-three automorphy/Galois inputs feeding nRest and RecTExists (F8-*).