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.

Homomorphisms from Specht to Young permutation modules obey dominance

Statement

For λ,μ⊢n over C, a nonzero Sn-map ϕ:Sλ→Mμ implies λ⊵μ. At μ=λ, every Sn-map Sλ→Mλ is a scalar multiple of the inclusion; equivalently, Hom⁡C[Sn](Sλ,Mλ)≅C.

Facts & Assumptions

Given: n≥0, partitions λ,μ⊢n, and a complex C[Sn]-module homomorphism ϕ:Sλ→Mμ.

[F2]

Each Mν is a finite-dimensional complex representation of Sn (Young subgroups, tabloids, and permutation modules).

[F3]

The ν-tabloids form a basis of Mν, with the linear extension of the left Sn-action (Young subgroups, tabloids, and permutation modules).

[F4]

For a λ-tableau t, κt=∑γ∈Ctsgn⁡(γ)γ, et=κt⋅{t}, and Sλ is the complex span of the es (Column antisymmetrizers, polytabloids, and Specht modules).

[F5]

Every et is nonzero, since its coefficient at {t} is 1 (Column antisymmetrizers, polytabloids, and Specht modules).

[F6]

Sλ is an Sn-subrepresentation generated by any one et (Polytabloid covariance and the column sign rule).

[F7]

A subrepresentation is a linear subspace stable under each group element (Subrepresentations, direct sums of representations, and irreducibility).

[F8]

For a finite group over a field whose characteristic does not divide the group order, every subrepresentation has a complementary subrepresentation; this applies over C (Maschke's theorem for finite groups over fields whose characteristic does not divide ∣G∣).

[F9]

The space Hom⁡Sn(V,W) consists of complex-linear Sn-equivariant maps and is a subspace of the complex vector space of linear maps (Intertwiners, the spaces Hom⁡G(V,W) and End⁡G(V), equivalent representations, and faithful representations).

[F10]

A complex-linear map is Sn-equivariant exactly when it is a C[Sn]-module homomorphism (For a commutative ring R, R-linear G-actions are exactly the compatible left R[G]-module structures).

[F11]

If κtMμ≠0, then λ⊵μ (Nonzero antisymmetrizer image detects dominance).

[F12]

For every λ-tableau t, κtMλ=Cet (The antisymmetrizer image in its own tabloid module is one-dimensional).

[F13]

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

[F14]

Every shape has a canonical standard row-filled tableau t0 (Young subgroups, tabloids, and permutation modules).

[F15]

No form of the Axiom of Choice is used. The proof uses one complement supplied by Maschke's theorem and existential witnesses from spanning families; it does not choose from an arbitrary indexed family.

Proof

technique · direct
1.1givenF1F2F6F7F8F15

By [F1] and [F15], Sn is a finite group; by [F2], Mλ is a finite-dimensional complex representation; by [F6]-[F7], Sλ is a subrepresentation. Since char⁡C=0 does not divide ∣Sn∣, [F8] gives a subrepresentation T with Mλ=Sλ⊕T.

2.1givenF6F7step 1.1

Define p:Mλ→Sλ by p(s+t)=s for s∈Sλ,t∈T. The direct sum makes p a well-defined linear projection with p∣Sλ=id; since both summands are stable, p(σ(s+t))=σs=σp(s+t) for every σ∈Sn, so p is equivariant.

3.1givenF9F10step 2.1

Set Φ:=ϕ∘p:Mλ→Mμ. By [F9]-[F10] and step 2.1, Φ is a C[Sn]-module homomorphism, and Φ∣Sλ=ϕ.

4.1givenF3F4F10step 3.1

If ϕ≠0, some λ-tableau t has ϕ(et)≠0 because the polytabloids span Sλ by [F4]. The tabloid {t} is a basis vector by [F3]; then [F4] and step 3.1 give ϕ(et)=Φ(et)=Φ(κt⋅{t})=κt⋅Φ({t})≠0, so κtMμ≠0.

5.1givenF11F13step 4.1

If ϕ≠0, step 4.1 and [F11] imply λ⊵μ, which by [F13] is the stated dominance order; if ϕ=0, the nonzero-map implication is vacuous.

5.2givenF5F6F9F12step 4.1

Suppose μ=λ and ϕ≠0, and use the tableau from step 4.1. By [F12], ϕ(et)=κtΦ({t})∈Cet; since et≠0 by [F5], write ϕ(et)=cet with c≠0. For every σ∈Sn, equivariance gives ϕ(σet)=cσet; by [F6], this extends linearly to all of Sλ. Hence ϕ=cιλ, where ιλ:Sλ↪Mλ is inclusion.

6.1givenF4F5F6F9F10F14step 5.2∎

If ϕ=0, it is 0ιλ; step 5.2 covers every nonzero map when μ=λ. Each scalar multiple of inclusion is equivariant by [F6]. The canonical t0 from [F14] has et0∈Sλ by [F4] and et0≠0 by [F5], so ιλ is nonzero. Therefore c↦cιλ is a linear bijection from C to Hom⁡C[Sn](Sλ,Mλ).

Depends on

Used by

Dependency tree · two levels

49 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