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.
Polynomial representations of GL_r and their highest weights
Definition
Assume the Axiom of Choice. Let be a finite-dimensional complex vector space of dimension and put ; fixing a basis, identify with and let denote the matrix entries of . A finite-dimensional representation is polynomial if in some pair of bases (equivalently, in every pair of bases) the matrix coefficients of are polynomial functions of the ; it is rational if these coefficients are rational functions defined on all of .
For the diagonal torus a polynomial representation is a direct sum of weight spaces the eigenvalues with being the weights of (Etingof §27.3; Goodman--Wallach Ch. 8 §8.1.2). A weight of a polynomial representation has nonnegative entries, : the matrix coefficients are polynomial and occurs as a polynomial character, so is impossible. Consequently the highest weight of a polynomial irreducible representation of (with respect to the Borel subgroup of upper triangular matrices) is a partition padded by zeros, that is, a partition with at most parts (Partitions, English diagrams, and conjugation).
For every partition with put and let be the Schur--Weyl module of Schur-Weyl decomposition and highest weights, where is the complex Specht module (Column antisymmetrizers, polytabloids, and Specht modules) and acts on by place permutations (Commuting symmetric-group and linear actions on a tensor power). Then is a nonzero polynomial irreducible representation of of highest weight , and distinct partitions with at most parts give non-isomorphic modules (Schur-Weyl decomposition and highest weights parts (1)--(4)). Conversely every polynomial irreducible representation of is isomorphic to for exactly one partition with : this is the classical type- highest-weight classification of polynomial representations (Etingof §27.3--27.4; Goodman--Wallach Theorem 5.5.22 for the corresponding rational classification; see Schur modules and their characters for the module notation used below).
Depends on
Used by
Dependency tree · two levels
29 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)
- P. Etingof, Lie Groups and Lie Algebras II (MIT 18.755, Spring 2024), complete lecture notes (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)