Converse to Lagrange s Theorem Groups

Size: px
Start display at page:

Transcription

1 Converse to Lagrange s Theorem Groups Blain A Patterson Youngstown State University May 10, 2013

2 History In 1771 an Italian mathematician named Joseph Lagrange proved a theorem that put constraints on what types of subgroups a group is allowed to have. Today we call it Lagrange s theorem and it states:

3 History In 1771 an Italian mathematician named Joseph Lagrange proved a theorem that put constraints on what types of subgroups a group is allowed to have. Today we call it Lagrange s theorem and it states: Let G be a group and H G, then H G.

4 History In 1771 an Italian mathematician named Joseph Lagrange proved a theorem that put constraints on what types of subgroups a group is allowed to have. Today we call it Lagrange s theorem and it states: Let G be a group and H G, then H G. About 100 years later, group theorists began to wonder about a converse to Lagrange s theorem. That is, if G is a group and n is an integer such that n G, does G have a subgroup H of order n? If this holds true for the group G, then we call G a Converse to Lagrange s theorem group, or CLT group for short.

5 Introduction We will cover the following questions concerning CLT groups:

6 Introduction We will cover the following questions concerning CLT groups: 1 What are some examples of CLT groups and what are some examples of groups that are not CLT groups?

7 Introduction We will cover the following questions concerning CLT groups: 1 What are some examples of CLT groups and what are some examples of groups that are not CLT groups? 2 If a group is CLT group, are all of it s subgroups and quotient groups CLT groups?

8 Introduction We will cover the following questions concerning CLT groups: 1 What are some examples of CLT groups and what are some examples of groups that are not CLT groups? 2 If a group is CLT group, are all of it s subgroups and quotient groups CLT groups? 3 Can we find wide classes of groups that are CLT groups?

9 Introduction We will cover the following questions concerning CLT groups: 1 What are some examples of CLT groups and what are some examples of groups that are not CLT groups? 2 If a group is CLT group, are all of it s subgroups and quotient groups CLT groups? 3 Can we find wide classes of groups that are CLT groups? 4 Given an integer n and a group G such that G = n, is it more likely that G is a CLT group or G is not a CLT group?

10 Lagrange s Theorem Below is an example of Lagrange s Theorem:

11 Lagrange s Theorem Below is an example of Lagrange s Theorem: Z 6 = {0, 1, 2, 3, 4, 5}, so Z 6 = 6. Now all subgroups will divide the order of the group. The subgroups of Z 6 include: Z 6, < 2 >= {0, 2, 4}, < 3 >= {0, 3}, and the trivial subgroup, < 0 >, which have orders of 6, 3, 2, and 1 respectively. Thus the order of each subgroup divides the order of Z 6.

12 Converse to Lagrange s Theorem Group Let G be a group, then G is a Converse to Lagrange s Theorem Group (CLT group), if for all n G there exists H G such that H = n.

13 Converse to Lagrange s Theorem Group Let G be a group, then G is a Converse to Lagrange s Theorem Group (CLT group), if for all n G there exists H G such that H = n. Example S 3 = {1, (123), (132), (12), (13), (23)} is a CLT group since S 3 = 6 and there exists at least one subgroup of each divisor of 6, namely 6, 3, 2, and 1. S 3, < (123) >= {1, (123), (132)}, < (12) >= {1, (12)}, and {1} are all subgroups of S 3 with orders of each of the divisors of 6, namely orders of 6, 3, 2, and 1 respectively.

14 Example Below is another example of a CLT group:

15 Example Below is another example of a CLT group: Example S 4 is a CLT group since S 4 = 24 and there exists at least one subgroup of each divisor of 24. Observe {1} = 1, < (12) > = 2, < (123) > = 3, < (1234) > = 4, a copy of S 3 which has order 6, a copy of D 4 which has order 8, A 4 = 12, and S 4 = 24. Notice that all the groups listed are subgroups of S 4. Thus there exists a subgroup of every order of the divisors of S 4, namely 24, 12, 8, 6, 4, 3, 2, and 1.

16 Theorems Theorem 1.1 Let G be a group and a in G. Then a G = 1.

17 Theorems Theorem 1.1 Let G be a group and a in G. Then a G = 1. Theorem 1.2 Let G be a group and H G such that then H G. G H = 2

18 Proposition Claim: A 4 is not a CLT group since there exists no subgroup of A 4 with order 6.

19 Proposition Claim: A 4 is not a CLT group since there exists no subgroup of A 4 with order 6. Suppose there exists a subgroup of A 4 with order 6, call this subgroup H. Then A 4 H = 12 6 = 2

20 Proposition Claim: A 4 is not a CLT group since there exists no subgroup of A 4 with order 6. Suppose there exists a subgroup of A 4 with order 6, call this subgroup H. Then A 4 H = 12 6 = 2 So, by Theorem 1.2, H A 4. Thus A 4 /H is a group with order 2. Let φ A 4. Then φh A 4 /H. Now (φh) A 4 H = 1H (φh) 2 = 1H

