Alphabeta Math
Pipeline-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.

✓ 14 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 10 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Integral Specht Modules and Modular Simple Modules

1 · Prerequisites

2 · Summary

This page develops the integral and modular theory of Specht modules for the symmetric group Sn over a fixed splitting p-modular system (K,O,k). The first items construct the integral Specht lattice SZλ⊆MZλ on the tabloids, prove that the standard polytabloids form a Z-basis, that the lattice is a saturated summand of the integral tabloid module, and that the construction commutes with base change to every commutative ring. The orthonormal integral tabloid form β and its integer Gram matrix Gλ in the standard basis are set up in parallel, and the two partition conditions that govern the modular theory are fixed: λ is p-regular when no positive part occurs p times, and p-restricted when consecutive parts differ by less than p. The basic layer also contains the field form of the antisymmetrizer image lemma, stating that κtMFμ≠0 forces λ⊵μ, and the integral gcd lemma, which locates the p-divisibility of the Gram data between L=∏jzj! and U=∏j(zj!)j: the positive gcd gλ of all integral polytabloid pairings satisfies L∣gλ∣U, so p∤gλ exactly when λ is p-regular.

The modular form quotient Dλ=Skλ/Rλ, with Rλ the form radical Skλ∩(Skλ)⊥, is then analysed using the James submodule theorem over an arbitrary field. The vanishing criterion is Dλ≠0 if and only if λ is p-regular, with dim⁡kDλ=rank⁡k(Gλ mod p); when nonzero, Dλ is the simple, self-dual and absolutely irreducible head of Skλ, and Rλ is its radical. A dominance lemma for nonzero maps between Specht quotients shows that Dμ can occur as a composition factor of Skλ only if μ⊵λ, and these two results force Dλ=0 for p-singular λ and identify the modular simple modules with the family Dλ indexed by the p-regular partitions λ⊢n: they are nonzero, pairwise non-isomorphic and exhaust every simple k[Sn]-module, the count of them agreeing with the number of p-regular conjugacy classes by Brauer's theorem and a coefficient-wise partition identity.

The closing items relate the two label conventions and record the decomposition matrix. Conjugate Specht sign duality gives S(μ)≅Skμ′⊗sgn⁡ for p-restricted μ, hence D(μ)≅Dμ′⊗sgn⁡, so the p-restricted labels are exchanged with the p-regular ones by transposition and a sign twist. For the decomposition numbers dλμ=[Skλ:Dμ] one has the dominance bound dλμ=0 unless μ⊵λ, the diagonal value dλλ=1 for p-regular λ, and a lower unitriangular leading block when the p-regular labels are ordered decreasingly lexicographically. A closing remark records that this triangularity is a constraint and not a computation: for n=3 the entry d(2,1),(3) is 0 in characteristic 2 and 1 in characteristic 3, so determining the off-diagonal entries requires the modular composition factors of the Specht modules as separate input, and no general formula or algorithm for them is asserted here.

All actions on tabloids are left actions and tabloids keep their labelled rows; the form β is the symmetric bilinear form making the tabloids orthonormal, not the complex Hermitian form of the ordinary theory. The splitting p-modular system is fixed throughout, no additional hypothesis of algebraic closure is imposed on k, and every item on this page is finite and choice-free, with characteristic 2 included.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02Open item page →

Integral Specht lattice and base change

Definition

Let n≥0, let λ⊢n, and let Ωλ be the finite set of λ-tabloids; for a λ-tableau t write {t} for its tabloid (Young subgroups, tabloids, and permutation modules). The integral tabloid module is the free abelian group on Ωλ,

MZλ:=Z(Ωλ)={∑T∈ΩλaT T: aT∈Z, only finitely many aT≠0},

with the tabloids as standard Z-basis (The free module on a set and its standard basis). The left action of Sn on tabloids extends Z-linearly to MZλ, so that MZλ is a Z[Sn]-module. For every λ-tableau t put

κt:=∑γ∈Ctsgn⁡(γ)γ∈Z[Sn],et:=κt⋅{t}=∑γ∈Ctsgn⁡(γ) {γ⋅t}∈MZλ,

the integral column polytabloid; every coefficient lies in {0,1,−1} (Column antisymmetrizers, polytabloids, and Specht modules). The integral Specht lattice is the Z[Sn]-submodule

SZλ:=the Z-span of { es: s a λ-tableau }⊆MZλ.

For a commutative ring R let MRλ:=R(Ωλ) be the free R-module on the tabloids and let SRλ⊆MRλ be the R-span of the polytabloids ∑γ∈Ctsgn⁡(γ){γ⋅t}, t a λ-tableau. The standard polytabloids are the es with s a standard λ-tableau (Tableaux and standard tableaux).

This item records three facts. First, the standard polytabloids form a Z-basis of SZλ, so the integral Specht lattice has explicit finite rank. Second, for every commutative ring R the canonical map R⊗ZSZλ→R⊗ZMZλ≅MRλ is injective onto SRλ: the lattice is a direct summand of the free tabloid module and is compatible with base change, including rings of prime characteristic. Third, for λ=∅ the module has rank one and is generated by the empty polytabloid.

Facts & Assumptions

Given: An integer n≥0, a partition λ⊢n, and the definitions above.

[F1]

The tabloids form a basis of Mλ, the tabloid of t is {t}={ρ⋅t:ρ∈Rt}, and the left action of Sn extends linearly (Young subgroups, tabloids, and permutation modules).

[F2]

κt=∑γ∈Ctsgn⁡(γ)γ and et=κt⋅{t} (Column antisymmetrizers, polytabloids, and Specht modules).

[F3]

Ct∩Rt={1} for every tableau, so the tabloids γ⋅{t} for γ∈Ct are pairwise distinct and the coefficient of {t} in et is 1 (Column antisymmetrizers, polytabloids, and Specht modules).

[F4]

The tabloid order is a finite strict total order on Ωλ and the column order ≺ is a finite strict total order on the column-standard λ-tableaux (Tabloid and column orders for Specht straightening).

[F5]

If X,Y lie in adjacent columns and ∣X∣+∣Y∣>λj′, then for every left-coset transversal T containing 1 the integral group-algebra element GX,Y=∑g∈Tsgn⁡(g)g satisfies GX,Yet=0 over C (Adjacent-column Garnir relation over C).

[F6]

Over C, every polytabloid is a finite complex linear combination of standard polytabloids (Garnir straightening spans the complex Specht module).

[F7]

For a column-standard tableau t, the coefficient of {t} in et is 1 and every other tabloid occurring in et is strictly below {t} in the tabloid order; consequently the standard polytabloids are linearly independent over C (Leading tabloid of a column-standard polytabloid).

[F8]

Over C one has eσ⋅t=σ⋅et for σ∈Sn and γ⋅et=sgn⁡(γ)et for γ∈Ct (Polytabloid covariance and the column sign rule).

[F9]

MZλ=Z(Ωλ) is free with the tabloids as a Z-basis, so every element has a unique finite integer coordinate expression and a vector vanishes exactly when all its tabloid coefficients vanish (The free module on a set and its standard basis).

[F10]

For a commutative ring R there are natural isomorphisms R⊗Z(⨁TZ)≅⨁T(R⊗ZZ) and R⊗ZZ≅R, hence a natural isomorphism R⊗ZMZλ≅MRλ carrying 1⊗T to the tabloid T (Tensor products commute with arbitrary direct sums, The regular module is a tensor unit: R⊗RN≅N and M⊗RR≅M).

[F11]

The standard λ-tableaux are the tableaux strictly increasing along rows and down columns; for λ=∅ the empty tableau is the unique standard tableau (Tableaux and standard tableaux).

Proof

technique · direct
1.1givenF2F3algebra

By [F3] the tabloids γ⋅{t} with γ∈Ct are pairwise distinct, so in the expansion et=∑γsgn⁡(γ){γ⋅t} no tabloid occurs twice; every coefficient is 0 or ±1, the coefficient of {t} is 1, and et≠0. In particular et is a genuine nonzero integral vector of MZλ.

1.2givenF1F2F8algebra

For σ∈Sn the column sets satisfy Cσ⋅t=σCtσ−1, and the substitution γ=σδσ−1 gives eσ⋅t=∑δ∈Ctsgn⁡(δ){σδ⋅t}=σ⋅et. This identity of two integral vectors holds over C by [F8], and by the uniqueness of tabloid coordinates it therefore holds in MZλ. Since every λ-tableau is σ⋅t0 for the tableau t0 that lists 1,…,n along the rows of [λ], the lattice SZλ is generated over Z[Sn] by the single polytabloid et0.

1.3givenF5algebra

The Garnir element of [F5] is an integral group-algebra element, and GX,Yet=∑g∈T∑γ∈Ctsgn⁡(g)sgn⁡(γ){gγ⋅t} has integer coefficients in the tabloid basis. The identity GX,Yet=0 holds in MCλ between two integral vectors, so by uniqueness of tabloid coordinates it holds in MZλ: the Garnir relation is integral.

1.4givenF1F2F11

For λ=∅ there is exactly one tabloid and one tableau, with Ct={1}, κt=1 and et={∅}; the empty tableau is standard by [F11]. Thus MZ∅=Z{∅}≅Z and SZ∅=Z{∅} has rank one with the empty polytabloid as basis.

2.1givenF4F5F6step 1.2step 1.3algebra

Run the published spanning argument inside MZλ: for column-standard s that is not standard, the integral Garnir relation of step 1.3 with the explicit transversal containing 1 isolates the identity term and gives es=−∑A≠Xsgn⁡(gA)egA⋅s with each gA an explicit product of disjoint swaps; sorting columns and using the covariance of step 1.2 rewrites each egA⋅s as ±eu with u column-standard and s≺u in the finite order [F4]; and any tableau is taken to column-standard form by a column permutation, again by step 1.2. Reverse induction along [F4] therefore gives, for every λ-tableau t, an identity et=∑u standardctueu with integer coefficients ctu. Hence the standard polytabloids span SZλ over Z.

3.1givenF4F7step 2.1algebra

Order the standard λ-tableaux t1,…,td so that {t1}<⋯<{td} in the tabloid order of [F4], possible since distinct standard tableaux have distinct tabloids and the order is total. By [F7], eti={ti}+∑T<{ti}cTT with integer cT, so the coefficient of {tj} in eti is 0 for j>i and 1 for j=i. A relation ∑iaieti=0 with integral ai therefore forces ad=0, then ad−1=0, and so on; the standard polytabloids are Z-linearly independent and, with step 2.1, form a Z-basis of SZλ.

4.1givenF9step 3.1algebra

Let P:Zd→MZλ send the i-th standard basis vector to eti, so that im⁡P=SZλ by step 3.1, and let π:MZλ→Zd take tabloid coordinates at {t1},…,{td}. By step 3.1 the matrix of π∘P is upper unitriangular with integer entries, hence invertible over Z by integer back-substitution, and ρ:=(π∘P)−1∘π satisfies ρ∘P=id. Thus P is injective and split, SZλ is a direct summand of the free Z-module MZλ, and MZλ/SZλ is free: the lattice is saturated.

5.1givenF10step 2.1step 4.1algebra

Let R be a commutative ring and use the identification R⊗ZMZλ≅MRλ of [F10]. The map idR⊗P has image R⊗ZSZλ and idR⊗ρ is a left inverse of it, so idR⊗P is injective; hence the canonical map R⊗ZSZλ→MRλ is injective onto the R-span of the vectors 1⊗eti, which is the R-span of the standard polytabloids. By the identity of step 2.1 every polytabloid is an integral combination of standard ones, so this span is exactly SRλ; therefore SRλ≅R⊗ZSZλ for every commutative ring R, including rings of prime characteristic.

6.1givenstep 1.4step 3.1step 4.1step 5.1∎

Taking R=Z in step 5.1 returns SZλ, and taking λ=∅ returns the rank-one lattice Z{∅} of step 1.4; the standard-polytabloid basis is step 3.1 and saturation is step 4.1. This proves the three asserted properties for all n≥0, including n=0.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02Open item page →

Integral tabloid form and Specht Gram matrix

Definition

Let n≥0 and λ⊢n, and keep the integral tabloid module MZλ and the integral Specht lattice SZλ with its standard basis (Integral Specht lattice and base change). The integral tabloid form is the Z-bilinear form

β:MZλ×MZλ⟶Z,β(∑TaTT, ∑UbUU):=∑T∈ΩλaTbT,

the unique Z-bilinear form for which the tabloid basis is orthonormal: β(T,U)=δTU for all λ-tabloids T,U. It is symmetric because δTU=δUT, and nondegenerate because β(x,U)=0 for all U forces every tabloid coefficient of x to vanish.

Let s1,…,sd be the standard λ-tableaux and es1,…,esd the corresponding standard polytabloids, a Z-basis of SZλ. The integral Specht Gram matrix is

Gλ:=(β(esi,esj))1≤i,j≤d∈Md(Z),

the matrix of the restriction β∣SZλ in the standard basis; its entries are integers because each es has tabloid coefficients in {0,1,−1}. For a commutative ring R let βR:MRλ×MRλ→R be the R-bilinear form with βR(T,U)=δTU on the tabloid basis of MRλ. Under the canonical identification MRλ≅R⊗ZMZλ the form βR is the scalar extension of β, βR(1⊗x,1⊗y)=1⊗β(x,y), and the Gram matrix of βR in the standard basis 1⊗esi of SRλ is the scalar extension of Gλ to R.

Two warnings are built into the definition. First, β is a symmetric bilinear form, not the complex Hermitian form of Invariant Hermitian product on a tabloid module: the latter is conjugate-linear in its first variable and positive definite, and neither its conjugation nor its positivity has a meaning over a general commutative ring. Positivity of β is asserted only after embedding in R or C: for real coefficients β(x,x)=∑TaT2≥0 with equality only for x=0. Second, the reduction of Gλ modulo a prime is governed by the divisibility theory of its entries, and cannot be decided from the positive-definiteness of the Hermitian form.

The form satisfies β(σx,σy)=β(x,y) for all σ∈Sn, so every κt is self-adjoint for β: β(κtx,y)=β(x,κty).

Facts & Assumptions

