Binary Operation

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

Binary Operation

The binary operations ‘o’ on a non-empty set A are functions from


A × A to A. The binary operation, o: A × A → A. It is an operation of
two elements of the set whose domains and co-domain are in the
same set.
N ={1,2,3,……….} N={1,2,3…………………….}
N × N={(1,1),(1,2),(1,3)…….(2,1),(2,2),(2,3),……}
+: N × N → N

Properties of Binary Operation


Closure property: An operation ‘o’ on a non-empty set A has closure
property,
a ob∈A for all a , b ∈ A
Eg. The set of natural no follows closure law under operation
addition
N={1,2,3,4,5,6,……}
(N,+) closure law.
The addition of any two natural no is also a natural no.
i.e a + b ∈ N for all a , b ∈ N
3,4 ∈ N then 3+4 =7 ∈ N
The set of Even natural no under operation addition follows closure
law
E={2,4,6,………………………..}
The set of integer under operation addition follows closure law
The subtraction of integer follows closure law.
The set of rational no under operation addition follows closure law
The set of natural no under operation multiplication follows closure
law
The set of natural no under operation division does not follows
closure law
The set of odd integer does not follow closure law under operation
addition.
The set of natural no under operation subtraction does not follow
closure law.

Commutative
A binary operation ‘o’ on a set A is commutative

if a o b = b o a, for all a, b ∈ A (non-empty set).

The set of natural no follows commutative law under operation


addition
N={1,2,3,4,5,6,……}
(N,+) follows commutative law.
The addition of any two natural no is follows commutative law.
i.e a + b = b+a for all a , b ∈ N
3,4 ∈ N then
3+4 =4+3
7=7
The set of natural no under operation division does not follow
commutative law.
The set of natural no under operation subtraction does not follow
commutative law.
The set of natural no under operation multiplication follow
commutative law.
The set of integer under operation multiplication follow commutative
law.
Associative
A binary operation ‘o’ on a set A is Associative

if a o (b o c) = (a o b) o c, where a, b,c ∈ A (non-empty set).

The set of natural no follows associative law under operation


addition
N={1,2,3,4,5,6,……}
(N,+) follows Associative law .
The set of natural follows associative law under operation
addition
i.e a + (b +c)=(a+b) +c where a , b,c ∈ N
3,4,5 ∈ N then
3+(4 +5)=(3+4)+5
3+9=7+5
12=12
The set of integer follows associative law under operation
multiplication.
Existence of identity : A binary operation ‘o’ on a set A is follows
existence of identity if there exist an identity element e ∈ A such
that,

a o e = e o a = a, for all a ∈ A (non-empty set).


The set of natural no follows existence of identity under operation
multiplication.

N={1,2,3,4,5,6,……}
(N,×) follows existence of identity .
There exist an identity element 1∈ N such that,

i.e 𝑎 × 1 = 1 × 𝑎 = 𝑎 for all a ∈ N


if 5 ∈ N then
5× 1 = 1 × 5 = 5
The set of integer follows existence of identity under operation
addition.

I ={……………………… -3,-2,-1,0,1,2,3,…………………….}
(I,+) follows existence of identity .
There exist an identity element 0∈ I such that,

i.e a +0 = 0 + 𝑎 = 𝑎 for all a ∈ I


if 5 ∈ I then
5+0 = 0 + 5 = 5

The set of natural no does not follow existence of identity under


operation addition.

The set Even integer under operation addition follows Existence of


identity
E= {……………………-4,-2,0,2,4,…………………..}
Existence of inverse
A binary operation ‘o’ on a set A is follows existence of inverse if
there exist an inverse of ‘𝑎’ is ‘𝑎−1 ’ such that,

𝑎 𝑜 𝑎−1 = 𝑎−1 𝑜 𝑎 = 𝑒 for all 𝑎, 𝑎−1 ∈ A (non-empty set).

The set of integer follows existence of inverse under operation


addition.

I={ ……….. ,-3,-2,-1.0,1,2,3,……….}

(I,+) follows existence of inverse

There exist an inverse of 𝑎 𝑖𝑠 (−𝑎)𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡,

𝑎 + (−𝑎) = (−𝑎) + 𝑎 = 0 for all 𝑎, −𝑎 ∈ I


Eg. 5 ∈ I then -5∈ I such that,
5+(-5)=(-5) +5=0
1 1
𝑎 ×𝑎 =𝑎× 𝑎 =1

The set integer does not follows existence of inverse under