21 Proposition Continued Hence φ 2 H = 1H. Now, 1 1 φ 2 H so φ 2 H for all φ A 4.

22 Proposition Continued Hence φ 2 H = 1H. Now, 1 1 φ 2 H so φ 2 H for all φ A 4. Thus we have 1 2 = 1 (123) 2 = (132) (132) 2 = (123) (124) 2 = (142) (142) 2 = (124) (134) 2 = (143) (143) 2 = (134)

23 Proposition Continued Hence φ 2 H = 1H. Now, 1 1 φ 2 H so φ 2 H for all φ A 4. Thus we have 1 2 = 1 (123) 2 = (132) (132) 2 = (123) (124) 2 = (142) (142) 2 = (124) (134) 2 = (143) (143) 2 = (134) Therefore, we get H 7, which is a contradiction. Thus, A 4 does not have a subgroup of order 6 and is not a CLT group.

24 Behavior of CLT Groups Recall that S 4 is a CLT group and A 4 is not a CLT group.

25 Behavior of CLT Groups Recall that S 4 is a CLT group and A 4 is not a CLT group. Note that A 4 S 4.

26 Behavior of CLT Groups Recall that S 4 is a CLT group and A 4 is not a CLT group. Note that A 4 S 4. So a subgroup of a CLT group might not necessarily be a CLT group itself.

27 Theorems Theorem 1.3 Let G 1 and G 2 be groups with H 1 G 1 and H 2 G 2. Then H 1 H 2 G 1 G 2.

28 Theorems Theorem 1.3 Let G 1 and G 2 be groups with H 1 G 1 and H 2 G 2. Then H 1 H 2 G 1 G 2. Theorem 1.4 Let G 1 and G 2 be groups with H 1 G 1. Then H 1 {1} G 1 G 2.

29 Theorems Theorem 1.3 Let G 1 and G 2 be groups with H 1 G 1 and H 2 G 2. Then H 1 H 2 G 1 G 2. Theorem 1.4 Let G 1 and G 2 be groups with H 1 G 1. Then H 1 {1} G 1 G 2. Theorem 1.5 Let G 1 and G 2 be groups. Then G 1 G 2 G 1 {1} = G 2

30 Theorems Theorem 1.3 Let G 1 and G 2 be groups with H 1 G 1 and H 2 G 2. Then H 1 H 2 G 1 G 2. Theorem 1.4 Let G 1 and G 2 be groups with H 1 G 1. Then H 1 {1} G 1 G 2. Theorem 1.5 Let G 1 and G 2 be groups. Then G 1 G 2 G 1 {1} = G 2 This result follows directly from the First Isomorphism Theorem

31 Behavior of CLT Groups Look at the groups Z 2 A 4 and Z 2 {1}, and note that Z 2 A 4 is a CLT group. Let us define H = {1, (12)(34), (13)(24), (14)(23)}. Observe that H A 4. Below is a list of subgroups of Z 2 A 4 with their respective orders.

32 Behavior of CLT Groups Look at the groups Z 2 A 4 and Z 2 {1}, and note that Z 2 A 4 is a CLT group. Let us define H = {1, (12)(34), (13)(24), (14)(23)}. Observe that H A 4. Below is a list of subgroups of Z 2 A 4 with their respective orders. {(0, 1)} = 1 < (1, 1) > = 2 < (0, (123)) > = 3 {0} H = 4 < (1, (123)) > = 6 Z 2 H = 8 {0} A 4 = 12 Z 2 A 4 = 24

33 Behavior of CLT Groups Look at the groups Z 2 A 4 and Z 2 {1}, and note that Z 2 A 4 is a CLT group. Let us define H = {1, (12)(34), (13)(24), (14)(23)}. Observe that H A 4. Below is a list of subgroups of Z 2 A 4 with their respective orders. {(0, 1)} = 1 < (1, 1) > = 2 < (0, (123)) > = 3 {0} H = 4 < (1, (123)) > = 6 Z 2 H = 8 {0} A 4 = 12 Z 2 A 4 = 24 We can see that Z 2 A 4 is in fact a CLT group.

34 Behavior of CLT Groups We have Z 2 {1} Z 2 A 4 from Theorem 1.4.

35 Behavior of CLT Groups We have Z 2 {1} Z 2 A 4 from Theorem 1.4. Thus we can mod out Z 2 {1} and get by Theorem 1.5 Z 2 A 4 Z 2 {1} = A 4

36 Behavior of CLT Groups We have Z 2 {1} Z 2 A 4 from Theorem 1.4. Thus we can mod out Z 2 {1} and get by Theorem 1.5 Z 2 A 4 Z 2 {1} = A 4 So a quotient group of a CLT group may not be a CLT group.

