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.
The nontrivial Schreier generators generate the subgroup
Statement
Let be a free group, let , and let be a Schreier system. Then the nontrivial Schreier generators generate .
Facts & Assumptions
Given: A free group , a subgroup , and a Schreier system .
The Schreier rewrite of a word is , where if and if ; in either case (The Schreier rewriting map).
Every Schreier generator lies in (Every Schreier generator lies in the subgroup).
Schreier rewriting is unchanged by free reduction (Schreier rewriting is invariant under free reduction).
Proof
Let , and choose any word on representing . By [L3], free-reducing does not change its rewrite, so we may assume is reduced. If denotes the chosen representative of the coset of the prefix , and if is the th Schreier rewriting factor from [L1], then for every .
Multiplying the identities from step 1.1 yields . Because , the last coset is , so the final representative is . Thus is a product of Schreier generators and their inverses.
By [L2], each Schreier generator belongs to , so the same is true for its inverse. After deleting the trivial factors in the product from step 2.1, we obtain an expression for as a product of nontrivial Schreier generators and their inverses. Therefore those nontrivial generators generate .
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
- M. I. Kargapolov and Ju. I. Merzljakov, Fundamentals of the Theory of Groups (standard reference, not scraped)
- Roger C. Lyndon and Paul E. Schupp, Combinatorial Group Theory (standard reference, not scraped)