Given: An integer n≥0, a partition λ⊢n, and the definitions above.

[F1]

MZλ is free with the tabloids as Z-basis, so every element has a unique finite integer coordinate expression; for every commutative ring R there is a natural identification MRλ≅R⊗ZMZλ (Integral Specht lattice and base change).

[F2]

The standard polytabloids form a Z-basis of SZλ (Integral Specht lattice and base change).

[F3]

The tabloids form a basis of the permutation module Mλ and each σ∈Sn permutes the tabloids bijectively (Young subgroups, tabloids, and permutation modules).

[F4]

κt=∑γ∈Ctsgn⁡(γ)γ and et=∑γ∈Ctsgn⁡(γ){γ⋅t}, so all tabloid coefficients of et lie in {0,1,−1} (Column antisymmetrizers, polytabloids, and Specht modules).

[F5]

The published Hermitian form on the complex tabloid module is conjugate-linear in its first variable, positive definite, invariant under the unitary action, and every κt is self-adjoint for it (Invariant Hermitian product on a tabloid module).

Proof

technique · direct
1.1givenF1algebra

The prescription β(T,U)=δTU on the tabloid basis extends uniquely to a Z-bilinear map by [F1], and the formula β(∑TaTT,∑UbUU)=∑TaTbT is finite because only finitely many coefficients are nonzero. If β(x,U)=0 for every tabloid U, then taking U to be a tabloid occurring in x gives aU=0, so all coefficients vanish and x=0; the form is nondegenerate.

1.2givenF3algebra

For σ∈Sn, [F3] says that T↦σT is a bijection of the tabloid set, so β(σT,σU)=δσT,σU=δTU=β(T,U) on basis vectors, and bilinearity extends the identity to all x,y.

1.3givenF2F4algebra

Every entry β(es,et) is a finite sum ∑Tcs(T)ct(T) of products of tabloid coefficients, each of which lies in {0,1,−1} by [F4]; hence β(es,et)∈Z and, using the standard basis [F2], Gλ is a matrix over Z. Since β is symmetric, so is Gλ.

2.1givenF4step 1.2algebra

Applying step 1.2 to each term of κt gives β(κtx,y)=∑γ∈Ctsgn⁡(γ)β(γx,y)=∑γsgn⁡(γ)β(x,γ−1y); reindexing γ↦γ−1 and using sgn⁡(γ−1)=sgn⁡(γ) this is β(x,κty), so κt is self-adjoint for β.

2.2givenF1F2step 1.3algebra

Let R be a commutative ring. Under the identification of [F1], the R-bilinear form βR with orthonormal tabloid basis sends 1⊗x,1⊗y to β(x,y) times 1R, by expanding x and y in the tabloid basis; hence βR is the scalar extension of β, and the matrix of βR in the standard basis 1⊗esi is the scalar extension of Gλ.

3.1givenF4F5step 1.3step 2.1step 2.2∎

Over the real field, x=∑TaTT with aT∈R satisfies β(x,x)=∑TaT2≥0, with equality only when all aT=0, i.e. x=0; this is the positivity that holds on real vectors and it is the same quantity as the Hermitian form of [F5] on real coefficients, while the conjugate-linearity of [F5] and the positivity have no counterpart over a general commutative ring, and in particular cannot be reduced modulo a prime. The self-adjointness of step 2.1 and the integrality and scalar extension of steps 1.3 and 2.2 complete the asserted definition.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Modular Specht form and radical quotient

Definition

Fix a prime p, an integer n≥0, and a splitting p-modular system (K,O,k) for Sn, so that K and k are splitting fields for Sn and its subgroups (A splitting p-modular system for a finite group is a p-modular system whose fraction and residue fields split the needed group algebras). Write

Mkλ:=k⊗ZMZλ,Skλ:=k⊗ZSZλ⊆Mkλ

for the base change of the integral tabloid module and Specht lattice; the inclusion is the injective polytabloid-span inclusion of Integral Specht lattice and base change, and Skλ has the images of the standard polytabloids as k-basis. Let βk:Mkλ×Mkλ→k be the reduced integral tabloid form, the unique k-bilinear form with orthonormal tabloid basis (Integral tabloid form and Specht Gram matrix); it is symmetric, nondegenerate, and Sn-invariant.

For a k-subspace V⊆Mkλ put

V⊥:={ x∈Mkλ:βk(x,v)=0 for all v∈V }.

The form radical of Skλ is

Rλ:=Skλ∩(Skλ)⊥,

and the modular Specht quotient (or James quotient) is

Dλ:=Skλ/Rλ.

The quotient is a k[Sn]-module and may be zero. Its dimension is the p-rank of the integral Gram matrix: if Gλ is the Gram matrix of β in the standard-polytabloid basis and Gλ‾ its reduction modulo p, i.e. the matrix of βk in the standard basis of Skλ, then

dim⁡kDλ=rank⁡kGλ‾=rank⁡k(Gλ mod p).

Everything is defined by scalar extension: Skλ and βk are determined by λ and k, and no choice of lifts of elements of Skλ enters. Rλ is a form radical, and is an Sn-submodule; the identification of Rλ with the module radical rad⁡(Skλ)=J(k[Sn])Skλ (The radical, socle, head, and Loewy series of a finite-dimensional module) is a later consequence, asserted only when Dλ≠0. In particular no simplicity of Dλ is claimed here.

Facts & Assumptions

Given: A prime p, an integer n≥0, a partition λ⊢n, a splitting p-modular system (K,O,k) for Sn, and the definitions above.

[F1]

A splitting p-modular system for Sn has k of characteristic p and both K and k splitting fields for every subgroup of Sn (A splitting p-modular system for a finite group is a p-modular system whose fraction and residue fields split the needed group algebras).

[F2]

For every commutative ring R the natural map R⊗ZSZλ→MRλ is injective onto the polytabloid span, with the images of the standard polytabloids as a basis; all elements are R-linear combinations of standard polytabloids (Integral Specht lattice and base change).

[F3]

The reduced form βk has orthonormal tabloid basis, is symmetric, nondegenerate, Sn-invariant, and its Gram matrix in the standard basis of Skλ is the entrywise reduction of Gλ (Integral tabloid form and Specht Gram matrix).

[F4]

The module radical of a finite-dimensional left A-module is rad⁡(M)=J(A)M (The radical, socle, head, and Loewy series of a finite-dimensional module).

[F5]

Rank-nullity for a linear map with finite-dimensional domain gives dim⁡V=rank⁡T+dim⁡ker⁡T (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T).

[F6]

The rank of a matrix equals the rank of the linear map it defines (The rank of a matrix equals the rank of the linear map x↦Ax).

Proof

technique · direct
1.1givenF1F2F3

The field k is the residue field of the splitting p-modular system fixed above, hence has characteristic p and is a splitting field for Sn and all its subgroups by [F1]. Thus Mkλ is a finite-dimensional k-vector space with the tabloids as basis, and Skλ is the k-span of the polytabloids with the standard polytabloids as basis by [F2]. The form βk of [F3] is nondegenerate and Sn-invariant.

1.2givenF3algebra

If U⊆Mkλ is an Sn-submodule, then U⊥ is an Sn-submodule: for x∈U⊥, u∈U and σ∈Sn, invariance gives βk(σx,u)=βk(x,σ−1u)=0 because σ−1u∈U, so σx∈U⊥.

2.1givenF2step 1.1step 1.2

Since Skλ is an Sn-submodule by [F2] and [F3], step 1.2 shows that (Skλ)⊥ is an Sn-submodule, hence so is Rλ=Skλ∩(Skλ)⊥; the quotient Dλ=Skλ/Rλ is therefore a k[Sn]-module, and Dλ=0 holds exactly when Skλ⊆(Skλ)⊥.

2.2givenF3F5F6step 1.1

Let φ:Skλ→(Skλ)∗ be φ(v)=βk(v,⋅)∣Skλ. Its kernel is exactly Rλ, and in the standard basis of Skλ paired with its dual basis the matrix of φ is Gλ‾, so by [F6] the rank of φ equals rank⁡kGλ‾. Rank-nullity [F5] gives dim⁡kSkλ=rank⁡kGλ‾+dim⁡kRλ, hence dim⁡kDλ=rank⁡kGλ‾.

3.1givenF2F3step 2.1step 2.2

The construction involves no choices of lifts: Mkλ, Skλ and βk are obtained from the integral objects by scalar extension, and by [F2] every element of Skλ is a k-combination of the standard polytabloids, so the descriptions of Rλ, Dλ and dim⁡kDλ depend only on λ, p and k.

4.1givenF4step 2.1step 2.2∎

By step 2.1 the form radical is an Sn-submodule and Dλ is defined for every λ, possibly zero; by step 2.2 its dimension is the rank of the reduced Gram matrix. The identification Rλ=rad⁡(Skλ) with the radical of [F4] is asserted only later, for the nonzero case; nothing in this definition presupposes it.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02Open item page →

Field antisymmetrizers have rank-one own-shape image and detect dominance

Statement

Let F be any field, n≥0, and λ⊢n with λ-tableau t. Then

κt MFλ=F et,et≠0,

a rank-one image over F. If μ⊢n and κtMFμ≠0, then λ dominates μ. The statements include fields of characteristic two and the case n=0; no division by a group order and no averaging occurs.

Facts & Assumptions

Given: A field F, an integer n≥0, partitions λ,μ⊢n, a λ-tableau t, and the field-valued tabloid modules MFλ, MFμ obtained by base change from the integral ones.

[F1]

MZλ and MZμ are the free Z-modules on the tabloids and MFλ≅F⊗ZMZλ, with the tabloids as F-basis (Integral Specht lattice and base change).

[F2]

κt=∑γ∈Ctsgn⁡(γ)γ, et=κt⋅{t}, and Ct∩Rt={1}, so the coefficient of {t} in et is 1 and et≠0 over every coefficient ring (Column antisymmetrizers, polytabloids, and Specht modules).

[F3]

The μ-tabloids form a basis of MFμ and Rs is the stabilizer of the tabloid {s} (Young subgroups, tabloids, and permutation modules).

[F4]

If two entries in one row of {s} lie in one column of t, then κt⋅{s}=0 (Column collision cancels antisymmetrization).

[F5]

If every row of a μ-tableau s meets every column of t in at most one entry, then λ⊵μ; and if λ=μ there are ρ∈Rs, γ∈Ct with ρ⋅s=γ⋅t (Basic row-column incidence lemma).

[F6]

λ⊵μ means that every prefix sum of λ is at least the corresponding prefix sum of μ (Dominance order on partitions).

[F7]

Over C, κtMCλ=Cet with et≠0, and if κtMCμ≠0 then λ⊵μ (The antisymmetrizer image in its own tabloid module is one-dimensional, Nonzero antisymmetrizer image detects dominance).

Proof

technique · direct
1.1givenF2algebra

For γ,δ∈Ct the sign is multiplicative, so in the group algebra over any ring κtγ=sgn⁡(γ)κt and in particular κt2=∣Ct∣κt; and κt acts F-linearly on MFλ through the group action. Moreover the coefficient of {t} in et is 1 by [F2], so et≠0 over F.

1.2givenF3F4algebra

Let {s} be a μ-tabloid whose row contains two entries x,y lying in one column of t, so that τ=(xy)∈Ct. Writing Z for a set of left coset representatives of ⟨τ⟩ in Ct gives the integral group-algebra identity κt=∑z∈Zsgn⁡(z)z(1−τ); since τ∈Rs fixes the tabloid {s} by [F3], applying this to {s} gives κt{s}=∑z∈Zsgn⁡(z)(z{s}−zτ{s})=0. This is an identity between integral vectors, so it holds in MZμ and hence over F: the collision criterion of [F4] is field-independent.

2.1givenF3F5step 1.1step 1.2algebra

Suppose κt{s}≠0 for a μ-tabloid {s}. Then step 1.2 shows no row of {s} contains two entries from one column of t, i.e. every row of a representing tableau meets every column of t in at most one entry; by [F5] this gives λ⊵μ, and when λ=μ it gives ρ∈Rs, γ∈Ct with ρ⋅s=γ⋅t. In the equal-shape case κt{s}=κt{ρ⋅s}=κtγ⋅{t}=sgn⁡(γ)κt{t}=sgn⁡(γ)et by step 1.1.

3.1givenF1F2step 2.1algebra

Every element of MFλ is an F-combination of λ-tabloids, and by step 2.1 each κt{s} is either 0 or ±et; hence κtMFλ⊆Fet. Since et=κt{t}≠0 lies in the image, κtMFλ=Fet, as asserted.

3.2givenF1F6step 2.1

If κtMFμ≠0, some μ-tabloid {s} satisfies κt{s}≠0, so step 2.1 gives λ⊵μ in the order of [F6].

4.1givenF2F5F7step 3.1step 3.2∎

Over C the conclusions of steps 3.1 and 3.2 are exactly the published statements [F7]; the present proof rederives them over an arbitrary field from the integral collision identity of step 1.2 and the combinatorial lemma [F5], both of which involve only coefficients 0,±1, so the argument applies in characteristic two. For n=0 the empty tableau has κt=1 and et={∅}≠0, the only partition is ∅ with ∅⊵∅, and the three displayed claims hold.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02Open item page →

James submodule theorem over every field

Statement

Let F be a field, n≥0, and λ⊢n. Let MFλ=F⊗ZMZλ,SFλ⊆MFλ,et=∑γ∈Ctsgn⁡(γ){γt} be the field-valued tabloid module, the span of the field-valued polytabloids inside it, and the field-valued polytabloid of a λ-tableau t, with the Sn-invariant symmetric bilinear form βF whose tabloid basis is orthonormal (Integral Specht lattice and base change, Integral tabloid form and Specht Gram matrix). For a subspace V⊆MFλ put V⊥={x∈MFλ:βF(x,v)=0 for all v∈V}, and put RFλ:=SFλ∩(SFλ)⊥,DFλ:=SFλ/RFλ, the field-level form radical and quotient of Modular Specht form and radical quotient. The dual of a finite-dimensional F[Sn]-module D is D∗=Hom⁡F(D,F) with (σ⋅f)(v):=f(σ−1v); D is self-dual when D≅D∗.

