Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 V=Cr as in Schur modules and their characters, and let det⁡ ⁣:GL⁡(V)→C× be the determinant character. Write λj=0 for j>ℓ(λ) when using row-length coordinates; these zeros are not parts.

(i) For every partition λ with ℓ(λ)≤r and every integer k≥−λr, let λ+(kr) denote the partition obtained from (λ1+k,…,λr+k) by deleting all trailing zeros; the all-zero tuple gives ∅ (Partitions, English diagrams, and conjugation). Then one has Sλ+(kr)(V)≅Sλ(V)⊗det⁡k as rational GL⁡(V)-modules, where det⁡k for k<0 is the ∣k∣-fold tensor power of the dual of the one-dimensional module det⁡=ΛrV (On ΛnV, the induced map ΛnT is multiplication by det⁡T, Determinant multiplicativity follows from the top exterior power).

(ii) Consequently the irreducible rational representations of GL⁡(V) are, up to isomorphism, exactly the twists Sλ(V)⊗det⁡k with λ a partition of at most r parts and k∈Z; the irreducible rational representation of highest weight η=(η1≥⋯≥ηr)∈Zr is Sηˉ(V)⊗det⁡ηr, where ηˉ is obtained from (η1−ηr,…,ηr−ηr) by deleting all trailing zeros, again giving ∅ if every coordinate is zero.

Facts & Assumptions

Given: AC, V=Cr, the diagonal torus and its characters xα, the one-dimensional determinant module det⁡=ΛrV with character x1⋯xr, the Laurent character ring Z[x1±1,…,xr±1] in which characters of rational GL⁡(V)-modules are expanded, and the Schur modules Sλ(V) (Schur modules and their characters, On ΛnV, the induced map ΛnT is multiplication by det⁡T).

[F1]

ch⁡Sλ(V)=sλ(x1,…,xr) for ℓ(λ)≤r and Sλ(V)=0 for ℓ(λ)>r; characters of finite-dimensional rational modules are additive over direct sums and multiplicative over tensor products, and the character of det⁡k is (x1⋯xr)k for every k∈Z (Semistandard tableaux expand Schur characters, Schur modules and their characters, On ΛnV, the induced map ΛnT is multiplication by det⁡T, Determinant multiplicativity follows from the top exterior power).

[F2]

Bialternant description: for a partition η with ℓ(η)≤r, sη(x1,…,xr)=aη+ρr/aρr with ρr=(r−1,…,0) and aζ=det⁡(xiζj) (Stable Schur functions from bialternants).

[F3]

Classification of irreducible rational representations: the irreducible rational GL⁡(V)-modules are exactly the modules Sλ(V)⊗det⁡k with ℓ(λ)≤r, k∈Z, and the highest weight of Sλ(V)⊗det⁡k is λ+k(1r); two irreducible rational modules with the same highest weight are isomorphic (Goodman--Wallach Theorem 5.5.22; Seynnaeve §12.1 Proposition 12.1). Every Sλ(V) is a polynomial irreducible of highest weight λ (Polynomial representations of GL_r and their highest weights).

Proof

1.1F2givenalgebra

Determinant scaling of the alternant. Put τ=λ+(kr) with the zero-removal convention in (i). Since k≥−λr, the shifted coordinates are weakly decreasing and nonnegative, so τ is a partition with at most r parts. After padding its coordinates back to length r, τj=λj+k. Thus every entry in row i of the alternant matrix for λ+ρr is multiplied by xik to obtain the matrix for τ+ρr, giving aτ+ρr=(x1⋯xr)kaλ+ρr. Dividing by aρr in the Laurent rational function field and applying [F2] yields sτ(x1,…,xr)=(x1⋯xr)ksλ(x1,…,xr). This identity is valid also for negative k; the left side is a polynomial because the shifted coordinates are nonnegative.

2.1F1F3step 1.1algebra

By [F1] and step 1.1, ch⁡(Sλ(V)⊗det⁡k)=sλ(x)(x1⋯xr)k=sτ(x)=ch⁡Sτ(V). Tensoring with the one-dimensional character det⁡k preserves invariant subspaces: each representing operator is multiplied by a nonzero scalar. Hence Sλ(V)⊗det⁡k is irreducible, and its highest weight is (λ1+k,…,λr+k), since a highest weight vector is multiplied on the diagonal torus by (x1⋯xr)k and det⁡k is trivial on the upper unipotent subgroup. The polynomial irreducible Sτ(V) has the same padded highest weight by [F3]. Highest-weight uniqueness in [F3] gives the isomorphism in (i).

3.1F3step 2.1algebra∎

By [F3] every irreducible rational module is Sλ(V)⊗det⁡k for a partition λ of at most r parts and k∈Z, and conversely each such twist is irreducible of highest weight (λ1+k,…,λr+k). For a dominant integral highest weight η, take k=ηr and form ηˉ by deleting the trailing zeros of (η1−ηr,…,ηr−ηr). This is a partition, including ∅ when all coordinates vanish, and its padded coordinates satisfy ηˉj+k=ηj. Thus Sηˉ(V)⊗det⁡ηr has highest weight η and is the required irreducible by [F3]. The parametrisation with padded last coordinate λr=0 is unique: then k=ηr and the remaining positive coordinates determine λ. Arbitrary pairs (λ,k) need not be unique.

Depends on

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