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.
In a C prime(1/6) group, every nontrivial torsion element is conjugate to a power of a relator root
Statement
Let be a symmetrised presentation. Every nontrivial torsion element of is conjugate to a power of a root of some defining relator.
Facts & Assumptions
Given: A nontrivial torsion element .
Powers in a group are written multiplicatively as in Powers : natural exponents in a monoid and integer exponents in a group, with .
The published local theorem C prime one sixth torsion elements come from relator roots proves that a nonidentity finite-order element in the symmetrised convention of Sc toolkit symmetrised relators and pieces is conjugate to a power of a root of a cyclic conjugate of a defining relator. This convention uses nonempty cyclically reduced words and permits proper powers and infinite relator sets.
Proof
Because is a nontrivial torsion element in the stated symmetrised presentation, [F2] applies. It supplies a cyclic conjugate of a defining word and a word root of such that is conjugate to a power of the image of . In the symmetrised relator set, is itself a defining relator; equivalently and are conjugate in the free group. Thus this is a power of a root of a defining relator as claimed.
Powers are interpreted as in [F1], so step 1.1 is exactly the claimed conclusion.
Depends on
Used by
Dependency tree · two levels
18 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
- GAP SmallCancellation manual, Chapter 1: Small Cancellation Theory — the classical conditions (standard reference, not scraped)
- Jay Williams, Universal Countable Borel Quasi-Orders (standard reference, not scraped)
- Nicholas Touikan, An Introduction to Combinatorial and Geometric Group Theory, Section 3.5 (standard reference, not scraped)
- Clara Löh, Geometric Group Theory: An Introduction, Section 7.4.1 (standard reference, not scraped)