# I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the associative law holds: for every x, y, z G, x (y z) = (x y) z; (ii) e x = x = x e for all x G; (iii) for every x G, there is x G (so-called, inverse) with x x = e = x x Set Operation + Operation Additional Condition N no no Z yes no Q yes no for Q \ {0} R yes no for R \ {0} R \ Q no no Set Operation + Operation Z >0 no no Z 0 no no Q >0 no yes Q 0 no no R >0 no yes R 0 no no 1

2 Set Operation + Operation {2n : n Z} yes no {2n + 1 : n Z} no no {3n : n Z} yes no {kn : n Z}, where k N is some fixed number yes no {a n : n Z}, where a R is some fixed number no yes { p 2 n : p Z, n Z 0} yes no Set Operation: a b = a 2 b 2 Operation: a b = a b R >0 no no Definition 3: A group is called abelian if x y = y x for any x, y G The parity group P has two elements, the words even and odd, with operation even even = even = odd odd and even odd = odd = odd even It is clear that: 1 even is the identity element; 2 The inverse of even is even and the inverse of odd is odd 2

3 The group Z 2 has two elements: [0] is the set of all even numbers and [1] is the set of all odd numbers Operation: [0] [0] = [1] [1] = [0] and [0] [1] = [1] [0] = [1] It is clear that: 1 [0] is the identity element; 2 The inverse of [0] is [0] and the inverse of [1] is [1] The group Z 3 has three elements: [0] is the set of numbers which are congruent to 0 mod 3; [1] is the set of numbers which are congruent to 1 mod 3; [2] is the set of numbers which are congruent to 2 mod 3 Operation: [0] [0] = [1] [2] = [2] [1] = [0], [0] [1] = [1] [0] = [2] [2] = [1], and [0] [2] = [2] [0] = [1] [1] = [2] It is clear that: 1 [0] is the identity element; 2 The inverse of [0] is [0], the inverse of [1] is [2], and the inverse of [2] is [1] The group Z 3 has two elements: [1] is the set of numbers which are congruent to 1 mod 3; [2] is the set of numbers which are congruent to 2 mod 3 Operation: and [1] [1] = [2] [2] = [1] [1] [2] = [2] [1] = [2] It is clear that: 1 [1] is the identity element; 2 The inverse of [1] is [1] and the inverse of [2] is [2] 3

4 Definition 4: II THREE EXAMPLES OF SPECIAL GROUPS The family of all the permutations of the set X = {1, 2,, n} is called the symmetric group It is denoted by S n Theorem 1: S n is a nonabelian group under operation of composition Proof (Sketch): It is obvious that S n is closed under operation of composition One can show that this operation is associative The identity element is (1) Finally, we know that every permutation α is either a cycle or a product of disjoint (with no common elements) cycles and the inverse of the cycle α = (i 1 i 2 i r ) is the cycle α 1 = (i r i r 1 i 1 ) Therefore, every element of S n is invertible To show that S n is nonabelian, we note that, for example, (123)(13) (13)(123) Definition 5: The set of the following four permutations is called the four-group Definition 6: V = {(1), (12)(34), (13)(24), (14)(23)} The set of all 2 2 nonsingular (determinant is nonzero) matrices with real entries and with operation matrix multiplication is called the general linear group It is denoted by GL(2, R) Theorem 2: GL(2, R) is a nonabelian group Proof (Sketch): It is obvious that GL(2, R) is closed under operation of multiplication One can show that this operation is associative The identity element is [ ] [ ] a b Finally, for every element A = there exists the inverse c d [ ] A 1 1 d b = ad bc c a To show that GL(2, R) is nonabelian, we note that, for example, [ ] [ ] [ ] [ ]

5 III MAIN THEOREM ABOUT GROUPS Theorem 3: Let G be a group (i) If x a = x b or a x = b x, then a = b (ii) The identity element e is unique (iii) For all x G, the inverse element x 1 is unique (iv) For all x G we have (x 1 ) 1 = x (v) For all a, b G we have (a b) 1 = b 1 a 1 (i) Let x a = x b, then x 1 (x a) = x 1 (x b), therefore by the associative law we get ( x 1 x ) a = ( x 1 x ) b, so e a = e b, and the result follows In the same way one can deduce a = b from a x = b x (ii) Assume to the contrary that there are two identity elements e 1 and e 2 Then which is a contradiction e 1 = e 1 e 2 = e 2, (iii) Assume to the contrary that for some x G there are two inverse elements x 1 1 and x 1 2 Then x 1 2 = e x 1 2 = ( x 1 1 x ) x 1 2 = x 1 1 ( ) x x 1 2 = x 1 1 e = x 1 1, which is a contradiction (iv) We have ( x 1 ) 1 x 1 = e Multiplying both sides by x, we get ( x 1 ) 1 ( x 1 x ) = e x, hence ( x 1 ) 1 e = x, and the result follows (v) We have (a b) ( b 1 a 1) = [ a ( b b 1)] a 1 = (a e) a 1 = a a 1 = e, and the result follows 5

