Question
Question: Let \(A=R\times R\) and \(*\) be a binary operation on \(A\) defined by \(\left( a,b \right)*\lef...
Let A=R×R and ∗ be a binary operation on A defined by
(a,b)∗(c,d)=(a+c,b+d). Show that ∗ is commutative and associative. Find the identity element for ∗ on A .Also find the inverse of every element (a,b)∈A.
Solution
Here in this question we will try to show that ∗ is commutative and associative binary operation, by using the definitions for ∗ to be commutative it should obey that (a,b)∗(c,d)=(c,d)∗(a,b) and for ∗ to be associative it should obey ((a,b)∗(c,d))∗(e,f)=(a,b)∗((c,d)∗(e,f)).
For identity element and inverse of each element (a,b)∈A for ∗ binary operation on A, we have to consider (a,b)∗(x,y)=(a,b)for (x,y)to be identity element and (a,b)∗(x,y)=(0,0) for (x,y)to be inverse of each element (a,b)∈A for ∗ binary operation on A.
Complete step by step answer:
Here in this question we have A=R×R and ∗ be a binary operation on A defined by
(a,b)∗(c,d)=(a+c,b+d).
For ∗ to be commutative, we have to show that (a,b)∗(c,d)=(c,d)∗(a,b).
(a,b)∗(c,d)=(a+c,b+d)
And from the definition we can say that
(c,d)∗(a,b)=(c+a,d+b).
Here, we observe that(a,b)∗(c,d)=(c,d)∗(a,b).
Hence, we can say that ∗ is commutative binary operation on A.
For ∗ to be associative, we have to show that ((a,b)∗(c,d))∗(e,f)=(a,b)∗((c,d)∗(e,f)).
We have,
(a,b)∗(c,d)=(a+c,b+d).
And from the definition we can say that
((a,b)∗(c,d))∗(e,f)=(a+c,b+d)∗(e,f)=(a+c+e,b+d+f)
And from the definition we can also say that
(a,b)∗((c,d)∗(e,f))=(a,b)∗(c+e,d+f)⇒(a+c+e,b+d+f)
Here, we observe that ((a,b)∗(c,d))∗(e,f)=(a,b)∗((c,d)∗(e,f)).
Hence, we can say that ∗ is associative binary operation on A.
From, the definition of identity element for ∗ onA, we can say that the identity element for ∗ onA is (x,y), if there exists (x,y) such that (a,b)∗(x,y)=(a,b).
Let us simplify the (a,b)∗(x,y)=(a,b)
(a,b)∗(x,y)=(a+x,b+y)⇒(a,b)
This occurs only when x=0,y=0. So we can say that (0,0) is the identity element for ∗ binary operation on A.
From, the definition of inverse of every element (a,b)∈A for ∗ binary operation on A, we can say that the inverse element for∗ onAis(x,y), if there exists (x,y) such that (a,b)∗(x,y)=(0,0).
Let us simplify the (a,b)∗(x,y)=(0,0)
(a,b)∗(x,y)=(a+x,b+y)⇒(0,0)
This occurs only whenx=−a,y=−b. So we can say that (−a,−b) is the inverse of every element (a,b)∈A for∗ binary operation on A.
So, the correct answer is “Option A”.
Note: Here in this question for ∗ to be commutative, we have to show that(a,b)∗(c,d)=(c,d)∗(a,b). If we take “+” as not a commutative operation it will lead us to a completely different answer, so here we should be clear that “+” is a commutative operation.