Processing math: 100%
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

9.2: Direct Products

( \newcommand{\kernel}{\mathrm{null}\,}\)

Given two groups G and H, it is possible to construct a new group from the Cartesian product of G and H, G×H. Conversely, given a large group, it is sometimes possible to decompose the group; that is, a group is sometimes isomorphic to the direct product of two smaller groups. Rather than studying a large group G, it is often easier to study the component groups of G.

External Direct Products

If (G,) and (H,) are groups, then we can make the Cartesian product of G and H into a new group. As a set, our group is just the ordered pairs (g,h)G×H where gG and hH. We can define a binary operation on G×H by

(g1,h1)(g2,h2)=(g1g2,h1h2);

that is, we just multiply elements in the first coordinate as we do in G and elements in the second coordinate as we do in H. We have specified the particular operations and in each group here for the sake of clarity; we usually just write (g1,h1)(g2,h2)=(g1g2,h1h2).

Proposition 9.13

Let G and H be groups. The set G×H is a group under the operation (g1,h1)(g2,h2)=(g1g2,h1h2) where g1,g2G and h1,h2H.

Proof

Clearly the binary operation defined above is closed. If eG and eH are the identities of the groups G and H respectively, then (eG,eH) is the identity of G×H. The inverse of (g,h)G×H is (g1,h1). The fact that the operation is associative follows directly from the associativity of G and H.

Example 9.14

Let R be the group of real numbers under addition.

Solution

The Cartesian product of R with itself, R×R=R2, is also a group, in which the group operation is just addition in each coordinate; that is, (a,b)+(c,d)=(a+c,b+d). The identity is (0,0) and the inverse of (a,b) is (a,b).

Example 9.15

Consider

Z2×Z2={(0,0),(0,1),(1,0),(1,1)}.

Solution

Although Z2×Z2 and Z4 both contain four elements, they are not isomorphic. Every element (a,b) in Z2×Z2 other than the identity has order 2, since (a,b)+(a,b)=(0,0); however, Z4 is cyclic.

The group G×H is called the external direct product of G and H. Notice that there is nothing special about the fact that we have used only two groups to build a new group. The direct product

ni=1Gi=G1×G2××Gn

of the groups G1,G2,,Gn is defined in exactly the same manner. If G=G1=G2==Gn, we often write Gn instead of G1×G2××Gn.

Example 9.16

The group Zn2, considered as a set, is just the set of all binary n-tuples. The group operation is the “exclusive or” of two binary n-tuples.

Solution

For example,

(01011101)+(01001011)=(00010110).

This group is important in coding theory, in cryptography, and in many areas of computer science.

Theorem 9.17

Let (g,h)G×H. If g and h have finite orders r and s respectively, then the order of (g,h) in G×H is the least common multiple of r and s.

Proof

Suppose that m is the least common multiple of r and s and let n=|(g,h)|. Then

(g,h)m=(gm,hm)=(eG,eH)(gn,hn)=(g,h)n=(eG,eH).

Hence, n must divide m, and nm. However, by the second equation, both r and s must divide n; therefore, n is a common multiple of r and s. Since m is the least common multiple of r and s, mn. Consequently, m must be equal to n.

Corollary 9.18

