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.
Subgroups of Free Groups and Schreier Rewriting — Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Products and Amalgamation
- Group Homomorphisms and the Isomorphism Theorems
- Normal Subgroups and Quotient Groups
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- Subgroups of Free Groups and Schreier Rewriting
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
These examples compute Schreier generators in small subgroups of free groups, show how the index-rank formula appears in explicit coset graphs, and run one Reidemeister-Schreier calculation to a familiar surface-group presentation. They also isolate the two routine pitfalls of the method: infinite-index subgroups can have infinite bases, and a transversal that is not a Schreier system need not produce the reduced basis promised by Nielsen-Schreier.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
An index-two subgroup of a rank-two free group has rank three
Example
Let be the subgroup of reduced words with even exponent sum in . Then has index and free basis
Consequently .
Facts & Assumptions
Given: The subgroup of words with even exponent sum in .
Nielsen-Schreier identifies a free basis from the nontrivial Schreier generators of a Schreier system (Under the stated choice boundary, every subgroup of a free group is free with its nontrivial Schreier generators as a basis).
The index-rank formula gives (The Schreier index-rank formula).
Verification
The two right cosets are and , so is a Schreier system. Its nontrivial Schreier generators are , , and , while .
By [L1], the three nontrivial generators from step 1.1 form a free basis of . Since , [L2] also gives , agreeing with the computed basis.
The kernel of an exponent-sum map in a free group
Example
Let send and , and let . Then the family
is a free basis of .
Facts & Assumptions
Given: The kernel of the exponent-sum map above.
A Schreier system is a family of reduced right-coset representatives closed under initial segments (Schreier transversals and Schreier systems).
Nielsen-Schreier promotes the nontrivial Schreier generators of such a system to a free basis (Under the stated choice boundary, every subgroup of a free group is free with its nontrivial Schreier generators as a basis).
Verification
The right cosets of are for , so is a Schreier system by [L1].
For every , one has and . Thus the nontrivial Schreier generators are exactly the displayed conjugates.
By [L2], those generators form a free basis of .
A Schreier coset graph and its spanning-tree basis
Example
Let be the kernel of the homomorphism sending both and to the nontrivial element of the corresponding factor. Then the Schreier graph has four cosets
and the non-tree edges of the rooted spanning tree
give the free basis
Facts & Assumptions
Given: The subgroup above.
The Schreier graph records cosets and labeled generator edges (The labeled Schreier coset graph of a subgroup of a free group).
Rooted spanning trees correspond to Schreier systems (Rooted spanning trees and Schreier systems correspond).
The nontrivial Schreier generators of such a tree form a free basis (Under the stated choice boundary, every subgroup of a free group is free with its nontrivial Schreier generators as a basis).
Verification
The quotient records only the parities of the exponent sums of and , so the four right cosets are exactly , , , and . The labeled Schreier graph therefore has -edges and , and -edges and .
The three displayed edges form a rooted spanning tree, so [L2] gives the corresponding Schreier system . The five positive edges not in that tree yield the nontrivial generators , , , , and .
By [L3], those five elements form a free basis of .
A Reidemeister-Schreier presentation for a surface subgroup
Example
Let
the Klein bottle group. The subgroup has index and Reidemeister-Schreier gives the presentation
so is the fundamental group of the torus.
Facts & Assumptions
Given: The Klein bottle presentation above and the subgroup .
Reidemeister-Schreier presents a subgroup by rewritten Schreier generators and conjugated relators (The Reidemeister-Schreier presentation theorem).
Verification
The quotient by has cosets and , so is a right transversal. The nontrivial Schreier generators are , , and .
The defining relator is . Reidemeister-Schreier rewrites the two conjugates determined by as and . Therefore [L1] yields the presentation .
The first relator gives . Substituting this into the second relator yields . Hence the presentation from step 2.1 simplifies to , so the presented group is the free abelian group on two generators, that is, . Thus is a surface subgroup of torus type.
A rank-two free group contains an infinite-rank subgroup
Example
The rank-two free group contains a subgroup of infinite rank, namely the kernel of the exponent-sum map , .
Facts & Assumptions
Given: The kernel of the exponent-sum map.
Nielsen-Schreier makes the nontrivial Schreier generators of a Schreier system into a free basis (Under the stated choice boundary, every subgroup of a free group is free with its nontrivial Schreier generators as a basis).
Verification
The right cosets of are for , so is a Schreier system. Its nontrivial Schreier generators are the infinitely many elements for .
By [L1], the family in step 1.1 is a free basis of . Since that basis is infinite, has infinite rank.
Marshall Hall's theorem produces a separating finite-index overgroup
Example
In , let and . Then the index-two subgroup
contains as a free factor and omits .
Facts & Assumptions
Given: The subgroup of and the element .
Every finitely generated subgroup of a finite-rank free group is a free factor of some finite-index subgroup (Every finitely generated subgroup of a finite-rank free group is a free factor of a finite-index subgroup).
Verification
The subgroup consists of words with even exponent sum in , so it has index in . The basis computation shows that is generated by two members of that free basis.
Hence splits as the free product of with the cyclic subgroup generated by , so is a free factor of . Also because its exponent sum in is odd. This is a concrete separating finite-index overgroup of the kind promised abstractly by [L1].
An arbitrary transversal need not give the reduced Schreier basis
Statement refuted
Any transversal of right cosets automatically yields the reduced Schreier basis.
Facts & Assumptions
Given: The false claim above.
For this counterexample, if is any right transversal containing , define its raw transversal elements by . When is a Schreier system, these are the Schreier generators of Schreier generators in the right-coset convention.
A Schreier system is stronger than an arbitrary transversal: it must be closed under initial segments (Schreier transversals and Schreier systems).
Nielsen-Schreier extracts a free basis from the nontrivial Schreier generators only when the representatives form a Schreier system (Under the stated choice boundary, every subgroup of a free group is free with its nontrivial Schreier generators as a basis).
Counterexample
Let be the subgroup of words with even exponent sum in . Its two right cosets are and . The set is a transversal, but it is not a Schreier system because the initial segment of is not in .
Using [L1], the nontrivial raw transversal elements are , , , and . Indeed, the last one is . This list is redundant because .
By [L3], the reduced Schreier basis is guaranteed only for Schreier systems. Step 2.1 shows that the arbitrary transversal instead gives a redundant list, so it does not yield the reduced Schreier basis. The Schreier initial-segment condition is load-bearing.