Section 5 · PDF pages 229–241
The local parameter input
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
5 The local parameter input
Let E be a number field, let Ω/E be an algebraic closure, and choose a valuation of Ω above a finite place w of E. Write k = E_{w}, and write W_{k} and I_{k} for the resulting Weil and inertia groups. We use the reci-procity convention in which a uniformizer corresponds to geometric Frobenius. Thus the inverse reciprocity homomorphism a : W_{k} −→k^{×} has v_{k}(a(σ)) = − deg(σ) when the degree of arithmetic Frobenius is one.
Write ℐ(k) = ∐_{n≥0} Irr(GL_{n}(k)) for isomorphism classes of irreducible smooth complex representa-tions, with their degrees, and write 𝒲(k) for the Weil–Deligne classes used below. A character twist of π means π ⊗(χ ∘ det); write πν^{s} when χ = | · |^{s}_{k}. A cuspidal class is called good if its degree is one, or if k ≃ ℚ_{p} as a topological field and the class is a character twist of a depth-zero cuspidal class. A general irreducible class is good if its cuspidal support consists of good cuspidal classes. Here depth zero means the existence of nonzero vectors fixed by the principal congruence subgroup K_{1} = 1 + 𝔭_{k}M_{n}(𝒪_{k}).
Definition 5.1 (The required parameter laws). The local parameter input is the existence, for every choice above, of a and a map R : ℐ(k) →𝒲(k) with the following properties. It preserves degree, sends a character χ to χ∘a, and sends cuspidal classes to irreducible Weil parameters. It commutes with real unramified twists. If 𝔪 is the Langlands multisegment of π, then
Selectable PDF notation • transcription unchecked
⊕ ( )
R(π) = R(ρ_{∆}) (ℓ_{∆}−1)/2 ⊗ Sp(ℓ_{∆}), (F13.1)
Selectable PDF notation • transcription unchecked
∆∈𝔪
where ρ_{∆} is the first cuspidal class of the segment. For every central character ω_{π},
| det R(π)(σ)| = |ω_{π}(a(σ))|. (F13.2)
For good π the following stronger assertions hold:
Selectable PDF notation • transcription unchecked
R(π ⊗χ) = R(π) ⊗(χ ∘a),
det R(π)(σ) = ω_{π}(a(σ)), (F13.3)
Selectable PDF notation • transcription unchecked
R(π^{∨}) = R(π)^{∨}.If π^{′} is good and R(π) = R(π^{′}), then π = π^{′}. If good π has K_{1}-fixed vectors, then R(π) is tame. Finally R satisfies the explicit tame type condition of Proposition 5.5 below, including zero monodromy and the specified inertia characteristic polynomial.
These are precisely the twelve fields of the local statement called RecTExists in the source. The restric-tions to good classes are part of the statement: existence of this map is weaker than the full local Langlands correspondence. In particular, the source’s construction is permitted to choose unrelated parameters on other cuspidal twist orbits. We retain its statement rather than silently strengthening the claimed input.
Proposition 5.2 (Reduction of the F-13 assembly). The F-13 assembly adds no property to its first input. Its required local parameter statement is exactly the existence statement in Definition 5.1 supplied before that assembly.
Proof. Denote the twelve supplied assertions by H_{0}, H_{1}, . . . , H_{11}, with H_{0} the required local parameter existence statement. The combining function is
Selectable PDF notation • transcription unchecked
(H_{0}, H_{1}, . . . , H_{11}) −−→H_{0}.It therefore returns the same family of parameter maps and the same proof of each law as the first input; none of the other eleven assertions is used to establish a new law. The first input is itself the local-parameter component of the already supplied package. This proves the assertion without any assumption about the truth of H_{1}, . . . , H_{11}.
For source identification, the last proposition reads the actual function at LlOf.lean, lines 18–21; the application is EveryCharacterOfLiteratureOfVWin.lean, lines 313–314, and its first argument is the projec-tion at lines 283–284. Consequently an ordinary proof must establish the local parameter input itself. Citing local converse, Brauer induction or the geometric lemma at this application cannot substitute for it.
Remark 5.3 (The twelve arguments). In order, the arguments are: local parameter existence; local converse for cuspidal GL_{m+1} against GL_{m} twists; propagation of K_{1}-fixed vectors from cuspidal support; degree-zero Brauer induction; Chevalley’s unit congruence assertion; global Artin reciprocity; existence of a Lang-lands multisegment; uniqueness and the two-factor subquotient property of multisegments; the standard-module cosocle assertion; the polynomial description of the Grothendieck ring; the geometric lemma with cell semisimplification; and Bernstein–Zelevinsky finiteness and contragredient compatibility. Each of the last eleven is eliminated from this application by Proposition 5.2. This resolves their role in F-13; it does not claim that other applications of those assertions have thereby been proved. The separate source construction of the first input does use some classification and finiteness statements.
Proposition 5.4 (Extension from cuspidal parameters). Assume the Langlands classification in the following precise form: each irreducible class π has a unique finite multiset 𝔪(π) of segments, and a cuspidal class ρ has the single segment (ρ, 1). Given any assignment r(ρ) of Weil–Deligne classes to cuspidal classes, formula (F13.1) defines an assignment R independent of the order of the multiset. It is the unique assignment with that formula, and R(ρ) = r(ρ) on cuspidal classes.
Proof. For every π choose a list of the segments in 𝔪(π) and take the direct sum in (F13.1), with r in place of R on each first cuspidal class. Two lists of the same multiset differ by a permutation. Interchanging adjacent summands is implemented by (u, v) →→ (v, u); reassociating is implemented by ((u, v), z) →→ (u, (v, z)). Both maps intertwine the Weil action and monodromy. Thus the direct-sum isomorphism class is unchanged by a permutation, and the assignment is well defined. If another list is asserted to be the Langlands multisegment of π, uniqueness of that multisegment makes it a permutation of the chosen list, proving the required formula for every such list. The formula also determines R(π), giving uniqueness.
For cuspidal ρ, the one segment has length one. Its exponent (1 −1)/2 is zero, and Sp(1) is the trivial one-dimensional parameter with zero monodromy. The map v ⊗z →→zv intertwines the Weil action; it also intertwines monodromy, since the tensor monodromy is N ⊗1 + 1 ⊗0. Hence the resulting parameter is r(ρ). As the first element of every segment is cuspidal, replacing r by R in the direct-sum formula changes no summand. This proves the assertion exactly in the form needed for (F13.1).
This is the mathematical construction in LanglandsExtensionUniqueOnCuspidal.lean, lines 34–56. Its classification premise must be checked in the quotient convention used for (F13.1). Zelevinsky’s original
Theorem 6.1 is stated using irreducible submodules of products of his segment representations, rather than the standard-quotient convention used here. We therefore do not cite that theorem alone as the unproved convention change.
Proposition 5.5 (Transport of the tame type formula). Suppose k ≃ℚ_{p}, let L/k be an unramified extension of degree n > 0, and let K be its residue field, of order p^{n}. Identify I_{L} with I_{k} through this unramified extension. Define
Selectable PDF notation • transcription unchecked
c_{L} : I_{k} −→K^{×}, c_{L}(t) = a_{L}(t), (F13.4)where a_{L} is inverse local reciprocity with the convention fixed above. Let θ : K^{×}→ℂ^{×} be regular under z →→z^{p}. Suppose a cuspidal finite-group representation τ has the corresponding Green character, and the restriction of an irreducible smooth π to GL_{n}(ℤ_{p}) contains its inflation. The pointwise tame type assertion is
Selectable PDF notation • transcription unchecked
n∏−1(_{j} )N_{R(π)} = 0, det(X −R(π)(t)) = X −θ(c_{L}(t)^{p} ) (t ∈I_{k}). (F13.5)
Selectable PDF notation • transcription unchecked
j=0
If this assertion holds for all these data and their equivalent residue realizations, it implies the global-valuation type law required in Definition 5.1.
Proof. In the global-valuation statement choose the auxiliary number field E^{′}/E and its place w^{′} as specified there. Its completion L = E_{w}^{′}_{′} has residue field of cardinality p^{n}. The condition p /∈(𝔭_{w}′)^{2} says that the normalized valuation of p is one. Thus its ramification index over ℚ_{p} is one; its residue degree is n, so L/ℚ_{p} is the required unramified degree-n extension. The chosen residue map identifies 𝒪_{E}′/𝔭_{w}′ with K.
An inertia element t^{′} over E^{′} restricts to an inertia element t over E: it stabilizes the same valuation subring, and acts trivially on its residue field, properties unaffected by forgetting the larger scalar field. Under the chosen local identifications this is the standard inclusion I_{L} → I_{k}, which is an isomorphism because L/k is unramified.
The source asks for the formula when an algebraic integer x, with reduction z ∈K^{×}, satisfies v(a_{L}(t^{′})− x) > 0. This inequality is exactly equality of their residue classes, so (F13.4) gives c_{L}(t) = z. Substitute it
in (F13.5). The resulting polynomial is ∏_{j<n}(X −θ(z^{pj})), the required polynomial on the restricted global inertia element. Zero monodromy is the first assertion of (F13.5). Every datum in the global type law has just been treated, proving the implication.
The last proof is the used direction of TypeIff.lean, lines 46–57. Its residue homomorphism is the map called R in that file, characterized by equality with the reduction of local reciprocity on every lift from I_{L}. The proposition separates that functorial residue identification from the substantive representation-theoretic assertion (F13.5). In particular, a citation asserting mere existence of the local Langlands bijection does not, without its tame-type compatibility, establish (F13.5).
Proposition 5.6 (The twelve-law seed assembly). Suppose the following data and compatibility statements have been established for k.
(i) There is an assignment r on cuspidal classes, preserving degree and irreducibility, with the character, real unramified twist and absolute determinant laws of Definition 5.1. On good cuspidal classes it also commutes with character twists and duals, has the exact determinant law, is injective against arbitrary cuspidal classes, and is tame at depth zero. It has the pointwise type law (F13.5). An irreducible smooth representation containing the inflation of the specified finite cuspidal type is cuspidal.
(ii) The Langlands classification of Proposition 5.4 is compatible with character twists and contragredi-
ents. Its expanded multisegment is the cuspidal support: a segment (ρ, ℓ) contributes ρ, ρν, . . . , ρν^{ℓ−1}. Cuspidal support is unique; the central character is the product of the support central characters. A good class has good first cuspidal classes in its multisegment. If an irreducible class has K_{1}-fixed vectors, every member of its cuspidal support has such vectors.
(iii) A direct sum of special Weil–Deligne parameters V_{i} ⊗ Sp(ℓ_{i}), with V_{i} irreducible, determines the mul-
tiset of pairs (V_{i}, ℓ_{i}), up to the common normalization of the special representations used in (F13.1).
Then the local parameter input in Definition 5.1 holds. Every one of its twelve laws follows by the constructions and identities below.
Proof. Construct R by Proposition 5.4. For a segment (ρ, ℓ) the underlying Weil action of its summand in (F13.1) is the direct sum of the actions r(ρ)(j), 0 ≤ j < ℓ. Indeed the eigencharacters of Sp(ℓ) have exponents j −(ℓ−1)/2; multiplying by the displayed unramified twist cancels the centering exponent. Consequently, for every σ ∈W_{k},
Selectable PDF notation • transcription unchecked
∏
det(X −R(π)(σ)) = det(X −r(ρ)(σ)), (F13.6)
Selectable PDF notation • transcription unchecked
ρ∈supp_{cusp}(π)with the support counted with multiplicity. The cuspidal unramified-twist law identifies the factor for the j-th segment term with the factor for r(ρ)(j), so this is the precise support identity rather than just a degree comparison.
Taking degrees of the monic polynomials in (F13.6) shows that dim R(π) is the sum of the degrees of the cuspidal support, which is deg π. This proves the first law. The character law follows because a character is cuspidal and R = r there. The Langlands law is the defining formula, and cuspidal irreducibility follows from the same equality R = r.
For the unramified-twist law, twisting the representation by ν^{s} twists the first class of each segment by ν^{s} without changing its length. By the cuspidal law its parameter is r(ρ)(s). Such a twist commutes with the centered twist and with tensoring by Sp(ℓ), and distributes over the finite direct sum. Thus R(πν^{s}) = R(π)(s). For a good class the same argument applies to every smooth character χ, because its first segment
classes are good: it gives R(π ⊗χ) = R(π) ⊗(χ ∘a). Replacing the one-dimensional factor by R(χ), already identified above, is the exact tensor-character law required.
Taking determinants in (F13.6) gives a product of the cuspidal determinants. Taking absolute values and applying the cuspidal absolute determinant law turns it into the product of the absolute values of the support central characters. Their product is ω_{π}, proving (F13.2). If π is good, uniqueness of support shows that every member of this same support is good. Use the exact cuspidal determinant law instead of its absolute value to obtain the second identity of (F13.3).
For duality, a segment of length ℓ beginning at ρ is replaced by the segment of the same length beginning at (ρν^{ℓ−1})^{∨}. Its parameter summand is
Selectable PDF notation • transcription unchecked
( )
r(ρ)^{∨} −(ℓ−1)/2 ⊗ Sp(ℓ).
Here the cuspidal dual law gives r(ρ)^{∨}(1 −ℓ) before the centered twist is added. The centered special representation is self-dual: reversing its ordered basis and rescaling successive vectors identifies the dual monodromy with the original shift and reverses its centered eigencharacters. The displayed summand is therefore the dual of the original summand. Duality commutes with a finite direct sum, giving R(π^{∨}) = R(π)^{∨} for good π.
For injectivity let π^{′} be good and R(π) = R(π^{′}). For each segment record the pair
Selectable PDF notation • transcription unchecked
(r(ρ)((ℓ−1)/2), ℓ).
Its first member is irreducible, since unramified twisting preserves irreducibility. By (iii), the two multiseg-ments have the same multiset of these pairs. If a pair on the first side matches a pair on the second, their lengths agree. Cancel the common unramified twist to obtain r(ρ) = r(ρ^{′}). The second first class ρ^{′} is good, so the assumed cuspidal injectivity gives ρ = ρ^{′}. Hence the matched segments agree. Removing one matching pair at a time proves equality of the two finite multisets, including repeated segments. Uniqueness in the Langlands classification gives π = π^{′}.
Suppose now that good π has K_{1}-fixed vectors. By (ii), all classes in its cuspidal support are depth zero, and by uniqueness of support they are good. Their parameters are tame by (i). On wild inertia each factor in (F13.6) is consequently (X −1)^{deg ρ}, so the product is (X −1)^{deg π}. The wild inertia image of a smooth finite-dimensional complex Weil representation is finite. Its elements are therefore diagonalizable: their minimal polynomials divide X^{m}−1, which has no repeated root in characteristic zero. An element with characteristic polynomial (X −1)^{N} is thus the identity. Wild inertia acts trivially on R(π), proving the required tameness law.
Finally consider the data of the type law. A representation containing the inflation of the specified finite cuspidal type is cuspidal; this type-detection assertion is one of the essential depth-zero inputs to (i). Hence R(π) = r(π), and the pointwise type formula for r applies. Proposition 5.5 turns it into the global-valuation type law. This verifies the twelfth and last field. The map R, together with a and these twelve verifications, is the required witness.
The proposition is a fully proved implication; its premises are not asserted to follow merely from their names. Its exact source construction is RecTExists.lean, lines 20–66. The support-polynomial and determi-nant calculation is ExtDim.lean, lines 19–78; twist transport is RcTwOfSegments.lean, lines 19–57; the dual, injectivity and depth arguments are ExtDual.lean, lines 17–57, ExtInj.lean, lines 14–73, and ExtDepth.lean, lines 14–34. In the injectivity step the source implements the finite matching by a partially defined inverse on the second multiset; the cancellation above is the same argument with those finite choices made explicitly.
Lemma 5.7 (Uniqueness of the special summands). Let q > 1 be the residue cardinality. A finite direct sum ⊕_{i}V_{i} ⊗ Sp(ℓ_{i}), where each V_{i} is an irreducible complex Weil representation and ℓ_{i} > 0, determines the multiset of pairs (V_{i}, ℓ_{i}). Here the special representation is centered as in (F13.1). Thus premise (iii) of
Proposition 5.6 holds.
Proof. Let η denote the unramified character σ →→ q^{deg σ}. No irreducible S is isomorphic to S ⊗η^{j} for a nonzero integer j: taking determinants at a degree-one Weil element would give q^{j dim S} = 1, which is impossible. Partition the irreducible constituents of the underlying Weil action into their orbits under the integral twists by η. Each orbit is consequently indexed without repetitions as S_{t} = S_{0} ⊗η^{t}, t ∈ℤ.
The underlying Weil action of the given direct sum is semisimple, since the action in each displayed special summand is a direct sum of twists of the irreducible⊕ V_{i}. Its component in a fixed orbit is therefore
_{t}S_{t} ⊗M_{t}, with finite-dimensional complex multiplicity spaces M_{t}, only finitely many nonzero. The relation ρ(σ)N = η(σ)Nρ(σ) makes N induce maps A_{t} : M_{t} → M_{t+1}. Schur’s lemma justifies this description: a homomorphism between distinct irreducibles vanishes, and every endomorphism of an irre-ducible is scalar. The latter assertion follows by taking an eigenvalue over ℂ; its nonzero eigenspace is an invariant subspace and is therefore the entire irreducible space.
For integers a ≤b, let
r_{a,b} = rank(A_{b−1} · · · A_{a} : M_{a} −→M_{b}), r_{a,a} = dim M_{a}.
A special summand contributes one dimension to each multiplicity space along an interval [c, d], with nonzero identity maps between successive entries and zero maps at its ends. It contributes one to r_{a,b} exactly when c ≤a ≤b ≤d. Therefore the number of summands whose interval is exactly [a, b] is
Selectable PDF notation • transcription unchecked
m_{a,b} = r_{a,b} −r_{a−1,b} −r_{a,b+1} + r_{a−1,b+1}. (F13.7)This follows by subtracting first the intervals beginning before a, then those ending after b, and adding back the intervals removed twice. The formula includes a = b.
An isomorphism of Weil–Deligne representations preserves the Weil-isotypic decomposition and conju-gates the maps induced by N. It thus preserves every rank in (F13.7), and hence every interval multiplicity. The interval [a, b] has length ℓ= b−a+1 and first constituent S_{a}. Its centered irreducible factor is uniquely V = S_{a} ⊗η^{(ℓ−1)/2}, because the first eigencharacter of Sp(ℓ) has exponent −(ℓ−1)/2. Recovering all intervals in all twist orbits therefore recovers exactly the multiset of (V_{i}, ℓ_{i}).
Lemma 5.8 (The induced tame parameter). Let L/k be unramified of degree n > 0, with residue field K of size q^{n}. Let θ : K^{×}→ℂ^{×} have an orbit of length n under z →→z^{q}. Extend θ to a character ξ : L^{×}→ℂ^{×} trivial on 1 + 𝔭_{L}, choosing any nonzero value at a uniformizer. Then
V = Ind^{W}_{W}^{k}_{L}(ξ ∘a_{L}), N = 0, (F13.8)
is irreducible and tame of dimension n. For t ∈I_{k} = I_{L},
Selectable PDF notation • transcription unchecked
n∏−1_{j}det(X −V (t)) = (X −θ(c_{L}(t)^{q} )). (F13.9)
Selectable PDF notation • transcription unchecked
j=0
Multiplying ξ by an unramified character changes no inertia polynomial.
Proof. The quotient W_{k}/W_{L} is cyclic of order n; choose the coset representatives 1, φ, . . . , φ^{n−1} for a degree-one Frobenius element. The induced representation has one basis vector on each coset, hence dimen-sion n. Its restriction to inertia is diagonal in that basis, with characters obtained by conjugating ξ ∘a_{L} by these powers of φ. Frobenius conjugation on the unramified residue extension is z →→z^{q} (or its inverse if the opposite coset convention is used). The resulting set of characters is exactly
Selectable PDF notation • transcription unchecked
θ ∘c_{L}, θ ∘c^{q}_{L}, . . . , θ ∘c^{q}_{L}^{n−1}.The inverse ordering gives the same set, since z^{qn}= z in K. This proves (F13.9) by multiplying the diagonal factors.
These n characters are distinct by regularity and the surjectivity of c_{L}. Their common kernel is open, and the inertia action factors through the finite group K^{×}. The projection onto each character line is the usual finite character average |K^{×}|^{−1} ∑_{u∈K}× χ(u)^{−1}V (u). Thus every inertia-invariant subspace is a direct sum of some of these lines. Frobenius permutes the lines transitively, so a Weil-invariant subspace contains either none or all of them. This proves irreducibility. Wild inertia maps trivially under c_{L}, so the representation is tame. Its inertia action has finite image, giving smoothness. Every Weil matrix in this coset basis is monomial. On each cycle of its permutation its suitable power is a nonzero scalar, so its minimal polynomial divides X^{r}−c with c ̸= 0. That polynomial has distinct roots over ℂ. Each Weil matrix is therefore semisimple, as required by the source parameter definition. With N = 0 this is a Weil–Deligne parameter. Finally an unramified character is trivial on inertia and hence leaves every diagonal entry in (F13.9) unchanged.
The linear algebra in Lemma 5.8 proves the required polynomial once the representation π with finite type τ_{θ} has been identified with the induced parameter (F13.8). That identification, including its possible unramified sign twist, is a representation-theoretic statement and is not proved by the calculation alone.
Background fact 5.9 (Verified cuspidal correspondence). For a finite extension k/ℚ_{p}, there is a bijection between irreducible complex Weil representations of dimension n and irreducible smooth supercuspidal com-plex representations of GL_{n}(k), for all n ≥1. It preserves determinant and central character, character twists, contragredients, and pair L- and epsilon-factors, with geometric Frobenius corresponding to a uniformizer. This is Henniart [3, §1.3, theorem, p. 168].
The theorem’s hypotheses apply: E_{w} is a finite extension of ℚ_{p} and both sides use complex representa-tions. Taking the inverse bijection proves the cuspidal degree, character, irreducibility, twist, determinant, dual and injectivity assertions in premise (i) of Proposition 5.6; its determinant law also gives the absolute-value law. This verified theorem does not explicitly state the Green-type formula (F13.5).
Remark 5.10 (The two compatibility checks). The special-summand uniqueness input has been proved in
Lemma 5.7. The induced inertia calculation has been proved in Lemma 5.8, and its passage to the global valuation statement in Proposition 5.5. The substantive identifications, with their present resolution, are as follows:
1. The normalized Langlands classification in the source’s standard-quotient convention, including its twist and dual rules, cuspidal support, and descent of K_{1}-fixed vectors to the cuspidal support. This is now supplied by Proposition 5.14 and Lemma 5.11.
2. The depth-zero type identification matches an irreducible representation containing the inflation of the finite cuspidal Green type with its tame induced Weil parameter, with the same residue reciprocity and character labels. An unramified sign rectifier is harmless for (F13.5), by Lemma 5.8. Proposition 5.17 below checks the finite label and proves this identification.
The comparison used below is read directly in the original authors’ research paper [4, §4.4]; its finite-type construction is read in their original article [7, §2.2, Proposition 2.2]. Thus neither check is replaced by a theorem title or by the existence of an unnormalized bijection.
Lemma 5.11 (Depth zero descends to the inducing factors). Let P = MU be a standard parabolic of GL_{N}(k), with M = ∏^{r}_{i=1} GL_{ni}(k). Let σ = ⊗_{i}σ_{i} be a smooth representation of M, and let π be a
subquotient of its normalized parabolic induction. If π^{K1(N)}̸= 0, then σ_{i}^{K1(ni)}̸= 0 for every i. In particular this proves the depth-zero support assertion in Proposition 5.6(ii).
Proof. Realize π as a quotient of an invariant subspace S of the induction. Choose 0 ̸= v ∈π^{K1(N)} and a lift u ∈ S. Smoothness supplies an open stabilizer of u inside the compact group K_{1}(N). It has finite index; intersecting its finitely many conjugates gives an open normal subgroup J of finite index still fixing u. Average:
Selectable PDF notation • transcription unchecked
_{u =} 1 ∑_{gu.}
^{0} [K_{1}(N) : J]_{g∈K1(N)/J}The expression is well defined, is K_{1}(N)-fixed and lies in S. Its image is v, since every translate maps to v. Thus u_{0} ̸= 0. Regard it as a nonzero induced function f.
Choose x with f(x) ̸= 0. Iwasawa decomposition writes x = pc with p ∈P and c ∈K = GL_{N}(𝒪_{k}). The induction covariance multiplies f(c) by an invertible operator and a nonzero modular factor, so w = f(c) ̸= 0. For m = (m_{i}) with each m_{i} ∈K_{1}(n_{i}), its block diagonal embedding belongs to K_{1}(N). Also c^{−1}mc ∈K_{1}(N), because K_{1}(N) is the kernel of reduction on K and hence normal in K. Right K_{1}(N)-invariance and left induction covariance give
Selectable PDF notation • transcription unchecked
w = f(c) = f(c(c^{−1}mc))= f(mc) = δ_{P} (m)^{1/2}σ(m)f(c).The modular factor is one: it is a product of powers of | det m_{i}|_{k}, each of which is one for these integral invertible matrices. Hence σ(m)w = w for every such m.
Fix an index i. Choose linear functionals ϕ_{j} on the other tensor factors so that their partial contraction C_{i}(w) is nonzero. To see that they can be chosen, express w in a tensor-product basis and choose a nonzero coordinate. Taking the coordinate functionals on all other factors makes the selected coordinate of C_{i}(w) equal to that nonzero coordinate of w. A tensor is a finite linear combination, so this argument applies without finite-dimensionality of the factors. The contraction satisfies
Selectable PDF notation • transcription unchecked
C_{i}((1 ⊗· · · ⊗σ_{i}(g) ⊗· · · ⊗1)w)= σ_{i}(g)C_{i}(w).This identity holds on pure tensors and hence on their linear span. For g ∈ K_{1}(n_{i}) the tensor on the left equals w, by the invariance already proved. Consequently C_{i}(w) is a nonzero K_{1}(n_{i})-fixed vector. This proves the assertion for every i.
This is the full averaging, compact evaluation and partial contraction argument of ExistsContractNeZero.lean, lines 25–40 and 87–141. It supplies the support-depth step directly, so that step no longer requires an external classification citation. The Iwasawa decomposition used here is the ordinary decomposition for GL_{N} over a nonarchimedean local field; it follows by eliminating columns over the valuation ring to choose an integral basis adapted to the standard block flag.
Lemma 5.12 (A finite cuspidal type detects cuspidality). Let k ≃ℚ_{p} and n > 0. Suppose an irreducible smooth representation π of GL_{n}(k) contains, on K = GL_{n}(𝒪_{k}), the inflation of a cuspidal representation τ of GL_{n}(𝔽_{p}). Then π is cuspidal and has nonzero K_{1}-fixed vectors.
Proof. Transport by the given field isomorphism and let ϕ : τ → π be a nonzero K-intertwiner. For a standard maximal parabolic P = MU of block sizes a, n −a, with 0 < a < n, let
J_{U} = span{π(u)v −v : u ∈U(k), v ∈π}.
Let U be the unipotent radical of the corresponding finite parabolic. Cuspidality of τ says τ^{U} = 0. The finite average |U|^{−1} ∑_{u∈U}τ(u) is the projection onto those invariants, and hence is zero. Every u ∈U has an integral unipotent lift ̃u ∈U(k) ∩K, obtained by lifting its upper off-diagonal block entries. Therefore
Selectable PDF notation • transcription unchecked
ϕ(w) −ϕ(τ(u)w) = ϕ(w) −π(ũ)ϕ(w) ∈J_{U}.Sum over u and use the vanishing of the average. The result is |U|ϕ(w) ∈J_{U}, and division by this nonzero complex integer gives ϕ(w) ∈J_{U}.
The space J_{U} is stable under P, since P normalizes U: applying p ∈P to a defining difference gives the difference for pup^{−1} and π(p)v. For g ∈ GL_{n}(k) write g = pc with p ∈ P and c ∈ K by Iwasawa decomposition. Then π(c)ϕ(w) = ϕ(τ(c)w) ∈J_{U}, and P-stability gives π(g)ϕ(w) ∈J_{U}. The span of all these translates is a nonzero invariant subspace of π, so irreducibility makes it the entire space. Consequently J_{U} = π and the Jacquet quotient π/J_{U} is zero.
Every proper parabolic is conjugate to a standard one, and the unipotent radical of a standard proper parabolic contains that of a standard maximal parabolic, after grouping its successive blocks into two groups. The vanishing just proved therefore gives vanishing of every proper Jacquet quotient. This is cuspidality. Finally K_{1} acts trivially on the inflated τ, so any nonzero vector in the image of ϕ is K_{1}-fixed. This proves the second assertion.
The argument is the finite-unipotent average and Iwasawa generation proof of DzLCusp.lean, lines 17– 107. It removes the cuspidality-detection premise in Proposition 5.6(i); no local converse theorem is needed for this step.
Background fact 5.13 (The quotient classification in the required convention). For complex representations of GL_{N}(k) over a nonarchimedean local field, a segment ∆= (ρ, ρν, . . . , ρν^{ℓ−1}) has a unique irreducible quotient δ(∆) of that ordered normalized induction. The map ∆ →→ δ(∆) parametrizes the essentially square-integrable classes. Finite multisets of these classes parametrize all irreducible classes: order their real exponents nonincreasingly and take the unique irreducible quotient of their normalized induction. The parametrization preserves support and commutes with unramified twists and contragredients. These are the precise statements in Tadić [6, §§5.1, 5.4, 5.6–5.7, pp. 361–363].
Proposition 5.14 (Matching the segment and ordering conventions). Fact 5.13 supplies the classification premises of Propositions 5.4 and 5.6, with the depth assertion supplied by Lemma 5.11.
Proof. The source segment is specified by its first cuspidal class ρ and its positive length ℓ, and its terms are ρν^{j}, 0 ≤j < ℓ. Its segment quotient is therefore precisely δ(∆) in the cited classification, without reversing the single-segment induction. The source orders segments by requiring that an earlier segment never precede a later one. Here precedence means that two segments are linked and the second begins a positive integral twist after the first.
Write the real exponent of a cuspidal ρ as e(ρ); thus ρν^{−e(ρ)} has unitary central character. The exponent of the segment quotient is e(ρ) + (ℓ−1)/2, since its cuspidal support consists of the displayed ℓ terms. If linked segments are written as intervals [a, b] and [c, d] on the same cuspidal twist line, with a < c, neither contains the other. Thus b < d, and (a + b)/2 < (c + d)/2. Precedence therefore strictly increases the exponent of the segment quotient.
It follows that a nonincreasing exponent order is allowed by the source’s ordering condition. Conversely, sort any allowed order into nonincreasing exponent order by adjacent swaps. An adjacent pair needing a swap has the smaller exponent first. It cannot be linked: if linked, its smaller first endpoint would make it precede the later segment, contrary to the allowed-order condition. Products of the two unlinked segment quotients are irreducible and commute, by Zelevinsky [5, Theorem 9.7(a)]; this uses the quotient segment representations in his notation. Hence each swap gives an isomorphic induced module. There are finitely many inversions, so the sorting terminates. The source’s ordered product therefore has the same unique quotient as the nonincreasing-exponent product in the cited classification.
Existence and uniqueness of its multiset now follow from the bijection of Fact 5.13. Support is the union, with multiplicity, of the segment terms. Its uniqueness implies the assertion about good support used in the seed assembly. The central character is the product of the support central characters: the center acts by this
product on the normalized induction, since its modular factor on a central scalar is one, and the same action passes to every subquotient.
Twisting by any smooth character multiplies every cuspidal term by that character; it preserves linkedness and precedence. Twist the inducing space and the quotient map to see that it carries the unique quotient to the unique quotient for these twisted segments. The real unramified twist is a special case. For the contragredient, the cited dual rule replaces a segment by its termwise dual in reverse order: its first term becomes (ρν^{ℓ−1})^{∨} and its length remains ℓ. This is exactly the dual segment used in the proof of Proposition 5.6. The depth-zero assertion has already been proved directly in Lemma 5.11. All classification compatibilities used there are therefore accounted for.
Lemma 5.15 (Elliptic values determine a regular label). Let K = 𝔽_{q}n, n > 0, and let θ, θ^{′} be characters of K^{×} with Frobenius orbits of size n. If their Frobenius orbit sums agree on every element of degree n over 𝔽_{q}, then θ^{′} is a Frobenius conjugate of θ. Consequently a finite cuspidal representation satisfying the elliptic formula for θ is the Green representation labeled by θ.
Proof. Put N = q^{n}−1 and ∑
Selectable PDF notation • transcription unchecked
B(q, n) = (q^{n/r}−1).
r|n, r primeLet D ⊂ K^{×} be the elements of degree less than n. If z has degree d < n, then d | n and some prime r | n/d gives z ∈𝔽^{×}_{qn/r}. The union bound therefore gives |D| ≤B(q, n).
Distinct characters of a finite abelian group are orthogonal. Indeed, the sum of a nontrivial character χ is unchanged by translating its argument by x, and also multiplied by χ(x) ̸= 1 for a suitable x; the sum is zero. Applying this to χψ^{−1} proves orthogonality. Every character value has absolute value one, because it has finite order.
Let A, A^{′} be the Frobenius orbits of θ, θ^{′}. If they intersect they agree, giving the conclusion. Suppose∑ they are disjoint, and put f(z) =∑_{χ∈A}χ(z) −_{χ∈A}′ χ(z). Orthogonality gives
Selectable PDF notation • transcription unchecked
∑ |f(z)|^{2}= 2nN.
z∈K^{×}The hypothesis makes f zero off D, while the triangle inequality gives |f(z)| ≤2n. Hence
Selectable PDF notation • transcription unchecked
N ≤2n|D| ≤2nB(q, n). (F13.8)
Here are the numerical bounds needed to exclude (F13.8). The distinct integers n/r lie between 0 and ⌊n/2⌋, so the finite geometric sum gives B(q, n) ≤2q^{⌊n/2⌋}. For m ≥6, induction gives 2^{m} ≥8m + 1: it starts with 64 ≥49, and doubling the right side exceeds 8(m + 1) + 1. Set A_{0} = q^{m} ≥8m + 1. For n = 2m ≥12 we obtain
Selectable PDF notation • transcription unchecked
q^{n}−1 = A^{2}_{0}−1 > 8mA_{0}≥2nB(q, n).For n = 2m + 1 ≥13, similarly, q^{n}−1 ≥2A^{2}_{0}−1 > (8m + 4)A_{0} ≥2nB(q, n).
For 1 ≤n ≤11 the bound is also strict except at (q, n) = (2, 2), (3, 2), (2, 4), (2, 6). For completeness the following is a finite coefficient certificate. In each row set q = h + c, h ≥ 0, and expand P_{n}(h) = q^{n}−1 −2nB(q, n). The listed entries are its coefficients from the constant term through degree d, where( ) d is the largest exponent occurring in B. All higher coefficients are the positive binomial coefficients ^{n}_{j} c^{n−j}.
Thus every displayed polynomial is positive. The remaining case n = 1 has B = 0.
Selectable PDF notation • transcription unchecked
n c B(q, n) [h^{0}]P_{n}, . . . , [h^{d}]P_{n}
2 4 q −1 3, 4
3 2 q −1 1, 6
4 3 q^{2}−1 16, 60, 46
5 2 q −1 21, 70
6 3 q^{3}+ q^{2}−2 320, 1062, 1095, 528
7 2 q −1 113, 434
8 2 q^{4}−1 15, 512, 1408, 1664, 1104
9 2 q^{3}−1 385, 2088, 4500, 5358
10 2 q^{5}+ q^{2}−2 343, 3440, 9900, 14560, 13240, 8044
11 2 q −1 2025, 11242Each entry follows by the binomial theorem: if B =∑_{d∈S}(q^{d} −1), its degree-j coefficient is
Selectable PDF notation • transcription unchecked
(^{n})c^{n−j}−2n ∑ (^{d})c^{d−j}+ (2n|S| −1) 1_{j=0}.
^{j} d∈S, d≥j^{j}This also specifies the arithmetic of the certificate.
It remains to exclude the four exceptional pairs. Choose a generating character η_{0} of the cyclic character group of K^{×}. For the four pairs take respectively e = 1, 2, 3, 21. In each case e is divisible by every q^{n/r}−1 above, so η = η_{0}^{e} is trivial on D. Since f is supported on D, we have ηf = f. Orthogonality makes the character expansion unique; its coefficients are 1 on A, −1 on A^{′} and zero elsewhere. Thus multiplication by η preserves both A and A^{′} separately.
In the first three cases the order of η is respectively 3, 4, 5. Translation by η acts freely on the entire character group, so an invariant subset must have cardinality divisible by that order. These orders do not divide n = 2, 2, 4, respectively. In the last case identify the character group with ℤ/63ℤ by η_{0}. An orbit of size six invariant under addition by 21 is a union of two cosets of {0, 21, 42}. Its image in ℤ/21ℤ is a two-element set stable under doubling. Doubling has just one fixed point, zero, so this set must be a two-cycle. Its elements satisfy 4x = x; the only nonzero solutions are 7, 14, and these form that cycle. The only possible invariant six-element orbit is therefore
Selectable PDF notation • transcription unchecked
{7, 14, 28, 35, 49, 56}.It cannot be both of the disjoint sets A, A^{′}. This excludes the final case and proves the orbit assertion.
Finally let τ be a cuspidal representation satisfying the stated elliptic formula. Green exhaustion sup-plies a regular character θ^{′} labeling τ. For each degree-n element z ∈ K^{×}, multiplication by z on the n-dimensional 𝔽_{q}-space K has irreducible characteristic polynomial: its minimal polynomial has degree n, annihilates the operator, and is monic of that degree. The operator is invertible since z ̸= 0. Apply the two elliptic formulas to this matrix and cancel (−1)^{n−1}. The hypothesis of the orbit assertion follows. Hence θ^{′} is conjugate to θ, and Green’s orbit criterion identifies their full cuspidal characters.
This is the character-orthogonality, proper-subfield bound and exceptional-orbit argument of PinChar.lean, PinFld.lean, PinNum.lean and PairCheckThreeTwo.lean, followed by the NameLaws.lean converse. The last four finite checks have been displayed as explicit cyclic orbit arguments rather than left as machine computations.
Background fact 5.16 (The established level-zero comparison). Let k be a nonarchimedean local field, L/k unramified of degree n, and ξ : L^{×}→ℂ^{×} a smooth character trivial on 1+𝔭_{L} with regular residue character.
Write Γ_{k}(ξ) for compact induction from k^{×}GL_{n}(𝒪_{k}) of the extension of its inflated Green representation having central character ξ|_{k}×. These classes parametrize the depth-zero cuspidal representations, modulo Gal(L/k). The finite representation is labeled by ξ, with no inversion. The construction and bijection are [7, §2.2, Proposition 2.2, p. 693]. For the classical cuspidal correspondence ℒ,
Selectable PDF notation • transcription unchecked
( )
ℒ Ind^{W}_{W}^{k}_{L}(ξ ∘a_{L}) = Γ_{k}(ωξ), ω(x) = (−1)^{(n−1)vL(x)}. (F13.7)
This exact formula, for all such smooth characters, is [4, §4.4, last display, pp. 11–12]. The correspondence also identifies depth-zero cuspidals with irreducible Weil representations trivial on wild inertia [4, §4.4, first paragraph].
We make the reciprocity normalization in this citation explicit. Its ℒ is the classical correspondence of Fact 5.9, not an independently chosen bijection. In rank one Γ_{k}(ξ) is the character ξ of k^{×}, and ω = 1. Thus (F13.7) reduces to the same character law r(ξ) = ξ ∘a_{k}. An implicit replacement of a_{k} by a^{−}_{k}^{1} would change this law and is incompatible with that common normalization. Smooth complex characters separate k^{×}: unramified characters distinguish valuations, and characters of finite quotients of 𝒪_{k}^{×} distinguish distinct units. Hence this rank-one check also determines the class-field identification uniquely. In all ranks (F13.7) is used with this same identification.
Proposition 5.17 (The finite type has the required inertia label). For the inverse r of the classical cuspidal correspondence, the pointwise type assertion (F13.5) holds. A cuspidal class with K_{1}-fixed vectors has tame parameter. The finite Green label is the one fixed in Proposition 4.1.
Proof. Fix the data of Proposition 5.5. By Lemma 5.12, π is cuspidal and has nonzero K_{1}-fixed vectors. We may therefore apply the level-zero classification in Fact 5.16. It supplies a regular tame character ξ of L^{×} such that π = Γ_{k}(ξ).
We check that its residue label is the prescribed θ. Lemma 5.15 first identifies the source’s elliptic-value specification with the full Green type, so no stronger labeling hypothesis is being assumed. The inflated finite cuspidal representations in this construction are maximal simple types. The uniqueness assertion in the proof of [7, Proposition 2.2] identifies the type in π up to conjugacy. Both compact groups here are K = GL_{n}(𝒪_{k}), so the conjugating element normalizes K. Its normalizer is k^{×}K. Indeed, elementary divisors write an element as c diag(ϖ^{ai})d with c, d ∈K. If the diagonal matrix normalizes K, conjugating 1 + E_{ij} and its reverse forces both a_{i} −a_{j} ≥0 and a_{j} −a_{i} ≥0. All exponents are equal, and the diagonal matrix is scalar. Scalars act trivially by conjugation and K induces inner conjugacy on the finite group. Thus the finite type of π is isomorphic to the Green type with label ξ.
The orbit criterion in Proposition 4.1 gives ξ = θ^{pb} for some b. Replacing ξ by a Galois conjugate changes neither Γ_{k}(ξ) nor its induced Weil class, and makes ξ = θ. This is a positive Frobenius power, not a character inverse: the Green formula used on both sides is
Selectable PDF notation • transcription unchecked
n∑−1_{j}
(−1)^{n−1} θ(z^{p} ).
j=0The generator convention in Proposition 4.1 therefore fixes the same character of the same residue group.
The character ω in (F13.7) is unramified and ω^{2}= 1. Substituting ωξ for ξ in that formula yields
r(π) = Ind^{W}_{W}^{k}_{L}((ωξ) ∘a_{L}), N = 0.
For t ∈ I_{L}, the element a_{L}(t) is a unit, so ω(a_{L}(t)) = 1. The remaining character value is ξ(a_{L}(t)) = θ(c_{L}(t)). The coset-basis computation of Lemma 5.8 now gives precisely
Selectable PDF notation • transcription unchecked
n∏−1_{j}det(X −r(π)(t)) = (X −θ(c_{L}(t)^{p} )).
Selectable PDF notation • transcription unchecked
j=0
The permutation of these factors caused by choosing arithmetic instead of geometric Frobenius as a coset generator has no effect on the product. The reciprocity map in the character is still a_{L} with geometric normalization; it is not replaced by its inverse. This proves (F13.5).
For the final assertion take any depth-zero cuspidal class, without prescribing a finite type. The last assertion of Fact 5.16 says directly that its cuspidal parameter is trivial on wild inertia. Equivalently its level-zero character construction above is an induction of a tame character, whose wild-inertia action was computed to be trivial in Lemma 5.8. For n = 1 the same conclusion and formula follow at once from local reciprocity: a character trivial on 1 + 𝔭_{k} factors on units through the residue group, and its parameter is that character composed with a_{k}. Thus the rank-one case requires no convention about higher-rank types.
Theorem 5.18 (The local parameter input). The local parameter statement in Definition 5.1 holds, with the geometric reciprocity convention fixed above. Consequently the F-13 assembly has this required input.
Proof. Choose the inverse local reciprocity homomorphism a. In degree zero there is one irreducible class, that of the trivial group. Assign to it the zero-dimensional parameter. Its support is empty, its determinant is the empty product one, and its central character is trivial: every scalar maps to the identity of GL_{0}, so its action on the nonzero representation space forces that character to be one. Twists and duals fix the class. The required identities in degree zero follow directly; the positive-degree type condition does not concern this case. Choose on every cuspidal class the inverse r of the classical cuspidal correspondence in Fact 5.9. That fact proves degree, character, irreducibility, twist, determinant, dual and injectivity assertions for all cuspidal classes. In particular it proves their restrictions to good classes. Its exact determinant identity implies the absolute identity by applying the complex absolute value. Proposition 5.17 gives tameness at depth zero and the specified type polynomial. Lemma 5.12 gives the other type premise of the seed assembly.
Proposition 5.14 supplies its classification, support, twist and dual premises, and Lemma 5.11 supplies depth-zero support descent. Lemma 5.7 supplies the remaining special-parameter uniqueness premise. Ap-ply Proposition 5.6 to obtain R and all twelve laws, including the transported global-valuation condition.
Proposition 5.2 then resolves the F-13 application.
The choice of the classical cuspidal map is a witness to the existence statement. The source allows less canonical choices outside the good cuspidal classes; it does not require those choices to disagree with the classical map. Thus this witness proves the exact restricted twelve-law statement and makes no identification of the source’s chosen values outside their specified scope.