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.
Determinant twists translate GL_r highest weights
Statement
Assume the Axiom of Choice. Let as in Schur modules and their characters, and let be the determinant character. Write for when using row-length coordinates; these zeros are not parts.
(i) For every partition with and every integer , let denote the partition obtained from by deleting all trailing zeros; the all-zero tuple gives (Partitions, English diagrams, and conjugation). Then one has as rational -modules, where for is the -fold tensor power of the dual of the one-dimensional module (On , the induced map is multiplication by , Determinant multiplicativity follows from the top exterior power).
(ii) Consequently the irreducible rational representations of are, up to isomorphism, exactly the twists with a partition of at most parts and ; the irreducible rational representation of highest weight is , where is obtained from by deleting all trailing zeros, again giving if every coordinate is zero.
Facts & Assumptions
Given: AC, , the diagonal torus and its characters , the one-dimensional determinant module with character , the Laurent character ring in which characters of rational -modules are expanded, and the Schur modules (Schur modules and their characters, On , the induced map is multiplication by ).
for and for ; characters of finite-dimensional rational modules are additive over direct sums and multiplicative over tensor products, and the character of is for every (Semistandard tableaux expand Schur characters, Schur modules and their characters, On , the induced map is multiplication by , Determinant multiplicativity follows from the top exterior power).
Bialternant description: for a partition with , with and (Stable Schur functions from bialternants).
Classification of irreducible rational representations: the irreducible rational -modules are exactly the modules with , , and the highest weight of is ; two irreducible rational modules with the same highest weight are isomorphic (Goodman--Wallach Theorem 5.5.22; Seynnaeve §12.1 Proposition 12.1). Every is a polynomial irreducible of highest weight (Polynomial representations of GL_r and their highest weights).
Proof
Determinant scaling of the alternant. Put with the zero-removal convention in (i). Since , the shifted coordinates are weakly decreasing and nonnegative, so is a partition with at most parts. After padding its coordinates back to length , . Thus every entry in row of the alternant matrix for is multiplied by to obtain the matrix for , giving Dividing by in the Laurent rational function field and applying [F2] yields This identity is valid also for negative ; the left side is a polynomial because the shifted coordinates are nonnegative.
By [F1] and step 1.1, . Tensoring with the one-dimensional character preserves invariant subspaces: each representing operator is multiplied by a nonzero scalar. Hence is irreducible, and its highest weight is , since a highest weight vector is multiplied on the diagonal torus by and is trivial on the upper unipotent subgroup. The polynomial irreducible has the same padded highest weight by [F3]. Highest-weight uniqueness in [F3] gives the isomorphism in (i).
By [F3] every irreducible rational module is for a partition of at most parts and , and conversely each such twist is irreducible of highest weight . For a dominant integral highest weight , take and form by deleting the trailing zeros of . This is a partition, including when all coordinates vanish, and its padded coordinates satisfy . Thus has highest weight and is the required irreducible by [F3]. The parametrisation with padded last coordinate is unique: then and the remaining positive coordinates determine . Arbitrary pairs need not be unique.
Depends on
- The Axiom of Choice
- Schur modules and their characters
- Polynomial representations of GL_r and their highest weights
- Semistandard tableaux expand Schur characters
- Stable Schur functions from bialternants
- On $\Lambda^{n}V$, the induced map $\Lambda^{n}T$ is multiplication by $\det T$
- Determinant multiplicativity follows from the top exterior power
- Partitions, English diagrams, and conjugation
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
25 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
- T. Seynnaeve, Representation Theory (lecture notes, Bern) (standard reference, not scraped)
- R. Goodman and N. R. Wallach, Symmetry, Representations, and Invariants, Graduate Texts in Mathematics 255, Springer 2009 (standard reference, not scraped)
- P. Etingof, Lie Groups and Lie Algebras II (MIT 18.755, Spring 2024), complete lecture notes (standard reference, not scraped)