Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedaudited 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.

An outer-induction multiplicity greater than one

Statement

Let μ=(2,1) and ν=(3,1). Then, as a complex S7-module,

Ind⁡S3×S4S7(S(2,1)⊠S(3,1))≅S(5,2)⊕S(5,1,1)⊕S(4,3)⊕(S(4,2,1))⊕2⊕S(4,1,1,1)⊕S(3,3,1)⊕S(3,2,2)⊕S(3,2,1,1).

The multiplicity of S(4,2,1) is c(2,1),(3,1)(4,2,1)=2, realized by the two LR tableaux of shape (4,2,1)/(2,1) and content (3,1) with their single entry 2 at (2,2) and (3,1), respectively; their reading words are 1,1,2,1 and 1,1,1,2. The dimension check is

[S7:S3×S4]⋅dim⁡S(2,1)⋅dim⁡S(3,1)=35⋅2⋅3=210=14+15+14+2⋅35+20+21+21+35.

Facts & Assumptions

Given: μ=(2,1), ν=(3,1), and ∣λ∣=7.

[F1]

In English coordinates, [λ]={(i,j):1≤i, 1≤j≤λi}; for μ=(2,1), containment [μ]⊆[λ] is equivalent to λ1≥2 and λ2≥1 (Partitions, English diagrams, and conjugation).

[F2]

Content (3,1) requires exactly three entries 1 and one entry 2 (Semistandard tableaux and Kostka numbers).

[F3]

The skew diagram [λ/μ] is [λ]∖[μ]; semistandard skew tableaux are weakly increasing along rows and strictly increasing down columns (Skew diagrams and semistandard skew tableaux).

[F4]

An LR tableau is semistandard and its reading word, read right-to-left within each row from top to bottom, has every prefix containing at least as many i's as (i+1)'s. The LR coefficient counts these tableaux and is zero unless μ⊆λ and ∣λ∣=∣μ∣+∣ν∣ (Littlewood--Richardson tableaux and coefficients).

[F5]

The outer induction product is induction from the subgroup preserving the first and second blocks of sizes m and n in Sm+n (The outer induction product of symmetric-group characters).

[F6]

For all partitions α,β, the induced external product decomposes as ⨁λ⊢∣α∣+∣β∣(Sλ)⊕cαβλ; in particular the multiplicity of Sλ is cαβλ (The outer Littlewood–Richardson rule).

[F7]

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

[F8]

For a finite group G, subgroup H, and finite-dimensional H-module W, dim⁡Ind⁡HGW=[G:H]dim⁡W (The dimension of an induced finite-dimensional representation is [G:H]dim⁡W).

[F9]

Bases of two finite-dimensional vector spaces give the tensor-product basis of their tensor product, so dim⁡(V⊗W)=dim⁡(V)dim⁡(W) (The elementary tensors of two bases form the product basis of the tensor product).

[F10]

The library defines S7 as the permutations of {0,1,…,6} (The finite symmetric group Sn, one-line notation, and cycle notation).

[F11]

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

Proof

technique · direct enumeration and dimension check
1.1F1F4

Listing the partitions of 7 and retaining those with λ1≥2 and λ2≥1 from [F1] gives (6,1),(5,2),(5,1,1),(4,3),(4,2,1),(4,1,1,1),(3,3,1),(3,2,2),(3,2,1,1),(3,1,1,1,1),(2,2,2,1),(2,2,1,1,1),(2,1,1,1,1,1). The two remaining partitions of 7, (7) and (17), do not contain μ and have coefficient zero by [F4].

1.2F1F7F11

