Alphabeta Math
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.

✓ 7 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 7 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Subgroups of Free Groups and Schreier Rewriting — Examples

1 · Prerequisites

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

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

An index-two subgroup of a rank-two free group has rank three

Example

Let H≤F(a,b) be the subgroup of reduced words with even exponent sum in a. Then H has index 2 and free basis

{b, a2, aba−1}.

Consequently rank⁡(H)=3.

Facts & Assumptions

Given: The subgroup H≤F(a,b) of words with even exponent sum in a.

[L1]

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).

[L2]

The index-rank formula gives rank⁡(H)=1+[F(a,b):H] (The Schreier index-rank formula).

Verification

technique · direct
1.1givenconstruct

The two right cosets are H and Ha, so T={1,a} is a Schreier system. Its nontrivial Schreier generators are s(1,b)=b, s(a,a)=a2, and s(a,b)=aba−1, while s(1,a)=1.

2.1L1L2step 1.1∎

By [L1], the three nontrivial generators from step 1.1 form a free basis of H. Since [F(a,b):H]=2, [L2] also gives rank⁡(H)=1+2(2−1)=3, agreeing with the computed basis.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

The kernel of an exponent-sum map in a free group

Example

Let ϕ:F(a,b)→Z send a↦1 and b↦0, and let H=ker⁡ϕ. Then the family

{anba−n:n∈Z}

is a free basis of H.

Facts & Assumptions

Given: The kernel H=ker⁡ϕ of the exponent-sum map above.

[L1]

A Schreier system is a family of reduced right-coset representatives closed under initial segments (Schreier transversals and Schreier systems).

[L2]

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

technique · direct
1.1L1givenconstruct

The right cosets of H are Han for n∈Z, so T={an:n∈Z} is a Schreier system by [L1].

2.1step 1.1algebra

For every n∈Z, one has s(an,a)=1 and s(an,b)=anba−n. Thus the nontrivial Schreier generators are exactly the displayed conjugates.

3.1L2step 2.1∎

By [L2], those generators form a free basis of H.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

A Schreier coset graph and its spanning-tree basis

Example

Let H be the kernel of the homomorphism F(a,b)→Z/2Z×Z/2Z sending both a and b to the nontrivial element of the corresponding factor. Then the Schreier graph has four cosets

H, Ha, Hb, Hab,

and the non-tree edges of the rooted spanning tree

H→aHa,H→bHb,Ha→bHab

give the free basis

a2, b2, ab2a−1, abab−1, bab−1a−1.

Facts & Assumptions

Given: The subgroup H above.

[L1]

The Schreier graph records cosets and labeled generator edges (The labeled Schreier coset graph of a subgroup of a free group).

[L2]

Rooted spanning trees correspond to Schreier systems (Rooted spanning trees and Schreier systems correspond).

Verification

technique · direct
1.1L1givenconstruct

The quotient records only the parities of the exponent sums of a and b, so the four right cosets are exactly H, Ha, Hb, and Hab. The labeled Schreier graph therefore has a-edges H↔Ha and Hb↔Hab, and b-edges H↔Hb and Ha↔Hab.

2.1L2step 1.1algebra

The three displayed edges form a rooted spanning tree, so [L2] gives the corresponding Schreier system {1,a,b,ab}. The five positive edges not in that tree yield the nontrivial generators a2, b2, ab2a−1, abab−1, and bab−1a−1.

3.1L3step 2.1∎

By [L3], those five elements form a free basis of H.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

A Reidemeister-Schreier presentation for a surface subgroup

Example

Let

G=⟨a,b∣bab−1a⟩,

the Klein bottle group. The subgroup H=⟨a,b2⟩ has index 2 and Reidemeister-Schreier gives the presentation

H≅⟨x,y∣xyx−1y−1⟩≅Z2,

so H is the fundamental group of the torus.

Facts & Assumptions