37 Theorems Theorem 1.6 Let G be a group and a G an element of finite a = n. Then for any k Z, a k = 1 if and only if n k.

38 Theorems Theorem 1.6 Let G be a group and a G an element of finite a = n. Then for any k Z, a k = 1 if and only if n k. Theorem 1.7 Let G be a group and a G an element of finite order a = n. Then < a >= {1, a, a 2,..., a n 1 }, also < a > = a.

39 Cyclic Groups are CLT Theorem Let G be a cyclic group such that G = n. Then G is a CLT group.

40 Cyclic Groups are CLT Theorem Let G be a cyclic group such that G = n. Then G is a CLT group. Proof Let d G. Since G is cyclic, there exists a G such that G =< a >. Then d G, where G = < a > = a

41 Cyclic Groups are CLT Theorem Let G be a cyclic group such that G = n. Then G is a CLT group. Proof Let d G. Since G is cyclic, there exists a G such that G =< a >. Then d G, where G = < a > = a Then there exists k Z such that dk = a. Let H =< a k >. Then H G. By Theorem 1.7 H = < a k > = a k

42 Proof Continued Now (a k ) d = a kd = a a = 1

43 Proof Continued Now (a k ) d = a kd = a a = 1 Therefore, a k d, by the minimality of a k. Also 1 = (a k ) ak = a k ak

44 Proof Continued Now (a k ) d = a kd = a a = 1 Therefore, a k d, by the minimality of a k. Also 1 = (a k ) ak = a k ak By Theorem 1.6 a k a k or dk k a k, thus d a k, so d a k. Hence, d = a k. Therefore, we have H = < a k > = a k = d

45 Proof Continued Now (a k ) d = a kd = a a = 1 Therefore, a k d, by the minimality of a k. Also 1 = (a k ) ak = a k ak By Theorem 1.6 a k a k or dk k a k, thus d a k, so d a k. Hence, d = a k. Therefore, we have Thus G is a CLT group. H = < a k > = a k = d

46 Abelian Groups are CLT Theorem Let G be a group such that G is Abelian. Then G is a CLT group.

47 p-groups Below we define a p-group:

48 p-groups Below we define a p-group: Let G be a group and p be a prime. Then G is a p-group if there exists n Z + {0} such that G = p n.

49 p-groups Below we define a p-group: Let G be a group and p be a prime. Then G is a p-group if there exists n Z + {0} such that G = p n. Example D 4 is a 2-group since D 4 = 8 = 2 3.

50 Theorems Theorem 1.8 Let G be a p-group such that G {1}. Then Z(G) {1}.

51 Theorems Theorem 1.8 Let G be a p-group such that G {1}. Then Z(G) {1}. Theorem 1.9 (Cauchy s theorem for Abelian groups) Let G be a finite Abelian group and p be a prime dividing the order of G. Then G has an element of order p.

52 Theorems Theorem 1.8 Let G be a p-group such that G {1}. Then Z(G) {1}. Theorem 1.9 (Cauchy s theorem for Abelian groups) Let G be a finite Abelian group and p be a prime dividing the order of G. Then G has an element of order p. Theorem 1.10 Let φ : G G be a homomorphism. Then if K is a subgroup of G, then φ 1 (K) = {x G φ(x) K} is a subgroup of G.

53 Theorems Theorem 1.8 Let G be a p-group such that G {1}. Then Z(G) {1}. Theorem 1.9 (Cauchy s theorem for Abelian groups) Let G be a finite Abelian group and p be a prime dividing the order of G. Then G has an element of order p. Theorem 1.10 Let φ : G G be a homomorphism. Then if K is a subgroup of G, then φ 1 (K) = {x G φ(x) K} is a subgroup of G. Natural Map Theorem Let G be a group, g G, and N G. Define φ : G G N by φ(g) = gn as the natural map. Then φ is a homomorphism and kernφ = N.

54 p-groups are CLT Theorem Let G be a p-group. Then G is a CLT group.

55 p-groups are CLT Theorem Let G be a p-group. Then G is a CLT group. Proof (Induction on G ) Suppose G = p. Then G is a CLT group since G G and {1} G.

56 p-groups are CLT Theorem Let G be a p-group. Then G is a CLT group. Proof (Induction on G ) Suppose G = p. Then G is a CLT group since G G and {1} G. Suppose this holds true for all p-groups of order less than G.

57 p-groups are CLT Theorem Let G be a p-group. Then G is a CLT group. Proof (Induction on G ) Suppose G = p. Then G is a CLT group since G G and {1} G. Suppose this holds true for all p-groups of order less than G. Let G = p n and d G. Then d = p α where 0 α n. If α = 0, then d = 1 and {1} = 1. If α = n then d = p n and G = p n. So without loss of generality assume 0 < α < n.

