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

Multiplicity-free complex Specht induction

Statement

Let n≥0 and λ⊢n, let Sn≤Sn+1 be the subgroup of permutations of {1,…,n+1} fixing n+1 (The symmetric group Sym⁡(X): the bijections of a set X under composition), and let Ind⁡SnSn+1SCλ be the induced CSn+1-module of the complex Specht module SCλ (The induced R-linear G-module Ind⁡HGW as H-covariant functions on G, Column antisymmetrizers, polytabloids, and Specht modules). Then Ind⁡SnSn+1SCλ≅⨁y∈Add⁡(λ)SCλ+y, where Add⁡(λ) is the set of addable nodes of the Young diagram [λ] and λ+y is the unique partition with [λ+y]=[λ]∪{y} (Removable and addable nodes). Each summand occurs exactly once; equivalently, for every ν⊢n+1 the multiplicity of SCν in Ind⁡SnSn+1SCλ is 1 when ν=λ+y for some addable node y of [λ], and 0 otherwise. In particular, for n=0 this reads Ind⁡S0S1SC∅≅SC(1).

Facts & Assumptions

Given: an integer n≥0, a partition λ⊢n, the finite groups H:=Sn≤G:=Sn+1 with H acting as the permutations of {1,…,n} extended by n+1↦n+1, and the complex Specht modules SCμ for μ⊢n and SCν for ν⊢n+1.

[F1]

For a commutative ring R, a finite group G, a subgroup H≤G and an R-linear H-module W, the induced module is Ind⁡HGW={f:G→W:f(gh)=h−1⋅f(g) for all g∈G,h∈H} with (x⋅f)(g)=f(x−1g); it is an R-linear G-module, and when G is finite and W is finite-dimensional over R it is finite-dimensional over R (The induced R-linear G-module Ind⁡HGW as H-covariant functions on G).

[F2]

For a finite group G, a subgroup H≤G, an H-module W and a G-module V there is a natural isomorphism Hom⁡G(Ind⁡HGW,V)≅Hom⁡H(W,Res⁡HGV) (Induction is left adjoint to restriction for finite-group modules over a commutative ring).

[F3]

For m≥1, ν⊢m and the subgroup Sm−1≤Sm of permutations fixing m, there is an isomorphism of CSm−1-modules Res⁡Sm−1SmSCν≅⨁x∈Rem⁡(ν)SCν−x, each summand occurring once (The complex Specht restriction branching rule, Removable and addable nodes).

[F4]

For every m≥0 the modules {SCμ:μ⊢m} form a complete irredundant list, up to isomorphism, of the finite-dimensional irreducible complex Sm-representations (Specht modules classify the complex irreducibles of Sn).

[F5]

