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 time10 min
Executive summary
This chapter develops normal subgroups and quotient groups 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
If H and K are groups, then their direct product, denoted by H × K, is the set of all ordered pairs (h, k) with h ∈H and k ∈K equipped with the operation (h, k)(h′, k′) = (hh′, kk′). It is easy to check that the direct product H × K is a group [the identity is (1, 1) and (h, k)−1 = (h−1, k−1)]. We now apply the first isomorphism theorem to direct products. Quotient Groups
Principal results and structural facts
Key result
A subgroup K of a group G is a normal subgroup if and only if gK = Kg for every g ∈G. Thus, every right coset of a normal subgroup is also a left coset.
Key result
(i) If H and K are subgroups of a group G, and if one of them is a normal subgroup, then HK is a subgroup of G; moreover, HK = KH in this case. (ii) If both H and K are normal subgroups, then HK is a normal subgroup. Remark. ◀
Key result
, that the relation ≡on G, defined by a ≡b if b−1a ∈K, is an equivalence relation whose equivalence classes are the cosets of K. Thus, we can view the elements of G/K as equivalence classes, with the multiplication aKbK = abK being independent of the choice of representative. We remind the reader of Lemma 2.40(i): If K is a subgroup of G, then two cosets aK and bK are equal if and only if b−1a ∈K. In particular, if b = 1, then aK = K if and only if a ∈K. We can now prove the converse of Proposition 2.56(ii).
Key result
If f : G →H is a homomorphism, then ker f ✁G and G/ ker f ∼= im f. In more detail, if ker f = K and ϕ : G/K →im f ≤H is given by ϕ : aK ↦f (a), then ϕ is an isomorphism. Remark. The following diagram describes the proof of the first isomorphism theorem, where π : G →G/K is the natural map π : a ↦aK. G f π H G/K ϕ ( ◀
Key result
If H and K are subgroups of a group G with H ✁G, then HK is a subgroup, H ∩K ✁K, and K/(H ∩K) ∼= HK/H.
Key result
If H and K are normal subgroups of a group G with K ≤H, then H/K ✁G/K and (G/K)/(H/K) ∼= G/H.
Key result
shows that T ≤S ≤G implies T/K = π(T ) ≤π(S) = S/K. Conversely, assume that T/K ≤S/K. If t ∈T , then t K ∈T/K ≤S/K and so t K = sK for some s ∈S. Hence, t = sk for some k ∈K ≤S, and so t ∈S. To prove that [S : T ] = [S∗: T ∗], it suffices to show that there is a bijection from the family of all cosets of the form sT , where s ∈S, and the family of all cosets of the form s∗T ∗, where s∗∈S∗, and the reader may check that sT ↦π(s)T ∗is such a bijection. When G is finite, we may prove [S : T ] = [S∗: T ∗] as follows: [S∗: T ∗] = |S∗|/|T ∗| = |S/K|/|T/K| = (|S|/|K|) / (|T |/|K|) = |S|/|T | = [S : T ]. If T ✁S, then T/K ✁S/K and (S/K)/(T/K) ∼= S/T , by the third isomorphism theorem; that is, S∗/T ∗∼= S/T . It remains to show that if T ∗✁S∗, then T ✁S; that is, if t ∈T and s ∈S, then sts−1 ∈T . Now π(sts−1) = π(s)π(t)π(s)−1 ∈π(s)T ∗π(s)−1 = T ∗, so that sts−1 ∈π−1(T ∗) = T . • When dealing with quotient groups, we usually say, without mentioning the correspondence theorem explicitly, that every subgroup of G/K has the form S/K for a unique subgroup S ≤G containing K.
Key result
If G is a finite abelian group and d is a divisor of |G|, then G contains a subgroup of order d.
Key result
If G is a group containing normal subgroups H and K with H ∩K = {1} and H K = G, then G ∼= H × K.
Key result
can now be interpreted as saying that if a and b are commuting elements having relatively prime orders m and n, then ab has order mn. Let us give a direct proof of this result.
Key result
gives n | mk. As (m, n) = 1, however, Corollary 1.11 gives n | k; a similar argument gives m | k. Therefore, mn ≤k, and mn is the order of ab. •
Key result
(i) If p is a prime, then φ(pe) = pe −pe−1 = pe 1 −1 p . (ii) If n = pe1 1 · · · pet t is the prime factorization of n, then φ(n) = n 1 −1 p1 · · · 1 −1 pt .
Key result
A group G of order n is cyclic if and only if, for each divisor d of n, there is at most one cyclic subgroup of order d.
Key result
Every group G is isomorphic to a subgroup of the symmetric group SG. In particular, if |G| = n, then G is isomorphic to a subgroup of Sn.
Source-grounded examples
Worked source example
We show that the quotient group G/K is precisely Im when G is the additive group Z and K = ⟨m⟩, the (cyclic) subgroup of all the multiples of a positive integer m. Since Z is abelian, ⟨m⟩is necessarily a normal subgroup. The sets Z/ ⟨m⟩and Im coincide because they are comprised of the same elements: The coset a + ⟨m⟩is the congruence class [a]: a + ⟨m⟩= {a + km : k ∈Z} = [a]. The operations also coincide: Addition in Z/ ⟨m⟩is given by (a + ⟨m⟩) + (b + ⟨m⟩) = (a + b) + ⟨m⟩; since a + ⟨m⟩= [a], this last equation is just [a] + [b] = [a + b], which is the sum in Im. Therefore, Im is equal to the quotient group Z/ ⟨m⟩. ◀ There is another way to regard quotient groups. After all, we saw, in the proof of
Worked source example
Let G = ⟨a⟩be a cyclic group of order 30. If π : Z →G is defined by π(n) = an, then ker π = ⟨30⟩. The subgroups ⟨30⟩≤⟨15⟩≤⟨5⟩≤Z correspond to the subgroups {1} = ⟨a30⟩≤⟨a15⟩≤⟨a5⟩≤⟨a⟩. Moreover, the quotient groups are ⟨a15⟩ ⟨a30⟩ ∼= ⟨15⟩ ⟨30⟩ ∼= I2, ⟨a5⟩ ⟨a15⟩ ∼= ⟨5⟩ ⟨15⟩ ∼= I3, and ⟨a⟩ ⟨a5⟩ ∼= Z ⟨5⟩ ∼= I5. ◀
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 normal subgroups and quotient groups?
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.
