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.
Ferrers and Young diagrams, conjugate partitions, self-conjugacy, and the Durfee square
Definition
Let be a partition written in the page convention of Conventions for integer partitions, Ferrers diagrams, and the twelvefold-way table. For a nonempty partition, write
Also adjoin the empty partition
of .
The Ferrers diagram (or Young diagram) of a nonempty partition is the set of cells
drawn as left-justified rows, with row containing cells.
The Ferrers diagram of is the empty set of cells.
The conjugate partition of a nonempty partition is obtained by transposing this diagram: for , its -th part is the number of rows of of length at least . Equivalently,
The conjugate of is again .
The partition is self-conjugate when .
The Durfee length of is . For a nonempty partition , the Durfee length is the largest integer such that . The Durfee square is the square of cells in the upper-left corner of the Ferrers diagram, and for it is the empty square.
Depends on
Used by
- The partition (4,2,1) is not self-conjugate Counterexample
- The functions p(n), pₖ(n), and the standard restricted partition families Definition
- Conjugating a partition twice returns the original partition Lemma
- Durfee-square decomposition of the partition series Theorem
- Euler's pentagonal number theorem by Franklin's involution Theorem
- Partitions with k parts are equinumerous with partitions whose largest part is k Theorem
- Self-conjugate partitions correspond to distinct odd-part partitions Theorem
Dependency tree · two levels
7 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
- Stephen Melczer, An Invitation to Enumeration, Chapter 9: Integer Partitions (standard reference, not scraped)