6 IV SUBGROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 7: A subset H of a group G is a subgroup if (i) e H; (ii) if x, y H, then x y H; (iii) if x H, then x 1 H Notation: If H is a subgroup of G, we write H G It is obvious that {e} and G are always subgroups of a group G Definition 8: We call a subgroup H proper, and we write H < G, if H G We call a subgroup H of G nontrivial if H {e} 1 Z + < Q + < R + 2 Q 0 < R 0 3 Q >0 < R >0 < R 0 4 A group of even numbers is a subgroup of Z + 5 V < S 4 6

7 V TWO THEOREMS ABOUT SUBGROUPS Theorem 4: A subset H of a group G is a subgroup H is nonempty and, whenever x, y H, then xy 1 H = ) Suppose H is a subgroup of G We should prove that H is nonempty and, whenever x, y H, then xy 1 H We first note that H is nonempty, because 1 H by part (i) of definition 7 Finally, if x, y H, then y 1 H by part (iii) of definition 7, and so xy 1 H, by part (ii) of definition 7 =) Suppose H is a nonempty subset of G and, whenever x, y H, then xy 1 H We should prove that H is a subgroup of G Since H is nonempty, it contains some element, say, h Taking x = h = y, we see that 1 = hh 1 H, and so part (i) of definition 7 holds If y H, then set x = 1 (which we can do because 1 H), giving y 1 = 1y 1 H, and so part (iii) holds Finally, we know that (y 1 ) 1 = y, by (iv) of Theorem 3 Hence, if x, y H, then y 1 H, and so xy = x(y 1 ) 1 H Therefore, H is a subgroup of G Theorem 5: A nonempty subset H of a finite group G is a subgroup H is closed = ) Suppose H is a subgroup of G Then it is closed by part (ii) of definition 7 =) Suppose H is a nonempty closed subset of a finite group G We should prove that H is a subgroup We first note that since H is closed, it follows that part (ii) of definition 7 holds This, in particularly means, that H contains all the powers of its elements Let us pick some element a H (we can do that, since H is nonempty) Then a n H for all integers n 1 Lemma: If G is a finite group and a G, then a k = 1 for some integers k 1 Consider the subset {1, a, a 2,, a n, } Since G is finite, there must be a repetition occurring on this infinite list So, there are integers m > n with a m = a n, hence 1 = a m a n = a m n So, we have shown that there is some positive power of a equal to 1 By this Lemma for any a G there is an integer m with a m = 1, hence 1 H and part (i) of definition 7 holds Finally, if h H and h m = 1, then h 1 = h m 1 (for hh m 1 = 1 = h m 1 h), so that h 1 H and part (iii) of definition 7 holds Therefore, H is a subgroup of G 7

8 VI CYCLIC GROUPS Definition 9: If G is a group and a G, write a = {a n : n Z} = {all powers of a}; a is called the cyclic subgroup of G generated by a G = {0, ±1, ±2, ±3, }, H = {0, ±2, ±4, ±6, } = 2 Definition 10: A group G is called cyclic if G = a In this case a is called a generator of G (a) {e} = e (b) Z + = {0, ±1, ±2, ±3, } = 1 (c) Q +, Q >0, R +, R >0 are not cyclic (d) S 2 = {(1), (12)} = (12) (1) (e) S m, m > 2, is not cyclic (f) Z + m = {[0], [1], [2],, [m 1]} = [1] (g) Z 3 = {[1], [2]} = [2] [1] (h) Z 5 = {[1], [2], [3], [4]} = [2] = [3] [1], [4] (i) Z 7 = {[1], [2],, [6]} = [3] = [5] [1], [2], [4], [6] (j) Z m is cyclic m is a prime (Lagrange, 1769) Remark: Recall, that if m is composite, Z m is not a group 8

