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.
Necklace count from the cyclic-group cycle index
Statement
For integers and , the number of length- necklaces over an -letter alphabet is
Facts & Assumptions
Given: integers and .
Pólya's theorem counts colourings up to rotation by evaluating the cycle index at the number of colours (Pólya's enumeration theorem).
The rotation action of has cycle index (The cycle index of the cyclic group C_n).
Proof
A length- necklace over an -letter alphabet is exactly a colouring of the vertices of a labelled -gon by colours, up to the rotation action of .
By [L1] and [L2], the number of such orbits is .
Depends on
Used by
Dependency tree · two levels
6 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
- Ben Lynn, Polya Theory: The Cycle Index Polynomial (standard reference, not scraped)