James submodule theorem. For every F[Sn]-submodule U≤MFλ, either SFλ≤U or U≤(SFλ)⊥.

Consequences. DFλ is zero or absolutely irreducible, and in either case it is self-dual; here absolutely irreducible means that E⊗FDFλ is an irreducible E[Sn]-module for every field extension E/F. If DFλ≠0, then RFλ is the unique maximal submodule of SFλ, equals the module radical rad⁡(SFλ), and DFλ is the simple head of SFλ. No step uses positivity, averaging or division by a group order, and the statements include characteristic two and n=0.

Facts & Assumptions

Given: A field F, an integer n≥0, a partition λ⊢n, and the definitions above.

[F1]

For every commutative ring R the natural map R⊗ZSZλ→MRλ is injective onto the polytabloid span SRλ, with the images of the standard polytabloids as a basis; each et has tabloid coefficients in {0,1,−1} and coefficient 1 at {t}, so et≠0 (Integral Specht lattice and base change).

[F2]

βR is the unique R-bilinear form on MRλ with orthonormal tabloid basis; it is symmetric, nondegenerate and Sn-invariant, every κt is self-adjoint for it, and its matrix in the standard basis of SRλ is the scalar extension of the integer Gram matrix Gλ=(β(esi,esj)) (Integral tabloid form and Specht Gram matrix).

[F3]

For every field E one has κtMEλ=Eet with et≠0 (Field antisymmetrizers have rank-one own-shape image and detect dominance).

[F4]

eσ⋅t=σ⋅et for every σ∈Sn; every λ-tableau is σ⋅t for some σ, so SFλ=F[Sn]et for every λ-tableau t (Polytabloid covariance and the column sign rule).

[F5]

For a splitting field k the form radical Rλ=Skλ∩(Skλ)⊥ and the quotient Dλ=Skλ/Rλ, possibly zero, are the objects of Modular Specht form and radical quotient; the same formulas define RFλ and DFλ over an arbitrary field F.

[F6]

For a finite-dimensional algebra A and a finite-dimensional left A-module M, the module radical satisfies rad⁡(M)=J(A)M and equals the intersection of the maximal submodules of M, and the head is hd⁡(M)=M/rad⁡(M) (The radical, socle, head, and Loewy series of a finite-dimensional module).

[F7]

Rank-nullity holds for linear maps between finite-dimensional vector spaces, and the rank of a matrix equals the rank of the linear map it defines (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T, The rank of a matrix equals the rank of the linear map x↦Ax).

Proof

technique · direct
1.1givenF1F2F3F4algebra

Let U≤MFλ be an F[Sn]-submodule. If κtU≠0 for some λ-tableau t, then κtU is a nonzero subspace of κtMFλ=Fet by [F3], hence κtU=Fet and et=κtu∈U for some u∈U; since SFλ=F[Sn]et by [F4] and U is a submodule, SFλ≤U. If instead κtU=0 for every λ-tableau t, then for every u∈U and every t, using κt{t}=et and the self-adjointness of κt from [F2], βF(u,et)=βF(u,κt{t})=βF(κtu,{t})=0, so u is orthogonal to every polytabloid and U≤(SFλ)⊥. In either case one of the two alternatives of the James submodule theorem holds.

1.2givenF1F2F5F7algebra

Over the arbitrary field F put RFλ:=SFλ∩(SFλ)⊥ and DFλ:=SFλ/RFλ, the same formulas as in the modular definition [F5]. Let φ:SFλ→(SFλ)∗ be φ(v)=βF(v,⋅)∣SFλ. Its kernel is SFλ∩(SFλ)⊥=RFλ, because βF(v,s)=0 for all s∈SFλ says exactly that v∈(SFλ)⊥ when v∈SFλ; in the standard basis of SFλ paired with its dual basis the matrix of φ is the Gram matrix GF of βF, by [F2] and [F1]. Hence by [F7] the rank of φ equals rank⁡FGF and rank-nullity gives dim⁡FSFλ=rank⁡FGF+dim⁡FRFλ,dim⁡FDFλ=rank⁡FGF. In particular DFλ=0 exactly when every entry of the Gram matrix vanishes in F.

1.3givenF1F2algebra

Let E/F be a field extension. By [F1] applied over the commutative rings F and E, the identifications MEλ≅E⊗ZMZλ and MFλ≅F⊗ZMZλ give E⊗FMFλ≅MEλ, and likewise E⊗FSFλ≅SEλ with standard bases matched; by [F2] the form βE is the scalar extension of βF. For r∈RFλ and s∈SFλ one has βF(r,s)=0, hence βE(1⊗r,1⊗s)=1⊗βF(r,s)=0, and since E⊗FRFλ⊆E⊗FSFλ=SEλ this gives E⊗FRFλ⊆(SEλ)⊥∩SEλ=REλ. Therefore the natural map E⊗FDFλ=E⊗F(SFλ/RFλ)⟶SEλ/(E⊗FRFλ)⟶DEλ is a surjection of finite-dimensional E-vector spaces.

2.1givenF2step 1.1algebra

Let N≤SFλ be an F[Sn]-submodule. Applying step 1.1 to N viewed as a submodule of MFλ gives SFλ≤N or N≤(SFλ)⊥, and in the second case N≤(SFλ)⊥∩SFλ=RFλ. Hence every proper submodule of SFλ is contained in RFλ. Moreover RFλ is itself an F[Sn]-submodule: if x∈(SFλ)⊥, v∈SFλ and σ∈Sn, then invariance in [F2] gives βF(σx,v)=βF(x,σ−1v)=0 because σ−1v∈SFλ, so (SFλ)⊥ is a submodule, and RFλ is the intersection of two submodules.

2.2givenstep 1.2step 1.3algebra

By step 1.2 applied over F and over E, dim⁡FDFλ=rank⁡FGF and dim⁡EDEλ=rank⁡EGE. The rank of the integer matrix Gλ over a field is the largest m for which some m×m minor has nonzero image in that field; a minor is an integer, its image vanishes over F if and only if it vanishes over E, and F and E have the same characteristic, so rank⁡FGF=rank⁡EGE. Since dim⁡E(E⊗FDFλ)=dim⁡FDFλ, the surjection of step 1.3 is an isomorphism DEλ≅E⊗FDFλ.

2.3givenF2step 1.2algebra

Define β‾:DFλ×DFλ→F by β‾(x+RFλ,y+RFλ)=βF(x,y). This is well defined: replacing x by x+r and y by y+s with r,s∈RFλ⊆(SFλ)⊥ changes the value by βF(r,y)+βF(x,s)+βF(r,s)=0. The form β‾ is symmetric and Sn-invariant, inherited from βF by [F2], and it is nondegenerate: if β‾(x+RFλ,y+RFλ)=0 for all y∈SFλ, then x∈(SFλ)⊥∩SFλ=RFλ. Hence the F-linear map φ‾:DFλ→(DFλ)∗, φ‾(ξ)=β‾(ξ,⋅), is injective; since dim⁡FDFλ=dim⁡F(DFλ)∗ by step 1.2, it is an isomorphism of vector spaces, and for σ∈Sn and η∈DFλ, φ‾(σξ)(η)=β‾(σξ,η)=β‾(ξ,σ−1η)=(σ⋅φ‾(ξ))(η), so φ‾ is F[Sn]-linear and DFλ≅(DFλ)∗; this includes the case DFλ=0, where both sides are zero.

3.1givenF6step 2.1algebra

Suppose DFλ≠0, so RFλ≠SFλ. By step 2.1 every proper submodule of SFλ lies in RFλ, while RFλ is itself a proper submodule by assumption; hence RFλ contains every proper submodule and is therefore the unique maximal submodule of SFλ. By [F6] the module radical equals the intersection of the maximal submodules, so rad⁡(SFλ)=RFλ; in particular DFλ=SFλ/rad⁡(SFλ) is the head of SFλ. If W≤DFλ is a submodule and N≤SFλ is its preimage, then RFλ≤N and either N=SFλ, giving W=DFλ, or N is proper, in which case N≤RFλ by step 2.1 and hence N=RFλ, giving W=0; thus DFλ is simple.

4.1givenF2F3step 1.1step 2.1step 2.2step 3.1algebra

Let E/F be a field extension and suppose DFλ≠0. By step 2.2, DEλ≅E⊗FDFλ is nonzero. The arguments of steps 1.1, 2.1 and 3.1 apply verbatim with F replaced by the field E: [F3] holds over every field, [F2] holds over every commutative ring, and the alternative of step 1.1 and its consequence step 2.1 use only those facts, so REλ is the unique maximal submodule of SEλ and DEλ is simple. As E/F was arbitrary, DFλ is absolutely irreducible.

5.1givenstep 1.1step 2.3step 3.1step 4.1∎

Step 1.1 is the James submodule theorem. If DFλ=0 then the consequences are vacuous, and DFλ=0≅(DFλ)∗ is self-dual; if DFλ≠0, then step 3.1 gives the unique maximal submodule, the identification RFλ=rad⁡(SFλ) and the simple head, step 2.3 gives self-duality, and step 4.1 gives absolute irreducibility. For n=0 and λ=∅ there is one tabloid and one polytabloid with βF(e,e)=1 and Ct={1}, so RFλ=0, DFλ≅F is the trivial module, simple and absolutely irreducible, and all assertions hold; the argument above never divides by a group order or uses positivity.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-02Open item page →

p-regular and p-restricted partitions

Definition

Let p be a prime and let λ⊢n be a partition of n≥0 with parts λ1≥λ2≥⋯≥λk≥1 and conjugate partition λ′, whose j-th part is the number λj′=#{i:λi≥j} of nodes of [λ] in column j (Partitions, English diagrams, and conjugation). For j≥1 let zj(λ):=#{ i:λi=j } be the multiplicity with which the positive integer j occurs as a part of λ; only finitely many zj are nonzero.

  • λ is p-regular when every positive part of λ occurs fewer than p times, that is, when zj(λ)<p for every j≥1.
  • λ is p-restricted when λi−λi+1<p for every i≥1, where the sequence is padded by the trailing zeros λi:=0 for i>k.

Both conditions are finite families of inequalities. For i>k one has λi−λi+1=0<p, so the restrictedness condition is the finite list for 1≤i≤k. The empty partition ∅⊢0 has no parts and k=0, so zj(∅)=0<p and 0−0=0<p for every j,i≥1: it is simultaneously p-regular and p-restricted for every prime p.

The two conditions are exchanged by conjugation: λ is p-restricted if and only if λ′ is p-regular. The number of columns of [λ] of height exactly i is the difference λi−λi+1 of consecutive parts, and these heights are precisely the parts of λ′, so the multiplicity of the part i in λ′ is λi−λi+1; the stated equivalence compares the same integers with p.

The names record two genuinely different label conventions used later on this page: James's modular simple modules Dλ are labelled by p-regular λ. Dual Specht modules themselves are defined for every partition; their simple heads give the p-restricted labelling of simple modules, related to the first convention by transposition and a sign twist. Neither class of partitions contains the other in general.

Facts & Assumptions

Given: A prime p and a partition λ⊢n with k parts and conjugate λ′.

[F1]

A partition of n is a finite weakly decreasing sequence λ=(λ1,…,λk) of positive integers with sum n; trailing zeros are not parts. Its conjugate has parts λj′=#{i:λi≥j} and is again a partition of n (Partitions, English diagrams, and conjugation).

[F2]

Column j of [λ] carries exactly λj′ nodes, and row i carries exactly λi nodes (Partitions, English diagrams, and conjugation).

Proof

technique · direct
1.1givenF1F2algebra

Since the parts of λ are weakly decreasing, the rows of length at least i are exactly the first λi′ rows, so the rows of length exactly i are rows λi+1′+1,…,λi′ and there are λi′−λi+1′ of them.

1.2givenF1F2algebra

Equivalently, the columns of height exactly i number λi−λi+1: column j has height #{r:λr≥j}, which is at least i exactly when j≤λi, so the columns of height at least i are columns 1,…,λi and those of height exactly i number λi−λi+1.

2.1givenF1step 1.2algebra

By [F1] the parts of λ′ are the column heights of [λ], so the multiplicity of the part i in λ′ is the number of columns of height exactly i, namely λi−λi+1 by step 1.2. Hence λ′ is p-regular if and only if λi−λi+1<p for every i≥1, which is exactly the statement that λ is p-restricted.

2.2givenF1step 1.1step 1.2

The conjugation statement includes n=0: for λ=∅ the conjugate is ∅ by [F1], both defining conditions are the empty family of inequalities, and steps 1.1-1.2 give λi−λi+1=0 for every i.

3.1givenF1step 1.2step 2.1∎

Taking i>k in the definition gives λi−λi+1=0<p, so the restrictedness condition is finite and the displayed equivalence of step 2.1 is a comparison of the same integers zi(λ′)=λi−λi+1 with p; this proves the asserted conjugation statement.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Specht Gram gcd detects p-regularity

Statement

Let n≥0, let λ⊢n, and for j≥1 let zj:=#{ i:λi=j } be the number of rows of the Young diagram [λ] of length j; only finitely many zj are nonzero (p-regular and p-restricted partitions). Put Lλ:=∏j≥1zj!,Uλ:=∏j≥1(zj!)j, finite products in which the factors 0!=1!=1 contribute nothing. Let et be the integral polytabloid of a λ-tableau t, so that et=∑γ∈Ctsgn⁡(γ) {γ⋅t} and let β be the integral tabloid form, for which the tabloids form an orthonormal Z-basis (Integral Specht lattice and base change, Integral tabloid form and Specht Gram matrix). Let gλ:=gcd⁡{ β(es,et):s,t are λ-tableaux } be the positive greatest common divisor of all integral pairings of integral polytabloids. Then:

  1. Factorial bounds. Lλ divides gλ, and gλ divides Uλ.
  2. Standard-basis form. gλ is also the greatest common divisor of the entries of the integral Gram matrix Gλ in the standard-polytabloid basis.
  3. Prime criterion. For every prime p, the reduction of gλ modulo p is nonzero if and only if λ is p-regular, that is, if and only if zj<p for every j≥1.
  4. Row reversal. For every λ-tableau t let t∗ be the λ-tableau obtained by reversing the order of the entries in each row of t, that is, t∗(i,c):=t(i,λi+1−c). Then β(et,et∗)=Uλ, and over every field F the scalar relation κt⋅et∗=Uλ et holds in the field-valued tabloid module MFλ.

