Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Automorphism counts for nilpotent Jordan representations

Statement

For the nilpotent Jordan representation Iλ over Fq, write mr=#{i:λi=r} and n(λ)=∑i(i−1)λi. Then aλ(q):=∣Aut⁡(Iλ)∣=q∣λ∣+2n(λ)∏r≥1∏j=1mr(1−q−j). In particular a∅(q)=1.

Facts & Assumptions

Given: A finite field k of cardinality q, a partition λ, and Iλ with its nilpotent operator denoted T.

[F1]

The representation is the direct sum of blocks Ir with multiplicities mr (Jordan-quiver isomorphism classes are indexed by partitions).

[F2]

Conjugate partition columns have heights λj′=#{i:λi≥j} (Partitions, English diagrams, and conjugation).

[F3]

In a nilpotent Jordan-string basis v1,…,vr, the operator satisfies Tv1=0 and Tvj=vj−1 for j>1; its matrix is Jr(0) (Jordan blocks, Jordan strings, and their endpoints).

Proof

1.1F1F2F3algebra

For the Jordan-string basis v1,…,vr of Ir, we have Tv1=0 and Tvj=vj−1 for j>1. Give Ir the k[T]-module structure in which T acts by its nilpotent operator. The linear map k[T]/(Tr)→Ir sending Ti to vr−i for 0≤i<r is a bijection commuting with T, hence a module isomorphism. Intertwining linear maps are exactly module homomorphisms. A module homomorphism k[T]/Tr→k[T]/Th is determined by the image of 1, which may be any vector killed by Tr; that space has dimension min⁡(r,h). Thus the endomorphism algebra of Iλ has dimension D=∑r,hmrmhmin⁡(r,h)=∑j(λj′)2. Counting each column's ordered pairs of boxes gives ∑j(λj′)2=∣λ∣+2∑i(i−1)λi: in a column of height c, its square is c+2∑i=1c(i−1).

2.1F1step 1.1algebra

Consider the induced map of an endomorphism f on Iλ/TIλ. Ordered by block length, its matrix is block triangular: a homomorphism from length r to a larger length h has image of 1 divisible by Th−r and hence has zero reduction in the target head. Its diagonal blocks are arbitrary matrices Br∈Mat⁡mr(k); all choices occur independently by constant matrices between blocks of the same length. The linear map from the D-dimensional endomorphism space to these diagonal blocks is onto, with every fiber of size qD−∑rmr2.

3.1F1step 2.1algebra

The map f is invertible exactly when all Br are invertible. Necessity follows from invertibility on the quotient. Conversely those blocks make the triangular head map surjective, so Iλ=f(Iλ)+TIλ. Since f commutes with T, iteration gives Iλ=f(Iλ)+TNIλ for every N, and nilpotence makes the last summand zero for large N. Thus f is onto and, on a finite-dimensional vector space, bijective; its inverse commutes with T.

4.1step 1.1step 2.1step 3.1algebra∎

Successively choosing linearly independent columns gives ∣GL⁡m(k)∣=∏i=0m−1(qm−qi)=qm2∏j=1m(1−q−j), including m=0. Hence the two preceding steps count the automorphisms as qD−∑rmr2∏r∣GL⁡mr(k)∣=qD∏r∏j=1mr(1−q−j). Substitute D from step 1.1. For λ=∅ the space is zero and its sole automorphism is the identity.

Depends on

Used by

Dependency tree · two levels

10 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources