Group Presentations: Generators and Relations
Handbook guide to group presentations: generators and relations with core definitions, structural results, reasoning methods and verification checks.
How the topic fits together
Generators And Relations
This source section supplies the definitions, constructions and formal results used in this article. The sequence of results is preserved so later claims are not detached from their prerequisites.
Core definitions and structural results
The following cards retain the mathematical content of the source while condensing long proofs into verification strategies. Numerical examples are treated as examples, not universal requirements.
Definition
The free group G on the set S (or the free group with basis S) consists of all words on S, that is, all finite sequences x1 · · · xn, n = 0, 1, . . ., where each xi is either an element of S or the inverse of an element of S. We regard the case n = 0 as the empty word λ. The group operation is concatenation, subject to the constraint that if s and s−1 occur in succession, they can be cancelled. The empty word is the identity, and inverses are calculated in the only reasonable way, for example, (stu)−1 = u−1t−1s−1.
Proof / verification strategy: Use this as a definition checklist: identify the ambient object, test each stated condition separately, then compare examples and non-examples without assuming later theorems.
Theorem
If G is free on S and g is an arbitrary function from S to a group H, then there is a unique homomorphism f : G →H such that f = g on S.
Proof / verification strategy: Work directly from closure, inverses, subgroup tests and the defining action or presentation. Use a small cyclic or permutation model to verify the direction of the argument.
Corollary Any group H is a homomorphic image of a free group.
Any group H is a homomorphic image of a free group.
Proof / verification strategy: Work directly from closure, inverses, subgroup tests and the defining action or presentation. Use a small cyclic or permutation model to verify the direction of the argument.
Definition
Let G be free on the set S, and let K be a subset of G. Define the group < S | K > as G/K, where K is the smallest normal subgroup of G containing K. Unfortunately, it is a theorem of mathematical logic that there is no algorithm which when given a presentation, will find the order of the group. In fact, there is no algorithm to determine whether a given word of < S | K > coincides with the identity.
Proof / verification strategy: Use this as a definition checklist: identify the ambient object, test each stated condition separately, then compare examples and non-examples without assuming later theorems.
Von Dyck’s Theorem Let H =< S | K > be a presentation, and let L be a group
Von Dyck’s Theorem Let H =< S | K > be a presentation, and let L be a group that is generated by the words in S. If L satisfies all the relations of K, then there is an epimorphism α : H →L. Consequently, |H| ≥|L|.
Proof / verification strategy: Work directly from closure, inverses, subgroup tests and the defining action or presentation. Use a small cyclic or permutation model to verify the direction of the argument.
Quick-reference relationships
Problem-solving workflow
Identify the ambient group
State the operation, identity, inverses and whether commutativity is available.
Locate the relevant subgroup structure
Check generated subgroups, normality, cosets, stabilisers or direct factors before applying a theorem.
Use the correct counting or mapping tool
Choose coset counting, orbit counting, a homomorphism, a quotient or a group action as appropriate.
Check hypotheses explicitly
Finite-order assumptions, normality, prime-power divisibility and coprimality conditions are not interchangeable.
Translate the result back to structure
Interpret the result as a statement about subgroup size, quotient structure, action, decomposition or presentation.
Verify with a small model
Use a cyclic, symmetric, dihedral or modular example to test the logic without treating the example as the theorem.
Worked-solution emphasis from the supplied source
The supplied worked solutions for this section repeatedly test order, subgroup, degree, homomorphism, automorphism, exact, injective, prime. These checks are used here as verification themes rather than copied as answer text.
Common mistakes and boundary conditions
- Treating left and right cosets as identical without normality.
- Assuming the converse of a subgroup-order divisibility result.
- Confusing the order of a group with the order of one of its elements.
- Using quotient multiplication before checking that the subgroup is normal.
- Forgetting the coefficient ring when comparing modules.
- Assuming tensor product preserves every exact sequence.
Verification checklist
- State the ambient algebraic structure and operation before applying a theorem.
- Record every hypothesis that controls the result: finiteness, commutativity, normality, primality, separability, exactness or other section-specific conditions.
- Distinguish a definition from a theorem that follows from it.
- Check whether a map is well-defined before using its kernel, image, inverse or induced map.
- Use a concrete example only as a check; do not promote an illustrative value or pattern to a universal rule.
- When a quotient, localisation or extension is constructed, identify the canonical map and what becomes equal, invertible or fixed.
Source coverage map
| Source section | Subject | PDF pages analysed |
|---|---|---|
| 5.8 | Generators And Relations | 102–104 |
Related Mathematics pages
Source note: synthesised from the supplied abstract-algebra PDF. The complete 298-page file, including diagrams and worked solutions, was reviewed. Source-identifying author and bibliographic personal details are intentionally omitted. Formal proofs are condensed; the page does not claim requirements or values not supported by the supplied mathematics.