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.
Hook, arm, leg, and hook length of a box
Definition
Let with English Young diagram (Partitions, English diagrams, and conjugation) and let . The hook of is the set the union of the boxes of weakly to the right of in row and weakly below in column ; the box itself belongs to both parts and is counted once. The arm is the part in row strictly to the right of , so ; the leg is the part in column strictly below , so . The arm length is , the leg length is , and the hook length is
so that has exactly boxes. Here is the number of rows of of length at least , so the boxes of column below row are exactly the rows and the arm has boxes; the arm, the leg and the anchor are pairwise disjoint and exhaust , which gives the count.
A box is removable in the sense of Removable and addable nodes if and only if it is the last box of its row and of its column, i.e. if and only if : a row endpoint is removable exactly when no box lies immediately below it, that is when , and then and ; conversely forces , so ends both its row and its column. The empty partition has no boxes.
Finally denotes the hook product of , the empty product being part of the convention. This fixes the off-by-one convention used by the whole page: the anchor box contributes , the arm contributes and the leg contributes . No choice principle is used.
Depends on
Used by
Dependency tree · two levels
4 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 (Spring Term 2013 lecture notes, 42 pp.) (standard reference, not scraped)
- Charlotte Chan, Representation Theory of Symmetric Groups (Oxford Hilary Term 2011 lecture notes, 40 PDF pp.) (standard reference, not scraped)
- Pavel Etingof et al., Introduction to Representation Theory, MIT 18.712 Chapter 4 (OCW Chapter 4 file, 32 pp.) (standard reference, not scraped)