Consider the binary operations $^*: R \times R \rightarrow R$ and $o: R \times R \rightarrow R$ defined as $a \,^*\, b = |a-b|$ and $a \,o\, b = a$,$\forall \, a, b \in R$. Show that $^*$ is commutative but not associative,and $o$ is associative but not commutative. Further,show that $\forall \, a, b, c \in R, a \,^*\, (b \,o\, c) = (a \,^*\, b) \,o\, (a \,^*\, c)$. [If it is so,we say that the operation $^*$ distributes over the operation $o$]. Does $o$ distribute over $^*$? Justify your answer.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(A) Given $a \,^*\, b = |a-b|$ and $a \,o\, b = a$ for all $a, b \in R$.
For $^*$,$a \,^*\, b = |a-b|$ and $b \,^*\, a = |b-a| = |-(a-b)| = |a-b|$. Since $a \,^*\, b = b \,^*\, a$,$^*$ is commutative.
For associativity of $^*$,consider $(1 \,^*\, 2) \,^*\, 3 = |1-2| \,^*\, 3 = 1 \,^*\, 3 = |1-3| = 2$,while $1 \,^*\, (2 \,^*\, 3) = 1 \,^*\, |2-3| = 1 \,^*\, 1 = |1-1| = 0$. Since $2 \neq 0$,$^*$ is not associative.
For $o$,$1 \,o\, 2 = 1$ and $2 \,o\, 1 = 2$. Since $1 \neq 2$,$o$ is not commutative.
For associativity of $o$,$(a \,o\, b) \,o\, c = a \,o\, c = a$ and $a \,o\, (b \,o\, c) = a \,o\, b = a$. Since both sides equal $a$,$o$ is associative.
For distributivity of $^*$ over $o$,$a \,^*\, (b \,o\, c) = a \,^*\, b = |a-b|$ and $(a \,^*\, b) \,o\, (a \,^*\, c) = |a-b| \,o\, |a-c| = |a-b|$. Thus,$^*$ distributes over $o$.
For distributivity of $o$ over $^*$,consider $1 \,o\, (2 \,^*\, 3) = 1 \,o\, |2-3| = 1 \,o\, 1 = 1$,while $(1 \,o\, 2) \,^*\, (1 \,o\, 3) = 1 \,^*\, 1 = |1-1| = 0$. Since $1 \neq 0$,$o$ does not distribute over $^*$.

Explore More

Similar Questions

Show that the operation $*: R \times R \rightarrow R$ defined by $a * b = a + 2b$ is not associative.

For each binary operation $^*$ defined below,determine whether $^*$ is commutative or associative. On $Z^+$,define $a ^* b = a^b$.

Let $*^{\prime}$ be the binary operation on the set $\{1, 2, 3, 4, 5\}$ defined by $a *^{\prime} b = \text{H.C.F. of } a \text{ and } b$. Is the operation $*^{\prime}$ same as the operation $*$ defined in Exercise $4$ above? Justify your answer.

Let $P$ be the set of all subsets of a given set $X$. Show that $\cup: P \times P \rightarrow P$ given by $(A, B) \rightarrow A \cup B$ and $\cap: P \times P \rightarrow P$ given by $(A, B) \rightarrow A \cap B$ are binary operations on the set $P$.

We define a binary relation $\sim$ on the set of all $3 \times 3$ real matrices as $A \sim B$ if and only if there exist invertible matrices $P$ and $Q$ such that $B = P A Q^{-1}$. The binary relation $\sim$ is

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo