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
- The conjugacy classes of Sₙ are indexed by the tuples (c₁,…,cₙ) with ∑ k cₖ=n Corollary
- Standard cycle form and Foata's fundamental transformation Definition
- The cycle index of a finite permutation group Definition
- The signed and signless Stirling numbers of the first kind Definition
- Conjugating a cycle relabels each entry: g(a₁ … aₖ)g⁻¹=(g(a₁) … g(aₖ)) Lemma
- Cycles with disjoint supports commute Lemma
- Every nontrivial normal subgroup of Aₙ contains a 3-cycle for n≥5 Lemma
- Fixed colourings factor by cycle type Lemma
- Permutations with a fixed cycle type are counted by the standard factorial denominator Lemma
- Every permutation of a finite set is a product of pairwise disjoint cycles, uniquely up to reordering and cyclic rotation Theorem
- If σ∈ Sₙ has cₖ cycles of length k, then |C_Sₙ(σ)|=∏ₖ₌₁ⁿ k^cₖcₖ! Theorem
- The signless first-kind Stirling numbers satisfy their recurrence and expand the rising factorial Theorem
- Two elements of Sₙ are conjugate if and only if they have the same cycle type Theorem
Dependency tree · two levels
11 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
- J. S. Milne, Group Theory, §4 (standard reference, not scraped)