Math 210A: Algebra, Homework 5

Similar documents
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 210A: Algebra, Homework 6

Teddy Einstein Math 4320

School of Mathematics and Statistics. MT5824 Topics in Groups. Problem Sheet I: Revision and Re-Activation

Algebra SEP Solutions

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

Groups and Symmetries

120A LECTURE OUTLINES

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

PROBLEMS FROM GROUP THEORY

Two subgroups and semi-direct products

Solutions to Assignment 4

Group Theory

Group Theory (Math 113), Summer 2014

Exercises on chapter 1

Algebra Exercises in group theory

Homework #5 Solutions

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

Math 210B: Algebra, Homework 4

its image and kernel. A subgroup of a group G is a non-empty subset K of G such that k 1 k 1

ALGEBRA QUALIFYING EXAM PROBLEMS

Fall /29/18 Time Limit: 75 Minutes

MAT534 Fall 2013 Practice Midterm I The actual midterm will consist of five problems.

1 Chapter 6 - Exercise 1.8.cf

CSIR - Algebra Problems

Lecture 7 Cyclic groups and subgroups

Math 581 Problem Set 8 Solutions

MA441: Algebraic Structures I. Lecture 26

Math 121 Homework 5: Notes on Selected Problems

CONSEQUENCES OF THE SYLOW THEOREMS

DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3. Contents

Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3

Simple groups and the classification of finite groups

Algebra-I, Fall Solutions to Midterm #1

Homework #11 Solutions

MATH 1530 ABSTRACT ALGEBRA Selected solutions to problems. a + b = a + b,

ANALYSIS OF SMALL GROUPS

MODEL ANSWERS TO HWK #4. ϕ(ab) = [ab] = [a][b]

Algebra Qualifying Exam Solutions. Thomas Goller

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

Math 3140 Fall 2012 Assignment #3

Theorems and Definitions in Group Theory

1.5 Applications Of The Sylow Theorems

Yale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall Midterm Exam Review Solutions

MODEL ANSWERS TO THE FIFTH HOMEWORK

Elements of solution for Homework 5

Quiz 2 Practice Problems

Maximal non-commuting subsets of groups

HOMEWORK 3 LOUIS-PHILIPPE THIBAULT

HOMEWORK Graduate Abstract Algebra I May 2, 2004

ABSTRACT ALGEBRA 1, LECTURES NOTES 5: SUBGROUPS, CONJUGACY, NORMALITY, QUOTIENT GROUPS, AND EXTENSIONS.

Math 451, 01, Exam #2 Answer Key

Math 581 Problem Set 9

MATH 28A MIDTERM 2 INSTRUCTOR: HAROLD SULTAN

Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson

Name: Solutions Final Exam

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

Math 430 Final Exam, Fall 2008

Solutions of exercise sheet 4

Frank Moore Algebra 901 Notes Professor: Tom Marley Direct Products of Groups:

Algebra Ph.D. Entrance Exam Fall 2009 September 3, 2009

1. Group Theory Permutations.

INTRODUCTION TO THE GROUP THEORY

ALGEBRA HOMEWORK SET 2. Due by class time on Wednesday 14 September. Homework must be typeset and submitted by as a PDF file.

Section 15 Factor-group computation and simple groups

CONJUGATION IN A GROUP

Section 10: Counting the Elements of a Finite Group

Math 250A, Fall 2004 Problems due October 5, 2004 The problems this week were from Lang s Algebra, Chapter I.

x 2 = xn xn = x 2 N = N = 0

φ(xy) = (xy) n = x n y n = φ(x)φ(y)

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

Abstract Algebra II Groups ( )

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

Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.

Cosets and Normal Subgroups

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

Introduction to Groups

Exercises MAT2200 spring 2013 Ark 4 Homomorphisms and factor groups

Basic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed.

IIT Mumbai 2015 MA 419, Basic Algebra Tutorial Sheet-1

Ph.D. Qualifying Examination in Algebra Department of Mathematics University of Louisville January 2018

3. G. Groups, as men, will be known by their actions. - Guillermo Moreno

