Skip to content

Section 4 · PDF pages 62–63

Finite-field labels and the publication inputs

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

4 Finite-field labels and the publication inputs

Let p be prime, let 𝔽_{p} be an algebraic closure of 𝔽_{p}, and put Γ_{d} = GL_{d}(𝔽_{p}). A label datum consists of an

Selectable PDF notation • transcription unchecked
×

injective multiplicative map ι : 𝔽_{p} →ℂ^{×} and compatible elements γ_{d} of order p^{d} −1. For N = p^{d} −1 and x^{N} = z^{N} = 1, define

Selectable PDF notation • transcription unchecked
Θ_{x}(z) = ι(x)^{a} if z = γ_{d}^{a}. (73)

This is independent of the choice of a: any two choices differ by a multiple of N, and ι(x)^{N} = 1. The polynomial labels are the monic irreducible polynomials P ∈𝔽_{p}[X] of degree d with P(0) ̸= 0.

The classical finite-group input required here is the following precise form of the Green parametrization. For K = 𝔽_{p}d and a character θ : K^{×}→ℂ^{×} whose d Frobenius conjugates are distinct, there is a cuspidal irreducible character χ_{θ} of Γ_{d} such that

Selectable PDF notation • transcription unchecked
d∏−1
χ_{θ}(1) = (p^{i}−1), (74)
i=1
∑d−1_{i}
χ_{θ}(y) = (−1)^{d−1} θ(z^{p}) (75)
i=0

when y has irreducible characteristic polynomial and z ∈K^{×} is one of its roots. Two regular characters give the same χ precisely when they are Frobenius conjugate, and every cuspidal irreducible character occurs. This is the statement denoted GreenRegularCharacters in the source. The normalization follows directly from Green’s formulas. His I_{d}^{k}[1] has elliptic value T_{d,1}(k : z) = ∑_{i}ϑ^{pik}(z), and its irreducible primary character is (−1)^{d−1}I_{d}^{k}[1]. Taking θ = ϑ^{k} gives (75), with no inverse of θ. Writing ϕ_{d}(p) = ∏^{d}_{i=1}(1 −p^{i}), its degree is

Selectable PDF notation • transcription unchecked
_{ ϕ(p)} d∏−1
(−1)^{d−1d}_{d} = (p^{i}−1).
^{1 −p} i=1

These are Green’s Definition 3.1, Theorem 9 and its Example (ii), Lemma 7.4 and Theorem 12 [42, pp. 417, 430–431, 438–439]. The orbit criterion and exhaustion are also explicit in Shintani [43, Theorem 2, pp. 409– 410].

The source’s cuspidality convention agrees with the usual one. For the unipotent radical U_{a} of the parabolic of block sizes a, d −a, its operator |U_{a}|^{−1} ∑_{u∈Ua}ρ(u) is the projection onto V^{ Ua}. Its trace is

Selectable PDF notation • transcription unchecked
∑

|U_{a}|^{−1}_{u∈Ua}χ(u) = dim V^{ Ua}. Thus the zero average required by the source is equivalent to V^{ Ua} = 0 for

Selectable PDF notation • transcription unchecked
( )

every 0 < a < d, the cuspidal condition. The displayed source average sums exactly the matrices ^{I}_{0}^{a}_{ Id}^{B}_{−a} ;

there are p^{a(d−a)} of them, agreeing with its denominator.

The statement is independent of a chosen model of the finite extension. A field K/𝔽_{p} of dimension d has p^{d} elements and is isomorphic over 𝔽_{p} to the model used above. Transfer a multiplicative character along this field isomorphism. It preserves Frobenius, regularity and evaluation of polynomials over 𝔽_{p}; therefore the character value, degree, orbit and exhaustion assertions transfer unchanged. This supplies the source’s quantification over every field model of the extension.

Proposition 4.1 (From regular characters to polynomial labels). For every label datum and every d > 0, there is a bijection P →→ τ(P) from the polynomial labels to the cuspidal irreducible characters of Γ_{d}. It preserves the degree in (74), and for any root x of P and any root z of the irreducible characteristic polynomial of y ∈Γ_{d} one has

Selectable PDF notation • transcription unchecked
∑d−1_{i}
τ(P)(y) = (−1)^{d−1} Θ_{x}(z^{p}).
i=0