58 Proof Continued Now since G is a p-group, Z(G) 1 by Theorem 1.7. Let 1 z where z is in Z(G) such that z p = 1 by Theorem 1.9. Then < z > G, so G/ < z > is a p-group since G is a p-group. Now G < z > = G < z > < G Thus G/ < z > is a CLT group, by induction.

59 Proof Continued Now since G is a p-group, Z(G) 1 by Theorem 1.7. Let 1 z where z is in Z(G) such that z p = 1 by Theorem 1.9. Then < z > G, so G/ < z > is a p-group since G is a p-group. Now G < z > = G < z > < G Thus G/ < z > is a CLT group, by induction. Now G < z > = G < z > = pn p = p n 1

60 Proof Continued Also note that 0 α 1 < n 1, so p α 1 p n 1, where p n 1 G G =. Since is a CLT group, there exists <z> <z> H G such that H = <z> pα 1.

61 Proof Continued Also note that 0 α 1 < n 1, so p α 1 p n 1, where p n 1 G G =. Since is a CLT group, there exists <z> <z> H G such that H = <z> pα 1. Now let φ : G G be defined by φ(g) = g < z >, which is <z> a homomorphism by the Natural Map Theorem.

62 Proof Continued Also note that 0 α 1 < n 1, so p α 1 p n 1, where p n 1 G G =. Since is a CLT group, there exists <z> <z> H G such that H = <z> pα 1. Now let φ : G G be defined by φ(g) = g < z >, which is <z> a homomorphism by the Natural Map Theorem. Now < z > φ 1 (H) G by Theorem Thus < z > φ 1 (H) so φ 1 (H) is a group <z>

63 Proof Continued Also note that 0 α 1 < n 1, so p α 1 p n 1, where p n 1 G G =. Since is a CLT group, there exists <z> <z> H G such that H = <z> pα 1. Now let φ : G G be defined by φ(g) = g < z >, which is <z> a homomorphism by the Natural Map Theorem. Now < z > φ 1 (H) G by Theorem Thus < z > φ 1 (H) so φ 1 (H) is a group <z> φ 1 (H) < z > = {g < z > g φ 1 (H)} = {g < z > φ(g) H)} = {g < z > g < z > H} = H

64 Proof Continued Then φ 1 (H) = φ 1 (H) < z > < z > = H < z > = p α 1 p = p α = d

65 Proof Continued Then φ 1 (H) = φ 1 (H) < z > < z > = H < z > = p α 1 p = p α = d Thus there exists a subgroup of order d, so G is a CLT group.

66 How common are CLT groups? We can define what is known as a CLT number:

67 How common are CLT groups? We can define what is known as a CLT number: A number, n, is a CLT number if every group G such that G = n is a CLT group.

68 How common are CLT groups? We can define what is known as a CLT number: A number, n, is a CLT number if every group G such that G = n is a CLT group.

69 References 1 Papantonopoulou, A. (2002). Algebra Pure and Applied. Upper Saddle River, NJ: Pearson Prentice Hall. Special thanks to Dr. Neil Flowers for excellent Advisement!

Kevin James. p-groups, Nilpotent groups and Solvable groups

p-groups, Nilpotent groups and Solvable groups Definition A maximal subgroup of a group G is a proper subgroup M G such that there are no subgroups H with M < H < G. Definition A maximal subgroup of a

MA441: Algebraic Structures I. Lecture 26

MA441: Algebraic Structures I Lecture 26 10 December 2003 1 (page 179) Example 13: A 4 has no subgroup of order 6. BWOC, suppose H < A 4 has order 6. Then H A 4, since it has index 2. Thus A 4 /H has order

Section III.15. Factor-Group Computations and Simple Groups

III.15 Factor-Group Computations 1 Section III.15. Factor-Group Computations and Simple Groups Note. In this section, we try to extract information about a group G by considering properties of the factor

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

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 =

Algebraic Structures II

MAS 305 Algebraic Structures II Notes 9 Autumn 2006 Composition series soluble groups Definition A normal subgroup N of a group G is called a maximal normal subgroup of G if (a) N G; (b) whenever N M G

Math 581 Problem Set 8 Solutions

Math 581 Problem Set 8 Solutions 1. Prove that a group G is abelian if and only if the function ϕ : G G given by ϕ(g) g 1 is a homomorphism of groups. In this case show that ϕ is an isomorphism. Proof:

Fundamental Theorem of Finite Abelian Groups

Monica Agana Boise State University September 1, 2015 Theorem (Fundamental Theorem of Finite Abelian Groups) Every finite Abelian group is a direct product of cyclic groups of prime-power order. The number

