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.
Integral Garnir straightening and the field-uniform standard basis
Statement
Let and let . Write for the free -module on the -tabloids and for the -span of the polytabloids over a commutative ring (Integral and field-valued Specht modules). Then:
- (Integral Garnir relation.) Let be a -tableau, let be adjacent columns, let be a set of entries of column and a set of entries of column , with . Let , where is any set of representatives containing for the left cosets of in (the transpositions in and act on the corresponding labels and fix all other labels). Then the same identity holds after base change in for every field , for the same transversal .
- (Straightening over .) For every -tableau , the polytabloid is a finite -linear combination of standard -polytabloids.
- (Integral and field-uniform basis.) The standard polytabloids are a -basis of ; for every field , their images under coefficient reduction are an -basis of . In particular for every field , including of characteristic .
Facts & Assumptions
Given: , , a -tableau , adjacent columns , subsets of their entry sets with , and a left-coset transversal for containing , where .
is free with the -tabloids as -basis, and for every tableau ; for , ; moreover for every , and is the -span of all (Integral and field-valued Specht modules).
is a homomorphism (The sign is a homomorphism , surjective exactly when ).
and are the subgroups of preserving each column set and each row set of ; they act by permuting labels within columns and within rows respectively (Row and column stabilizers).
Column of has nodes and (Partitions, English diagrams, and conjugation).
A -tableau is a bijection ; it is standard when entries strictly increase along rows and down columns, and it is column-standard when entries strictly increase down columns (Tableaux and standard tableaux, Tabloid and column orders for Specht straightening).
The tabloids carry a finite strict total order, and the column-standard tableaux carry a finite strict total order in which means that the largest label lying in different columns in and is farther left in (Tabloid and column orders for Specht straightening).
If is column-standard, then the coefficient of in is and every other tabloid occurring in is strictly below in the tabloid order of [F6]; moreover distinct standard tableaux have distinct tabloids (Leading tabloid of a column-standard polytabloid).
Proof
[construct] Put and ; then satisfies , because is the disjoint union of the left cosets , , and by [F2]. Since permutes labels inside the two columns and and fixes all other labels, by [F3]; hence [F1] gives , a multiplication in by the positive integer .
Let and consider the tabloid of the tableau . The labels of occupy, in the tableau , the positions for ; these lie in column , because preserves each column set by [F3], and they are pairwise distinct positions of that column, hence lie in pairwise distinct rows. Likewise the labels of lie in pairwise distinct rows, all of them rows by [F4], while the labels of lie in rows . All labels of therefore lie in the first rows of the tabloid, and within this set two labels of never share a row and two labels of never share a row; hence some row of contains a label and a label .
[construct] Let be any -tableau. Sorting the entries of each column of increasingly gives the unique column-standard -tableau with the same column sets as , and the rule defines a unique with . By [F1] and [F5], , so : it suffices to straighten column-standard polytabloids over .
The standard polytabloids are linearly independent over and over every field . Indeed, let be a finite linear relation with coefficients in or in a field, not all zero, and let be a standard tableau whose leading tabloid is greatest, in the finite tabloid order of [F6], among the tabloids attached to the tableaux with . By [F7] the coefficient of in is for every such (its leading tabloid is , and all its other tabloids are strictly below , hence strictly below ), while the coefficient of in is ; the coefficient of in the relation is therefore , a contradiction.
For let , be labels in one row of , as provided by step 1.2. Then because a transposition of two labels in one row preserves the row sets. Choose representatives for the right cosets in . Since by [F2], so .
Because is column-standard but not standard, some row contains adjacent entries with ; fix such a descent, put , and set for and for . Column-standardness gives and , while ; hence every element of is larger than every element of . Since the box lies in , we have , and .
Summing step 2.1 over with coefficients gives by [F1]. By step 1.1 this is in . Expanding in the tabloid basis, uniqueness of coefficients in the free module [F1] gives in for every tabloid , hence since ; therefore in , which is claim 1 for integral scalars, and its image under gives the same identity in for every field .
[construct] Fix a column-standard tableau and the descent data , of step 2.2, with and . For each -element subset write and and put , the empty product being the identity; then , the are pairwise distinct, and as runs over the -element subsets of they form a left-coset transversal for in with , because is exactly the setwise stabiliser of in and the left cosets are distinguished by . Applying step 3.1 to this transversal and using the covariance identity of [F1] yields, by isolating the identity term, with integer coefficients.
For let be the greatest element of ; then column of , and every element of other than is smaller than , while every element of is smaller than every element of by step 2.2. Under the left action , the changed labels are exactly the elements of , and is the greatest of them, moving from column in to column in ; all labels greater than are fixed by and stay in their columns. Sorting the columns of increasingly gives a column-standard tableau with the same column sets, so stays in column , and by step 1.3 and [F5] we have ; since the largest label in different columns of and is , with , the order of [F6] gives .
There are finitely many column-standard -tableaux, ordered by in [F6]; list them as . For the greatest element , if it were not standard then step 4.1 would produce tableaux with by step 5.1, contradicting maximality, so is standard. Now let and suppose every with is a finite -linear combination of standard polytabloids. If is standard there is nothing to prove; otherwise steps 4.1 and 5.1 express as a finite -linear combination of elements with , which are of the required form by the supposition. Finite downward induction on therefore proves claim 2 for column-standard tableaux, and step 1.3 removes the column-standard hypothesis: every polytabloid over is a finite -linear combination of standard polytabloids.
By claim 2 every element of , which is spanned by the polytabloids by [F1], lies in the -span of the standard polytabloids, and step 1.4 shows that this family is -linearly independent; hence it is a -basis of . Reducing coefficients along , the images span because the reduction of every is an -linear combination of the images of standard polytabloids, and they are -linearly independent by step 1.4 read in ; hence they form an -basis of , so by [F5]. Claim 1 for fields is step 3.1, and the empty shape is included since with its single standard polytabloid. This proves all three claims.
Remarks
-
No division by factorials. The integral argument never divides by : the proof of the Garnir relation first produces the identity and then cancels the integer inside the free, hence torsion-free, module . This is why the result survives in characteristic and is not available from the complex-only Garnir relation (Adjacent-column Garnir relation over C) by base change.
-
Unitriangularity. The induction of step 6.1 straightens strictly upward in the column order of [F6], and each step has coefficients ; combined with the leading-tabioid unitriangularity of [F7] this gives the standard basis without the hook-length formula or RSK.
-
Consistency with the complex basis. For the field case of claim 3 recovers the published Standard polytabloids form a basis of a complex Specht module without citing it; the two proofs use the same column order and the same Garnir mechanism, so they agree.
-
No choice. The transversals in claims 1 and 2 are given by explicit finite rules (a supplied transversal in claim 1, the swapping products in step 4.1), and the induction of step 6.1 runs over a finite ordered set; no selection principle is used.
Depends on
- Integral and field-valued Specht modules
- Tableaux and standard tableaux
- Row and column stabilizers
- Tabloid and column orders for Specht straightening
- Leading tabloid of a column-standard polytabloid
- 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
16 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
- Mark Wildon, Representation Theory of the Symmetric Group, Section 6, printed pp. 26-33 (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)