When do two pieces really form a product?
A group may be assembled from two subgroups, but writing each element as a product does not automatically make the whole group their direct product. To identify the missing condition, we will examine the actual multiplication map and prove when it preserves products.
All groups here may be infinite. For subgroups , write . The external direct product uses coordinatewise multiplication.
Definition 1.2.1
(Internal direct product)
Let . The group is the internal direct product of and if the multiplication map , , is a group isomorphism.
The internal-product criterion
Theorem 1.2.2
(Two normal factors with trivial intersection)
Suppose , and . Then , , is an isomorphism.
Proof
(Normality forces the factors to commute)
For and , the commutator belongs to because is normal, and to because is normal. Their intersection is trivial, so . Consequently
The map is onto because . If , then , so both are ; the kernel is trivial. Hence it is injective and is an isomorphism. These hypotheses are sufficient even for infinite groups; no counting argument is needed.
Proof X-ray
Normality supplies commutation, not merely a product set
The equality gives surjectivity of the set map, and trivial intersection gives uniqueness of a factorization: if , then . Neither statement alone says that coordinatewise multiplication matches multiplication in . The two normality assumptions force the cross-commutators to lie in both subgroups, which is the separate step that makes the map a homomorphism.
The three hypotheses are not only sufficient. They are forced by the conclusion.
Proposition 1.2.3
(The conditions are also necessary)
If is the internal direct product of , then , and .
Proof
(Transport the coordinate subgroups)
In , the coordinate subgroups and are the kernels of the projections onto and onto , so both are normal. They intersect only in , and shows that their product is all of . The isomorphism sends onto and onto . An isomorphism carries normal subgroups to normal subgroups, intersections to intersections and products of subgroups to products, so the three properties hold for and in .
The conclusion is about the stated embedded subgroups, not merely an abstract numerical equality of orders.
Examples
Worked example 1.2.4
(A cyclic group of order six)
In under addition, let and . The group is abelian, so both are normal; their intersection is . Their sums cover all six residues:
Thus by the explicit addition map.
Worked example 1.2.5
(A nonabelian internal direct product)
In , with and , take
The subgroup has index two, so it is normal. The subgroup is normal because commutes with and . The rotations in have even exponent, so and . Every element lies in : an element or with even is already in , and with odd it equals or , where is even. The criterion gives . Here is nonabelian: has order three and inverts it, so has the structure of the symmetry group of a triangle. An internal direct product requires the two factors to commute with each other, not each factor to be abelian.
Worked example 1.2.6
(A group with only the trivial decomposition)
The subgroups of are , and the whole group. Any two nontrivial subgroups both contain , so their intersection is never trivial. The only internal direct product decompositions therefore use a trivial factor, such as , where is an isomorphism. The order does not produce a splitting: , since has order four while every element of the product has order at most two.
The next example shows that the normality of both factors cannot be weakened to normality of one.
Counterexample mode
Unique factorization alone does not force a direct product
In , take and . Their intersection is trivial and : supplies the three even permutations, and multiplying them by supplies the three odd permutations. Nevertheless is not normal: conjugating by gives , a different transposition. The factors also fail to commute: composing right to left, while . The direct product is abelian because both factors are cyclic, while is not; hence the multiplication map is not a direct-product isomorphism. Unique expressions do not repair the missing homomorphism property.
Common mistakes
Common mistake
(Matching orders is not a decomposition)
Knowing that are normal and that is not enough. In , take : both are normal and , yet and . For finite groups, together with does give , because the products are then pairwise distinct; the intersection condition cannot be skipped.
Exercises
Quick check
(In the example, find the unique decomposition of as with .)
Solution · Answer
. The trivial intersection proves uniqueness.
Quick check
(Suppose commute elementwise, and . Prove their multiplication map is an isomorphism, without separately assuming normality.)
Solution · Answer
Elementwise commutation gives the homomorphism calculation above. The product condition gives surjectivity and the trivial-intersection kernel argument gives injectivity.
Quick check
(In the example, why does normality of alone not justify the direct-product criterion?)
Solution · Answer
The theorem requires both subgroups normal. In the example is not normal and the two factors do not commute; the proposed map is not a homomorphism from the coordinatewise product.
Quick check
(Give two subgroups of an abelian group whose product is the whole group but whose multiplication map from the external direct product is not injective.)
Solution · Answer
Take and . Their sum is , but is a nonzero element in the kernel of the addition map .