Given: The Klein bottle presentation above and the subgroup H=⟨a,b2⟩.

[L1]

Reidemeister-Schreier presents a subgroup by rewritten Schreier generators and conjugated relators (The Reidemeister-Schreier presentation theorem).

Verification

technique · direct
1.1givenconstruct

The quotient by H has cosets H and Hb, so T={1,b} is a right transversal. The nontrivial Schreier generators are x=s(1,a)=a, z=s(b,a)=bab−1, and y=s(b,b)=b2.

2.1L1step 1.1algebra

The defining relator is r=bab−1a. Reidemeister-Schreier rewrites the two conjugates determined by T as τ(r)=zx and τ(brb−1)=yxy−1z. Therefore [L1] yields the presentation ⟨x,y,z∣zx, yxy−1z⟩.

3.1step 2.1algebra∎

The first relator gives z=x−1. Substituting this into the second relator yields yxy−1x−1. Hence the presentation from step 2.1 simplifies to ⟨x,y∣yxy−1x−1⟩, so the presented group is the free abelian group on two generators, that is, Z2. Thus H is a surface subgroup of torus type.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

A rank-two free group contains an infinite-rank subgroup

Example

The rank-two free group F(a,b) contains a subgroup of infinite rank, namely the kernel of the exponent-sum map ϕ(a)=1, ϕ(b)=0.

Facts & Assumptions

Given: The kernel H=ker⁡ϕ≤F(a,b) of the exponent-sum map.

[L1]

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

technique · direct
1.1givenconstruct

The right cosets of H are Han for n∈Z, so T={an:n∈Z} is a Schreier system. Its nontrivial Schreier generators are the infinitely many elements anba−n for n∈Z.

2.1L1step 1.1∎

By [L1], the family in step 1.1 is a free basis of H. Since that basis is infinite, H has infinite rank.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

Marshall Hall's theorem produces a separating finite-index overgroup

Example

In F(a,b), let H=⟨b,a2⟩ and w=a. Then the index-two subgroup

K=⟨b, a2, aba−1⟩

contains H as a free factor and omits w.

Facts & Assumptions

Given: The subgroup H=⟨b,a2⟩ of F(a,b) and the element w=a.

[L1]

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

technique · direct
1.1givenconstruct

The subgroup K consists of words with even exponent sum in a, so it has index 2 in F(a,b). The basis computation K=⟨b,a2,aba−1⟩ shows that H is generated by two members of that free basis.

2.1L1step 1.1∎

Hence K splits as the free product of H with the cyclic subgroup generated by aba−1, so H is a free factor of K. Also a∉K because its exponent sum in a is odd. This is a concrete separating finite-index overgroup of the kind promised abstractly by [L1].

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-28Open item page →

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.

[L1]

For this counterexample, if T is any right transversal containing 1, define its raw transversal elements by rT(t,x)=tx tx‾−1. When T is a Schreier system, these are the Schreier generators of Schreier generators in the right-coset convention.

[L2]

A Schreier system is stronger than an arbitrary transversal: it must be closed under initial segments (Schreier transversals and Schreier systems).

[L3]

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

technique · direct
1.1L2givenconstruct

Let H≤F(a,b) be the subgroup of words with even exponent sum in a. Its two right cosets are H and Ha. The set T={1,ab} is a transversal, but it is not a Schreier system because the initial segment a of ab is not in T.

2.1L1step 1.1algebra

Using [L1], the nontrivial raw transversal elements are ab−1a−1, b, aba, and aba−1. Indeed, the last one is rT(ab,b)=ab2(ab)−1=aba−1. This list is redundant because ab−1a−1=(aba−1)−1.

3.1L3step 2.1∎

By [L3], the reduced Schreier basis is guaranteed only for Schreier systems. Step 2.1 shows that the arbitrary transversal {1,ab} instead gives a redundant list, so it does not yield the reduced Schreier basis. The Schreier initial-segment condition is load-bearing.