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

The complex Specht restriction branching rule

Statement

Let n≥1, let λ⊢n with Young diagram [λ], and let x1,…,xm be the removable corners of [λ], listed from top to bottom, so that λ(i)=λ−xi⊢n−1 is the partition obtained by deleting xi (Ordered removable corners and tabloid deletion maps). Then there is an isomorphism of CSn−1-modules Res⁡Sn−1SnSCλ≅SCλ(1)⊕⋯⊕SCλ(m), the restriction being along the subgroup Sn−1≤Sn of permutations fixing n (The sign representation of Sn and the restriction Res⁡HG(V) of a representation to a subgroup). Equivalently, for every μ⊢n−1 the multiplicity of SCμ as a summand of Res⁡Sn−1SnSCλ equals the number of removable corners x of [λ] with λ−x=μ, so it is 0 or 1; in particular each SCλ(i) occurs exactly once.

Facts & Assumptions

Given: an integer n≥1, a partition λ⊢n, its removable corners x1,…,xm from top to bottom with λ(i)=λ−xi, and the restricted complex Specht module Res⁡Sn−1SnSCλ.

[F1]

There is a filtration by Sn−1-submodules 0=V0⊊V1⊊⋯⊊Vm=SCλ with Vi/Vi−1≅SCλ(i) for every 1≤i≤m; this holds over every field and in particular over C (Specht restriction has a removable-corner filtration over every field, Ordered removable corners and tabloid deletion maps).

[F2]

The complex Specht modules SCμ, μ⊢n−1, form a complete irredundant list of the finite-dimensional irreducible complex Sn−1-representations (Specht modules classify the complex irreducibles of Sn).

[F3]

Maschke's theorem: if G is a finite group, k a field with char⁡k∤∣G∣, and W≤V a subrepresentation of a finite-dimensional representation of G over k, then there is a subrepresentation U≤V with V=W⊕U; consequently every finite-dimensional representation of such a group is completely reducible (Maschke's theorem for finite groups over fields whose characteristic does not divide ∣G∣, If char⁡k∤∣G∣, every finite-dimensional representation of G is completely reducible).

[F4]

The partition λ(i)=λ−xi is obtained by deleting a distinct corner for each i, so λ(i)=λ(j) happens only for i=j; consequently the multiplicities in a direct sum of the SCλ(i) are 0 or 1 (Ordered removable corners and tabloid deletion maps).

[F5]

If V=W⊕U and both are finite-dimensional, the projection V→V/W restricts to an isomorphism U→V/W (First isomorphism theorem for vector spaces: V/ker⁡T is isomorphic to im⁡T).

Proof

technique · constructive
1.1F1F3construct

[construct] By [F1] there is a chain of Sn−1-submodules 0=V0⊊V1⊊⋯⊊Vm=SCλ whose successive quotients are Vi/Vi−1≅SCλ(i). Since char⁡C=0 does not divide ∣Sn−1∣=(n−1)!, [F3] applies to each subrepresentation Vi−1≤Vi: there is an Sn−1-submodule Ui≤Vi with Vi=Vi−1⊕Ui.

2.1F5step 1.1algebra

By [F5] the projection Vi→Vi/Vi−1 restricts to an Sn−1-isomorphism Ui→Vi/Vi−1; composing with the isomorphism of step 1.1 gives an Sn−1-isomorphism Ui≅SCλ(i).

2.2F1step 1.1algebra

Since V0=0 we have V1=U1, and Vi=Vi−1⊕Ui for every i by step 1.1, so SCλ=Vm=U1⊕U2⊕⋯⊕Um; in particular dim⁡CSCλ=∑i=1mdim⁡CUi.

3.1F2F4step 2.1step 2.2algebra

Combining steps 2.1 and 2.2 gives the asserted CSn−1-isomorphism Res⁡Sn−1SnSCλ≅SCλ(1)⊕⋯⊕SCλ(m). By [F2] the irreducible summands of a decomposition into Specht modules are classified up to isomorphism by their shapes, and by [F4] the shapes λ(i) are pairwise distinct, so each SCλ(i) occurs exactly once and, for μ⊢n−1, the multiplicity of SCμ is the number of corners x with λ−x=μ. This proves the Statement.

4.1F1F3F4givenstep 3.1discharge-construct∎

Boundary and choice audit. For n=1 one has λ=(1), m=1, x1 the unique box, λ(1)=∅ and SC∅=C, so the isomorphism reads Res⁡S0S1SC(1)≅SC∅, both sides being the one-dimensional trivial representation of the trivial group; the filtration has length one and no splitting choice is needed beyond U1=V1. If λ is a row or a column there is exactly one removable corner and the restriction is irreducible; in general m is the finite number of removable corners of λ. The complement Ui furnished by [F3] is produced by averaging over the finite group Sn−1 and involves no choice principle, and by step 3.1 the isomorphism type of the resulting direct sum does not depend on those complements. This proves the corollary.

Remarks

  • Over other fields the splitting can fail. The corollary uses characteristic zero through Maschke's theorem for Sn−1; over a field F of positive characteristic the filtration of Specht restriction has a removable-corner filtration over every field need not split, and the restriction of a Specht module can be a nonsplit extension of its removable-corner factors.

  • Two extreme shapes. The one-row diagram (n) has the single removable corner (1,n) and the one-column diagram (1n) has the single removable corner (n,1), so the corollary gives Res⁡SC(n)≅SC(n−1) and Res⁡SC(1n)≅SC(1n−1): each of the two extremes restricts to the corresponding extreme shape with exactly one summand.

Depends on

Used by

Dependency tree · two levels

41 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