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 Reidemeister-Schreier presentation theorem
Statement
Let be a group presentation, let be the canonical quotient map, and let . Put , and choose a Schreier system for the right cosets of in . If denotes the nontrivial Schreier generators and the corresponding rewriting map, then has presentation
Facts & Assumptions
Given: A presentation , the quotient map , a subgroup , the preimage , a Schreier system , and its nontrivial Schreier generators .
A presentation is the quotient (Group presentation by generators and relations).
Elements of a normal closure are exactly finite products of conjugates of the generating relators and their inverses (The normal closure of is the set of finite products of conjugates of elements of and their inverses).
For a Schreier system, the nontrivial Schreier generators form a free basis of the subgroup (Under the stated choice boundary, every subgroup of a free group is free with its nontrivial Schreier generators as a basis).
For a word , the Schreier rewrite is defined from the successive representatives ; if represents an element of , then (The Schreier rewriting map).
The first isomorphism theorem identifies a quotient by a kernel with the image (First isomorphism theorem for groups: ).
Schreier generators are the elements (Schreier generators in the right-coset convention).
Proof
By [L3], the set of nontrivial Schreier generators is a free basis of . Therefore the inclusion extends to an isomorphism .
By [L1], the ambient quotient is with . The restriction of the quotient map to has image and kernel , so [L5] gives . By [L2], every element of is a finite product of conjugates with and . Writing with and turns each such conjugate into , so is contained in the normal closure in of the elements . Conversely, each lies in , and is normal in , so that normal closure is exactly .
Let be the quotient map, and put . Fix and , and write . Let and be the successive representatives and rewriting factors from [L4]. If , then [L6] gives , so . If , then is the chosen representative of the coset , so [L6] gives and again . Multiplying these identities yields , because forces by [L4]. Since , every rewritten relator lies in .
Conversely, if , then . By step 1.2, is a finite product of conjugates in of the elements and their inverses. Replacing each by the equal element from step 2.1 and applying the isomorphism shows that lies in the normal closure of the words in . Therefore .
The map is surjective onto , so [L5] gives . Substituting the kernel description from step 3.1 yields , which is the Reidemeister-Schreier presentation.
Depends on
- Group presentation by generators and relations
- Schreier generators in the right-coset convention
- The Schreier rewriting map
- Schreier transversals and Schreier systems
- The normal closure of $R$ is the set of finite products of conjugates of elements of $R$ and their inverses
- First isomorphism theorem for groups: $G/\ker f\cong\operatorname{im}f$
- Under the stated choice boundary, every subgroup of a free group is free with its nontrivial Schreier generators as a basis
Used by
- Finite-index subgroups of finitely presented groups are finitely presented Corollary
- A Reidemeister-Schreier presentation for a surface subgroup Example
- FALSE: the Reidemeister-Schreier presentation needs no choice of transversal False statement
- Reidemeister-Schreier relators are independent of word representatives Lemma
Dependency tree · two levels
26 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)