Coordinating two groups
Definition 4.1.1
(Direct product)
For groups , the direct product consists of ordered pairs, multiplied coordinatewise: . Its identity is and the inverse of is .
Associativity follows in each coordinate. This construction combines two groups without assuming the factors are abelian. We write finite cyclic groups additively as , with a positive integer.
The least common multiple rule
Proposition 4.1.2
(Order of a pair)
Suppose and have finite orders and . Then has order . If or has infinite order, so does .
Proof
(Common multiples of the two orders)
First, exactly when divides . Write with . If , then , and minimality of forces . Conversely, a multiple of gives the identity. The same holds for and . Now exactly when and , that is, when is a common multiple of and . The smallest positive common multiple is the least common multiple. If has infinite order, no positive gives , so no positive power of is the identity; likewise for .
Proof X-ray
What the argument really uses
The only non-routine step is the criterion that forces , and it comes from division with remainder together with the minimality of : the remainder would be a smaller positive exponent killing . The pair condition then becomes two divisibility conditions on the same exponent , which is why a common multiple appears, and why the least one is the order. No commutativity between different elements inside either group is needed, since only powers of a single element are involved. Finiteness of the orders is used to speak of ; without it the set of admissible is empty.
Worked example 4.1.3
(Coprime orders)
In , the element has coordinate orders 4 and 3, hence order 12. Its multiples return to zero after 12 steps, not after steps: the first coordinate is zero exactly at multiples of 4, the second exactly at multiples of 3, and the first common multiple is 12.
Worked example 4.1.4
(Orders sharing a factor)
In , the element has coordinate orders 2 and 2. Hence its order is , not 4: indeed . When the orders share a factor, the order of the pair is strictly smaller than the product .
Common mistake
(Adding or multiplying the coordinate orders)
The order of is neither nor in general. In the element has coordinate orders 2 and 5, and order ; this equals here only because and are coprime. In the element has order 2, which is neither nor .
When is a product cyclic?
Theorem 4.1.5
(Cyclic products of cyclic groups)
The group has elements. It is cyclic exactly when .
Proof
(Generators and the order bound)
If the gcd is 1, has order , so its multiples exhaust the group. Conversely, every element has coordinate orders dividing and , so its order divides . If the gcd exceeds 1, that least common multiple is strictly less than ; no element can generate all elements. This argument includes the trivial factor or .
Worked example 4.1.6
(Solving two congruences with a generator)
For , the pair is , because and . These congruences specify the same class modulo 12: two solutions differ by a multiple of both 3 and 4, hence by a multiple of 12. The generator argument explains existence and uniqueness here without assuming a formula for the Chinese remainder theorem.
Counterexample mode
A product of cyclic groups need not be cyclic
Claim: since and are cyclic, so is their product. But every pair has order dividing ; for instance has order exactly 12. The product has 24 elements, so no element can generate it. Merely adding the sizes or choosing a generator in each factor does not establish cyclicity; the factors need , which fails.
Exercises and solutions
Quick check
(Find the order of in .)
Find the order of each coordinate first.
Solution · Answer
The coordinate orders are 2 and 5, so the order is 10.
Quick check
(Is cyclic? Give a generator.)
Look at the gcd.
Solution · Answer
Yes, because ; has order 40.
Quick check
(Find the class modulo 12 that maps to modulo 3 and 4.)
Look for a number with these two remainders.
Solution · Answer
, since and ; uniqueness is modulo 12.
Quick check
(If has infinite order and has any order, can have finite order?)
Suppose a positive power of the pair is the identity.
Solution · Answer
No; any positive identity power of the pair would make have finite order.