For λ=∅ one has Lλ=Uλ=gλ=1; the verification of the empty case is step 6.1 below. No step uses the positive-definiteness of the Hermitian form, and no division by a group order is made.

Facts & Assumptions

Given: An integer n≥0, a partition λ⊢n, a prime p for assertion 3, and the definitions above.

[F1]

MZλ is the free Z-module on the λ-tabloids, Ct is the column stabilizer of t, and et=κt{t}=∑γ∈Ctsgn⁡(γ){γt}∈MZλ has all coefficients in {0,1,−1} with coefficient 1 at {t}; the standard polytabloids form a Z-basis of the integral Specht lattice SZλ, and every integral polytabloid is an integral linear combination of the standard ones (Integral Specht lattice and base change, Column antisymmetrizers, polytabloids, and Specht modules).

[F2]

β:MZλ×MZλ→Z is the unique Z-bilinear form with β(T,U)=δTU on tabloids, it is symmetric and nondegenerate, it satisfies β(σx,σy)=β(x,y) for all σ∈Sn, and every κt is self-adjoint for it, β(κtx,y)=β(x,κty); the Gram matrix Gλ of β restricted to SZλ in the standard basis has integer entries (Integral tabloid form and Specht Gram matrix).

[F3]

For every λ-tableau u the tabloid is {u}={ρ⋅u:ρ∈Ru}, its row sets are the sets {u(i,c):1≤c≤λi}, the tabloids form a basis of Mλ, and Sn acts on tabloids by σ⋅{u}={σ⋅u} (Young subgroups, tabloids, and permutation modules).

[F4]

Ct∩Rt={1} and the tabloids {γ⋅t} with γ∈Ct are pairwise distinct; the map γ↦{γ⋅t} from Ct to the tabloid set is therefore injective, and the coefficient of {γ⋅t} in et is sgn⁡(γ) (Column antisymmetrizers, polytabloids, and Specht modules).

[F5]

γ∈Ct if and only if γ⋅t is obtained from t by permuting the entries within each column, and Ct is the direct product of the symmetric groups on the pairwise disjoint column sets of t (Row and column stabilizers).

[F6]

λ is p-regular if and only if zj(λ)<p for every j≥1 (p-regular and p-restricted partitions).

[F7]

For every field F the rank-one image statement κtMFλ=Fet holds, with et≠0 (Field antisymmetrizers have rank-one own-shape image and detect dominance).

[F8]

A λ-tableau is a bijection from the set of cells of [λ] onto {1,…,n}, and column j of [λ] consists of the cells (i,j) with λi≥j (Tableaux and standard tableaux).

Proof

technique · direct
1.1givenF3F8algebra

For j≥1 let Pj:={i:λi=j} be the set of row indices of length j, and let Π:=∏j≥1Sym⁡(Pj) be the finite group of all permutations of the rows of [λ] that preserve each row length. For π=(πj)j∈Π and a tabloid T define T⋆π by rowi(T⋆π):=rowπj(i)(T)(i∈Pj). This is a right action of Π on tabloids: (T⋆π)⋆ρ=T⋆(πρ) under the convention (πρ)(i)=π(ρ(i)). It is free: if T⋆π=T, then rowπj(i)(T)=rowi(T) for all i, and distinct rows are disjoint nonempty sets, so πj(i)=i for all i. Therefore ∣Π∣=∏j≥1zj!=Lλ and every orbit has Lλ tabloids. Put sπ:=∏j≥1sgn⁡(πj)j.

1.2givenF4F5F8algebra

Fix a λ-tableau u and π∈Π. Define a permutation δπ∈Sn by δπ(u(i,c)):=u(πj(i),c)(i∈Pj, 1≤c≤j), which is well defined because the map (i,c)↦u(i,c) is a bijection from the cells of [λ] onto {1,…,n} by [F8] and because πj(i)∈Pj, so that the cell (πj(i),c) exists exactly when c≤j. For each column c of [λ] the values u(i,c) with λi≥c are permuted among themselves by δπ: indeed δπ permutes, for each j≥c, the set Ej,c:={u(i,c):i∈Pj} of the zj entries of column c lying in rows of length j, and these sets partition the c-th column. Hence δπ∈Cu by [F5]. Moreover sgn⁡(δπ)=∏j≥1sgn⁡(πj)j=sπ: the restriction of δπ to Ej,c corresponds to πj under the bijection i↦u(i,c), and the sets Ej,c over all pairs (j,c) with c≤j are pairwise disjoint, so the signs multiply. Finally δπ(rowi(u))=rowπj(i)(u) for i∈Pj, since δπ carries u(i,c) to u(πj(i),c) for every c≤λi=j.

1.3givenF1F2algebra

Every integral polytabloid is an integral linear combination of the standard polytabloids, by [F1]. Fix an ordering u1,…,ud of the standard λ-tableaux and write es=∑iaieui and et=∑jbjeuj with integers ai,bj and Gλ=(Gij)=(β(eui,euj)). Bilinearity of β gives β(es,et)=∑i,jaibjGij for every pair of tableaux s,t. Hence the greatest common divisor of the entries Gij divides every pairing β(es,et), while each Gij is itself one of the pairings appearing in the definition of gλ; the two finite gcds therefore coincide, and gλ is the gcd of the entries of the integral Gram matrix Gλ.

1.4givenF3F4F8algebra

Fix a tableau t and its row reversal t∗(i,c)=t(i,λi+1−c). Suppose T={γt}={δt∗} with γ∈Ct and δ∈Ct∗. A row of T of length m contains one entry from each of columns 1,…,m of t and one from each of columns 1,…,m of t∗. An entry originally in a row of length j and column c of t lies in column j+1−c of t∗. Take m maximal among the row lengths still under consideration. The entry of a length-m row of T in t-column m must come from an original length-m row and occupies t∗-column 1. Descending through t-columns c=m−1,…,1, assume the preceding entries occupy t∗-columns 1,…,m−c. An entry in t-column c from a shorter row has t∗-column j+1−c≤m−c, already occupied; thus it comes from a length-m row and occupies t∗-column m+1−c. All length-m rows of T therefore use only entries from original length-m rows, exhausting those entries. Remove these rows and repeat at the next largest length. Hence every row i of T contains only entries originally in rows of length λi. For x=t(i,c), both γ(x) and δ(x) belong to row i of T. The former lies in t-column c; the latter lies in t∗-column λi+1−c, which is t-column c among entries originally in rows of length λi. Since row i of T contains exactly one entry from that t-column, γ(x)=δ(x). Thus γ=δ. Conversely, if γ∈Ct∩Ct∗, the equal row sets of t and t∗ give {γt}={γt∗}. Consequently supp⁡(et)∩supp⁡(et∗)={{γt}:γ∈Ct∩Ct∗}, and [F4] makes the coefficient of each common tabloid sgn⁡(γ) in both polytabloids.

1.5givenF5F8algebra

We determine the intersection Ct∩Ct∗. First let γ∈Ct∩Ct∗ and let j≥1. For a value x=t(i,c) with λi=j, the value x lies in the t∗-column λi+1−c, so γ(x), being in Ct∗, lies in that same t∗-column; say γ(x)=t(i′′,λi′′+1−(λi+1−c))=t(i′′,c+λi′′−λi) for some i′′ with λi′′≥λi+1−c. On the other hand γ∈Ct means γ(x)=t(i′,c) for some row i′ by [F5]. Comparing the two descriptions cell by cell gives i′′=i′ and c+λi′′−λi=c, that is, λi′=λi=j. Therefore γ(x) lies in a row of length j for every x in a row of length j; since γ is bijective, γ(Rj)=Rj for every j, where Rj:=⋃i∈Pjrowi(t). Second, conversely, suppose γ∈Ct satisfies γ(Rj)=Rj for every j. Let c≥1 and let x=t(i,λi+1−c) be an entry of the t∗-column c, so λi≥c and x∈Rλi. Then γ(x)∈Rλi and γ∈Ct preserve the t-column of x, which is λi+1−c; hence γ(x)=t(i′,λi+1−c) with λi′=λi, that is, γ(x)=t(i′,λi′+1−c), an entry of the t∗-column c. Thus γ∈Ct∗. This proves Ct∩Ct∗={γ∈Ct:γ(Rj)=Rj for every j}.

2.1givenF1F4step 1.2algebra

Let u be a λ-tableau, γ∈Cu and π∈Π. By step 1.2, for i∈Pj, rowi(γ δπ⋅u)=γ(rowπj(i)(u))=rowπj(i)(γ⋅u)=rowi({γ⋅u}⋆π), so {γ⋅u}⋆π={γ δπ⋅u}. By [F4] the coefficient changes by sgn⁡(δπ)=sπ. Applying π−1 gives the converse for support. Thus, writing cu(T) for the coefficient of T in eu, cu(T⋆π)=sπcu(T)(T any tabloid, π∈Π), including when both coefficients vanish.

2.2givenF5F8step 1.5algebra

Such a γ is exactly a choice, for every pair (j,c) with c≤j, of an arbitrary permutation of the zj values Ej,c={t(i,c):i∈Pj} that column c of [λ] receives from the rows of length j, the choices for the finitely many pairs (j,c) being independent; these permutations determine γ and lie in Ct because the sets Ej,c partition the value sets of the columns, and they satisfy γ(Rj)=Rj and hence γ∈Ct∗ by step 1.5. Therefore ∣Ct∩Ct∗∣=∏j≥1 ∏c=1jzj!=∏j≥1(zj!)j=Uλ.

3.1givenF2step 1.1step 2.1algebra

Let C be a Π-orbit with base point T0. By step 1.1 the map π↦T0⋆π is a bijection Π→C, and by step 2.1, for any two polytabloids es,et, ∑T∈Ccs(T)ct(T)=∑π∈Πcs(T0⋆π)ct(T0⋆π)=∑π∈Πsπ2cs(T0)ct(T0)=Lλcs(T0)ct(T0). Summing over all orbits gives β(es,et)=LλNs,t for an integer Ns,t; hence Lλ∣gλ.

4.1givenF2step 3.1step 1.4step 2.2algebra

Combining steps 1.4 and 2.2, each of the Uλ common tabloids contributes sgn⁡(γ)2=1 to the pairing, so β(et,et∗)=Uλ. Since Uλ is one of the pairings whose positive gcd is gλ, the gcd divides it: gλ∣Uλ. With step 3.1 this gives Lλ∣gλ∣Uλ, assertions 1 and 2 of the statement.

5.1givenF6step 4.1algebra

Let p be a prime. A prime divides the factorial zj! if and only if zj≥p. Hence p∣Lλ if and only if zj≥p for some j, and the same equivalence holds for the product Uλ=∏j(zj!)j; the two products therefore have the same prime divisors. By step 4.1, p∣gλ if and only if p∣Lλ, that is, if and only if zj≥p for some j; by [F6] this is exactly the failure of p-regularity of λ. Therefore gλ is nonzero modulo p if and only if λ is p-regular, assertion 3.

5.2givenF2F4F7step 4.1algebra

It remains to verify the field relation of assertion 4. Let F be a field and let MFλ be the field-valued tabloid module, with βF the scalar extension of β and with the same symbols κt,et. By [F7] the image of κt on MFλ is the line Fet, so κt⋅et∗=h et for a unique h∈F. Using [F2], the normalization βF(et,{t})=1 (the coefficient of {t} in et is 1 by [F4]), and κt{t}=et, we compute h=h βF(et,{t})=βF(het,{t})=βF(κtet∗,{t})=βF(et∗,κt{t})=βF(et∗,et)=Uλ⋅1F, where the last equality is the base change of the integral identity of step 4.1. Hence κt⋅et∗=Uλet in MFλ, over every field and in particular in every prime characteristic, with no division by a group order.

6.1givenF1F2F6step 4.1step 5.1algebra∎

Finally take λ=∅ and n=0. There is exactly one tabloid, exactly one tableau, and Ct={1}, so et is the unique basis vector and β(et,et)=1; the products L∅ and U∅ are empty products equal to 1, and the empty partition is p-regular for every prime p by [F6]. Thus L∅=U∅=g∅=1 and all four assertions hold in this case.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Nonzero modular Specht quotient criterion

Statement

Let p be a prime, let n≥0 and λ⊢n, and let F be a field of characteristic p. Let βF be the reduced integral tabloid form on MFλ=F⊗ZMZλ, with orthonormal tabloid basis, and let SFλ⊆MFλ,RFλ:=SFλ∩(SFλ)⊥,DFλ:=SFλ/RFλ, where V⊥={x∈MFλ:βF(x,v)=0 for all v∈V} (Integral tabloid form and Specht Gram matrix, James submodule theorem over every field). Let Gλ be the Gram matrix of the integral tabloid form in the standard-polytabloid basis of the integral Specht lattice SZλ, and let gλ be the positive greatest common divisor of its entries (Integral Specht lattice and base change, Specht Gram gcd detects p-regularity). Write Gλ mod p for the entrywise image of Gλ in F, a matrix with entries in F. Then:

  1. Vanishing criterion. DFλ=0  ⟺  p∣Gij for all i,j  ⟺  p∣gλ  ⟺  λ is not p-regular, and equivalently DFλ≠0 if and only if zj(λ)<p for every j≥1, where zj(λ) is the number of parts of λ equal to j.
  2. Dimension. dim⁡FDFλ=rank⁡F(Gλ mod p); this dimension is determined by λ and p alone, and it is positive exactly when λ is p-regular.
  3. Structure when nonzero. If λ is p-regular, then DFλ≠0 is the simple, self-dual and absolutely irreducible head of SFλ, and RFλ is the unique maximal submodule of SFλ, equal to the module radical rad⁡(SFλ).

For the k of a splitting p-modular system (K,O,k) for Sn, Dkλ is the modular Specht quotient Dλ of Modular Specht form and radical quotient, so the criterion above decides for which λ that quotient vanishes. No simplicity of SFλ itself is asserted.

