Paper XIReading edition

Tame Frobenius packets

Reading tools
Reading libraryFind statementsInspect Lean
Switch work

Saved reading

Read side by side

Start reading

Resources & source

Original TeX with line links · Download TeX

The wording and mathematics follow the retained manuscript. This reading format does not add a proof review or extend Lean coverage.

Skip contents and start reading

3 Tame Frobenius packets

Assume that \(P_K\) acts trivially. After passing to a finite quotient, tame inertia is cyclic. Let \(t\) generate a quotient of order \(M\), and put \(\zeta_M={\mathrm e}^{2\pi i/M}\). For \(j\in{\mathbb Z}/M{\mathbb Z}\), define

\[ P_j = \frac1M \sum_{a=0}^{M-1} \zeta_M^{-ja}r(t)^a. \]

Proposition 3.1: Tame character projectors

The operators \(P_j\) are pairwise orthogonal idempotents whose sum is the identity. Frobenius permutes them by

\[ \Phi P_j\Phi^{-1}=P_{qj}. \]

Proof of Proposition 3.1

The first assertion is the Fourier idempotent calculation for a cyclic group. For the geometric Frobenius convention of Section 2, the relation is \(\Phi^{-1}t\Phi=t^q\). Equivalently, \(\Phi t\Phi^{-1}=t^{q^{-1}}\), with inverse taken modulo \(M\) since \(\gcd(q,M)=1\). Conjugating the Fourier sum and changing its summation index therefore gives \(\Phi P_j\Phi^{-1}=P_{qj}\). The inverse Frobenius convention reverses the label direction while preserving the same orbits.

Theorem 3.2: Tame orbit induction

Let \(\tau\) be an irreducible complex representation of \(W_K\) with trivial wild inertia. Then the nonzero tame character packets form one transitive Frobenius orbit of length \(f\). If \(K_f/K\) is the unramified extension of degree \(f\), there is a character \(\xi\) of \(W_{K_f}\) such that

\[ \boxed{ \tau\cong{\operatorname{Ind}}_{W_{K_f}}^{W_K}\xi. } \]

Proof of Theorem 3.2

The nonzero tame packets are permuted by Frobenius. A union of Frobenius orbits is stable under \(W_K\), so irreducibility forces one orbit. Choose one packet \(V_\theta\). Its stabilizer is \(W_{K_f}=\langle I_K,\Phi^f\rangle\). A nonzero proper stable subspace of \(V_\theta\) would generate a nonzero proper \(W_K\) stable subspace after summing its Frobenius translates. Thus \(V_\theta\) is irreducible for the stabilizer. Inertia acts on it by the scalar character \(\theta\), and the remaining action is generated by \(\Phi^f\). The stabilizer action on this packet is therefore one dimensional. Induction reconstructs the complete orbit.

Corollary 3.3: Dimension and regularity

The dimension of \(\tau\) equals the Frobenius orbit length of its tame inertia character. The inducing character is regular, meaning that no smaller positive power of Frobenius fixes it.

Proof of Corollary 3.3

The induced representation has one line for every Frobenius translate of the chosen character. A shorter orbit would produce a proper stabilizer and contradict the minimality of \(f\).

Proposition 3.4: Dual and self dual tame packets

For a tame atom

\[ \tau_\xi={\operatorname{Ind}}_{W_{K_f}}^{W_K}\xi, \]

we have

\[ \tau_\xi^\vee \cong {\operatorname{Ind}}_{W_{K_f}}^{W_K}\xi^{-1}. \]

The atom is self dual exactly when

\[ \xi^{-1}=\xi^{\Phi^j} \]

for some \(j\in{\mathbb Z}/f{\mathbb Z}\).

Proof of Proposition 3.4

Duality commutes with finite index induction, giving the first statement. Two regular induced tame atoms are isomorphic exactly when their inducing characters lie in the same Frobenius orbit. Applying this to \(\xi\) and \(\xi^{-1}\) gives the criterion.

Proposition 3.5: Unramified twist

Let \(\nu\) be an unramified character of \(W_K\). Then

\[ \tau_\xi\otimes\nu \cong {\operatorname{Ind}}_{W_{K_f}}^{W_K} \left( \xi\,\nu|_{W_{K_f}} \right). \]

The tame inertia orbit is unchanged. If the original Frobenius cycle has closing scalar \(a\), the twisted cycle has closing scalar

\[ a\nu(\Phi)^f. \]

Proof of Proposition 3.5

The tensor identity follows from the projection formula for induction. Since \(\nu\) is trivial on inertia, it does not change any tame character packet. It multiplies every Frobenius step by \(\nu(\Phi)\), so a closed cycle of length \(f\) gains the factor \(\nu(\Phi)^f\).

A tame irreducible atom is one transitive Frobenius orbit.
A tame irreducible atom is one transitive Frobenius orbit.

View full-size figure (new tab)

3.1 Regular orbit counts

Characters of \({\mathbb F}_{q^n}^{\times}\) are indexed by exponents modulo \(q^n-1\), and Frobenius acts by multiplication by \(q\).

Proposition 3.6: Möbius orbit count

The number of regular Frobenius orbits of length \(n\) is

\[ \boxed{ c_n(q) = \frac1n \sum_{d\mid n} \mu(d) \bigl(q^{n/d}-1\bigr). } \]

Proof of Proposition 3.6

For every divisor \(r\mid n\), the characters fixed by \({\operatorname{Frob}}^r\) are exactly those descending to \({\mathbb F}_{q^r}^{\times}\), and there are \(q^r-1\) of them. Möbius inversion gives the number of characters of exact orbit length \(n\). Division by \(n\) gives the number of orbits.

Example 3.7: Degree four over \({\mathbb F}_2\)

The regular exponent orbits modulo fifteen are

\[ (1,2,4,8), \qquad (3,6,12,9), \qquad (7,14,13,11). \]

The formula gives

\[ \frac14\bigl((2^4-1)-(2^2-1)\bigr)=3. \]
Regular Frobenius orbit counts for three residue field sizes.
Regular Frobenius orbit counts for three residue field sizes.

View full-size figure (new tab)

Source and conversion record

Source SHA-256: a579be9790f04c3738f74ec02a1fdc3e1ae82f664cc00fc450535208ea832a23

Unsupported prose commands stop the build. The mathematical expression sequence is checked against the source, with manuscript macros expanded for display.

Conversion records

Notation in Paper XI

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index