9 Definition 11: VII ORDER Let G be a group and let a G If a k = 1 for some k 1, then the smallest such exponent k 1 is called the order of a; if no such power exists, then one says that a has infinite order (a) Let G = S 2 = {(1), (12)}, then the order of (1) is 1 and the order of (12) is 2 (b) Let G = Z + 4 = {[0], [1], [2], [3]}, then the order of [0] is 1, order of [1] is 4, order of [2] is 2, order of [3] is 4 Definition 12: If G is a finite group, then the number of elements in G, denoted by G, is called the order of G S n = n!, Z + n = n, Z p = p 1 Theorem 6: Let G be a finite group and let a G Then the order of a is a Part I: We first prove that if a = k, then the order of a is k In fact, the sequence 1, a, a 2,, a k 1 has k distinct elements, while has a repetition Hence, 1, a, a 2,, a k 1, a k a k {1, a, a 2,, a k 1 }, that is, a k = a i for some i with 0 i < k If i 1, then a k i = 1, contradicting the original list having no repetitions Therefore i = 1, so a k = a 0 = 1, and k is the order of a (being smallest positive such k) Part II: We now prove that if the order of a is k, then a = k If H = {1, a, a 2,, a k 1 }, then H = k; It suffices to show that H = a Clearly, H a For the reverse inclusion, take a i a By the division algorithm, i = qk + r, where 0 r < k Hence a i = a qk+r = a qk a r = ( a k) q a r = a r H; this gives a H, and so a = H Theorem 7: Let G be a group and let a G has finite order k If a n = 1, then k n 9