Let (g1,,gn)Gi. If gi has finite order ri in Gi, then the order of (g1,,gn) in Gi is the least common multiple of \(r_1, \ldots, r_n\text{.}\

Example 9.19

Let (8,56)Z12×Z60.

Solution

Since gcd(8,12)=4, the order of 8 is 12/4=3 in Z12. Similarly, the order of 56 in Z60 is 15. The least common multiple of 3 and 15 is 15; hence, (8,56) has order 15 in Z12×Z60.

Example 9.20

The group Z2×Z3 consists of the pairs

(0,0),(0,1),(0,2),(1,0),(1,1),(1,2).

Solution

In this case, unlike that of Z2×Z2 and Z4, it is true that Z2×Z3Z6. We need only show that Z2×Z3 is cyclic. It is easy to see that (1,1) is a generator for Z2×Z3.

The next theorem tells us exactly when the direct product of two cyclic groups is cyclic.

Theorem 9.21

The group Zm×Zn is isomorphic to Zmn if and only if gcd(m,n)=1.

Proof

We will first show that if Zm×ZnZmn, then gcd(m,n)=1. We will prove the contrapositive; that is, we will show that if gcd(m,n)=d>1, then Zm×Zn cannot be cyclic. Notice that mn/d is divisible by both m and n; hence, for any element (a,b)Zm×Zn,

(a,b)+(a,b)++(a,b)mn/dtimes=(0,0).

Therefore, no (a,b) can generate all of Zm×Zn.

The converse follows directly from Theorem 9.17 since \lcm(m,n)=mn if and only if gcd(m,n)=1.

Corollary 9.22

Let n1,,nk be positive integers. Then

ki=1ZniZn1nk

if and only if gcd(ni,nj)=1 for \(i \neq j\text{.}\

Corollary 9.23

If

m=pe11pekk,

where the pis are distinct primes, then

ZmZpe11××Zpekk.
Proof

Since the greatest common divisor of peii and pejj is 1 for ij, the proof follows from Corollary 9.22.

In Chapter 13, we will prove that all finite abelian groups are isomorphic to direct products of the form

Zpe11××Zpekk

where p1,,pk are (not necessarily distinct) primes.

Internal Direct Products

The external direct product of two groups builds a large group out of two smaller groups. We would like to be able to reverse this process and conveniently break down a group into its direct product components; that is, we would like to be able to say when a group is isomorphic to the direct product of two of its subgroups.

Let G be a group with subgroups H and K satisfying the following conditions.

  • G=HK={hk:hH,kK};
  • HK={e};
  • hk=kh for all kK and hH.

Then G is the internal direct product of H and K.

Example 9.24

The group U(8) is the internal direct product

Solution

of

H={1,3}andK={1,5}.
Example 9.25

The dihedral group D6 is an internal direct product of its two subgroups

H={\identity,r3}andK={\identity,r2,r4,s,r2s,r4s}.

Solution

It can easily be shown that KS3; consequently, D6Z2×S3.

Example 9.26

Not every group can be written as the internal direct product of two of its proper subgroups. If the group S3 were an internal direct product of its proper subgroups H and K, then one of the subgroups, say H, would have to have order 3.

Solution

In this case H is the subgroup {(1),(123),(132)}. The subgroup K must have order 2, but no matter which subgroup we choose for K, the condition that hk=kh will never be satisfied for hH and kK.

Theorem 9.27

Let G be the internal direct product of subgroups H and K. Then G is isomorphic to H×K.

Proof

Since G is an internal direct product, we can write any element gG as g=hk for some hH and some kK. Define a map ϕ:GH×K by ϕ(g)=(h,k).

The first problem that we must face is to show that ϕ is a well-defined map; that is, we must show that h and k are uniquely determined by g. Suppose that g=hk=hk. Then h1h=k(k)1 is in both H and K, so it must be the identity. Therefore, h=h and k=k, which proves that ϕ is, indeed, well-defined.

To show that ϕ preserves the group operation, let g1=h1k1 and g2=h2k2 and observe that

ϕ(g1g2)=ϕ(h1k1h2k2)=ϕ(h1h2k1k2)=(h1h2,k1k2)=(h1,k1)(h2,k2)=ϕ(g1)ϕ(g2).

We will leave the proof that ϕ is one-to-one and onto as an exercise.

Example 9.28

The group Z6 is an internal direct product isomorphic

Solution

to {0,2,4}×{0,3}.

We can extend the definition of an internal direct product of G to a collection of subgroups H1,H2,,Hn of G, by requiring that

  • G=H1H2Hn={h1h2hn:hiHi};
  • HijiHj={e};
  • hihj=hjhi for all hiHi and hjHj.

We will leave the proof of the following theorem as an exercise.

Theorem 9.2.1

Let G be the internal direct product of subgroups Hi, where i=1,2,,n. Then G is isomorphic to iHi.


This page titled 9.2: Direct Products is shared under a GNU Free Documentation License 1.3 license and was authored, remixed, and/or curated by Thomas W. Judson (Abstract Algebra: Theory and Applications) via source content that was edited to the style and standards of the LibreTexts platform.

Support Center

How can we help?