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.
Conjugacy in a free group by cyclic reduction
Example
In the free group on , the cyclically reduced words and are conjugate.
Facts & Assumptions
Given: The conjugacy problem asks whether two words represent conjugate elements.
In a free group, two cyclically reduced words are conjugate if and only if one is a cyclic permutation of the other. (Two cyclically reduced words in a free group are conjugate if and only if one is a cyclic permutation of the other)
Verification
The word is obtained from by moving the initial letter to the end. So it is a cyclic permutation of the first word.
Both words are cyclically reduced, and [L1] therefore makes them conjugate in the free group.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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
- Alexei Myasnikov and Vladimir Shpilrain, Combinatorics over Free Groups (standard reference, not scraped)