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.

Schur modules and their characters

Definition

Assume the Axiom of Choice. Let V=Cr with r≥1, and let λ be a partition with at most r parts (Partitions, English diagrams, and conjugation). Put n=∣λ∣ and define the Schur module Sλ(V):=Hom⁡Sn(Sλ,V⊗n), 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); the GL⁡(V)-action is by postcomposition, (g⋅φ)(s)=g⊗nφ(s). By Schur-Weyl decomposition and highest weights the space Sλ(V) is a nonzero irreducible polynomial GL⁡(V)-module of highest weight λ in the sense of Polynomial representations of GL_r and their highest weights; for a partition with ℓ(λ)>r we define Sλ(V):=0.

Let T={diag⁡(t1,…,tr)}⊆GL⁡(V) be the diagonal torus as in Polynomial representations of GL_r and their highest weights. The character of a finite-dimensional polynomial GL⁡(V)-module W is the polynomial ch⁡W=∑α∈Zrdim⁡Wα xα∈Z[x1,…,xr],xα=x1α1⋯xrαr, where Wα is the weight space of T. Characters are additive over direct sums, and ch⁡(W⊗W′)=ch⁡W⋅ch⁡W′ for finite-dimensional polynomial modules, because (W⊗W′)α=⨁β+γ=αWβ⊗Wγ′. The character of a polynomial module is a symmetric polynomial: conjugation by a permutation matrix gσ carries diag⁡(t1,…,tr) to diag⁡(tσ(1),…,tσ(r)), and characters of representations of a group are class functions, so ch⁡W is invariant under permuting x1,…,xr. In particular ch⁡Sλ(V) is a symmetric polynomial for ℓ(λ)≤r, homogeneous of degree n because the Schur--Weyl decomposition of Schur-Weyl decomposition and highest weights exhibits Sλ(V) as a direct summand of V⊗n, all of whose weights have total degree n; it is 0 for ℓ(λ)>r.

Remarks. The module Sλ(V) is the multiplicity space Mλ of Schur-Weyl decomposition and highest weights; the two notations denote the same object. The character ch⁡Sλ(V) is computed explicitly in Semistandard tableaux expand Schur characters as the sum over semistandard tableaux of shape λ with entries in {1,…,r}, and it is the rank-r Schur polynomial sλ(x1,…,xr) of Stable Schur functions from bialternants.

Depends on

Used by

Dependency tree · two levels

30 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