Nicholas G. Vlamis

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: a∼b if and only if b is conjugate to a (that is, there exists g∈G such that b=g⁢a⁢g−1). 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 Section 6.5 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,g2∈G.

  1. (a)

    Prove that if g1⁢H=g2⁢H, then g2−1⁢g1∈H.

  2. (b)

    Prove that if g1⁢H⊂g2⁢H, then g1⁢H=g2⁢H.


*Exercise 5.

Let H be a subgroup of G. Prove that if g⁢h⁢g−1∈H for all g∈G and for all h∈H, then a⁢H=H⁢a for all a∈G.


Exercise 6.

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


*Exercise 7.

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


*Exercise 8.

Let n∈ℕ. Use Fermat’s Little Theorem to show that if p=4⁢n+3 is prime, then there is no solution to the equation x2≡−1(modp).


Exercise 9.

Let p∈ℕ be prime. How many subgroups does ℤ2⁢p have? Prove it.


Exercise 10.

Let φ:G→H be an isomorphism of groups.

  1. (a)

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

  2. (b)

    Prove that φ⁢(g)−1=φ⁢(g−1) for all g∈G.

  3. (c)

    Prove that φ⁢(gn)=φ⁢(g)n for all g∈G and for all n∈ℤ.

  4. (d)

    Prove that φ−1:H→G is an isomorphism.


*Exercise 11.

Prove that ℂ× is isomorphic to the subgroup of GL⁢(2,ℝ) consisting of matrices of the form [ab−ba].


Exercise 12.

Prove that S4 is not isomorphic to D4.


Definition 1.

An automorphism of a group G is an isomorphism G→G.


*Exercise 13.

Let G be a finite abelian group of order n. Suppose m∈ℕ is relatively prime to n. Prove that φ:G→G 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 a∈G 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×X→X satisfying:

  1. (i)

    ϕ⁢(e,x)=x for all x∈X, and

  2. (ii)

    ϕ⁢(g⁢h,x)=ϕ⁢(g,ϕ⁢(h,x)) for all g,h∈G and for all x∈X.

Usually the group action is clear from context and we simply write g⁢x or g.x instead of ϕ⁢(g,x). In this notation, (i) says e.x=x for all x∈X, and (ii) says (gh).x=g.(h.x). Again suppressing the function ϕ, we generally write G↷X 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 G↷X. Given x∈X, the orbit of x, denoted 𝒪x, is the subset of X given by

𝒪x={g.x:g∈G}

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)={g∈G: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 x∈X, 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.(a⁢H)=(g⁢a)⁢H, with StabG⁢(H)=H and 𝒪H=ℒH.

**Exercise 17.

Let G be a group acting on a set X. Let x∈X.

  1. (a)

    Let g,h∈G. Prove that g⁢x=h⁢x if and only if h−1⁢g∈StabG⁢(x).

  2. (b)

    Let ℒ be the set of left cosets of StabG⁢(x) in G. Let ψ:ℒ→𝒪x be given by ψ⁢(g⁢StabG⁢(x))=g⁢x.

    1. (i)

      Prove that ψ is a well-defined, that is, prove that if g⁢StabG⁢(x)=h⁢StabG⁢(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 a∈G, the cardinality of the set {g⁢a⁢g−1:g∈G} (that is, the conjugacy class of a) divides |G|.