Alphabeta Math
CorollaryStatement: 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.

Distinct complex Specht modules are inequivalent

Statement

If λ,μ⊢n and Sλ≅Sμ as complex Sn-representations, then λ=μ.

Facts & Assumptions

Given: n≥0, partitions λ,μ⊢n, and an isomorphism f:Sλ→Sμ of complex Sn-representations.

[F1]

Each shape ν⊢n has a canonical standard row-filled tableau tν (Young subgroups, tabloids, and permutation modules).

[F2]

The Specht space Sν is the complex span of its polytabloids, each lying in the tabloid module Mν (Column antisymmetrizers, polytabloids, and Specht modules).

[F3]

For every tableau t, the coefficient of {t} in et is 1; in particular et≠0 (Column antisymmetrizers, polytabloids, and Specht modules).

[F4]

For each ν⊢n, Sν is an Sn-submodule of Mν (Polytabloid covariance and the column sign rule).

[F6]

A complex-linear map of Sn-representations is 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).

[F7]

A nonzero C[Sn]-module map Sα→Mβ implies α⊵β (Homomorphisms from Specht to Young permutation modules obey dominance).

[F8]

The dominance relation on partitions of n is antisymmetric: λ⊵μ and μ⊵λ imply λ=μ (Dominance order on partitions).

No form of the Axiom of Choice is used. The proof uses only the canonical tableaux in [F1] and the given isomorphism.

Proof

technique · direct
1.1givenF1F2F3F4F5F6

Let tλ be the canonical tableau from [F1]. By [F2]-[F3], etλ≠0 in Sλ. Let ιμ:Sμ↪Mμ be inclusion and set ψ:=ιμ∘f. Since f and inclusion are injective, ψ(etλ)≠0. By [F4]-[F5], both maps are Sn-equivariant, so [F6] makes ψ a C[Sn]-module homomorphism.

1.2givenF1F2F3F4F5F6algebra

The inverse f−1 is equivariant: for y=f(x), surjectivity and equivariance of f give f−1(σy)=f−1(σf(x))=f−1(f(σx))=σx=σf−1(y) for every σ∈Sn. Let tμ be the canonical tableau from [F1] and let ιλ:Sλ↪Mλ be inclusion. By [F2]-[F3], etμ≠0 in Sμ; since f−1 and inclusion are injective, ψ′:=ιλ∘f−1:Sμ→Mλ is nonzero. By [F4]-[F6], it is a C[Sn]-module homomorphism.

2.1step 1.1F7

Apply [F7] to the nonzero map ψ:Sλ→Mμ from step 1.1; it gives λ⊵μ.

2.2step 1.2F7

Apply [F7] with α=μ and β=λ to ψ′ from step 1.2. It gives μ⊵λ.

3.1step 2.1step 2.2F8∎

Steps 2.1 and 2.2 give both dominance relations, so [F8] yields λ=μ.

Depends on

Used by

Dependency tree · two levels

31 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