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.
Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group
Statement
Let be a presentation, let be a group, and let be a function. If the evaluation of every under is , then there is a unique homomorphism
with for every . Moreover, is surjective if and only if generates .
Facts & Assumptions
Given: A presentation , a group , and a function whose evaluation sends every to .
If , is a homomorphism, and , then there is a unique homomorphism with (A homomorphism that kills a normal subgroup factors uniquely through the quotient group).
For every group and every function , there is a unique group homomorphism extending (Free group on a set of generators).
For a normal subgroup , the canonical projection is surjective (The canonical projection , , is a surjective group homomorphism).
The normal closure of is the smallest normal subgroup containing (The normal closure of a subset of a group).
The subgroup is the smallest subgroup containing (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
For every group homomorphism , one has and (The image of a group homomorphism is a subgroup and its kernel is a normal subgroup).
A group homomorphism preserves products, identities, and inverses, and a composite of group homomorphisms is a group homomorphism (Monoid homomorphism and group homomorphism).
The presented group is (Group presentation by generators and relations).
Proof
By [L2], construct the unique homomorphism whose value on each free generator is .
The free generators generate : if , the map extends by [L2] to , and inclusion makes agree with on , so uniqueness gives and . By [L3], the canonical quotient map is surjective; since it sends to the classes , [F2] and [F3] show that these classes generate the presented group.
The hypothesis puts every in ; [L4] makes the kernel normal, so the minimality in [F1] gives .
By [F4], apply [L1] to factor uniquely through , obtaining with .
If also has , then [F3] makes a homomorphism extending , so [L2] gives ; uniqueness of the factorisation in [L1] gives .
By [L4], is a subgroup containing every , so [F2] gives . Conversely, put . By [F3], is a subgroup of the domain, and it contains every ; step 1.2 and [F2] therefore give . Hence , so . Thus is surjective exactly when generates .
Depends on
- Group presentation by generators and relations
- Free group on a set of generators
- The normal closure of a subset of a group
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
- A homomorphism that kills a normal subgroup factors uniquely through the quotient group
- The canonical projection $\pi:G\to G/N$, $\pi(g)=gN$, is a surjective group homomorphism
- The kernel and image of a group homomorphism
- The image of a group homomorphism is a subgroup and its kernel is a normal subgroup
- Monoid homomorphism and group homomorphism
Used by
- Every finite group has a finite presentation from its multiplication table Corollary
- ⟨ a,b∣ a², b², aba⁻¹b⁻¹⟩≅(ℤ/2)×(ℤ/2) Example
- ⟨ a,b∣ aba⁻¹b⁻¹⟩≅(ℤ,+)×(ℤ,+) Example
- ⟨ a∣ aⁿ⟩≅(ℤ/n,+) for every n≥ 1 Example
- Dₙ≅⟨ r,s∣ rⁿ, s², srs⁻¹r⟩ for the dihedral group Dₙ=⟨{ρ,σ}⟩leqSym(ℤ/n), n≥ 3 Example
- Sym({0,1,2})≅⟨ s,t∣ s², t², (st)³⟩ Example
- Each Tietze transformation preserves the isomorphism type of the presented group Proposition
- A free product has the union presentation of presentations of its factors Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 47 results over 17 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
- Ashot Minasyan, MATH6138 Geometric Group Theory, §2.2 (standard reference, not scraped)
- Nicholas Touikan, An Introduction to Combinatorial and Geometric Group Theory, §1.6 (standard reference, not scraped)