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 outer product of S(3,2) and S(2)

Statement

As complex S7-modules,

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

The five summands are the shapes obtained from (3,2) by adding a horizontal 2-strip: the added node pairs lie in columns {4,5}, {3,4}, {1,4}, {1,3}, and {1,2}, respectively. The dimension check is [S7:S5×S2]⋅dim⁡S(3,2)⋅dim⁡S(2)=21⋅5⋅1=105=14+14+35+21+21. This is the classical computation [3,2][2]=[5,2]+[4,3]+[4,2,1]+[3,3,1]+[3,2,2].

Facts & Assumptions

Given: The partitions (3,2) and (2) and the outer induction product for symmetric-group Specht modules.

[F1]

The outer Pieri rule states that induction with the trivial Specht factor S(r) is the multiplicity-one direct sum over horizontal r-strips, including the empty-strip case when r=0 (Outer Pieri rules for a trivial or sign factor).

[F2]

The outer product f∘g is induction from the block subgroup Sm×Sn≤Sm+n; in the one-based realization, the second block is {m+1,…,m+n} (The outer induction product of symmetric-group characters).

[F3]

Partitions are weakly decreasing row lengths, and μ⊆λ means [μ]⊆[λ] in the English Young-diagram coordinates (Partitions, English diagrams, and conjugation).

[F4]

A horizontal strip has at most one added box in each column (Skew diagrams and semistandard skew tableaux).

[F5]

The global convention is St=Sym⁡({0,…,t−1}) with composition acting right to left (The finite symmetric group Sn, one-line notation, and cycle notation).

[F6]

A group homomorphism preserves products (Monoid homomorphism and group homomorphism).

[F7]

Induced modules are covariant functions satisfying F(gh)=h−1⋅F(g), with left translation action (The induced R-linear G-module Ind⁡HGW as H-covariant functions on G).

[F8]

Specht modules are spanned by polytabloids eT=κT{T} in tabloid modules, with the left permutation action; the tabloid classes form a basis (Column antisymmetrizers, polytabloids, and Specht modules, Young subgroups, tabloids, and permutation modules).

[F9]

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).

[F10]

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).

[F11]

For finite-dimensional complex vector spaces V,W, dim⁡(V⊗CW)=(dim⁡V)(dim⁡W) (Rm⊗RRn≅Rmn with the product basis, and dim⁡F(V⊗FW)=dim⁡FV dim⁡FW).

[F12]

A standard tableau fills [λ] bijectively with 1,…,∣λ∣ and its entries strictly increase along each row and column; fλ denotes their number (Tableaux and standard tableaux).

Proof

technique · direct
1.1F2F5F6F7F8

For each t, put Gt0=Sym⁡({0,…,t−1}) and Gt1=Sym⁡({1,…,t}), and let βt(i)=i+1 and ct(σ)=βtσβt−1, with the unique empty bijection for t=0. The map ct is a group isomorphism because it is bijective and ct(στ)=ct(σ)ct(τ) by [F6]. For a+b=t, ct−1 carries the one-based block subgroup in [F2] to the zero-based block subgroup in [F5]. Relabeling every entry of a tableau by βt sends its tabloid to the corresponding tabloid and conjugates its row and column stabilizers; inversion pairs, hence permutation signs, are preserved by the shift. Thus it sends each polytabloid to the relabeled polytabloid by [F8] and intertwines the Specht actions. If H1≤Gt1 and H0=ct−1(H1), pull an H1-module W back by h⋅0w=ct(h)⋅1w. The induced-function map F1↦F0, F0(g)=F1(ct(g)), preserves covariance since F0(gh)=ct(h)−1⋅1F0(g)=h−1⋅0F0(g), and it intertwines left translation because ct(g0−1g)=ct(g0)−1ct(g). Hence the one-based outer-product and Specht-module calculation transports to the global zero-based convention.

1.2F3F9F12algebra

Let fλ count standard tableaux of shape λ. In a nonempty standard tableau the largest entry lies in a removable corner: a node with a node to its right or below would have to carry a larger entry by [F12]. Deleting that largest entry gives a bijection with the disjoint union of standard tableaux on the shapes obtained by deleting one removable corner; conversely, appending the largest entry at any removable corner reverses the deletion. Hence f∅=1 and fλ=∑x∈Rem⁡(λ)fλ−x. The one-row and one-column shapes each have one standard tableau, and the recurrence gives f(2,1)=f(2)+f(1,1)=1+1=2, f(3,1)=f(2,1)+f(3)=2+1=3, f(4,1)=f(3,1)+f(4)=3+1=4, f(5,1)=f(4,1)+f(5)=4+1=5, f(2,2)=f(2,1)=2, f(3,2)=f(2,2)+f(3,1)=2+3=5, f(4,2)=f(3,2)+f(4,1)=5+4=9, f(5,2)=f(4,2)+f(5,1)=9+5=14, f(3,3)=f(3,2)=5, f(4,3)=f(3,3)+f(4,2)=5+9=14, f(1,1,1)=1, f(2,1,1)=f(1,1,1)+f(2,1)=1+2=3, f(3,1,1)=f(2,1,1)+f(3,1)=3+3=6, f(4,1,1)=f(3,1,1)+f(4,1)=6+4=10, f(2,2,1)=f(2,1,1)+f(2,2)=3+2=5, f(3,2,1)=f(2,2,1)+f(3,1,1)+f(3,2)=5+6+5=16, f(2,2,2)=f(2,2,1)=5, f(4,2,1)=f(3,2,1)+f(4,1,1)+f(4,2)=16+10+9=35, f(3,3,1)=f(3,2,1)+f(3,3)=16+5=21, and f(3,2,2)=f(3,2,1)+f(2,2,2)=16+5=21. By [F9], the input dimensions are 5 and 1, and the five output dimensions are 14,14,35,21,21.

2.1F1F2step 1.1

The second factor S(2) is the trivial Specht module, so the outer Pieri rule [F1], with the block induction convention [F2] and the label bridge in step 1.1, expresses the induced module as the multiplicity-one sum over all partitions λ⊢7 containing (3,2) for which λ/(3,2) is a horizontal 2-strip.

2.2F2F10F11step 1.2

In the one-based block model of [F2], H=S5×S2 stabilizes B={6,7}. The map from left cosets gH to two-element subsets g(B) is a bijection: H is exactly the setwise stabilizer of B, and permutations act transitively on two-element subsets. Hence [S7:H]=(72)=21. By [F10] and [F11], the dimension of the induced module is 21⋅5⋅1=105 using the input dimensions from step 1.2; the output dimensions in that step sum to 14+14+35+21+21=105.

3.1F3F4step 2.1

If λ⊢7 contains (3,2), then λ1≥λ2≥2 and λ1≥3. The case λ2≥4 is impossible because the first two rows would contain at least eight nodes. If λ2=3, the only possibilities are (4,3) and (3,3,1). If λ2=2, the remaining nodes give (5,2), (4,2,1), (3,2,2), or (3,2,1,1). The added nodes in these six cases are respectively in columns {4,3}, {3,1}, {4,5}, {4,1}, {1,2}, and {1,1}. By [F4], exactly the last shape fails the horizontal-strip condition. Thus the five valid shapes are precisely (5,2),(4,3),(4,2,1),(3,3,1),(3,2,2), with the column pairs stated.

4.1F1step 2.1step 2.2step 3.1∎

Step 2.1 gives the induction decomposition over horizontal strips, and step 3.1 lists exactly the five such strips, each with multiplicity one. This proves the displayed module isomorphism; step 2.2 verifies its dimension independently and the result agrees with James's classical computation.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

48 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