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.
Polytabloid covariance and the column sign rule
Statement
For every , , -tableau , and , one has For every , Consequently is an -submodule of and is generated by any one .
Facts & Assumptions
Given: , , a -tableau , , and .
The column antisymmetrizer is the finite group-algebra sum (Column antisymmetrizers, polytabloids, and Specht modules).
The polytabloid is (Column antisymmetrizers, polytabloids, and Specht modules).
is the complex span of all for -tableaux (Column antisymmetrizers, polytabloids, and Specht modules).
is the direct product of the symmetric groups on its pairwise disjoint column sets (Row and column stabilizers).
Sign is a group homomorphism (The sign is a homomorphism , surjective exactly when ).
A -tableau is a bijection from to (Tableaux and standard tableaux).
The tabloid module has the tabloids as basis and carries the linear extension of their left -action (Young subgroups, tabloids, and permutation modules).
Proof
Write for the set of labels in column and . By [F4], the have pairwise disjoint supports and every has a unique factorization with . The product expands over these tuples, and by [F6] the coefficient at is . Hence , where . If , both sides are the empty product .
For every , [F6] gives , since the homomorphism property makes .
For , reindex [F1] by . Since , this gives . Applying both sides to and using [F2] proves .
By [F5], conjugation by bijects with . Reindexing [F1] by and using step 1.2 gives .
From [F2], step 2.1, and the left module action [F8], .
Every spanning vector of has the form by [F3], and step 3.1 sends it under to , which is again a spanning vector. Thus is an -submodule of .
Fix any -tableau and let be any other one. By [F7], the rule defines a unique permutation ; for it is the identity. Then and step 3.1 gives . Therefore the orbit of spans all the generators of , so generates as an -module. This holds for every choice of .
Depends on
Used by
- Distinct complex Specht modules are inequivalent Corollary
- The row and column Specht modules Example
- Adjacent-column Garnir relation over C Lemma
- Garnir straightening spans the complex Specht module Lemma
- Complex Specht modules are irreducible Theorem
- Homomorphisms from Specht to Young permutation modules obey dominance Theorem
- James's submodule theorem over the complex numbers Theorem
Dependency tree · two levels
13 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
- Charlotte Chan, Representation Theory of Symmetric Groups, Lemmas 3.10-3.11 and Definition 3.12, printed p. 13 (standard reference, not scraped)