Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 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.

FALSE: the Reidemeister-Schreier presentation needs no choice of transversal

Statement

The Reidemeister-Schreier presentation of a subgroup does not depend on the chosen transversal.

Facts & Assumptions

Given: The false claim above.

[L1]

Reidemeister-Schreier uses a chosen Schreier system or transversal and rewrites words through its representatives (The Reidemeister-Schreier presentation theorem).

Refutation

technique · direct
1.1givenconstruct

Let G=F(a,b)=⟨a,b∣ ⟩, and let H≤G be the subgroup of words with even exponent sum in a. The two right cosets are H and Ha, so both {1,a} and {1,a−1} are Schreier systems.

2.1L1step 1.1algebra

With the Schreier system {1,a}, the nontrivial Schreier generators are b, a2, and aba−1. With the Schreier system {1,a−1}, the corresponding nontrivial Schreier generators are b, a2, and a−1ba. These are different generator lists.

3.1step 2.1∎

The subgroup presented is the same subgroup H, but the rewritten generators depend on the chosen representatives. Therefore the Reidemeister-Schreier presentation does depend on the transversal.

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.

Sources