Question
Question: If * is a binary operation defined on \(A=N\times N\) by (a,b)*(c,d)=(a+c,b+d), then prove that * is...
If * is a binary operation defined on A=N×N by (a,b)*(c,d)=(a+c,b+d), then prove that * is both commutative and associative.
Solution
Hint: We are given the definition of a binary operation on the set A=N×N i.e. the set of all ordered pairs in which both the components belong to N, the set of natural numbers. We are asked to prove that it is commutative and associative. Therefore, to prove commutativity, we should interchange the order of the elements while taking the relation and prove that the value remains the same, i.e. we should prove that (a,b)(c,d)= (c,d)(a,b). Similarly, for associativity we should prove that (a,b)((c,d)(e,f))= ((a,b)(c,d))(e,f) i.e. the order in which the relation is taken does not matter and the value remains the same in any order we take the operations.
Complete step-by-step answer:
We are given that the binary operation is defined on the set A=N×N i.e. the set of all ordered pairs in which both the components belong to N, the set of natural numbers. The definition of the binary operation is
(a,b)∗(c,d)=(a+c,b+d).................(1.1)
i.e. the first and second component of the final ordered pair is the sum of the first components and second components of the two elements on which the binary operation is taken respectively. We also know that the set of Natural numbers, N is commutative and associative, i.e. for arbitrary elementsp,q,r∈N ,
p+q=q+p.................................(1.2)(p+q)+r=p+(q+r)................................(1.3)
To prove that the binary operation is commutative, we should prove that for arbitrary elements (a,b) and (c,d) belonging to A, (a,b)∗(c,d)= (c,d)∗(a,b)......................(1.4)
To prove it use the definition of the operation in (1.1) and use (1.2) to write