Motivation
Two choices can be independent even when each has its own algebraic structure. We may choose a rotation of a triangle and, separately, whether to interchange two other objects. Recording both choices gives an ordered pair. Composing two such choices should compose each coordinate separately. The direct product formalizes this idea.
The same notation can conceal an important difference. A group may be isomorphic to a product, or merely sit inside a product. In a subgroup of a product, the coordinates can be linked: the pairs and form a subgroup of , although neither coordinate can be chosen independently. We will learn how to prove independence rather than infer it from the appearance of pairs.
Use the subgroup criterion, element orders, homomorphisms, normal subgroups and the first isomorphism theorem. Write additively for ; other groups are written multiplicatively.
Definitions
Definition 1.6.1
(The external direct product)
For groups , the direct product is the set of ordered pairs with multiplication
The coordinate projections are and . The coordinate inclusions are and .
These formulas describe a group, not just a set. Associativity holds because each coordinate is associative; the identity is and the inverse of is . Projections are surjective homomorphisms and inclusions are injective homomorphisms, as the multiplication formula immediately verifies. The embedded subgroups and commute elementwise, even if or itself is nonabelian.
Their kernels are worth naming: and . A coordinate factor need not be abelian to be normal. Here normality follows directly from being a kernel.
Definition 1.6.2
(Internal direct product)
For subgroups , write . We call the internal direct product of if the map , , is an isomorphism.
The word internal says that the factors are already subgroups of the group being described. It does not supply the hypotheses needed to make their multiplication a homomorphism.
Theorems
Theorem 1.6.3
(Maps into and out of a product)
Given homomorphisms and , there is exactly one homomorphism with and : it is .
Given homomorphisms and , there is a homomorphism restricting to on the coordinate factors if and only if
When it exists, it is unique and .
Concept lensStructural
The product characterized by its maps
This theorem determines up to a unique isomorphism. Suppose a group has homomorphisms and such that every pair , comes from exactly one homomorphism . The two mapping properties give homomorphisms and compatible with the projections. Uniqueness, applied with and with , forces and to be identities. Any such is therefore a direct product, whether or not its elements are written as pairs.
Thus arbitrary maps into a product can be paired; arbitrary maps out of a product cannot always be combined. Commutation of the two images is the precise extra requirement. Neither image is required to be internally abelian.
Theorem 1.6.4
(Recognizing an internal direct product)
For subgroups , the multiplication map is an isomorphism exactly when
Equivalently, one may replace the commutation condition by and . Both normality conditions are needed for this equivalent test.
Proof sketch or proof idea
Why maps have different requirements in the two directions
Proof
(Pairing coordinates and combining commuting images)
For the map into the product, compute
The projection equations force both coordinates of , proving uniqueness. Its kernel is . In particular the paired map can be injective even when neither coordinate map is injective: the two coordinates together may distinguish all elements.
For the map out, every pair factors as , so its value must be . Those two coordinate factors commute in the source. A homomorphism preserves that equality, proving the necessary commutation condition in the target. Conversely, when the condition holds,
The middle equality moves past ; this is the only interchange needed. Therefore the proposed formula is a homomorphism. This proves existence and uniqueness without assuming that the entire target group is abelian.
Existence, uniqueness and compatibility are separate checks
Proof
(Coordinates exist, are unique and multiply correctly)
Assume the three displayed internal-product conditions. Commutation makes multiplication a homomorphism by the preceding theorem. The condition makes it onto. If , then
so and . This proves injectivity. Conversely, an isomorphism makes the map onto and sends commuting coordinate factors to commuting subgroups. If , both and map to , so injectivity forces .
To justify the normality version, suppose first that are normal in . For , the commutator lies in , since , and in , since . A trivial intersection therefore forces commutation. In the other direction, if and the factors commute, conjugating an element of by is the same as conjugating it by , and so stays in . Conjugation by the inverse gives equality. The argument for is identical. Normality is required in ; the factors need not be normal in a larger ambient group.
Proof X-ray
Where independence enters the multiplication map
The equality says every element has coordinates. The equality makes those coordinates unique. Commutation is a separate condition: it says multiplication of those coordinates agrees with multiplication in an external product. Unique coordinates alone describe a bijection of sets and do not prove a group isomorphism. In the normality version, a single element carries the whole argument: the commutator . Normality of puts it in , normality of puts it in , and the trivial intersection then makes it the identity. With only one factor normal, the commutator is placed in only one subgroup and nothing forces it to vanish.
Element orders and cyclic products
Proposition 1.6.5
(Orders of pairs and cyclic products)
Let and have finite orders and . Then
If either coordinate has infinite order, the pair has infinite order. Consequently, for , the group is cyclic if and only if .
Proof
(Powers are taken coordinatewise)
Since for every integer , a positive power is the identity exactly when and , that is, when . If one coordinate has infinite order, no positive power of that coordinate is the identity, so no positive power of the pair is either.
If , the pair of standard generators has order , equal to the number of pairs, so it generates. If the gcd is greater than one, every coordinate order divides or , respectively, so every pair has order dividing , and ; no element generates the group. The cases or fall under the coprime case, with .
The formula concerns orders of the particular elements, not necessarily orders of their groups. Having cyclic factors alone is insufficient.
When every subgroup has independent coordinates
Theorem 1.6.6
(Coprime orders split every subgroup)
Let be finite groups with , and let . Define
Then , and .
Proof
(A single power isolates each coordinate)
Both are subgroups, by the subgroup criterion. Take . Because the two orders are coprime, the integer Chinese remainder theorem gives an integer with
Lagrange's theorem gives and , so . Multiplying its inverse by gives . Thus each element's separate coordinates belong to , proving one inclusion. Conversely, multiplying any two such coordinate elements proves . This argument uses powers of a single element; it does not assume or abelian.
Coprimality was used only to choose the exponent , but it cannot be dropped.
Counterexample mode
Without coprime orders the coordinates can be linked
Claim: every subgroup equals . Take , whose orders are not coprime, and . It is a subgroup, since . Neither nor lies in , so and has one element, while has two. Both projections of are onto, so replacing coordinate intersections by projections fails too: their product is all four elements of . In the proof, the required exponent would satisfy and modulo at once. Projections tell us which values occur; they do not tell us whether the values can be chosen independently. The theorem is repaired exactly by its coprimality hypothesis.
Quotients taken coordinate by coordinate
Theorem 1.6.7
(Quotient by a product of normal subgroups)
If and , then and
Proof
(A coordinatewise quotient map)
The map
is a homomorphism because each coordinate is a quotient map. It is surjective: representatives can be chosen independently in the two target cosets. Its kernel is exactly , which is therefore normal. The first isomorphism theorem gives the displayed isomorphism.
This proves a quotient formula for a specified product subgroup. It does not claim that every normal subgroup of every product is of that form; the diagonal in is normal and is not a product of coordinate subgroups.
Worked examples
Worked example 1.6.8
(Cyclic factors can give a noncyclic product)
The group has elements. The element has order , and no element has larger order, so the product is not cyclic. By contrast is cyclic of order , generated by . An explicit inverse to , , sends to . The coefficients satisfy and ; changing representatives changes the answer by a multiple of .
Worked example 1.6.9
(Unique factorization without a direct product)
In , put and . Their intersection is trivial, and their six products are distinct, so . But , so the factors do not commute. Multiplication is a bijection of sets, not a homomorphism. Here is normal and is not. If it were a direct product, it would be cyclic of order six, whereas has no element of order six.
Worked example 1.6.10
(Recovering coordinates inside a subgroup)
Let . The two coordinate orders are two and three, so . Its generator has and . These generate coordinate subgroups of orders two and three. Their product has six elements and equals . This is an actual coordinate recovery calculation; merely noting that both projections are nontrivial would not prove the equality.
Worked example 1.6.11
(A quotient with an explicit numerical map)
In , let . The quotient formula gives . One map realizing the result is . It is well defined because and are divisible by six. Its kernel consists exactly of pairs with even and divisible by three: reduce the equation modulo two and modulo three. It is onto, since . Thus both the structural argument and the explicit kernel calculation identify the same quotient.
Common mistakes
Common mistake
(The order of a pair is a least common multiple)
The order of equals the product of the coordinate orders only when those orders are coprime. In , the element has order , not : indeed .
Common mistake
(Unique factorization is not yet a direct product)
From and one obtains unique coordinates, but not the multiplication of a direct product: commutation, or normality of both factors, must still be checked. Checking that one factor is normal does not repair the omission. In , the subgroup is normal and the factorization is unique, yet is not their direct product.
Two further cautions. Surjectivity of both projections of a subgroup does not give ; the diagonal disproves this. And a product description is an isomorphism with a specified operation, so a bijection or equality of group sizes alone cannot establish it.
Summary
Direct products express independent coordinates. Projections characterize maps into them; commuting images characterize maps out. Internal products require existence and uniqueness of coordinates together with compatibility of multiplication. Element orders are least common multiples. Coprime finite factor orders force every subgroup to split into coordinate intersections, whereas diagonals show why such a conclusion fails in general. Quotient maps give a reliable way to identify product quotients.
Exercises
Quick check
(In , find the order of and the sizes of the two projections of its generated subgroup. Is that subgroup the product of its projections?)
Solution · Answer
The coordinate orders are and , so the pair has order four. Each projection has four elements, while the generated subgroup has only four. The product of those projections has sixteen elements, so equality is impossible. The two coordinates are linked by using the same exponent.
Quick check
(For any group , show that , , is a homomorphism. Show that , , is a homomorphism if and only if is abelian.)
Solution · Answer
We have . If is abelian, then . Conversely, and commute in the source. If is a homomorphism, their images commute for every choice of , so is abelian.
Quick check
(In the additive group , let and . Prove that is their internal direct product and find the two coordinates of explicitly.)
Solution · Answer
The subgroups have orders four and three. Their intersection is trivial by Lagrange, and they commute because is abelian. The coordinates are and , since modulo twelve. Thus their sum map is onto and the internal-product criterion applies. Uniqueness also follows directly: the difference of two proposed -coordinates would belong to .
Quick check
(For an arbitrary group , prove that the diagonal subgroup is normal in if and only if is abelian.)
Solution · Answer
If is abelian, so is its product and every subgroup is normal. Conversely, conjugating by gives . Normality places this pair in the diagonal, forcing for all . Thus all elements commute. The diagonal is always a subgroup, being the image of the homomorphism , but usually not normal.
Quick check
(Let be finite with coprime orders. Prove that every normal subgroup of is with and . Deduce that every quotient of is isomorphic to a product of quotients of the two factors.)
Solution · Answer
The coprime splitting theorem gives for the coordinate intersections of any subgroup . If is normal, conjugating by shows ; inverse conjugation gives . Similarly . Conversely such a product is normal, as the kernel of the coordinate quotient map. Applying the proved quotient formula gives . The coprime hypothesis was used to split , rather than to prove the quotient formula itself.