Group theory studies algebraic symmetry through a set, a closed associative operation, an identity and inverses. The practical discipline is to move between elements, subgroups, maps, quotients and actions without losing the hypotheses that justify each step. This page consolidates the relevant material from the supplied algebra source into a stand-alone handbook chapter.
Learning pathGroup Theory
LevelAdvanced
FormatHandbook guide
Read time11 min
Executive summary
This chapter develops free groups, presentations and subgroup structure as part of a connected advanced-algebra learning sequence. The emphasis is on definitions, hypotheses, structural results and repeatable methods rather than historical narrative.
The source material is theorem-rich. Accordingly, the handbook presentation separates vocabulary from results and then adds a verification workflow so that each statement can be applied safely. Mathematical examples in the source are treated as examples, not as universal rules.
Problem-solving workflow
Identify the group, operation and identity, and decide whether additive or multiplicative notation is being used.
Determine the relevant subgroup and whether normality is required.
Use element order, cosets or a homomorphism to convert the question into a structural one.
When a quotient is involved, verify normality before forming cosets as group elements.
For an action, identify orbits, stabilisers, kernels and fixed points before counting.
Check the conclusion by tracing it back through the defining operation or map.
Core definitions
Definition
The group of generalized quaternions Qn, where n ≥3, is a group of order 2n that is generated by two elements a and b such that a2n−1 = 1, bab−1 = a−1, and b2 = a2n−2. When n = 3, this is the group Q of order 8. An obvious defect in this definition is that the existence of such a group is left in doubt; for example, is there such a group of order 16? Notice that it is not enough to find a group G = ⟨a, b⟩in which a8 = 1, bab−1 = a−1, and b2 = a4. For example, the group G = ⟨a, b⟩in which a2 = 1 and b = 1 (which is, of course, cyclic of order 2) satisfies all of the equations. It was W. von Dyck, in the 1880s, who invented free groups in order to make such descriptions rigorous. Here is a modern definition of a free group.
Definition
A subword of a word w = xe1 1 · · · xen n is either the empty word or a word of the form u = xer r · · · xes s , where 1 ≤r ≤s ≤n. The inverse of a word w = xe1 1 · · · xen n is w−1 = x−en n · · · x−e1 . It follows that (w−1)−1 = w for every word w. The most important words are reduced words.
Definition
A word w on X is reduced if w = 1 or if w has no subwords of the form xx−1 or x−1x, where x ∈X. Any two words on X can be multiplied.
Definition
Let A and B be words on X, possibly empty, and let w = AB. An elementary operation is either an insertion, changing w = AB to Aaa−1B for some a ∈X ∪X−1, or a deletion of a subword of w of the form aa−1, changing w = Aaa−1B to AB.
Definition
A semigroup is a set having an associative operation; a monoid is a semigroup S having an identity element 1; that is, 1s = s = s1 for all s ∈S. If S and S′ are semigroups, then a homomorphism is a function f : S →S′ such that f (xy) = f (x) f (y); if S and S′ are monoids, then a homomorphism f : S →S′ must also satisfy f (1) = 1. Of course, every group is a monoid, and a homomorphism between groups is a homomorphism of them qua monoids.
Definition
A presentation of a group G is an ordered pair G = (X | R), where X is a set, R is a set of words on X, and G = F/N, where F is the free group with basis X and N is the normal subgroup generated by R, that is, the subgroup generated by all conjugates of elements of R. We call the set X generators10 and the set R relations.
Definition
A group G is finitely generated if it has a presentation (X | R) with X finite. A group G is called finitely presented if it has a presentation (X | R) in which both X and R are finite. Remark. There are interesting connections between group theory and algebraic topology. If X is a topological space, then its fundamental group π1(X) is defined to be the set of all homotopy classes of continuous functions S1 →X, where S1 is the unit circle. A finite simplicial complex is a topological space that can be triangulated in the sense that it is the union of finitely many vertices, edges, triangles, tetrahedra, and so forth. We can prove that a group G is finitely presented if and only if there is a finite simplicial complex X with G ∼= π1(X). Quite often, a group is known only by some presentation of it. For example, suppose that X is a simplicial complex containing subcomplexes Y1 and Y2 such that Y1 ∪Y2 = X and Y1 ∩Y2 is connected. ◀
Definition
Let F be a free group with basis X and let S be a subgroup of F.
Principal results and structural facts
Key result
Let X be a set, and let W(X) be the set of all words on X [if X = ∅, then W(X) consists of only the empty word]. (i) W(X) is a monoid under juxtaposition. Presentations (ii) If u ∼u′ and v ∼v′, then uv ∼u′v′. (iii) If G is a group and f : X →G is a function, then there is a homomorphism Δf : W(X) →G extending f such that w ∼w′ implies Δf (w) = Δf (w′) in G.
Key result
If X is a set, then the set F of all equivalence classes of words on X with operation [u][v] = [uv] is a free group with basis {[x] : x ∈X}. Moreover, every element in F has a normal form: For each [u] ∈F, there is a unique reduced word w with [u] = [w].
Key result
If F is a free group with basis X = x1, . . . , xn, then F/F′ is a free abelian group with basis X′ = x1F′, . . . , xn F′, where F′ is the commutator subgroup of F. Presentations
Key result
Let F be the free group with basis X. If |X| = n, then every basis of F has n elements.
Key result
can now be restated: two free groups of finite rank are isomorphic if and only if they have the same rank.
Key result
The dihedral group D2n has a presentation D2n = (a, b | an = 1, b2 = 1, bab = a−1).
Key result
Every group G of order 8 is isomorphic to D8, Q, I8, I4 ⊕I2, or I2 ⊕I2 ⊕I2. Moreover, no two of the displayed groups are isomorphic.
Key result
If S is a subgroup of a free group F and if ℓis a transversal of S in F, then the set of all tSb,x that are distinct from 1 generates S.
Key result
Every subgroup S of a free group F is free.
Key result
Let F be a free group, and let u, v ∈F. Then u and v commute if and only if there is z ∈F with u, v ∈⟨z⟩.
Key result
If F is a free group of finite rank n, then every subgroup S of F having finite index j is also finitely generated. In fact, rank(S) = jn −j + 1.
Key result
There exist nonisomorphic finitely generated groups G and H each of which is isomorphic to a subgroup of the other.
Source-grounded examples
Worked source example
(i) The set of natural numbers N is a commutative monoid under addition. (ii) A direct product of monoids is again a monoid (with cooordinatewise operation). In particular, the set Nn of all n-tuples of natural numbers is a commutative additive monoid. ◀ Here is an example of a noncommutative monoid.
Worked source example
Consider the complex matrices A = ω ω−1 and B = −1 , where ω is a primitive 2n−1th root of unity, and let Hn = ⟨A, B⟩≤GL(2, C). We claim that A and B satisfy the relations in the definition of the generalized quaternion group. For all i ≥1, A2i = ω2i ω−2i , so that A2n−1 = I; indeed, A has order 2n−1. Moreover, B2 = −1 −1 = A2n−2 and B AB−1 = ω−1 ω = A−1. Notice that A and B do not commute; hence, B /∈⟨A⟩, and so the cosets ⟨A⟩and B⟨A⟩are distinct. Since A has order 2n−1, it follows that |Hn| ≥|⟨A⟩∪B⟨A⟩| = 2n−1 + 2n−1 = 2n. The next theorem will show that |Hn| = 2n. ◀
How to reason with these results
Most advanced-algebra problems become manageable when the representation is separated from the invariant structure. Begin with the definition, then decide whether the problem is asking for an elementwise calculation, a statement about a morphism, or a classification up to isomorphism. That choice determines the correct proof language.
When a theorem gives a structural conclusion, do not jump directly to the conclusion. Write the hypotheses next to the object you are studying and check them one by one. If a hypothesis fails, either strengthen the object, pass to a quotient or localisation where the theorem applies, or use a more elementary argument.
For computational work, record each transformation together with the equivalence relation it preserves. In algebra, row operations, similarity, quotienting, localisation and isomorphism preserve different kinds of information. A calculation is useful only when the preserved structure matches the question.
Common failure modes
Failure mode
Control
Assuming a subgroup is normal because it is large or familiar.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Cancelling across a noncommutative product in the wrong order.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Confusing left and right cosets.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Assuming a homomorphism is injective or surjective without checking kernel or image.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Using an orbit-counting formula without confirming a genuine group action.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Verification checklist
The ambient set, ring, field, group, module or category has been stated.
Every operation and map used is well-defined in that setting.
The hypotheses of each structural result have been checked before use.
Representatives, coordinates or generators have not been confused with the underlying object.
Existence and uniqueness have been separated where both matter.
The final result has been checked against the original defining relation or universal property.
Quick questions
What should I identify first in a problem about free groups, presentations and subgroup structure?
Start with the ambient algebraic structure, its operation or maps, and the exact hypotheses. Most incorrect solutions begin by using a familiar rule that is not valid in the stated structure.
How should definitions be used in proofs?
Expand the definition at the point where it becomes useful. Definitions are not background prose; they are the conditions that determine what must be proved and which implications are available.
When is a structural theorem safer than direct calculation?
Use a structural theorem when its hypotheses are satisfied and the calculation would otherwise depend on arbitrary coordinates, representatives or generators. The theorem usually identifies an invariant that survives those choices.
How can a final answer be checked?
Substitute the result back into the defining relation, verify any required closure or map property, and check edge cases such as zero, the identity, the empty object or degenerate quotients where relevant.
Connections within the handbook
Source basis: supplied advanced algebra reference. Source-identifying authorship, publisher information, acknowledgements and biographical material are intentionally omitted. Mathematical terminology and results are retained in handbook form.
