Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-08
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 restriction coproduct of the character χ(3,1) of S4

Example

Using the ordered-block restriction coproduct, the irreducible character χ(3,1) of S4 has components

Δ0,4(χ(3,1))=1⊗χ(3,1),Δ1,3(χ(3,1))=χ(1)⊗(χ(3)+χ(2,1)),Δ2,2(χ(3,1))=χ(2)⊗(χ(2)+χ(1,1))+χ(1,1)⊗χ(2),Δ3,1(χ(3,1))=(χ(3)+χ(2,1))⊗χ(1),Δ4,0(χ(3,1))=χ(3,1)⊗1.

Under Frobenius characteristic these are the five bidegree terms of ΔΛ(s(3,1))=∑μ⊆(3,1)sμ⊗s(3,1)/μ, where s(3,1)/(1)=s(3)+s(2,1),s(3,1)/(2)=s(2)+s(1,1),s(3,1)/(1,1)=s(2),s(3,1)/(3)=s(1),s(3,1)/(2,1)=s(1). At the identity of each Sa×S4−a the corresponding component has value 3=χ(3,1)(1).

Facts & Assumptions

Given: The partition (3,1), its irreducible character χ(3,1), the ordered-block restriction coproduct, and the inherited Littlewood–Richardson tableau convention.

[F1]

For a+b=n, Δa,b(f) is the restriction of f to the ordered block subgroup Sa×Sb, pulled back to that product; its endpoints are Δ0,n(f)=1⊗f and Δn,0(f)=f⊗1 (The restriction coproduct on the graded symmetric-group character ring).

[F2]

Under Frobenius characteristic, the coproduct is Schur skewing: ΔΛ(sλ)=∑μ⊆λsμ⊗sλ/μ, and its bidegree coefficients are the restriction multiplicities (The restriction coproduct is Schur skewing).

[F3]

The skew Schur function has expansion sλ/μ=∑νcμνλsν (The Littlewood–Richardson rule for products of Schur functions).

[F4]

cμνλ is the number of Littlewood–Richardson tableaux of shape λ/μ and content ν (Littlewood--Richardson tableaux and coefficients).

[F5]

The skew diagram is [λ]∖[μ] in English coordinates; semistandard entries weakly increase along rows and strictly increase down columns (Skew diagrams and semistandard skew tableaux).

[F6]

Partitions are weakly decreasing row lengths, μ⊆λ means diagram containment, the size is the number of nodes, and ∅ is the unique partition of zero (Partitions, English diagrams, and conjugation).

[F7]

The Specht module Sλ is defined from the column antisymmetrizer and its tabloid action; the Sλ form a complete irredundant list of irreducible complex representations of Sn, with character χλ (Column antisymmetrizers, polytabloids, and Specht modules, Specht modules classify the complex irreducibles of Sn).

[F8]

The Frobenius characteristic sends χλ to sλ (The characteristic of a Specht character is a Schur function).

[F9]

The standard polytabloids form a basis of Sλ, so dim⁡CSλ=fλ (Standard polytabloids form a basis of a complex Specht module).

[F10]

A character is the trace of the representing operator; in particular, its value at the identity is the dimension (The character χV(g)=tr⁡(ρV(g)) of a finite-dimensional complex representation).

[F12]

For irreducible characters of G and H, (χ⊠ψ)(g,h)=χ(g)ψ(h) (The character ring of a direct product is the tensor product of the factor character rings).

[F13]

Sn=Sym⁡({0,1,…,n−1}), and S0 is the trivial group (The finite symmetric group Sn, one-line notation, and cycle notation).

[F14]

A Littlewood–Richardson tableau is semistandard and has a top-to-bottom, right-to-left reading word that is a lattice word (Littlewood--Richardson tableaux and coefficients).

[F15]

The stable Schur function of the empty partition is s∅=1 (Stable Schur functions from bialternants).

[F16]

The Schur functions are orthonormal for the Hall form: ⟨sλ,sμ⟩H=δλμ (Schur functions form an orthonormal integral basis).

[F17]

For d=∣λ∣−∣μ∣≥0, sλ/μ=∑ν⊢d⟨sλ,sμsν⟩Hsν (Skew Schur functions by Hall adjointness).

[F18]