Proof. Use the cited classical parametrization and choose an embedding K = 𝔽_{p}d into 𝔽_{p}. Its image is

the fixed field of the dth Frobenius power: each image element satisfies u^{pd} = u, and that equation has at most p^{d} roots, all of which already occur in the image. Therefore γ_{d} has a preimage u ∈K^{×}. It has order N = p^{d}−1 and hence generates K^{×}.

For every x with x^{N} = 1, define θ_{x} by θ_{x}(u) = ι(x). The order divisibility ι(x)^{N} = 1 makes this a well-defined homomorphism on the cyclic group generated by u. Its value at a unit k is Θ_{x}(emb(k)) by (73). The map x →→θ_{x} is injective, since evaluation at u followed by injectivity of ι recovers x. It is surjective onto the full character group: the value of any character at u is an Nth root of unity, and ι(γ_{d}) is a primitive Nth root. Write this value as ι(γ_{d})^{a} and take x = γ_{d}^{a}. Evaluation at the generator also proves

Selectable PDF notation • transcription unchecked
θ_{x}b = θ_{x}^{b} (b ≥0).

Consequently regularity of θ_{x} is exactly the distinctness of x, x^{p}, . . . , x^{pd−1}.

For each polynomial label P, choose a root x_{P} . Its minimal polynomial is P. The finite-field Frobenius orbit has length d and is the full set of roots of P; in particular x_{P} ̸= 0 and x^{p}_{P}^{d−1}= 1. Thus θ_{xP} is regular, and we set τ(P) = χ_{θxP} . The asserted cuspidality and degree now follow from the corresponding parts of the classical input.

We check the value formula with its quantification over all roots, as the source does. Let Q be the irreducible characteristic polynomial of y. It is monic of degree d, and its constant term is nonzero because y is invertible. Every root z of Q therefore satisfies z^{N} = 1 and lies in the embedded copy of K. Choose its nonzero preimage k ∈K^{×}. Injectivity of the embedding shows that Q(k) = 0, so the classical character formula applies at k. Its summands are θ_{xP} (k^{pi}) = Θ_{xP} (z^{pi}).

Any other root x of P is x^{p}_{P}^{j} for some j < d. From the cyclic-generator definition one has

Selectable PDF notation • transcription unchecked
j

Θ_{pj}(w) = Θ_{xP} (w^{p} ) whenever w^{N} = 1.

Selectable PDF notation • transcription unchecked
x_{P}

Both lists z, z^{p}, . . . , z^{pd−1} and z^{pj}, (z^{pj})^{p}, . . . , (z^{pj})^{pd−1} enumerate the roots of Q without multiplicity. Their sums under Θ_{xP} therefore agree. Substituting the displayed identity gives the required formula with x in place of the chosen root x_{P} . This is the source’s comparison of the two root-multiset sums, and accounts for the independence of that choice.

If τ(P) = τ(P^{′}), the classical orbit criterion gives θ_{xP ′} = θ_{x}^{pj}_{P} for some j < d. The character-root

bijection then gives x_{P} ′ = x^{p}_{P}^{j}. This is a root of P, so P and P^{ ′} are the same monic minimal polynomial. Thus τ is injective.

Conversely, let χ be cuspidal irreducible. Choose a regular θ with χ = χ_{θ} and write θ = θ_{x} by the character-root bijection. Let P be the minimal polynomial of x and put e = deg P. Because x^{pd} = x, finite-field Frobenius gives e | d. Also e > 0. If e < d, then x^{pe} = x contradicts the regularity criterion at the two indices e and 0. Hence e = d. The element x is nonzero, so P(0) ̸= 0, making P a polynomial label. The chosen root x_{P} is a Frobenius conjugate of x. The character-root identity and the classical orbit criterion give χ = τ(P). This proves surjectivity and completes the construction.

[Lean: F-6: GlobalTheory.GreenBridge.green_of_regular, Development/AbelianVarietyTheory/Proofs/InertiaEigenvalues/SumRangeEqRoots.lean, 225–304. The character-root correspondence is constructed at 41–160, Frobenius-root identities at 162–223, and the classical input is defined in Development/AbelianVarietyTheory/PublishedTheorems/GaloisCohomology2/GreenRegularCharacters.lean, 10–22.]