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.
Young's rule for complex permutation modules
Statement
Let , let , let be the complex Young permutation module of shape with its tabloid basis (Young subgroups, tabloids, and permutation modules), and let be the complex Specht module (Column antisymmetrizers, polytabloids, and Specht modules). Write for the Kostka number (Semistandard tableaux and Kostka numbers) and, for an integer , let denote a direct sum of copies of , the zero module when . Then:
- (Isomorphism type.) is completely reducible and there is an isomorphism of -modules the sum being over the finitely many partitions of .
- (Multiplicity.) In every decomposition of as a direct sum of irreducible subrepresentations the number of summands isomorphic to equals ; that is, the multiplicity is well defined and equal to the Kostka number , independently of the decomposition.
Facts & Assumptions
Given: an integer , partitions , the complex Young permutation module with its tabloid basis, the Specht module , the standard reference -tableau and the homomorphisms attached to the fillings of with content .
The tabloids of shape form a basis of , on which acts by ; the finite set of tabloids is nonempty, so , and is a finite-dimensional complex representation of . For one has , with basis the empty tabloid and trivial -action, and (Young subgroups, tabloids, and permutation modules, Column antisymmetrizers, polytabloids, and Specht modules).
For every filling of with content the rule , extended -equivariantly, defines an -module homomorphism , and its restriction to the Specht module is again -linear, for every semistandard of content (Semistandard fillings construct Specht-to-permutation homomorphisms, Semistandard tableaux and Kostka numbers).
If are pairwise distinct semistandard -tableaux of content , then are linearly independent over , so ; moreover , and implies in the dominance order (Semistandard maps are independent and respect dominance).
The restrictions of the semistandard -tableaux of content span over (Semistandard maps span the Hom space in characteristic zero).
is the number of semistandard -tableaux of content ; the set of fillings of with content is finite; every entry of such a filling lies between and the number of parts of ; and (Semistandard tableaux and Kostka numbers).
Every finite-dimensional complex representation of is completely reducible, that is, a direct sum of finitely many irreducible subrepresentations (with the empty sum allowed for the zero representation); this is Maschke's theorem for the finite group in characteristic , where does not divide (If , every finite-dimensional representation of is completely reducible, Maschke's theorem for finite groups over fields whose characteristic does not divide , A completely reducible representation as a finite direct sum of irreducible subrepresentations).
The modules form a complete irredundant list of the finite-dimensional irreducible complex -representations: each is irreducible, every finite-dimensional irreducible complex -representation is isomorphic to some , and if and only if (Specht modules classify the complex irreducibles of ).
A nonzero intertwiner between irreducible representations over any field is an isomorphism, so for non-isomorphic irreducibles; and over the algebraically closed field every endomorphism of an irreducible representation is a scalar, so (Schur's lemma for irreducible representations: a nonzero intertwiner is an isomorphism, and is a division ring, Over an algebraically closed field, every endomorphism of an irreducible representation is scalar).
Proof
[construct] The restrictions of the semistandard fillings of content form a basis of the complex vector space : they span by [F4], they are linearly independent by [F3], and by [F5] there are exactly of them. Hence , and in particular a nonzero intertwiner exists exactly when .
By [F6] the finite-dimensional complex representation is completely reducible, so there are irreducible subrepresentations with ; here because the tabloid basis of [F1] is nonempty. By [F7] each is isomorphic to for exactly one partition , and holds only for .
Let be a -module and let be a direct sum of subrepresentations with projections along the other summands. Then is -linear, so the rule maps into ; this map is -linear, it is injective because is determined by its components , and it is surjective because a tuple of intertwiners defines the intertwiner of which it is the tuple of components. Hence .
For irreducible and one has when and otherwise. If , then and are non-isomorphic by the irredundancy in [F7], so every intertwiner between them is zero by [F8]. If , the same fact of [F8] makes every endomorphism of the irreducible a scalar multiple of , so has dimension one.
Applying step 1.3 with to the decomposition of step 1.2 gives , and substituting the isomorphism of step 1.2 into step 1.4 gives when and otherwise. Hence equals the number of summands of this decomposition isomorphic to .
By step 1.1 the dimension in step 2.1 is , so the decomposition of step 1.2 contains exactly summands isomorphic to . Steps 1.2 and 2.1 apply verbatim to every decomposition of into irreducible subrepresentations, and the quantity they compute, , depends only on and ; hence every such decomposition contains exactly summands isomorphic to and the multiplicity is well defined and equal to . Grouping the summands of step 1.2 by their isomorphism classes gives the asserted isomorphism .
Boundary, degenerate, characteristic and choice audit. For the only partition is , and , , by [F1] and [F5], so claim 1 reads and steps 1.2 and 2.1 give with . If , the summand is omitted and claim 2 says that does not occur in ; this happens for instance when , since every entry of a semistandard filling of content lies in by [F5] while the first column of has boxes carrying strictly increasing entries, and also for with , where all entries of a filling of content are equal to and a column of length at least two cannot strictly increase. If , the summand is a single copy of : by [F3] this happens for , so every contains exactly one copy of ; and it happens for the one-row shape for every , since a semistandard filling of the single-row diagram with content is exactly the weakly increasing word of content , which exists and is unique. The argument is particular to : [F6] uses that does not divide and [F8] uses that is algebraically closed, and no analogue over a field of positive characteristic is asserted. The only selection made is the decomposition of the finite-dimensional module into finitely many irreducible summands, whose existence is supplied by [F6]; step 3.1 shows the multiplicities do not depend on this selection, and no choice principle is invoked. This proves claims 1 and 2.
Remarks
-
The two computations of one number. Young's rule is the equality of two counts of : the semistandard construction of Semistandard maps are independent and respect dominance and Semistandard maps span the Hom space in characteristic zero exhibits a basis indexed by the semistandard tableaux, while complete reducibility of and Schur's lemma compute the same dimension as the multiplicity of . Equivalently, for complex representations .
-
No Robinson-Schensted-Knuth input. The count of semistandard tableaux enters only through its definition (Semistandard tableaux and Kostka numbers); the spanning argument behind the basis of the Hom space is the Garnir straightening computation of Integral Garnir straightening and the field-uniform standard basis, not the Robinson-Schensted-Knuth correspondence used in Craven's dimension count (Craven Theorem 2.16, printed pp. 28-31).
-
Dominance. Combining claims 1 and 2 with the dominance part of [F3] shows that the sum in claim 1 is supported on the shapes : the permutation module is a direct sum of Specht modules of shapes dominating , with itself occurring exactly once, in agreement with Semistandard maps are independent and respect dominance.
Depends on
- Semistandard maps are independent and respect dominance
- Semistandard maps span the Hom space in characteristic zero
- Semistandard tableaux and Kostka numbers
- Specht modules classify the complex irreducibles of $S_n$
- Maschke's theorem for finite groups over fields whose characteristic does not divide $|G|$
- Young subgroups, tabloids, and permutation modules
- Column antisymmetrizers, polytabloids, and Specht modules
- Semistandard fillings construct Specht-to-permutation homomorphisms
- If $\operatorname{char} k \nmid |G|$, every finite-dimensional representation of $G$ is completely reducible
- A completely reducible representation as a finite direct sum of irreducible subrepresentations
- Schur's lemma for irreducible representations: a nonzero intertwiner is an isomorphism, and $\operatorname{End}_G(V)$ is a division ring
- Over an algebraically closed field, every endomorphism of an irreducible representation is scalar
- Integral Garnir straightening and the field-uniform standard basis
Used by
- Young's rule for M^(2,1) Example
Dependency tree · two levels
52 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
- Andrew Snowden, MATH 711 Representation Theory of Symmetric Groups, Theorem 3.12 (Young's Rule) and its proof via Theorem 3.23, Remark 3.24 and Lemma 3.29, PDF pp. 33 and 37-39 (standard reference, not scraped)
- David A. Craven, Groups, Geometries and Representation Theory, Lemma 2.15 and Theorem 2.16 (Young's rule), printed pp. 28-31 (standard reference, not scraped)