Let fλ count standard tableaux. In every nonempty standard tableau the largest entry is at a removable corner, that is, a node with no box to its right or below, by [F11]; deleting it leaves a partition and gives a bijection with the standard tableaux of the predecessor shapes, while appending the largest entry at any removable corner reverses the deletion. Thus f∅=1 and fλ=∑x∈Rem⁡(λ)fλ−x. The one-row and one-column shapes each have count 1. Repeated application gives f(2,1)=1+1=2, f(3,1)=2+1=3, f(4,1)=3+1=4, f(5,1)=4+1=5, f(2,2)=2, f(3,2)=2+3=5, f(4,2)=5+4=9, f(5,2)=9+5=14, f(3,3)=5, f(4,3)=5+9=14, f(1,1,1)=1, f(2,1,1)=1+2=3, f(3,1,1)=3+3=6, f(4,1,1)=6+4=10, f(2,2,1)=3+2=5, f(3,2,1)=5+6+5=16, f(2,2,2)=5, f(2,1,1,1)=1+3=4, f(2,2,1,1)=4+5=9, f(3,1,1,1)=4+6=10, f(4,1,1,1)=10+10=20, f(5,1,1)=10+5=15, f(4,2,1)=16+10+9=35, and f(3,2,1,1)=9+10+16=35. By [F7], the input dimensions are 2,3 and the eight summand dimensions in statement order are 14,15,14,35,20,21,21,35, where f(3,3,1)=16+5=21 and f(3,2,2)=16+5=21.

2.1F2F3step 1.1

Each retained skew diagram has four boxes, so by [F2] a filling is determined by the position of its unique 2. Checking the row and column inequalities [F3], the semistandard positions for that 2, in the same order as step 1.1, are {(1,6)}; {(1,5),(2,2)}; {(1,5),(3,1)}; {(2,3)}; {(1,4),(2,2),(3,1)}; {(4,1)}; {(2,3)}; {(3,2)}; {(4,1)}; the last four shapes admit no semistandard filling. In (4,1,1,1)/(2,1), (3,2,2)/(2,1) and (3,2,1,1)/(2,1), the column with two skew boxes forces the 2 into its lower box, respectively (4,1), (3,2) and (4,1). For (3,1,1,1,1), (2,2,1,1,1) and (2,15) a column has at least three boxes, which cannot be strictly filled with only 1's and 2's; for (2,2,2,1) each of columns 1 and 2 forces a separate 2.

3.1F4step 1.1step 2.1

For a word with one 2 and three 1's, the lattice condition in [F4] holds exactly when at least one 1 is read before the 2: after that first 1, every prefix has at least as many 1's as 2's, and no letters exceed 2. Removing the first-read top-right position from the semistandard-position lists in step 2.1 when it occurs, the LR-valid 2-positions are (5,2):(2,2), (5,1,1):(3,1), (4,3):(2,3), (4,2,1):(2,2),(3,1), (4,1,1,1):(4,1), (3,3,1):(2,3), (3,2,2):(3,2), and (3,2,1,1):(4,1). Thus the coefficients in the order of step 1.1 are 0,1,1,1,2,1,1,1,1,0,0,0,0, with zero also for (7) and (17).

4.1F4F6step 3.1

Applying the outer Littlewood–Richardson theorem [F6] to the coefficient list in step 3.1 gives exactly the direct sum in the Statement; all other partitions of 7 have coefficient zero. In particular, the two LR-valid positions (2,2) and (3,1) for (4,2,1) yield c(2,1),(3,1)(4,2,1)=2.

5.1F5F8F9F10step 4.1step 1.2∎

By [F10] the global S7 acts on {0,1,…,6}, while [F5] gives the one-based block realization. The shift β(i)=i+1 is a bijection from {0,1,…,6} to {1,2,…,7}; σ↦βσβ−1 preserves products and carries the initial three-letter block to A={1,2,3}, so it preserves the subgroup index. In the one-based realization the block subgroup H stabilizes A, and the map from its left cosets gH to the images g(A) is a bijection with the three-element subsets: every such subset is an image of A under a permutation (extend bijections on A and its four-element complement), and if g(A)=g′(A) then g−1g′ preserves A and lies in H, so gH=g′H. Hence [S7:S3×S4]=(73)=7⋅6⋅53⋅2⋅1=35. By [F8] and [F9], the induced module has dimension 35⋅(2⋅3)=210. Step 4.1 and the dimensions in step 1.2 give the right-hand side dimension 14+15+14+2⋅35+20+21+21+35=210. The LR enumeration and coset bijection are finite; any left transversal in [F8] is obtained by finitely many selections, which does not require the axiom of choice.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

44 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