Binary Operation
Binary Operation
Binary Operation
Commutative
A binary operation ‘o’ on a set A is commutative
N={1,2,3,4,5,6,……}
(N,×) follows existence of identity .
There exist an identity element 1∈ N such that,
I ={……………………… -3,-2,-1,0,1,2,3,…………………….}
(I,+) follows existence of identity .
There exist an identity element 0∈ I such that,
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.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,
(I,+) is a group
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
𝟓