Facts & Assumptions

Given: A prime p, an integer n≥0, a partition λ⊢n, a field F of characteristic p, and the objects above.

[F1]

For every commutative ring R the base change MRλ=R⊗ZMZλ has the λ-tabloids as R-basis, and SRλ=R⊗ZSZλ⊆MRλ is the span of the polytabloids et=∑γ∈Ctsgn⁡(γ){γt}, with the standard polytabloids as R-basis; each et has tabloid coefficients in {0,1,−1} and coefficient 1 at {t}, so et≠0 (Integral Specht lattice and base change, Young subgroups, tabloids, and permutation modules, Column antisymmetrizers, polytabloids, and Specht modules).

[F2]

βR is the unique R-bilinear form on MRλ for which the tabloids form an orthonormal basis; it is symmetric, nondegenerate and Sn-invariant, every κt is self-adjoint for it, and its matrix in the standard basis of SRλ is the scalar extension of the integer Gram matrix Gλ=(β(esi,esj)) (Integral tabloid form and Specht Gram matrix).

[F3]

For the k of a splitting p-modular system (K,O,k) one has Rλ=Skλ∩(Skλ)⊥ and Dλ=Skλ/Rλ, and dim⁡kDλ=rank⁡k(Gλ mod p) (Modular Specht form and radical quotient, A splitting p-modular system for a finite group is a p-modular system whose fraction and residue fields split the needed group algebras).

[F4]

gλ, the positive gcd of all integral pairings β(es,et) of polytabloids, is also the gcd of the entries of Gλ, and for every prime p one has p∤gλ if and only if λ is p-regular (Specht Gram gcd detects p-regularity).

[F5]

James submodule theorem over every field. For every F[Sn]-submodule U≤MFλ, either SFλ≤U or U≤(SFλ)⊥. Consequently DFλ is zero, or absolutely irreducible and self-dual; and if DFλ≠0, then RFλ is the unique maximal submodule of SFλ, equals the module radical rad⁡(SFλ), and DFλ is the simple head of SFλ (James submodule theorem over every field, The radical, socle, head, and Loewy series of a finite-dimensional module).

[F6]

λ is p-regular if and only if zj(λ)<p for every j≥1 (p-regular and p-restricted partitions).

[F7]

Rank-nullity holds for linear maps between finite-dimensional vector spaces, and the rank of a matrix equals the rank of the linear map it defines (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T, The rank of a matrix equals the rank of the linear map x↦Ax).

Proof

technique · direct
1.1givenF1F2F7

The map φ:SFλ→(SFλ)∗, φ(v)=βF(v,⋅)∣SFλ, is F-linear, and its kernel is exactly RFλ: an element v∈SFλ lies in the kernel if and only if βF(v,s)=0 for all s∈SFλ, that is, if and only if v∈(SFλ)⊥. If (es1,…,esm) is the standard basis of SFλ and (es1∗,…,esm∗) is its dual basis of (SFλ)∗, then the matrix of φ in these bases is (φ(esi)(esj))i,j=(βF(esi,esj))i,j, which is the entrywise image in F of the integer matrix Gλ by [F2]. Hence rank⁡φ=rank⁡F(Gλ mod p) by [F7], and rank-nullity of φ gives dim⁡FDFλ=dim⁡FSFλ−dim⁡FRFλ=rank⁡F(Gλ mod p).

1.2givenF4algebra

A prime p divides the gcd gλ of the entries Gij of Gλ if and only if p divides every entry Gij; by [F4] this gcd is the same as the gcd of all integral pairings β(es,et) of polytabloids. In particular, over F, the condition p∣gλ is equivalent to the matrix Gλ mod p being the zero matrix.

1.3givenF4F6

By [F4] and [F6], p∣gλ if and only if λ is not p-regular, that is, if and only if zj(λ)≥p for some j≥1.

2.1givenstep 1.1step 1.2algebra

By step 1.1, DFλ=0 if and only if rank⁡F(Gλ mod p)=0, which happens exactly when Gλ mod p is the zero matrix; by step 1.2 this is equivalent to p∣gλ, and hence to p dividing every entry of Gλ.

3.1givenF5step 2.1step 1.3

Combining steps 2.1 and 1.3 gives the equivalences of assertion 1: DFλ=0 exactly when p divides every entry of Gλ, exactly when p∣gλ, exactly when λ is not p-regular, and equivalently DFλ≠0 exactly when λ is p-regular. If λ is p-regular, then DFλ≠0 by this equivalence, and [F5] applies in its nonzero case: DFλ is self-dual and absolutely irreducible, RFλ is the unique maximal submodule of SFλ and equals rad⁡(SFλ), and DFλ is the simple head of SFλ. This is assertion 3.

4.1givenF3step 1.1step 3.1algebra

For assertion 2, step 1.1 gives dim⁡FDFλ=rank⁡F(Gλ mod p) for every field F of characteristic p; by step 3.1 this dimension is positive exactly when λ is p-regular. The rank of the integer matrix Gλ over F is the largest r for which some r×r minor of Gλ has nonzero image in F; a minor is an integer and its image in F is nonzero exactly when p does not divide it, so this integer r depends only on λ and p and not on the particular field F of characteristic p. This common value is the p-rank of the Gram matrix. For the k of a splitting p-modular system, [F3] exhibits the same value as dim⁡kDλ, so the statement over a general field specializes to the modular Specht quotient of the definition.

5.1givenF1F2F5F6step 3.1step 4.1∎

Assertions 1 and 2 are steps 3.1 and 4.1, and the structural part of assertion 3 is the second half of step 3.1; the structure statement is invoked only in the nonzero case, to which [F5] applies, and no simplicity of SFλ is claimed. For n=0 and λ=∅ there is exactly one tabloid and one polytabloid et with Ct={1} and βF(et,et)=1, so G∅=(1), g∅=1, RF∅=0 and DF∅≅F has dimension 1=rank⁡F(G∅ mod p); the empty partition is p-regular for every prime p by [F6], so it is covered by the nonzero case and the criterion holds. No step divides by p or by a group order, and no positivity or averaging is used, so characteristic 2 is included without special treatment.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Nonzero maps into tabloid quotients force dominance

Statement

Let p be a prime, let F be a field of characteristic p, let n≥0, and let λ,μ⊢n with λ p-regular. Let MFμ=F⊗ZMZμ,SFμ⊆MFμ,RFμ=SFμ∩(SFμ)⊥,DFμ=SFμ/RFμ be the field-valued tabloid module with its orthonormal form βF, the field-valued Specht span, the form radical of its restriction and the quotient (Integral tabloid form and Specht Gram matrix, Nonzero modular Specht quotient criterion), and let U≤MFμ be an F[Sn]-submodule. Then:

  1. Dominance. Every nonzero F[Sn]-homomorphism φ:SFλ→MFμ/U satisfies λ⊵μ.
  2. Equality case. If λ=μ, then the image of such a nonzero φ is exactly the image (SFμ+U)/U of SFμ in MFμ/U; in particular U does not contain SFμ.
  3. Quotient form. Statements 1 and 2 remain true with SFλ replaced by DFλ: every nonzero F[Sn]-homomorphism ψ:DFλ→MFμ/U satisfies λ⊵μ, and if λ=μ then its image is (SFμ+U)/U and U⊉SFμ.
  4. Separation. If λ and μ are both p-regular and DFλ≅DFμ as F[Sn]-modules, then λ=μ. More generally, if λ is p-regular and DFλ≅DFμ, then μ is p-regular and μ=λ.

No simplicity of SFλ or SFμ is assumed or claimed, the case U=0 (no submodule divided out) is included, and n=0 and characteristic 2 need no separate treatment. No step averages over a group, divides by a group order, or uses positivity of any form.

Facts & Assumptions

Given: A prime p, a field F of characteristic p, an integer n≥0, partitions λ,μ⊢n with λ p-regular, and the objects above.

[F1]

λ is p-regular if and only if zj(λ)<p for every j≥1, where zj(λ)=#{i:λi=j} (p-regular and p-restricted partitions).

[F2]

With Lλ=∏j≥1zj! and Uλ=∏j≥1(zj!)j one has Lλ∣gλ∣Uλ, where gλ is the positive gcd of the integral pairings of polytabloids, and the reduction of gλ modulo p is nonzero exactly when λ is p-regular. Moreover, for a λ-tableau t with row reversal t∗, over every field the polytabloid relation κt et∗=Uλ et holds (Specht Gram gcd detects p-regularity).

[F3]

For every λ-tableau t the polytabloid et=κt{t} is nonzero with tabloid coefficients in {0,1,−1}, eσ⋅t=σ⋅et for every σ∈Sn, and every λ-tableau is σ⋅t for some σ; hence SFλ=F[Sn]et (Integral Specht lattice and base change, Polytabloid covariance and the column sign rule, Young subgroups, tabloids, and permutation modules, Column antisymmetrizers, polytabloids, and Specht modules).

[F4]

For every field F, κtMFλ=Fet≠0 for a λ-tableau t; and if μ⊢n satisfies κtMFμ≠0, then λ⊵μ (Field antisymmetrizers have rank-one own-shape image and detect dominance).

[F5]

DFλ=SFλ/RFλ with RFλ=SFλ∩(SFλ)⊥; if ν⊢n is p-regular then DFν≠0 is the simple head of SFν, while if ν is not p-regular then DFν=0 (Nonzero modular Specht quotient criterion, Modular Specht form and radical quotient, The radical, socle, head, and Loewy series of a finite-dimensional module).

[F6]

⊵ is a partial order on the partitions of n: it is reflexive, transitive and antisymmetric (Dominance order on partitions).

[F7]

βF is symmetric, nondegenerate and Sn-invariant, so that βF(σx,σy)=βF(x,y) for all x,y∈MFμ and σ∈Sn, and SFμ⊆MFμ is an F[Sn]-submodule (Integral tabloid form and Specht Gram matrix, Integral Specht lattice and base change).

Proof

technique · direct
1.1givenF1F2algebra

Since Lλ and Uλ are products of the same factorials zj! (in different multiplicities), a prime divides Lλ if and only if it divides Uλ. As λ is p-regular, [F1] and [F2] give p∤gλ, hence p∤Lλ; if p∣Uλ then p∣Lλ by the first observation, a contradiction. Therefore Uλ has nonzero image in F. In particular, for every λ-tableau t the relation κtet∗=Uλet of [F2] has Uλ≠0 in F.

1.2givenF3algebra

Let N be an F[Sn]-module and φ:SFλ→N an F[Sn]-homomorphism with φ(et)=0 for one λ-tableau t. By [F3] every λ-polytabloid is σ⋅et for some σ∈Sn, so φ(σ⋅et)=σ⋅φ(et)=0 for all σ; since the polytabloids span SFλ, φ=0. Hence a nonzero φ satisfies φ(es)≠0 for every λ-tableau s.

1.3givenF7algebra

For every partition ν⊢n the space (SFν)⊥ is an F[Sn]-submodule of MFν: if x∈(SFν)⊥, σ∈Sn and s∈SFν, then βF(σx,s)=βF(x,σ−1s)=0 because σ−1s∈SFν by [F7].

2.1givenF2F4step 1.1step 1.2algebra

Let φ:SFλ→MFμ/U be a nonzero F[Sn]-homomorphism, and put v:=φ(et∗)∈MFμ/U for a λ-tableau t. Using [F2], the F[Sn]-linearity of φ and steps 1.1-1.2, κt v=κtφ(et∗)=φ(κtet∗)=φ(Uλet)=Uλφ(et)≠0. Choose w∈MFμ with v=w+U. Then κtw+U=κtv≠0, so κtw≠0 and hence κtMFμ≠0; by [F4] this forces λ⊵μ. This is assertion 1.

3.1givenF3F4step 1.1step 2.1algebra

Suppose now that λ=μ and let φ,v,w be as in step 2.1, so κtw≠0 by that step. By [F4] one has κtMFλ=Fet, so κtw=cet for a unique c∈F, and c≠0 because κtw≠0. From Uλφ(et)=κtv=κtw+U=cet+U and step 1.1 we get φ(et)=cUλ et+U=cUλ (et+U), a nonzero multiple of et+U in MFλ/U; hence et+U∈Im⁡φ. Since Im⁡φ is an F[Sn]-submodule and SFλ=F[Sn]et by [F3], this gives (SFλ+U)/U=F[Sn](et+U)⊆Im⁡φ. Conversely, every x∈SFλ is a finite sum x=∑σaσ σet with aσ∈F, and then φ(x)=∑σaσ σφ(et)=∑σaσ σ(cUλ(et+U))=cUλ (x+U)∈(SFλ+U)/U, so Im⁡φ⊆(SFλ+U)/U. Therefore Im⁡φ=(SFμ+U)/U, which is nonzero because φ≠0, and consequently U does not contain SFμ. This is assertion 2.

4.1givenstep 2.1step 3.1algebra

Let ψ:DFλ→MFμ/U be a nonzero F[Sn]-homomorphism and let π:SFλ↠DFλ be the quotient map. Then φ:=ψ∘π:SFλ→MFμ/U is nonzero, so steps 2.1 and 3.1 apply to φ and give λ⊵μ; if λ=μ, they give Im⁡ψ=Im⁡φ=(SFμ+U)/U, which is nonzero, so U⊉SFμ. This is assertion 3.

5.1givenF5F6step 1.3step 4.1algebra

Suppose λ and μ are both p-regular and let θ:DFλ→DFμ be an F[Sn]-isomorphism. Put U:=(SFμ)⊥, a submodule of MFμ by step 1.3. The natural map j:SFμ→MFμ/U has kernel SFμ∩(SFμ)⊥=RFμ, so it induces an injective F[Sn]-homomorphism ι:DFμ↪MFμ/U. Hence ι∘θ:DFλ→MFμ/U is nonzero and step 4.1 gives λ⊵μ. By symmetry, with U′:=(SFλ)⊥ let ι′:DFλ↪MFλ/U′ be the corresponding injection of step 1.3; then ι′∘θ−1:DFμ→MFλ/U′ is nonzero, and step 4.1 with the roles of λ and μ exchanged (both are p-regular) gives μ⊵λ. Antisymmetry of the dominance order [F6] yields λ=μ. This is assertion 4 in the case that both labels are p-regular.

