Scribd
Upload
14 views2 pages

m19 Math4120 hw04

Group Theory Homework

Uploaded by

yshan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views2 pages

m19 Math4120 hw04

Group Theory Homework

Uploaded by

yshan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Homework 4 | Due Wednesday, May 22 1

Read the following, which can all be found either in the textbook or on the course website.
Chapter 6 of Visual Group Theory, or Chapters 4.1, 5.4, 5.5, 7 of IBL Abstract Algebra.
VGT Exercises 6.6–6.9, 6.12, 6.17–6.20, 6.28–6.30.
Write up solutions to the following exercises.

1. A Cayley diagram and multiplication table for the dihedral group D4 are shown below.

e r r2 r3 f rf r2f r3f
e e r r2 r3 f rf r2f r3f
r r r2 r3 e rf r2f r3f f
r2 r2 r3 e r r2f r3f f rf
r3 r3 e r r2 r3f f rf r2f
f f r3f r2f rf e r3 r2 r
rf rf f r3f r2f r e r3 r2
r2f r2f rf f r3f r2 r e r3
r3f r3f r2f rf f r3 r2 r e

Section 2 of the class lecture notes describes two algorithms for expressing a group G of
order n as a set of permutations in Sn . One algorithm uses the Cayley diagram and the
other uses the multiplication table. In this problem, you will explore this a bit further.
(a) Label the vertices of the Cayley diagram from the set {1, . . . , 8} and use this to
construct a permutation group isomorphic to D4 , and sitting inside S8 .
(b) Label the entries of the multiplication table from the set {1, . . . , 8} and use this to
construct a permutation group isomorphic to D4 , and sitting inside S8 .
(c) Are the two groups you got in Parts (a) and (b) the same? (The answer will depend
on your choice of labeling.) If “yes”, then repeat Part (a) with a different labeling
to yield a different group. If “no”, then repeat Part (a) with a different labeling to
yield the group you got in Part (b).

2. Find all subgroups of the following groups, and arrange them in a Hasse diagram, or
subgroup lattice. Moreover, label each edge between K ≤ H with the index, [H : K].

(a) C23 = hr | r23 = 1i;


(b) C24 = hr | r24 = 1i;
(c) Z3 × Z3 = {(a, b) | a, b ∈ {0, 1, 2}};
(d) Z2 × Z2 × Z2 = {(a, b, c) | a, b, c ∈ {0, 1}}; (Tip: it’s notationally easier to write
elements as binary strings, e.g., abc instead of (a, b, c));
(e) S3 = {e, (1 2), (2 3), (1 3), (1 2 3), (1 3 2)};
(f) Q8 = hi, j, k | i2 = j 2 = k 2 = ijk = −1i.

Math 4120/6120 | Modern Algebra | Summer I 2019 | M. Macauley


Homework 4 | Due Wednesday, May 22 2

3. For each subgroup H of S4 described below, write out all of its elements and determine
what well-known group it is isomorphic to.

(a) H = h(1 2) , (3 4)i;


(b) H = h(1 2) (3 4) , (1 3) (2 4)i;
(c) H = h(1 2) , (2 3)i;
(d) H = h(1 2) , (1 3 2 4)i;
(e) H = h(1 2 3) , (2 3 4)i.

4. Prove the following, algebraically (that is, do not refer to Cayley diagrams):
\
(a) If H is a collection of subgroups of G, then the intersection H is also a subgroup
H∈H
of G.
(b) For any (possibly infinite) subset S ⊆ G, the subgroup generated by S is defined as

hSi := {se11 se22 · · · sekk | si ∈ S, ei ∈ {−1, 1}} .

That is, hSi consists of all finite “words” that can be written using the elements in S
and their inverses. Note that the si ’s need not be distinct. Prove that
\
hSi = H,
S⊆H≤G

where the intersection is taken over all subgroups of G that contain S. [Hint: One
way to prove that A = B is to show that A ⊆ B and B ⊆ A.]

5. For a subgroup H ≤ G and element x ∈ G, the set xH := {xh | h ∈ H} is a left coset of


H.

(a) Prove that if x ∈ H, then xH = H. What is the interpretation of this statement in


terms of the Cayley diagram?
(b) Prove that if b ∈ aH, then aH = bH.
(c) Prove that all left cosets have the same size. One way to do this is to prove that for
any x ∈ G, the map
ϕ : H −→ xH , ϕ: h −
7 → xh
is a bijection.
(d) Conclude that G is partitioned by the left cosets of H, all of which are equal size.

6. A subgroup H of G is normal if xH = Hx for all x ∈ G. Prove that if [G : H] = 2, then


H is a normal subgroup of G. [Hint: Use the results of the previous problem.]

Math 4120/6120 | Modern Algebra | Summer I 2019 | M. Macauley

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy