Show that the relation R in the set R of real numbers, defined as
R = {(a, b): a ≤ b2 } is neither reflexive nor symmetric nor transitive.
R = {(a, b): a \(\leq\) b2}
It can be observed that \(\bigg(\frac{1}{2},\frac{1}{2}\bigg)\)∉ R, since \(\frac{1}{2}>\bigg(\frac{1}{2}\bigg)^2=\frac{1}{4}\)
∴R is not reflexive.
Now, (1, 4) ∈ R as 1 < 42
But, 4 is not less than 12.
∴(4, 1) ∉ R
∴R is not symmetric.
Now, (3, 2), (2, 1.5) ∈ R
(as 3 < 22 = 4 and 2 < (1.5)2= 2.25)
But, 3 > (1.5)2 = 2.25
∴(3, 1.5) ∉ R
∴ R is not transitive.
Hence, R is neither reflexive, nor symmetric, nor transitive.
A school is organizing a debate competition with participants as speakers and judges. $ S = \{S_1, S_2, S_3, S_4\} $ where $ S = \{S_1, S_2, S_3, S_4\} $ represents the set of speakers. The judges are represented by the set: $ J = \{J_1, J_2, J_3\} $ where $ J = \{J_1, J_2, J_3\} $ represents the set of judges. Each speaker can be assigned only one judge. Let $ R $ be a relation from set $ S $ to $ J $ defined as: $ R = \{(x, y) : \text{speaker } x \text{ is judged by judge } y, x \in S, y \in J\} $.
The correct IUPAC name of \([ \text{Pt}(\text{NH}_3)_2\text{Cl}_2 ]^{2+} \) is:
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.