A nonzero intertwiner between irreducible representations is an isomorphism, and over the algebraically closed field C every endomorphism of an irreducible representation is a scalar; hence for partitions ρ,τ⊢m the space Hom⁡Sm(SCρ,SCτ) is C id when ρ=τ and is 0 otherwise (Schur's lemma for irreducible representations: a nonzero intertwiner is an isomorphism, and End⁡G(V) is a division ring, Over an algebraically closed field, every endomorphism of an irreducible representation is scalar).

[F6]

Every finite-dimensional complex representation of a finite group is completely reducible, so it is a direct sum of finitely many irreducible subrepresentations; this is Maschke's theorem in characteristic 0 (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, A completely reducible representation as a finite direct sum of irreducible subrepresentations).

[F7]

For a completely reducible representation, the isotypic component V(S) is the sum of all irreducible subrepresentations equivalent to S, only the equivalence class of S matters, and V is the direct sum of its isotypic components, a decomposition that is independent of the chosen decomposition of V into irreducibles (The isotypic component of a completely reducible representation, The isotypic decomposition of a completely reducible representation is unique).

[F8]

A node x∈[ν] is removable when [ν]∖{x}=[ν−x] for a partition ν−x of m−1, which is then unique, and a point y∉[λ] is addable for λ when [λ]∪{y}=[λ+y] for a partition λ+y of n+1, which is then unique (Removable and addable nodes).

[F9]

For μ⊢k the complex Specht module SCμ is the span of the polytabloids inside the tabloid module MCμ, which has finitely many tabloids of shape μ as a basis; hence SCμ is a finite-dimensional complex Sk-module (Column antisymmetrizers, polytabloids, and Specht modules, Young subgroups, tabloids, and permutation modules).

No form of the Axiom of Choice is used: G is finite, all direct sums are finite, and the corresponding statements of [F3] and [F4] are themselves choice-free.

Proof

technique · constructive
1.1givenF1F9

Put m:=n+1≥1, G:=Sn+1, H:=Sn and W:=SCλ; by [F1] the induced module Ind⁡HGW is a finite-dimensional complex G-module, and by [F9] for every ν⊢m the modules SCν and, for every x, SCν−x are finite-dimensional complex representations of G and of H respectively.

1.2F4F8

The right-hand module ⨁y∈Add⁡(λ)SCλ+y is a finite direct sum of irreducible G-modules with multiplicity exactly 1 at those ν of the form ν=λ+y and multiplicity 0 at all other ν: the addable nodes y of [λ] give pairwise distinct partitions λ+y and hence pairwise non-isomorphic summands by [F4] and [F8].

2.1F2step 1.1

For every ν⊢m, the adjunction [F2] with R=C gives a C-linear isomorphism Hom⁡G(Ind⁡HGW,SCν)≅Hom⁡H(W,Res⁡HGSCν).

2.2F3step 1.1

For every ν⊢m the restriction rule [F3] applies with its parameter equal to m≥1, so Res⁡HGSCν≅⨁x∈Rem⁡(ν)SCν−x; composing with this isomorphism and splitting a homomorphism into a direct sum into its finitely many components gives Hom⁡H(W,Res⁡HGSCν)≅⨁x∈Rem⁡(ν)Hom⁡Sn(SCλ,SCν−x).

2.3F4F5step 1.1

For each x∈Rem⁡(ν) the summand Hom⁡Sn(SCλ,SCν−x) is one-dimensional when ν−x=λ and is zero otherwise: both arguments are irreducible complex Sn-modules and the partitions λ and ν−x of n are either equal or distinct, so [F5] applies.

2.4F4F5F6step 1.1

By [F6] the module Ind⁡HGW is completely reducible, so it is isomorphic to a finite direct sum ⨁ν⊢m(SCν)⊕mν for nonnegative integers mν; [F4] makes the indexing complete and irredundant, and [F5] together with additivity of Hom⁡ in each argument gives mν=dim⁡CHom⁡G(SCν,Ind⁡HGW)=dim⁡CHom⁡G(Ind⁡HGW,SCν).

3.1step 2.1step 2.2step 2.3algebra

Steps 2.1, 2.2 and 2.3 combine to dim⁡CHom⁡G(Ind⁡HGW,SCν)=#{x∈Rem⁡(ν):ν−x=λ}.

4.1F8step 3.1constructalgebra

The set {x∈Rem⁡(ν):ν−x=λ} is in bijection with {y∈Add⁡(λ):λ+y=ν} by the identity map on nodes: if x is removable with [ν]∖{x}=[λ], then y:=x is a point outside [λ] with [λ]∪{y}=[ν] a Young diagram, so y is addable for λ and λ+y=ν; conversely if y is addable with [λ]∪{y}=[ν], then x:=y lies in [ν] with [ν]∖{x}=[λ] a Young diagram, so x is removable for ν and ν−x=λ. Hence by step 3.1 the dimension dim⁡CHom⁡G(Ind⁡HGW,SCν) equals 1 if ν=λ+y for some addable node y of [λ], and equals 0 otherwise.

5.1F6F7step 4.1step 2.4step 1.2

By step 2.4 and step 4.1 the multiplicities of Ind⁡HGW are 1 exactly at the partitions ν=λ+y with y addable for λ and 0 at all other ν⊢m; by step 1.2 the module ⨁ySCλ+y has the same multiplicities, and both modules are completely reducible by [F6]. Grouping each module into its isotypic components, which by [F7] are determined by the multiplicities alone, gives the asserted isomorphism Ind⁡SnSn+1SCλ≅⨁y∈Add⁡(λ)SCλ+y with each summand occurring once.

6.1F8step 5.1givenalgebradischarge-construct∎

Boundary and consistency check. For n=0 one has λ=∅, H=S0={1} and m=1; the single partition ν=(1) has the single removable node x=(1,1) with ν−x=∅=λ, while Add⁡(∅)={(1,1)} by [F8], so step 5.1 gives Ind⁡S0S1SC∅≅SC(1); every partition λ⊢n with n≥1 has at least the addable node opening a new row, so the displayed direct sum is never empty in that case, and the theorem uses the finite groups Sn, Sn+1 and finitely many partitions throughout, invoking no choice principle. This proves the Statement.

Remarks

  • Consistency of dimensions. For λ=(2,1)⊢3 the theorem reads Ind⁡S3S4SC(2,1)≅SC(3,1)⊕SC(2,2)⊕SC(2,1,1), and the standard tableaux counts f(3,1)=3, f(2,2)=2, f(2,1,1)=3 give 3+2+3=8=4⋅2=[S4:S3] f(2,1), as they must. Similarly Ind⁡S3S4SC(3)≅SC(4)⊕SC(3,1) with 1+3=4=4⋅1.

  • Where semisimplicity enters. Both the complete reducibility of the induced module (step 2.4) and the splitting of the restriction filtration used in [F3] require Maschke's theorem over C; the multiplicity-free statement above is therefore a characteristic-zero result. The corresponding statement over fields of positive characteristic is a different theorem, and the two directions of the rule are mirror images of one another along the add/remove-one-node correspondence of step 4.1.

Depends on

Used by

Dependency tree · two levels

57 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