Direct product of groups Created 2026-09-24 Updated 2026-10-20
A direct product combines two groups into one while keeping their operations in separate coordinates. Its underlying set is the Cartesian product , and its group operation is
The identity element is , and the inverse element of is . Associativity follows coordinate by coordinate. For finite groups, the multiplication principle gives .
For example, write the cyclic group as the additive group of residue classes modulo . In ,
since each coordinate reduces with its own integer modulus. A pair can track two cyclic counters that advance independently. Updating the first coordinate does not alter the second, and vice versa.
This independence has an algebraic form. The embedded factor elements always commute:
The coordinate maps and are group homomorphisms, so one can analyze either component separately. This does not make the full product an abelian group when one of its factors is nonabelian: two arbitrary pairs need not commute.
The construction is useful in both directions. It builds a larger group from familiar pieces, while the internal direct product theorem recognizes when an existing group can be separated into such pieces. A cyclic group can sometimes be split this way; whether two finite cyclic factors combine into one cyclic group is decided by the cyclicity of a product of two finite cyclic groups. Definitions and the basic recognition theorems are developed in Thomas Judson, Abstract Algebra: Theory and Applications, §9.2, Direct Products.
Lagrange's theorem states that for a subgroup of a finite group , . In particular divides ; the equal-sized cosets partition .
Apply the theorem to inside both subgroups. Its order divides both coprime orders, so . For and , the group commutator lies in by being a normal subgroup, and in because . It is therefore the identity. Thus every element of commutes with every element of .
Define by . The cross-commutation just proved gives , so this is a group homomorphism from the direct product of groups. The product assumption makes it surjective. If , then , so both entries are the identity and the kernel of a group homomorphism is trivial. Hence
This proves the internal direct product theorem in the present coprime-order setting, rather than merely matching the numbers of elements.
Lagrange's theorem for finite groups states that for a subgroup of a finite group , . For , two powers among coincide, giving for some positive . The least such exponent is the order of a group element, and the cyclic subgroup generated by consists of the distinct powers . Apply Lagrange's theorem for finite groups to obtain .
Cauchy's theorem for finite groups states that if a prime divides the order of a finite group, the group contains an element of order .
The classification of a group of order eight is
Here denotes the dihedral group of order eight, not a group of order sixteen. To prove exhaustiveness, every element order is or . An element of order eight generates the whole group, giving .
If no element has order four or eight, every nonidentity element is an involution. Since while and , we have . Choose an involution , another outside , and then outside the four-element subgroup . The factors commute and each added factor has trivial intersection with the preceding subgroup. The internal direct product theorem gives , an elementary abelian group.
Otherwise choose of order four and set . It has index two, so is normal. Choose . The two cosets show that generate and that . There is no element of order eight, so is either or .
If is abelian and , the internal direct product theorem yields . If instead , let ; commutativity gives and , producing the same direct product.
If is nonabelian, conjugation by is a nonidentity group automorphism of : otherwise would commute and hence so would all of . Thus . With these are the relations of ; with they are the relations of the quaternion group . In either presentation every word reduces to , , . The standard eight-element model maps onto , and equal orders make that group homomorphism an isomorphism.
Finally group isomorphisms preserve element orders. The following numbers of elements distinguish all five possibilities:
GroupOrder 1Order 2Order 4Order 8
1124
1340
1700
1520
1160
Thus the list is both exhaustive and pairwise non-isomorphic.
The internal direct product theorem states that if , , and , then . Indeed, for , the commutator lies in both and , so it is trivial. The map is consequently a homomorphism; the intersection condition makes it injective and makes it surjective. Conversely, the two factors in a direct product satisfy these conditions.
In odd dimension, is central and has determinant . Every has a unique expression with , so
By contrast, is abelian, while reflections in conjugate a rotation to its inverse. Thus .
The center of the unitary group consists exactly of scalar unitary matrices:
The determinant gives a surjective homomorphism
whose kernel is the special unitary group .
Nevertheless is not isomorphic to . The center of has exactly one nonidentity element of order two, namely . The center of the proposed product is , which has three nonidentity elements of order two. Since an isomorphism preserves the center and element orders,