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.
Periodic words: a relator root or Dehn-reduced powers
Statement
Let be a nonempty cyclically Dehn-reduced word in a symmetrised presentation. At least one of the following holds:
- a cyclic rotation of and a defining relator are positive powers of a common nonempty word;
- every positive power of is Dehn-reduced;
- is conjugate in the presented group to a nonempty word whose every positive power is Dehn-reduced.
The relator set may be infinite.
Facts & Assumptions
Given: The word in the statement, of positive length . Equalities between strings below are literal unless expressly stated in the quotient group.
Cyclic Dehn reduction forbids a relator segment longer than half its relator in any rotation of (Cyclically Dehn-reduced words).
For a relator with , either is a piece, or and that relator have a common word root; the empty remainder case is included (Sc toolkit periodic relator overlap is a piece).
Distinct symmetrised relators sharing a nonempty prefix make that prefix a piece, strictly shorter than one sixth of either relator under (Sc toolkit symmetrised relators and pieces).
Proof
Assume the first alternative fails. Let be a segment longer than half a relator in a positive power of . Rotate so that the start of is the start of a period . If , write , with and a proper prefix of . Write . By [F2], either have a common root (excluded), or . In the latter case and , so , a contradiction. Thus every such segment is contained in the square of a rotation. If none exists, every power is freely reduced (since is cyclically reduced) and Dehn-reduced, the second alternative.
Otherwise choose such an of greatest length among all rotations and relators. This maximum exists because ; an infinite set of relators creates no problem for this finite set of lengths. By [F1], . Consequently , , where , is possibly empty and . Rotate to write . Since the length- initial segment is Dehn-reduced, , while gives .
If is empty, ; [F2] either gives the excluded common root or , contradicting . Thus is nonempty. Also is nonempty: otherwise forces . The joins and are reduced because is cyclically reduced. The joins and are reduced as well. Indeed cancellation in would make the last letter of the last letter of , extending the match one letter to the left around the periodic word; cancellation in extends it one letter to the right. Since , either extension is still a segment of and is longer than half . Step 1.1 then bounds its length by , contradicting maximality of .
Compare with its rotation , based at the second copy of . Equality would, after cancelling its first , give , whose first letters force cancellation in (both are nonempty). Hence these rotations are distinct and their common prefix is a piece. Therefore . Put , , , . The inequalities and give . The bound gives , in particular . Also .
Set . It is nonempty and cyclically reduced by step 3.1. In the quotient, , hence . Since is a cyclic rotation of , this makes conjugate to . To prove all powers of Dehn-reduced, suppose a segment in some is longer than half a relator . Regard as part of the bi-infinite alternating string of nonempty blocks . Whenever two cyclically read relators share a segment at least one sixth of either relator, they must be identical when based at that segment; otherwise this is a forbidden piece by [F3]. This observation permits comparisons both before and after the matched segment, because equal based relators are equal cyclic strings.
If contains a whole block, compare based there with based at , which reads . Since , these based relators must agree. If continues past , its next letter is the first of , whereas the relator prescribes the first of ; equality contradicts reducedness of . If begins before , the preceding letter is the last of , whereas the relator prescribes the last of ; equality contradicts reducedness of . If neither occurs, and , again impossible.
If contains a whole block, compare there with based at , namely . The bound forces equality. An extension after equates the first letters of and , contradicting the cyclically reduced join in . An extension before equates the last letters of and , contradicting the reduced join in . With no extension, has length at most , impossible.
Suppose lies inside a single or block. Its length exceeds , so comparison with that occurrence in or forces equality of the based relators. Then , whereas both block lengths are at most , a contradiction. This includes a segment touching either endpoint of just one block.
Otherwise contains no whole block and crosses one join. For a join write with nonempty proper suffix of and nonempty proper prefix of . At least one part has length greater than , hence greater than . If it is , comparison with its occurrence in forces equal cyclic relators; their next letters are respectively the first of and the first of , contrary to reducedness of . If it is , comparison with forces equality; immediately preceding the letters would be the last of and the last of , contrary to reducedness of .
At a join write . If the suffix exceeds , align it with ; the following letters would equate the first of and the first of , contrary to reducedness of . If the prefix exceeds , align it with ; the preceding letters would equate the last of and the last of , contrary to reducedness of . At least one inequality holds because . These are all possibilities: crossing two joins would include a whole intervening block, already excluded. Thus no contains such , proving the third alternative. Combined with step 1.1 and step 2.1 and step 3.1, this proves the asserted alternative without using any infinite-order hypothesis or finiteness of .
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
- Lipschutz (1964), Lemma 4 and complete §6 proof, printed pp.39,41–42; common-root exceptions retained locally (standard reference, not scraped)