MATH 323, Algebra 1. Archive of documentation for. Bilkent University, Fall 2014, Laurence Barker. version: 17 January 2015

Math 120. Groups and Rings Midterm Exam (November 8, 2017) 2 Hours

Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems

Higher Algebra Lecture Notes

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.

ABSTRACT ALGEBRA: REVIEW PROBLEMS ON GROUPS AND GALOIS THEORY

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

BASIC GROUP THEORY : G G G,

Selected Solutions to Math 4107, Set 4

Homework Problems, Math 200, Fall 2011 (Robert Boltje)

The Outer Automorphism of S 6

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

Before you begin read these instructions carefully.

Math 602, Fall 2002, HW 2, due 10/14/2002

Algebra Exam Fall Alexander J. Wertheim Last Updated: October 26, Groups Problem Problem Problem 3...

1 Finite abelian groups

Permutation groups H. W. Lenstra, Fall streng/permutation/index.html

Algebra I Notes. Clayton J. Lungstrum. July 18, Based on the textbook Algebra by Serge Lang

Transcription:

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 further that σ and τ are conjugate so that σ = ρτρ 1. By earlier considerations, if τ = (a 1... a m ), where a i {1,..., n}, then σ = ρτρ 1 = (ρ(a 1 )... ρ(a m )). Hence σ and τ have the same number of symbols in their cycle, so type σ = type τ. Conversely, if type σ = type τ, then write σ = (a 1... a m ) and τ = (b 1... b m ). Define ρ S n so that ρ(a i ) = b i for each i {1,..., m}. Such a ρ is guaranteed to exist since we do not have ρ(a i ) = ρ(a j ) for any i j as b i b j for any i j. BY the above, ρσρ 1 = (ρ(a 1 )... ρ(a m )) = τ, so these cycles are conjugate. Now suppose that σ and τ are two permutations. Then we may write σ = σ 1 σ l, τ = τ 1 τ m where σ i, τ j are disjoint cycles. Then if σ = ρτρ 1, we have σi = ρ ( τj ) ρ 1 = ρτ j ρ 1. By the above reasoning, we must have type σ i = type τ j for some reordering of the cycles, so that σ and τ have the same type. Conversely, if type σ = type τ, then we have l = m and type σ i = type τ i for an appropriate rearrangement. Therefore For each there exists ρ i such that σ i = ρ i τ i ρ 1 i. Since the τ i are disjoint, the ρ i may be chosen disjoint so that ρ i ρ j = ρ j ρ i and ρ j τ i ρ 1 j = τ i for i j. Let ρ = ρ i. Then ρτρ 1 = ρτ j ρ 1 = ρ j τ j ρ 1 j = σ j = σ. Therefore the cycles are conjugate, so we are done. Problem 2. Prove that S 4 acts by conjugation on the set of nontrivial elements of the normal subgroup N = {e, (1 2)(3 4), (1 3)(2 4), (1 4)(2 3)}. Using this action prove that S 4 /N = S 3. 1

