A while back, we saw that hai with hai = 42 and Z 42 had basically the same structure, and said the groups were isomorphic, in some sense the same.
|
|
- Trevor Armstrong
- 5 years ago
- Views:
Transcription
1 CHAPTER 6 Isomorphisms A while back, we saw that hai with hai = 42 and Z 42 had basically the same structure, and said the groups were isomorphic, in some sense the same. Definition (Group Isomorphism). An isomorphism from a group G to a group G is a 1 1 mapping from G onto G that preserves the group operation. That is, (ab) = (a) (b) 8 a, b 2 G. If there is an isomorphism from G onto G, we say G and G arr isomorphic and write G G. Note. The operations in G and G may be di erent. The operation to the left of = is in G, while that on the right is in G. 70
2 To establish an isomorphism: (1) Define : G! G. 6. ISOMORPHISMS 71 (2) Show is 1 1: assuming (a) = (b), show a = b. (3) Show is onto: 8 g 2 G. show 9 g 2 G 3 (g) = g. (4) Show (ab) = (a) (b) 8 a, b 2 G. Example. With a = 42, show hai Z 42. Define : hai! Z 42 by (a n ) = n mod 42. [Show 1 1.] Suppose (a n ) = (a m ). Then n = m mod 42 =) 42 n m =) a n = a m by Theorem 4.1. Thus is 1 1. [Show onto.] For all n 2 Z 42, a n 2 hai and (a n ) = n, so is onto. [Show operation preservation.] For all a n, a m 2 hai, (a n a m ) = (a n+m ) = n+m mod 42 = n mod 42+m mod 42 = (a n )+ (a m ). Thus, by definition, hai Z 42. Example. Any finite cyclic group hai with hai = n is isomorphic to Z n under (a k ) = k mod n. The proof of this is identical to that of the previous example.
3 72 6. ISOMORPHISMS Example. Let G be the positive real numbers with multiplication and G be the group of real numbers with addition. Show G G. Define : G! G by (x) = ln(x). [Show 1 1.] Suppose (x) = (y). Then so is 1 1. ln(x) = ln(y) =) e ln(x) = e ln(y) =) x = y, [Show onto] Now suppose x 2 G. e x > 0 and (e x ) = ln e x = x, so is onto. [Show operation preservation.] Finally, for all x, y 2 G, so G G. (xy) = ln(xy) = ln x + ln y = (x) + (y), [Question: is the only isomorphism?] Example. Any infinite cyclic group is isomorphic to Z with addition. Given hai with a = 1, define (a k ) = k. The map is clearly onto. If (a n ) = (a m ), n = m =) a n = a m, so is 1 1. Also, so hai Z. (a n a m ) = (a n+m ) = n + m = (n) + (m), Consider h2i under addition, the cyclic group of even integers. The h2i Z = h1i with : h2i! Z defined by (2n) = n.
4 6. ISOMORPHISMS 73 Example. Let G be the group of real numbers under addition and G be the group of positive numbers under multiplication. Define (x) = 2 x 1. is 1 1 and onto but so is not an isomorphism. (1 + 2) = (3) = 4 6= 2 = 1 2 = (1) (2), Can this mapping be adjusted to make it an isomorphism? Use (x) = 2 x. If (x) = (y), 2 x = 2 y =) log 2 2 x = log 2 2 y =) x = y, so is 1 1. Given any positive y, (log 2 y) = 2 log 2 y = y, so is onto. Also, for all x, y 2 R, (x + y) = 2 x+y = 2 x 2 y = Thus is an isomorphism. Example. Are U(8) and U(12) isomorphic? Solution. (x) (y). U(8) = {1, 3, 5, 7} is noncyclic with 3 = 5 = 7 = 2. U(12) = {1, 5, 7, 11} is noncyclic with 5 = 7 = 11 = 2. Define : U(8)! U(12) by 1! (1), 3! 5, 5! 7, 7! 11. is clearly 1 1 and onto. Regarding operation preservation: (3 5) = (7) = 11 and (3) (5) = 5 7 = 11. (3 7) = (5) = 7 and (3) (7) = 5 11 = 7. (5 7) = (3) = 5 and (5) (7) = 7 11 = 5. (1 3) = (3) = 5 and (1) (3) = 1 5 = 5. etc. Since both groups are Abelian, we need only check each pair in a single order. Thus, U(8) U(12).
5 74 6. ISOMORPHISMS This group of order 4, with all non-identity element of order 2, is called the Klein 4 group. Any other group of order 4 must have an element of order 4, so is cyclic and isomorphic to Z 4. For orders 1, 2, 3, 5, there are only the cyclic groups Z 1, Z 2, Z 3, and Z 5. Problem (Page 140 # 36). Let G = {a + b p apple a 2b 2 a, b 2 Q} and H = a, b 2 Q Show b a that G and H are isomorphic under addition. Prove that G and H are closed under multiplication. Does your isomorphism preserve multiplication as well as addition? (G and H are examples of rings a topic we begin in Chapter 12) Solution. Given a + b p 2, c + d p 2 2 G. (a + b p 2) + (c + d p 2) = (a + c) + (b + d) p 2 2 G and (a + b p 2)(c + d p 2) = (ac + 2bd) + (ad + bc) p 2 2 G since (a + c), (b + d), (ac + 2bd), (ad + bc) 2 Q. apple apple a 2b c 2d Also, if b a, 2 H, d c apple apple apple a 2b c 2d a + c 2(b + d) b a + = and d c b + d a + c apple apple apple a 2b c 2d ac + 2bd 2(ad + bc) = 2 H b a d c ad + bc ac + 2bd since (a + c), (b + d), (ac + 2bd), ad + bc 2 Q. Thus G and H are closed under both addition and multiplication. Also, G and H are groups under addition (you can prove this, if you desire).
6 Define : G! H by (a + b p apple a 2b 2) = b a. Suppose (a + b p 2) = (c + d p apple apple a 2b c 2d 2). Then b a = d c 6. ISOMORPHISMS 75 a = c and b = d =) a + b p 2 = c + d p 2 =) is 1 1. apple a 2b For b a 2 H, a + bp 2 2 G and (a + b p apple a 2b 2) = b a =), so is onto. Now suppose a + b p 2, c + d p 2 2 G. Then (a + b p 2) + (c + d p 2) = (a + c) + (b + d) p apple a + c 2(b + d) 2 = = b + d a + c apple apple apple a + c 2b + 2d a 2b c 2d b + d a + c = = b a + = (a + b p 2) + (c + d p 2). d c Thus is an isomorphism under addition. Also, (a+b p 2)(c+d p 2) = (ac+2bd)+(ad+bc) p apple ac + 2bd 2(ad + bc) 2 = ad + bc ac + 2bd apple apple apple ac + 2bd 2ad + 2bc a 2b c 2d = = (a + b p 2) (c + d p 2). ad + bc ac + 2bd b a d c So preserves multiplication also. (We will later see that this makes a ring homomorphism.) =
7 76 6. ISOMORPHISMS Problem (Page 141 # 54). Consider G = hmi and H = hni where m, n 2 Z. These are groups under addition. Show G H. Does this isomorphism also preserve multiplication? Solution. Define : G! H by (x) = n x. Suppose (x) = (y). Then m n m x = n y =) x = y =) is 1 1. m For x 2 H, x = rn where r 2 Z. Then m n x = m rn = rm 2 G. Then n m n x = n m m n x = x, so is onto. Now, suppose x, y 2 G. Then (x + y) = n m (x + y) = n m x + n y = (x) + (y), m so addition is preserved and G H. But, (xy) = n m (xy) 6= n m x n m y = (x) (y), so multiplication is not preserved by.
8 6. ISOMORPHISMS 77 Theorem (3). is an equivalence relation on the set G of all groups. (1) G G. Define : G! G by (x) = x. This is clear. (2) Suppose G H. If : G! H is the isomrphism and, for g 2 G, (g) = h, then 1 : H! G where 1 (h) = g is 1 1 and onto. Suppose a, b 2 H. Since is onto, 9, 2 G 3 ( ) = a and ( ) = b. Then ( ) = ( ) ( ) = ab, so 1 (ab) = 1 ( ) ( ) = 1 ( ) = = Thus 1 is an isomorphism and H G. 1 ( ) 1 ( ) = 1 (a) 1 (b). (3) Suppose G H and H K with : G! H and : H! K the isomorphisms. Then : G! K is 1 1 and onto. For all a, b 2 G, ( )(ab) = (ab) = (a) (b) = (a) (b) = ( )(a) ( )(b). Thus G K and is an equivalence relation on G. Note. Thus, when two groups are isomorphic, they are in some sense equal. They di er in that their elements are named di erently. Knowing of a computation in one group, the isomorphism allows us to perform the analagous computation in the other group.
9 78 6. ISOMORPHISMS Example (Conjugation by a). Let G be a group, a 2 G. Define a function a : G! G by a (x) = axa 1. Suppose a(x) = a (y). Then axa 1 = aya 1 =) x = y by left and right cancellation. Thus a is 1 1. Now suppose y 2 G. We need to find x 2 G 3 axa 1 = y. But that will be so if x = a 1 ya, for then so a(x) = a (a 1 ya) = a(a 1 ya)a 1 = (aa 1 )y(aa 1 ) = eye = y, a is onto. Finally, for all x, y 2 G, a(xy) = axya 1 = axeya 1 = axa 1 aya 1 = Thus a is an isomorphism from G onto G. a (x) a (y). Recall U(8) = {1, 3, 5, 7}. Consider 7(1) = = 1, 7(3) = = 5 7 = 3, 7(5) = = 3 7 = 5, 7. Since 7 is its own inverse, 7(7) = = 1 7 = 7. Conjugation by 7 turns out to be the identity isomorphism, which is not very interesting.
10 6. ISOMORPHISMS 79 Theorem (6.1 Cayley s Theorem). Every group is isomorphic to a group of permutations. Let G be any group. [We need to find a set A and a permutation on A that forms a group G that is isomorphic to G.] We take the set G and define, for each g 2 G, the function T g : G! G by T g (x) = gx 8x 2 G. Now T g (x) = T g (y) =) gx = gy =) x = y by left cancellation, so T g is 1 1. Given y 2 G, by Theorem 2 (solutions of equations) 9 a unique solution x 2 G 3 gx = y or T g (x) = y. Thus T g is onto and so is a permutation on G. Now define G by {T g g 2 G}. For any g, h 2 G, (T g T h )(x) = T g T h (x) = T g (hx) = g(hx) = (gh)(x) = T gh (x) 8 x 2 G, so G is closed under composition. Then T e is the identity and T 1 g = T g 1. Since composition is associative, G is a group. Now define : G! G by (g) = T g 8 g 2 G. (g) = (h) =) T g = T h =) T g (e) = T h (e) =) ge = he =) g = h, so is 1 1. is clearly onto by construction. Finally, for g, h 2 G, (gh) = T gh = T g T h = (g) (h), so is an isomorphism.
11 80 6. ISOMORPHISMS Example. U = {1, 3, 5, 7}. apple apple T 1 = , T 3 = , T 5 = Then U(8) = {T 1, T 3, T 5, T 7 }. U(8) apple , T 7 = U(8) T 1 T 3 T 5 T 7 T 1 T 1 T 3 T 5 T 7 T 3 T 3 T 1 T 7 T 5 T 5 T 5 T 7 T 1 T 3 T 7 T 7 T 5 T 3 T 1 apple Theorem (6.2 Properties of Elements Acting on Elements). Suppose is an isomorphism from a group G onto a group G. Then (1) (e) = e. (e) = (ee) = (e) (e). Also, since (e) 2 G, (e) = e (e) =) e (e) = (e) (e) =) e = (e) by right cancellation. (2) For all n 2 Z and for all a 2 G, (a n ) = (a) n. For n 2 Z, n 0, (a n ) = (a) n from the definition of an isomorphism and induction. For n < 0, n > 0, so e = (e) = (a n a n ) = (a n ) (a n ) = (a n ) (a) n =) (a) n = (a n ). (3) For all a, b 2 G, ab = ba () (a) (b) = (b) (a). ab = ba () (ab) = (ba) () (a) (b) = (b) (a).
12 (4) G = hai () G = h (a)i. 6. ISOMORPHISMS 81 Let G = hai. By closure, h (a)i G. Since is onto, for any element b 2 G, 9 a k 2 G 3 (a k ) = b. Thus b = (a) k =) b 2 h (a)i. Thus G = h (a)i. Now suppose G = h (a)i. Clearly, hai G. For all b 2 G, (b) 2 h (a)i. Thus 9 k 2 Z 3 (b) = (a) k = (a k ). Since is 1 1, b = a k. Thus hai = G. (5) a = (a) 8 a 2 G (Isomorphisms preserve order). a n = e () (a n ) = (e) () (a) n = e. Thus a has infinite order () (a) has infinite order, and a has finite order n () (a) has infinite order n. (6) For a fixed integer k and a fixed b 2 G, x k = b has the same number of solutions in G as does x k = (b) in G. Suppose a is a solution of x k = b in G, i.e., a k = b. Then so (a) is a solution of x k = (b) in G. (a k ) = (b) =) (a) k = (b), Now suppose y is a solution of x k = (b) in G. Since is onto, 9 a 2 G 3 (a) = y. Then (a) k = (b) () (a k ) = (b) =) a k = b since is 1 1. Thus a is a solution of x k = b in G. Therefore, there exists a 1 1 correspondence between the sets of solutions. (7) If G is finite, then G and G have exactly the same number of elements of every order. Follows directly from property (5).
13 82 6. ISOMORPHISMS Example. Is C R with multiplication the operation of both groups? Solution. x 2 = 1 has 2 solutions in C, but none in R, so by Theorem 6.2(6) no isomorphism can exist. Theorem (6.3 Properties of Isomorphisms Acting on Groups). Suppose that is an isomorphism from a group G onto a group G. Then (1) 1 is an isomorphism from G onto G. The inverse of is 1 1 since is. Let g 2 G. 1 (g) = g =) is onto. Now let x, y 2 G. Then 1 (xy) = 1 (x) 1 (y) () 1 (xy) = 1 (x) 1 (y) () xy = 1 (x) 1 (y) = xy. Thus operations are preserved and 1 is an isomorphism. (2) G is Abelian () G is Abelian. Follows directly from Theorem 6.2(3) since isomorphisms preserve commutivity. (3) G is cyclic () G is cyclic. Follows directly from Theorem 6.2(4) since isomorphisms preserve order.
14 6. ISOMORPHISMS 83 (4) If K apple G, then (K) = { (k) k 2 K} apple G. Follows directly from Theorem 6.2(4) since isomorphisms preserve order. (5) If K apple G, then 1 (K) = {g 2 G (g) 2 K} apple G. Follows directly from (1) and (4). (6) Z(G) = Z(G). Follows directly from Theorem 6.2(3) since isomorphisms preserve commutivity. Definition (Automorphism). An isomorphims from a group G onto itself is called an automorphism. Problem (Psge 140 # 35). Show that the mapping (a + bi) = a bi is an automorphism of C under addition. Show that preserves complex multiplication as well. (This means is an automorphims of C as well.) so Solution. is clearly 1 1 and onto. Suppose a + bi, c + di 2 C. (a + bi) + (c + di) = (a + c) + (b + d)i = (a + c) (b + d)i is an automorphism of C under addition. (a bi) + (c di) = (a + bi) + (c + di), Now suppose a + bi, c + di 2 C. (a + bi)(c + di) = (ac bd) + (ad + bc)i = (ac bd) (ad + bc)i = (a bi)(c di) = (a + bi) (c + di), so is an automorphism of C under multiplication.
15 84 6. ISOMORPHISMS Example (related to Example 10 on Page 135). Consider R 2. Any reflection across a line through the origin or rotation about the origin is an automorphism under componentwise addition. For example, consider the reflection about the line y = 2x. y=2x P (a,b) Consider (a, b) not on y = 2x. The line through (a, b)? y = 2x is y b = 1 x a. To find P (using substitution): 2 2x b = 1 x a =) x = 1 2 a + b =) x = 1 5 a b =) y = 2 5 a b. Thus the direction vector v = P (a, b) takes (a, b) to P. 4 v = 5 a b, 2 5 a 1 5 b. Define (a, b) = (b, a). is clearly 1 1 and onto.
16 Finally, (a, b) + (c, d) = (a + c, b + d) = so 6. ISOMORPHISMS 85 (b + d, a + c) = (b, a) + (d, c) = (a, b) + (c, d), is an isomorphism. Definition (Inner Automorphism Induced by a). Let G be a group, a 2 G. The function a defined by a (x) = axa 1 8 x 2 G is called the inner automorphism of G induced by a. Example. The action of the inner automorphism of D 4 induced by R 90 is given in the following table.
17 86 6. ISOMORPHISMS Problem (Page 145 # 45). Suppose g and h induce the same inner automorphism of a group G. Prove h 1 g 2 Z(G). Let x 2 G. Then g(x) = h (x) =) gxg 1 = hxh 1 =) h 1 gxg 1 h = x =) (h 1 g)x(h 1 g) 1 h = x =) (h 1 g)x = x(h 1 g) =) h 1 g 2 Z(G) since x is arbitrary. Definition. Aut(G) = { is an automorphism of G} and Inn(G) = { is an inner automorphism of G}. Theorem (6.4 Aut(G) and Inn(G) are groups). Aut(G) and Inn(G) are groups under function composition. From the transitive portion of Theorem 3, compositions of isomorphisms are isomorphisms. Thus Aut(G) is closed under composition. We know function composition is associative and that the identity map is the identity automorphism. Suppose 2 Aut(G). 1 is clearly 1 1 and onto. Now 1 (xy) = 1 (x) 1 (y) () ((= by 1 1) 1 (xy) = 1 (x) 1 (y) () xy = 1 (x) 1 (y) () Thus 1 is operation preserving, and Aut(G) is a group. xy = xy.
18 6. ISOMORPHISMS 87 Now let g, h 2 Inn(G) Aut(G). For all x 2 G, g h(x) = g (hxh 1 ) = ghxh 1 g 1 = (gh)x(gh) 1 = gh (x), so gh = g h 2 Inn(G), and Inn(G) is closed under composition. Also, 1 g = g 1 since g 1 g(x) = g 1(gxg 1 ) = g 1 gxg 1 (g 1 ) 1 = g 1 gxg 1 g = exe = e (x), and so also gg 1 = e. Thus Inn(G) Aut(G) by the two-step test. Example. Find Inn(Z 12 ). Solution. Since Z 12 = {0, 1, 2,..., 11}, Inn(Z 12 ) = { 0, 1, 2,..., 11}, but the second list may have duplicates. That is the case here. For all n 2 Z 12 and for all x 2 Z 12, n(x) = n + x + ( n) = n + ( n) + x = 0 + x = 0 + x + 0 = 0 (x), the identity automorphism. Thus Inn(Z 12 ) = { 0 }.
19 88 6. ISOMORPHISMS Example. Find Inn(D 3 ). Solution. D 3 = {", (1 2 3), (1 3 2), (2 3), (1 3), (1 2)} as permutations. Then Inn(D 3 ) = { ", (1 2 3), (1 3 2), (2 3), (1 3), (1 2)}, but we need to eliminate repetitions. (1 2 3)(1 2 3) = (1 2 3)(1 2 3)(3 2 1) = (1 2 3). (1 2 3)(1 3 2) = (1 3 2)(1 2 3)(3 2 1) = (1 3 2). (1 2 3)(2 3) = (1 3 2)(2 3)(3 2 1) = (1 3). (1 2 3)(1 3) = (1 3 2)(1 3)(3 2 1) = (1 2). (1 2 3)(1 2) = (1 3 2)(1 2)(3 2 1) = (2 3). Thus (1 2 3) is distinct from ". (1 3 2)(2 3) = (1 3 2)(2 3)(2 3 1) = (1 2). Thus (1 3 2) is distinct. (2 3)(2 3) = (2 3)(2 3)(2 3) = (2 3). (2 3)(1 3) = (2 3)(1 3)(2 3) = (1 2). Thus (2 3) is distinct (1 3)(2 3) = (1 3)(2 3)(1 3) = (1 2). (1 3)(1 3) = (1 3)(1 3)(1 3) = (1 3). (1 3 2)(1 3) = (1 3 2)(1 3)(2 3 1) = (2 3). Thus (1 3) is distinct. (1 2)(2 3) = (1 2)(2 3)(1 2) = (1 3). (1 2)(1 3) = (1 2)(1 3)(1 2) = (2 3). Thus (1 2) is distinct. Therefore, there are no duplicates and Inn(D 3 ) = { ", (1 2 3), (1 3 2), (2 3), (1 3), (1 2)}.
20 6. ISOMORPHISMS 89 Theorem (6.5 Aut(Z n ) = U(n)). For all n 2 N, Aut(Z n ) = U(n). Let 2 Aut(Z n ). Then (k) = ( {z + 1} ) = ( (1) + (1) + + (1) ) = k (1). {z } k terms k terms Now 1 = n =) (1) = n, so (1) is a generator of Z n since 1 is also a generator. Now consider T : Aut(Z n )! U(n) where T ( ) = (1). Suppose, 2 Aut(Z n ) and T ( ) = T ( ). Then (1) = (1), so 8 k 2 Z n, (k) = k (1) = k (1) = (k). Thus = and T is 1 1. [To show T is onto.] Now suppose r 2 U(n) and consider : Z n! Z n defined by (s) = sr mod n 8 s 2 Z n. [To show 2 Aut(Z n ).] Suppose (x) = (y). Then xr = yr mod n. But r 1 exists modulo n =) xrr 1 = yrr 1 mod n =) x 1 = y 1 mod n =) x = y mod n, so is 1 1. Suppose x 2 Z n. By Theorem2, 9 s 2 Z n 3 (s) = sr = x, so is onto. Now suppose x, y 2 Z n. (x + y) = (x + y)r mod n = (xr + yr) mod n = so 2 Aut(Z n ). Since T ( ) = (1) = r, T is onto. xr mod n + yr mod n = (x) + (y),
21 90 6. ISOMORPHISMS Finally, let, 2 Aut(Z n ). Then T ( ) = ( )(1) = (1) = ( {z + 1} ) (1) terms (1) + (1) + + (1) = (1) (1) = T ( )T ( ), {z } (1) terms so Aut(Z n ) U(n). Example. Aut(Z 10 ) U(10). The multiplication tables for the two groups are given below: The isomorphism is clear.
Solution Outlines for Chapter 6
Solution Outlines for Chapter 6 # 1: Find an isomorphism from the group of integers under addition to the group of even integers under addition. Let φ : Z 2Z be defined by x x + x 2x. Then φ(x + y) 2(x
More informationIsomorphisms. 0 a 1, 1 a 3, 2 a 9, 3 a 7
Isomorphisms Consider the following Cayley tables for the groups Z 4, U(), R (= the group of symmetries of a nonsquare rhombus, consisting of four elements: the two rotations about the center, R 8, and
More informationCHAPTER 9. Normal Subgroups and Factor Groups. Normal Subgroups
Normal Subgroups CHAPTER 9 Normal Subgroups and Factor Groups If H apple G, we have seen situations where ah 6= Ha 8 a 2 G. Definition (Normal Subgroup). A subgroup H of a group G is a normal subgroup
More informationMA441: Algebraic Structures I. Lecture 15
MA441: Algebraic Structures I Lecture 15 27 October 2003 1 Correction for Lecture 14: I should have used multiplication on the right for Cayley s theorem. Theorem 6.1: Cayley s Theorem Every group is isomorphic
More informationAutomorphism Groups Definition. An automorphism of a group G is an isomorphism G G. The set of automorphisms of G is denoted Aut G.
Automorphism Groups 9-9-2012 Definition. An automorphism of a group G is an isomorphism G G. The set of automorphisms of G is denoted Aut G. Example. The identity map id : G G is an automorphism. Example.
More informationNormal Subgroups and Factor Groups
Normal Subgroups and Factor Groups Subject: Mathematics Course Developer: Harshdeep Singh Department/ College: Assistant Professor, Department of Mathematics, Sri Venkateswara College, University of Delhi
More informationThe Outer Automorphism of S 6
Meena Jagadeesan 1 Karthik Karnik 2 Mentor: Akhil Mathew 1 Phillips Exeter Academy 2 Massachusetts Academy of Math and Science PRIMES Conference, May 2016 What is a Group? A group G is a set of elements
More informationFrank Moore Algebra 901 Notes Professor: Tom Marley Direct Products of Groups:
Frank Moore Algebra 901 Notes Professor: Tom Marley Direct Products of Groups: Definition: The external direct product is defined to be the following: Let H 1,..., H n be groups. H 1 H 2 H n := {(h 1,...,
More information7 Semidirect product. Notes 7 Autumn Definition and properties
MTHM024/MTH74U Group Theory Notes 7 Autumn 20 7 Semidirect product 7. Definition and properties Let A be a normal subgroup of the group G. A complement for A in G is a subgroup H of G satisfying HA = G;
More informationMATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis
MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis PART B: GROUPS GROUPS 1. ab The binary operation a * b is defined by a * b = a+ b +. (a) Prove that * is associative.
More informationExercises MAT2200 spring 2013 Ark 4 Homomorphisms and factor groups
Exercises MAT2200 spring 2013 Ark 4 Homomorphisms and factor groups This Ark concerns the weeks No. (Mar ) and No. (Mar ). Plans until Eastern vacations: In the book the group theory included in the curriculum
More informationGroups and Symmetries
Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group
More informationAssigment 1. 1 a b. 0 1 c A B = (A B) (B A). 3. In each case, determine whether G is a group with the given operation.
1. Show that the set G = multiplication. Assigment 1 1 a b 0 1 c a, b, c R 0 0 1 is a group under matrix 2. Let U be a set and G = {A A U}. Show that G ia an abelian group under the operation defined by
More informationSolutions to Assignment 4
1. Let G be a finite, abelian group written additively. Let x = g G g, and let G 2 be the subgroup of G defined by G 2 = {g G 2g = 0}. (a) Show that x = g G 2 g. (b) Show that x = 0 if G 2 = 2. If G 2
More informationMath 103 HW 9 Solutions to Selected Problems
Math 103 HW 9 Solutions to Selected Problems 4. Show that U(8) is not isomorphic to U(10). Solution: Unfortunately, the two groups have the same order: the elements are U(n) are just the coprime elements
More informationGroups. 3.1 Definition of a Group. Introduction. Definition 3.1 Group
C H A P T E R t h r e E Groups Introduction Some of the standard topics in elementary group theory are treated in this chapter: subgroups, cyclic groups, isomorphisms, and homomorphisms. In the development
More informationElements of solution for Homework 5
Elements of solution for Homework 5 General remarks How to use the First Isomorphism Theorem A standard way to prove statements of the form G/H is isomorphic to Γ is to construct a homomorphism ϕ : G Γ
More informationBasic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed.
Math 546 Review Exam 2 NOTE: An (*) at the end of a line indicates that you will not be asked for the proof of that specific item on the exam But you should still understand the idea and be able to apply
More informationPROBLEMS FROM GROUP THEORY
PROBLEMS FROM GROUP THEORY Page 1 of 12 In the problems below, G, H, K, and N generally denote groups. We use p to stand for a positive prime integer. Aut( G ) denotes the group of automorphisms of G.
More informationSolutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3
Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3 3. (a) Yes; (b) No; (c) No; (d) No; (e) Yes; (f) Yes; (g) Yes; (h) No; (i) Yes. Comments: (a) is the additive group
More informationDISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3. Contents
DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3 T.K.SUBRAHMONIAN MOOTHATHU Contents 1. Cayley s Theorem 1 2. The permutation group S n 2 3. Center of a group, and centralizers 4 4. Group actions
More informationAlgebra-I, Fall Solutions to Midterm #1
Algebra-I, Fall 2018. Solutions to Midterm #1 1. Let G be a group, H, K subgroups of G and a, b G. (a) (6 pts) Suppose that ah = bk. Prove that H = K. Solution: (a) Multiplying both sides by b 1 on the
More informationM3P10: GROUP THEORY LECTURES BY DR. JOHN BRITNELL; NOTES BY ALEKSANDER HORAWA
M3P10: GROUP THEORY LECTURES BY DR. JOHN BRITNELL; NOTES BY ALEKSANDER HORAWA These are notes from the course M3P10: Group Theory taught by Dr. John Britnell, in Fall 2015 at Imperial College London. They
More informationDEPARTMENT OF MATHEMATIC EDUCATION MATHEMATIC AND NATURAL SCIENCE FACULTY
HANDOUT ABSTRACT ALGEBRA MUSTHOFA DEPARTMENT OF MATHEMATIC EDUCATION MATHEMATIC AND NATURAL SCIENCE FACULTY 2012 BINARY OPERATION We are all familiar with addition and multiplication of two numbers. Both
More informationφ(xy) = (xy) n = x n y n = φ(x)φ(y)
Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =
More informationQuiz 2 Practice Problems
Quiz 2 Practice Problems Math 332, Spring 2010 Isomorphisms and Automorphisms 1. Let C be the group of complex numbers under the operation of addition, and define a function ϕ: C C by ϕ(a + bi) = a bi.
More informationAugust 2015 Qualifying Examination Solutions
August 2015 Qualifying Examination Solutions If you have any difficulty with the wording of the following problems please contact the supervisor immediately. All persons responsible for these problems,
More informationSUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT
SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT Contents 1. Group Theory 1 1.1. Basic Notions 1 1.2. Isomorphism Theorems 2 1.3. Jordan- Holder Theorem 2 1.4. Symmetric Group 3 1.5. Group action on Sets 3 1.6.
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More informationThe Symmetric Groups
Chapter 7 The Symmetric Groups 7. Introduction In the investigation of finite groups the symmetric groups play an important role. Often we are able to achieve a better understanding of a group if we can
More informationMath 450 Fall 2000 Solutions to selected problems. Proof. Let i mod n = k and j mod n = l. Then we need to show that. i = qn + k and j = sn + l.
Math 450 Fall 2000 Solutions to selected problems Page 21. 14. Suppose that n is a fixed positive integer, greater than 1. For any integers i and j show that i mod n + j mod n =(i + j) mod n. Proof. Let
More informationSPRING BREAK PRACTICE PROBLEMS - WORKED SOLUTIONS
Math 330 - Abstract Algebra I Spring 2009 SPRING BREAK PRACTICE PROBLEMS - WORKED SOLUTIONS (1) Suppose that G is a group, H G is a subgroup and K G is a normal subgroup. Prove that H K H. Solution: We
More informationGroups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems
Group Theory Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems Groups Definition : A non-empty set ( G,*)
More informationChapter 5 Groups of permutations (bijections) Basic notation and ideas We study the most general type of groups - groups of permutations
Chapter 5 Groups of permutations (bijections) Basic notation and ideas We study the most general type of groups - groups of permutations (bijections). Definition A bijection from a set A to itself is also
More informationGROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION
Chapter-1 GROUPS 1.1. INTRODUCTION The theory of groups arose from the theory of equations, during the nineteenth century. Originally, groups consisted only of transformations. The group of transformations
More informationNote that a unit is unique: 1 = 11 = 1. Examples: Nonnegative integers under addition; all integers under multiplication.
Algebra fact sheet An algebraic structure (such as group, ring, field, etc.) is a set with some operations and distinguished elements (such as 0, 1) satisfying some axioms. This is a fact sheet with definitions
More informationIntroduction to Groups
Introduction to Groups Hong-Jian Lai August 2000 1. Basic Concepts and Facts (1.1) A semigroup is an ordered pair (G, ) where G is a nonempty set and is a binary operation on G satisfying: (G1) a (b c)
More informationgroup homomorphism if for every a; b 2 G we have Notice that the operation on the left is occurring in G 1 while the operation
Math 375 Week 6 6.1 Homomorphisms and Isomorphisms DEFINITION 1 Let G 1 and G 2 groups and let : G 1! G 2 be a function. Then is a group homomorphism if for every a; b 2 G we have (ab) =(a)(b): REMARK
More informationMath 120: Homework 6 Solutions
Math 120: Homewor 6 Solutions November 18, 2018 Problem 4.4 # 2. Prove that if G is an abelian group of order pq, where p and q are distinct primes then G is cyclic. Solution. By Cauchy s theorem, G has
More informationCourse 311: Abstract Algebra Academic year
Course 311: Abstract Algebra Academic year 2007-08 D. R. Wilkins Copyright c David R. Wilkins 1997 2007 Contents 1 Topics in Group Theory 1 1.1 Groups............................... 1 1.2 Examples of Groups.......................
More informationGroup Theory. PHYS Southern Illinois University. November 15, PHYS Southern Illinois University Group Theory November 15, / 7
Group Theory PHYS 500 - Southern Illinois University November 15, 2016 PHYS 500 - Southern Illinois University Group Theory November 15, 2016 1 / 7 of a Mathematical Group A group G is a set of elements
More informationIIT Mumbai 2015 MA 419, Basic Algebra Tutorial Sheet-1
IIT Mumbai 2015 MA 419, Basic Algebra Tutorial Sheet-1 Let Σ be the set of all symmetries of the plane Π. 1. Give examples of s, t Σ such that st ts. 2. If s, t Σ agree on three non-collinear points, then
More informationWritten Homework # 1 Solution
Math 516 Fall 2006 Radford Written Homework # 1 Solution 10/11/06 Remark: Most of the proofs on this problem set are just a few steps from definitions and were intended to be a good warm up for the course.
More informationS11MTH 3175 Group Theory (Prof.Todorov) Final (Practice Some Solutions) 2 BASIC PROPERTIES
S11MTH 3175 Group Theory (Prof.Todorov) Final (Practice Some Solutions) 2 BASIC PROPERTIES 1 Some Definitions For your convenience, we recall some of the definitions: A group G is called simple if it has
More informationMATH 436 Notes: Cyclic groups and Invariant Subgroups.
MATH 436 Notes: Cyclic groups and Invariant Subgroups. Jonathan Pakianathan September 30, 2003 1 Cyclic Groups Now that we have enough basic tools, let us go back and study the structure of cyclic groups.
More informationPhysics 251 Solution Set 1 Spring 2017
Physics 5 Solution Set Spring 07. Consider the set R consisting of pairs of real numbers. For (x,y) R, define scalar multiplication by: c(x,y) (cx,cy) for any real number c, and define vector addition
More informationNumber Axioms. P. Danziger. A Group is a set S together with a binary operation (*) on S, denoted a b such that for all a, b. a b S.
Appendix A Number Axioms P. Danziger 1 Number Axioms 1.1 Groups Definition 1 A Group is a set S together with a binary operation (*) on S, denoted a b such that for all a, b and c S 0. (Closure) 1. (Associativity)
More informationProblem Set Mash 1. a2 b 2 0 c 2. and. a1 a
Problem Set Mash 1 Section 1.2 15. Find a set of generators and relations for Z/nZ. h 1 1 n 0i Z/nZ. Section 1.4 a b 10. Let G 0 c a, b, c 2 R,a6 0,c6 0. a1 b (a) Compute the product of 1 a2 b and 2 0
More informationAlgebra I: Final 2012 June 22, 2012
1 Algebra I: Final 2012 June 22, 2012 Quote the following when necessary. A. Subgroup H of a group G: H G = H G, xy H and x 1 H for all x, y H. B. Order of an Element: Let g be an element of a group G.
More information120A LECTURE OUTLINES
120A LECTURE OUTLINES RUI WANG CONTENTS 1. Lecture 1. Introduction 1 2 1.1. An algebraic object to study 2 1.2. Group 2 1.3. Isomorphic binary operations 2 2. Lecture 2. Introduction 2 3 2.1. The multiplication
More informationABSTRACT ALGEBRA: REVIEW PROBLEMS ON GROUPS AND GALOIS THEORY
ABSTRACT ALGEBRA: REVIEW PROBLEMS ON GROUPS AND GALOIS THEORY John A. Beachy Northern Illinois University 2000 ii J.A.Beachy This is a supplement to Abstract Algebra, Second Edition by John A. Beachy and
More informationAlgebra. Travis Dirle. December 4, 2016
Abstract Algebra 2 Algebra Travis Dirle December 4, 2016 2 Contents 1 Groups 1 1.1 Semigroups, Monoids and Groups................ 1 1.2 Homomorphisms and Subgroups................. 2 1.3 Cyclic Groups...........................
More informationxy xyy 1 = ey 1 = y 1 i.e.
Homework 2 solutions. Problem 4.4. Let g be an element of the group G. Keep g fixed and let x vary through G. Prove that the products gx are all distinct and fill out G. Do the same for the products xg.
More informationTeddy Einstein Math 4320
Teddy Einstein Math 4320 HW4 Solutions Problem 1: 2.92 An automorphism of a group G is an isomorphism G G. i. Prove that Aut G is a group under composition. Proof. Let f, g Aut G. Then f g is a bijective
More informationChapter 16 MSM2P2 Symmetry And Groups
Chapter 16 MSM2P2 Symmetry And Groups 16.1 Symmetry 16.1.1 Symmetries Of The Square Definition 1 A symmetry is a function from an object to itself such that for any two points a and b in the object, the
More informationTheorems and Definitions in Group Theory
Theorems and Definitions in Group Theory Shunan Zhao Contents 1 Basics of a group 3 1.1 Basic Properties of Groups.......................... 3 1.2 Properties of Inverses............................. 3
More informationSUMMARY OF GROUPS AND RINGS GROUPS AND RINGS III Week 1 Lecture 1 Tuesday 3 March.
SUMMARY OF GROUPS AND RINGS GROUPS AND RINGS III 2009 Week 1 Lecture 1 Tuesday 3 March. 1. Introduction (Background from Algebra II) 1.1. Groups and Subgroups. Definition 1.1. A binary operation on a set
More informationSolutions of exercise sheet 4
D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 4 The content of the marked exercises (*) should be known for the exam. 1. Prove the following two properties of groups: 1. Every
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationFirst Semester Abstract Algebra for Undergraduates
First Semester Abstract Algebra for Undergraduates Lecture notes by: Khim R Shrestha, Ph. D. Assistant Professor of Mathematics University of Great Falls Great Falls, Montana Contents 1 Introduction to
More informationB Sc MATHEMATICS ABSTRACT ALGEBRA
UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc MATHEMATICS (0 Admission Onwards) V Semester Core Course ABSTRACT ALGEBRA QUESTION BANK () Which of the following defines a binary operation on Z
More informationMAT534 Fall 2013 Practice Midterm I The actual midterm will consist of five problems.
MAT534 Fall 2013 Practice Midterm I The actual midterm will consist of five problems. Problem 1 Find all homomorphisms a) Z 6 Z 6 ; b) Z 6 Z 18 ; c) Z 18 Z 6 ; d) Z 12 Z 15 ; e) Z 6 Z 25 Proof. a)ψ(1)
More informationx 2 = xn xn = x 2 N = N = 0
Potpourri. Spring 2010 Problem 2 Let G be a finite group with commutator subgroup G. Let N be the subgroup of G generated by the set {x 2 : x G}. Then N is a normal subgroup of G and N contains G. Proof.
More informationS11MTH 3175 Group Theory (Prof.Todorov) Quiz 6 (PracticeSolutions) Name: 1. Let G and H be two groups and G H the external direct product of G and H.
Some of the problems are very easy, some are harder. 1. Let G and H be two groups and G H the external direct product of G and H. (a) Prove that the map f : G H H G defined as f(g, h) = (h, g) is a group
More informationModern Computer Algebra
Modern Computer Algebra Exercises to Chapter 25: Fundamental concepts 11 May 1999 JOACHIM VON ZUR GATHEN and JÜRGEN GERHARD Universität Paderborn 25.1 Show that any subgroup of a group G contains the neutral
More informationZachary Scherr Math 370 HW 7 Solutions
1 Book Problems 1. 2.7.4b Solution: Let U 1 {u 1 u U} and let S U U 1. Then (U) is the set of all elements of G which are finite products of elements of S. We are told that for any u U and g G we have
More informationExercises on chapter 1
Exercises on chapter 1 1. Let G be a group and H and K be subgroups. Let HK = {hk h H, k K}. (i) Prove that HK is a subgroup of G if and only if HK = KH. (ii) If either H or K is a normal subgroup of G
More informationMathematics 331 Solutions to Some Review Problems for Exam a = c = 3 2 1
Mathematics 331 Solutions to Some Review Problems for Exam 2 1. Write out all the even permutations in S 3. Solution. The six elements of S 3 are a =, b = 1 3 2 2 1 3 c =, d = 3 2 1 2 3 1 e =, f = 3 1
More informationMathematics Department Qualifying Exam: Algebra Fall 2012
Mathematics Department Qualifying Exam: Algebra Fall 202 Part A. Solve five of the following eight problems:. Let {[ ] a b R = a, b Z} and S = {a + b 2 a, b Z} 2b a ([ ]) a b Define ϕ: R S by ϕ = a + b
More informationMA441: Algebraic Structures I. Lecture 14
MA441: Algebraic Structures I Lecture 14 22 October 2003 1 Review from Lecture 13: We looked at how the dihedral group D 4 can be viewed as 1. the symmetries of a square, 2. a permutation group, and 3.
More informationMath 451, 01, Exam #2 Answer Key
Math 451, 01, Exam #2 Answer Key 1. (25 points): If the statement is always true, circle True and prove it. If the statement is never true, circle False and prove that it can never be true. If the statement
More informationAbstract Algebra: Supplementary Lecture Notes
Abstract Algebra: Supplementary Lecture Notes JOHN A. BEACHY Northern Illinois University 1995 Revised, 1999, 2006 ii To accompany Abstract Algebra, Third Edition by John A. Beachy and William D. Blair
More informationModern Algebra (MA 521) Synopsis of lectures July-Nov 2015 semester, IIT Guwahati
Modern Algebra (MA 521) Synopsis of lectures July-Nov 2015 semester, IIT Guwahati Shyamashree Upadhyay Contents 1 Lecture 1 4 1.1 Properties of Integers....................... 4 1.2 Sets, relations and
More informationNormal Automorphisms of Free Burnside Groups of Period 3
Armenian Journal of Mathematics Volume 9, Number, 017, 60 67 Normal Automorphisms of Free Burnside Groups of Period 3 V. S. Atabekyan, H. T. Aslanyan and A. E. Grigoryan Abstract. If any normal subgroup
More informationName: Solutions - AI FINAL EXAM
1 2 3 4 5 6 7 8 9 10 11 12 13 total Name: Solutions - AI FINAL EXAM The first 7 problems will each count 10 points. The best 3 of # 8-13 will count 10 points each. Total is 100 points. A 4th problem from
More informationSome practice problems for midterm 2
Some practice problems for midterm 2 Kiumars Kaveh November 14, 2011 Problem: Let Z = {a G ax = xa, x G} be the center of a group G. Prove that Z is a normal subgroup of G. Solution: First we prove Z is
More informationMath 210B: Algebra, Homework 4
Math 210B: Algebra, Homework 4 Ian Coley February 5, 2014 Problem 1. Let S be a multiplicative subset in a commutative ring R. Show that the localisation functor R-Mod S 1 R-Mod, M S 1 M, is exact. First,
More informationMath 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille
Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is
More informationINTRODUCTION TO THE GROUP THEORY
Lecture Notes on Structure of Algebra INTRODUCTION TO THE GROUP THEORY By : Drs. Antonius Cahya Prihandoko, M.App.Sc e-mail: antoniuscp.fkip@unej.ac.id Mathematics Education Study Program Faculty of Teacher
More informationDIHEDRAL GROUPS II KEITH CONRAD
DIHEDRAL GROUPS II KEITH CONRAD We will characterize dihedral groups in terms of generators and relations, and describe the subgroups of D n, including the normal subgroups. We will also introduce an infinite
More informationExercises MAT2200 spring 2014 Ark 4 Homomorphisms and factor groups
Exercises MAT2200 spring 2014 Ark 4 Homomorphisms and factor groups This Ark concerns the weeks No. (Mar ) and No. (Mar ). It is not very logical to have lectures on Fridays and problem solving in plenum
More informationDERIVATIONS. Introduction to non-associative algebra. Playing havoc with the product rule? BERNARD RUSSO University of California, Irvine
DERIVATIONS Introduction to non-associative algebra OR Playing havoc with the product rule? PART VI COHOMOLOGY OF LIE ALGEBRAS BERNARD RUSSO University of California, Irvine FULLERTON COLLEGE DEPARTMENT
More informationAbstract Algebra, Second Edition, by John A. Beachy and William D. Blair. Corrections and clarifications
1 Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair Corrections and clarifications Note: Some corrections were made after the first printing of the text. page 9, line 8 For of the
More informationChapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples
Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter
More informationALGEBRA QUALIFYING EXAM PROBLEMS
ALGEBRA QUALIFYING EXAM PROBLEMS Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND MODULES General
More informationA. (Groups of order 8.) (a) Which of the five groups G (as specified in the question) have the following property: G has a normal subgroup N such that
MATH 402A - Solutions for the suggested problems. A. (Groups of order 8. (a Which of the five groups G (as specified in the question have the following property: G has a normal subgroup N such that N =
More informationGroup Theory
Group Theory 2014 2015 Solutions to the exam of 4 November 2014 13 November 2014 Question 1 (a) For every number n in the set {1, 2,..., 2013} there is exactly one transposition (n n + 1) in σ, so σ is
More informationSolutions of Assignment 10 Basic Algebra I
Solutions of Assignment 10 Basic Algebra I November 25, 2004 Solution of the problem 1. Let a = m, bab 1 = n. Since (bab 1 ) m = (bab 1 )(bab 1 ) (bab 1 ) = ba m b 1 = b1b 1 = 1, we have n m. Conversely,
More information( ) 3 = ab 3 a!1. ( ) 3 = aba!1 a ( ) = 4 " 5 3 " 4 = ( )! 2 3 ( ) =! 5 4. Math 546 Problem Set 15
Math 546 Problem Set 15 1. Let G be a finite group. (a). Suppose that H is a subgroup of G and o(h) = 4. Suppose that K is a subgroup of G and o(k) = 5. What is H! K (and why)? Solution: H! K = {e} since
More informationGROUP ACTIONS EMMANUEL KOWALSKI
GROUP ACTIONS EMMANUEL KOWALSKI Definition 1. Let G be a group and T a set. An action of G on T is a map a: G T T, that we denote a(g, t) = g t, such that (1) For all t T, we have e G t = t. (2) For all
More informationHomework #5 Solutions
Homework #5 Solutions p 83, #16. In order to find a chain a 1 a 2 a n of subgroups of Z 240 with n as large as possible, we start at the top with a n = 1 so that a n = Z 240. In general, given a i we will
More informationBlock Introduction. Some self study examples and proof of the theorems are left to the readers to check their progress.
Abstract Algebra The word Algebra is derived from the Arabic word al-jabr. Classically, algebra involves the study of equations and a number of problems that devoted out of the theory of equations. Then
More informationHomework #11 Solutions
Homework #11 Solutions p 166, #18 We start by counting the elements in D m and D n, respectively, of order 2. If x D m and x 2 then either x is a flip or x is a rotation of order 2. The subgroup of rotations
More informationGRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.
GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,
More informationAbstract Algebra II Groups ( )
Abstract Algebra II Groups ( ) Melchior Grützmann / melchiorgfreehostingcom/algebra October 15, 2012 Outline Group homomorphisms Free groups, free products, and presentations Free products ( ) Definition
More informationarxiv: v2 [math.gr] 7 Nov 2015
ON SCHUR 3-GROUPS GRIGORY RYABOV arxiv:1502.04615v2 [math.gr] 7 Nov 2015 Abstract. Let G be a finite group. If Γ is a permutation group with G right Γ Sym(G) and S is the set of orbits of the stabilizer
More informationSolutions to Some Review Problems for Exam 3. by properties of determinants and exponents. Therefore, ϕ is a group homomorphism.
Solutions to Some Review Problems for Exam 3 Recall that R, the set of nonzero real numbers, is a group under multiplication, as is the set R + of all positive real numbers. 1. Prove that the set N of
More informationMATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM
MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is
More informationThe Gordon game. EWU Digital Commons. Eastern Washington University. Anthony Frenk Eastern Washington University
Eastern Washington University EWU Digital Commons EWU Masters Thesis Collection Student Research and Creative Works 2013 The Gordon game Anthony Frenk Eastern Washington University Follow this and additional
More informationSchool of Mathematics and Statistics. MT5824 Topics in Groups. Problem Sheet I: Revision and Re-Activation
MRQ 2009 School of Mathematics and Statistics MT5824 Topics in Groups Problem Sheet I: Revision and Re-Activation 1. Let H and K be subgroups of a group G. Define HK = {hk h H, k K }. (a) Show that HK
More information