Algebraic Structure

The algebraic structure is a type of non-empty set G which is equipped with one or more
than one binary operation. Let us assume that * describes the binary operation on non-
empty set G. In this case, (G, *) will be known as the algebraic structure. (1, -), (1, +), (N, *)
all are algebraic structures.

(R, +, .) is a type of algebraic structure, which is equipped with two operations (+ and .)

Binary Operation of Set

In the binary operation, binary stands for two. A binary operation is a type of operation
that needs two inputs, which are known as the operands. When we perform multiplication,
division, addition, or subtraction operations on two numbers, then we will get a number.
The two elements of a set are associated with binary operations. The result of these two
elements will also be in the same set. So we can say that if we perform a binary operation
on a set, then it will perform calculations that combine two elements of the set and generate
another element that belongs to the same set.

Let us assume that there is a non-empty set called G. A function f from G × G to G is

known as the binary operation on G. So f: G × G → G defines a binary operation on G.

Examples of Binary operation

In this example, we will take the two natural numbers or two real numbers and perform
binary operations such as addition, multiplication, subtraction, and division on these
numbers. The algebraic operation on two natural numbers or real numbers will generate a
result. If we get a natural number or real number as a result, then we will consider that
binary operation in our set.

Addition:

We will learn about addition, which is a binary operation. Suppose we have two natural
numbers(a, b). Now if we add these numbers, then it will generate a natural number as a
result. For example: Suppose there are 6 and 8 two natural numbers and the addition of
these numbers are

6 + 8 = 14

Hence, the result 14 is also a natural number. So, we will consider an addition in our set.
The same process will be followed for real numbers as well.
+: N + N → N is derived by (a, b) → a + b
+: R + R → R is derived by (a, b) → a + b

Multiplication:

Now we will learn multiplication, which is a binary operation. If we multiply two natural
numbers (a, b), then it will generate a natural number as a result. For example: Suppose
there are 10 and 5 two natural numbers and the multiplication of these numbers are:

10 * 5 = 50

Hence, the result 50 is also a natural number. So we will consider multiplication in our set.
The same process will be followed for real numbers as well.

+: N × N → N is derived by (a, b) → a × b
+: R × R → R is derived by (a, b) → a × b

Subtraction:

Now we will learn subtraction, which is a binary operation. If we subtract two real
numbers (a, b), then it will also generate a real number as a result. The same process will
not be followed for natural numbers, because if we take two natural numbers to perform
binary subtraction, then it is not compulsory that it will generate a natural number. For
example: Suppose we take two natural numbers 5 and 7 and the subtraction of these
numbers are

5 - 7 = -2

Hence, the result is not a natural number. So we will not consider subtraction in our set.

- : R x R → R is derived by (a, b)→ a - b

Division

Now we will learn division, which is a binary operation. If we divide two real numbers (a,
b), then it will also generate a real number as a result. The same process will not be
followed for natural numbers, because if we take two natural numbers to perform binary
division, then it is not compulsory that it will generate a natural number. For
example: Suppose we take two natural numbers 10 and 6 and the division of these numbers
is

10/6 = 5/3
Hence, the result 5/3 is not a natural number. So we will not consider division in our set.

- : R - R → R is derived by (x, y) → x - y

Properties of Algebraic structure

Commutative: Suppose set G contains a binary operation *. The operation * is called to be
commutative in G if it holds the following relation:

x * y= y * x for all x, y in G

Associative: Suppose set G contains a binary operation *. The operation * is called to be

associative in G if it holds the following relation:

(x*y)*z = x *( y*z) for all x, y, z in G

Identity: Suppose we have an algebraic system (G, *) and set G contains an element e. That
element will be called an identifying element of the set if it contains the following relation:

x * e = e * x = x for all x

Here, element e can be referred to as an identity element of G, and we can also see that it is
necessarily unique.

Inverse: Suppose there is an algebraic system (G, *), and it contains an identity e. We will
also assume that the set G contains the elements x and y. The element y will be called an
inverse of x if it satisfies the following relation:

x*y=y*x=e

Here, element x can also be referred to as inverse of y, and we can also see that it is
necessarily unique. The inverse of x can also be referred to as x-1 like this:

x * x-1 = x-1 * x = e

Cancellation Law: Suppose set G contains a binary operation *. The operation * is called to
be left cancellation law in G if it holds the following relation:

x * y = x * z implies y = z

It will be called the right cancellation law if it holds the following relation:

y * x = z * x implies y = z
Types of Algebraic structure
There are various types of algebraic structure, which is described as follows:

o Semigroup
o Monoid
o Group
o Abelian Group

All these algebraic structures have wide application in particular to binary coding and in
many other disciplines.

Semi Group

Suppose there is an algebraic structure (G, *), which will be known as semigroup if it
satisfies the following condition:

o Closure: The operation * is a closed operation on G that means (a*b) belongs to set
G for all a, b ∈
o Associative: The operation * shows an association operation between a, b, and c that
means a*(b*c) = (a*b)*c for all a, b, c in G.