It is clear that N is a subgroup of S 4 and, since it is comprised of full conjugacy classes, it is normal. Therefore the action of S 4 on N is well-defined. Further, since conjugation preserves cycle type (see problem 1), the conjugate of any 2-2-cycle is also a 2-2-cycle, so S 4 acts in particular on the nontrivial elements of N, which are the only 2-2-cycles. Therefore there is a homomorphism ϕ from S 4 to S(X) = = S 3, where X = N \ {e}. First, we calculate the kernel of ϕ. We claim that it is N. Since N is an abelian subgroup, we have στσ = τ for every στ N. Therefore we have N ker ϕ. Further, ϕ is not trivial since S 4 itself is not abelian, so ker ϕ S 4. By previous considerations A 4 and N are the only proper normal subgroups of S 4. Suppose that ker ϕ = A 4. Then conjugation by (1 2 3) would be trivial for every element of N. However, (1 2 3)(1 2)(3 4)(3 2 1) = (1 4)(2 3). Therefore ker ϕ A 4, so we must have ker ϕ = N. Then since S 4 /N = 24/4 = 6 = S 3, we must have im ϕ = S 3. By the first isomorphism theorem, S 4 /N = S 3, and we are done. Problem 3. Let σ = (1 2 n) S n. Show that the conjugacy class of σ has (n 1)! elements. Show that the centraliser of σ is the cyclic subgroup generated by σ. As in problem 1, all n-cycles are conjugate in S n. An n-cycle is uniquely determined by ordering the symbols 1,..., n up to rearrangement. There are n! orderings of the symbols and n rearrangements for each n-cycle, so in total there are (n 1)! n-cycles. Therefore the conjugacy class of σ has (n 1)! elements. We now use the orbit-stabiliser theorem. Let G = S n. Let Gσ be the orbit of σ and G σ its stabiliser. Then Gσ = G : G σ = (n 1)! = n!/ G σ = G σ = n. Since the stabiliser under conjugation is the centraliser, we know the centraliser of σ has n elements. Since σ commutes with itself, we have σ G σ. But since σ = n, we must have σ = G σ, so we are done. Problem 4. Let H be a proper subgroup of a finite group G. Suppose that G does not divide G : H!. Then G contains a nontrivial normal subgroup N such that N is a subgroup of H. In particular, G is not simple. Let G act on the cosets G/H by left translation. This induces a homomorphism ϕ : G S(G/H). If ϕ were injective, then im ϕ = G would be a subgroup of S(G/H). By Cayley s theorem, we would have G G : H!, which is false by assumption. Hence ϕ is not an injection, so ker ϕ is a nontrivial normal subgroup of G. Further, if g ker ϕ, we have gh = H, hence g H. Therefore ker ϕ is a normal subgroup of G contained in H. This completes the proof. 2

Problem 5. Prove that all groups of order 2p n and 4p n are not simple. If p is an odd prime, then there exists a Sylow p-subgroup P of order p n. Then if G = 2p n, then G : P = 2, so P is normal, hence the group is not simple. Now let G = 4p n and suppose P is not normal in G. Then there exists another Sylow p-subgroup Q such that P Q. Let H = P Q. Then we have 4p n P Q = P Q H = p2n H. Therefore H p n /4 > p n 2. Further, H is a p-group and H < p n so we must have H = p n 1. Therefore since P : H = Q : H = p is the smallest prime dividing p n, we must have H P and H Q. Hence P Q N G (H), the normaliser of H. But as above we have calculated P Q = p2n p n 1 = pn+1 > 2p n = P Q = 4p n. Therefore N G (H) = G, so H G. Therefore G is not simple. If p = 2, then groups of order 2p n and 4p n are 2-groups. By previous considerations, p-groups have nontrivial centres. Therefore groups of order 2p n and 4p n are not simple. This completes the proof. Problem 6. (a) Let N G be a subgroup. Prove that if H is contained in the centre of G and G/N is cyclic, then G is abelian. (b) Prove that any group of order p 2 is abelian. We follow the solution for Problem 5 on Homework 2. (a) We use the definition N G if and only if xnx 1 N for all x G. Let g N. Then xgx 1 = xx 1 g = g, since g Z(G), and hence xgx 1 N for all x G, g N. Hence N is normal. We claim that if G/N is cyclic that G is abelian. Write G/N = xn. Now let a, b G such that a (xz(g)) m = x m Z(G) and b x n Z(G). Then a = x m g 1 and b = x n g 2 for g 1, g 2 N. Then ab = (x m g 1 )(x n g 2 ) = x m (g 1 x n )g 2 = x m (x n g 1 )g 2 = (x m x n )(g 1 g 2 ) = (x n x m )(g 2 g 1 ) = x n (x m g 2 )(g 1 ) = x n (g 2 x m )g 1 = (x n g 2 )(x m g 1 ) = ba. We use the fact that g 1, g 2 Z(G) and that x commutes with itself freely. This shows that G is abelian. 3

