Scribd
Upload
18 views1 page

Disjoint Matrix Groups Explained

This document provides examples and questions related to group theory. It begins by asking for an example of a group G0 with elements a and b that have finite and infinite order, respectively. It then provides definitions related to the order of elements in a group. The rest of the document consists of questions about properties of groups, including whether certain sets of matrices form groups under specific operations, classifying finite groups up to order 5, and other properties of groups.

Uploaded by

Kriti Agrawal
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
18 views1 page

Disjoint Matrix Groups Explained

This document provides examples and questions related to group theory. It begins by asking for an example of a group G0 with elements a and b that have finite and infinite order, respectively. It then provides definitions related to the order of elements in a group. The rest of the document consists of questions about properties of groups, including whether certain sets of matrices form groups under specific operations, classifying finite groups up to order 5, and other properties of groups.

Uploaded by

Kriti Agrawal
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

Tutorial-1

(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.

(5) If G is a group of even order, prove it has an element a 6= e satisfying a2 = e.


 
a b
(6) Let G be the set of all real 2 × 2 matrices Prove that G forms a group under matrix
c d
addition.
 
a b
(7) Let G be the set of all real 2 × 2 matrices where ad − bc 6= 0 is a real number. Prove
c d
that G forms a group under matrix multiplication. This group is usually denoted by GL2 (R).
 
a b
(8) Let G be the set of all real 2 × 2 matrices where ad − bc 6= 0 is a rational number. Prove
c d
that G forms a group under matrix multiplication.

(9) Let G be subset of M2 (R) given by


  
a a
G= a>0 .
a a
Is G a group under matrix multiplication? Justify.

(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.

(12) Classify all finite groups up to cardinality (also called order) 5.

You might also like