0% found this document useful (0 votes)
3 views

ASSIGNMENT 1

The document is an assignment for a Group Theory course (MTH204B) consisting of various problems related to binary structures, isomorphisms, cyclic groups, and properties of groups. It includes tasks such as proving certain structures are abelian, exploring homomorphisms, and analyzing specific groups like dihedral and symmetric groups. The assignment covers a wide range of topics in group theory, requiring both theoretical understanding and practical application.

Uploaded by

Vineet Singh
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
0% found this document useful (0 votes)
3 views

ASSIGNMENT 1

The document is an assignment for a Group Theory course (MTH204B) consisting of various problems related to binary structures, isomorphisms, cyclic groups, and properties of groups. It includes tasks such as proving certain structures are abelian, exploring homomorphisms, and analyzing specific groups like dihedral and symmetric groups. The assignment covers a wide range of topics in group theory, requiring both theoretical understanding and practical application.

Uploaded by

Vineet Singh
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/ 4

Group Theory - MTH204B

Assignment 1

1. Let X be a non-empty set. Show that (Map(X), ◦) is an abelian binary structure


if and only if X has one element. Further show that (Sym(X), ◦) is an abelian binary
structure if and only if X has at most two elements.
2. Consider the binary operation on R defined as a ⋆ b := |a − b|. Show that (R, ⋆) is
abelian but not associative.
a+b
3. Consider the binary operation on R defined as a ⋆ b := 2
. Show that (R, ⋆) is abelian
but not associative.
4. Let n be a positive integer. Consider the binary operation on Mn (R) defined as
[A, B] := AB − BA. Show that (Mn (R), [, ]) is associative if and only if n = 1.
5. Let ϕ be an isomorphism from a binary structures (S, ⋆) to (T, ·) and ϕ−1 : T −→ S
be the inverse of ϕ. Show that ϕ−1 is an isomorphism.
6. Show that (Z, +) and (Q, +) are not isomorphic as binary structures.
7. Let (S, ⋆) and (T, ·) be two isomorphic binary structures. Show that if (S, ⋆) is abelian
then (T, ·) is also abelian.
8. Check which of the following pairs of binary structures are isomorphic.
1. (Z, +) and (N, +).
2. (C∗ , ·) and (R, ·).
3. (C, ·) and (C, ·).
4. (R, +) and (C, +).
9. Let G be a group. Suppose that a2 = e for all a ∈ G. Show that G is abelian.
10. Let G be a group. Suppose that a3 = e for all a ∈ G. Show that G is abelian. result is not true
11. Let G be a cyclic group of order n. Show that G is isomorphic to Z/nZ.
12. Show that every subgroup and quotient of a cyclic group is cyclic.
13. Let G be a cyclic group of order n. Show that the number of generators of G is equal
to ϕ(n) := number of positive integers < n which are coprime to n.
14. Let G be a cyclic group of order n. Show that G is a cyclic group if and only if for
every 0 < d|n, there is a unique subgroup of G of order d.
15. Show that every infinite cyclic group is isomorphic to (Z, +). In particular, it has
only two generators.

1
2

16. For a positive integer n, let U (n) denote the group of integers modulo n coprime to
n, under multiplication. Which of the following are cyclic groups?
1. U (11).
2. U (22).
3. U (16).
4. U (77).

17. For every positive integer n, show that Q/Z has a unique subgroup of order n, and
this is a cyclic subgroup. Also, show that Q/Z has no subgroup of finite index.

18. Let G and H be two abelian groups. Define

Hom(G, H) := {f : G −→ H| f is a homomorphism}.

Show that Hom(G, H) is a subgroup of Map(G, H).

19. Let G and H be two finite abelian groups.


1. If G is cyclic group of order n then show that Hom(G, H) is isomorphic to the
subgroup {h ∈ H|hn = e} of H.
2. If G is a cyclic group of order n and H is a cyclic group of order m then show that
Hom(G, H) is isomorphic to the subgroup {h ∈ H|hgcd(n,m) = e} of H.
3. Define End(G) := Hom(G, G). Show that G is cyclic if and only if End(G) is cyclic.

20. Let G be a group. Define

Aut(G) := {f : G −→ H| f is an isomorphism}

and

Inn(G) := {f : G −→ H| there exists a g ∈ G such that f (h) = ghg −1 for all h ∈ G}.

