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.
Reidemeister-Schreier relators are independent of word representatives
Statement
In the Reidemeister-Schreier theorem, replacing a defining relator by a freely equivalent word does not change the resulting subgroup presentation.
Facts & Assumptions
Given: A Reidemeister-Schreier presentation with Schreier system , and two freely equivalent relator words .
The normal closure of a set is the smallest normal subgroup containing it (The normal closure of a subset of a group).
Schreier rewriting is unchanged by free reduction (Schreier rewriting is invariant under free reduction).
The subgroup presentation is obtained from the rewritten conjugates (The Reidemeister-Schreier presentation theorem).
Proof
If is obtained from by one elementary cancellation or reverse insertion, then for every transversal element the word is obtained from by the same local free reduction inside the middle block. Therefore [L2] gives .
Any freely equivalent pair is connected by finitely many such moves, so the equality from step 1.1 persists through the whole chain. Thus every rewritten relator produced from is identical to the one produced from .
By [L1], replacing a generator of a normal closure by the same group element does not change that normal closure. Hence the presentation described in [L3] is independent of which freely equivalent word is chosen to represent each ambient relator.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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)