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 M^(2,1)
Statement
Work over . Let and let be the -tabloids, being the tabloid whose singleton second row is , so that its first row is the complementary pair. Then:
- (Kostka numbers.) , and .
- (Young's rule.) There is an isomorphism of -modules the shape contributing no summand.
- (Concrete decomposition.) Inside one has where is the trivial submodule, isomorphic to , and is the sum-zero hyperplane. In particular the dimension count is , and the multiplicity of in is .
Facts & Assumptions
Given: the group , the partition , the three partitions of , and the tabloids of the Statement.
The -tabloids form a basis of , the action is by relabelling the entries, and a tabloid of shape is determined by the label of its singleton second row (Young subgroups, tabloids, and permutation modules).
A semistandard filling of with content satisfies: the entry occurs times, entries weakly increase along rows and strictly increase down columns; is the number of such semistandard fillings (Semistandard tableaux and Kostka numbers).
Over one has as -modules, and the multiplicity of is (Young's rule for complex permutation modules).
For a -tableau the polytabloid is with over the column stabilizer , and a transposition has sign . The tabloid of a tableau is determined by its two row sets, so for and for ; their column stabilizers are and (Column antisymmetrizers, polytabloids, and Specht modules, Row and column stabilizers, Young subgroups, tabloids, and permutation modules, A -cycle has sign , and when fixed points are counted as cycles).
The standard polytabloids of a partition form a basis of the complex Specht module (Standard polytabloids form a basis of a complex Specht module).
The complex Specht modules are irreducible (Complex Specht modules are irreducible). For the one-row shape the unique tabloid is fixed by every permutation and the column stabilizer is trivial, so its polytabloid is that tabloid and is one-dimensional and trivial (Column antisymmetrizers, polytabloids, and Specht modules, Young subgroups, tabloids, and permutation modules).
No form of the Axiom of Choice is used; all enumerations below are finite and explicit.
Proof
The tabloids are distinct by [F1], since their singleton second rows are distinct; by [F1] they form a basis of , so .
The semistandard fillings with content are enumerated by shape. Shape : the single row carries two 's and one weakly increasingly, so the only filling is and . Shape : the entry in the box must strictly exceed the entry in the box above it, and only the entries occur, so carries and carries ; the remaining entry fills the box , whose left neighbour is , and weak increase holds; hence the unique filling is and . Shape : the three boxes form a column with strictly increasing entries, but the content has the entry twice, so no such filling exists and .
The shape has exactly two standard tableaux: the entry must occupy the box , and the remaining boxes and receive and in either order, both fillings being standard, namely and . By [F4] one has and , and the action on tabloids is by relabelling, so and . Hence and , whose coordinate vectors and in the basis of [F1] are linearly independent. By [F5] the standard polytabloids of shape form a basis of , whose dimension is therefore the number of standard tableaux, so is a basis of .
Substituting step 1.2 into [F3] gives the -isomorphism , which is claim 2 and shows that the multiplicity of in is one.
Put and let be the sum-zero hyperplane. Every permutes the tabloid basis, so and is a submodule isomorphic to the trivial representation; and is -stable, since merely permutes the coefficients. For any with one has with , so ; and , since forces , hence . Therefore with .
By step 2.1 the standard polytabloids and form a basis of , and both lie in because their coordinates sum to zero; hence with , so . By [F6] is one-dimensional and trivial, whereas has dimension two by step 2.1; they are therefore non-isomorphic, and and are exactly the two summands found in step 2.2; combined with step 2.3 this proves claim 3 and the dimension count .
Consistency and boundary audit. The third partition of contributes nothing, as computed directly from the strict column increase in step 1.2; the value follows from the unique filling enumerated in step 1.2; the row shape contributes exactly one trivial summand, realized concretely as ; and the column shape would require three distinct entries, which content does not provide. The decomposition is -stable for every by step 2.3, and the ambient module has dimension three over , so is the complete dimension count. This proves the Statement.
Remarks
- What the example checks. The example checks both halves of the picture in one three-dimensional module: the multiplicities are read off from the semistandard fillings, and the abstract decomposition is realized by the familiar splitting of the permutation module into constants and sum-zero vectors, with (this basis is computed in step 2.1 and the identification of the hyperplane with is step 3.1; see also Polytabloids of shape for the same polytabloid computation).
Depends on
- Young's rule for complex permutation modules
- Semistandard tableaux and Kostka numbers
- Standard polytabloids form a basis of a complex Specht module
- Young subgroups, tabloids, and permutation modules
- Column antisymmetrizers, polytabloids, and Specht modules
- Row and column stabilizers
- A $k$-cycle has sign $(-1)^{k-1}$, and $\operatorname{sgn}(\sigma)=(-1)^{n-c(\sigma)}$ when fixed points are counted as cycles
- Complex Specht modules are irreducible
- Tableaux and standard tableaux
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
36 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
- David A. Craven, Groups, Geometries and Representation Theory, Sections 2.2 and 2.4, printed pp. 22-23 and 28-31 (standard reference, not scraped)
- Andrew Snowden, MATH 711 Representation Theory of Symmetric Groups, Lemmas 2.45-2.46 and Section 3.2, PDF pp. 23-24 and 36-39 (standard reference, not scraped)