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 and one legal Tietze transformation applied to it.
A map that sends every relator in to the identity extends uniquely to a homomorphism (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).
The normal closure of is the smallest normal subgroup containing (The normal closure of a subset of a group).
Proof
For a dictionary move adjoining with , [L1] gives a homomorphism from the enlarged presentation to the original one by fixing every old generator and sending to the element represented by ; [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.
If , then : one inclusion follows from and the other because the old normal closure already contains every new generator of the closure. Thus adding leaves the quotient unchanged, and the inverse condition states exactly that the same equality remains true after is deleted.
For a renaming bijection , the maps and 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.
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.
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
- Nicholas Touikan, An Introduction to Combinatorial and Geometric Group Theory, §1.6 (standard reference, not scraped)