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 over , write and . Then In particular .
Facts & Assumptions
Given: A finite field of cardinality , a partition , and with its nilpotent operator denoted .
The representation is the direct sum of blocks with multiplicities (Jordan-quiver isomorphism classes are indexed by partitions).
Conjugate partition columns have heights (Partitions, English diagrams, and conjugation).
In a nilpotent Jordan-string basis , the operator satisfies and for ; its matrix is (Jordan blocks, Jordan strings, and their endpoints).
Proof
For the Jordan-string basis of , we have and for . Give the -module structure in which acts by its nilpotent operator. The linear map sending to for is a bijection commuting with , hence a module isomorphism. Intertwining linear maps are exactly module homomorphisms. A module homomorphism is determined by the image of , which may be any vector killed by ; that space has dimension . Thus the endomorphism algebra of has dimension . Counting each column's ordered pairs of boxes gives : in a column of height , its square is .
Consider the induced map of an endomorphism on . Ordered by block length, its matrix is block triangular: a homomorphism from length to a larger length has image of divisible by and hence has zero reduction in the target head. Its diagonal blocks are arbitrary matrices ; all choices occur independently by constant matrices between blocks of the same length. The linear map from the -dimensional endomorphism space to these diagonal blocks is onto, with every fiber of size .
The map is invertible exactly when all are invertible. Necessity follows from invertibility on the quotient. Conversely those blocks make the triangular head map surjective, so . Since commutes with , iteration gives for every , and nilpotence makes the last summand zero for large . Thus is onto and, on a finite-dimensional vector space, bijective; its inverse commutes with .
Successively choosing linearly independent columns gives , including . Hence the two preceding steps count the automorphisms as . Substitute 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
- Olivier Schiffmann, Lectures on Hall Algebras, §2.3, Lemma 2.8 (standard reference, not scraped)