Math 3230 Abstract Algebra I Sec 4.4: Finitely generated abelian - PowerPoint PPT Presentation

Math 3230 Abstract Algebra I Sec 4.4: Finitely generated abelian groups Slides created by M. Macauley, Clemson (Modified by E. Gunawan, UConn) http://egunawan.github.io/algebra Abstract Algebra I Sec 4.4 Finitely generated abelian groups Abstract Algebra I 1 / 7

Finite abelian groups We’ve seen that some cyclic groups can be expressed as a direct product of two nontrivial groups, and others cannot. Below are two ways to lay out the Cayley diagram of Z 6 so the direct product structure is obvious: Z 6 ∼ = Z 3 × Z 2 . 0 0 2 4 3 1 5 4 2 3 5 1 However, the group Z 8 cannot be written as a direct product of two nontrivial groups. No matter how we draw the Cayley graph, there must be an arrow of order 8. (Why?) We will answer the question of when Z n × Z m ∼ = Z nm , and in doing so, completely classify all finite abelian groups. Sec 4.4 Finitely generated abelian groups Abstract Algebra I 2 / 7

Finite abelian groups Proposition 1 Z nm ∼ = Z n × Z m if and only if gcd( n , m ) = 1. Proof (sketch) “ ⇐ ”: Suppose gcd( n , m ) = 1. We claim that (1 , 1) ∈ Z n × Z m has order nm . To prove the claim, let k denote the order of the element (1 , 1) ∈ Z n × Z m . Then ( k , k ) = (0 , 0). This means n | k and m | k . In fact, k is lcm( n , m ) the smallest common multiple of n and m . Since n and m has no common divisor, lcm( n , m ) = nm . So k = nm . � (0 , 0) (3 , 2) (1 , 1) (0 , 0) (1 , 0) (2 , 0) (3 , 0) (2 , 1) (2 , 2) Z 4 × Z 3 ∼ = Z 12 (1 , 0) (3 , 0) (0 , 1) (1 , 1) (2 , 1) (3 , 1) · · · (0 , 2) (0 , 1) (0 , 2) (1 , 2) (2 , 2) (3 , 2) (3 , 1) (1 , 2) (2 , 0) Sec 4.4 Finitely generated abelian groups Abstract Algebra I 3 / 7

Finite abelian groups Proposition 1 Z nm ∼ = Z n × Z m if an only if gcd( n , m ) = 1. Proof (cont.) “ ⇒ ”: Suppose Z nm ∼ = Z n × Z m . Then Z n × Z m has an element ( a , b ) of order nm . For convenience, we will switch to “multiplicative notation”, and denote our m -1) cyclic groups by C n . ( e , e ) ( e , b ) ( e , b . . . Clearly, � a � = C n and � b � = C m . Let’s look at . . . m -1) a Cayley diagram for C n × C m . ( a , e ) ( a , b ) ( a , b The order of ( a , b ) must be a multiple of n . . . ... . . . (the number of rows), and of m (the number . . . of columns). . . . ( an -1 , e ) ( an -1 , b ) n -1 m -1 By definition, this is the least common a , b multiple of n and m . But | ( a , b ) | = nm , and so lcm( n , m ) = nm . Therefore, gcd( n , m ) = 1. � Sec 4.4 Finitely generated abelian groups Abstract Algebra I 4 / 7

The Fundamental Theorem of Finite Abelian Groups Classification theorem of finite abelian groups (by “prime powers”) Every finite abelian group A is isomorphic to a direct product of cyclic groups, i.e., for some integers n 1 , n 2 , . . . , n j , A ∼ = Z n 1 × Z n 2 × · · · × Z n j , where each n i is a prime power, i.e., n i = p d i i , where p i is prime and d i ∈ N . The proof of this is more advanced, and while it is at the undergraduate level, we don’t yet have the tools to do it. However, we will be more interested in understanding and utilizing this result. Example Up to isomorphism, there are 6 abelian groups of order 200 = 2 3 · 5 2 : Z 8 × Z 25 Z 8 × Z 5 × Z 5 Z 2 × Z 4 × Z 25 Z 2 × Z 4 × Z 5 × Z 5 Z 2 × Z 2 × Z 2 × Z 25 Z 2 × Z 2 × Z 2 × Z 5 × Z 5 Sec 4.4 Finitely generated abelian groups Abstract Algebra I 5 / 7

The Fundamental Theorem of Finite Abelian Groups Finite abelian groups can be classified by their “elementary divisors.” The mysterious terminology comes from the theory of modules (a graduate-level topic). Classification theorem (by “elementary divisors”) Every finite abelian group A is isomorphic to a direct product of cyclic groups, i.e., for some integers k 1 , k 2 , . . . , k m , A ∼ = Z k 1 × Z k 2 × · · · × Z k m . where each k i is a multiple of k i +1 . Example Up to isomorphism, there are 6 abelian groups of order 200 = 2 3 · 5 2 : by “prime-powers” by “elementary divisors” Z 8 × Z 25 Z 200 Z 4 × Z 2 × Z 25 Z 100 × Z 2 Z 2 × Z 2 × Z 2 × Z 25 Z 50 × Z 2 × Z 2 Z 8 × Z 5 × Z 5 Z 40 × Z 5 Z 4 × Z 2 × Z 5 × Z 5 Z 20 × Z 10 Z 2 × Z 2 × Z 2 × Z 5 × Z 5 Z 10 × Z 10 × Z 2 Sec 4.4 Finitely generated abelian groups Abstract Algebra I 6 / 7

The Fundamental Theorem of Finitely Generated Abelian Groups Just for fun, here is the classification theorem for all finitely generated abelian groups. Note that it is not much different. Theorem Every finitely generated abelian group A is isomorphic to a direct product of cyclic groups, i.e., for some integers n 1 , n 2 , . . . , n j , A ∼ = Z × · · · × Z × Z n 1 × Z n 2 × · · · × Z n j , � �� � k copies where each n i is a prime power, i.e., n i = p d i i , where p i is prime and d i ∈ N . In other words, A is isomorphic to a (multiplicative) group with presentation: A = � a 1 , . . . , a k , r 1 , . . . , r m | r n i = 1 , a i a j = a j a i , r i r j = r j r i , a i r j = r j a i � . i In summary, (finitely generated) abelian groups are relatively easy to understand. In contrast, nonabelian groups are much more mysterious and complicated. The study of Sylow Theorems can help us better understand the structure of finite nonabelian groups. Sec 4.4 Finitely generated abelian groups Abstract Algebra I 7 / 7