Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-28
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 G=XR be a group presentation, let π:F(X)G be the canonical quotient map, and let HG. Put H=π1(H)F(X), and choose a Schreier system T for the right cosets of H in F(X). If S denotes the nontrivial Schreier generators and τ the corresponding rewriting map, then H has presentation

HSτ(trt1) for tT, rR.

Facts & Assumptions

Given: A presentation G=XR, the quotient map π:F(X)G, a subgroup HG, the preimage H=π1(H), a Schreier system T, and its nontrivial Schreier generators S.

[L1]

A presentation is the quotient F(X)/ ⁣R ⁣ (Group presentation by generators and relations).

[L2]

Elements of a normal closure are exactly finite products of conjugates of the generating relators and their inverses (The normal closure of R is the set of finite products of conjugates of elements of R and their inverses).

[L3]

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

[L4]

For a word w=a1an, the Schreier rewrite τ(w)=σ1σn is defined from the successive representatives tj=a1aj; if w represents an element of H, then tn=1 (The Schreier rewriting map).

[L5]

The first isomorphism theorem identifies a quotient by a kernel with the image (First isomorphism theorem for groups: G/kerfimf).

[L6]

Schreier generators are the elements s(u,x)=uxux1 (Schreier generators in the right-coset convention).

Proof

technique · direct
1.1

By [L3], the set S of nontrivial Schreier generators is a free basis of H. Therefore the inclusion SH extends to an isomorphism ρ:F(S)H.

L3givenconstruct
1.2

By [L1], the ambient quotient is G=F(X)/N with N= ⁣R ⁣F(X). The restriction of the quotient map to H has image H and kernel HN, so [L5] gives HH/(HN). By [L2], every element of HN is a finite product of conjugates ur±1u1 with uF(X) and rR. Writing u=ht with hH and tT turns each such conjugate into h(tr±1t1)h1, so HN is contained in the normal closure in H of the elements trt1. Conversely, each trt1 lies in HN, and HN is normal in H, so that normal closure is exactly HN.

L1L2L5given
2.1

Let q:HH/(HN) be the quotient map, and put ρˉ=qρ:F(S)H/(HN)H. Fix tT and rR, and write trt1=a1an. Let tj and σj be the successive representatives and rewriting factors from [L4]. If aj=xX, then [L6] gives σj=s(tj1,x)=tj1xtj1, so tj1aj=σjtj. If aj=x1, then tj1 is the chosen representative of the coset Htjx, so [L6] gives σj=s(tj,x)1=tj1x1tj1 and again tj1aj=σjtj. Multiplying these identities yields trt1=σ1σntn=ρ(τ(trt1)), because trt1H forces tn=1 by [L4]. Since trt1HN, every rewritten relator τ(trt1) lies in kerρˉ.

L4L6step 1.1step 1.2construct
3.1

Conversely, if wkerρˉ, then ρ(w)HN. By step 1.2, ρ(w) is a finite product of conjugates in H of the elements trt1 and their inverses. Replacing each trt1 by the equal element ρ(τ(trt1)) from step 2.1 and applying the isomorphism ρ1 shows that w lies in the normal closure of the words τ(trt1) in F(S). Therefore kerρˉ= ⁣τ(trt1):tT, rR ⁣F(S).

step 1.1step 1.2step 2.1
4.1

The map ρˉ is surjective onto H/(HN)H, so [L5] gives F(S)/kerρˉH. Substituting the kernel description from step 3.1 yields HSτ(trt1) for tT, rR, which is the Reidemeister-Schreier presentation.

L5step 3.1

Depends on

Used by

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