Advertisements
Advertisements
प्रश्न
S is a relation over the set R of all real numbers and it is given by (a, b) ∈ S ⇔ ab ≥ 0. Then, S is _______________ .
पर्याय
symmetric and transitive only
reflexive and symmetric only
antisymmetric relation
an equivalence relation
Advertisements
उत्तर
an equivalence relation
Reflexivity: Let a ∈ R
Then,
aa = a2 > 0
⇒ (a, a) ∈ R ∀ a ∈ R
So, S is reflexive on R.
Symmetry: Let (a, b) ∈ S
Then,
(a, b) ∈ S
⇒ ab ≥ 0
⇒ ba ≥ 0
⇒ (b, a) ∈ S ∀ a, b ∈ R
So, S is symmetric on R.
Transitive:
If (a, b), (b, c) ∈ S
⇒ ab ≥ 0 and bc ≥ 0
⇒ ab x bc ≥ 0
⇒ ac ≥ 0 [∵ b2 ≥ 0]
⇒ (a, c) ∈ S for all a, b, c ∈ set R
Hence, S is an equivalence relation on R
APPEARS IN
संबंधित प्रश्न
Determine whether the following relation is reflexive, symmetric and transitive:
Relation R in the set A = {1, 2, 3, 4, 5, 6} as R = {(x, y) : y is divisible by x}.
Determine whether the following relation is reflexive, symmetric and transitive:
Relation R in the set Z of all integers defined as R = {(x, y) : x − y is an integer}.
Show that the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12} given by R = {(a, b) : a = b} is an equivalence relation. Find the set of all elements related to 1.
Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is
(A) 1 (B) 2 (C) 3 (D) 4
The binary operation *: R x R → R is defined as a *b = 2a + b Find (2 * 3)*4
Let A = {1, 2, 3}, and let R1 = {(1, 1), (1, 3), (3, 1), (2, 2), (2, 1), (3, 3)}, R2 = {(2, 2), (3, 1), (1, 3)}, R3 = {(1, 3), (3, 3)}. Find whether or not each of the relations R1, R2, R3 on A is (i) reflexive (ii) symmetric (iii) transitive.
The following relation is defined on the set of real numbers.
aRb if a – b > 0
Find whether relation is reflexive, symmetric or transitive.
The following relation is defined on the set of real numbers. aRb if |a| ≤ b
Find whether relation is reflexive, symmetric or transitive.
Let R be a relation defined on the set of natural numbers N as
R = {(x, y) : x, y ∈ N, 2x + y = 41}
Find the domain and range of R. Also, verify whether R is (i) reflexive, (ii) symmetric (iii) transitive.
Show that the relation '≥' on the set R of all real numbers is reflexive and transitive but not symmetric ?
Defines a relation on N:
x + 4y = 10, x, y ∈ N
Determine the above relation is reflexive, symmetric and transitive.
Write the identity relation on set A = {a, b, c}.
Define a symmetric relation ?
A = {1, 2, 3, 4, 5, 6, 7, 8} and if R = {(x, y) : y is one half of x; x, y ∈ A} is a relation on A, then write R as a set of ordered pairs.
Let A = {2, 3, 4, 5} and B = {1, 3, 4}. If R is the relation from A to B given by a R b if "a is a divisor of b". Write R as a set of ordered pairs.
Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(a, b) : | a2- b2 | < 8}. Write R as a set of ordered pairs.
Let R be the relation over the set of all straight lines in a plane such that l1 R l2 ⇔ l 1⊥ l2. Then, R is _____________ .
The relation 'R' in N × N such that
(a, b) R (c, d) ⇔ a + d = b + c is ______________ .
A relation R is defined from {2, 3, 4, 5} to {3, 6, 7, 10} by : x R y ⇔ x is relatively prime to y. Then, domain of R is ______________ .
If R is a relation on the set A = {1, 2, 3, 4, 5, 6, 7, 8, 9} given by x R y ⇔ y = 3 x, then R = _____________ .
Show that the relation R on R defined as R = {(a, b): a ≤ b}, is reflexive, and transitive but not symmetric.
Show that the relation R defined by (a, b)R(c,d) ⇒ a + d = b + c on the A x A , where A = {1, 2,3,...,10} is an equivalence relation. Hence write the equivalence class [(3, 4)]; a, b, c,d ∈ A.
If A = {a, b, c}, B = (x , y} find A × B.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find (A × B) ∪ (A × C).
In the set of natural numbers N, define a relation R as follows: ∀ n, m ∈ N, nRm if on division by 5 each of the integers n and m leaves the remainder less than 5, i.e. one of the numbers 0, 1, 2, 3 and 4. Show that R is equivalence relation. Also, obtain the pairwise disjoint subsets determined by R
Consider the set A = {1, 2, 3} and R be the smallest equivalence relation on A, then R = ______
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
reflexive, transitive but not symmetric
Let A = {1, 2, 3, ... 9} and R be the relation in A × A defined by (a, b) R(c, d) if a + d = b + c for (a, b), (c, d) in A × A. Prove that R is an equivalence relation and also obtain the equivalent class [(2, 5)]
Let A = { 2, 3, 6 } Which of the following relations on A are reflexive?
Which of the following is not an equivalence relation on I, the set of integers: x, y
Let A = {1, 2, 3} and R = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ____________.
If A is a finite set containing n distinct elements, then the number of relations on A is equal to ____________.
Let A = {1, 2, 3, 4, 5, 6} Which of the following partitions of A correspond to an equivalence relation on A?
Let us define a relation R in R as aRb if a ≥ b. Then R is ____________.
Given set A = {1, 2, 3} and a relation R = {(1, 2), (2, 1)}, the relation R will be ____________.
In a group of 52 persons, 16 drink tea but not coffee, while 33 drink tea. How many persons drink coffee but not tea?
A relation R on (1, 2, 3) is given by R = {(1, 1), (2, 2), (1, 2), (3, 3), (2, 3)}. Then the relation R is ______.