operation multiplication.
1 1
𝑎 × = × 𝑎 = 1 here a ∈ I
𝑎 𝑎
1
But 𝑎 𝑛𝑜𝑡 𝑏𝑒𝑙𝑜𝑛𝑔 𝑡𝑜 𝐼𝑛𝑡𝑒𝑔𝑒𝑟

Distributive law
A binary operation ‘o’ and ‘*’ on a set A is Distributive if
(i) a*(b o c) =(a*b) o (a*c)
(ii) (a o b) * c = (a*c) o (b*c)
Where a,b,c∈ A
Eg. The multiplication of integer with respect to addition follows
distributive law.

I={ ……….. ,-3,-2,-1.0,1,2,3,……….}

i.e. (i) 𝒂 × (𝒃 + 𝒄) = 𝒂 × 𝒃 + 𝒂 × 𝒄
(ii) (𝒂 + 𝒃) × 𝒄 = 𝒂 × 𝒄 + 𝒃 × 𝒄
Eg.
5,6,7∈ I then
5× (6 + 7) = 5 × 6 + 5 × 7
5× (13) = 30 + 35
65=65

Group :Let G be the non empty set and ‘o’ be the binary operation
defined over it then G together operation ‘o’ is denoted by (G,o) and
called Group if the following laws are satisfied
(i) Closure :
a ob∈G for all a , b ∈ G
(ii) Associative
ao(b o c) =(a o b) oc where a, b , c ∈ G
(iii) Existence of identity
there exist an identity element e ∈ G such that,

a o e = e o a = a, for all a ∈ G
(iv) Existence of inverse
there exist an inverse of ‘𝑎’ is ‘𝑎−1 ’ such that,

𝑎 𝑜 𝑎−1 = 𝑎−1 𝑜 𝑎 = 𝑒 for all 𝑎, 𝑎−1 ∈ G

Eg The set of integer is a group under operation addition

To prove that the set of integer is a group under operation


addition.

I={ ……….. ,-3,-2,-1,0,1,2,3,……….}

We have have to show that,,

(I,+) is a group

(i) Closure : The addition of two integer is also an integer


i.e a + b ∈ I for all a,b ∈ I
eg. 5,6 ∈ I then
5+6 =11∈ I
(ii) Associative
The set of integer follows associative law under operation
addition.
a+(b+c) =(a+b) +c where a, b,c ∈ I
5,6,7 ∈ I
Then
5+(6+7) =(5+6) +7
5+13=11+7
18 =18
(iii) Existence of identity : there exist an identity element 0∈ I
such that 𝑎 + 0 = 0 + 𝑎 = 𝑎 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑎 ∈ I
Eg if 5∈ I then
5+0=0+5 =5
(iv) Existence of inverse : There exist an inverse 𝒂 𝒊𝒔
−𝒂 𝒔𝒖𝒄𝒉 𝒕𝒉𝒂𝒕
𝒂 + (−𝒂) = (−𝒂) + 𝒂 = 𝟎
Eg. 5∈ I then -5∈ I such that 5+(-5)= (-5) +5 =0
To prove that the set of integer is not a group under operation
multiplication.
I={ ……….. ,-3,-2,-1,0,1,2,3,……….}

We have have to show that,,

(I,×) is not a group

(i) Closure : The multiplication of two integer is also an


integer
i.e a × b ∈ I for all a,b ∈ I
eg. 5,6 ∈ I then
5×6 =30∈ I
(ii) Associative
The set of integer follows associative law under operation
multiplication.
a×(b×c) =(a×b) ×c where a, b,c ∈ I
5,6,7 ∈ I
Then
5× (6×7) =(5×6) ×7
5× 𝟒𝟐=30×7

210 =210
(iii) Existence of identity : there exist an identity element 1∈ I
such that 𝑎 × 1 = 1 × 𝑎 = 𝑎 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑎 ∈ I
Eg if 5∈ I then
5× 𝟏=1×5 =5
(iv) Existence of inverse : There exist an inverse 𝒂 𝒊𝒔
𝟏
𝒔𝒖𝒄𝒉 𝒕𝒉𝒂𝒕
𝒂
𝟏 𝟏
𝒂× = ×𝒂= 𝟏
𝒂 𝒂
𝟏
Here 𝑎 ∈ I but ∉ I
𝒂
𝟏
Eg. In multiplication the inverse of 5 is 𝟓 𝒔𝒖𝒄𝒉 𝒕𝒉𝒂𝒕,
𝟏 𝟏
𝟓× = ×𝟓= 𝟏
𝟓 𝟓
𝟏
Here 𝟓 ∈ I but ∉ I
𝟓

So it is not follow existence of inverse


Hence the set of integer is not a group under operation
multiplication
To prove that the set of Even Integer is a group under operation
addition

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy