Module No.

5
Algebraic
Structures
Algebraic
Groupoid – Closure property
Structures
Semigroup – Associativity property

Monoid – Identity Property

Group – Inverse Property

Abelian Group – Commutativity

Property

Cyclic Group – Generator element

Algebraic
Structures

An algebraic structure is an ordered pair of (A , F) where A is set of

elements and F is a finite set of operators which is to be applied on A .

Eg. If the pair given is (A , *) is to be studied then

- A is the set under consideration which could be any set .
- * is the operation which need not necessarily be only multiplication
it may be given that
* operation implies (a+b*c) or (a/b +c) or anything else
Algebraic Structures –
Properties
1) Closure Property :
A set A wrt operator * is said to satisfy closure
property if ,
for all a,b belongs to A
then a*b also belongs to A
Algebraic Structure :
If a set A wrt operator * satisfies closure
property then it is called Algebraic Structure a b
A
Ex : S = {1,-1} is algebraic structure under * a*b

U
As 1*1 = 1, 1*-1 = -1, -1*-1 = 1 all results belongs to S.

But above is not algebraic structure under + as

1+(-1) = 0 not belongs to S.
Algebraic Structures –
Properties
2) Associative Property :
A set A wrt operator * is said to satisfy associativity
property if ,
for all a,b,c belongs to A
then (a*b)*c = a*(b*c) also belongs to A
Semi Group :
If an algebraic structure satisfies associative property then it is
called Semi Group

Ex : S = {N,+} is Semigroup under +

As ( 2 + 3 )+5 = 2 + ( 3 + 5 ) all results belongs to S making it closed and associative as well.

But if S = {Z , + } is it a Semigroup under +

As ( 2 – 3 ) -7 ! = 2 – (3 – 7 ) , hence even if it is closed for set of integers it is not
associative .
Hence , not a semi group .
Algebraic Structures –
Properties
3) Identity Property :
A set A wrt operator * is said to satisfy identity
property if ,
for all a belongs to A
there is an element e such that a*e = e*a = a

Monoid :
If a semigroup satisfies identity property then it is called Monoid

Ex : In case of + operation identity is always 0 . In case of * operation identity is always 1

a + ? = a  ? is 0
a * ? = a  ? is
1

S = (N,+) is it a
monoid ???
S = (Z, +) is it a
monoid ???
Algebraic Structures –
Properties
4) Inverse Property :
A set A wrt operator * is said to satisfy inverse
property if , for all a belongs to A
there is an element 𝒂−𝟏 such that 𝒂 ∗ 𝒂−𝟏 = 𝒂−𝟏

∗𝒂=e
Group :
If a monoid satisfies inverse property then it is called Group .

Ex : In case of * operation we need to get identity element 1

So , for element 2  2 * (1/2) = 1 . Hence inverse element is  (1/2)

In case of + operation we need to get identity element 0

So , for element 2  2 + (-2) = 0 . Hence inverse element is  -2

S = (Z, *) is it a group ???

Algebraic Structures –
Properties
5) Commutative Property :
A set A wrt operator * is said to satisfy inverse
property if ,
for all a,b belongs to A
a*b=b*a
Abelian Group :
If a group satisfies commutative property then it is called Abelian
Group .

Ex : a + b = b + a
a – b != b – a
a*b=b*a
a / b != b/a

Is (E , + ) abelian
group ??
Is ( O , *) abelian
Algebraic Structures –
Properties

Cyclic Group :
A finite group is said to be cyclic group if all elements of G are
generated by single element of it . This element is called
generator of G .
Prove that a set G = {1,-1,i,-i} is an abelian group wrt multiplication .
Check whether it is cyclic .

i. Closure : For all a,b belonging to G , a * b belongs to G.

Hence , closure satisfied

ii. Associativity : (1 * i ) * (-i) = 1 * ( i * (-i)) =1

Hence , associativity is satisfied

* 1 -1 i -i iii. Identity element : 1 is the identity

element
1 1 -1 i -i
iv. Inverse element :
-1 -1 1 -i i 1−1 = 1 , −1−1= −1 , 𝑖−1 =
−𝑖 , −𝑖−1 = 𝑖
i i -i -1 1 v. Commutativit
y: 1*i=i*1
-i -i i 1 -1 Hence , it is an
abelian group .

vi. Cyclic :
i 1= i
2
Prove that a set G = {1,ω, ω2} is an abelian group wrt multiplication .
Check whether it is cyclic .

i. Closure : For all a,b belonging to G , a * b belongs to G.

* 1 ω ω2 Hence , closure satisfied
1 1 ω ω2 ii. Associativity : (1 * ω ) * (ω2) = 1 * (ω * ω2) =1
Hence , associativity is satisfied
ω ω ω2
1
iii. Identity element : 1 is the identity element
ω2 ω2
1 ω
iv. Inverse element :
1−1 = 1 , ω−1 = ω2 , (ω2)−1
=ω

v. Commutativity :
1*ω=ω*1=ω
Hence , it is an abelian group .

vi. Cyclic :
ω1 = ω , ω2 = ω2 , ω3 = 1
Addition modulo m :

Let m be a positive integer then for all a,b belonging to I .

a +𝒎 b = r , where r is the remainder when a+b is divided by m.

Ex. 3 +𝟒 7 = 2

Multiplication modulo m :

Let m be a positive integer then for all a,b belonging to I

a ∗𝐦 b = r , where r is the remainder when a * b is divided by
m.

Ex. 3 ∗𝟒 7 = 1
Order of a group :

The least positive integer m , if it exists such that a𝒎 = e .

Where e is the identity element in G is called order of element a .

It is denoted as O(a) = m
Let G = {0,1,2,3,4,5} .
i. Prepare composition table wrt addition mod ulo 6
ii. Prove that G is an abelian group wrt addition modulo 6
iii. Find the inverse of 2 , 3 and 5
iv. Check if it is cyclic
v. Find the order of 2,3 and subgroup generated by these elements

+6 0 1 2 3 4 5
0 0 1 2 3 4 5 i. Closure
ii. Associativity
1 1 2 3 4 5 0 iii. Identity
iv. Inverse
2 2 3 4 5 0 1 v. Commutativity

3 3 4 5 0 1 2 Check whether it is
abelian ??
4 4 5 0 1 2 3
5 5 0 1 2 3 4
 Yes , it is abelian group

 𝟐−𝟏 = 𝟒 , 𝟑−𝟏 = 𝟑 , 𝟓−𝟏 = 𝟏

 Yes , it is cyclic .

𝟏𝟏 = 𝟏 , 𝟏𝟐 = 𝟐 , 𝟏𝟑 = 𝟑 , 𝟏𝟒 = 𝟒 , 𝟏𝟓 = 𝟓 , 𝟏𝟔 = 𝟎

 𝟐𝟏 = 𝟐 , 𝟐𝟐 = 𝟒 , 𝟐𝟑 = 0

At 3rd power of 2 we get identity element 0 . Hence , order of 2 is 3.

Sub-group of 2 is {0,2,4}

 𝟑𝟏 = 𝟑 , 𝟑𝟐 = 𝟎

At 2nd power of 3 we get identity element 0. Hence , order of 3 is 2 .

Sub-group of 3 is {0,3}
Practice Problems :

Let G = {0,1,2,3,4,5,6} .
i. Check whether given set is cyclic
ii.Find the order of 2,3 and subgroup generated by these elements wrt
multiplication modulo 7.

Let G = {0,3,6,9,12} .
Check whether given set is cyclic group wrt multiplication modulo 15
 Algebraic Semi group Monoid Group Abelian
structures Group

(N , +)
(N , -)
(N , *)
(N , /)
(Z , +)
(Z , -)
(Z , *)
(Z , /)
(R , +)
(R , -)
(R , *)
(R , /)
(E , +)
(E , - )
(O , +)
(O , - )
 Algebraic Semi group Monoid Group Abelian
structures Group

(N , +) √ √ X X X
(N , -) X X X X X
(N , *) √ √ √ X X
(N , /) X X X X X
(Z , +) √ √ √ √ √
(Z , -) √ X X X X
(Z , *) √ √ √ X X
(Z , /) X X X X X
(R , +) √ √ √ √ √
(R , -) √ X X X X
(R , *) √ √ √ X X
(R , /) X X X X X
(E , +) √ √ √ √ √
(E , * ) √ √ X X X
(O , +) X X X X X
(O , * ) √ √ √ X X
Determine whether the set together with binary operation * , is a semi-
group , monoid or a group . It is a set of real numbers with a * b = a+b+2.
Checking for Closure : Checking for Associativity :
a+b belongs to R (a*b)*c = (a + b + 2 ) *c
2 belongs to R = (a + b + 2 ) + c +2
a+b+2 belongs = a + (b + c + 2) +
to R 2
Hence , closure = a + (b * c) + 2
is satisfied Hence ,=associativity
a * (b *c) is satisfied

