Paper XIReading edition

Tensor refinement of tame atoms

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

5 Tensor refinement of tame atoms

Let

\[ \tau_\xi={\operatorname{Ind}}_{W_{K_n}}^{W_K}\xi, \qquad \tau_\eta={\operatorname{Ind}}_{W_{K_m}}^{W_K}\eta, \]

where \(K_n/K\) and \(K_m/K\) are unramified. Put

\[ d=\gcd(n,m), \qquad L={\operatorname{lcm}}(n,m). \]

Theorem 5.1: Greatest common divisor and least common multiple packets

There is a decomposition

\[ \boxed{ \tau_\xi\otimes\tau_\eta \cong \bigoplus_{i=0}^{d-1} {\operatorname{Ind}}_{W_{K_L}}^{W_K} \left( \xi_{L,n}\eta_{L,m}^{\Phi^i} \right), } \]

where \(\xi_{L,n}\) and \(\eta_{L,m}\) are the norm lifts to \(K_L\).

Proof of Theorem 5.1

Apply Mackey decomposition [23]. The double cosets

\[ W_{K_n}\backslash W_K/W_{K_m} \]

are the orbits of simultaneous translation on \({\mathbb Z}/n{\mathbb Z}\times{\mathbb Z}/m{\mathbb Z}\). There are \(d\) orbits, each of length \(L\). The stabilizer of a point in each orbit is \(W_{K_L}\). The second character is shifted by the chosen Frobenius representative. Summing the induced terms over the double cosets gives the decomposition.

Corollary 5.2: Packet count and dimension

The tensor product has \(d\) induced interaction packets, each with carrier dimension and Frobenius coset-cycle length \(L\). The interaction character may have a shorter inertia orbit, in which case a packet may split further into irreducible atoms. The total dimension is preserved because

\[ dL=nm. \]

Proof of Corollary 5.2

The double coset calculation in Theorem 5.1 gives exactly \(d\) summands, and every stabilizer is \(W_{K_L}\), so every induced packet has dimension \(L\). The identity \(dL=nm\) follows from the definitions of greatest common divisor and least common multiple.

Tensor refinement separates into greatest common divisor many packets, each with least common multiple carrier dimension.
Tensor refinement separates into greatest common divisor many packets, each with least common multiple carrier dimension.

View full-size figure (new tab)

5.1 Exponent coordinates

Represent the residue characters by exponents

\[ a\pmod{q^n-1}, \qquad b\pmod{q^m-1}. \]

Proposition 5.3: Refined exponent formula

The \(i\)th interaction packet on \({\mathbb F}_{q^L}^{\times}\) has exponent

\[ \boxed{ c_i = a\frac{q^L-1}{q^n-1} +bq^i\frac{q^L-1}{q^m-1} \pmod{q^L-1}. } \]

It is trivial on tame inertia exactly when \(c_i=0\).

Proof of Proposition 5.3

Norm lifting a character exponent from \({\mathbb F}_{q^n}^{\times}\) to \({\mathbb F}_{q^L}^{\times}\) multiplies the exponent by \((q^L-1)/(q^n-1)\). The Frobenius shift multiplies the second exponent by \(q^i\). Multiplication of characters adds exponents. Triviality is equivalent to the resulting exponent being zero modulo \(q^L-1\).

5.2 Tame local polynomials

Let \(V\) be one interaction packet. If its inertia character is nontrivial, then \(V^{I_K}=0\). If the inertia character is trivial, Frobenius acts on the invariant packet by a companion cycle.

Proposition 5.4: Local polynomial of one tame packet

Suppose an interaction packet has orbit length \(r\) and closing scalar \(a\). Its local polynomial is

\[ \det\left(I-u\Phi\mid V^{I_K}\right) = \begin{cases} 1-a u^r,&\text{if the inertia character is trivial},\\ 1,&\text{otherwise}. \end{cases} \]

Proof of Proposition 5.4

For nontrivial inertia, the invariant space is zero. In the trivial case, Frobenius on the invariant packet is the companion matrix of \(X^r-a\). Substituting \(X=u^{-1}\) and multiplying by \(u^r\) gives \(1-a u^r\).

Corollary 5.5: Tame tensor local factor

The local factor of the tame tensor product is the product of

\[ (1-a_i u^{r_i})^{-1} \]

over precisely those refined packets whose inertia exponent vanishes.

Proof of Corollary 5.5

The invariant space is the direct sum of the invariant refined packets, and determinant is multiplicative on direct sums.

Proposition 5.6: Trivial tensor packet criterion

For every refined interaction packet, let \(r_i\) be its cycle length and \(a_i\) its closing scalar. The dimension of the \(W_K\) fixed space in \(\tau_\xi\otimes\tau_\eta\) equals the number of packets satisfying both

\[ c_i=0 \qquad\text{and}\qquad a_i=1. \]

Proof of Proposition 5.6

A nonzero fixed vector must lie in an inertia trivial packet, so \(c_i=0\). On that packet, Frobenius is a companion cycle with characteristic polynomial \(X^{r_i}-a_i\). Its fixed space is the eigenspace for eigenvalue one. This eigenspace is one dimensional exactly when \(a_i=1\), and it is zero otherwise. Summing over the refined packets proves the formula.

Corollary 5.7: Tame Hom test

For irreducible tame atoms,

\[ \dim{\operatorname{Hom}}_{W_K}(\tau_\xi^\vee,\tau_\eta) \]

is zero or one, and it is one exactly when the refined tensor packet test in Proposition 5.6 finds one trivial packet.

Proof of Corollary 5.7

The Hom space is the fixed space of \(\tau_\xi\otimes\tau_\eta\). Schur's lemma gives dimension zero or one, and Proposition 5.6 gives the packet criterion.

5.3 Tame conductor

Proposition 5.8: Conductor of a nontrivial tame atom

Let \(\tau\) be an irreducible tame Weil representation of dimension \(n>1\). Then

\[ {\operatorname{Swan}}(\tau)=0, \qquad \dim\tau^{I_K}=0, \qquad {\operatorname{Art}}(\tau)=n. \]

Proof of Proposition 5.8

Wild inertia acts trivially, so the Swan conductor is zero. An inertia fixed vector would generate a nonzero Frobenius stable sum of trivial character packets. Irreducibility would then make inertia act trivially on all of \(\tau\). An irreducible representation of the quotient generated by Frobenius would be one dimensional, contrary to \(n>1\). The Artin conductor is therefore

\[ \dim\tau-\dim\tau^{I_K}+{\operatorname{Swan}}(\tau)=n. \]
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