Nicholas G. Vlamis
mathematician | nvlamis@gc.cuny.edu

Homework 5
MATH 301/601
Test #5 is on Wednesday, April 23
 


Instructions. Read the Homework Guide to make sure you understand how to successfully complete the assignment. Click here for a pdf version of the homework.


Exercise 1.

Let G be a group. Define the relation on G as follows: ab if and only if b is conjugate to a (that is, there exists gG such that b=gag1). Prove that is an equivalence relation.


Exercise 2.

Prove that the 3-cycles (1 2 3) and (1 3 2) are not conjugate in A4.


Exercise 3.

In http://abstract.ups.edu/aata/cosets-exercises.html of the textbook, complete Exercises 1, 2, 3, 4, 5(a)-(f), and 6.


*Exercise 4.

Let H be a subgroup of a group G and let g1,g2G.

  1. (a)

    Prove that if g1H=g2H, then g21g1H.

  2. (b)

    Prove that if g1Hg2H, then g1H=g2H.


*Exercise 5.

Let H be a subgroup of G. Prove that if ghg1H for all gG and for all hH, then aH=Ha for all aG.


Exercise 6.

Let G be a group and H a subgroup of G. Suppose that [G:H]=2. Prove that if a,bG are not in H, then abH.


*Exercise 7.

Let G be a group and let H be a subgroup of G. Prove that if [G:H]=2, then aH=Ha for all aG.


*Exercise 8.

Let n. Use Fermat’s Little Theorem to show that if p=4n+3 is prime, then there is no solution to the equation x21(modp).


Exercise 9.

Let p be prime. How many subgroups does 2p have? Prove it.


Exercise 10.

Let φ:GH be an isomorphism of groups.

  1. (a)

    Prove that φ(eG)=eH. (Hint: usse the fact that eGeG=eG.)

  2. (b)

    Prove that φ(g)1=φ(g1) for all gG.

  3. (c)

    Prove that φ(gn)=φ(g)n for all gG and for all n.

  4. (d)

    Prove that φ1:HG is an isomorphism.


*Exercise 11.

Prove that × is isomorphic to the subgroup of GL(2,) consisting of matrices of the form [abba].


Exercise 12.

Prove that S4 is not isomorphic to D4.


Definition 1.

An automorphism of a group G is an isomorphism GG.


*Exercise 13.

Let G be a finite abelian group of order n. Suppose m is relatively prime to n. Prove that φ:GG given by φ(g)=gm is an automorphism of G. (This says that every element of G has an mth-root.)


Exercise 14.

Let G be a group. Prove that the set of automorphisms of G, denoted Aut(G), is a group with respect to function composition (this group is called the automorphism group of G.).


*Exercise 15.
  1. (a)

    Let G be a cyclic group, and let φ,ψAut(G). Prove that if aG is a generator of G and φ(a)=ψ(a), then φ=ψ.

  2. (b)

    Use part (a) to compute Aut().


**Exercise 16.

Use part (a) of the previous exercise, together with Exercise 13, to show that Aut(n) is isomorphic to U(n).


 

Double-star problem set up111See Section 14.1

Definition 2.

Let G be a group, and let X be a set. A group action of G on X is a function ϕ:G×XX satisfying:

  1. (i)

    ϕ(e,x)=x for all xX, and

  2. (ii)

    ϕ(gh,x)=ϕ(g,ϕ(h,x)) for all g,hG and for all xX.

Usually the group action is clear from context and we simply write gx or g.x instead of ϕ(g,x). In this notation, (i) says e.x=x for all xX, and (ii) says (gh).x=g.(h.x). Again suppressing the function ϕ, we generally write GX to denote the fact that the group G is acting on the set X.

In the “real world”, we generally think about a group by the way it acts on some set. For example, we think about the dihedral groups via their action on regular polygons, and we think of matrix groups via their action on vector spaces.

Definition 3.

Let GX. Given xX, the orbit of x, denoted 𝒪x, is the subset of X given by

𝒪x={g.x:gG}

and the stabilizer of x, denoted StabG(x) is the subgroup222You should convince yourself that this is indeed a subgroup. of G given by

StabG(x)={gG:g.x=x}.

The goal of the next exercise is to prove the following:

Theorem 4 (Orbit–Stabilizer Theorem).

Let G be a group acting on a set X. If xX, then |G|=|𝒪x||StabG(x)|.

The orbit–stabilizer theorem should be viewed as a generalization of Lagrange’s theorem (which we will use to prove the orbit–stabilizer theorem). Indeed, let H be a subgroup of G, and let H be the left cosets of H. Then G acts on H by g.(aH)=(ga)H, with StabG(H)=H and 𝒪H=H.

**Exercise 17.

Let G be a group acting on a set X. Let xX.

  1. (a)

    Let g,hG. Prove that gx=hx if and only if h1gStabG(x).

  2. (b)

    Let be the set of left cosets of StabG(x) in G. Let ψ:𝒪x be given by ψ(gStabG(x))=gx.

    1. (i)

      Prove that ψ is a well-defined, that is, prove that if gStabG(x)=hStabG(x), then g.x=h.x.

    2. (ii)

      Prove that ψ is bijective.

The previous part implies that |𝒪x|=[G:StabG(x)]. Lagrange’s theorem tells us that |G|=|𝒪x||StabG(x)|, yielding the orbit-stabilizer theorem.

**Exercise 18.

Let G be a finite group. Use the orbit–stabilizer theorem to show that, for aG, the cardinality of the set {gag1:gG} (that is, the conjugacy class of a) divides |G|.