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.
Adjacent-column Garnir relation over C
Statement
Let be a -tableau. Let lie among entries of column and among entries of column , with . Put , choose representatives containing for the left cosets in , and Then in over .
Facts & Assumptions
Given: , , a -tableau , adjacent columns , subsets of their respective entries with , and a left-coset transversal for containing .
The polytabloid is , where (Column antisymmetrizers, polytabloids, and Specht modules).
If two entries lie in one row of a tabloid and in one column of a tableau, that tableau's column antisymmetrizer kills the tabloid (Column collision cancels antisymmetrization).
Column has height , and these heights are weakly decreasing with (Partitions, English diagrams, and conjugation).
The column stabilizer preserves each column set (Row and column stabilizers).
A tableau of shape is a bijection from to (Tableaux and standard tableaux).
Sign is multiplicative on products in (The sign is a homomorphism , surjective exactly when ).
Proof
Set and , where fixes labels outside . The columns are disjoint, so . If , both and are empty, contradicting this inequality; hence . For each , every label in lies in one of the first rows of : its preimage under is in column or , and by [F4]. Thus two labels of lie in one row of that tabloid. Form and the -tableau that places the labels of in increasing order down its first column and all remaining labels in increasing order along its first row; this is a tableau by [F6]. Its other columns are singletons, so by [F5] and . Applying [F3] to and each tabloid gives . Expanding by [F1] now gives .
Since permutes labels within the two respective columns, by [F5]. Define ; [F2] gives . The left-coset decomposition and multiplicativity [F7] give . Therefore step 1.1 yields . The positive integer is nonzero in , so division gives . The proof works for every supplied transversal and makes no further choice.
Depends on
- Column antisymmetrizers, polytabloids, and Specht modules
- Polytabloid covariance and the column sign rule
- Column collision cancels antisymmetrization
- Partitions, English diagrams, and conjugation
- Row and column stabilizers
- Tableaux and standard tableaux
- The sign is a homomorphism $S_n\to\{+1,-1\}$, surjective exactly when $n\ge 2$
Used by
Dependency tree · two levels
15 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.