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 with fixed basis , let carry the commuting left place action of and diagonal action of (Commuting symmetric-group and linear actions on a tensor power), and for put , with acting by postcomposition. Then:
- (Decomposition.) There is an isomorphism of -modules , and : the shape is absent, in agreement with the length cutoff .
- (The trivial factor.) is the one-dimensional trivial representation of , the fixed space is four-dimensional with basis and evaluation at a generator of identifies as -modules. Writing with the corresponding basis , the decomposition reads .
- (Dimensions and highest weight.) and , so ; the two standard -tableaux give , and has highest weight , while has highest weight .
Facts & Assumptions
Given: the complex vector space with basis , the module with its commuting - and -actions, and the multiplicity spaces for .
The place action of on is a linear left action and is the diagonal -action, which commutes with it; the diagonal infinitesimal operator is (Commuting symmetric-group and linear actions on a tensor power).
The eight elementary tensors with form a basis of , so (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).
For the Schur-Weyl decomposition reads ; for every with the space is nonzero and irreducible over and has highest weight , while forces (Schur-Weyl decomposition and highest weights).
For with , the multiplicity space contains the nonzero map with for every (with for ) and ; if is irreducible over , then is its unique highest weight (The row-labelled polytabloid map has highest weight lambda).
For every the standard polytabloids form a -basis of , so , the number of standard -tableaux (Standard polytabloids form a basis of a complex Specht module, Tableaux and standard tableaux).
For a partition the tabloids of shape form a basis of on which acts by . For the set has the single element , so is one-dimensional and every acts trivially (Young subgroups, tabloids, and permutation modules).
The polytabloid of a tableau is with , and a -tableau; the column stabilizer of a one-row tableau is trivial, so there (Column antisymmetrizers, polytabloids, and Specht modules).
The standard tableaux of shape are the single tableau , and the standard tableaux of shape are and ; hence and (Tableaux and standard tableaux).
The partitions of are with , with and with (Partitions, English diagrams, and conjugation).
No form of the Axiom of Choice is used: the space has an explicit finite basis, the group is finite and explicit, and all decompositions below are finite.
Proof
By [F2] the elementary tensors form a basis of , so , and by [F1] the place action only permutes this basis: is again an elementary tensor, with the three basis vectors permuted among the positions.
For the module has the single tabloid as basis, so it is one-dimensional and every fixes that tabloid; by [F7] the column stabilizer of the one-row tableau is trivial, so and . Hence is the one-dimensional trivial representation, and is a nonzero fixed vector that generates .
By [F9] the partitions of with are and , while ; by [F3] therefore with , and both and are nonzero and irreducible over .
By [F5] and the standard tableaux enumerated in [F8], and ; the two standard -tableaux of [F8] are the two ways and of placing the entries while increasing along rows and down columns, so is verified directly.
Compute the fixed space. An element is fixed by exactly when its coefficient function is constant on every orbit of acting by permutation of the three positions, because [F2] makes these basis vectors linearly independent; the orbits are the four multisets , , , , of sizes . The sums of distinct basis tensors in these four orbits form a basis of , since the orbits are disjoint. The middle two sums over all displayed in the Statement are twice their distinct-orbit sums, because each of those tensors has a stabilizer of order two. As in , the four displayed vectors also form a basis, so .
For the highest weight, and , and , are irreducible over by step 1.3; the highest-weight lemma [F4] therefore provides a nonzero with , and , so has highest weight , unique up to scalar; for the padded weight is , so the same lemma gives eigenvalues and for and , respectively, and annihilation by .
Since with fixed and nonzero by step 1.2, the evaluation map is a -linear bijection : a homomorphism takes the fixed generator to a fixed vector, and conversely a fixed vector defines the well-defined -linear map . For postcomposition gives , so the bijection is -equivariant; hence as -modules, of dimension .
Reading dimensions in the isomorphism of step 1.3 and using steps 3.1 and 1.4: , so .
Substituting the identification of step 3.1 into step 1.3 gives the decomposition . All three partitions of have been accounted for: and occur with the multiplicities and just computed, while is excluded exactly by the length cutoff ; the dimension count closes, and the enumeration uses only the finite sets , and the partitions of , so no choice principle is invoked. This proves the Statement.
Remarks
-
Why the shape is absent. Its three boxes form one column, so a nonzero column-antisymmetrized tensor in would need three distinct basis vectors, and supplies only two: this is the length cutoff in the smallest nontrivial case, and it is exactly the criterion applied in step 1.3.
-
The classical shape of the answer. with and : the degree-three piece of the symmetric algebra of has the monomial basis , and the remaining two copies of the two-dimensional module of highest weight exhaust the dimension count .
Depends on
- Schur-Weyl decomposition and highest weights
- The row-labelled polytabloid map has highest weight lambda
- Standard polytabloids form a basis of a complex Specht module
- Commuting symmetric-group and linear actions on a tensor power
- 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
- Young subgroups, tabloids, and permutation modules
- Column antisymmetrizers, polytabloids, and Specht modules
- Tableaux and standard tableaux
- Partitions, English diagrams, and conjugation
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
- Pavel Etingof et al., Introduction to Representation Theory, MIT 18.712 Chapter 4, Sections 4.18-4.21, PDF pp. 18-21 (standard reference, not scraped)
- Hsueh-Yung Lin, Modern Algebra I, Section 27, printed pp. 71-74 (standard reference, not scraped)