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.
Column antisymmetrization gives the exact Schur–Weyl length cutoff
Statement
Let be a finite-dimensional complex vector space of dimension , let , and let with the left place action of of Commuting symmetric-group and linear actions on a tensor power. For every , where is the number of nonzero rows of and is the complex Specht module (Column antisymmetrizers, polytabloids, and Specht modules). Equivalently, the complex irreducible -module occurs in exactly for the partitions of with at most rows.
Facts & Assumptions
Given: a finite-dimensional complex vector space of dimension , an integer , a partition , and the module with its left -action.
defines a left -action on with finite-dimensional and for (Commuting symmetric-group and linear actions on a tensor power).
is free with the -tabloids as basis, with , is the span of the polytabloids, , and , for (Column antisymmetrizers, polytabloids, and Specht modules, Polytabloid covariance and the column sign rule).
is a nonzero irreducible -module, and is generated by for any single -tableau (Complex Specht modules are irreducible, Polytabloid covariance and the column sign rule).
and preserve each row set and each column set of respectively, and the row stabilizer of the tabloid is ; every -tabloid is for some , and over the disjoint column label sets (Row and column stabilizers, Young subgroups, tabloids, and permutation modules).
If is a basis of , the elementary tensors form a basis of , so distinct such tensors are linearly independent; is the height of the first column of (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, Partitions, English diagrams, and conjugation).
is multiplicative and for a transposition (The sign is a homomorphism , surjective exactly when ).
Proof
[construct] Assume and fix a -tableau and a basis of . Let be the tensor with factor in every place labelled by an entry of row of , that is, the place carrying label holds , where is the row of the box of containing ; define for and extend linearly. If , then permutes only the places inside each row of , all of which carry the same basis vector, so ; hence, since the stabilizer of is and every tabloid is by [F4], is a well-defined -linear map , and it is -linear by construction.
Conversely, assume , and let be the set of labels in the first column of a -tableau , so by [F4, F5]. Let , acting on through place permutations. Then annihilates : it suffices by linearity and [F5] to check this on a basis tensor , where the place carrying label holds for basis indices . Since , two labels of carry the same basis vector, so the transposition fixes . Choose representatives for the right cosets in . By [F6], and therefore .
For , the tensor has at the place carrying label the factor , so holds exactly when maps every row set of to itself, that is, exactly when ; since by [F2], the tensors , , are pairwise distinct, and the coefficient of in is the coefficient of the single term , namely . By [F5] and [F2], .
Write for the column label sets of . By [F4], is the direct product over disjoint supports, so with the multiplicativity of the sign [F6] gives in ; here . Since annihilates by step 1.2 and the operators commute, acts as the zero operator on . Also by [F2], so with in . If is -linear, then ; since generates by [F3], . Hence when .
The restriction is a map of -modules, because is an -submodule and is -linear by step 1.1; it is nonzero at by step 2.1. Its kernel is a proper -submodule of , hence zero because is irreducible by [F3]; therefore is injective and when .
Steps 3.1 and 2.2 prove the equivalence for ; for we have , , and , in agreement. If and then , so every homomorphism into is zero, and indeed ; if and the previous case applies. This proves the claimed equivalence in all cases.
Remarks
-
Where irreducibility and nonvanishing are used. The forward direction uses irreducibility of only to convert a nonzero map into an injection, and uses the nonvanishing of to produce that map; the reverse direction uses in , so it does not survive in characteristic , where the corresponding multiplicity question is a modular branching question treated elsewhere.
-
Interpretation. For and the cutoff requires and ; the corresponding multiplicity factors below are the symmetric and exterior powers of , of dimensions and , and the second vanishes exactly when .
-
No choice. The basis of , the tableau and the tensor are fixed explicitly, and is a finite set; no selection principle is used.
Depends on
- Commuting symmetric-group and linear actions on a tensor power
- Column antisymmetrizers, polytabloids, and Specht modules
- Polytabloid covariance and the column sign rule
- Complex Specht modules are irreducible
- Row and column stabilizers
- Young subgroups, tabloids, and permutation modules
- Tableaux and standard tableaux
- The elementary tensors of two bases form the product basis of the tensor product
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Partitions, English diagrams, and conjugation
- The sign is a homomorphism $S_n\to\{+1,-1\}$, surjective exactly when $n\ge 2$
Used by
Dependency tree · two levels
47 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)