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.
Every HNN conjugacy class contains a cyclically Britton-reduced representative
Statement
Every element of an HNN extension is conjugate to a cyclically Britton-reduced HNN word.
Facts & Assumptions
Given: An element of an HNN extension.
A cyclically Britton-reduced word is a Britton-reduced word with no pin across its two ends. (Cyclically Britton-reduced HNN words)
Elementary pin reductions preserve the represented element. (Elementary HNN reductions preserve the represented element)
A Britton-reduced word containing a stable letter is nontrivial. (Britton's lemma)
Proof
Choose, among all conjugates of the given element, a Britton-reduced representative of minimal stable-letter length. Such a representative exists because one may first Britton-reduce any conjugate using [L2].
If were not cyclically Britton-reduced, [L1] would give a pin across the two ends. Conjugating by the initial stable-letter syllable rotates that end-pin into the interior of the word, and [L2] then removes it to produce a conjugate with strictly smaller stable-letter length, contradicting the minimal choice in step 1.1.
Therefore the minimal Britton-reduced representative from step 1.1 has no end-pin and is cyclically Britton-reduced. The nontriviality clause [L3] ensures that the shortening in step 2.1 is genuine whenever a stable letter is present.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
5 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
- Roger C. Lyndon and Paul E. Schupp, Combinatorial Group Theory (standard reference, not scraped)