Show that Aut(G) is a subgroup of Sym(G) and Inn(G) is a normal subgroup of Aut(G).

21. Let G be a finite cyclic group.


1. Let a, b be two generators of G. Show that there is an isomorphism f : G −→ G
such that f (a) = b.
2. Show that there is a bijection between the number of generators of G and the
number of elements in Aut(G).
3. Show that Aut(G) is isomorphic to U (|G|).

22. Prove that any orthogonal matrix in M2 (R) is either a rotation ρθ about the origin
with an angle of rotation θ or a reflection
 σθ with respect
 to a linepassing through
 the
cos θ − sin θ cos θ sin θ
origin making an angle θ/2 where ρθ := and σθ := .
sin θ cos θ sin θ − cos θ

23. If f : R2 −→ R2 preserves the distance on R2 induced by standard norm takes origin


to origin, then f is linear and with respect to standard basis f ∈ O(2). [Hint: if preserves
the standard inner product and hence angle]

24. Let G = S3 .
3

1. Show that Z(S3 ) := {Id}.


2. Show that CS2 ((i j k)) := {Id, (1 2 3), (1 3 2)}.. For any i, j ∈ {1, 2, 3} Show that
CS3 ((i j)) = {Id, (i j)}.
3. List all subgroups H of S3 and compute their all conjugates and normalizers.

25. Let Dn denote the dihedral group of order n. Show that Z(Dn ) is trivial if n/2 is
odd and Z(Dn ) is a group of order 2 if n/2 is even. If n/2 is an odd integer and n ≥ 3,
then show that Dn has a unique normal subgroup of order n/2 and it has three normal
subgroups.

26. Compute the center of GLn (R).

27. Let G be a finite group of C∗ . Show that G is a cyclic group.

28. Let G be a group and H, K be subgroups. Show that HK := {hk|h ∈ H, k ∈ K} is


a subgroup if either H or K is a normal subgroup.

29. Let G be a group and H, K be subgroups. If H ∩ K = {e} then show that every
element of HK can be uniquely written as hk for h ∈ H and k ∈ K. In particular, if H
and K are finite then |HK| = |H||K|.
|H||K|
30. Let G be a group and H, K be finite subgroups. Show that |HK| = |H∩K|
.

31. Let p be a prime number and G be a group order p2 . Show that G is abelian. Upto
isomorphism, how many groups are there of order p2 ?

32. Let G be a group such that G/Z(G) is cyclic. Show that G is abelian.

33. Let G be a group of order 15. Show that G is cyclic.

34. For a prime p, compute the number of p-Sylow subgroups of SL2 (Z/pZ).

35. Compute the number of 2 and 3 Sylow subgroups of S4 and A4 .

36. Let G be a group of order < 60. Show that G is not simple.

37. Let G be a group of order p1 p2 · · · pr for r distant primes p1 , · · · , pr . Suppose that


for each i, G has a unique pi -Sylow subgroup. Show that G is cyclic.

38. Let G be a group, and H is a subgroup of G of finite index. Show that there is a
normal subgroup of G of finite index contained in H.

39. Let G be a group and H1 , H2 be two subgroups of finite index. Show that H1 ∩ H2
is also of a finite index.

40. Let G be a finite group and H be a subgroup of G. Show that G ̸= ∪g∈G gHg −1 .

41. Let p be a prime number and G be a p-group. Let H be a normal subgroup of G of


order p. Show that H ⊂ Z(G).

42. Let G be a finite and p be a prime divisor of |G|. Let H be a subgroup of G and PH
be a p-Sylow subgroup of G. Show that there is a p-Sylow subgroup P of G such that
P ∩ H = PH .
4

43. Let G be a finite and p be a prime divisor of |G|. Let H be a normal subgroup of G
of order p. Show that H is contained in every p-Sylow subgroup of G.

44. Let G be a finite and p be a prime divisor of |G|. Let P be a p-Sylow subgroup of
G. Show that NG (P ) = NG (NG (P )).

45. Let G be a group of order pq for primes p and q. Show that G is not simple.

46. Let G be a group of order 2pq for odd primes p and q. Show that G is not simple.

47. Let G be a group of order p2 q for primes p and q. Show that G is not simple.

You might also like