Professional Documents
Culture Documents
SOLUTIONS
KELLER VANDEBOGERT
Problem 1
Problem 2
To see that these are nonisomorphic, merely note that any isomor-
phism must preserve the order of an element. If there were an isomor-
phism, the image of the order 4 element must remain order 4; this is
not possible as there are no order 4 elements in Z/2 × Z/2.
Problem 3
= [g(a), g(b)] ∈ Gc
And normality follows. Suppose now that we have a morphism φ :
G → A with A abelian. Then,
φ(g)φ(h) = φ(h)φ(g)
=⇒ φ([g, h]) = 1
Whence Gc ⊂ Ker φ; merely define φ : G/Gc → A by φ(gGc ) := φ(g).
This is well defined since if h−1 g ∈ Gc , then
Problem 4
HK ∼ H
=
K H ∩K
Taking cardinalities,
|H||K|
|HK| =
|H ∩ K|
Problem 5
G/N ∼
= G0 /N 0
G G
(g1 N, g10 N 0 ) = (g2 N, g20 N 0 ) ∈ × 0
N N
∈H
Hence (1, g20 −1 g10 ) ∈ N 0 , implying that g10 N 0 = g20 N 0 . Thus, we may de-
fine ψ(g1 N ) = g10 N 0 if (g1 , g10 ) ∈ H. This is surjective since ψ −1 (g10 N 0 ) 3
g1 N whenever (g1 , g10 ) ∈ H; by symmetry (that is, just employ the
above well-definedness argument), ψ is injective, hence an isomorphism.
We conclude that
G ∼ G0
= 0
N N
Problem 6
= φ(g)xφ(g)
Problem 7
Problem 8
[
G= HcH 0
c∈C
By part (i),
[
G= HcH 0
c∈C
[[
= xc H ∩ cH 0 c−1 )cH 0
c∈C c∈C
[[
= HH 0 ∩ xc cH 0
c∈C c∈C
[[
= xc cH 0
c∈C c∈C
Problem 9
g 7→ πg
Then πg ≡ Id whenever ggi H = gi H for every coset. In particular,
gH = H =⇒ g ∈ H, so that Ker ⊂ H.
(N1 N2 : N1 ) = (N2 : N1 ∩ N2 )
SERGE LANG’S ALGEBRA CHAPTER 1 EXERCISE SOLUTIONS 7
=⇒ (G : N1 ∩ N2 ) < ∞
As H1 ∩ H2 ⊃ N1 ∩ N2 , we deduce that (G : H1 ∩ H2 ) < ∞ as well.
Problem 10
Problem 11
gA 7→ cg
Problem 12
γxy = γx ◦ γy
= xx0 yx0−1 x0 y
= xyx0 y 0
= φ(x, y)φ(x0 , y 0 )
So that φ is a homomorphism. Suppose conversely that φ is a homo-
morphism; then
φ x, 1)(1, y) = φ (1, y)(x, 1)
=⇒ xy = yx for all x ∈ H, y ∈ N
And,
(x1 , h1 ) (x2 , h2 )(x3 , h3 ) = (x1 , h1 )(x2 ψ(h2 )(x3 ), h2 h3 )
with identity (1, 1). Now, identify N with (N, 1) and H with (1, H);
we see
(N, 1)(1, H) = (N ψ(H)(1), H) = (N, H)
N × H → NH
Problem 13
yxy −1 ∈ H x−1 yx ∈ N
SERGE LANG’S ALGEBRA CHAPTER 1 EXERCISE SOLUTIONS 11
x−1 yxy −1 = 1 =⇒ xy = yx
(b). Proceed by induction, with the base case being part (a). Then,
H1 × · · · × Hn = H1 . . . Hn−1 × Hn
= H1 H2 . . . Hn
Problem 14
Problem 15
Problem 16
Problem 17
Verify that
X
|C| = φ(x)
x∈X
SERGE LANG’S ALGEBRA CHAPTER 1 EXERCISE SOLUTIONS 13
Problem 18
Problem 19
(b). We have:
X
|S/G| = 1
Gs∈S/G
X X 1
=
t∈Gs
|Gt|
Gs∈S/G
X 1
=
s∈S
|Gs|
X |Gs |
=
|G|
s∈S
1 X
= |Gs |
|G| s∈S
Note that
X X
|Gs | = {(s, g) | gs = s} = |S g |
s∈S s∈S
Problem 20
Problem 21
|PH ∩ H| = pm = |P |
Problem 22
=⇒ H 6 Q
Where the last step uses normality of H. But then we see that H is
contained in all such Sylow p subgroups.
Problem 23
(a) If P 0 ⊂ N (P ), then P 0 = P .
(b) If N (P 0 ) = N (P ), then P = P 0
(c) We have N (N (P )) = N (P ).
=⇒ aP a−1 ⊂ N (P )
Since all Sylow p subgroups are conjugate, we know that aP a−1 ∈
Sylp (N (P )). But P is the unique such subgroup, so that aP a−1 =
P =⇒ a ∈ N (P ). Whence
N (P ) = N (N (P ))
as desired.
SERGE LANG’S ALGEBRA CHAPTER 1 EXERCISE SOLUTIONS 17
Problem 24
G∼
= Z/p2 , G∼
= Z/p × Z/p
Problem 25
g1 = h1 z1 , g2 = h2 z2 , hi ∈ H, zi ∈ Z(G)
We see:
g1 g2 = h1 z1 h2 z2
= h1 h2 z2 z1
= h2 h1 z2 z1
= h2 z2 h1 z1
= g2 g1
Implying that G is abelian, which is a contradiction. Therefore, we
must have that H ⊃ Z(G) so all subgroups of order p2 .
Problem 26
G = (pq)
so that G is cyclic.
Problem 27
one Sylow 3 subgroup. Hence, Q ∈ Syl3 (G) is normal, and G/Q and
Q must be solvable by induction. Thus, G is also solvable.
This exhausts all cases, so we see that every group of order < 60 is
solvable.
Problem 28
Problem 29
> 2p(q − 1) + q + p
> 2p(q − 1) + p + p
= 2pq = |G|
Problem 30
(g, aP ) 7→ gaP
Problem 31
Order 1: Trivial
Order 2: Z/2
Order 3: Z/3
Order 4: Z/4 and Z/2 × Z/2
Order 5: Z/5
Order 6:
Abelian: Z/6, Z/2 × Z/3
Nonabelian: S3
Order 7: Z/7
Order 8:
Abelian: Z/8, Z/2 × Z/4, Z/2 × Z/2 × Z/2
Nonabelian: D10
Problem 32
Problem 33
m = n − number of orbits of σ
m = n − (n − 1) = 1
SERGE LANG’S ALGEBRA CHAPTER 1 EXERCISE SOLUTIONS 25
So we are done.
Problem 34
(a). Let D2n be the group of rotations and reflections on the vertices
of an n-sided regular polygon. σ will be rotation by 2π/n radians, and
τ is a reflection. Then it is geometrically evident that τ 2 = 1, and
σ n = 1. Also, if we choose base point 1 ∈ C,
στ (1) = −e2πi/n
= τ (e−2πi/n )
= τ σ n−1 (1)
Whence στ = τ σ n−1 .
26 KELLER VANDEBOGERT
(b). Note
2
0 −1 1 0
=
1 0 0 1
and
n
ξ 0 1 0
=
0 ξ −1 0 1
Also,
ξ 0 0 −1
στ =
0 ξ −1
1 0
0 −ξ
= −1
ξ 0
0 −ξ 1−n
= n−1
ξ 0
n−1
0 −1 ξ 0
=
1 0 0 ξ 1−n
= τ σ n−1
Problem 35
hgh−1 ∈ {1, g, g 2 , g 3 }
SERGE LANG’S ALGEBRA CHAPTER 1 EXERCISE SOLUTIONS 27
h2 ∈ {1, g 2 }
h2 = 1, g 4 = 1, hgh−1 = g −1
h2 = g 2 , g 4 = 1, hgh−1 = g −1
Problem 36
Problem 37
= τ (ik+1 )
τ σ1 . . . σr τ −1 = τ σ1 τ −1 τ . . . τ σr τ −1
By part (a), the cycle length for each σi is preserved, whence the overall
cycle type is also preserved.
Problem 38
Problem 39
{1, . . . , n − 2, n − 1} 7→ {1, . . . , n − 1, n − 2}
so that An is n − 2 transitive.
Problem 40
{H, σ1 H, . . . , σn−1 H}
An → Alt(An /H) → An
Problem 41
(a). Consider the set of Sylow 5 subgroups. Then, |Syl5 (H)| 12 and
is congruent to 1 mod 5. Thus it is either 1 or 6. If it is 1, then H
is not simple, so we have 6 Sylow subgroups of H. Now consider the
conjugation action of Syl5 (H). This induces a permutation representa-
tion in S6 with trivial kernel by simplicity of S6 . Whence we have an
embedding H ,→ S6 , and we want to further argue that the image in
contained in A6 .
To see this, consider the elements of order 3 in H, and the subgroup
generated by these elements. This is normal in H, hence all of H (and
nontrivial by Sylow’s theorem). Thus the permutation representation
is generated by order 3 elements, hence even, so that H ,→ A6 , as
desired.
Problem 42
Problem 43
Q = Z/pb1 ⊕ · · · ⊕ Z/pbj
order pbj−i of G (since we are working with cyclic groups), and hence,
taking the direct sum of all of the above,
Z/pb1 ⊕ · · · ⊕ Z/pbj
Problem 44
(A : B) = (Af : B f )(A : B)
SERGE LANG’S ALGEBRA CHAPTER 1 EXERCISE SOLUTIONS 35
as desired.
Problem 45
q(A) = q(B)q(A/B)
(σ, a + B) 7→ σ(a) + B
Let us show well definedness. If a + B = a0 + B, then a − a0 ∈ B =⇒
σ(a − a0 ) ∈ σ(B) ⊂ B. Hence,
i∗ π∗
δ / H0 (B) / H0 (A) / H0 (A/B) / 0
Then, note that the Herbrand quotient is precisely
|H0 (A)|
|H1 (A)|
As i∗ is injective by definition, we may extract the short exact sequences
i∗ π∗
0 / H0 (B) / H0 (A) / Coker i∗ / 0
i∗ π∗
0 / H1 (B) / H1 (A) / Coker i∗ / 0
Similarly,
|H0 (B)| = | Im δ0 || Im i0∗ |
And
H0 (A/B)| = | Im π0∗ || Im δ1 |
SERGE LANG’S ALGEBRA CHAPTER 1 EXERCISE SOLUTIONS 37
H1 (A/B)| = | Im π1∗ || Im δ0 |
Problem 46
S
Let G operate on a set S. Let S = Si be a partition of S
into disjoint subset. We say that the partition is stable under
G if G maps each Si onto Sj for some j, and hence G induces
a permutation on the sets of the partition among theselves.
THere are two partition of S which are obviously stable: the
partition consisting of S itself, and the partition consisting of
the subsets with one element. Prove that the following two
conditions are equivalent:
(1) The only partitions of S which are stable are the two
partitions mentioned above.
38 KELLER VANDEBOGERT
g 7→ g · s
with kernel H, so that G/H → S is an isomorphism. If there exists
H 0 6= G containing H, then G/H 0 6 G/H. Restricting the above, we
have an induced partition
Problem 47
haH = bH
Where the above is empty because G acts faithfully. Thus there exists
t ∈ K with t ∈
/ H. Choose g ∈
/ H and by part (a) we can find h ∈ H
such that
htH = gH
=⇒ g −1 hh0 H 0 = H 0
=⇒ gH 0 = H 0
=⇒ g ∈ H 0
Which is a contradiction. Hence, H does not act transitively on S\{s},
so that G is not doubly transitive.
Problem 48
(b). Since G is doubly transitive, there are two orbits of the action of
G and its complement. Consider now the order of the fixed points. If
42 KELLER VANDEBOGERT
g fixes (a, b), then g fixes a and b. In the problem’s notation, this says
that there are f (g) · f (g) fixed points of g, so, by Burnside’s Lemma,
X
2|G| = f (x)2
x∈G
Problem 49
a 7→ aG (1)
ψ :G → Aut(F )
where ψ(g)x (x) := g · x. Then,
φ(a ◦ b) = (a ◦ b)G (1)
= aG (bG (1))
= aG (1)bG (1)
= φ(a)φ(b)
ψ(g · g 0 )x (x) = (g · g 0 ) · x
= g(g 0 x)
=g·1=g
SERGE LANG’S ALGEBRA CHAPTER 1 EXERCISE SOLUTIONS 43
= aG (1) · x
= ax (x)
Problem 50
Problem 51
(a). This proof is identical to the proof given in part (a) of the above,
noting that we do not have any kind of group structure. That is,
(X, f ) × (Y, g)
pr2
pr1
x &
X Y
f
g
& x
Z
commutes. That is, a product in the slice category over Z is precisely
the fiber product over Z. But HomZ (T, −) preseves products, so we
deduce that HomZ (T, −) applied to a pullback yields a product in the
category of sets.
Problem 52
(a). Let
f :Z→X
g:Z→Y
Define
commutes. This is trivially well defined since the qi are, and we see
that the universal property is satisfied.
i2 : Y → X ⊕Z Y
Problem 53
f : H → G, g : H → G0
46 KELLER VANDEBOGERT
Problem 54
g1 · · · · · gm = id
g1 . . . gm (s) = s
Problem 55
(a) Show that there cannot be more than two fixed points and
that these fixed points are w = w1 /w2 and w0 = w10 /w20 .
(b) Assume that |λ| < |λ0 |. Given z 6= w, show that
lim M k (z) = w0
k→∞
And similarly for w0 . Thus we conclude that λ and λ0 are the unique
fixed points.
Then,
0
λk 0 −1
k
lim M (z) = lim w w 0k w w0
k→∞ z→∞ 0 λ
λ k z − w
= lim w w0
k→∞ λ0 −z − w0
0
w w
= (0) = w0
1 1
Problem 56
Problem 57