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.
A shortest finite-order representative shares a word root with a relator
Statement
For a shortest representative of a nonidentity finite-order conjugacy class in a symmetrised presentation, a cyclic rotation of and a cyclic conjugate of a defining relator are positive powers of a common nonempty word.
Facts & Assumptions
Given: A nonidentity finite-order element and a shortest conjugacy representative in the conventions below.
Every nonempty freely reduced null word has, in a cyclic reading, a relator segment longer than half that relator (Greendlinger shell existence from the curvature count).
Shortest conjugacy representatives exist, are nonempty and cyclically reduced; relator roots and minimal power diagrams have the conventions of Minimal cyclic power diagram and relator root.
A nonempty cyclically Dehn-reduced word shares a common root with a relator, or all its powers are Dehn-reduced, or its square is conjugate to a nonempty word all of whose powers are Dehn-reduced (Periodic words: a relator root or Dehn-reduced powers).
Proof
The word is nonempty and cyclically reduced by [F2]. Every cyclic rotation represents a conjugate of the original element. If such a rotation contained with and , replace by in that rotation. The quotient element is unchanged since , while length strictly decreases since ; subsequent free reduction cannot increase length. This contradicts shortest conjugacy length. Hence is cyclically Dehn-reduced.
Any nonempty word all of whose positive powers are Dehn-reduced has infinite order. Indeed if , its nonempty freely reduced literal word has a long cyclic relator segment by [F1]. Every cyclic segment of of length at most appears as a literal segment of by taking two copies of that cyclic word. This contradicts Dehn reduction of . This argument also covers n=1 and a segment crossing the chosen basepoint.
Apply [F3] using step 1.1. Its all-powers alternative for contradicts finite order by step 1.2. Its square alternative gives conjugate to a nonempty of infinite order by step 1.2. But if then , and conjugation preserves this equation; hence has finite order, a contradiction, even when . Only the common-root alternative remains. The inverse of a defining relator has the inverse root, so the conclusion may equally be expressed using cyclic conjugates of the original oriented defining words and integer powers of their roots.
Depends on
Used by
Dependency tree · two levels
12 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
- Lipschutz (1964), §6, printed pp.41–42; local torsion deduction retaining the common-root alternative (standard reference, not scraped)