A standard tableau strictly increases along rows and columns (Tableaux and standard tableaux).

No form of the axiom of choice is used.

Verification

technique · enumerate subshapes and the small Littlewood–Richardson tableaux
1.1F5F6F13

The subpartitions of (3,1) are ∅,(1),(2),(1,1),(3),(2,1),(3,1): if the second row is empty, the first has length 0,1,2, or 3, and if it has length 1, the first has length 1,2, or 3. Their sizes give the first tensor-factor degrees 0,1,2,2,3,3,4; the corresponding skew diagrams are finite by [F5] and [F6]. The group convention is S4=Sym⁡({0,1,2,3}) by [F13].

1.2F3F4F5F14

For μ=(1), write the skew cells as A=(1,2), B=(1,3), and C=(2,1). Semistandardness requires A≤B and the reading word is B,A,C. Content (3) gives the unique filling A=B=C=1, whose word 111 is lattice. Content (2,1) gives exactly one semistandard lattice filling, A=B=1,C=2, with word 112; the other possible locations of the 2 either violate A≤B or make the word start with 2. For content (1,1,1), the distinct entries in the row must be one of (A,B)=(1,2),(1,3),(2,3), so in every semistandard filling the reading word starts with B≥2 and fails the first-prefix lattice inequality. Thus s(3,1)/(1)=s(3)+s(2,1).

1.3F3F4F5F14

For μ=(2), the two skew cells (1,3) and (2,1) have no row or column comparison, and their reading order is (1,3),(2,1). Content (2) has the unique filling 1,1, and content (1,1) has the unique lattice filling 1,2; the reversed filling has a word beginning with 2. Hence s(3,1)/(2)=s(2)+s(1,1). For μ=(1,1), the remaining cells (1,2),(1,3) satisfy the row inequality (1,2)≤(1,3) and are read in the reverse order. Content (2) gives one lattice filling, while the only semistandard filling of content (1,1) has word 2,1 and fails the lattice condition. Hence s(3,1)/(1,1)=s(2).

2.1F3F4F5F6F14F15F16F17step 1.1

For μ=(3) and μ=(2,1) the skew diagram consists of one box, so its sole filling has content (1) and its word is lattice, giving s(3,1)/(3)=s(1)=s(3,1)/(2,1) by [F3]–[F5] and [F14]. For the empty inner shape, [F17] and [F15] give s(3,1)/∅=∑ν⊢4⟨s(3,1),sν⟩Hsν=s(3,1) by orthonormality [F16]. For μ=(3,1), [F6] leaves only ν=∅ in [F17], and [F15]–[F16] give s(3,1)/(3,1)=⟨s(3,1),s(3,1)⟩Hs∅=1. These are all the remaining subshapes from step 1.1.

3.1F1F2F3F4F7F8F14step 1.1step 1.2step 1.3step 2.1

Applying the skewing formula [F2], expanding by [F3], using the tableau counts from [F4] and [F14] in steps 1.1–2.1, and translating sλ back to χλ by [F8] gives the terms grouped by first-factor degree: Δ0,4=1⊗χ(3,1), Δ1,3=χ(1)⊗(χ(3)+χ(2,1)), Δ2,2=χ(2)⊗(χ(2)+χ(1,1))+χ(1,1)⊗χ(2), Δ3,1=(χ(3)+χ(2,1))⊗χ(1), and Δ4,0=χ(3,1)⊗1, as stated; the character labels are those of the Specht modules in [F7], and the endpoint factors use [F1].

4.1F9F10F11F12F18step 3.1∎

Let fλ count standard tableaux. The one-row and one-column shapes each have one standard tableau by [F18], so f(1)=f(2)=f(1,1)=f(3)=1. Removing the largest entry gives f(2,1)=f(2)+f(1,1)=2 and f(3,1)=f(2,1)+f(3)=3: the largest entry is at a removable corner by [F18], and deletion and addition there are inverse operations. Thus [F9] gives dimensions 3,1,2,1,1,1 for (3,1),(3),(2,1),(2),(1,1),(1). By [F10], [F11], and [F12], the five component values at the identity are 3, 1(1+2)=3, 1(1+1)+1⋅1=3, (1+2)1=3, and 3, respectively; this also verifies the empty-factor endpoints. The enumeration is finite and uses no choice.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

89 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