Note: An algebraic structure is always shown by semigroup.

Example 1:

The examples of semigroup are (Matrix, *) and (Set of integer, +).

Example 2:

The semigroup contains a set of positive integers with an additional or multiplication

operation. The positive integers will not contain zero. For example: Suppose we have a set
G, which contains some positive integers except zero such as 1, 2, 3, and so on like this:

G = {1, 2, 3, 4, 5, …..}
o This set contains the closure property because according to closure property (a * b)
belongs to G for every element a, b. So in this set, (1*2) = 2 ∈
 o This set also contains the associative property because according to associative
property (a + b) + c = a + (b + c) belongs to G for every element a, b, c. So in this set,
(1 + 2) + 3 = 1 + (2 + 3) = 6 ∈

Monoid:

A monoid is a semigroup, but it contains an extra identity element (E or e). An algebraic

structure (G, *) will be known as a monoid if it satisfies the following condition:

o Closure: G is closed under operation * that means (a*b) belongs to set G for all a, b
∈
o Associative: Operation * shows an association operation between a, b, and c that
means a*(b*c) = (a*b)*c for all a, b, c in G.
o Identity Element: There must be an identity in set G that means a * e = e * a = a for
all x.

Note: An algebraic structure and a semigroup are always shown by a monoid.

Example 1:

In this example, we will take (Set of integers, *), (Set of natural numbers, +), and (Set of
whole numbers, +). Where

o Monoid is shown by (Set of Integers, *) because 1 is an integer and it is also an

identity element.
o Monoid is not shown by (Set of natural numbers, +) because there is not an identity
element, but it is a semigroup.
o Monoid is shown by (Set of whole numbers, +) because it contains 0 as the identity
element.

Example 2:

The monoid contains a set of positive integers with additional or multiplication operations
except zero. For example: Suppose we have a set G, which contains some positive integers
like 1, 2, 3, and so on like this:

G = {1, 2, 3, 4, 5, …..}
o This set contains the closure property because according to closure property (a * b)
belongs to G for every element a, b. So in this set, (1*2) = 2 and so on.
 o This set contains the associative property because according to associative property
(a + b) + c = a + (b + c) belongs to G for every element a, b, c. So in this set, (1 + 2) +
3 = 1 + (2 + 3) = 5, and so on.
o This set also contains the identity property because according to this property a * e
= e * a = a, where a ∈ So in this set, (2 × 1) = 2, (3 × 1) = 3, and so on. In our case, 1 is
the identity element.

Group:

A Group is a monoid, but it contains an extra inverse element, which is denoted by 1. An

algebraic structure (G, *) will be known as a group if it satisfies the following condition:

o Closure: G is closed under operation * that means (a*b) belongs to set G for all a, b
∈
o Associative: * shows an association operation between a, b, and c that means a*(b*c)
= (a*b)*c for all a, b, c in G.
o Identity Element: There must be an identity in set G that means a * e = e * a = a for
all a.
o Inverse Element: It contains an inverse element that means a * a-1= a-1 * a = e for a ∈

Note: An algebraic structure, semigroup, and monoid are always shown by a Group.

Example 1:

The examples of group are Matrix multiplication and (Z, +).

Example 2:

In this example, we will use the matrix multiplication operation on the set of non-singular
matrices N × N from a group.

o If we perform multiplication of non-singular matrices N × N, then it will also be a

non-singular matrix N × N, which holds the property of closure.
o Matrix multiplication itself holds the property of association. So it is also
associative.
o The identity matrix is contained in the set of non-singular matrices N × N, which
holds the property of identity element.
 o As we have seen that all the matrices are non-singular. So they will contain the
inverse elements, which will be also non-singular matrices. Hence, it also holds the
property of inverse.

TYPES OF GROUP-

Finite :
A group (G, *) is called a finite group if G is a finite set.

Example: The group (I, +) is an infinite group as the set I of integers is an infinite set.

Infinite Group
A group (G, *) is called a infinite group if G is an infinite set.

Example: The group G = {1, 2, 3, 4, 5, 6, 7} under multiplication modulo 8 is a finite

group as the set G is a finite set.

Abelian Group

An abelian group is a group, but it contains commutative law. An algebraic structure (G, *)
will be known as an abelian group if it satisfies the following condition:

o Closure: G is closed under operation * that means (a*b) belongs to set G for all a, b
∈
o Associative: * shows an association operation between a, b, and c that means a*(b*c)
= (a*b)*c for all a, b, c in G.
o Identity Element: There must be an identity in set G that means a * e = e * a = a for
all a.
o Inverse Element: It contains an inverse element that means a * a-1= a-1 * a = e for a ∈
o Commutative Law: There will be a commutative law such that a * b = b * a such
that a, b belongs to G.

Note: (Z, +) is an Abelian group because it is commutative, but matrix multiplication is not
commutative that's why it is not an abelian group.
Example: Suppose we have a set G, which contains some positive integers except zero such
as 1, 2, 3, and so on with additional operations like this:

