Show that the relation R in R defined as R = {(a, b): a ≤ b}, is reflexive and transitive but not symmetric.
R = {(a, b); a ≤ b}
Clearly (a, a) ∈ R as a = a.
∴R is reflexive.
Now,
(2, 4) ∈ R (as 2 < 4)
But, (4, 2) ∉ R as 4 is greater than 2.
∴ R is not symmetric.
Now, let (a, b), (b, c) ∈ R.
Then,
a ≤ b and b ≤ c
⇒ a ≤ c
⇒ (a, c) ∈ R
∴R is transitive.
Hence, R is reflexive and transitive but not symmetric.
Bittu and Chintu were partners in a firm sharing profit and losses in the ratio of 4 : 3. Their Balance Sheet as at 31st March, 2024 was as follows:
On 1st April, 2024, Diya was admitted in the firm for \( \frac{1}{7} \)th share in the profits on the following terms:
Prepare Revaluation Account and Partners' Capital Accounts.
Relation is said to be empty relation if no element of set X is related or mapped to any element of X i.e, R = Φ.
A relation R in a set, say A is a universal relation if each element of A is related to every element of A.
R = A × A.
Every element of set A is related to itself only then the relation is identity relation.
Let R be a relation from set A to set B i.e., R ∈ A × B. The relation R-1 is said to be an Inverse relation if R-1 from set B to A is denoted by R-1
If every element of set A maps to itself, the relation is Reflexive Relation. For every a ∈ A, (a, a) ∈ R.
A relation R is said to be symmetric if (a, b) ∈ R then (b, a) ∈ R, for all a & b ∈ A.
A relation is said to be transitive if, (a, b) ∈ R, (b, c) ∈ R, then (a, c) ∈ R, for all a, b, c ∈ A
A relation is said to be equivalence if and only if it is Reflexive, Symmetric, and Transitive.