φ(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 =

Lagrange s Theorem. Philippe B. Laval. Current Semester KSU. Philippe B. Laval (KSU) Lagrange s Theorem Current Semester 1 / 10

Lagrange s Theorem Philippe B. Laval KSU Current Semester Philippe B. Laval (KSU) Lagrange s Theorem Current Semester 1 / 10 Introduction In this chapter, we develop new tools which will allow us to extend

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of

A SIMPLE PROOF OF BURNSIDE S CRITERION FOR ALL GROUPS OF ORDER n TO BE CYCLIC

A SIMPLE PROOF OF BURNSIDE S CRITERION FOR ALL GROUPS OF ORDER n TO BE CYCLIC SIDDHI PATHAK Abstract. This note gives a simple proof of a famous theorem of Burnside, namely, all groups of order n are cyclic

Lecture 20 FUNDAMENTAL Theorem of Finitely Generated Abelian Groups (FTFGAG)

Lecture 20 FUNDAMENTAL Theorem of Finitely Generated Abelian Groups (FTFGAG) Warm up: 1. Let n 1500. Find all sequences n 1 n 2... n s 2 satisfying n i 1 and n 1 n s n (where s can vary from sequence to

Section 15 Factor-group computation and simple groups

Section 15 Factor-group computation and simple groups Instructor: Yifan Yang Fall 2006 Outline Factor-group computation Simple groups The problem Problem Given a factor group G/H, find an isomorphic group

MATH 101: ALGEBRA I WORKSHEET, DAY #3. Fill in the blanks as we finish our first pass on prerequisites of group theory.

MATH 101: ALGEBRA I WORKSHEET, DAY #3 Fill in the blanks as we finish our first pass on prerequisites of group theory 1 Subgroups, cosets Let G be a group Recall that a subgroup H G is a subset that is

Finite Fields. [Parts from Chapter 16. Also applications of FTGT]

Finite Fields [Parts from Chapter 16. Also applications of FTGT] Lemma [Ch 16, 4.6] Assume F is a finite field. Then the multiplicative group F := F \ {0} is cyclic. Proof Recall from basic group theory

Math 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

MATH 28A MIDTERM 2 INSTRUCTOR: HAROLD SULTAN

NAME: MATH 28A MIDTERM 2 INSTRUCTOR: HAROLD SULTAN 1. INSTRUCTIONS (1) Timing: You have 80 minutes for this midterm. (2) Partial Credit will be awarded. Please show your work and provide full solutions,

Lecture 5.6: The Sylow theorems

Lecture 5.6: The Sylow theorems Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson) Lecture 5.6:

Section II.2. Finitely Generated Abelian Groups

II.2. Finitely Generated Abelian Groups 1 Section II.2. Finitely Generated Abelian Groups Note. In this section we prove the Fundamental Theorem of Finitely Generated Abelian Groups. Recall that every

Frank 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,...,

Chapter 5. Modular arithmetic. 5.1 The modular ring

Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence

Extra exercises for algebra

Extra exercises for algebra These are extra exercises for the course algebra. They are meant for those students who tend to have already solved all the exercises at the beginning of the exercise session

Recall: Properties of Homomorphisms

Recall: Properties of Homomorphisms Let φ : G Ḡ be a homomorphism, let g G, and let H G. Properties of elements Properties of subgroups 1. φ(e G ) = eḡ 1. φ(h) Ḡ. 2. φ(g n ) = (φ(g)) n for all n Z. 2.

Johns Hopkins University, Department of Mathematics Abstract Algebra - Spring 2009 Midterm

Johns Hopkins University, Department of Mathematics 110.401 Abstract Algebra - Spring 2009 Midterm Instructions: This exam has 8 pages. No calculators, books or notes allowed. You must answer the first

ALGEBRA I (LECTURE NOTES 2017/2018) LECTURE 9 - CYCLIC GROUPS AND EULER S FUNCTION

ALGEBRA I (LECTURE NOTES 2017/2018) LECTURE 9 - CYCLIC GROUPS AND EULER S FUNCTION PAVEL RŮŽIČKA 9.1. Congruence modulo n. Let us have a closer look at a particular example of a congruence relation on

Algebra SEP Solutions

Algebra SEP Solutions 17 July 2017 1. (January 2017 problem 1) For example: (a) G = Z/4Z, N = Z/2Z. More generally, G = Z/p n Z, N = Z/pZ, p any prime number, n 2. Also G = Z, N = nz for any n 2, since

LECTURES 11-13: CAUCHY S THEOREM AND THE SYLOW THEOREMS

LECTURES 11-13: CAUCHY S THEOREM AND THE SYLOW THEOREMS Recall Lagrange s theorem says that for any finite group G, if H G, then H divides G. In these lectures we will be interested in establishing certain

Section 11 Direct products and finitely generated abelian groups

Section 11 Direct products and finitely generated abelian groups Instructor: Yifan Yang Fall 2006 Outline Direct products Finitely generated abelian groups Cartesian product Definition The Cartesian product

School 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

Answers to Final Exam MA441: Algebraic Structures I 20 December 2003 1) Definitions (20 points) 1. Given a subgroup H G, define the quotient group G/H. (Describe the set and the group operation.) The quotient