6.1givenF5F6step 1.1step 1.2step 1.3step 2.1step 3.1step 4.1step 5.1∎

Steps 1.1-1.3, 2.1, 3.1, 4.1 and 5.1 prove assertions 1-4. For the final sentence of assertion 4, if λ is p-regular, μ⊢n and DFλ≅DFμ, then DFλ≠0 by [F5], so DFμ≠0, hence μ is p-regular by [F5]; now step 5.1 gives μ=λ. The boundary cases are included: for n=0 one has λ=μ=∅, SF∅=MF∅ is one-dimensional, RF∅=0, DF∅≅F≠0, and MF∅/U is nonzero only for U=0, in which case assertion 1 is trivial and assertion 2 reads Im⁡φ=SF∅ for every nonzero φ; for U=0 the equality case says a nonzero SFλ→SFλ is surjective, and for U=MFμ the codomain is zero so no nonzero φ exists. Characteristic 2 is covered because at no point is the sign of a permutation used, and no step divides by a group order or averages over Sn.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Modular simple modules of the symmetric group

Statement

Let p be a prime, let n≥0, and let (K,O,k) be a splitting p-modular system for Sn, so that k is a splitting field of characteristic p for Sn and all its subgroups (A splitting p-modular system for a finite group is a p-modular system whose fraction and residue fields split the needed group algebras). For a partition λ⊢n let Skλ=k⊗ZSZλ,Rλ=Skλ∩(Skλ)⊥,Dλ=Skλ/Rλ be the modular Specht quotient of Modular Specht form and radical quotient, defined using the reduced integral tabloid form on Mkλ.

  1. Simple heads. If λ is p-regular, then Dλ≠0 is self-dual and absolutely irreducible, and it is the simple head of Skλ, whose unique maximal submodule is Rλ=rad⁡(Skλ). If λ is not p-regular, then Dλ=0.
  2. Pairwise inequivalent. If λ,μ⊢n are both p-regular and Dλ≅Dμ as k[Sn]-modules, then λ=μ.
  3. Complete set. Every simple k[Sn]-module is isomorphic to Dλ for exactly one p-regular partition λ⊢n. Equivalently, as λ ranges over the p-regular partitions of n, the modules Dλ form a complete set of representatives of the isomorphism classes of simple k[Sn]-modules; in particular the number of simple k[Sn]-modules equals the number of p-regular partitions of n.

No absolutely irreducible module outside the family {Dλ} is constructed, and the statement asserts nothing about fields that are not splitting fields for Sn. The proof uses no averaging and no division by a group order, and the case n=0 and characteristic 2 are included.

Facts & Assumptions

Given: A prime p, an integer n≥0, a splitting p-modular system (K,O,k) for Sn, and the objects above.

[F1]

λ⊢n is p-regular if and only if zj(λ)<p for every j≥1, where zj(λ) is the number of parts of λ equal to j (p-regular and p-restricted partitions).

[F2]

For every field F of characteristic p the form quotient DFλ=SFλ/RFλ of Modular Specht form and radical quotient satisfies: DFλ=0 if and only if λ is not p-regular; and if λ is p-regular then DFλ≠0 is self-dual and absolutely irreducible, RFλ is the unique maximal submodule of SFλ and equals rad⁡(SFλ), and DFλ is the simple head of SFλ (Nonzero modular Specht quotient criterion, The radical, socle, head, and Loewy series of a finite-dimensional module).

[F3]

If F has characteristic p, λ is p-regular, and DFλ≅DFμ for some μ⊢n, then μ is p-regular and μ=λ (Nonzero maps into tabloid quotients force dominance).

[F4]

An element σ∈Sn is p-regular, i.e. p∤∣σ∣, if and only if no cycle length in its disjoint-cycle decomposition is divisible by p (p-regular and p-singular elements, Support, fixed points, disjoint cycles, cycle length, disjoint-cycle decompositions, and cycle type).

[F5]

The order of a permutation is the least positive common multiple of its nontrivial cycle lengths, and 1 for the identity (The order of a permutation is the least positive common multiple of its nontrivial cycle lengths, with value 1 for the identity); as p is prime, p divides such a least common multiple if and only if it divides one of the cycle lengths.

[F6]

Conjugacy classes of Sn are in bijection with the tuples (c1,…,cn) of nonnegative integers with ∑k=1nkck=n, the class of σ corresponding to its cycle type ck=#{orbits of σ of size k} (The conjugacy classes of Sn are indexed by the tuples (c1,…,cn) with ∑kck=n, Support, fixed points, disjoint cycles, cycle length, disjoint-cycle decompositions, and cycle type).

[F7]

For a finite group G over a splitting field k of characteristic p, the number of isomorphism classes of simple kG-modules equals the number of p-regular conjugacy classes of G (The number of simple kG-modules equals the number of p-regular conjugacy classes).

Proof

technique · direct
1.1givenF2

Fix a partition λ⊢n. By [F2] applied to F=k: Dλ=0 if and only if λ is not p-regular, and if λ is p-regular then Dλ≠0 is self-dual and absolutely irreducible, Rλ=rad⁡(Skλ) is the unique maximal submodule of Skλ, and Dλ is the simple head of Skλ. This is assertion 1.

1.2givenF4F5F6

By [F4] and [F5], σ∈Sn is p-regular if and only if no cycle length of σ is divisible by p; in the cycle-type notation of [F6] this says ck(σ)=0 whenever p∣k.

1.3givenalgebra

We prove the generating-function identity ∏j≥1(1+xj+⋯+x(p−1)j)=∏p∤j(1−xj)−1 in the formal power series ring Z[ ⁣[x] ⁣], coefficient by coefficient. Fix N≥1 and use 1+xj+⋯+x(p−1)j=(1−xpj)(1−xj)−1 in Z[x]: ∏j=1N(1+xj+⋯+x(p−1)j)=(∏m≤pNp∣m(1−xm))(∏m≤N(1−xm))−1=∏N<m≤pNp∣m(1−xm)∏m≤Np∤m(1−xm)−1, because the factors (1−xm) with p∣m and m≤N occur in numerator and denominator and cancel. Every factor of the first product after the cancellation has exponent m>N, so the product is 1 modulo xN+1. Therefore the two sides of the displayed identity have equal coefficients of xn for every n: taking N≥n and reducing the finite truncations modulo xn+1 shows that any coefficient of xn is a finite sum of ±1's on both sides.

2.1givenF6step 1.2

By [F6] the map sending a conjugacy class to the cycle type of any representative is a bijection onto the tuples (c1,…,cn) with ∑kkck=n, and by step 1.2 a class is p-regular exactly when its tuple satisfies ck=0 for every k divisible by p. Such tuples are exactly the partitions of n all of whose parts are not divisible by p. Hence #{p-regular classes of Sn}=#{partitions of n into parts not divisible by p}.

2.2givenF1step 1.3algebra

The coefficient of xn in ∏j≥1(1+xj+⋯+x(p−1)j) is the number of tuples (ej)j≥1 with 0≤ej≤p−1 and ∑jjej=n; only j≤n can contribute, so this is a finite count, and such a tuple records exactly the partition of n in which the part j occurs ej<p times. Hence this coefficient is the number of p-regular partitions of n. The coefficient of xn in ∏p∤j(1−xj)−1 is likewise the number of partitions of n all of whose parts are not divisible by p. By step 1.3 the two coefficients are equal, so #{p-regular λ⊢n}=#{partitions of n into parts not divisible by p}.

2.3givenF3step 1.1

Every p-regular λ⊢n gives a nonzero simple module Dλ by step 1.1, and distinct p-regular partitions give non-isomorphic modules: if Dλ≅Dμ with λ,μ p-regular, then λ=μ by [F3] applied to F=k. Hence λ↦[Dλ] is an injection from the set of p-regular partitions of n into the set of isomorphism classes of simple k[Sn]-modules, and therefore the number of isomorphism classes of simple k[Sn]-modules is at least the number of p-regular partitions of n.

3.1givenF7step 2.1step 2.2

Combining steps 2.1 and 2.2 gives #{p-regular λ⊢n}=#{p-regular classes of Sn}, and by [F7] applied to the finite group Sn over its splitting field k this common number equals the number of isomorphism classes of simple k[Sn]-modules.

4.1givenstep 1.1step 2.3step 3.1

By step 3.1 the number of isomorphism classes of simple k[Sn]-modules equals the number of p-regular partitions of n, while step 2.3 exhibits an injection between the same two finite sets. An injection between finite sets of equal cardinality is a bijection, so every simple k[Sn]-module is isomorphic to Dλ for exactly one p-regular λ⊢n. Combined with the self-duality and absolute irreducibility of step 1.1, this is assertions 2 and 3.

5.1givenF1F7step 1.1step 1.2step 1.3step 2.1step 2.2step 2.3step 3.1step 4.1∎

Assertion 1 is step 1.1, assertion 2 is step 2.3, and assertion 3 is step 4.1; no part of the argument assumes more about k than that it is a splitting field of characteristic p for Sn and its subgroups. For n=0 there is exactly one partition, ∅, of 0, and it is p-regular by [F1]; S0 has one element, of order 1, so its unique class is p-regular and the counts 1=1=1 hold; D∅≅k is the one simple k[S0]-module. For p=2 the same count applies: the 2-regular partitions of n are those with distinct parts, the 2-regular classes of Sn are those with all cycle lengths odd, and both are counted by the same coefficient. All counting is coefficient-wise finite, and no step divides by p, by a group order, or averages over a group.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Dominance unitriangularity of the symmetric-group decomposition matrix

Statement

Let p be a prime, let n≥0, and let (K,O,k) be a splitting p-modular system for Sn with maximal ideal m⊆O. For λ⊢n put SOλ:=O⊗ZSZλ,SKλ:=K⊗ZSZλ,Skλ:=k⊗ZSZλ, so that SOλ is a stable O[Sn]-lattice in SKλ with reduction Skλ (Integral Specht lattice and base change, An OG-lattice is a finite free module over the valuation ring with G-action, and reduction modulo the maximal ideal produces a kG-module). For a p-regular μ⊢n let Dμ be the simple k[Sn]-module of Modular simple modules of the symmetric group, and put dλμ:=[Skλ:Dμ], the multiplicity of Dμ in a composition series of Skλ. By the definition of the decomposition map and its independence of the stable lattice, dλμ is the decomposition number of the ordinary irreducible SKλ with respect to Dμ (Decomposition map from ordinary to modular Grothendieck groups, Decomposition numbers and the decomposition matrix, The decomposition map is independent of the stable lattice). Then:

  1. Dominance bound. dλμ=0 unless the p-regular partition μ dominates λ; equivalently, every composition factor of Skλ is isomorphic to Dμ for some p-regular μ⊵λ.
  2. Diagonal. dλλ=1 for every p-regular λ⊢n; that is, Dλ occurs exactly once as a composition factor of Skλ.
  3. Lower unitriangular block. List the p-regular partitions of n in decreasing lexicographic order, put them first among the rows in that order, and use the same order for the columns. Then the square block (dλμ)λ,μ p-regular is lower unitriangular: dλμ=0 whenever μ is lexicographically strictly smaller than λ (so its column occurs to the right of the diagonal), and dλλ=1.

The result is a constraint on the decomposition matrix, not a formula for all of its entries. It uses no positivity of the modular form, no division by a group order and no averaging, and it includes n=0 and characteristic 2.

Facts & Assumptions

Given: A prime p, an integer n≥0, a splitting p-modular system (K,O,k) for Sn, and the objects above.

[F1]

For every commutative ring R the module SRλ=R⊗ZSZλ has the standard polytabloids as R-basis and is an Sn-submodule of MRλ; in particular it is free over R and nonzero (Integral Specht lattice and base change).

[F2]

βR is the R-bilinear form on MRλ with orthonormal tabloid basis; it is symmetric, nondegenerate and Sn-invariant, and its matrix in the standard basis of SRλ is Gλ, the integral Gram matrix (Integral tabloid form and Specht Gram matrix).

[F3]

In the standard basis of SCλ, the positive definite Hermitian tabloid product has matrix Gλ, and SCλ∩(SCλ)⊥={0} with SCλ≠0 (Invariant Hermitian product on a tabloid module, Complex Specht modules have nondegenerate Hermitian self-pairing).

[F4]

For every field F, every F[Sn]-submodule U≤MFλ satisfies SFλ≤U or U≤(SFλ)⊥, where the orthogonal complement is taken for the form βF (James submodule theorem over every field).

[F5]

For every field F of characteristic p: DFλ=0 if and only if λ is not p-regular; and for p-regular λ, the module DFλ is nonzero, self-dual and absolutely irreducible, RFλ=SFλ∩(SFλ)⊥ is the unique maximal submodule of SFλ and equals rad⁡(SFλ), and DFλ is the simple head of SFλ (Nonzero modular Specht quotient criterion, Modular Specht form and radical quotient).

[F6]

If F has characteristic p, ν is p-regular, U≤MFλ is a submodule and ψ:DFν→MFλ/U is a nonzero F[Sn]-homomorphism, then ν⊵λ; and if ν=λ then U does not contain SFλ (Nonzero maps into tabloid quotients force dominance).

[F7]

The modules Dμ with μ⊢n p-regular form a complete set of pairwise non-isomorphic simple k[Sn]-modules, and their classes form the integral basis of the modular Grothendieck group (Modular simple modules of the symmetric group, Decomposition numbers and the decomposition matrix).

[F9]

Composition multiplicities are additive in short exact sequences, and the multiplicities of the simple factors do not depend on the composition series (Composition series and length of a module, Jordan–Hölder theorem for modules).

[F10]

⊵ is a partial order; if μ⊵λ and μ≠λ, then at the least index r with μr≠λr one has μr>λr, so μ is strictly larger than λ in decreasing lexicographic order (Dominance order on partitions).

Proof

technique · direct
1.1givenF1F8algebra

