Midterm Exam

Problem 3. Let G be a group of order p2 where p is a prime and assume that Z(G) , {e}. Show
that G is abelian.

Proof. Since Z(G) is a subgroup of G and so |Z(G)| divides |G|, then we have |Z(G)| =
1, p, or p2 . But Z(G) , {e}, then |Z(G)| , 1. If |Z(G)| = p2 , then we have G = Z(G),
which implies  G is abelian. Now suppose that |Z(G)| = p. We know that Z(G) C G
and  G/Z(G)  = p. Then G/Z(G) has exactly two subgroups, namely of orders 1 and p.
This implies that G/Z(G) is cyclic (by HW# 2, problem 3). Then G is abelian (by HW#
4, problem 1). 

Problem 4. (a) Prove that |G : CG (a)| = |Cl(a)| where CG (a) = {g ∈ G : ag = ga} and Cl(a) =
{ag : g ∈ G}.

Proof. Suppose G acts on Ω = G by g · α = gαg−1 , g ∈ G, α ∈ Ω. Then we

have orbit of a, Oa = {ag : g ∈ G} = Cl(a), and stabilizer of of a, Ga = {g ∈ G :
a = gag−1 } = {g ∈ G : ag = ga} = CG (a). Now by the Fundamental Counting
|G|
Principal, we have |G| = |Oa ||Ga | =⇒ |G| = |Cl(a)||CG (a)| =⇒ =
|CG (a)|
|Cl(a)| =⇒ |G : CG (a)| = |Cl(a)|. 

(b) Suppose that there is an element of G which has exactly two conjugates. Show
that G is not simple.

Proof. Let x ∈ G has exactly two conjugates. Then |O x | = |G : G x | = 2, that is

|G : CG (x)| = 2. This implies CG (x) C G.
Now, if CG (x) = G, then |G : G x | = 1, which is a contradiction. Else if CG (x) =
{e}, then |G| = 2. But x ∈ G has two conjugates, one of which is x itself since
x = exe−1 . And we know e is not a conjugate of X, since @g ∈ G such that
gxg−1 = e for x , e (x , e because e has only one conjugate e itself). So there is
y ∈ G, y , e such that y is a conjugate of x. Therefore |G| ≥ 3, which is again a
contradiction.
Therefore CG (x) is a proper subgroup of G. Therefore G is not simple.