Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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 V be a finite-dimensional complex vector space of dimension r≥1 and put G=GL⁡(V); fixing a basis, identify G with GL⁡r(C) and let gij denote the matrix entries of g∈G. A finite-dimensional representation ρ ⁣:G→GL⁡(W) is polynomial if in some pair of bases (equivalently, in every pair of bases) the matrix coefficients of ρ are polynomial functions of the gij; it is rational if these coefficients are rational functions defined on all of G.

For the diagonal torus T={diag⁡(t1,…,tr):ti∈C×} a polynomial representation is a direct sum of weight spaces Wα={w∈W:ρ(t)w=tαw for all t∈T},α=(α1,…,αr)∈Zr,tα=t1α1⋯trαr, the eigenvalues α with Wα≠0 being the weights of W (Etingof §27.3; Goodman--Wallach Ch. 8 §8.1.2). A weight of a polynomial representation has nonnegative entries, α∈Z≥0r: the matrix coefficients are polynomial and t↦tα occurs as a polynomial character, so αi<0 is impossible. Consequently the highest weight of a polynomial irreducible representation of G (with respect to the Borel subgroup of upper triangular matrices) is a partition λ=(λ1≥⋯≥λr≥0) padded by zeros, that is, a partition with at most r parts (Partitions, English diagrams, and conjugation).

For every partition λ with ℓ(λ)≤r put n=∣λ∣ and let Sλ(V):=Hom⁡Sn(Sλ,V⊗n) be the Schur--Weyl module of Schur-Weyl decomposition and highest weights, where Sλ is the complex Specht module (Column antisymmetrizers, polytabloids, and Specht modules) and Sn acts on V⊗n by place permutations (Commuting symmetric-group and linear actions on a tensor power). Then Sλ(V) is a nonzero polynomial irreducible representation of G of highest weight λ, and distinct partitions with at most r parts give non-isomorphic modules (Schur-Weyl decomposition and highest weights parts (1)--(4)). Conversely every polynomial irreducible representation of G is isomorphic to Sλ(V) for exactly one partition λ with ℓ(λ)≤r: this is the classical type-A 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