Tutorial-1: 0 0 M N M K
Tutorial-1: 0 0 M N M K
Tutorial-1: 0 0 M N M K
(0) Give example of a group, say G0 with a, b ∈ G0 with a, b 6= e such that am = e for some m ∈ N
and for any n ∈ N, bn 6= e.
Definition: Let G be a group and let a ∈ G be such that am = e for some m ∈ N then we say that
a is of finite order and order of a by definition smallest natural number, say k such that ak = e. We
write o(a) = k.
If an 6= e for all n ∈ N, we say that a is of infinite order and we write o(a) = ∞.
(1) Let A be a set. The distinct equivalence classes of an equivalence relation on A provide us with
a decomposition of A as a union of mutually disjoint subsets (called partition). Conversely,
given a decomposition of A as a union of mutually disjoint, nonempty subsets, we can define an
equivalence relation on A for which these subsets are the distinct equivalence classes.
(2) Prove that if G is an abelian group, then for all a, b ∈ G and all integers n, (a · b)n = an · bn .
(3) If G is a group such that (a · b)2 = a2 · b2 for all a, b ∈ G, show that G must be abelian.
(4) If G is a finite group, show that there exists a positive integer N such that aN = e for all a ∈ G.
(10) Let G be distance preserving maps of R2 . Check if G forms a group under composition.
(11) Let X be a set and Let Ĝ = Hom(X, Z) denote all maps from X to Z. Check that Ĝ is a group.