Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-11
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.

Each Tietze transformation preserves the isomorphism type of the presented group

Statement

Each dictionary-generator, redundant-relator, or renaming transformation of Tietze transformations: dictionary generators, redundant relators, renaming, and their inverses, in either legal direction, carries a presentation to a presentation of an isomorphic group.

Facts & Assumptions

Given: A formal presentation P=XR\mathcal P=\langle X\mid R\rangle and one legal Tietze transformation applied to it.

[L1]

A map u:XHu:X\to H that sends every relator in RR to the identity extends uniquely to a homomorphism XRH\langle X\mid R\rangle\to H (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).

[F1]

The normal closure of RR is the smallest normal subgroup containing RR (The normal closure of a subset of a group).

Proof

technique · constructive
1.1

For a dictionary move adjoining yy with y=w(X)y=w(X), [L1] gives a homomorphism from the enlarged presentation to the original one by fixing every old generator and sending yy to the element represented by ww; [L1] also gives a homomorphism in the other direction from the inclusion of the old generators, and their composites fix every generator, so uniqueness makes them inverse isomorphisms. The stated inverse condition removes exactly such a generator after all other occurrences of it have disappeared.

L1givenconstruct
1.2

If r ⁣R ⁣r\in\langle\!\langle R\rangle\!\rangle, then  ⁣R{r} ⁣= ⁣R ⁣\langle\!\langle R\cup\{r\}\rangle\!\rangle=\langle\!\langle R\rangle\!\rangle: one inclusion follows from RR{r}R\subseteq R\cup\{r\} and the other because the old normal closure already contains every new generator of the closure. Thus adding rr leaves the quotient unchanged, and the inverse condition states exactly that the same equality remains true after rr is deleted.

F1given
1.3

For a renaming bijection α:XY\alpha:X\to Y, the maps xα(x)x\mapsto\alpha(x) and yα1(y)y\mapsto\alpha^{-1}(y) send the corresponding relators to the identity, so [L1] extends them to homomorphisms between the two presented groups; their composites fix all generators and are identities by uniqueness.

L1givenconstruct
2.1

Each allowed forward move is covered by steps 1.1 through 1.3, and each inverse is legal under the side condition that makes it the reverse of the same construction; hence every Tietze transformation preserves the presented group's isomorphism type.

step 1.1step 1.2step 1.3discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 28 results over 12 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources