Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Specht modules classify the complex irreducibles of Sn

Statement

For every n≥0, the modules {Sλ:λ⊢n} form a complete irredundant list, up to isomorphism, of finite-dimensional irreducible complex Sn-representations.

Facts & Assumptions

Given: n≥0. Let Pn be the set of partitions of n, Cn the set of conjugacy classes of Sn, and In the set of isomorphism classes of finite-dimensional irreducible complex Sn-representations.

[F1]

A partition is a finite weakly decreasing list of positive integers with sum n (Partitions, English diagrams, and conjugation).

[F3]

Sn is finite and ∣Sn∣=n! (The Lehmer code gives ∣Sn∣=n! again).

[F5]

R is an ordered field and, for every integer m≥1, its canonical natural m⋅1R is positive (The reals form a totally ordered field, Canonical naturals are positive and strictly increasing).

[F7]

The natural-to-integer embedding preserves order, and zero divides no positive integer (The naturals embed in the integers, Invertibility of a positive natural scalar in a field).

[F8]

C is algebraically closed (The complex numbers are algebraically closed).

[F9]

For a finite group G and algebraically closed field k with char⁡k∤∣G∣, the finite set of irreducible representation classes has cardinality equal to the finite set of conjugacy classes (If k is algebraically closed and char⁡k∤∣G∣, the number of irreducible representations of G equals the number of conjugacy classes).

[F10]

Conjugacy classes of Sn are in bijection with the tuples of nonnegative integers (c1,…,cn) satisfying ∑k=1nkck=n; when n=0 the unique empty tuple indexes the identity class (The conjugacy classes of Sn are indexed by the tuples (c1,…,cn) with ∑kck=n).

[F11]

Each Sλ is a nonzero irreducible complex representation of Sn (Complex Specht modules are irreducible).

[F12]

If Sλ≅Sμ for λ,μ⊢n, then λ=μ (Distinct complex Specht modules are inequivalent).

[F13]

A representation is finite-dimensional as specified in A finite-dimensional representation ρ:G→GL⁡(V) over a field, and its degree, is irreducible when it is nonzero and has no proper nonzero subrepresentation (Subrepresentations, direct sums of representations, and irreducibility), and two representations are equivalent exactly when an invertible intertwiner exists (Intertwiners, the spaces Hom⁡G(V,W) and End⁡G(V), equivalent representations, and faithful representations).

[F14]

For finite sets, a bijection transports cardinality (The cardinality ∣A∣ of a finite set).

[F15]

If J⊆I and I is finite, then J is finite and ∣J∣=∣I∣ implies J=I (A subset of a finite set is finite, with ∣B∣≤∣A∣, and equality holds if and only if B=A).

[F16]

A map is injective when equal outputs force equal inputs, is surjective when its image is the codomain, and is bijective when it is both injective and surjective (Injection, surjection, bijection).

[F17]

For n=0 the only partition is the empty list (Partitions, English diagrams, and conjugation).

[F18]

Cardinality is defined for finite sets, and a finite set has cardinality only as a natural number (The cardinality ∣A∣ of a finite set).

[F19]

For n=0, the unique empty tuple indexes the identity class of S0 (The conjugacy classes of Sn are indexed by the tuples (c1,…,cn) with ∑kck=n).

[F20]

A finite set has cardinality zero exactly when it is empty (The cardinality ∣A∣ of a finite set).

No Axiom of Choice is used.

Proof

technique · counting
1.1F4F5F6

For each m≥1, [F5] gives m⋅1R>0. The embedding in [F4] sends this canonical real scalar to m⋅1C; if the latter were zero, injectivity would make the positive real scalar zero, a contradiction. Thus no positive integer multiple of 1C is zero, and [F6] yields char⁡C=0.

1.2F2F3F7F8F9F18F20

The identity permutation belongs to Sn, so [F3] makes Sn a nonempty finite group and [F20] gives ∣Sn∣>0. The natural-to-integer embedding in [F7] preserves positivity, so characteristic zero does not divide this order; [F8] supplies the algebraic-closure hypothesis. Applying [F9] shows that In and Cn are finite and ∣In∣=∣Cn∣.

1.3F1F10F17F19construct

For a tuple (c1,…,cn) from [F10], form the finite list containing ck copies of k for each k=n,n−1,…,1. Its entries are positive, weakly decreasing and sum to n, so [F1] makes it a partition. The inverse map sends a partition to the multiplicity ck of each part k. For n=0, [F17] and [F19] make both constructions the empty list/tuple. Thus the tuple set in [F10] is in bijection with Pn, and [F10] then gives Pn≈Cn.

1.4F11F12given

Define Φ:Pn→In by Φ(λ)=[Sλ]. Fact [F11] makes this a well-defined map into In, and [F12] makes it injective.

2.1F14step 1.2step 1.3

By [F14] and step 1.2, the bijection in step 1.3 transports finiteness and cardinality, so Pn is finite and ∣Pn∣=∣Cn∣=∣In∣.

3.1F15F16step 1.2step 2.1step 1.4

Let J:=Φ[Pn]⊆In. The map Φ is injective by step 1.4, and its corestriction to its image is surjective by the definition of J; [F16] therefore makes this corestriction a bijection. Hence ∣J∣=∣Pn∣=∣In∣ by step 2.1. Since In is finite by step 1.2, [F15] gives J=In. Thus Φ is surjective as well as injective.

4.1F11F12F13step 1.4step 3.1∎

The surjectivity in step 3.1 says every finite-dimensional irreducible complex Sn-representation is isomorphic to some Sλ; injectivity in step 1.4 says no two distinct partitions give isomorphic modules. These are exactly completeness and irredundancy, proving the statement.

Depends on

Used by

Dependency tree · two levels

118 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