Direct Products of Groups
Handbook guide to direct products of groups with core definitions, structural results, reasoning methods and verification checks.
How the topic fits together
Direct Products
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.
Proposition
If H is a subgroup of G and N is a normal subgroup of G, we know by (1.4.3) that HN, the subgroup generated by H ∪N, is a subgroup of G. If H is also a normal subgroup of G, then HN is normal in G as well. More generally, if for each i in the index set I, one has Hi ⊴G, then < Hi, i ∈I >,the subgroup generated by the Hi (technically, by the set ∪i∈IHi) is a normal subgroup of G.
Proof / verification strategy: Use subgroup generation, coset/orbit counting and divisibility of orders. For cyclic groups, reduce the claim to arithmetic on exponents modulo the group order.
External and Internal Direct Products
External and Internal Direct Products In this section we examine a popular construction. Starting with a given collection of groups, we build a new group with the aid of the cartesian product. Let’s start with two given groups H and K, and let G = H ×K, the set of all ordered pairs (h, k), h ∈H, k ∈K. Define multiplication on G componentwise: (h1, k1)(h2, k2) = (h1h2, k1k2).
Proof / verification strategy: Use subgroup generation, coset/orbit counting and divisibility of orders. For cyclic groups, reduce the claim to arithmetic on exponents modulo the group order.
Proposition
If G is the internal direct product of H and K, then G is isomorphic to the external direct product H × K.
Proof / verification strategy: Construct the natural group homomorphism, identify its kernel and image, and then use quotient structure to prove the claimed isomorphism or correspondence.
Definition
If H1, H2, . . . Hn are arbitrary groups, the external direct product of the Hi is the cartesian product G = H1×H2×· · ·×Hn, with componentwise multiplication: (h1, h2, ..., hn)(h′ 1, h′ 2, . . . h′ n) = (h1h′ 1, h2h′ 2, . . . hnh′ n); G contains an isomorphic copy of each Hi, namely Hi = {(1H1, . . . , 1Hi−1, hi, 1Hi+1, . . . , 1Hn) : hi ∈Hi}. As in the case of two factors, G = H1H2 · · · Hn, and Hi ⊴G for all i; furthermore, if g ∈G then g has a unique representation g = h1 h2 · · · hn where hi ∈Hi. Specifically, g = (h1, . . . , hn) = (h1, 1, . . . , 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.
Proposition
Suppose that G = H1 · · · Hn, where each Hi is a normal subgroup of G. The following conditions are equivalent: (1) G is the internal direct product of the Hi. (2) For all i = 1, 2, . . . , n, Hi j̸=i Hj = {1}; thus it does not matter in which order the Hi are listed. (3) For all i = 1, 2, . . . , n, Hi i−1 j=1 Hj = {1}.
Proof / verification strategy: Use subgroup generation, coset/orbit counting and divisibility of orders. For cyclic groups, reduce the claim to arithmetic on exponents modulo the group order.
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 source exercises reinforce definition checking, construction of examples and direct use of the formal results in this article.
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.
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 |
|---|---|---|
| 1.5 | Direct Products | 23–25 |
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.