10 VIII LAGRANGE S THEOREM Definition 13: If H is a subgroup of a group G and a G, then the coset ah is the following subset of G : ah = {ah : h H} Remark: Cosets are usually not subgroups In fact, if a H, then 1 ah, for otherwise 1 = ah = a = h 1 H, which is a contradiction Let G = S 3 and H = {(1), (12)} Then there are 3 cosets: (12)H = {(1), (12)} = H, (13)H = {(13), (123)} = (123)H, (23)H = {(23), (132)} = (132)H Lemma: Let H be a subgroup of a group G, and let a, b G Then (i) ah = bh b 1 a H (ii) If ah bh, then ah = bh (iii) ah = H for all a G (i) ) Let ah = bh, then for any h 1 H there is h 2 H with ah 1 = bh 2 This gives since h 2 H and h 1 1 H ) Let b 1 a H Put b 1 a = h 0 Then b 1 a = h 2 h 1 1 = b 1 a H, ah bh, since if x ah, then x = ah = x = b(b 1 a)h = b h 0 h = bh }{{} 1 bh; h 1 bh ah, since if x bh, then x = bh = x = a(b 1 a) 1 h = a h 1 0 h = ah } {{ } 2 ah h 2 So, ah bh and bh ah, which gives ah = bh 10

11 (ii) Let ah bh, then there exists an element x with therefore ah = bh by (i) x ah bh = ah 1 = x = bh 2 = b 1 a = h 2 h 1 1 H, (iii) Note that if h 1 and h 2 are two distinct elements from H, then ah 1 and ah 2 are also distinct, since otherwise ah 1 = ah 2 = a 1 ah 1 = a 1 ah 2 = h 1 = h 2, which is a contradiction So, if we multiply all elements of H by a, we obtain the same number of elements, which means that ah = H Theorem 8 (Lagrange): If H is a subgroup of a finite group G, then Let G = t and be the family of all cosets of H in G Then H divides G {a 1 H, a 2 H,, a t H} G = a 1 H a 2 H a t H, because G = {a 1, a 2,, a t } and 1 H By (ii) of the Lemma above for any two cosets a i H and a j H we have only two possibilities: a i H a j H = or a i H = a j H Moreover, from (iii) of the Lemma above it follows that all cosets have exactly H number of elements Therefore G = H + H + + H = G = d H, and the result follows Corollary 1: If G is a finite group and a G, then the order of a is a divisor of G By Theorem 6, the order of the element a is equal to the order of the subgroup H = a By Lagrange s Theorem, H divides G, therefore the order a divides G Corollary 2: If a finite group G has order m, then a m = 1 for all a G Let d be the order of a By Corollary 1, d m; that is, m = dk for some integer k Thus, a m = a dk = (a d ) k = 1 11

12 Corollary 3: If p is a prime, then every group G of order p is cyclic Choose a G with a 1, and let H = a be the cyclic subgroup generated by a By Lagrange s Theorem, H is a divisor of G = p Since p is a prime and H > 1, it follows that and so H = G, as desired H = p = G, Theorem 9 (Fermat s Little Theorem): Let p be a prime Then n p n mod p for any integer n 1 We distinguish two cases Case A: Let p n, then, obviously, p n p n, and we are done Case B: Let p n Consider the group Z p and pick any [a] Z p Let k be the order of [a] We know that [a] is a subgroup of Z p and by Theorem 6 we obtain By Lagrange s Theorem we get which gives since [a] = k and Z p = p 1 So [a] = k [a] divides Z p, k p 1, p 1 = kd for some integer d On the other hand, since k is the order of [a], it follows that for any n [a] we have n k 1 mod p, hence and the result follows, since kd = p 1 n kd 1 d 1 mod p, 12

13 Definition 14: IX HOMOMORPHISMS AND ISOMORPHISMS If (G, ) and (H, ) are groups, then a function f : G H is a homomorphism if for all x, y G f(x y) = f(x) f(y) Let (G, ) be an arbitrary group and H = {e}, then the function f : G H such that f(x) = e for any x G is a homomorphism In fact, f(x y) = e = e e = f(x) f(y) Let (G, ) be an arbitrary group, then the function f : G G such that f(x) = x for any x G is a homomorphism In fact, f(x y) = x y = f(x) f(y) { [0] if x is even Let f : Z + Z + 2 be a function such that f(x) = [1] if x is odd In fact, if x + y is even, then f(x + y) = [0] = f(x) + f(y) Similarly, if x + y is odd, then Then f is a homomorphism f(x + y) = [1] = f(x) + f(y) Let f : GL(2, R) R 0 be a function such that Then f is a homomorphism In fact, f(m) = det M for any M GL(2, R) f(m 1 M 2 ) = det(m 1 M 2 ) = det(m 1 ) det(m 2 ) = f(m 1 )f(m 2 ) 13

14 Definition 15: Let a function f : G H be a homomorphism If f is also a one-one correspondence, then f is called an isomorphism Two groups G and H are called isomorphic, denoted by if there exists an isomorphism between them G = H, We show that R + = R >0 In fact, let f(x) = e x To prove that this is an isomorphism, we should check that is one-one correspondence and that f : R + R >0 f(x + y) = f(x)f(y) for all x, y R The first part is trivial, since f(x) = e x is defined for all x R and its inverse g(x) = ln x is also defined for all x R >0 The second part is also true, since f(x + y) = e x+y = e x e y = f(x)f(y) Definition 16: Let G = {a 1, a 2,, a n } be a finite group A multiplication table for G is an n n matrix whose ij entry is a i a j : G a 1 a 2 a j a n a 1 a 1 a 2 a 1 a 2 a 1 a j a 1 a n a 2 a 2 a 1 a 2 a 2 a 2 a j a 2 a n a i a i a 1 a i a 2 a i a j a i a n We will also agree that a 1 = 1 a n a n a 1 a n a 2 a n a j a n a n 14

15 Multiplicative table for Z 5 is Z 5 [1] [2] [3] [4] [1] [1] [2] [3] [4] [2] [2] [4] [1] [3] [3] [3] [1] [4] [2] [4] [4] [3] [2] [1] Remark: It is clear that two groups G = {a 1, a 2,, a n } and H = {b 1, b 2,, b n } of the same order n are isomorphic if and only if it is possible to match elements a 1, a 2,, a n with elements b 1, b 2,, b n such that this one-one correspondence remains also for corresponding entries a i a j and b i b j of their multiplication tables 1 The multiplication tables below show that P = Z + 2 = Z 3 : P even odd even even odd odd odd even Z + 2 [0] [1] [0] [0] [1] [1] [1] [0] Z 3 [1] [2] [1] [1] [2] [2] [2] [1] 2 The multiplication tables below show that Z + 4 = Z 5 : Z + 4 [0] [1] [2] [3] [0] [0] [1] [2] [3] [1] [1] [2] [3] [0] [2] [2] [3] [0] [1] [3] [3] [0] [1] [2] Z 5 [1] [2] [4] [3] [1] [1] [2] [4] [3] [2] [2] [4] [3] [1] [4] [4] [3] [1] [2] [3] [3] [1] [2] [4] 3 The multiplication tables below show that Z + 6 = Z 7 : Z + 6 [0] [1] [2] [3] [4] [5] [0] [0] [1] [2] [3] [4] [5] [1] [1] [2] [3] [4] [5] [0] [2] [2] [3] [4] [5] [0] [1] [3] [3] [4] [5] [0] [1] [2] [4] [4] [5] [0] [1] [2] [3] [5] [5] [0] [1] [2] [3] [4] Z 7 [1] [3] [2] [6] [4] [5] [1] [1] [3] [2] [6] [4] [5] [3] [3] [2] [6] [4] [5] [1] [2] [2] [6] [4] [5] [1] [3] [6] [6] [4] [5] [1] [3] [2] [4] [4] [5] [1] [3] [2] [6] [5] [5] [1] [3] [2] [6] [4] 15

16 Theorem 10: Let f : G H is a homomorphism of groups Then (i) f(e) = e; (ii) f(x 1 ) = f(x) 1 ; (iii) f(x n ) = [f(x)] n for all n Z (i) We have e e = e = f(e e) = f(e) = f(e)f(e) = f(e) Multiplying both sides by [f(e)] 1, we get [f(e)] 1 f(e)f(e) = [f(e)] 1 f(e) = e f(e) = e = f(e) = e (ii) We have x x 1 = e = f(x x 1 ) = f(e) = f(x)f(x 1 ) = f(e) Since f(e) = e by (i), we get f(x)f(x 1 ) = e Similarly, from x 1 x = e one can deduce that f(x 1 )f(x) = e So, f(x)f(x 1 ) = f(x 1 )f(x) = e, which means that f(x 1 ) = f(x) 1 (iii) If n 1, one can prove f(x n ) = [f(x)] n by induction If n < 0, then f(x n ) = f((x 1 ) n ) = [f(x 1 )] n, which is equal to [f(x)] n by (ii) Theorem 11: Any two cyclic groups G and H of the same order are isomorphic Proof (Sketch): Suppose that G = a = {1, a, a 2,, a m 1 } and H = b = {1, b, b 2,, b m 1 } Then f : G H with f(a i ) = b i, 0 i m 1, is an isomorphism and G = H 16

17 We know that any group of the prime order is cyclic Therefore by Theorem 11 any two groups of the same prime order are isomorphic Let p be a prime number We know that the group Z + p 1 is cyclic, since Z + p 1 = [1] It is possible to prove that Z p is also cyclic Also, Z + p 1 = Z p = p 1 Therefore from Theorem 11 it follows that Z + p 1 = Z p Problem: Show that V = Z + 4 Solution: Assume to the contrary that V = Z + 4 Then there is a one-one correspondence f : V Z + 4 From this, in particularly, follows that there exists x V such that This and (iii) of Theorem 10 give f(x) = [1] f(x 2 ) = [f(x)] 2 = [1] 2 = [1] + [1] = [2] We now recall that for any element x V we have By this and (i) of Theorem 10 we get This is a contradiction x 2 = e f(x 2 ) = f(e) = e = [0] Remark: One can show that any group of order 4 is isomorphic to either Z + 4 or V 17

18 X KERNEL Definition 17: If f : G H is a homomorphism, define ker f = {x G : f(x) = 1} Theorem 12: Let f : G H be a homomorphism Then ker f is a subgroup of G Proof 1: From (i) of Theorem 10 it follows that 1 ker f, since f(1) = 1 Next, if x, y ker f, then hence f(x) = 1 = f(y), f(xy) = f(x)f(y) = 1 1 = 1, so xy ker f Finally, if x ker f, then f(x) = 1 and so f(x 1 ) = [f(x)] 1 = 1 1 = 1, hence x 1 ker f Therefore ker f is a subgroup of G Proof 2: From (i) of Theorem 10 it follows that 1 ker f, since f(1) = 1 Therefore ker G is a nonempty set Next, by the definition of a homomorphism and Theorem 10 we have f(xy 1 ) = f(x)f(y 1 ) = f(x)[f(y)] 1 = = 1 for any x, y ker f This means that if x, y ker f, then xy 1 ker f This gives the desired result thanks to Theorem 4 18

### Group Fundamentals. Chapter 1. 1.1 Groups and Subgroups. 1.1.1 Definition

Chapter 1 Group Fundamentals 1.1 Groups and Subgroups 1.1.1 Definition A group is a nonempty set G on which there is defined a binary operation (a, b) ab satisfying the following properties. Closure: If

### 4. FIRST STEPS IN THE THEORY 4.1. A

4. FIRST STEPS IN THE THEORY 4.1. A Catalogue of All Groups: The Impossible Dream The fundamental problem of group theory is to systematically explore the landscape and to chart what lies out there. We

### Group Theory. Contents

Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation

### ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair

### Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part II: Group Theory

Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN Part II: Group Theory No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Version: 1.1 Release: Jan 2013

### GROUPS ACTING ON A SET

GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for

### = 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### Assignment 8: Selected Solutions

Section 4.1 Assignment 8: Selected Solutions 1. and 2. Express each permutation as a product of disjoint cycles, and identify their parity. (1) (1,9,2,3)(1,9,6,5)(1,4,8,7)=(1,4,8,7,2,3)(5,9,6), odd; (2)

### Elements of Abstract Group Theory

Chapter 2 Elements of Abstract Group Theory Mathematics is a game played according to certain simple rules with meaningless marks on paper. David Hilbert The importance of symmetry in physics, and for

### The Dirichlet Unit Theorem

Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

### G = G 0 > G 1 > > G k = {e}

Proposition 49. 1. A group G is nilpotent if and only if G appears as an element of its upper central series. 2. If G is nilpotent, then the upper central series and the lower central series have the same

### 1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain

Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is

### SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

### Chapter 13: Basic ring theory

Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring

### it is easy to see that α = a

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore

### U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

### Introduction to Modern Algebra

Introduction to Modern Algebra David Joyce Clark University Version 0.0.6, 3 Oct 2008 1 1 Copyright (C) 2008. ii I dedicate this book to my friend and colleague Arthur Chou. Arthur encouraged me to write

### Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.

Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(

### ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath

International Electronic Journal of Algebra Volume 7 (2010) 140-151 ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP A. K. Das and R. K. Nath Received: 12 October 2009; Revised: 15 December

### Factoring Algorithms

Factoring Algorithms The p 1 Method and Quadratic Sieve November 17, 2008 () Factoring Algorithms November 17, 2008 1 / 12 Fermat s factoring method Fermat made the observation that if n has two factors

GROUP ACTIONS KEITH CONRAD 1. Introduction The symmetric groups S n, alternating groups A n, and (for n 3) dihedral groups D n behave, by their very definition, as permutations on certain sets. The groups

### Abstract Algebra Theory and Applications. Thomas W. Judson Stephen F. Austin State University

Abstract Algebra Theory and Applications Thomas W. Judson Stephen F. Austin State University August 16, 2013 ii Copyright 1997-2013 by Thomas W. Judson. Permission is granted to copy, distribute and/or

### Group Theory. Chapter 1

Chapter 1 Group Theory Most lectures on group theory actually start with the definition of what is a group. It may be worth though spending a few lines to mention how mathematicians came up with such a

### Chapter 7. Permutation Groups

Chapter 7 Permutation Groups () We started the study of groups by considering planar isometries In the previous chapter, we learnt that finite groups of planar isometries can only be cyclic or dihedral

### Chapter 7: Products and quotients

Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products

### NOTES ON GROUP THEORY

NOTES ON GROUP THEORY Abstract. These are the notes prepared for the course MTH 751 to be offered to the PhD students at IIT Kanpur. Contents 1. Binary Structure 2 2. Group Structure 5 3. Group Actions

### Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

### H/wk 13, Solutions to selected problems

H/wk 13, Solutions to selected problems Ch. 4.1, Problem 5 (a) Find the number of roots of x x in Z 4, Z Z, any integral domain, Z 6. (b) Find a commutative ring in which x x has infinitely many roots.

### Primality - Factorization

Primality - Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.

### Notes on finite group theory. Peter J. Cameron

Notes on finite group theory Peter J. Cameron October 2013 2 Preface Group theory is a central part of modern mathematics. Its origins lie in geometry (where groups describe in a very detailed way the

### Ideal Class Group and Units

Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals

### r + s = i + j (q + t)n; 2 rs = ij (qj + ti)n + qtn.

Chapter 7 Introduction to finite fields This chapter provides an introduction to several kinds of abstract algebraic structures, particularly groups, fields, and polynomials. Our primary interest is in

### ADDITIVE GROUPS OF RINGS WITH IDENTITY

ADDITIVE GROUPS OF RINGS WITH IDENTITY SIMION BREAZ AND GRIGORE CĂLUGĂREANU Abstract. A ring with identity exists on a torsion Abelian group exactly when the group is bounded. The additive groups of torsion-free

### FACTORING CERTAIN INFINITE ABELIAN GROUPS BY DISTORTED CYCLIC SUBSETS

International Electronic Journal of Algebra Volume 6 (2009) 95-106 FACTORING CERTAIN INFINITE ABELIAN GROUPS BY DISTORTED CYCLIC SUBSETS Sándor Szabó Received: 11 November 2008; Revised: 13 March 2009

### MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

### COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS

COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V. EROVENKO AND B. SURY ABSTRACT. We compute commutativity degrees of wreath products A B of finite abelian groups A and B. When B

### 11 Ideals. 11.1 Revisiting Z

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

### 6 Commutators and the derived series. [x,y] = xyx 1 y 1.

6 Commutators and the derived series Definition. Let G be a group, and let x,y G. The commutator of x and y is [x,y] = xyx 1 y 1. Note that [x,y] = e if and only if xy = yx (since x 1 y 1 = (yx) 1 ). Proposition

### (Q, ), (R, ), (C, ), where the star means without 0, (Q +, ), (R +, ), where the plus-sign means just positive numbers, and (U, ),

2 Examples of Groups 21 Some infinite abelian groups It is easy to see that the following are infinite abelian groups: Z, +), Q, +), R, +), C, +), where R is the set of real numbers and C is the set of

### THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear

### (0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order 4; (1, 0) : order 2; (1, 1) : order 4; (1, 2) : order 2; (1, 3) : order 4.

11.01 List the elements of Z 2 Z 4. Find the order of each of the elements is this group cyclic? Solution: The elements of Z 2 Z 4 are: (0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order

### Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

### THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP

THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP by I. M. Isaacs Mathematics Department University of Wisconsin 480 Lincoln Dr. Madison, WI 53706 USA E-Mail: isaacs@math.wisc.edu Maria

### GROUPS WITH TWO EXTREME CHARACTER DEGREES AND THEIR NORMAL SUBGROUPS

GROUPS WITH TWO EXTREME CHARACTER DEGREES AND THEIR NORMAL SUBGROUPS GUSTAVO A. FERNÁNDEZ-ALCOBER AND ALEXANDER MORETÓ Abstract. We study the finite groups G for which the set cd(g) of irreducible complex

### COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS

Bull Austral Math Soc 77 (2008), 31 36 doi: 101017/S0004972708000038 COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V EROVENKO and B SURY (Received 12 April 2007) Abstract We compute

### Lecture Notes on Discrete Mathematics

Lecture Notes on Discrete Mathematics A. K. Lal September 26, 2012 2 Contents 1 Preliminaries 5 1.1 Basic Set Theory.................................... 5 1.2 Properties of Integers.................................

### Breaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and

Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study

### FACTORING IN QUADRATIC FIELDS. 1. Introduction. This is called a quadratic field and it has degree 2 over Q. Similarly, set

FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is called a quadratic field and it has degree 2 over Q. Similarly,

### GROUP ALGEBRAS. ANDREI YAFAEV

GROUP ALGEBRAS. ANDREI YAFAEV We will associate a certain algebra to a finite group and prove that it is semisimple. Then we will apply Wedderburn s theory to its study. Definition 0.1. Let G be a finite

### Factoring of Prime Ideals in Extensions

Chapter 4 Factoring of Prime Ideals in Extensions 4. Lifting of Prime Ideals Recall the basic AKLB setup: A is a Dedekind domain with fraction field K, L is a finite, separable extension of K of degree

### Math 312 Homework 1 Solutions

Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please

### A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number

Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α K. The minimal polynomial Let K be a number field and

### Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of

### Notes on Group Theory

Notes on Group Theory Mark Reeder March 7, 2014 Contents 1 Notation for sets and functions 4 2 Basic group theory 4 2.1 The definition of a group................................. 4 2.2 Group homomorphisms..................................

### PROBLEM SET 6: POLYNOMIALS

PROBLEM SET 6: POLYNOMIALS 1. introduction In this problem set we will consider polynomials with coefficients in K, where K is the real numbers R, the complex numbers C, the rational numbers Q or any other

### 4. Expanding dynamical systems

4.1. Metric definition. 4. Expanding dynamical systems Definition 4.1. Let X be a compact metric space. A map f : X X is said to be expanding if there exist ɛ > 0 and L > 1 such that d(f(x), f(y)) Ld(x,

### PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

### CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents

### 1 Sets and Set Notation.

LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most

### Math 231b Lecture 35. G. Quick

Math 231b Lecture 35 G. Quick 35. Lecture 35: Sphere bundles and the Adams conjecture 35.1. Sphere bundles. Let X be a connected finite cell complex. We saw that the J-homomorphism could be defined by

### Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

### Algebra 3: algorithms in algebra

Algebra 3: algorithms in algebra Hans Sterk 2003-2004 ii Contents 1 Polynomials, Gröbner bases and Buchberger s algorithm 1 1.1 Introduction............................ 1 1.2 Polynomial rings and systems

### Algebra & Number Theory. A. Baker

Algebra & Number Theory [0/0/2009] A. Baker Department of Mathematics, University of Glasgow. E-mail address: a.baker@maths.gla.ac.uk URL: http://www.maths.gla.ac.uk/ ajb Contents Chapter. Basic Number

### FINITE GROUP THEORY. FOR COMBINATORISTS Volume one. Jin Ho Kwak. Department of Mathematics POSTECH Pohang, 790 784 Korea jinkwak@postech.ac.

FINITE GROUP THEORY FOR COMBINATORISTS Volume one Jin Ho Kwak Department of Mathematics POSTECH Pohang, 790 784 Korea jinkwak@postech.ac.kr Ming Yao Xu Department of Mathematics Peking University Beijing

### Factoring & Primality

Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount

### 2 Polynomials over a field

2 Polynomials over a field A polynomial over a field F is a sequence (a 0, a 1, a 2,, a n, ) where a i F i with a i = 0 from some point on a i is called the i th coefficient of f We define three special

### Group Theory and the Rubik s Cube. Janet Chen

Group Theory and the Rubik s Cube Janet Chen A Note to the Reader These notes are based on a 2-week course that I taught for high school students at the Texas State Honors Summer Math Camp. All of the

### On three zero-sum Ramsey-type problems

On three zero-sum Ramsey-type problems Noga Alon Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel and Yair Caro Department of Mathematics

### Factorization Algorithms for Polynomials over Finite Fields

Degree Project Factorization Algorithms for Polynomials over Finite Fields Sajid Hanif, Muhammad Imran 2011-05-03 Subject: Mathematics Level: Master Course code: 4MA11E Abstract Integer factorization is

### ALGEBRAIC NUMBER THEORY AND QUADRATIC RECIPROCITY

ALGEBRAIC NUMBER THEORY AND QUADRATIC RECIPROCITY HENRY COHN, JOSHUA GREENE, JONATHAN HANKE 1. Introduction These notes are from a series of lectures given by Henry Cohn during MIT s Independent Activities

### 1 Local Brouwer degree

1 Local Brouwer degree Let D R n be an open set and f : S R n be continuous, D S and c R n. Suppose that the set f 1 (c) D is compact. (1) Then the local Brouwer degree of f at c in the set D is defined.

### Invertible elements in associates and semigroups. 1

Quasigroups and Related Systems 5 (1998), 53 68 Invertible elements in associates and semigroups. 1 Fedir Sokhatsky Abstract Some invertibility criteria of an element in associates, in particular in n-ary

### INTRODUCTORY SET THEORY

M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

### IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible

### DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS

DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsion-free abelian groups, one of isomorphism

### A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

### 3 1. Note that all cubes solve it; therefore, there are no more

Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if

### Factoring Polynomials

Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent

### 1 VECTOR SPACES AND SUBSPACES

1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such

### 8430 HANDOUT 3: ELEMENTARY THEORY OF QUADRATIC FORMS

8430 HANDOUT 3: ELEMENTARY THEORY OF QUADRATIC FORMS PETE L. CLARK 1. Basic definitions An integral binary quadratic form is just a polynomial f = ax 2 + bxy + cy 2 with a, b, c Z. We define the discriminant

### 4.1 Modules, Homomorphisms, and Exact Sequences

Chapter 4 Modules We always assume that R is a ring with unity 1 R. 4.1 Modules, Homomorphisms, and Exact Sequences A fundamental example of groups is the symmetric group S Ω on a set Ω. By Cayley s Theorem,

### 4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2:

4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets

### α = u v. In other words, Orthogonal Projection

Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v

### Research Article On the Rank of Elliptic Curves in Elementary Cubic Extensions

Numbers Volume 2015, Article ID 501629, 4 pages http://dx.doi.org/10.1155/2015/501629 Research Article On the Rank of Elliptic Curves in Elementary Cubic Extensions Rintaro Kozuma College of International

### Subsets of Euclidean domains possessing a unique division algorithm

Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness

### A Hajós type result on factoring finite abelian groups by subsets II

Comment.Math.Univ.Carolin. 51,1(2010) 1 8 1 A Hajós type result on factoring finite abelian groups by subsets II Keresztély Corrádi, Sándor Szabó Abstract. It is proved that if a finite abelian group is

### EXERCISES FOR THE COURSE MATH 570, FALL 2010

EXERCISES FOR THE COURSE MATH 570, FALL 2010 EYAL Z. GOREN (1) Let G be a group and H Z(G) a subgroup such that G/H is cyclic. Prove that G is abelian. Conclude that every group of order p 2 (p a prime

### An Overview of Integer Factoring Algorithms. The Problem

An Overview of Integer Factoring Algorithms Manindra Agrawal IITK / NUS The Problem Given an integer n, find all its prime divisors as efficiently as possible. 1 A Difficult Problem No efficient algorithm

### Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

### SOLUTIONS FOR PROBLEM SET 2

SOLUTIONS FOR PROBLEM SET 2 A: There exist primes p such that p+6k is also prime for k = 1,2 and 3. One such prime is p = 11. Another such prime is p = 41. Prove that there exists exactly one prime p such

### LINEAR ALGEBRA W W L CHEN

LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,

### Integer Factorization using the Quadratic Sieve

Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract We give

### NOTES ON CATEGORIES AND FUNCTORS

NOTES ON CATEGORIES AND FUNCTORS These notes collect basic definitions and facts about categories and functors that have been mentioned in the Homological Algebra course. For further reading about category

### On an algorithm for classification of binary self-dual codes with minimum distance four

Thirteenth International Workshop on Algebraic and Combinatorial Coding Theory June 15-21, 2012, Pomorie, Bulgaria pp. 105 110 On an algorithm for classification of binary self-dual codes with minimum

### Linear Codes. Chapter 3. 3.1 Basics

Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length

### MODULES OVER A PID KEITH CONRAD

MODULES OVER A PID KEITH CONRAD Every vector space over a field K that has a finite spanning set has a finite basis: it is isomorphic to K n for some n 0. When we replace the scalar field K with a commutative

### ISOMETRIES OF R n KEITH CONRAD

ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x