Lecture 2.2.
1
Definition, Elementary properties of algebraic
structures
Course outcome to be covered:
CO1: Apply and recognized about the Definition, Elementary
properties of algebraic structures
Algebraic Structure
A non-empty set G equipped with one or more binary operations is
said to be an algebraic structure. Suppose * is a binary operation
on G. Then (G, *) is an algebraic structure. (N,*), (1, +), (1, -) are
all the algebraic structure. Here, (R, +, .) is an algebraic
structure equipped with two operations.
Binary operation on a set
Suppose G is a non-empty set. The G X G = {(a,b) : a E G, b E G)}.
If f : G X G → G then f is called a binary operation on a set G. The
image of the ordered pair (a,b) under the function f is denoted by afb.
A binary operation on asset G is sometimes also said to be the binary
composition in the set G. If * is a binary composition in G then, a * b
E G, a, b E G. Therefore g is closed with respect to the composition
denoted by *.
Example:
An addition is a binary operation on the set N of natural number. The
sum of two natural number is also a natural number. Therefore, N is a
natural number with respect to addition i.e. a+b.
Subtraction is not a binary operation on N. We have 4 – 7 = 3 not
belong to N whereas 4 E N. thus, N is not closed with respect to
subtraction, but subtraction is a binary operation on the set of an
integer.
Properties of an algebraic structure
By a property of an algebraic structure, we mean a property
possessed by any of its operations. Important properties of an
algebraic system are:
1. Associative and commutative laws
An operation * on a set is said to be associative or to satisfy the
associative law if, for any elements a, b , c in S we have (a * b) * c =
a * (b * c )
An operation * on a set S is said to be commutative or satisfy the
commutative law if, a * b = b * a for any element a, b in S.
2. Identity element and inverse
Consider an operation * on a set S. An element e in S is called an
identity elements for * if for any elements a in S - a * e = e * a = a
Generally, an element e is called a left identity or a right identity
according to as e *a or a * e = a where a is any elements in S.
Suppose an operation * on a set S does have an identity element e.
The inverse of an element in S is an element b such that: a * b = b * a
=e
3. Cancellation laws
An operation * on a set S is a said to satisfy the left cancellation law
if, a * b = a * c implies b = c and is said to satisfy the right
cancellation law if, b * a = c * a implies b = c
Algebraic Structure
A non empty set S is called an algebraic structure w.r.t binary
operation (*) if it follows following axioms:
Closure:(a*b) belongs to S for all a ,b ∈ S.
Ex : S = {1,-1} is algebraic structure under *
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.
Semi Group
A non-empty set S, (S,*) is called a semigroup if it follows the
following axiom:
Closure:(a*b) belongs to S for all a, b ∈ S.
Associativity: a*(b*c) = (a*b)*c ∀ a, b ,c belongs to S.
Note: A semi group is always an algebraic structure.
Ex : (Set of integers, +), and (Matrix ,*) are examples of semigroup.
Monoid
A non-empty set S, (S,*) is called a monoid if it follows the following
axiom:
Closure:(a*b) belongs to S for all a, b ∈ S.
Associativity: a*(b*c) = (a*b)*c ∀ a, b, c belongs to S.
Identity Element: There exists e ∈ S such that a*e = e*a = a ∀
a∈S
Note: A monoid is always a semi-group and algebraic structure.
Ex : (Set of integers,*) is Monoid as 1 is an integer which is also
identity element .
(Set of natural numbers, +) is not Monoid as there doesn’t exist any
identity element. But this is Semigroup.
But (Set of whole numbers, +) is Monoid with 0 as identity element.
Group
A non-empty set G, (G,*) is called a group if it follows the following
axiom:
Closure:(a*b) belongs to G for all a, b ∈ G.
Associativity: a*(b*c) = (a*b)*c ∀ a, b, c belongs to G.
Identity Element: There exists e ∈ G such that a*e = e*a = a ∀
a∈G
Inverses:∀ a ∈ G there exists a-1 ∈ G such that a*a-1 = a-1*a
=e
Note:
1. A group is always a monoid, semigroup, and algebraic structure.
2. (Z,+) and Matrix multiplication is example of group.
Abelian Group or Commutative group
A non-empty set S, (S,*) is called a Abelian group if it follows the
following axiom:
Closure:(a*b) belongs to S for all a, b ∈ S.
Associativity: a*(b*c) = (a*b)*c ∀ a ,b ,c belongs to S.
Identity Element: There exists e ∈ S such that a*e = e*a = a ∀
a∈S
Inverses:∀ a ∈ S there exists a-1 ∈ S such that a*a-1 = a-1*a =
e
Commutative: a*b = b*a for all a, b ∈ S
For finding a set lies in which category one must always check
axioms one by one starting from closure property and so on.
Here are the some important results-
Must Satisfy Properties
Algebraic
Closure
Structure
Semi Group Closure, Associative
Monoid Closure, Associative, Identity
Group Closure, Associative, Identity, Inverse
Closure, Associative, Identity, Inverse,
Abelian Group
Commutative
Here a Table with different non empty set and operation
N=Set of Natural Number
Z=Set of Integer
R=Set of Real Number
E=Set of Even Number
O=Set of Odd Number
M=Set of Matrix
+,-,×,÷ are the operations.
Algebrai
Semi Grou Abelian
Set, Operation c Monoid
Group p Group
Structure
N,+ Y Y X X X
N,- X X X X X
N,× Y Y Y X X
N,÷ X X X X X
Z,+ Y Y Y Y Y
Z,- Y X X X X
Z,× Y Y Y X X
Z,÷ X X X X X
R,+ Y Y Y Y Y
R,- Y X X X X
R,× Y Y Y X X
R,÷ X X X X X
E,+ Y Y Y Y Y
E,× Y Y X X X
O,+ X X X X X
O,× Y Y Y X X
M,+ Y Y Y Y Y
M,× Y Y Y X X
eBook Discrete Mathematics :
https://www.javatpoint.com/algebraic-structure-in-discrete-
mathematics
Video link: https://www.youtube.com/watch?v=4V_KYo6sMJs