By [F1] and [F8], SOλ=O⊗ZSZλ is a free O-module with the standard polytabloids as basis, it is stable under Sn, its reduction is SOλ/mSOλ≅k⊗OSOλ≅k⊗ZSZλ=Skλ, and K⊗OSOλ≅K⊗ZSZλ=SKλ. Thus SOλ is a stable O[Sn]-lattice in SKλ with reduction Skλ.

1.2givenF1F2F3algebra

The matrix of the Hermitian product of [F3] in the standard basis of SCλ is (⟨ei,ej⟩)=(∑Tci(T)cj(T)‾), and since all tabloid coefficients of polytabloids are integers by [F1] this equals (∑Tci(T)cj(T))=Gλ by [F2]. By [F3] the restricted Hermitian form on SCλ is nondegenerate, so Gλ is an invertible matrix over C; since Gλ has integer entries, det⁡Gλ≠0. As K has characteristic 0, the image of det⁡Gλ in K is nonzero, so the base-changed form βK has invertible Gram matrix on SKλ and is nondegenerate there.

1.3givenF5F6F7algebra

Let Dν be a composition factor of Mkλ/Skλ. Then Dν≠0, so ν is p-regular by [F5]. Choose a composition series of Mkλ/Skλ; the factor Dν is N/N′ for submodules N′≤N of Mkλ/Skλ. With π:Mkλ↠Mkλ/Skλ and U:=π−1(N′)⊇Skλ one has Mkλ/U≅(Mkλ/Skλ)/N′, and N/N′≅Dν is a nonzero submodule of that quotient; hence there is a nonzero k[Sn]-homomorphism ψ:Dν→Mkλ/U. By [F6] with (ν,λ) in place of its (λ,μ) we get ν⊵λ, and if ν=λ then [F6] says U does not contain Skλ, contrary to U⊇Skλ. Hence ν⊳λ: every composition factor of Mkλ/Skλ is Dν with ν strictly dominating λ.

2.1givenF7F8F9step 1.1

By step 1.1 the stable lattice SOλ in SKλ has reduction Skλ, so by [F8] the decomposition map sends [SKλ] to [Skλ]. Since the classes of the simple modules form the integral basis of the modular Grothendieck group by [F7], and the expansion coefficients of [Skλ] in that basis are the composition multiplicities by [F9], d([SKλ])=∑μ p-regular[Skλ:Dμ] [Dμ]=∑μ p-regulardλμ [Dμ]. Hence the dλμ are exactly the decomposition numbers of the ordinary irreducible SKλ.

2.2givenF1F4step 1.2

SKλ is irreducible: if 0≠U≤SKλ is a proper submodule, then viewing U inside MKλ and applying the James submodule theorem [F4] gives SKλ≤U (impossible) or U≤(SKλ)⊥, and the latter forces U≤SKλ∩(SKλ)⊥=0 by the nondegeneracy of step 1.2, a contradiction. The same argument applies over any field extension E/K: base change gives E⊗KSKλ≅E⊗ZSZλ=SEλ by [F1], det⁡Gλ≠0 in E, and [F4] holds over E; so SEλ is irreducible. Hence SKλ is absolutely irreducible and is the ordinary irreducible attached to λ.

2.3givenF2F5step 1.3algebra

The pairing (x+Skλ, y)↦βk(x,y) from (Mkλ/Skλ)×Skλ⊥ to k is well defined because βk(Skλ,Skλ⊥)=0, and it is nondegenerate: on the right, βk(Mkλ,y)=0 forces y=0 by nondegeneracy of βk from [F2]; on the left, (Skλ⊥)⊥=Skλ because dim⁡W⊥=dim⁡Mkλ−dim⁡W for a nondegenerate form and dim⁡Mkλ−dim⁡Skλ⊥=dim⁡Skλ. Hence Φ:Skλ⊥→(Mkλ/Skλ)∗, Φ(y)=βk(⋅,y), is an isomorphism of k[Sn]-modules, equivariant by the invariance of βk in [F2]. Dualizing a composition series 0=M0<⋯<Mr=Mkλ/Skλ gives exact sequences 0→(Mi/Mi−1)∗→Mi∗→Mi−1∗ and, by induction on i, the composition factors of (Mkλ/Skλ)∗ are the duals of those of Mkλ/Skλ with the same multiplicities. Each Dν is self-dual by [F5], so by step 1.3 every composition factor of Skλ⊥ is Dν with ν⊳λ.

3.1givenF5F9step 2.1step 2.3

The chain 0⊆Rλ=Skλ∩Skλ⊥⊆Skλ⊆Mkλ is a chain of k[Sn]-submodules, and Skλ/Rλ=Dλ if λ is p-regular, and Dλ=0 otherwise, by [F5]. By additivity of composition multiplicities [F9] over this chain, every composition factor of Skλ is a composition factor of Rλ or of Skλ/Rλ; the factors of Rλ are among those of Skλ⊥, hence have the form Dν with ν⊳λ by step 2.3. Consequently: (i) every composition factor of Skλ is Dμ with μ⊵λ; and (ii) if λ is p-regular then [Skλ:Dλ]=1, since the quotient Skλ/Rλ contributes exactly one copy of Dλ and no factor of Rλ is Dλ (those have ν⊳λ), while if λ is not p-regular then Dλ=0. With step 2.1 this is assertion 1 and assertion 2.

4.1givenF10step 3.1

Let μ⊵λ with μ≠λ and let r be the least index with μr≠λr (sequences padded by zeros). The first r−1 partial sums of μ and λ agree, so if μr<λr the r-th partial sum of μ would be strictly smaller than that of λ, contradicting μ⊵λ; hence μr>λr and μ is strictly larger than λ in decreasing lexicographic order by [F10]. Therefore, for p-regular λ, a nonzero dλμ forces μ=λ or μ>λ lexicographically. Listing the p-regular partitions in decreasing lexicographic order as rows (in a block placed first) and as columns, all nonzero entries of the leading p-regular square block lie on or below the diagonal, and the diagonal entries equal 1 by step 3.1. This is assertion 3.

5.1givenstep 1.1step 1.2step 1.3step 2.1step 2.2step 2.3step 3.1step 4.1∎

Assertions 1, 2 and 3 are steps 3.1, 3.1 and 4.1; the decomposition-number identification of the dλμ is step 2.1, and the irreducibility of the ordinary modules SKλ is step 2.2. For n=0 there is one partition ∅, which is p-regular, Sk∅≅k is the trivial module and d∅∅=1, so the statements hold with a 1×1 block. The theorem gives only dominance constraints: it does not compute the off-diagonal entries dλμ with μ⊳λ, which depend on p. No step divides by p or by a group order, none uses positivity of the modular form (positivity is used only over C in step 1.2 to see that Gλ is nonsingular), and characteristic 2 is included.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Conjugate Specht modules are sign-twisted duals over every field

Statement

Let F be a field, n≥0, λ⊢n, and let λ′ be the conjugate partition. Write Ωλ for the finite set of λ-tabloids and let MFλ=F(Ωλ),SFλ⊆MFλ,κt=∑γ∈Ctsgn⁡(γ)γ,et=κt{t} be the field-valued tabloid module, the span of the polytabloids inside it, the column antisymmetrizer, and the polytabloid of a λ-tableau t (Young subgroups, tabloids, and permutation modules, Column antisymmetrizers, polytabloids, and Specht modules). Let βF:MFλ×MFλ⟶F be the F-bilinear form for which the tabloid basis is orthonormal (Integral tabloid form and Specht Gram matrix), and for a subspace V⊆MFλ put V⊥:={x∈MFλ:βF(x,v)=0 for all v∈V}.

Let sgn⁡ be the sign representation of Sn on the line Fw, so that σ⋅w=sgn⁡(σ)w (The sign representation of Sn and the restriction Res⁡HG(V) of a representation to a subgroup), and let SFλ⊗sgn⁡ be the tensor product of F[Sn]-modules with the diagonal action σ⋅(x⊗w):=(σ⋅x)⊗(σ⋅w), a finite-dimensional F[Sn]-module (The tensor product M⊗RN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums). For a finite-dimensional F[Sn]-module D the dual is D∗=Hom⁡F(D,F) with (σ⋅f)(v):=f(σ−1v).

Fix the row-filled λ-tableau t0, whose i-th row carries the block Bi={λ1+⋯+λi−1+1,…,λ1+⋯+λi} in increasing order, and let t0T be its transpose, a λ′-tableau. For a λ′-tableau u let σu∈Sn be the unique permutation with σu⋅t0T=u, and let uT be the transpose of u, a λ-tableau. Define an F-linear map on the tabloid basis of MFλ′ by θ({u}):=sgn⁡(σu) (euT⊗w) ∈ SFλ⊗sgn⁡.

Lemma. With this notation:

  1. θ does not depend on the chosen representative u of the tabloid {u}; it is a well-defined F[Sn]-module homomorphism θ:MFλ′→SFλ⊗sgn⁡ with θ({t0T})=et0⊗w.
  2. θ is surjective and ker⁡θ=(SFλ′)⊥.
  3. Consequently θ induces F[Sn]-isomorphisms MFλ′/(SFλ′)⊥≅SFλ⊗sgn⁡,henceSFλ⊗sgn⁡≅(SFλ′)∗, the second being the composite with x↦βF(x,⋅)∣SFλ′.

No nondegeneracy of βF restricted to SFλ′ is assumed, and the statement includes every prime characteristic, the case n=0, and the case F=Q used in step 2.2. No step divides by a group order, none uses positivity or averaging, and none uses characteristic zero beyond the explicitly separated rational computation in steps 2.2 and 3.1.

Facts & Assumptions

Given: A field F, an integer n≥0, a partition λ⊢n, its conjugate λ′, the row-filled tableau t0, and the definitions above.

[F1]

The tabloids form an F-basis of MFλ; {t}={ρ⋅t:ρ∈Rt}, and Sn acts by σ⋅{t}={σ⋅t} (Young subgroups, tabloids, and permutation modules). The coefficient of {t} in et is 1, so et≠0, and every tabloid coefficient of et lies in {0,1,−1}; over every commutative ring R the standard polytabloids form an R-basis of SRλ≅R⊗ZSZλ, i.e. SRλ is the R[Sn]-span of the polytabloids; SZλ is a direct summand of the free Z-module MZλ, and every et generates SRλ as an R[Sn]-module (Integral Specht lattice and base change, Column antisymmetrizers, polytabloids, and Specht modules).

[F2]

βF is symmetric, nondegenerate and Sn-invariant, βF(σx,σy)=βF(x,y), and it is the scalar extension of the integral form βZ with orthonormal tabloid basis; every κt is self-adjoint, βF(κtx,y)=βF(x,κty) (Integral tabloid form and Specht Gram matrix).

[F3]

Ct and Rt are the column and row stabilizers of t; a permutation lies in Rt if and only if it fixes the tabloid {t}, and eσ⋅t=σ⋅et while γ⋅et=sgn⁡(γ)et for γ∈Ct (Row and column stabilizers, Polytabloid covariance and the column sign rule).

[F4]

A λ-tableau is a bijection from the set of cells of [λ] onto {1,…,n}; the transpose tT, defined by tT(j,i):=t(i,j), is a λ′-tableau, where λj′=#{i:λi≥j}; transposition commutes with relabelling, (σ⋅t)T=σ⋅tT; it swaps the row and column conditions, so it bijects the standard λ-tableaux with the standard λ′-tableaux; and Rt=CtT, Ct=RtT (Partitions, English diagrams, and conjugation, Tableaux and standard tableaux, Row and column stabilizers).

[F5]

James submodule theorem over every field: for every F and every F[Sn]-submodule U≤MFλ, either SFλ≤U or U≤(SFλ)⊥ (James submodule theorem over every field).

[F6]

For finite-dimensional F-vector spaces V,W one has dim⁡F(V⊗FW)=(dim⁡FV)(dim⁡FW) (Rm⊗RRn≅Rmn with the product basis, and dim⁡F(V⊗FW)=dim⁡FV dim⁡FW); for a subspace V≤M of a space with a nondegenerate bilinear form, the map M→V∗, x↦β(x,⋅)∣V is surjective with kernel V⊥, so dim⁡FV⊥=dim⁡FM−dim⁡FV; and rank-nullity holds (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T).

[F7]

sgn⁡ is one-dimensional with σ⋅w=sgn⁡(σ)w, so SFλ⊗sgn⁡ is the tensor product of F[Sn]-modules with the diagonal action and dim⁡F(SFλ⊗sgn⁡)=dim⁡FSFλ (The sign representation of Sn and the restriction Res⁡HG(V) of a representation to a subgroup, The tensor product M⊗RN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums).

Proof

technique · direct
1.1givenF1F4algebra

For a λ-tableau t let tT be its transpose. By [F4], tT is a λ′-tableau, (σ⋅t)T=σ⋅tT for σ∈Sn, and Ru=CuT for every tableau u. Transposition is a bijection between the λ-tableaux and the λ′-tableaux, inverse to itself. Care is needed with tabloids: a transposed tableau ρ⋅tT with ρ∈Rt=CtT need not be row equivalent to tT, so the assignment t↦tT does not descend to the tabloids and no such descent is used anywhere below; the map constructed next is defined on each tabloid by a signed polytabloid, not by a transposed tabloid. By [F1] and [F4] the number of standard λ-tableaux equals the number of standard λ′-tableaux, so dim⁡FSFλ=dim⁡FSFλ′=:f, and dim⁡FMFλ′=∣Ωλ′∣.

1.2givenF1F3F4algebra

Well-definedness of θ. Fix a λ′-tableau u and γ∈Ru, so that γ⋅u is a tableau of the same tabloid {u} by [F1]. Since σu⋅t0T=u, one has (γσu)⋅t0T=γ⋅u, so σγ⋅u=γσu and sgn⁡(σγ⋅u)=sgn⁡(γ)sgn⁡(σu). Also (γ⋅u)T=γ⋅uT by [F4], and γ∈Ru=CuT by [F4], so [F3] gives e(γ⋅u)T=γ⋅euT=sgn⁡(γ)euT. Multiplying, sgn⁡(σγ⋅u)e(γ⋅u)T=sgn⁡(γ)2sgn⁡(σu)euT=sgn⁡(σu)euT, and the tensor factor w is unchanged, so θ({γ⋅u})=θ({u}); every representative of {u} arises this way, so θ is well defined on the tabloid basis and extends F-linearly to MFλ′. Since σt0T=id one has θ({t0T})=et0⊗w.

