Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

Schur-Weyl decomposition of (C^2)^tensor3

Statement

Let V=C2 with fixed basis e1,e2, let E=V⊗3 carry the commuting left place action of S3 and diagonal action of GL⁡(V) (Commuting symmetric-group and linear actions on a tensor power), and for λ⊢3 put Mλ:=Hom⁡S3(Sλ,E), with GL⁡(V) acting by postcomposition. Then:

  1. (Decomposition.) There is an isomorphism of (S3×GL⁡(V))-modules E≅S(3)⊗M(3)⊕S(2,1)⊗M(2,1), and M(1,1,1)=0: the shape (1,1,1) is absent, in agreement with the length cutoff ℓ((1,1,1))=3>2=dim⁡V.
  2. (The trivial factor.) S(3) is the one-dimensional trivial representation of S3, the fixed space ES3 is four-dimensional with basis e1⊗3,∑σ∈S3σ⋅(e1⊗e1⊗e2),∑σ∈S3σ⋅(e1⊗e2⊗e2),e2⊗3, and evaluation at a generator of S(3) identifies M(3)≅ES3 as GL⁡(V)-modules. Writing Sym⁡3(C2):=ES3 with the corresponding basis x3,x2y,xy2,y3, the decomposition reads E≅S(3)⊗Sym⁡3(C2)⊕S(2,1)⊗M(2,1).
  3. (Dimensions and highest weight.) dim⁡CM(3)=4 and dim⁡CM(2,1)=2, so dim⁡CE=8=1⋅4+2⋅2; the two standard (2,1)-tableaux give dim⁡CS(2,1)=2, and M(2,1) has highest weight (2,1), while M(3) has highest weight (3).

Facts & Assumptions

Given: the complex vector space V=C2 with basis e1,e2, the module E=V⊗3 with its commuting S3- and GL⁡(V)-actions, and the multiplicity spaces Mλ=Hom⁡S3(Sλ,E) for λ⊢3.

[F1]

The place action of S3 on E is a linear left action and g↦g⊗3 is the diagonal GL⁡(V)-action, which commutes with it; the diagonal infinitesimal operator is Δ(X)=∑a=131⊗(a−1)⊗X⊗1⊗(3−a) (Commuting symmetric-group and linear actions on a tensor power).

[F2]

The eight elementary tensors ei⊗ej⊗ek with i,j,k∈{1,2} form a basis of E, so dim⁡CE=23=8 (The elementary tensors of two bases form the product basis of the tensor product, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).

[F3]

For d=dim⁡CV=2 the Schur-Weyl decomposition reads E≅⨁λ⊢3, ℓ(λ)≤2Sλ⊗Mλ; for every λ⊢3 with ℓ(λ)≤2 the space Mλ is nonzero and irreducible over B=span⁡C{g⊗3} and has highest weight λ, while ℓ(λ)>2 forces Mλ=0 (Schur-Weyl decomposition and highest weights).

[F4]

For λ⊢3 with ℓ(λ)≤2, the multiplicity space Mλ contains the nonzero map φ=Φ∣Sλ with Δ(Eii)∘φ=λiφ for every i (with λi:=0 for i>ℓ(λ)) and Δ(E12)∘φ=0; if Mλ is irreducible over B, then λ is its unique highest weight (The row-labelled polytabloid map has highest weight lambda).

[F5]

For every λ⊢3 the standard polytabloids form a C-basis of Sλ, so dim⁡CSλ=fλ, the number of standard λ-tableaux (Standard polytabloids form a basis of a complex Specht module, Tableaux and standard tableaux).

[F6]

For a partition λ the tabloids of shape λ form a basis of Mλ=C(Ωλ) on which Sn acts by σ⋅{t}={σ⋅t}. For λ=(3) the set Ω(3) has the single element {t}={1,2,3}, so M(3) is one-dimensional and every σ∈S3 acts trivially (Young subgroups, tabloids, and permutation modules).

[F7]

The polytabloid of a tableau t is et=κt⋅{t} with κt=∑γ∈Ctsgn⁡(γ)γ, and Sλ=span⁡C{es:s a λ-tableau}; the column stabilizer of a one-row tableau is trivial, so et={t} there (Column antisymmetrizers, polytabloids, and Specht modules).

[F8]

The standard tableaux of shape (3) are the single tableau 1 2 3, and the standard tableaux of shape (2,1) are 123 and 132; hence f(3)=1 and f(2,1)=2 (Tableaux and standard tableaux).

[F9]

The partitions of 3 are (3) with ℓ=1, (2,1) with ℓ=2 and (1,1,1) with ℓ=3 (Partitions, English diagrams, and conjugation).

No form of the Axiom of Choice is used: the space V has an explicit finite basis, the group S3 is finite and explicit, and all decompositions below are finite.

Proof

technique · direct
1.1givenF1F2

By [F2] the elementary tensors ei⊗ej⊗ek form a basis of E, so dim⁡CE=8, and by [F1] the place action only permutes this basis: σ⋅(ei⊗ej⊗ek) is again an elementary tensor, with the three basis vectors permuted among the positions.