Solutions 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

ANALYSIS OF SMALL GROUPS

ANALYSIS OF SMALL GROUPS 1. Big Enough Subgroups are Normal Proposition 1.1. Let G be a finite group, and let q be the smallest prime divisor of G. Let N G be a subgroup of index q. Then N is a normal

Homework #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

Homomorphisms. The kernel of the homomorphism ϕ:g G, denoted Ker(ϕ), is the set of elements in G that are mapped to the identity in G.

10. Homomorphisms 1 Homomorphisms Isomorphisms are important in the study of groups because, being bijections, they ensure that the domain and codomain groups are of the same order, and being operation-preserving,

Solutions 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

Groups in Cryptography. Çetin Kaya Koç Winter / 13

http://koclab.org Çetin Kaya Koç Winter 2017 1 / 13 A set S and a binary operation A group G = (S, ) if S and satisfy: Closure: If a, b S then a b S Associativity: For a, b, c S, (a b) c = a (b c) A neutral

Modern Algebra Homework 9b Chapter 9 Read Complete 9.21, 9.22, 9.23 Proofs

Modern Algebra Homework 9b Chapter 9 Read 9.1-9.3 Complete 9.21, 9.22, 9.23 Proofs Megan Bryant November 20, 2013 First Sylow Theorem If G is a group and p n is the highest power of p dividing G, then

Stab(t) = {h G h t = t} = {h G h (g s) = g s} = {h G (g 1 hg) s = s} = g{k G k s = s} g 1 = g Stab(s)g 1.

1. Group Theory II In this section we consider groups operating on sets. This is not particularly new. For example, the permutation group S n acts on the subset N n = {1, 2,...,n} of N. Also the group

EXAM 3 MAT 423 Modern Algebra I Fall c d a + c (b + d) d c ad + bc ac bd

EXAM 3 MAT 23 Modern Algebra I Fall 201 Name: Section: I All answers must include either supporting work or an explanation of your reasoning. MPORTANT: These elements are considered main part of the answer

Abstract 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

Section II.1. Free Abelian Groups

II.1. Free Abelian Groups 1 Section II.1. Free Abelian Groups Note. This section and the next, are independent of the rest of this chapter. The primary use of the results of this chapter is in the proof

On strongly flat p-groups. Min Lin May 2012 Advisor: Professor R. Keith Dennis

On strongly flat p-groups Min Lin May 2012 Advisor: Professor R. Keith Dennis Abstract In this paper, we provide a survey (both theoretical and computational) of the conditions for determining which finite

Algebraic Structures Exam File Fall 2013 Exam #1

Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write

Math 546, Exam 2 Information.

Math 546, Exam 2 Information. 10/21/09, LC 303B, 10:10-11:00. Exam 2 will be based on: Sections 3.2, 3.3, 3.4, 3.5; The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/546fa09/546.html)

Abstract Algebra FINAL EXAM May 23, Name: R. Hammack Score:

Abstract Algebra FINAL EXAM May 23, 2003 Name: R. Hammack Score: Directions: Please answer the questions in the space provided. To get full credit you must show all of your work. Use of calculators and

HOMEWORK Graduate Abstract Algebra I May 2, 2004

