Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck 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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

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