1.2F6F7given

For λ=(3) the module M(3) has the single tabloid {1,2,3} as basis, so it is one-dimensional and every σ∈S3 fixes that tabloid; by [F7] the column stabilizer of the one-row tableau t is trivial, so et={t} and S(3)=span⁡{es}=C{t}=M(3). Hence S(3) is the one-dimensional trivial representation, and et is a nonzero fixed vector that generates S(3).

1.3F3F9given

By [F9] the partitions of 3 with ℓ(λ)≤2 are (3) and (2,1), while ℓ((1,1,1))=3>2=dim⁡V; by [F3] therefore E≅S(3)⊗M(3)⊕S(2,1)⊗M(2,1) with M(1,1,1)=0, and both M(3) and M(2,1) are nonzero and irreducible over B.

1.4F5F8

By [F5] and the standard tableaux enumerated in [F8], dim⁡CS(3)=f(3)=1 and dim⁡CS(2,1)=f(2,1)=2; the two standard (2,1)-tableaux of [F8] are the two ways 123 and 132 of placing the entries while increasing along rows and down columns, so f(2,1)=2 is verified directly.

2.1step 1.1F1F2algebra

Compute the fixed space. An element x=∑i,j,k∈{1,2}cijk ei⊗ej⊗ek is fixed by S3 exactly when its coefficient function is constant on every orbit of S3 acting by permutation of the three positions, because [F2] makes these basis vectors linearly independent; the orbits are the four multisets {1,1,1}, {1,1,2}, {1,2,2}, {2,2,2}, of sizes 1,3,3,1. The sums of distinct basis tensors in these four orbits form a basis of ES3, since the orbits are disjoint. The middle two sums over all σ∈S3 displayed in the Statement are twice their distinct-orbit sums, because each of those tensors has a stabilizer of order two. As 2≠0 in C, the four displayed vectors also form a basis, so dim⁡CES3=4.

2.2F4step 1.3

For the highest weight, ℓ((2,1))=2=d and ℓ((3))=1≤d, and M(2,1), M(3) are irreducible over B by step 1.3; the highest-weight lemma [F4] therefore provides a nonzero φ∈M(2,1) with Δ(E11)∘φ=2φ, Δ(E22)∘φ=φ and Δ(E12)∘φ=0, so M(2,1) has highest weight (2,1), unique up to scalar; for (3) the padded weight is (3,0), so the same lemma gives eigenvalues 3 and 0 for Δ(E11) and Δ(E22), respectively, and annihilation by Δ(E12).

3.1step 1.2step 2.1F1algebra

Since S(3)=Cet with et fixed and nonzero by step 1.2, the evaluation map ev(φ):=φ(et) is a C-linear bijection Hom⁡S3(S(3),E)→ES3: a homomorphism takes the fixed generator et to a fixed vector, and conversely a fixed vector v defines the well-defined S3-linear map λet↦λv. For g∈GL⁡(V) postcomposition gives ev(g⋅φ)=g⊗3φ(et)=(g⊗3)⋅ev(φ), so the bijection is GL⁡(V)-equivariant; hence M(3)=Hom⁡S3(S(3),E)≅ES3 as GL⁡(V)-modules, of dimension 4.

4.1step 3.1step 1.3step 1.4algebra

Reading dimensions in the isomorphism of step 1.3 and using steps 3.1 and 1.4: 8=dim⁡CE=1⋅dim⁡CM(3)+2⋅dim⁡CM(2,1)=1⋅4+2dim⁡CM(2,1), so dim⁡CM(2,1)=2.

5.1F2F3step 2.1step 1.3step 4.1step 2.2given∎

Substituting the identification M(3)≅ES3=Sym⁡3(C2) of step 3.1 into step 1.3 gives the decomposition E≅S(3)⊗Sym⁡3(C2)⊕S(2,1)⊗M(2,1). All three partitions of 3 have been accounted for: (3) and (2,1) occur with the multiplicities dim⁡M(3)=4 and dim⁡M(2,1)=2 just computed, while (1,1,1) is excluded exactly by the length cutoff ℓ((1,1,1))=3>d=2; the dimension count 8=4+4 closes, and the enumeration uses only the finite sets {1,2}3, S3 and the partitions of 3, so no choice principle is invoked. This proves the Statement.

Remarks

  • Why the shape (1,1,1) is absent. Its three boxes form one column, so a nonzero column-antisymmetrized tensor in V⊗3 would need three distinct basis vectors, and V=C2 supplies only two: this is the length cutoff ℓ(λ)≤d in the smallest nontrivial case, and it is exactly the criterion applied in step 1.3.

  • The classical shape of the answer. E≅Sym⁡3(C2)⊕(M(2,1))⊕2 with dim⁡Sym⁡3(C2)=4 and dim⁡M(2,1)=2: the degree-three piece of the symmetric algebra of C2 has the monomial basis x3,x2y,xy2,y3, and the remaining two copies of the two-dimensional module M(2,1) of highest weight (2,1) exhaust the dimension count 4+2⋅2=8.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

53 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