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.

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.

Depends on

Used by

Dependency tree · two levels

36 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