Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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.

Depends on

Used by

Dependency tree · two levels

53 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources