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.

James's submodule theorem over the complex numbers

Statement

For every n≥0, partition λ⊢n, and Sn-submodule U⊆Mλ, either Sλ⊆UorU⊆(Sλ)⊥, where orthogonality is for the invariant positive definite Hermitian tabloid product.

Facts & Assumptions

Given: n≥0, λ⊢n, and an Sn-submodule U⊆Mλ.

[F1]

The tabloids form a basis of Mλ, and the Sn-action extends linearly from the tabloid action (Young subgroups, tabloids, and permutation modules).

[F2]

An Sn-submodule is a linear subspace stable under each element of Sn (Subrepresentations, direct sums of representations, and irreducibility).

[F3]

The column antisymmetrizer, polytabloid, and Specht space are

κt=∑γ∈Ctsgn⁡(γ)γ,et=κt⋅{t},Sλ=span⁡C{es:s is a λ-tableau}

for each λ-tableau t (Column antisymmetrizers, polytabloids, and Specht modules).

[F4]

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

[F5]

The Specht space is generated as an Sn-module by any one polytabloid et (Polytabloid covariance and the column sign rule).

[F6]

The tabloid product is conjugate-linear in its first argument and linear in its second (Invariant Hermitian product on a tabloid module).

[F7]

Each κt is self-adjoint for the tabloid product (Invariant Hermitian product on a tabloid module).

[F8]

This Hermitian product is positive definite: if x≠0, then ⟨x,x⟩>0 (Invariant Hermitian product on a tabloid module).

[F9]

The orthogonal complement is (Sλ)⊥={v:⟨v,s⟩=0 for every s∈Sλ} (Orthogonality and the orthogonal complement).

[F10]

Every shape has a canonical standard row-filled tableau t0; for n=0 it is the empty tableau (Young subgroups, tabloids, and permutation modules).

No form of the Axiom of Choice is used. The first branch uses only witnesses to one existential statement, and all group-algebra sums are finite.

Proof

technique · direct
1.1givenF1F2F3F4

If κtu≠0 for some u∈U and λ-tableau t, then [F4] gives κtu=cet with c≠0; by [F1]-[F3] the finite group-algebra sum κtu lies in U, so division gives et∈U.

1.2givenF3F7

Otherwise κtu=0 for every u∈U and every t; self-adjointness in [F7] and et=κt⋅{t} from [F3] give ⟨u,et⟩=⟨u,κt⋅{t}⟩=⟨κtu,{t}⟩=0.

2.1givenF2F5step 1.1

By [F5], the polytabloid from step 1.1 generates Sλ under Sn; stability of U from [F2] and step 1.1 therefore give Sλ⊆U.

2.2givenF3F6F9step 1.2

Since the et span Sλ by [F3] and the product is linear in its second argument by [F6], step 1.2 gives ⟨u,s⟩=0 for every u∈U and s∈Sλ; by [F9], U⊆(Sλ)⊥.

3.1givenF3F4F8F9F10step 2.1step 2.2∎

The cases “some κtu≠0” and “all κtu=0” are exhaustive; if both conclusions held, Sλ⊆U⊆(Sλ)⊥, so the nonzero canonical et0∈Sλ from [F3], [F4], [F10] would satisfy ⟨et0,et0⟩=0 by [F9], contradicting [F8]. Thus exactly one alternative holds.

Depends on

Used by

Dependency tree · two levels

20 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