Checking for Inverse :

Checking for Identity :
a * a^-1 = e
a*e=a
a + a^-1 + 2 = e
a+e+2=a
a+ a^-1 + 2 = -2
e = -2 belongs to R
a^-1 = -a - 4
Hence , identity element exists
Hence , inverse
element exists

Hence , the set is a semigroup , monoid and and group

Prove that set of non-zero numbers form an Abelian group wrt binary operation * ,
where
* is all
for defined as
a , b belonging to
R
a * b = (ab/2)
Checking for Associativity :
Checking for Closure : (a*b)*c = (ab / 2 ) *c
ab belongs to R = ((ab / 2 ) c ) / 2
(1 / 2) belongs to R = (a (bc / 2)/ 2)
(ab)/ 2 belongs to R = a * (b * c)
Hence , closure is = a * (b *c)
satisfied Hence , associativity is satisfied
Checking for Identity :
a*e=a
( ae / 2 ) = a Checking for Inverse :
e = 2 belongs to R a * a^-1 = e
Hence , identity (a * a^-1 ) / 2 = 2
element exists a * a^-1 = 4
a^-1 = 4 / a
Hence , inverse
element exists

Hence , the set is a semigroup , monoid and and group

Prove that set of non-zero numbers form an Abelian group wrt binary operation * ,
where
* is all
for defined as
a , b belonging to
R
a * b = (ab/2)

Checking for Commutativity :

ab = (ab) / 2 belongs to R
= (ba) / 2
= b*a
Hence , commutativity is satisfied

Hence , the set is an Abelian group

State and prove

i. Left Cancellation Law

In a group (G,*) for all a,b,c belonging to G
if a*b = a*c implies b = c
------------------------------------------------------------------
Proof :

a belongs to G implies a^-1 belongs to G as G is a group and its inverse

exists Here , a * b = a * c
Multiplying a^-1 on both sides , we get

a^-1 * a * b = a^-1 * a * c
e*b=
e*c b
= c

ii. Right
Cancellation
Law
State and prove

iii. In a group (G,*) prove that identity element is unique

 Let e1 and e2 be two unique elements then by definition ,

a * e1 = a = e1 * a ----(1)
a * e2 = a = e2 * a ----(2)

From (1) and (2) ,

a * e1 = a * e2
e1 = e2

Therefore
identity element
is unique for any
group
State and prove

iv. Inverse of each element is unique in a group (G,*)

 Let a belong to G and its inverse is not unique . Suppose a1 and a2 are
two
inverses of a .
a * a1 = e = a1 * ---(1)
a ---(2)
a * a2 = e = a2 *
From
a (1) and
(2) , a * a1 = a *
a2
a1 = a2

Therefore ,
inverse of each
element is
unique in a
group .
State and prove

v. Every cyclic group is an Abelian Group

 Let (G,*) be a cyclic group and a be its generator element .

Let b , c belong to G such that b=a^m and c=a^n for some m,n belongs to

N b*c = a^m * a^n

= a^ m+n
= a^n * a^m
=c*b

Therefore , it is commutative and so abelian too.

State and prove

vi. Let (A,*) be a semi group and a belong to A. Consider the binary operation
of
+ such that For all x,y which belongs to A . x+y = x*a*y . Show that +
is associative operation

 x + ( y + z ) = x + (y * a * z)
= x * a * ( y * a * z)
= (x * a * y ) * a * z
=(x+y)+z

Therefore , it is associative .
State and prove

vii. Show that in a group for all a,b belonging to G . (a * b)^2 = a^2 * b^2 , if
and only if (G,*) must be Abelian .

 For all a,b belonging to G

(a*b)^2 = a^2 * b^2
(a*b) * (a*b) = (a*a) *
(b*b) a * (b*a) * b = a *
(a*b) * b
b*a = a*b – using left
and right
cancellation laws

Therefore , it is associative .