G = {1, 2, 3, 4, 5, …..}
o This set contains the closure property because according to closure property (a + b)
belongs to G for every element a, b. So in this set, (1 + 2) = 2 ∈ G and so on.
o This set also contains the associative property because according to associative
property (a + b) + c = a + (b + c) belongs to G for every element a, b, c. So in this set,
(1 + 2) + 3 = 1 + (2 + 3) = 6 ∈ G and so on.
o This set also contains the identity property because according to this property (a * e)
= a, where a ∈ So in this set, (2 × 1) = 2, (3 × 1) = 3, and so on. In our case, 1 is the
identity element.
o This set also contains the commutative property because according to this property
(a * b) = (b * a), where a, b ∈ So in this set, (2 × 3) = (3 × 2) = 6 and so on.

NOTE

Must Satisfy Properties

Algebraic Structure Closure

Semi Group Closure, Associative

Monoid Closure, Associative, Identity

Group Closure, Associative, Identity, Inverse

Abelian Group Closure, Associative, Identity, Inverse, Commutative

Every abelian group is a group, monoid, semigroup, and algebraic structure.

Here is a Table with different nonempty set and operation:
N=Set of Natural Number
Z=Set of Integer
R=Set of Real Number
Q= set of all rational numbers
E=Set of Even Number
O=Set of Odd Number
M=Set of Matrix
+,-,×,÷ are the operations.

Algebraic Semi Abelian

Set, Operation Structure GroupMonoidGroup Group

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
 Algebraic Semi Abelian
Set, Operation Structure GroupMonoidGroup Group

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

RING

Ring – Let addition (+) and Multiplication (.) be two binary operations defined
on a non empty set R. Then R is said to form a ring w.r.t addition (+) and
multiplication (.) if the following conditions are satisfied:
1. (R, +) is an abelian group ( i.e commutative group)
2. (R, .) is a semigroup
3. For any three elements a, b, c R the left distributive law a.(b+c) =a.b +
a.c and the right distributive property (b + c).a =b.a + c.a holds.

We have some postulates that need to be satisfied. These postulates are described as
follows:

R1
The algebraic group is described by the system (R, +). So it contains some properties,
which is described as follow

1. Closure Property

In the closure property, the set R will be called for composition '+' like this:

x ∈R, y ∈R => x+y ∈ R for all x, y ∈ R

2. Association

In association law, the set R will be related to composition '+' like this:

(x+y) + z = x + (y+z) for all x, y, z ∈ R.

3. Existence of identity

Here, R is used to contain an additive identity element. That element is known as zero
elements, and it is denoted by 0. The syntax to represent this is described as follows:

x+ y = x = 0 + x, x ∈ R

4. Existence of inverse

In existence of inverse, the elements x ∈ R is exist for each x ∈ R like this:

x + (-x) = 0 = (-x) + x

5. Commutative of addition

In the commutative law, the set R will represent for composition + like this:

x + y = y + x for all x, y ∈ R

R2
Here, the set R is closed under multiplication composition like this:

xy ∈ R
R3
Here, there is an association of multiplication composition like this:

(x.y).z = x.(y.z) for all x, y, z ∈ R

R4
There is left and right distribution of multiplication composition with respect to addition,
like this:

Right distributive law

(y + z). x = y.x + z.x

Left distributive law

x.(y + z) = x.y + x.z

Types of Ring
There are various types of rings, which is described as follows:

Null ring

A ring will be called a zero ring or null ring if singleton (0) is using with the binary
operator (+ or *). The null ring can be described as follows:

0 + 0 = 0 and 0.0 = 0

Commutative ring

The ring R will be called a commutative ring if multiplication in a ring is also a

commutative, which means x is the right divisor of zero as well as the left divisor of zero.
The commutative ring can be described as follows:

x.y = y.x for all x, y ∈ R

The ring will be called non-commutative ring if multiplication in a ring is not
commutative.

Ring with unity

The ring will be called the ring of unity if a ring has an element e like this:

e.x = x.e = x for all R

Where

e can be defined as the identity of R, unity, or units elements.

Ring with zero divisor

If a ring contains two non-zero elements x, y ∈ R, then the ring will be known as the
divisor of zero. The ring with zero divisors can be described as follows:

y.x = 0 or x.y = 0

Where

x and y can be said as the proper divisor of zero because in the first case, x is the right
divisor of zero, and in the second case, x is the left divisor of zero.

0 is described as additive identity in R

Ring without zero divisor

If products of no two non-zero elements is zero in a ring, the ring will be called a ring
without zero divisors. The ring without zero elements can be described as follows:

xy = 0 => x = 0 or y = 0

Properties of Rings
All x, y, z ∈ R if R is a ring

1. (-x)(-y) = xy
2. x0 = 0x = 0
3. (y-z)x = yx- zx
4. x(-y) = -(xy) = (-x)y
5. x(y-z) = xy - xz