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.
Semistandard fillings construct Specht-to-permutation homomorphisms
Statement
Let , and fix a -tableau . Let be the set of fillings of the boxes of by positive integers with content (Semistandard tableaux and Kostka numbers). Identifying -tabloids with the elements of by recording, at the box that labels , the row of in the tabloid, one obtains an -module isomorphism for the transported left action For let be its orbit under this restricted action and put extended to a map by . Then is a well-defined -module homomorphism, and for every semistandard -tableau of content the restriction is a homomorphism of -modules. No assertion is made here that this restriction is nonzero.
Facts & Assumptions
Given: partitions , a fixed -tableau , and a filling of with content .
A -tabloid is a row-equivalence class of -tableaux; the tabloids form a basis of , and acts on by , where (Young subgroups, tabloids, and permutation modules).
The stabilizer in of the tabloid is the row stabilizer (Young subgroups, tabloids, and permutation modules).
Every -tabloid is for some , because the action on tabloids is transitive (Young subgroups, tabloids, and permutation modules).
where , and is the direct product of the symmetric groups on the pairwise disjoint sets (Row and column stabilizers).
A -tableau is a bijection , and is characterised by (Tableaux and standard tableaux, Row and column stabilizers).
A semistandard -tableau of content is a filling satisfying weak row increase, strict column increase and content (Semistandard tableaux and Kostka numbers).
is the complex span of the polytabloids (Column antisymmetrizers, polytabloids, and Specht modules), and it is an -submodule of (Polytabloid covariance and the column sign rule).
Proof
[construct] For a -tabloid write for its row sets, so ; define to be the filling with whenever , which has content because is a bijection, and conversely for put , so that the pairwise disjoint sets cover with and are the rows of a -tabloid with ; the two rules are inverse and is a bijection.
The left action on the tabloid basis transports along to the left action with , because the row of the label in is the row of in by [F1]; hence the display in the Statement is a left action of on and is an isomorphism of -modules, so we may compute with fillings and translate back along at the end.
Let and . By [F5], for the box in the same row of , since preserves the row sets of by [F4], so : the entries of are permuted within each row of and none leaves its row; conversely each permutation of the entries within the rows of arises this way, because is the full direct product of the symmetric groups on the disjoint sets by [F4] and the boxes of row correspond bijectively to via by [F5]. Hence is exactly the finite nonempty set of fillings obtained from by permuting entries within rows.
Let as in the Statement, a finite sum over the orbit of step 3.1; for every one has because is a subgroup acting on by step 2.1, so and the orbit sum is -invariant.
Define for . This is well defined: if , then by [F2], so by step 4.1 and the left action axioms ; since every tabloid is by [F3] and the tabloids form a basis of by [F1], the formula defines a unique -linear map .
The map is -linear: for , the left action axioms and step 5.1 give , and the elements span .
Restricting along the inclusion of the -submodule [F7] gives a linear map with for and by step 6.1, that is, a homomorphism of -modules; if is semistandard of content by [F6], this is the map of the Statement, whose value on is the row-orbit sum of step 4.1, and no nonvanishing of is asserted.
Remarks
-
The map depends only on the row class. If for some , then , so by step 4.1. The construction therefore attaches a homomorphism to each -orbit of fillings of content , in agreement with the source's "sum of all members row equivalent to " (Row and column stabilizers).
-
Dependence on the reference tableau. A different reference tableau produces the conjugate orbit sum and the same up to the identification it induces; the homomorphisms relevant below are attached to semistandard fillings of a fixed reference tableau, which is all that is used.
-
The empty and singleton cases. For we have , the only filling is empty, , and is the identity . For , , again and is the identity.
-
No choice. The orbit sum is a finite sum over the finite group , and the linear extension uses the tabloid basis of [F1]; no selection principle is used.
Depends on
Used by
Dependency tree · two levels
11 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)