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.
Support, fixed points, disjoint cycles, cycle length, disjoint-cycle decompositions, and cycle type
Definition
Let be a finite set and let , with cycle notation and composition as in The symmetric group : the bijections of a set under composition.
The support and fixed-point set of are
A cycle has length and support . Two cycles are disjoint when their supports are disjoint. A disjoint-cycle decomposition of is an expression for as a product of pairwise disjoint cycles of length at least . One-cycles are omitted, and the empty product is the identity permutation.
When , the cycle type of is the list of natural numbers , where is the number of -element orbits of the action generated by . Thus is the number of fixed points. Equivalently, the cycle type records the lengths of all cycles after each fixed point is inserted as a one-cycle.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 28 results over 13 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- J. S. Milne, Group Theory, §4 (standard reference, not scraped)