Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Integral and field-valued Specht modules

Definition

Throughout, R is a commutative ring, n≥0, and λ⊢n with Young diagram [λ]. Tabloids, the left action σ⋅{t}:={σ⋅t} of Sn on the finite set Ωλ of λ-tabloids, and the complex tabloid module Mλ=C(Ωλ) are as in Young subgroups, tabloids, and permutation modules: rows are labelled and the order of entries inside a row is forgotten.

The tabloid module over R. Put MRλ:=R(Ωλ), the free left R-module with the tabloids as R-basis, and let Sn act on MRλ by R-linear extension of σ⋅{t}:={σ⋅t} on basis elements. The row-set computation of Young subgroups, tabloids, and permutation modules shows that this rule is well defined on tabloids, and because the action on tableaux is a left action, id⋅{t}={t} and σ⋅(τ⋅{t})=(στ)⋅{t}; hence MRλ is a left module over Sn and over the group ring R[Sn].

Antisymmetrizers, polytabloids, and Specht modules. Let t be a λ-tableau with column stabilizer Ct (Row and column stabilizers), and let sgn⁡:Sn→{+1,−1} be the sign homomorphism (The sign is a homomorphism Sn→{+1,−1}, surjective exactly when n≥2); its values are read in R through the unique unital ring homomorphism Z→R. Define κt:=∑γ∈Ctsgn⁡(γ) γ ∈R[Sn],et:=κt⋅{t}=∑γ∈Ctsgn⁡(γ) {γ⋅t} ∈MRλ, and let SRλ:=span⁡R{ et: t is a λ-tableau } ⊆MRλ. All sums here are finite sums over the finite group Ct, so κt, et and SRλ are well defined for every commutative ring R. For the empty partition the empty tableau is the unique one and has Ct={1}, so κt=1, et={∅} and SR∅=R. For every tableau t one has Ct∩Rt={1}: a permutation preserving every row set and every column set must fix the entry in each row-column intersection, since each intersection contains a single box. Hence the tabloids γ⋅{t}, γ∈Ct, are distinct and the coefficient of {t} in et is 1. Thus et≠0 whenever R is nonzero; if R is the zero ring, then MRλ=SRλ=0 and et=0.

Covariance of the construction over R. For every λ-tableau t and every σ∈Sn, κσ⋅t=σκtσ−1andeσ⋅t=σ⋅et, and for every γ∈Ct one has γ⋅et=sgn⁡(γ)et. Consequently SRλ is an R[Sn]-submodule of MRλ, and for any single λ-tableau t the orbit of et spans SRλ. These identities are the ones published for R=C in Polytabloid covariance and the column sign rule; because the argument there consists only of reindexing the finite sums over Ct and over Cσ⋅t, it is valid verbatim over an arbitrary commutative ring. The two reindexings are written out in the remarks below.

Agreement with the complex Specht module. For R=C the module MCλ, the element κt, the polytabloid et and the space SCλ coincide with Mλ, κt, et and Sλ of Column antisymmetrizers, polytabloids, and Specht modules: the tabloid set and the left action are the same, the permutation sign used there is the sign of The sign is a homomorphism Sn→{+1,−1}, surjective exactly when n≥2 transported along the order-preserving relabelling described in that item, and the defining formulas are identical. In particular every published statement about κt,et,Sλ applies to SCλ.

Remarks

  • The two reindexings. First, Cσ⋅t=σCtσ−1: a permutation γ preserves each column set σ(Bj) of σ⋅t exactly when σ−1γσ preserves each column set Bj of t. Reindexing the finite sum defining κσ⋅t by γ=σcσ−1 and using sgn⁡(σcσ−1)=sgn⁡(c), which follows from multiplicativity of the sign and sgn⁡(σ−1)=sgn⁡(σ)−1=sgn⁡(σ) in {+1,−1}, gives κσ⋅t=σκtσ−1. Applying both sides to {σ⋅t} and using σ−1⋅{σ⋅t}={t} gives eσ⋅t=σ⋅et. Second, reindexing the sum defining κt by c↦γc for γ∈Ct and using multiplicativity of the sign gives γκt=sgn⁡(γ)κt, hence γ⋅et=sgn⁡(γ)et.

  • Reasons for stating the construction over a commutative ring. The restriction of a Specht module to Sn−1 has a removable-corner filtration over every field, and in positive characteristic that filtration need not split; the filtration and its modular failure are stated below on this page in terms of SFλ for a general field F. The case R=Z records the integral lattice spanned by the polytabloids.

  • No choice is used. The sums are over the finite group Ct, and the scalar extension Z→R is unique, so no selection principle enters the definition.

Depends on

Used by

Dependency tree · two levels

14 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