(b) Let G act on itself by conjugation. Then by the class equation p 2 = G = Z(G) + G : N G (g). nontrivial conjugacy classes By Lagrange s theorem, G : N G (g) = G / N G (g) and since these conjugacy classes are proper and nontrivial, p G : N G (g). Since p p 2, we must have p Z(G), so Z(G) is nontrivial. If Z(G) = p 2, we are done. Suppose Z(G) = p. By 5(a), Z(G) is normal so we may examine the factor group G/Z(G). Since G/Z(G) = G / Z(G) = p, by earlier considerations G/Z(G) must be the cyclic group of order p, which implies that G is abelian, contradicting Z(G) = p. Therefore Z(G) = G and we are done. Problem 7. Let G be a nonabelian group of order p 3. Prove that the centre of G coincides with [G, G]. By earlier considerations, p-groups have nontrivial centres. Therefore Z(G) has order p or p 2 (since it is nonabelian). Suppose that Z(G) has order p 2. Then G/Z(G) = Z/pZ is cyclic, so by an earlier problem, G is abelian, which is a contradiction. Therefore we must have Z(G) = p. As such, G/Z(G) = p 2, and by the preceding problem, G/Z(G) is abelian. Since [G, G] has the property that it is the smallest subgroup N such that G/N is abelian, we must have [G, G] Z(G). But since Z(G) = p and [G, G] p (since G is nonabelian), we must have [G, G] = Z(G). This completes the proof. Problem 8. Let G be a semidirect product of a cyclic normal subgroup N of order n and an abelian group K. Show that if K is relatively prime to ϕ(n), then G is abelian. The semidirect product G = N K is given by a homomorphism ϕ : K Aut N such that nk n k = n ϕ k (n )kk where ϕ(k) = ϕ k Aut N. By earlier considerations, we know that Aut N = Aut Z/nZ = (Z/nZ). Further, (Z/nZ) = ϕ(n). By Cayley s theorem, im ϕ divides ϕ(n), and further im ϕ divides K. Therefore im ϕ divides gcd( K, ϕ(n)) = 1, so ϕ must be the trivial homomorphism. Therefore we have nk n k = nn kk for every n N, k K. Therefore N and K commute with each other, and since N and K are abelian, the whole group is abelian. This completes the proof. Problem 9. Determine the centre of D 2n. 4

First, the case of n = 1 is trivial since D 2 = Z/2Z. in the case that n = 2, we have D 4 = Z/2Z Z/2Z, so the group itself is abelian. Now let D 2n = r, s : r n = s 2 = 1, rs = sr 1. Let σ Z = Z(D 2n ). Suppose that σ = r m. Then r m sr k = r m k s? = r (m+k) s = sr m+k = sr k r m. This is only true if (k + m) m k (mod n) for all k, i.e. m m (mod n), which would mean m = n/2 (which only exists for even n). It is also clear that r m r k = r k r m for any k. Thus r m commutes with every element if m = n/2. Now suppose σ = s. Then s r r s in the case that n > 2. Hence s / Z. Finally, suppose that σ = sr m. Then sr m sr k = r m k? = r k m = sr k sr m. This is only true if m k k m (mod n) for all k, i.e. 2k = 2m (mod n) for all k, which is impossible if n > 2. Therefore no element of this form exists. Therefore we summarise the result: D 2n n = 1, 2 Z(D 2n ) = {e} n > 2, even {e, r n/2 } n > 2, odd Problem 10. Show that the exact sequence is not split. 0 Z Q Q/Z 0 Let i : Z Q and π : Q Q/Z be the injective and surjective maps in the exact sequence. We claim that Q = Q/Z Z as groups, so the sequence is not split. If the sequence is split, the isomorphism ϕ : Q Q/Z Z must be given by p/q (p /q, n) where 0 p /q < 1 and n + p /q = p/q so that i(n) = (0, n) and π(p/q) = p /q. Every element q Q has infinite order, so Q is torsion-free. However, every element of Q/Z is torsion, since an arbitrary element p/q has order q. In particular, let 1/n Q. Then (0, 1) = ϕ(1) = ϕ(n (1/n)) = n ϕ(1/n) = n (1/n, 0) = (0, 0), but this is absurd. Therefore such a ϕ cannot exist, so the sequence is not split. 5