Combine independent coordinates

Try

Imagine two independent modular counters, one with three positions and one with four. Advancing both once returns the pair to its initial state after twelve steps. Replacing the second counter by one with six positions gives a return after six steps, although there are eighteen possible pairs.

This difference explains why a product of cyclic groups is sometimes cyclic and sometimes not. The key is simultaneous return times, not only the number of coordinates.

Predict

Predict the order of a pair whose coordinate orders are m and n. The pair returns to identity when both coordinates do. Therefore the least common multiple should appear. Ask separately when that least common multiple equals the total number mn of possible pairs.

Experiment

Track the pair (1,1) in additive C₃×C₄ at selected powers.

Number of steps	First coordinate	Second coordinate
0	0	0
3	0	3
4	1	0
6	0	2
12	0	0

No earlier positive step is divisible by both three and four, so the pair has order twelve and generates the whole group. For C₃×C₆, every element has order dividing six, so no element generates all eighteen pairs. The obstruction applies to every candidate, not only (1,1).

Understand

For groups G,H, define (g,h)(g′,h′)=(gg′,hh′). Closure and associativity hold coordinatewise. The identity is (e_G,e_H), and the inverse is (g⁻¹,h⁻¹). This proves G×H is a group without assuming either factor abelian. It is abelian exactly when both factors are abelian, as can be seen by comparing pairs with identity in the other coordinate.

If g and h have finite orders m,n, then (g,h)ᵏ=(e,e) exactly when both m and n divide k. Hence its order is lcm(m,n). In particular, C_m×C_n is cyclic exactly when gcd(m,n)=1. For coprime m,n a pair of generators has order mn. Otherwise every pair has order dividing lcm(m,n), which is smaller than mn.

An internal direct-product criterion describes the same structure inside G. Suppose H and K are normal subgroups, their intersection is trivial, and HK=G. For h∈H,k∈K, the commutator hkh⁻¹k⁻¹ belongs to both H and K by normality, so it is identity. Thus H and K commute elementwise. The map H×K→G, (h,k)↦hk, is a homomorphism, onto by HK=G and injective by trivial intersection. Therefore it is an isomorphism.

Normality in that criterion matters. Two subgroups with trivial intersection and enough combined products need not commute. In S₃, a subgroup of order three and a subgroup of order two multiply to the whole group, but only the first is normal. Their product describes a semidirect phenomenon, not a direct product.

Apply

Distinguish C₉ from C₃×C₃ using element orders. Then distinguish C₈ from C₄×C₂ the same way. An isomorphism preserves powers and hence orders, so one differing invariant is enough to disprove isomorphism.

For a positive claim, provide a map. Merely observing identical orders or matching some element orders is not a proof of isomorphism. Use the internal-product criterion only after checking all three assumptions, and show where each assumption enters the proof.

Continue

The finite abelian structure theorem organizes these products systematically. Prime-power cyclic factors, together with uniqueness data, provide a classification that avoids counting the same group repeatedly under different product descriptions.

For the interacting case, continue to semidirect products: one factor acts on the other by automorphisms, and the action changes the multiplication rule.