Math 5331 Sec 121 Spring 2004, UT Arlington HOMEWORK Graduate Abstract Algebra I May 2, 2004 The required text is Algebra, by Thomas W. Hungerford, Graduate Texts in Mathematics, Vol 73, Springer. (it

Cover Page. The handle holds various files of this Leiden University dissertation

Cover Page The handle http://hdl.handle.net/1887/54851 holds various files of this Leiden University dissertation Author: Stanojkovski, M. Title: Intense automorphisms of finite groups Issue Date: 2017-09-05

Kevin James. MTHSC 412 Section 3.4 Cyclic Groups

MTHSC 412 Section 3.4 Cyclic Groups Definition If G is a cyclic group and G =< a > then a is a generator of G. Definition If G is a cyclic group and G =< a > then a is a generator of G. Example 1 Z is

The group (Z/nZ) February 17, In these notes we figure out the structure of the unit group (Z/nZ) where n > 1 is an integer.

The group (Z/nZ) February 17, 2016 1 Introduction In these notes we figure out the structure of the unit group (Z/nZ) where n > 1 is an integer. If we factor n = p e 1 1 pe, where the p i s are distinct

GROUP ACTIONS RYAN C. SPIELER

GROUP ACTIONS RYAN C. SPIELER Abstract. In this paper, we examine group actions. Groups, the simplest objects in Algebra, are sets with a single operation. We will begin by defining them more carefully

Abstract 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

A Little Beyond: Linear Algebra

A Little Beyond: Linear Algebra Akshay Tiwary March 6, 2016 Any suggestions, questions and remarks are welcome! 1 A little extra Linear Algebra 1. Show that any set of non-zero polynomials in [x], no two

Math 581 Problem Set 7 Solutions

Math 581 Problem Set 7 Solutions 1. Let f(x) Q[x] be a polynomial. A ring isomorphism φ : R R is called an automorphism. (a) Let φ : C C be a ring homomorphism so that φ(a) = a for all a Q. Prove that

Algebra I: Final 2018 June 20, 2018

1 Algebra I: Final 2018 June 20, 2018 ID#: Quote the following when necessary. A. Subgroup H of a group G: Name: 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

MATH 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

Cosets, factor groups, direct products, homomorphisms, isomorphisms

Cosets, factor groups, direct products, homomorphisms, isomorphisms Sergei Silvestrov Spring term 2011, Lecture 11 Contents of the lecture Cosets and the theorem of Lagrange. Direct products and finitely

S11MTH 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

SF2729 GROUPS AND RINGS LECTURE NOTES

SF2729 GROUPS AND RINGS LECTURE NOTES 2011-03-01 MATS BOIJ 6. THE SIXTH LECTURE - GROUP ACTIONS In the sixth lecture we study what happens when groups acts on sets. 1 Recall that we have already when looking

Cosets and Normal Subgroups

Cosets and Normal Subgroups (Last Updated: November 3, 2017) These notes are derived primarily from Abstract Algebra, Theory and Applications by Thomas Judson (16ed). Most of this material is drawn from

Finite groups determined by an inequality of the orders of their elements

Publ. Math. Debrecen 80/3-4 (2012), 457 463 DOI: 10.5486/PMD.2012.5168 Finite groups determined by an inequality of the orders of their elements By MARIUS TĂRNĂUCEANU (Iaşi) Abstract. In this note we introduce

Math 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

FROM GROUPS TO GALOIS Amin Witno

WON Series in Discrete Mathematics and Modern Algebra Volume 6 FROM GROUPS TO GALOIS Amin Witno These notes 1 have been prepared for the students at Philadelphia University (Jordan) who are taking the

How many units can a commutative ring have?

How many units can a commutative ring have? Sunil K. Chebolu and Keir Locridge Abstract. László Fuchs posed the following problem in 960, which remains open: classify the abelian groups occurring as the

On the characterization of the numbers n such that any group of order n has a given property P

On the characterization of the numbers n such that any group of order n has a given property P arxiv:1501.03170v1 [math.gr] 6 Jan 2015 Advisor: Professor Thomas Haines Honors Thesis in Mathematics University

MATH 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.

Math 210A: Algebra, Homework 5

Math 210A: Algebra, Homework 5 Ian Coley November 5, 2013 Problem 1. Prove that two elements σ and τ in S n are conjugate if and only if type σ = type τ. Suppose first that σ and τ are cycles. Suppose

ENTRY GROUP THEORY. [ENTRY GROUP THEORY] Authors: started Mark Lezama: October 2003 Literature: Algebra by Michael Artin, Mathworld.

ENTRY GROUP THEORY [ENTRY GROUP THEORY] Authors: started Mark Lezama: October 2003 Literature: Algebra by Michael Artin, Mathworld Group theory [Group theory] is studies algebraic objects called groups.

MATH 420 FINAL EXAM J. Beachy, 5/7/97

MATH 420 FINAL EXAM J. Beachy, 5/7/97 1. (a) For positive integers a and b, define gcd(a, b). (b) Compute gcd(1776, 1492). (c) Show that if a, b, c are positive integers, then gcd(a, bc) = 1 if and only

Group 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

(1) Let G be a finite group and let P be a normal p-subgroup of G. Show that P is contained in every Sylow p-subgroup of G.

(1) Let G be a finite group and let P be a normal p-subgroup of G. Show that P is contained in every Sylow p-subgroup of G. (2) Determine all groups of order 21 up to isomorphism. (3) Let P be s Sylow

Groups 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,*)

ABSTRACT ALGEBRA MODULUS SPRING 2006 by Jutta Hausen, University of Houston

ABSTRACT ALGEBRA MODULUS SPRING 2006 by Jutta Hausen, University of Houston Undergraduate abstract algebra is usually focused on three topics: Group Theory, Ring Theory, and Field Theory. Of the myriad

INVERSE LIMITS AND PROFINITE GROUPS

INVERSE LIMITS AND PROFINITE GROUPS BRIAN OSSERMAN We discuss the inverse limit construction, and consider the special case of inverse limits of finite groups, which should best be considered as topological

S11MTH 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

23.1. Proof of the fundamental theorem of homomorphisms (FTH). We start by recalling the statement of FTH introduced last time.

23. Quotient groups II 23.1. Proof of the fundamental theorem of homomorphisms (FTH). We start by recalling the statement of FTH introduced last time. Theorem (FTH). Let G, Q be groups and ϕ : G Q a homomorphism.

