DM U2 Algebraic Structures
DM U2 Algebraic Structures
Algebraic Structures
Algebraic systems Examples and general
properties
Semi groups Click to add text
Monoids
Groups
Sub groups
Homomorphism
Isomorphism
Algebraic systems
Abelian groups
Groups
Monoids
Semi groups
Algebraic systems
Theorem
In a Group (G, * ) the following properties hold good
1. Identity element is unique.
2. Inverse of an element is unique.
3. Cancellation laws hold good
a * b = a * c b = c (left cancellation law)
a * c = b * c a = b (Right cancellation law)
4. (a * b) -1 = b-1 * a-1
In a group, the identity element is its own inverse.
Ex: Show that set of all real numbers ‘R’ is not a group with respect
to multiplication.
Solution: We have 0 R .
The multiplicative inverse of 0 does not exist.
Hence. R is not a group.
Example
Ex. Let (Z, *) be an algebraic structure, where Z is the set of integers
and the operation * is defined by n * m = maximum of (n, m).
Show that (Z, *) is a semi group.
Is (Z, *) a monoid ?. Justify your answer.
Solution: Let a , b and c are any three integers.
Closure property: Now, a * b = maximum of (a, b) Z for all a,b Z
Ex. Show that the set of all strings ‘S’ is a monoid under the
operation ‘concatenation of strings’.
Is S a group w.r.t the above operation? Justify your answer.
Solution: Let us denote the operation
‘concatenation of strings’ by + .
Let s1, s2, s3 are three arbitrary strings in S.
Closure property: Concatenation of two strings is again a string.
i.e., s1+s2 S
Ex. Let S be a finite set, and let F(S) be the collection of all functions
f: S S under the operation of composition of functions, then
show that F(S) is a monoid.
Is S a group w.r.t the above operation? Justify your answer.
Solution:
Let f1, f2, f3 are three arbitrary functions on S.
Closure property: Composition of two functions on S is again a function
on S.
i.e., f1o f2 F(S)
Associativity: Composition of functions is associative.
i.e., (f1 o f2 ) o f3 = f1 o (f2 o f3 )
Contd.,
4. Inverse: Let a A
let us suppose b is inverse of a.
Now, a * b = (a b)/2 ….(1) (By definition of inverse.)
Again, a * b = e = 2 …..(2) (By definition of inverse)
From (1) and (2), it follows that
(a b)/2 = 2
b = (4 / a) A
(A ,*) is a group.
Commutativity: a * b = (ab/2) = (ba/2) = b * a
Hence, (A,*) is an abelian group.
Theorem
Ex. In a group (G, *) , Prove that the inverse of any element is unique.
Proof:
Let a ,b,c G and e is the identity in G.
Let us suppose, Both b and c are inverse elements of a .
Now, a * b = e …(1) (Since, b is inverse of a )
Again, a * c = e …(2) (Since, c is also inverse of a )
From (1) and (2), we have
a*b=a*c
b = c (By left cancellation law)
In a group, the inverse of any element is unique.
Theorem
1. Closure property: Since all the entries of the composition table are the
elements of the given set, the set G is closed under multiplication.
2. Associativity: The elements of G are complex numbers, and we know that
multiplication of complex numbers is associative.
3. Identity : Here, 1 is the identity element and 1 G.
4. Inverse: From the composition table, we see that the inverse elements of
1 , 2 are 1, 2, respectively.
Contd.,
Addition modulo m ( +m )
let m is a positive integer. For any two positive integers a and b
a +m b = a + b if a + b < m
a +m b = r if a + b m where r is the remainder obtained
by dividing (a+b) with m.
Multiplication modulo p ( p )
let p is a positive integer. For any two positive integers a and b
a p b = a b if a b < p
a p b = r if a b p where r is the remainder obtained
by dividing (ab) with p.
Ex. 3 5 4 =2 , 5 5 4 =0 , 2 5 2 = 4
Ex.The set G = {0,1,2,3,4,5} is a group with respect to addition modulo 6.
Ex. Let R be a group of all real numbers under addition and R+ be a group
of all positive real numbers under multiplication. Show that the
mapping f : R R+ defined by f(x) = 2x for all x R is an
isomorphism.
Solution: First, let us show that f is a homomorphism.
Let a , b R .
Now, f(a+b) = 2a+b
= 2a 2b
= f(a).f(b)
f is an homomorphism.
Next, let us prove that f is a Bijection.
Contd.,