Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Lecture 1

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

GROUP- A group is an algebraic structure (G, *) in which the binary operation * on G satisfies

the following conditions:


(I) for all a, b, c, ∈ G
a * (b * c) = (a * b) * c (associativity)
(II) there exists an elements e ∈ G such that for any a ∈ G
a * e= e * a = a (existence of identity)
−1
(III) for every a ∈ G , there exists an element denoted by (𝑎) in G such that
−1 −1 −1
a *(𝑎) = (𝑎) * a = e , (𝑎) is called the inverse of a in G.
Example 1: (Z, +) is a group where Z denotes the set of integers.
Example 2: (R, +) is a group where R denotes the set of real numbers.

ABELIAN GROUP- Let (G, *) be a group. If * is commutative that is a * b = b * a for all a,,b ∈ G
then (G, *) is called an Abelian group.
Example: (Z, +) is an Abelian group.

FINITE GROUP- A group G is said to be a finite group if the set G is a finite set.
Example: G = {–1, 1} is a group with respect to the operation multiplication. Where G is a finite
set having 2 elements. Therefore G is a finite group.
INFINITE GROUP- A group G, which is not finite is called an infinite group.

ORDER OF A FINITE GROUP- The order of a finite group (G, *) is the number of distinct
elements in G. The order of G is denoted by O (G) or by |G|.
Example: Let G = {–1, 1} The set G is a group with respect to the binary operation multiplication
and O (G) = 2.

Example 1: Show that the set G = {1, –1, i, –i} where i = −1 is an abelian group with respect to
multiplication as a binary operation.
Solution: Let us construct the composition table

● 1 -1 i -i

1 1 -1 i -i

-1 -1 1 -i i

i i -i -1 1

-i -i i 1 -1
From the above composition, it is clear that the algebraic structure (G, ⋅) is closed and satisfies
the following axioms: Associativity: For any three elements a, b, c ∈ G
8 Definition 9.38: An algebraic system (R, +, ⋅) is called a ring if the binary operations ‘+’ and ‘⋅ ’
R satisfy the following properties: 1. (R, +) is an abelian group. 2. (R, ⋅) is a semi-group. 3. The
operation ‘⋅ ’ is distributive over +, that is for any a, b, c ∈ R, a b c ab ac ⋅ + =⋅+⋅ ( ) and ( ) b c
a ba ca + ⋅=⋅+⋅ Example 1: The set of all matrices of the form 0 0 a b ⎛ ⎞ ⎜ ⎟ ⎝ ⎠ a and b being
real numbers, with matrix addition and matrix multiplication is a ring. Example 2: The set of
integers Z, with respect to the operations + and × is a ring. # 0 # 44*58)38 A ring R is said
to be a commutative ring or an abelian ring if it satisfies the commutative law, ∀ ∈ ab R , , ab
ba ⋅=⋅ .

You might also like