CLASSIFICATION OF GROUPS OF ORDER 60 Alfonso Gracia Saz

CLASSIFICATION OF GROUPS OF ORDER 60 Alfonso Gracia Saz Remark: This is a long problem, and there are many ways to attack various of the steps. I am not claiming this is the best way to proceed, nor the

On the nilpotent conjugacy class graph of groups

Note di Matematica ISSN 1123-2536, e-issn 1590-0932 Note Mat. 37 (2017) no. 2, 77 89. doi:10.1285/i15900932v37n2p77 On the nilpotent conjugacy class graph of groups A. Mohammadian Department of Pure Mathematics,

First online - August 26, Draft version - August 26, 2016

Novi Sad J. Math. Vol. XX, No. Y, 20ZZ,??-?? A CLASS OF SOME THIRD-METACYCLIC 2-GROUPS Marijana Greblički 1 Abstract. Third-metacyclic finite 2-groups are groups with a nonmetacyclic second-maximal subgroup

Supplementary Notes: Simple Groups and Composition Series

18.704 Supplementary Notes: Simple Groups and Composition Series Genevieve Hanlon and Rachel Lee February 23-25, 2005 Simple Groups Definition: A simple group is a group with no proper normal subgroup.

Connectivity of Intersection Graphs of Finite Groups

Connectivity of Intersection Graphs of Finite Groups Selçuk Kayacan arxiv:1512.00361v2 [math.gr] 2 Aug 2016 Department of Mathematics, Istanbul Technical University, 34469 Maslak, Istanbul, Turkey. e-mail:

Solutions 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

Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition).

Selected exercises from Abstract Algebra by Dummit Foote (3rd edition). Bryan Félix Abril 12, 2017 Section 4.1 Exercise 1. Let G act on the set A. Prove that if a, b A b = ga for some g G, then G b = gg

Written Homework # 2 Solution

Math 516 Fall 2006 Radford Written Homework # 2 Solution 10/09/06 Let G be a non-empty set with binary operation. For non-empty subsets S, T G we define the product of the sets S and T by If S = {s} is

Exercises 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

23.1. Proof of the fundamental theorem of homomorphisms (FTH). We start by recalling the statement of FTH introduced last time.

23. Quotient groups II 23.1. Proof of the fundamental theorem of homomorphisms (FTH). We start by recalling the statement of FTH introduced last time. Theorem (FTH). Let G, H be groups and ϕ : G H a homomorphism.

Section VI.33. Finite Fields

VI.33 Finite Fields 1 Section VI.33. Finite Fields Note. In this section, finite fields are completely classified. For every prime p and n N, there is exactly one (up to isomorphism) field of order p n,

Group Theory. 1. Show that Φ maps a conjugacy class of G into a conjugacy class of G.

Group Theory Jan 2012 #6 Prove that if G is a nonabelian group, then G/Z(G) is not cyclic. Aug 2011 #9 (Jan 2010 #5) Prove that any group of order p 2 is an abelian group. Jan 2012 #7 G is nonabelian nite

MATH 3030, Abstract Algebra Winter 2012 Toby Kenney Sample Midterm Examination Model Solutions

MATH 3030, Abstract Algebra Winter 2012 Toby Kenney Sample Midterm Examination Model Solutions Basic Questions 1. Give an example of a prime ideal which is not maximal. In the ring Z Z, the ideal {(0,

Solutions of exercise sheet 8

D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 8 1. In this exercise, we will give a characterization for solvable groups using commutator subgroups. See last semester s (Algebra

Homework #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

NOTES ON FINITE FIELDS

NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining

CHAPTER III NORMAL SERIES

CHAPTER III NORMAL SERIES 1. Normal Series A group is called simple if it has no nontrivial, proper, normal subgroups. The only abelian simple groups are cyclic groups of prime order, but some authors

7 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;

CONSEQUENCES OF THE SYLOW THEOREMS

CONSEQUENCES OF THE SYLOW THEOREMS KEITH CONRAD For a group theorist, Sylow s Theorem is such a basic tool, and so fundamental, that it is used almost without thinking, like breathing. Geoff Robinson 1.

arxiv: v3 [math.co] 4 Apr 2011

Also available on http://amc.imfm.si ARS MATHEMATICA CONTEMPORANEA x xxxx) 1 x Hamiltonian cycles in Cayley graphs whose order has few prime factors arxiv:1009.5795v3 [math.co] 4 Apr 2011 K. Kutnar University

Mathematics 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

FINITE ABELIAN GROUPS Amin Witno

WON Series in Discrete Mathematics and Modern Algebra Volume 7 FINITE ABELIAN GROUPS Amin Witno Abstract We detail the proof of the fundamental theorem of finite abelian groups, which states that every