Section 8.19 · PDF pages 637–651
Automorphic all-row label counts, weight realization, and irreducibility
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
8.19 Automorphic all-row label counts, weight realization, and irreducibility
Proposition 8.80 proves the implication from automorphic cylinder counts, bad-tuple weight bounds, and uniform family size hypotheses to the irreducibility defect bound 0 ≤ δ_{p} ≤ exp(−x^{εz/7}) (LinkIRR). In this subsection we reconstruct the complete producer behind Formalism.L2.GlobalTheoryTheory.AllJoin.AllJoin: the finite-field Whittaker–Jacquet idempotent calculus and Green-parametrized Harish-Chandra
weight estimates (admLq, weight_of_join, WeightAllRows), the concrete automorphic construction of AllRows and its cylinder idempotents (LabelCountGoodInjective, AllJoinA), the unitary automorphic counting theorem with explicit decay constant c = c_{b} = 1/16 from the convergent unitary Siegel–Weil formula (CountAllRows), and the closed-family assembly yielding CountsIrreducibilityConstants' and LinkIRR on the same selected realization.
Fix a datum D (D7) with ranks r = k + m −1 = k + 2s + 1, where m ≥2 is even, s := m/2 −1, and k ≥m + 3; totally real field F of degree f = [F : ℚ] = 2n; CM quadratic extension E/F; and distinct admissible primes g_{0}, g_{1} splitting completely in E. For each j ∈{0, 1}, let Pl_{G}(j) be the chosen set of f places of E above g_{j} containing no conjugate pair, and set
Selectable PDF notation • transcription unchecked
∏ ∏ ( )Pl (j)
G_{0,g} := GL_{r}(𝔽_{gj}), T_{j} := 𝔽_{gj}[X]^{G} , T^{(2)}:= T_{0} × T_{1}.
Selectable PDF notation • transcription unchecked
j∈{0,1}v∈Pl_{G}(j)A polynomial P ∈ 𝔽_{gj}[X] is a valid label (IsLabel) if it is monic of degree r with P(0) ̸= 0. Write e_{Ser,j}(P) ∈ℂ[GL_{r}(𝔽_{gj})] for the central Harish-Chandra series idempotent attached to P (D.ntypes.eSer), and for any a ∈ℂ[GL_{r}(𝔽_{gj})] with Re(a(1)) ̸= 0 define its series weight
Selectable PDF notation • transcription unchecked
( )
wt_{j(a, P) :=} Re (a · e_{Ser,j}(P))(1)
Selectable PDF notation • transcription unchecked
. (302)
Re(a(1))
For a prime g, an integer N ≥1, and a complex additive character ψ : 𝔽_{g} →ℂ^{×}, let U_{N}(𝔽_{g}) ≤ GL_{N}(𝔽_{g}) be the upper unitriangular subgroup and define the Whittaker idempotent
Selectable PDF notation • transcription unchecked
_{1} ∑ ( ) N∑−2
e_{U}(g, N, ψ) := ψ ϕ_{U}(u)^{−1}[u], ϕ_{U}(u) := u_{i,i+1}.
^{|UN(𝔽g)|}u∈U_{N}(𝔽g) i=0When N = k + 2s + 1, define the Whittaker–Jacquet subgroup
Selectable PDF notation • transcription unchecked
{ }J_{k,s}(g) := u ∈U_{N}(𝔽_{g}) : u_{a,s+k} = 0 for all s ≤a < s + k
and the linear form ϕ_{k,s} : J_{k,s}(g) →𝔽_{g} by
Selectable PDF notation • transcription unchecked
∑s−2 ∑s−2 ∑k−2
^{ϕ}k,s^{(u) :=u}i,i+1^{ + 1}s≥1^{(u}s−1,s+k^{ + u}s+k,s+k+1^{) +u}s+k+1+i,s+k+2+i^{ +u}s+a,s+a+1^{,}
i=0 i=0 a=0with corresponding group-algebra element
Selectable PDF notation • transcription unchecked
e_{J}(g, N, k, s, ψ) :=^{1} ∑ ψ(ϕ_{k,s}(u))^{−1}[u].
^{|Jk,s(g)|}u∈J_{k,s}(g)At place index j ∈{0, 1}, set e_{U,j}(ψ) := e_{U}(g_{j}, r, ψ) and e_{J,j}(ψ) := e_{J}(g_{j}, r, k, s, ψ) (eUk, eJk).
An all-row automorphic record A ∈ AllRows D consists of an automorphic datum B ∈ RowsAut with B.I.n = r and B.I.f = f, a family of valid labels λ_{all,j} : {1, . . . , D_{all}} → T_{j}, an inclusion inc : {1, . . . , D } →{1, . . . , D }, local idempotents e ∈ ℂ[GL (𝔽_{j})], and for every S ⊆ T^{(2)} a
rows all j,v r g finite-adelic test function e_{T} (S) with right-convolution operator R_{eT (S)} on L^{2} such that e_{T} (T^{(2)}) = B.e, R_{eT (T} (2)_{)} = B.Re, and for every cylinder cyl(j, S) := {t ∈T^{(2)}: t_{j} ∈S} with finite S ⊆T_{j},
Selectable PDF notation • transcription unchecked
( ) ( ) ∑ ∏
Re e_{T} (cyl(j, S))(1) = Re B.e(1) wt_{j}(e_{j,v}, t_{v}). (303)
Selectable PDF notation • transcription unchecked
t∈Sv∈Pl_{G}(j)Write dim_{T} (A, S) := A.dimT S for the multiplicity dimension selected by R_{eT (S)}. The record A satisfies:
• LabelCountGoodInjective A if dim_{T} (A, S) = #{τ : λ_{all}(τ) ∈S} for every S ⊆T^{(2)}, inc is injective, λ_{all,j}(inc(σ)) agrees with the selected good-row label of σ, and λ_{all}(τ) is good iff τ ∈ im(inc);
• LevelSharp A if there exist nontrivial ψ_{0}(j) : 𝔽_{gj} →ℂ^{×} with e_{j,v} = e_{J,j}(ψ_{0}(j)) for all j, v;
• AllJoinA A if RowsTie D A.B and LevelSharp A hold; and AllJoin R A if LabelCountGoodInjective A and AllJoinA A hold;
• TieVecW A if each e_{j,v} equals either e_{U,j}(ψ_{0}(j)) or e_{J,j}(ψ_{0}(j)) for nontrivial ψ_{0}(j);
• WeightAllRows A if wt∏_{j}(e_{j,v}, P) ≥ 0 for all j, v, P and every finite set S ⊆ T_{j} of bad tuples at place j satisfies ∑_{t∈Sv} wt_{j}(e_{j,v}, t_{v}) ≤ W(f, m, r, g_{j}, q, d), where W is the six-term function of
Proposition 8.80;
• CountAllRows A epsC if 0 ≤ ε_{C} < 1, D_{∗}^{aut} > 0, and every cylinder cyl(j, S) satisfies | dim_{T} (A, cyl(j, S)) −D_{∗}(e_{T} (cyl(j, S)))| ≤ε_{C}D_{∗}(e_{T} (cyl(j, S))).
Lemma 8.147 (Whittaker–Jacquet idempotents, torus invariance, and partition of unity). Let g be prime, N = k + 2s + 1 with k ≥1, and ψ : 𝔽_{g} →ℂ^{×} be an additive character.
(a) The set J_{k,s}(g) is a subgroup of U_{N}(𝔽_{g}) of order g^{N(N−1)/2−k}, and ϕ_{k,s} : J_{k,s}(g) →𝔽_{g} is a group homomorphism. Consequently e_{U}(g, N, ψ) and e_{J}(g, N, k, s, ψ) are idempotents in ℂ[GL_{N}(𝔽_{g})] with
Selectable PDF notation • transcription unchecked
e_{U}(g, N, ψ)(1) = g^{−N(N−1)/2}, e_{J}(g, N, k, s, ψ)(1) = g^{k}g^{−N(N−1)/2}> 0. (304)(b) For any c ∈𝔽^{×}_{g}, let T(c) := diag(c^{pos(0)}, . . . , c^{pos(N−1)}) ∈ GL_{N}(𝔽_{g}), where
Selectable PDF notation • transcription unchecked
{⎪⎪⎪⎪a, a < s,
{a −s, s ≤a < s + k,pos(a) :=
Selectable PDF notation • transcription unchecked
⎪⎪⎪s, a = s + k,
⎪{a −k, a > s + k.Then conjugation by T(c) stabilizes J_{k,s}(g), satisfies ϕ_{k,s}(T(c)^{−1}uT(c)) = c ϕ_{k,s}(u), and conjugates e_{J}(g, N, k, s, ψ) to e_{J}(g, N, k, s, ψ^{c}), where ψ^{c}(x) := ψ(cx). Hence for every central element z ∈ ℂ[GL_{N}(𝔽_{g})], both (e_{J}(g, N, k, s, ψ) · z)(1) and e_{J}(g, N, k, s, ψ)(1) are independent of the choice of nontrivial ψ ̸= 1; moreover, when z is a central self-adjoint idempotent, (e_{J}(g, N, k, s, ψ) · z)(1) ∈
Selectable PDF notation • transcription unchecked
ℝ_{≥0}.(c) For any datum D, j ∈{0, 1}, and a ∈ ℂ[GL_{r}(𝔽_{gj})] with Re(a(1)) ̸= 0, writing monic(c) :=
Selectable PDF notation • transcription unchecked
∑
X^{r}+^{r}_{i=0}^{−1}c_{i}X^{i} for c ∈𝔽^{r}_{gj}, we have
Selectable PDF notation • transcription unchecked
∑ ∑
e_{Ser,j}(monic(c)) = 1, wt_{j}(a, monic(c)) = 1,
Selectable PDF notation • transcription unchecked
c∈𝔽^{r}_{gj} c∈𝔽^{r}_{gj}and wt_{j}(a, P) = 0 whenever P is not a valid label.
Proof. For (a), let u, v ∈U_{N}(𝔽_{g}). For any a < b, (uv)_{a,b} = u_{a,b} + v_{a,b} +∑_{a<ℓ<b}u_{a,ℓ}v_{ℓ,b}. In particular, (uv)_{a,a+1} = u_{a,a+1}+v_{a,a+1} always holds. If u, v ∈J_{k,s}(g) and s ≤a < s+k, then every intermediate index a < ℓ< s + k also satisfies s ≤ℓ< s + k, so v_{ℓ,s+k} = 0 and therefore (uv)_{a,s+k} = u_{a,s+k} + v_{a,s+k} = 0; thus J_{k,s}(g) is closed under multiplication (hence a subgroup of the finite group U_{N}(𝔽_{g})). For the same reason, when s ≥1, every s −1 < ℓ< s + k satisfies s ≤ℓ< s + k, so v_{ℓ,s+k} = 0 and (uv)_{s−1,s+k} =
u_{s−1,s+k} + v_{s−1,s+k}. All remaining terms of ϕ_{k,s} are superdiagonal entries (a, a + 1), which are additive on U_{N}(𝔽_{g}). Thus ϕ_{k,s}(uv) = ϕ_{k,s}(u) + ϕ_{k,s}(v). Because χ(u) := ψ(ϕ_{k,s}(u))^{−1} is a character of the finite group J_{k,s}(g), left-translation invariance on J_{k,s}(g) gives e^{2}_{J} = e_{J}, and identically e^{2}_{U} = e_{U}. Counting free strictly upper triangular entries gives |U_{N}(𝔽_{g})| = g^{N(N−1)/2}, while the k vanishing conditions u_{a,s+k} = 0 (s ≤a < s + k) are distinct pairs with a < s + k < N, giving |J_{k,s}(g)| = g^{N(N−1)/2−k}. Since ϕ_{U}(1) = 0 and ϕ_{k,s}(1) = 0, evaluating the coefficient at 1 yields (304).
For (b), conjugation by the diagonal matrix T(c) scales entry (a, b) by c^{pos(b)−pos(a)}. Since c ̸= 0, zero and diagonal entries are preserved, so T(c)^{−1}J_{k,s}(g)T(c) = J_{k,s}(g). Direct case inspection of pos shows pos(b) = pos(a) + 1 for every pair (a, b) occurring in ϕ_{k,s}: (i, i + 1) for 0 ≤ i ≤ s −2; (s − 1, s + k) and (s + k, s + k + 1) when s ≥ 1; (s + k + 1 + i, s + k + 2 + i) for 0 ≤ i ≤ s −2; and (s + a, s + a + 1) for 0 ≤ a ≤ k −2. Hence ϕ_{k,s}(T(c)^{−1}uT(c)) = c ϕ_{k,s}(u) for all u ∈ J_{k,s}(g), and re-indexing the sum defining e_{J} yields [T(c)]e_{J}(g, N, k, s, ψ)[T(c)]^{−1} = e_{J}(g, N, k, s, ψ^{c}). Every two nontrivial characters ψ, ψ^{′} of the prime-order cyclic group 𝔽_{g} satisfy ψ^{′} = ψ^{c} for some c ∈ 𝔽^{×}_{g}. Since z is central, ([T(c)]e_{J}[T(c)]^{−1}z)(1) = ([T(c)]e_{J}z[T(c)]^{−1})(1) = (e_{J}z)(1). When z is a central self- ∑adjoint idempotent, e_{J}z is a self-adjoint idempotent (as ψ(ϕ_{k,s}(u^{−1}))^{−1} = ψ(ϕ_{k,s}(u))^{−1}), so (e_{J}z)(1) =
Selectable PDF notation • transcription unchecked
_{h}|(e_{J}z)(h)|^{2} ∈ℝ_{≥0}.For (c), the map c →→ monic(c) is a bijection from 𝔽^{r}_{gj} onto monic polynomials of degree r, and e_{Ser,j}(P) = 0 whenever P is not a valid label (in particular if P(0) = 0). Hence the stored partition of unity ∑ e_{Ser,j}(P) = 1 rewrites as ∑ e_{Ser,j}(monic(c)) = 1. Multiplying on the left by a, taking
P valid c Re((·)(1)), and dividing by Re(a(1)) ̸= 0 gives ∑_{c} wt_{j}(a, monic(c)) = 1.
Source: Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/AllRowsOf.lean:83--214; For-malism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/AllRowsWt.lean:13--282; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/AllRowsEtOne.lean:265--271; Formalism/LocalToGlobal/GlobalTheory/ConcNWeight.lean:27--161; Development/AbelianVarietyTheory/Proofs/InertiaEigenvalues/WhittakerJacquetIdempotentsPropertiesPrimeFieldStatement.lean:8
Proposition 8.148 (Admissible finite-field Harish-Chandra label weights). Assume Green’s cuspidal charac-ter parametrization GlobalTheory.GLq.Green (Proposition 4.1) and the normalized-type compatibility Nor-malizedTypesCompatibility D jE of a datum D. Then admLq D holds: for each j ∈{0, 1} and every nontrivial additive character ψ : 𝔽_{gj} →ℂ^{×},
(i) wt_{j}(e_{U,j}(ψ), P) ≥0 and wt_{j}(e_{J,j}(ψ), P) ≥0 for every P ∈𝔽_{gj}[X];
(ii) for every squarefree valid label P ∈𝔽_{gj}[X],
Selectable PDF notation • transcription unchecked
wt_{j}(e_{U,j}(ψ), P) =∏(g_{j}^{deg Q}−1)^{−1}, (305)
Q|Pwhere Q runs over the monic irreducible factors of P;
(iii) for every valid label P ∈𝔽_{gj}[X],
Selectable PDF notation • transcription unchecked
(1 −g_{j}^{−1})wt_{j}(e_{U,j}(ψ), P) ≤wt_{j}(e_{J,j}(ψ), P); (306)(iv) for every squarefree valid label P ∈𝔽_{gj}[X],
Selectable PDF notation • transcription unchecked
(
wt_{j}(e_{J,j}(ψ), P) ≤ 1 + g_{j}^{−1})^{r} wt_{j}(e_{U,j}(ψ), P). (307)
Proof. Fix j ∈{0, 1} and abbreviate g := g_{j}, N := r = k + 2s + 1, G_{n} := GL_{n}(𝔽_{g}). Because g ≡ 1 (mod 4) by admissibility of g_{j} (D.ntypes.g_cond), we have g ≥ 5. Let L be the LabelDatum g built from the Teichmüller lift and primitive-root compatibility in NormalizedTypesCompatibility, and let O be the datum’s finite-field cuspidal label map. For each degree d ≥1, both O and Green’s parametrization Green assign monic irreducible polynomials of degree d with nonzero constant term bijectively to isomor-phism classes of irreducible cuspidal representations of G_{d} (exists_perm_deg). Patching across degrees yields a degree-preserving bijection∏ σ on monic irreducibles with P(0) ̸= 0 whose multiplicative extension σ̃(P) :=_{Q|P}σ(Q) (counted with multiplicity) preserves monicity, degree, P(0) ̸= 0, squarefreeness, and the multiset of irreducible factor degrees (ext_lab). Since Harish-Chandra induction matches character prod-ucts and every irreducible character of G_{N} has a unique Harish-Chandra series label (harishChandraSeriesLabel_exists_unique_GLn), we obtain e_{Ser,j}(P) = e_{Ser,L}(N, ̃σ(P)) (eSer_eq), where e_{Ser,L}(N, f) :=∑_{χ}z_{χ} sums the central primitive idempotents z_{χ} := (χ(1)/|G_{N}|)∑_{x∈GN}χ(x^{−1})[x] over irreducible characters χ of G_{N} with L-label f. It therefore suffices to establish (i)–(iv) for the L-series weights wt_{L}(a, f) := Re((a · e_{Ser,L}(N, f))(1))/ Re(a(1)).
For any a ∈ℂ[G_{N}] and any irreducible character χ of G_{N}, (a · z_{χ})(1) = (χ(1)/|G_{N}|) tr_{χ}(a), where tr_{χ}(a) :=∑_{x∈GN}a(x)χ(x) is the trace of a on an irreducible representation realizing χ. Summing over all χ with label f gives
Selectable PDF notation • transcription unchecked
( ) ∑ χ(1) ( )
Re (a · e_{Ser,L}(N, f))(1) =_{|GN|} Re tr_{χ}(a) . (308)
Selectable PDF notation • transcription unchecked
χ: lab_{L}(χ)=fIf a^{2} = a, then tr_{χ}(a) ∈ℤ_{≥0} is the dimension of the a-image in the representation affording χ. Applying this to a = e_{U}(g, N, ψ) and a = e_{J}(g, N, k, s, ψ), both of which are idempotents with positive identity coefficient by Lemma 8.147(a), proves (i).
For (ii), let f =∏^{ℓ}_{t=1}Q_{t} be a squarefree monic polynomial of degree N with f(0) ̸= 0, with distinct monic irreducible factors Q_{t} of degrees d_{t} (∑^{ℓ}_{t=1}d_{t} = N). By Green’s parametrization, each Q_{t} corre-sponds to a distinct cuspidal irreducible character τ_{t} of G_{dt} of degree τ_{t}(1) =∏^{d}_{i=1}^{t−1}(g^{i} −1) and Whittaker multiplicity wh_{ψ}(τ_{t}) := tr_{τt}(e_{U}(g, d_{t}, ψ)) = 1. Because the τ_{t} are pairwise non-isomorphic, their Harish-Chandra product τ := HC(τ_{1}, . . . , τ_{ℓ}) is irreducible and is the unique irreducible character of G_{N} with label f, so e_{Ser,L}(N, f) = z_{τ}. By multiplicativity of Whittaker models under Harish-Chandra induction, wh_{ψ}(τ) =∏^{ℓ}_{t=1} wh_{ψ}(τ_{t}) = 1. The parabolic index formula for Harish-Chandra induction gives
Selectable PDF notation • transcription unchecked
∏_{N(gi −1)} ∏ℓ d∏t−1 ∏_{N(gi −1)}
τ(1) = ∏_{ℓ}^{i=1}∏_{dti} (g^{i}−1) = ∏_{ℓ}^{i=1}_{d} .
t=1 i=1^{(g −1)}t=1 i=1 t=1^{(gt −1)}Since |G_{N}| = g^{N(N−1)/2} ∏^{N}_{i=1}(g^{i} −1) and e_{U}(g, N, ψ)(1) = g^{−N(N−1)/2} by (304), substituting into (308) cancels g^{N(N−1)/2} ∏^{N}_{i=1}(g^{i} −1) identically and yields wt_{L}(e_{U}(g, N, ψ), f) = ∏^{ℓ}_{t=1}(g^{dt} −1)^{−1}, prov-ing (305).
For (iii) and (iv), we establish the exact mirabolic derivative formula for tr_{χ}(e_{J}(g, N, k, s, ψ)) on any class function χ of G_{N}. Let e_{J}′(g, N, k, ψ) be the idempotent obtained from e_{U}(g, N, ψ) by deleting the k entries (a, k) for 0 ≤a < k (the column-k vanishing unitriangular pattern). Conjugating by a permutation matrix exchanging the block {s, . . . , s + k −1} with {0, . . . , k −1} and index s + k with k leaves the trace of any class function unchanged, giving tr_{χ}(e_{J}(g, N, k, s, ψ)) = tr_{χ}(e_{J}′(g, N, k, ψ)) (groupAlgebraTrace_patternIdempotent_exchange). Averaging over the trailing (N −k −1) block defines a mirabolic class function tail_{ψ}(k + 1, χ) on P_{k+1} ≤G_{k+1}, and restricting to diag(h, 1) (h ∈G_{k}) decomposes via the Bernstein–Zelevinsky mirabolic filtration as
Selectable PDF notation • transcription unchecked
( ) ∑k ( )
tail_{ψ}(k + 1, χ) diag(h, 1) = HC_{i,k−i} der^{i}_{ψ}χ, gg_{ψ}(k −i) (h),
Selectable PDF notation • transcription unchecked
i=0
where der^{i}_{ψ}χ is the i-th Whittaker/Harish-Chandra derivative on G_{i} and gg_{ψ}(m) is the Gelfand–Graev character of G_{m} (mirClass_diag1_eq_sum). Applying wh_{ψ} on G_{k}, using multiplicativity wh_{ψ}(HC_{i,k−i}(α, β)) = wh_{ψ}(α) wh_{ψ}(β) and the Gelfand–Graev norm identity wh_{ψ}(gg_{ψ}(m)) = g^{m}−g^{m−1} for m ≥1 and 1 for m = 0 (gelfandGraevCharacterGLn_norm_and_reciprocity), yields
Selectable PDF notation • transcription unchecked
( ) ∑k−1 ( )
tr_{χ} e_{J}(g, N, k, s, ψ) = wh_{ψ}(der^{i}_{ψ}χ) g^{k−i}−g^{k−i−1} + wh_{ψ}(der^{k}_{ψ}χ). (309)
Selectable PDF notation • transcription unchecked
i=0
If χ is a true character of G_{N}, Harish-Chandra restriction to G_{i} × G_{N−i} decomposes into a nonnegative integer combination of outer products of irreducible characters, so every wh_{ψ}(der^{i}_{ψ}χ) ∈ℤ_{≥0} (wh_der_nat), while for i = 0 we have wh_{ψ}(der^{0}_{ψ}χ) = wh_{ψ}(χ) (wh_der_zero). Dropping the nonnegative terms with i ≥1 in (309) gives tr_{χ}(e_{J}(g, N, k, s, ψ)) ≥ (g^{k}−g^{k−1}) wh_{ψ}(χ) = g^{k}(1 −g^{−1}) tr_{χ}(e_{U}(g, N, ψ)). Summing against χ(1)/|G_{N}| ≥ 0 over all irreducible χ with label f in (308) and dividing by e_{J}(1) = g^{k}e_{U}(1) from (304) proves (306).
Finally, for (iv), take f squarefree with unique irreducible character τ = HC(τ_{1}, . . . , τ_{ℓ}) as above. By the Leibniz rule for Bernstein–Zelevinsky derivatives on Harish-Chandra products of cuspidal characters with wh_{ψ}(τ_{t}) = 1 (bernsteinZelevinskyDerivative_harishChandraProduct), wh_{ψ}(der^{i}_{ψ}τ) = c_{i}, where c_{i} := #{I ⊆{1, . . . , ℓ} : w(I) = i} and w(I) :=∑_{t∈I}d_{t}. Dropping the negative terms −g^{k−i−1} in (309) and dividing by g^{k} gives
Selectable PDF notation • transcription unchecked
∑k ∑ ∏ℓ ( ) ∏ℓ ( ) ( )
tr_{τ}(e_{J}(g, N, k, s, ψ))
Selectable PDF notation • transcription unchecked
_{k} ≤ c_{i}g^{−i}≤ g^{−w(I)}= 1 + g^{−dt} ≤ 1 + g^{−1dt}= 1 + g^{−1N},
^{g} i=0 I⊆{1,...,ℓ} t=1 t=1since 1 + x^{d} ≤ (1 + x)^{d} for x = g^{−1} ≥ 0 and d ≥ 1. Since tr_{τ}(e_{U}) = 1 and e_{J}(1) = g^{k}e_{U}(1), (308) gives (307).
Source: Development/AbelianVarietyTheory/Proofs/GlobalInterpolation/AdmissibleLabelWeightsOfGreenCuspidalParametrisa.lean:24--300; Development/AbelianVarietyTheory/Proofs/InertiaEigenvalues/LemmaLSeriesWeightsOfGreenCuspidalParametrisatio.lean:15--57; Development/AbelianVarietyTheory/Proofs/InertiaEigenvalues/HarishChandraSeriesWeightSquarefreeLabelGelfandG.lean:238--302; Development/AbelianVarietyTheory/Proofs/InertiaEigenvalues/TraceUnitriangularColumnVanishingIdempotentEqSum.lean:69--93; Development/AbelianVarietyTheory/Proofs/InertiaEigenvalues/MirabolicTraceGeWhittakerDimensionGLn.lean:64--146; Develop-ment/AbelianVarietyTheory/Proofs/InertiaEigenvalues/HarishChandraSeriesWeightLowerComparison.lean:49--98; Development/AbelianVarietyTheory/Proofs/InertiaEigenvalues/HarishChandraSeriesWeightLeSquarefree.lean:30--140
Proposition 8.149 (Bad-tuple weight bound and selected weight realization). Let D be a datum and A ∈ AllRows D.
(a) (tieVecW_of_join) AllJoinA A implies TieVecW A.
(b) (tieAdmG_holds, rangeW_of_sizes) TieAdmG D holds automatically for every datum D. Moreover, if SizesRec D x eps_z C_s holds and x^{εz} ≥3/2, then RangeW D holds (that is, r ≥100 and g_{j} ≥2^{12} for j = 0, 1).
(c) (weightAllRows_of, weight_of_join) Assume admLq D, TieAdmG D, RangeW D, and AllJoinA A (or more generally TieVecW A). Then WeightAllRows A holds: every wt_{j}(e_{j,v}, P) ≥0, and for each j ∈{0, 1} and every finite set S ⊆T_{j} of tuples that are not good at place j,
Selectable PDF notation • transcription unchecked
∑ ∏ wt_{j}(e_{j,v}, t_{v}) ≤W(f, m, r, g_{j}, q, d), (310)
t∈Sv∈Pl_{G}(j)where W(f, m, r, g, q, d) is the exact six-term function of Proposition 8.80.
Proof. Part (a) is immediate from the definitions: AllJoinA A gives LevelSharp A, which sets e_{j,v} = e_{J,j}(ψ_{0}(j)) for nontrivial ψ_{0}(j), a special case of TieVecW A. For (b), TieAdmG D unpacks the admissibil-ity fields stored in D (g_prime, g_split, g_Mray, g_cond); and from SizesRec we have r ≥100 and, when x^{εz} ≥3/2, g_{j} ≥ exp(8x^{εz}) ≥e^{12}≥2^{12} (since e ≥2).
For (c), fix j ∈{0, 1} and write g := g_{j}, N := r ≥ 100 (g ≥ 2^{12} = 4096). Unpacking TieAdmG D and the host primes (host_facts) gives that q, d are distinct odd primes with max(q, d) ≥ 16 (since q > 4tr ≥ 264) and 16qd | g −1. Let ψ_{0} be the nontrivial character from TieVecW A, and define the distributions on Ω:= 𝔽^{N}_{g} by P(c) := wt_{j}(e_{U,j}(ψ_{0}), monic(c)) and w_{J}(v, c) := wt_{j}(e_{j,v}, monic(c)). By admLq D and Lemma 8.147(a),(c), both P and each w_{J}(v, ·) are probability distributions on Ω, and for every v ∈ Pl_{G}(j) and c ∈ Ω we have w_{J}(v, c) ≥ (1 −g^{−1})P(c) (trivial if e_{j,v} = e_{U,j}(ψ_{0}) or if monic(c) is not a valid label, and given by (306) otherwise). By Lemma 8.147(c), any tuple t ∈S having a coordinate that is not a valid label contributes 0 to the sum in (310); restricting to tuples of valid labels and passing to coefficient vectors embeds S into the set E_{bad} ⊆Ω^{PlG(j)} of tuples failing the goodness condition GoodAt. ∑ Step 1: Comparison transfer (∏ comparison_transfer_holds∏). For any event E ⊆Ω^{PlG(j)}, put µ_{U}(E) :=
_{x∈Ev}P(x_{v}) and µ_{J}(E) := ∑_{x∈Ev}w_{J}(v, x_{v}). Since w_{J}(v, c) ≥(1 −g^{−1})P(c) and |Pl_{G}(j)| = f, summing over the complement E^{c} gives
Selectable PDF notation • transcription unchecked
1 −µ_{J}(E) = µ_{J}(E^{c}) ≥(1 −g^{−1})^{f}µ_{U}(E^{c}) = (1 −g^{−1})^{f}(1 −µ_{U}(E)) ≥(1 −f/g)−µ_{U}(E)by Bernoulli’s inequality (1 −g^{−1})^{f} ≥1 −f/g and (1 −g^{−1})^{f} ≤1. Hence µ_{J}(E) ≤µ_{U}(E) + f/g. It therefore suffices to prove
Selectable PDF notation • transcription unchecked
( ) ( )
2f + 23f log g 1 + 1 + log N N(7)^{f} f µ_{U}(E_{bad}) ≤ √ + 2fm + + exp − , g g 4 min(q, d) g −1 2 8 5 log N
since adding f/g recovers W(f, m, N, g, q, d).
Step 2: Five local estimates under P (property_W_of_estimates). Let Sq ⊆Ω be the set of c for which F_{c} := monic(c) is squarefree with F_{c}(0) ̸= 0. By (305), P(c) = sqw(F_{c}) :=∏_{Q|Fc}(g^{deg Q} −1)^{−1} for all
c ∈ Sq. Decompose E_{bad} into five failure regimes on Ω^{PlG(j)}:
(1) Non-squarefree or zero constant term (S_{1} := Sq^{c}): For every c ∈ Sq, sqw(F_{c}) = ∏_{Q|Fc}(g^{deg Q} −
Selectable PDF notation • transcription unchecked
∏
1)^{−1}≥_{Q|Fc}g^{−deg Q} = g^{−N}. Since at most g^{N−1} monic degree-N polynomials vanish at 0 and at most g^{N−1} are non-squarefree (squarefree_count), we have |Sq| ≥g^{N}−2g^{N−1}, so P(Sq) ≥1−2/g and hence P(S_{1}) ≤2/g.
(2) Degree-type comparison to S_{N} (type_set_weight_bound): For any partition µ = (1^{n1}· · · N^{nN}) ⊢N, let I_{d} be the number of monic irreducibles of degree d in 𝔽_{g}[X] with nonzero constant term. Since each such irreducible has d distinct roots in 𝔽^{×}_{gd}, we have d I_{d} ≤g^{d} −1. The sum of sqw(F_{c}) over c ∈ Sq of degree type µ is
Selectable PDF notation • transcription unchecked
∏N ( ) ∏N n ∏N
I_{d} I_{d}^{d}_{n}1_{=} #{π ∈S_{N} : type(π) = µ}
Selectable PDF notation • transcription unchecked
_{(g}d_{−1)}−n_{d≤ ≤.}
_{d=1} n_{dd=1}n_{d}! (g^{d}−1)^{nd}_{d=1}d^{d}n_{d}! N!Summing over any family of partitions 𝒜 shows that P({c ∈ Sq : degType(F_{c}) ∈𝒜}) ≤ Prob_{π∈SN} (type(π) ∈𝒜). In particular, taking 𝒜 all partitions gives ∑_{c∈Sq} sqw(F_{c}) ≤ 1, and factoring out a fixed monic squarefree divisor h of degree ≤N gives ∑_{c∈Sq, h|Fc} sqw(F_{c}) ≤ sqw(h) (divisor_square_weight_sum_le).
(3) Failure of prime-to-ℓ root injectivity outside BB(g, N) (S_{3}, local_estimate_second): If two distinct roots of F_{c} have equal prime-to-ℓ parts for a prime ℓ∈/ BB(g, N) (meaning ℓ̸= g and ℓ> g^{N}+ 1 or ℓ∤g^{d}−1 for small d; specifically ℓ≥g^{δ/4} for the relevant degree), either both roots lie in one irreducible factor Q | F_{c} of degree δ ≥2 with ℓ| g^{δ}−1 (case A), or they lie in two distinct factors Q, Q^{′} of degrees δ ≥δ^{′}≥1 with ℓ| lcm(g^{δ}−1, g^{δ′}−1) (case B). By the divisor weight bound above, each prime ℓ contributes at most g^{3δ/4}(g^{δ}−1)^{−1} in case A and g^{δ/4}(g^{δ}−1)^{−1} in case B. Using ω(g^{d}−1) ≤ log_{2}(g^{d}) ≤_{2}^{3}d log g, setting s := g^{1/4} ≥8 and x := s^{−1} ≤1/8 (since g ≥4096), we have s^{3δ}/(s^{4δ}−1) ≤2x^{δ} and s^{δ}/(s^{4δ}−1) ≤2(x^{3})^{δ}. Summing over δ, δ^{′} using ∑_{δ≥2}δx^{δ} ≤^{16}_{3}x^{2} and ∑_{δ≥1}δ^{2}(x^{3})^{δ} ≤5x^{3} ≤^{5}_{8}x^{2} gives
16 ( 30)_{2} 23 log g P(S_{3}) ≤3 log g ·_{3}x^{2} + 6 log g · 5x^{3} ≤ 16 + x log g ≤ √ .
Selectable PDF notation • transcription unchecked
8 g
(4) Collision with χ^{±}_{T}^{1} modulo ℓ-parts (S_{4}(c_{0}) for c_{0} ∈𝔽^{×}_{g}, local_estimate_third): If F_{c} has a root x whose prime-to-ℓ part equals that of c_{0} for a prime ℓ̸= g, then the minimal polynomial Q of x (say of degree δ ∈{1, . . . , N}) satisfies (x/c_{0})^{ℓa}= 1 for some prime ℓ^{′}| g^{δ}−1. Let b(δ) count such monic irreducibles Q of degree δ; then δ b(δ) ≤ ∑_{ℓ|g}δ_{−1}ℓ^{vℓ(gδ−1)}. By the divisor bound, P(S_{4}(c_{0})) ≤
Selectable PDF notation • transcription unchecked
∑
_{δ}^{N}_{=1}b(δ)(g^{δ} −1)^{−1}. For δ = 1, since 16qd | g −1 with q, d distinct odd primes and max(q, d) ≥16, factoring out the prime powers of 2, q, d in g −1 yields 4 min(q, d)∑_{ℓ|g−1}ℓ^{vℓ(g−1)} ≤g −1 (prime_power_order_share), giving b(1)/(g −1) ≤1/(4 min(q, d)). For δ ≥2, since 4 | g −1, lifting the exponent gives v_{ℓ}(g^{δ}−1) = v_{ℓ}(δ) + v_{ℓ}(g −1) for ℓ| g −1, and v_{ℓ}((g^{δ}−1)/(g −1)) otherwise; since ∑a_{i} ≤∏a_{i} for integers a_{i} ≥2, this implies δ b(δ) ≤δ(g −1) + (g^{δ}−1)/(g −1) (prime_power_order_count), hence b(δ)(g^{δ}−1)^{−1}≤g^{−(δ−1)}+ δ^{−1}(g −1)^{−1}. Summing over 2 ≤δ ≤N using ∑^{N}_{δ=2}g^{−(δ−1)} ≤(g −1)^{−1} and ∑^{N}_{δ=2}δ^{−1} ≤ log N gives
1 + 1 + log N
Selectable PDF notation • transcription unchecked
P(S_{4}(c_{0})) ≤ .4 min(q, d) g −1
(5) Existence of a degree-a divisor (S_{5}(a) for 1 ≤a ≤N/2, local_estimate_fourth): By (2), P(S_{5}(a)) is bounded by the fraction of π ∈S_{N} stabilizing some a-subset A ⊆{1, . . . , N}. For each π ∈S_{N}, let I(π) ∈{0, 1} indicate whether π stabilizes some a-subset, let M(π) count all π-invariant a-subsets, and let M_{1,1}(π) count those containing a fixed point of π while omitting another fixed point of π. If M_{1,1}(π) ≥1, swapping an inside fixed point with an outside fixed point produces a second invariant a-subset, so M(π) ≥2; in all cases 2I(π)+M_{1,1}(π) ≤2M(π) (IRRLemmaP.prodMaxInvLeSq). Averaging over π ∈ S_{N} gives 𝔼[M] = 1 and 𝔼[M_{1,1}] = (1 −D_{a}/a!)(1 −D_{N−a}/(N −a)!) ≥ 1/4 (where D_{t} is the number of derangements of t elements), hence 2 Prob(I = 1) ≤ 2 −1/4 = 7/4, so
Selectable PDF notation • transcription unchecked
P(S_{5}(a)) ≤7/8.(6) Absence of a large prime-degree factor (S_{6}: no irreducible factor Q | F_{c} of prime degree p with N/2 < p ≤N −3, local_estimate_fifth): By (2), P(S_{6}) is bounded by the probability that π ∈S_{N} has no cycle of prime length p ∈(N/2, N −3]. Since p > N/2, the events of having a p-cycle are pairwise disjoint across distinct primes p, and each has exact probability 1/p (prime_cycle_probability_sum). For N ≥ 100, explicit Chebyshev prime-counting bounds give ∑_{N/2<p≤N−3}1/p ≥ 1/(5 log N) (prime_reciprocal_sum_bound), so P(S_{6}) ≤1 −1/(5 log N) ≤ exp(−1/(5 log N)).
Applying the union bound over the f places in Pl_{G}(j) for S_{1} and S_{3}, over the 2fm pairs (v, χ_{T} (v, i)^{±1}) for S_{4}, over the ⌊N/2⌋≤ N/2 values of a for the joint event ∩_{v}{x_{v} ∈ S_{5}(a)} (of probability P(S_{5}(a))^{f} ≤ (7/8)^{f} by independence), and over the joint event ∩_{v}{x_{v} ∈ S_{6}} (of probability P(S_{6})^{f} ≤ exp(−f/(5 log N))) yields the claimed upper bound on µ_{U}(E_{bad}). Adding f/g from Step 1 proves (310) and hence WeightAllRows A.
Source: Formalism/LocalToGlobal/HilbertRowConditions/AllJoinP.lean:18--25; Formalism/LocalToGlobal/GlobalTheory/ConcNWeight.lean:168--356; Development/AbelianVarietyTheory/Proofs/GlobalInterpolation/LinkIRROfJoinEx.lean:14--15; Formalism/PadicSubsetSums/StableGradedCounts/LocalEstimateIVOfTypeSetWeight.lean:437--476,857--867,1243--1268,1586--1680,1790--1894,2291--2459; Formalism/PadicSubsetSums/StableGradedCounts/SquareSetMemExceptionalUnion.lean:374--584; Formalism/PadicSubsetSums/StableGradedCounts/LocalEstimateThird.lean:10--384; Formalism/PadicSubsetSums/StableGradedCounts/IRRLemmaP.lean:133--214; Formalism/PadicSubsetSums/StableGradedCounts/FourMulSumLeProduct.lean:43--112; Formalism/PadicSubsetSums/StableGradedCounts/ProdPowFactorizationLe.lean:73--130; Formalism/PadicSubsetSums/StableGradedCounts/PropertyWOfEstimates.lean:7
We now construct the automorphic record A ∈ AllRows D and its cylinder idempotents directly from a concrete Hida/automorphic datum (X, G, ι) tied to D.
Proposition 8.150 (Automorphic all-row construction, cylinder idempotents, and AllJoin). Let D be a datum satisfying GapHyp D, and assume RowsFinDim (proved unconditionally by CompanionTheory.D.gk.RF.automorphic_forms_finite_dimensional). Suppose there exist a concrete automorphic setting X ∈ HidaSetting D, a good-row projector datum G ∈ GoodOp X, and an isometric isomorphism ι : D.s.HH −→^{∼} HHX(X) satisfying AutTie D X.B X.pl, RowDictTie X G iota, and GlobalTheory.LabPin.LabTie X iota. Let ψ_{0}(j) : 𝔽_{gj} →ℂ^{×} be the standard nontrivial additive character ZMod.stdAddChar for j ∈{0, 1}. Then there exists an explicit automorphic record A = allRowsOfL X psi0 hpsi hL ∈ AllRows D with A.B = X.B such that:
(a) LabelCountGoodInjective A and AllJoinA A hold (hence AllJoin R A holds for every record R);
(b) for every j ∈{0, 1} and every S ⊆T_{j}, the cylinder test function e_{T} (cyl(j, S)) is an admissible level idempotent (IsAdmIdem) with unipotent support at the partner prime g_{1−j} (EtUnip), and satisfies the counting-idempotent factorization IsCountIdem (PCountTie) with modulus g_{1−j} and complementary prime g_{j}.
Proof. Let K_{f} := X.B.I.Kset ≤ G_{f} be the maximal compact open subgroup of the finite-adelic unitary group, K(m) := X.B.I.Kg(m) ◁K_{f} the principal congruence subgroup of level m, g := g_{0}g_{1} = X.B.g, and V (X) := µ_{f}(K(g)) > 0. We construct the cylinder convolution algebra and verify each property in four steps.
Step 1: Kernel and surjectivity of the mod-g reduction map (RedKerP, RhoSurj). At each auxiliary prime g_{j} (j ∈{0, 1}), the CM field E has degree [E : ℚ] = 2f and g_{j} splits completely in E into 2f prime ideals, with g_{j} /∈𝔭^{2} for every prime 𝔭 | g_{j} (AllRowsRedKer.unram). The f places Pl_{G}(j) and their complex conjugates are pairwise distinct and disjoint, hence exhaust all 2f places above g_{j} (AllRowsRedKer.cover). Consequently, if x ∈ K_{f} reduces to the identity modulo every v ∈ Pl_{G}(j), then by unitarity of x it also reduces to the identity modulo every conjugate place ̄v, hence x ∈ K(g_{j}) (redKerP_holds). Since gcd(g_{0}, g_{1}) = 1, K(g_{0}) ∩K(g_{1}) = K(g) (Kg_inter), so the product reduction homomorphism ρ_{X} : K_{f} →G_{0,g} has exact kernel K(g) (redKerOne_holds, redKer_of). By strong-approximation/local surjectivity on the finite-adelic product over the places dividing g, the standard product reduction ψ : K_{f} ↠∏_{p∈TypX} GL_{r}(𝔽_{gp}) is surjective onto a finite group of cardinality |G_{0,g}|, and its kernel contains K(g) = ker(ρ_{X}). Therefore ψ factors through im(ρ_{X}), forcing | im(ρ_{X})| ≥|G_{0,g}| and hence surjectivity of ρ_{X} : K_{f} ↠G_{0,g} (RhoSurjW.reduction_map_surjective).
Step 2: Level-subgroup identification and cylinder convolution algebra (KppShape, EtUniv, EtAlg, EtOne, EtUnip, IsCountIdem). Let K_{2} := X.K_{2} ≤ K_{f} and χ_{2} : K_{2} → ℂ^{×} be the level subgroup and character defining X.B.e(x) = 1_{K2}(x)χ_{2}(x)/µ_{f}(K_{2}). Since K(g) ≤K_{2} ≤K_{f}, the forward level description KppFwd provides P ∈G_{0,g} and nontrivial additive characters ψ_{j,v} : 𝔽_{gj} →ℂ^{×} such that every x ∈K_{2} satisfies P_{j,v}^{−1}ρ_{X}(x)_{j,v}P_{j,v} ∈ J_{k,s}(g_{j}) and χ_{2}(x) = ∏_{j,v}ψ_{j,v}(ϕ_{k,s}(P^{ −}_{j,v}^{1}ρ_{X}(x)_{j,v}P_{j,v})). The index identity dstar
Idx_holds gives [K_{2} : K(g)] = c_{J}(g_{0})^{f}c_{J}(g_{1})^{f} = ∏_{j,v}|J_{k,s}(g_{j})|, so the image ρ_{X}(K_{2}) has the same cardinality as the conjugate product ∏_{j,v}P_{j,v}J_{k,s}(g_{j})P^{ −}_{j,v}^{1} and therefore equals it (kppShape_of_fwd).
For every S ⊆T^{(2)}, define the central idempotent E_{S} ∈ℂ[G_{0,g}] by
Selectable PDF notation • transcription unchecked
∑ ⊗
E_{S} := e_{Ser,j}(monic(a_{j,v})),
Selectable PDF notation • transcription unchecked
a∈∏_{j,v}𝔽^{r}_{gj} j,v
tup(a)∈Slift any u ∈ℂ[G_{0,g}] to the K(g)-bi-invariant function eg_{A}(u)(x) := 1_{Kf} (x) u(ρ_{X}(x))/V (X) on G_{f}, and define the cylinder test function and operator
e_{T} (S) := X.B.e ∗_{µf} eg_{A}(E_{S}), R_{eT (S)} := right-convolution by e_{T} (S) on L^{2}.
Using a section sec : G_{0,g} → K_{f} of ρ_{X}, the map f →→ f̂(γ) := V (X)f(sec(γ)) is an algebra isomor-phism from K(g)-bi-invariant functions supported on K_{f} (under µ_{f}-convolution) to ℂ[G_{0,g}]. Under this isomorphism:
Selectable PDF notation • transcription unchecked
⊗ ( )
• e^{̂}_{T} (S) = X.B.e^{̂} · E_{S}, where by KppShape, X.B.e^{̂} =_{j,v} [P_{j,v}]e_{J,j}(ψ_{j,v})[P_{j,v}]^{−1} (AllRowsEtOne.Ehat_eq).
• For S = T^{(2)}, Lemma 8.147(c) gives E_{T} (2) = 1 ∈ ℂ[G_{0,g}], so eg_{A}(E_{T} (2)) = 1_{K(g)}/V (X) and e_{T} (T^{(2)}) = X.B.e (etUniv_of), hence R_{eT (T} (2)_{)} = X.B.Re (reT_univ).
• Since both X.B.e^{̂} and the central element E_{S} are self-adjoint idempotents in ℂ[G_{0,g}], so is their prod-
uct e^{̂}_{T} (S). Transporting back gives e_{T} (S)∗_{µf} e_{T} (S) = e_{T} (S) and e_{T} (S)(x^{−1}) = e_{T} (S)(x). Writing
Selectable PDF notation • transcription unchecked
∫
e_{T} (S)(x^{−}_{i}^{1}x_{j}) = e_{T} (S)(z^{−1}x_{i})e_{T} (S)(z^{−1}x_{j}) dµ_{f}(z) shows that e_{T} (S) is of positive type (posType_of), establishing EtAlg.
• For a cylinder cyl(j, S) (S ⊆T_{j}), the non-cylinder coordinates at the partner prime g_{1−j} sum over all labels to 1, so E_{cyl(j,S)} is supported on the subgroup G_{2} := {γ ∈G_{0,g} : γ_{1−j,v} = 1 ∀v}. Consequently, for x ∈ supp(e_{T} (cyl(j, S))), the projection of ρ_{X}(x) to the g_{1−j}-factor coincides with that of an element of K_{2}, which is unipotent modulo g_{1−j} (levelSubgroup_unipotent_mod, etUnip_of). This establishes EtUnip and hence IsAdmIdem. Moreover, splitting ρ_{X} : K_{f} ↠ G_{1} × G_{2} into the g_{1−j}-
factor G_{1} and g_{j}-factor G_{2} (redD) factors e_{T} (cyl^{̂}(j, S)) = ̂e_{1} ⊗(ê_{2} ·E_{cyl(j,S)}) with central idempotent E_{cyl(j,S)} on G_{2} and unipotent support on G_{1}, establishing IsCountIdem (isCountIdem_cyl, pCountTie_holds).
• Evaluating at 1 ∈ K_{f} via e_{T} (cyl(j, S))(1) = (X.B.e^{̂} · E_{cyl(j,S)})(1)/V (X), applying conjugation invariance tau_conjP to cancel P_{j,v}, applying Lemma 8.147(b) to replace every ψ_{j,v} by the uniform standard character ψ_{0}(j) and to ensure reality of each factor, and summing the partner-prime coordi-nates via Lemma 8.147(c) yields the exact identity (303) with e_{j,v} = e_{J,j}(ψ_{0}(j)) (AllRowsEtOne.etOne_of).
Step 3: Orthogonal label decomposition and exact row counts (RowsAdd, RowsGood, RowsLab). Let labT ⊆ T^{(2)} be the finite set of all tuples of valid labels. Because E_{S} =∑_{t∈labT∩S}E_{{t}} with E_{{t}}E_{{t}′_{}}= δ_{t,t}′E_{{t}}, the operators R_{eT ({t})} are mutually orthogonal self-adjoint idempotents commuting with the archimedean action R(g_{∞}, 1) and with X.R_{φ}, and satisfy R_{eT (S)} = ∑_{t∈labT∩S}R_{eT({t})} (reT_split, reT_orth). Under RowsFinDim and GapHyp D, the ambient multiplicity space eHom(X.B.Re) is finite dimensional (eHom_fin), so finite direct-sum additivity of finrank under mutually orthogonal idempotents (finrank_map_sum) gives
Selectable PDF notation • transcription unchecked
∑
dim_{X}(S) = dim_{X}({t}) (RowsAdd),
Selectable PDF notation • transcription unchecked
t∈labT∩S
and in particular, taking S = T^{(2)} and using AutTie.D_eq, D_{all} = X.B.D =∑_{t∈labT} dim_{X}({t}) (rowsTot_of).
For each t ∈ labT, let V_{T} (t) := HHX(X) ∩ker(R_{eT ({t})} −Id). Because R_{eT ({t})} commutes with X.R_{φ} and satisfies R_{eT ({t})}X.B.Re = R_{eT ({t})}, the image of R_{eT ({t})} ∘X.R_{φ} is exactly V_{T} (t) (HH_eq_VT), so the discrete-series multiplicity bijection RowsBij_holds gives dim_{X}({t}) = dim_{ℂ} V_{T} (t) (dcountEq_holds). By ES_good, E = D.ntypes.e_{0}, so for every good t we have G.R_{g} ∘R_{T} = R_{T}, meaning
{good} e ({t}) e ({t}) V_{T} (t) ≤ goodSub(X, G), while distinct t ̸= t^{′} give V_{T} (t) ⊥V_{T} (t^{′}) (projT_of). By RowDictTie X G iota, the transported good-row basis vectors b_{Row}(σ) := ι(D.sEE(onb(σ))) (σ ∈{1, . . . , D_{rows}}) are linearly independent and span goodSub(X, G). By LabTie X iota, each b_{Row}(σ) has a valid good label t(σ) and lies in V_{T} (t(σ)). Splitting the expansion of any φ ∈V_{T} (t) into the terms with t(σ) = t and t(σ) ̸= t and taking the inner product against the orthogonal complement shows that the t(σ) ̸= t part vanishes; hence {b_{Row}(σ) : t(σ) = t} is a basis of V_{T} (t), yielding
#{σ : t(σ) = t} = dim_{ℂ} V_{T} (t) = dim_{X}({t}) (RowsGood).
⊔ Step 4: Re-indexing and assembly of A. Form the disjoint union R_{idx} := {1, . . . , D_{rows}} ⊔
{1, . . . , dim_{X}({t})}. By RowsGood and rowsTot_of, |R_{idx}| = D_{all}. Choosing any bijection t∈labT, ¬good(t)
Selectable PDF notation • transcription unchecked
∼
{1, . . . , D_{all}} −→ R_{idx} yields labels λ_{all} and an injection inc : {1, . . . , D_{rows}} ↪→{1, . . . , D_{all}} satisfying RowsLab (exists_lab, rowsLab_of). Packaging X.B, λ_{all}, inc, e_{j,v} := e_{J,j}(ψ_{0}(j)), e_{T} , and R_{eT} defines A := allRowsOfL X psi0 hpsi hL ∈ AllRows D, which satisfies LabelCountGoodInjective A (thirdTie_allRows), RowsTie D A.B (from AutTie, hc_X, and splits_X), and LevelSharp A by construction, proving (a) and (b).
Source: Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/AllRowsOf.lean:23--78,221--325,407--553,681--742,763--883,894--1119; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/AllRowsRedKer.lean:72--165; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/RhoSurjPf.lean:71--144; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/AllRowsKpp.lean:14--271; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/AllRowsEtAlg.lean:16--135; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/AllRowsEtOne.lean:28--364; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/AllRowsPCount.lean:17--706; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/AllRowsAdd.lean:140--348; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/AllRowsAddFin.lean:15--29; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/AllRowsDcount.lean:15--68; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/RowsGoodRed.lean:20--215; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/AllRowsLab.lean:13--26; For-malism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/AllRowsClosed.lean:16--50; Formalism/LocalToGlobal/SiegelLatticeTheory/FlagStabilizerTensors/RootLatticeThresholds/AllRowsCountBase.lean:17--83
Proposition 8.151 (Unitary automorphic counting theorem and cylinder counts). Assume the convergent unitary Siegel–Weil formula HeckeCharacterZeroLocus.SiegelWeilU.SiegelWeilUnitaryConvergent (proved without axioms in Lean at GlobalTheory.CompanionTheory.SW.siegelWeilUnitaryConvergent).
(a) (count_typed_of_volumeStep, count_constants_of_siegelWeil) For every real exponent A_{lev}, there exist constants n_{0}(A_{lev}) ∈ℕ and C_{0}(A_{lev}) ≥0 such that for all n_{1} ≥n_{0}(A_{lev}), all C ≥C_{0}(A_{lev}), and every automorphic counting instance (I, b, λ, g, g_{0}, e, σ, w, µ_{f}, ℱ, R, R_{e}, h) satisfying HidaSetting
and CountData with rank n ≥n_{1}, degree f = [F : ℚ], root discriminant r_{d}, gap h ≥Cn^{19}f^{5} log(br_{d}), log f ≤^{√}n, and log log b ≤_{16}^{1}nf log n, the multiplicity space is finite dimensional and
Selectable PDF notation • transcription unchecked
( 1 )
|D(e) −D_{∗}(e)| ≤ exp −_{16}nf log n D_{∗}(e). (311)
In particular, setting c_{b} := 1/16, c_{Ic} := 1/16 > 0, and A_{lev}(Fm) := 2(C_{YL}(Fm) + 1), every family Fm satisfies CountAllPointsClass P Fm for any predicate P on test functions.
(b) (allRows_at_record) Under the hypotheses of Proposition 8.150, if in addition D and its scale data satisfy the parameter inequalities CountTheoremHypotheses for (n_{0}, A_{lev}, C_{3}, 1/16) and 4r < g_{1}, then the same record A = allRowsOfL X psi0 hpsi hL ∈ AllRows D constructed in Proposition 8.150 satisfies
Selectable PDF notation • transcription unchecked
( )
LabelCountGoodInjective A ∧ AllJoinA A ∧ CountAllRows A exp(−c_{Ic}rf log r) (312)
with c_{Ic} = 1/16.
Proof. For (a), we trace the three stages from SiegelWeilUnitaryConvergent to (311):
Stage 1: Convergent Siegel–Weil to VolumeStep (volumeStep_of_siegelWeil). Applying SiegelWeilUnitaryConvergent at rank n = 1 to any nondegenerate Hermitian space of dimension M ≥3 (so 2·1 < M) and compactly supported smooth archimedean test functions produces OneVectorCc (oneVectorCc_of_siegelWeil) and the compactly supported lattice-sum mean formula SiegelMeanCc (siegelMeanCc_of_oneVectorCc). Approximating the archimedean Gaussian exp(−‖y‖^{2}) monotonically from below by compactly supported smooth functions yields SiegelMean: on a fundamental domain ℱ of U(V )(F)\U(V )(𝔸_{F} ), the integral of the Gaussian theta sum over vectors y ∈Λ(x) of norm ±1 equals µ(ℱ) · meanConst(E, M)∏_{v}D_{v}(±1), where D_{v}(±1) > 0 is the archimedean quadric density. Unfolding the same sum over the stabilizer of a norm-±1 vector (whose orthogonal complement is an (M −1)-dimensional Hermitian space V^{′}) cancels the positive product ∏_{v}D_{v}(±1) and yields the exact gauge-volume recursion VolumeStep relating vol(U(V )) to vol(U(V^{′})) (volumeStep_of_siegelMean).
Stage 2: Inductive flag volumes and lowest-K-type decay (countingTheorem_of_volumeStep). Inducting on dimension via VolumeStep supplies three geometric measure inputs: the absolute Hermitian volume bound (AbsoluteVolume), the isotropic flag probability bound (FlagMeasureBound), and the nonzero flag rareness estimate (FlagRare): for q^{2}≤n, log r_{d} ≤e^{n}, log f ≤^{√}n, and sufficiently large n,
Selectable PDF notation • transcription unchecked
( ) ( 1 )
Prob τ_{1}(x) < 1/2 ≤ exp −_{4}nf log n ,
where τ_{1}(x) = least(x) is the shortest isotropic lattice length at x ∈ℱ. Independently, at the archimedean places, the lowest-K-type compression formula of Proposition 8.116 and the principal-minor decay of Propo-sition 8.103(⊗ supply the Hilbert–Schmidt decay bound () DecGap, PtBound): writing φ_{v}(g) := d_{v}⟨w_{v}, σ_{v}(g)w_{v}⟩ and Φ :=_{v}φ_{v} ⊗e, we have Φ(1) = (∏_{v}d_{v})e(1), 0 ≤ Re(e(1)), |e(x)| ≤ Re(e(1)), supp(e) ⊆K_{f}, and for h > 8n min(p, q),
Selectable PDF notation • transcription unchecked
(∏ ) ∏ ( h ( d_{HS}(y_{v}) ))|Φ(y)| ≤ d_{v} Re(e(1)) exp −_{8} min d_{HS}(y_{v})^{2}, √ . 2 min(p, q)
Selectable PDF notation • transcription unchecked
v v
Together with AbsoluteVolume, this yields finite dimensionality of the multiplicity space (finiteDimensional_rowsSpace_discreteSeriesCount).
Stage 3: Trace-formula splitting and absorption (countingTheorem_of_finite_of_bounds, abs_sub_le_exp_neg_sixteenth_mul). When q = 0 (the definite case), the quotient is compact and the unipotent mod-ulus condition 4n < g_{0} eliminates every non-identity rational element, giving D(e) = D_{∗}(e) identi-cally (definiteUnitaryGroup_count_eq_mainTerm). When q ≥ 1, the automorphic kernel K_{Φ}(x, x) =
Selectable PDF notation • transcription unchecked
∑
_{γ∈G(F)}Φ(x^{−1}γx) is nonnegative and integrates over ℱ to D(e) (kernelB'), while the identity term γ = 1 integrates over ℱ to D_{∗}(e) = (∏_{v}d_{v}) Re(e(1)) vol(ℱ). Split ℱ into the moderate region ℳ := {x ∈ℱ : τ_{1}(x) ≥τ_{∗}} and the deep region 𝒟 := {x ∈ℱ : τ_{1}(x) < τ_{∗}} (where τ_{∗}< 1/2). On ℳ, decompose γ ̸= 1 into near elements (max_{v} d_{HS}((x^{−1}γx)_{v}) ≤ε_{N}) and far elements:
• For near elements, UnipMod(g_0) together with 4n < g_{0} and complete splitting of g_{0} forces every near element to be unipotent (near_unipotent); on {τ_{1}(x) ≥1/2} no nontrivial near element survives, and integrating over the flag-type stratification of ℳ∩{τ_{1} < 1/2} via FlagMeasureBound bounds the near integral by exp(−_{4}^{1}nf log n)D_{∗}(e) (nearModerate).
• For far elements on ℳ, the exponential Hilbert–Schmidt decay in PtBound combined with FlagMeasureBound bounds the integral by exp(−n^{2}f)D_{∗}(e) (farTermsModerateRegion_of_flagBound).
• On the deep region 𝒟, the diagonal kernel integral is bounded by D(e) exp(−n^{2}f) (deepRegion_kernelDiagonal_bound), while the missing identity-term mass is at most Prob(τ_{1} < 1/2)D_{∗}(e) ≤ exp(−^{1}_{4}nf log n)D_{∗}(e) by FlagRare.
Combining these four bounds via the triangle inequality gives
Selectable PDF notation • transcription unchecked
( ( 1 ) )
|D(e) −D_{∗}(e)| ≤ 2 exp −_{4}nf log n + exp(−n^{2}f) D_{∗}(e) + exp(−n^{2}f) D(e).
Taking n ≥⌈e^{15}⌉ and f ≥1, we have n ≥16, log n ≥15, nf log n ≥240, nf log n ≤n^{2}f, and log 8 ≤7, so exp(−^{1}_{4}nf log n) ≤^{1}_{8} exp(−_{16}^{1}nf log n) and exp(−n^{2}f) ≤^{1}_{8} exp(−_{16}^{1}nf log n) ≤^{1}_{2}. Writing D(e) ≤ D_{∗}(e) + |D(e) −D_{∗}(e)| and moving ^{1}_{2}|D(e) −D_{∗}(e)| to the left yields
Selectable PDF notation • transcription unchecked
1 (2 ) ( 1 )
|D(e) −D_{∗}(e)| ≤ + 1+ 1 exp −_{16}nf log n D_{∗}(e),
Selectable PDF notation • transcription unchecked
2 8 8 8
proving (311) (abs_sub_le_exp_neg_sixteenth_mul). Unbundling into PointsLemma and CountIdempotentsClass with c = c_{b} = c_{Ic} = 1/16 gives (a).
For (b), under AutTie, CountTheoremHypotheses, and 4r < g_{1}, Lemma AllRowsCountBase.countBase_of produces CountBase X for both partner primes g_{1−j} (j ∈{0, 1}) together with D_{∗}(X.B.e) = D.what_{2}.D_{∗}> 0. By Proposition 8.150(b), every cylinder test function e_{T} (cyl(j, S)) satisfies IsAdmIdem and IsCountIdem with modulus g_{1−j}, so tieCountAt_allRowsOf verifies TieCountAt for A = allRowsOfL X psi0 hpsi hL. Applying (a) (via countCylAt_of and countAllRows_of) gives CountAllRows A with error exp(−c_{Ic}rf log r) and c_{Ic} = 1/16, establishing (312).
Source: Development/AbelianVarietyTheory/Proofs/FlagMeasures/VolumeStepOfSiegelWeil.lean:13--19; Devel-opment/AbelianVarietyTheory/Proofs/FlagMeasures/EnnrealVolumeRatioStepCancel.lean:18--120; Development/AbelianVarietyTheory/Proofs/FlagMeasures/UnitaryAutomorphicCountingOfCompactDualVolumeRat.lean:37--51; Development/AbelianVarietyTheory/Proofs/FlagMeasures/DiscreteSeriesCountingOfFiniteAndBounds.lean:34--143; Development/AbelianVarietyTheory/Proofs/FlagMeasures/AbsSubLeExpNegSixteenthMul.lean:7--44; Development/AbelianVarietyTheory/Proofs/FlagMeasures/CountTypedOfVolumeStep.lean:12--20; Development/AbelianVarietyTheory/Proofs/FlagMeasures/CountConstantsOfSiegelWeil.lean:11--25; Development/AbelianVarietyTheory/Proofs/FlagMeasures/AllRowsAtRecord.lean:24--97; Formalism/SharpRestriction/LevelLetterCocycles/JointConditionsZpowers/JCountP.lean:12--24
Theorem 8.152 (Closed-family all-row producer and selected irreducibility link). Assume Green’s cuspi-dal parametrization GlobalTheory.GLq.Green (Proposition 4.1), the convergent unitary Siegel–Weil formula HeckeCharacterZeroLocus.SiegelWeilU.SiegelWeilUnitaryConvergent, and RowsFinDim.
(a) (irr_row_closed, row_counts_of_ties_alt, row_counts_of_labels_alt) For every family class 𝒞 on which TuSize Fm holds (in particular 𝒞 = 𝒟_{3}(3, 𝒜)) and on which each family eventually admits concrete tied automorphic data (X, G, ι) satisfying AutTie∧RowDictTie∧LabTie (as supplied on built bundle points by RowLabelCondition), the closed-class irreducibility counting premise irrC holds with explicit constant c_{Ic} = 1/16 > 0: for every Fm ∈𝒞, there exists a threshold x_{0} such that for all x ≥x_{0} and all i ∈ Fm.Ix(x), there exists A ∈ AllRows (Fm.D x i) satisfying (312). Together with
Proposition 8.151(a), this discharges CountsIrreducibilityConstants'.
(b) (linkIRR_of_join_ex, closed_linkIRR_of_join_count) Let 𝒜 be a family class with twist selection sel realizing NormalizedTypesCompatibility along each family Fm ∈𝒟_{3}(3, 𝒜), and assume irrC holds on 𝒟_{3}(3, 𝒜) with some c_{Ic} > 0 (in particular c_{Ic} = 1/16 from (a)). Then LinkIRR Fm holds on the closed class 𝒟_{3}(3, 𝒜): for every Fm ∈𝒟_{3}(3, 𝒜), there exists one threshold x_{∗} independent of all member indices such that for all x ≥x_{∗} and all i ∈ Fm.Ix(x), the stored irreducibility defect of the selected member satisfies 0 ≤δ_{p} ≤ exp(−x^{εz/7}). (313)
Proof. For (a), Proposition 8.151(a) produces the counting constant map c_{30} with c = c_{b} = c_{Ic} = 1/16 and A_{lev}(Fm) = 2(C_{YL}(Fm) + 1). On any closed family class 𝒞 satisfying TuSize, GlobalTheory.IrrCountEv.countClauses_closed combines the standing parameter inequalities with x^{ε/8} →∞ to show that eventually (uniformly in i ∈ Fm.Ix(x)) every member satisfies CountTheoremHypotheses for c_{30} together with 4r < g_{1}; similarly, GapClosed.gapEv_closed_of verifies GapHyp eventually. Taking the maximum of the three eventuality thresholds (the concrete-tie threshold x_{1}, the parameter threshold x_{2}, the gap threshold y, and Fm.x_{1} + 1) and applying Proposition 8.151(b) pointwise yields (312) uniformly for all x ≥x_{0} and all i ∈ Fm.Ix(x), proving irr_row_closed and hence CountsIrreducibilityConstants'.
For (b), let Fm ∈𝒟_{3}(3, 𝒜) with accuracy 0 < ε ≤1 and ε_{z} = ε/J > 0. Let x_{irr} be the threshold from irrC and x_{sel} be the threshold from sel. Set
Selectable PDF notation • transcription unchecked
( ) ( )
x_{0} := max x_{irr}, x_{sel}, Fm.x_{1} + 1, 4 , x_{0}^{′} := max x_{0}, (3/2)^{1/εz} .
For every x ≥x^{′}_{0} and i ∈ Fm.Ix(x):
(1) irrC provides A ∈ AllRows (Fm.D x i) satisfying LabelCountGoodInjective A, AllJoinA A, and CountAllRows A with error exp(−c_{Ic}rf log r);
(2) since x > Fm.x_{1} and x ≥x_{sel}, the twist selection sel provides NormalizedTypesCompatibility on the same member Fm.D(x, i), so Proposition 8.148 yields admLq (Fm.D x i);
(3) since x > Fm.x_{1} and x ≥4, the family size bounds give SizesRec (Fm.D x i) x Fm.ez 6 (sizesRec_at, with C_{s} = 6 as verified in Proposition 8.80), and x ≥(3/2)^{1/εz} gives x^{εz} ≥3/2;
(4) by Proposition 8.149, TieAdmG and RangeW hold, so weight_of_join converts AllJoinA A and admLq into WeightAllRows A on the same record A.
Applying Proposition 8.80 (ConcNP.linkIRR_of_allRows with C_{s} = 6 and c = c_{Ic}) yields a single threshold x_{∗} ≥ x_{0}^{′} independent of all member indices beyond which (313) holds, proving LinkIRR Fm on 𝒟_{3}(3, 𝒜). This is the exact irreducibility supplier plugged into UpperTheory.Top.shape_closed_link_n_of_green.
Source: Development/AbelianVarietyTheory/Proofs/FlagMeasures/CountClausesClosed.lean:58--99; Develop-ment/AbelianVarietyTheory/Proofs/FlagMeasures/RowsFinDimLink.lean:7--8; Development/AbelianVarietyTheory/Proofs/FlagMeasures/IrreducibilityRowOfConcreteAutomorphicData.lean:18--43; Development/Abelian
VarietyTheory/Proofs/FlagMeasures/IrreducibilityRowOfConcreteAutomorphicDataStatement.lean:13; Devel-opment/AbelianVarietyTheory/Proofs/GlobalInterpolation/RowCountsOfLinkedTies.lean:14--24; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/RowCountsOfTies.lean:12--22; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/RowCountsOfLabels.lean:13--14; Development/AbelianVarietyTheory/Proofs/GlobalInterpolation/LinkIRROfJoinEx.lean:14--166; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/LinkIrr.lean:22--44; Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/TopShape.lean:33--55