1.3givenF3F4F7algebra

Equivariance. Let σ∈Sn and let u be a λ′-tableau. Then σ⋅u is a λ′-tableau with σσ⋅u=σσu, and (σ⋅u)T=σ⋅uT by [F4]; therefore [F3] gives e(σ⋅u)T=σ⋅euT and θ(σ⋅{u})=sgn⁡(σ)sgn⁡(σu)(σ⋅euT)⊗w=σ⋅(sgn⁡(σu)euT⊗w)=σ⋅θ({u}), because σ⋅w=sgn⁡(σ)w by [F7]. Hence θ is a homomorphism of F[Sn]-modules.

2.1givenF1F7step 1.2step 1.3algebra

Surjectivity. By [F1] the vectors σ⋅et0 span SFλ. By [F7], σ⋅(et0⊗w)=sgn⁡(σ)(σ⋅et0)⊗w; since every sign is a nonzero scalar, these orbit vectors span SFλ⊗sgn⁡. The image of θ is a submodule containing et0⊗w by steps 1.2 and 1.3, so it contains all these vectors and θ is surjective.

2.2givenF1F2F4F5step 1.2step 1.3algebra

The kernel over Q. Work over the field Q and write θQ for the map of step 1.2 over Q. Since Ct0T=Rt0 by [F4] and et0T=κt0T{t0T} by [F1], steps 1.3 and [F2] give θQ(et0T)=κt0T⋅θQ({t0T})=(∑γ∈Rt0γ)⋅et0⊗w. For γ∈Rt0 the coefficient of {t0} in γ⋅et0 equals the coefficient of γ−1{t0}={t0} in et0, which is 1 by [F1]; summing over the ∣Rt0∣ elements of Rt0, the coefficient of {t0}⊗w in θQ(et0T) is ∣Rt0∣=∏iλi!≠0 in Q. Hence θQ(et0T)≠0, so SQλ′≰ker⁡θQ; by the James submodule theorem [F5] applied to the submodule ker⁡θQ≤MQλ′ we get ker⁡θQ⊆(SQλ′)⊥.

2.3givenF1F2F6step 1.1algebra

The orthogonal complement commutes with base change. By [F2] and [F1] the map φ:MZλ′→Hom⁡Z(SZλ′,Z), x↦βZ(x,⋅), is Z-linear with kernel SZλ′⊥. It is surjective: any h∈Hom⁡Z(SZλ′,Z) extends to a Z-linear h~:MZλ′→Z, because SZλ′ is a direct summand of the free module MZλ′ by [F1], and by nondegeneracy of βZ there is x∈MZλ′ with h~(T)=βZ(x,T) for every tabloid, so φ(x)=h. Since Hom⁡Z(SZλ′,Z) is a free Z-module, φ splits, so SZλ′⊥ is a direct summand of MZλ′ of rank ∣Ωλ′∣−f. Let F be any field. Tensoring with F and using βF=βZ⊗Z-bilinearity gives SZλ′⊥⊗ZF⊆(SFλ′)⊥, while both sides are subspaces of MFλ′ of dimension ∣Ωλ′∣−f: the left side because it is free of that rank, the right side by [F6] and step 1.1 applied over F. Hence (SFλ′)⊥=SZλ′⊥⊗ZF.

3.1givenF6F7step 1.1step 2.1step 2.2algebra

Dimension count over Q. By step 2.1 the map θQ is onto, so by rank-nullity and [F6], [F7], dim⁡Qker⁡θQ=∣Ωλ′∣−dim⁡Q(SQλ⊗sgn⁡)=∣Ωλ′∣−f, while dim⁡Q(SQλ′)⊥=∣Ωλ′∣−dim⁡QSQλ′=∣Ωλ′∣−f by [F6] and step 1.1. With step 2.2 this forces ker⁡θQ=(SQλ′)⊥. Together with step 2.2, this identifies the kernel over Q; the argument never divides by a group order in nonzero characteristic.

4.1givenF1F2step 1.2step 3.1algebra

The integral kernel. The formula of step 1.2 has coefficients ±1 times tabloid coefficients of polytabloids, hence defines an integral map θZ:MZλ′→SZλ⊗Zsgn⁡Z satisfying θZ=θQ after extending scalars and θQ=θZ⊗ZQ. Let SZλ′⊥:={x∈MZλ′:βZ(x,y)=0 for all y∈SZλ′}. Every x∈SZλ′⊥ has βQ(x,y)=0 for all y∈SQλ′, because βQ is Q-bilinear and SQλ′ is the Q-span of SZλ′ by [F1]; hence x∈(SQλ′)⊥=ker⁡θQ by step 3.1, and θZ(x) maps to zero in SQλ⊗sgn⁡Q. Since SZλ is a free Z-module by [F1], the tensor product SZλ⊗Zsgn⁡Z is torsion-free, so θZ(x)=0. Therefore SZλ′⊥⊆ker⁡θZ.

5.1givenF6F7step 1.1step 1.3step 2.1step 4.1step 2.3algebra

The kernel over an arbitrary field. Let F be any field and put θF:=θZ⊗ZidF, the map given by the formula of step 1.2 computed in F; it is F[Sn]-linear by step 1.3 and surjective by step 2.1. By steps 4.1 and 2.3, (SFλ′)⊥⊆ker⁡θF. By rank-nullity, [F6], [F7] and step 1.1, dim⁡Fker⁡θF=∣Ωλ′∣−dim⁡F(SFλ⊗sgn⁡)=∣Ωλ′∣−f=dim⁡F(SFλ′)⊥. Two subspaces of a finite-dimensional vector space, one containing the other, with equal dimension, coincide; therefore ker⁡θF=(SFλ′)⊥.

6.1givenF2step 1.3step 5.1algebra

The isomorphism. By steps 1.3 and 5.1 the map θF induces an isomorphism of F[Sn]-modules MFλ′/(SFλ′)⊥≅SFλ⊗sgn⁡,ξ+(SFλ′)⊥↦θF(ξ). The map ψ:MFλ′→(SFλ′)∗, ψ(x)=βF(x,⋅)∣SFλ′, is F[Sn]-linear: by invariance of βF in [F2], ψ(σ⋅x)(y)=βF(σx,y)=βF(x,σ−1y)=ψ(x)(σ−1y)=(σ⋅ψ(x))(y) for all y∈SFλ′. Its kernel is (SFλ′)⊥, and it is surjective by the extension argument of step 2.3 carried out over the field F, using that βF is nondegenerate and SFλ′ is a subspace of the finite-dimensional F-space MFλ′. Hence MFλ′/(SFλ′)⊥≅(SFλ′)∗, and composing the two isomorphisms gives the F[Sn]-isomorphism SFλ⊗sgn⁡≅(SFλ′)∗.

7.1givenF1F2F7step 5.1step 6.1∎

Extremal cases. For n=0 one has λ=λ′=∅, MF∅=SF∅=Fet0 with βF(et0,et0)=1 and Rt0={1}; then θ is the identity map MF∅→SF∅⊗sgn⁡, it is an isomorphism, and (SF∅)⊥=0=ker⁡θ, so all three assertions hold, f=1 and ∣Ω∅∣=1. In characteristic 2 the sign representation is trivial as an F[Sn]-module by [F7], and the statements still hold: the kernel identification is supplied by steps 2.3, 4.1 and 5.1, which transport the rational computation of step 3.1 to F, and the conjugate partition λ′ is still the shape of Sλ′ in the dual. At no point is the restricted form βF∣SFλ′ assumed nondegenerate: (SFλ′)⊥ may strictly contain SFλ′ and θ may vanish on all of SFλ′; only its kernel, the subspace (SFλ′)⊥, is determined. This completes all three assertions.

RemarkRemark: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Triangularity does not compute every modular decomposition number

Remark

The unitriangularity theorem of this page (Dominance unitriangularity of the symmetric-group decomposition matrix) is a constraint on the decomposition matrix, not a computation of it. It fixes three things: the positions that are forced to be zero, namely those with dλμ=0 unless μ⊵λ (Decomposition numbers and the decomposition matrix, Dominance order on partitions); the diagonal values dλλ=1 for p-regular λ; and the resulting lower unitriangular shape of the square block of p-regular rows and columns. It says nothing about the value of an off-diagonal entry dλμ at an allowed position, that is, at a pair with μ⊳λ and μ p-regular: such an entry may be zero or positive, and the triangularity argument does not compute it.

This is a genuine limitation of the triangle data, not merely of the proof. For n=3 the formal constraints are the same at p=2 and at p=3: the p-regular partitions used as column labels are (3),(2,1) in both characteristics, the forced zero at the position ((3),(2,1)) is present in both, and the same diagonal positions d(3),(3)=d(2,1),(2,1)=1 are required. Yet the actual matrices, as recorded in James's Example 12.4, differ exactly at an allowed position, d(2,1),(3)=0 for p=2 and d(2,1),(3)=1 for p=3. Hence a rule that reads off off-diagonal entries from the dominance-zero pattern and the diagonal alone cannot produce the decomposition matrix; the value depends on the modular composition factors of the Specht modules, which are separate input. The source separates the two problems in the same way: it opens the chapter on decomposition matrices by recording that there is "no known way of determining the composition factors of the general Specht module when the ground field F has characteristic a prime p", and closes the paragraph with "The theorems we expound give only partial results" (James, §24, printed p. 98). This pair proves the triangularity constraints and a small number of explicit finite computations, and asserts no formula or algorithm for the general positive-characteristic decomposition matrix; the later Hecke-algebra and canonical-basis regimes involve further tools and hypotheses and are used nowhere on this pair.

Facts & Assumptions

Given: A prime p, an integer n≥0, and a splitting p-modular system (K,O,k) for Sn (A splitting p-modular system for a finite group is a p-modular system whose fraction and residue fields split the needed group algebras). For the witness, n=3 and p=2 or p=3.

[F1]

By the unitriangularity theorem (Dominance unitriangularity of the symmetric-group decomposition matrix), with dλμ=[Skλ:Dμ] the decomposition numbers of the ordinary irreducibles SKλ (Decomposition numbers and the decomposition matrix): dλμ=0 unless μ⊵λ; dλλ=1 for every p-regular λ⊢n; and with the p-regular partitions listed in decreasing lexicographic order the leading square block is lower unitriangular.

[F2]

Combined with p-regular and p-restricted partitions: a partition is p-regular when every positive part occurs fewer than p times. For n=3 one has z1(1,1,1)=3≥p for p∈{2,3}, so (1,1,1) is p-singular for both primes; and z3(3)=1<p, z2(2,1)=z1(2,1)=1<p for both, so (3) and (2,1) are p-regular for both primes. In the dominance order on partitions of 3 one has (3)⊳(2,1)⊳(1,1,1), and the dominance relation does not depend on p (Dominance order on partitions).

[F3]

James's Example 12.4 (printed p. 43) records the decomposition matrices of S3 with rows S(3),S(2,1),S(1,1,1) and columns D(3),D(2,1); at p=2 (100110),and at p=3(101101). At p=2 the equality Sk(1,1,1)≅Sk(3) holds because the sign representation equals the trivial representation in characteristic 2; at p=3 the row S(2,1) contains a trivial composition factor and a sign composition factor, each once.

[F4]

James §24 (printed p. 98) opens: "There is no known way of determining the composition factors of the general Specht module when the ground field F has characteristic a prime p." The same paragraph closes: "The theorems we expound give only partial results."

Proof

technique · direct
1.1givenF1F2

By [F1] the triangle data for given n and p consist of: the index sets of rows and columns (all partitions of n, and the p-regular partitions of n), the set of positions forced to be zero {(λ,μ):μ⋭λ}, the diagonal positions {(λ,λ):λ p-regular} with value 1, and the lex ordering of the square block. No condition of [F1] assigns a value to an allowed position (λ,μ) with μ⊳λ, μ p-regular, λ≠μ; in particular μ⋭λ holds for μ=(2,1), λ=(3) in n=3, so the position ((3),(2,1)) is forced to be zero, while the position ((2,1),(3)) is allowed because (3)⊳(2,1) by [F2].

1.2givenF2F3

By [F2] the p-regular partitions of 3 are (3),(2,1) for p=2 and for p=3, and (1,1,1) is p-singular for both primes; by [F3] the corresponding matrices Mp with rows (3),(2,1),(1,1,1) and columns (3),(2,1) are M2=(100110),M3=(101101).

2.1givenF1F2F3step 1.1step 1.2algebra

Both M2 and M3 satisfy every condition of step 1.1. Indeed, the left column is indexed by (3) and the right column by (2,1) in both matrices; for the row (3) the entry at column (2,1) is 0 in both, as required since (2,1) does not dominate (3); the diagonal entries d(3),(3)=1 and d(2,1),(2,1)=1 are present in both; and the row (1,1,1) carries no diagonal requirement because (1,1,1) is p-singular for both primes, its entries lying in allowed positions. The two matrices nevertheless differ: d(2,1),(3)=0 in M2 and d(2,1),(3)=1 in M3, at the position ((2,1),(3)), which is allowed in both cases by step 1.1. Since the dominance pattern and the diagonal positions are the same while the entry differs, the conditions of [F1] do not determine the entries at allowed positions.

3.1givenF4step 2.1∎

By step 2.1 the triangularity theorem's data are strictly weaker than a determination of the decomposition matrix: they are satisfied by two different matrices, realized in characteristics 2 and 3 respectively, so an off-diagonal entry depends on the modular composition factors of the Specht modules and not on the triangular shape alone. A determination of the general off-diagonal entry therefore needs an additional input beyond the results of this pair, as the source's own separation of the two problems in [F4] records: the general composition factors are not determined by the theory expounded there, whose theorems "give only partial results". This pair establishes the unitriangularity constraints and the explicit small-shape computations only, and asserts no general formula or algorithm for decomposition numbers in positive characteristic; no step of its proofs computes an off-diagonal entry in the allowed region by a general rule.

5 · Examples, counterexamples and false statements

None yet.

Sources