मराठी

The Following Relations Are Defined on the Set of Real Numbers. Arb If a – B > 0find Whether Relations Are Reflexive, Symmetric Or Transitive.

Advertisements
Advertisements

प्रश्न

The following relation is defined on the set of real numbers.
aRb if a – b > 0

Find whether relation is reflexive, symmetric or transitive.

बेरीज
Advertisements

उत्तर

(i) Reflexivity:

Let be an arbitrary element of R. Then,

 ∈ R

 But aa = 0 ≯ 0

So, this relation is not reflexive.

Symmetry:

Let (a, b∈ R

⇒ a0

⇒ (ba>0

⇒ b0

So, the given relation is not symmetric.

Transitivity:

Let (a, b)R and (b, c)R. Then,

a0 and b>0

Adding the two, we get

− b+− 0

⇒ − c0 

⇒ (a, c∈ R.

So, the given relation is transitive.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 1: Relations - Exercise 1.1 [पृष्ठ ११]

APPEARS IN

आर.डी. शर्मा Mathematics Volume 1 and 2 [English] Class 12
पाठ 1 Relations
Exercise 1.1 | Q 5.1 | पृष्ठ ११

संबंधित प्रश्‍न

Let N denote the set of all natural numbers and R be the relation on N × N defined by (a, b) R (c, d) if ad (b + c) = bc (a + d). Show that R is an equivalence relation.


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.


Given an example of a relation. Which is symmetric but neither reflexive nor transitive.


Given a non-empty set X, consider P(X), which is the set of all subsets of X. Define the relation R in P(X) as follows:

For subsets A, B in P(X), ARB if and only if A ⊂ B. Is R an equivalence relation on P(X)? Justify your answer.


Let A be the set of all human beings in a town at a particular time. Determine whether the following relation is reflexive, symmetric and transitive:

R = {(x, y) : x is wife of y}


Prove that every identity relation on a set is reflexive, but the converse is not necessarily true.


If = {1, 2, 3, 4} define relations on A which have properties of being reflexive, symmetric and transitive ?


An integer m is said to be related to another integer n if m is a multiple of n. Check if the relation is symmetric, reflexive and transitive.


Let A = {1, 2, 3} and R = {(1, 2), (1, 1), (2, 3)} be a relation on A. What minimum number of ordered pairs may be added to R so that it may become a transitive relation on A.


Prove that the relation R on Z defined by
(a, b) ∈ R ⇔ a − b is divisible by 5
is an equivalence relation on Z.


If R is a symmetric relation on a set A, then write a relation between R and R−1.


Let R = {(x, y) : |x2 − y2| <1) be a relation on set A = {1, 2, 3, 4, 5}. Write R as a set of ordered pairs.


State the reason for the relation R on the set {1, 2, 3} given by R = {(1, 2), (2, 1)} to be transitive ?


Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(ab) : | a2b| < 8}. Write as a set of ordered pairs.


If a relation R is defined on the set Z of integers as follows:
(a, b) ∈ R ⇔ a2 + b2 = 25. Then, domain (R) 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 ______________ .


Let A = {1, 2, 3}. Then, the number of equivalence relations containing (1, 2) is ______.


The relation R = {(1, 1), (2, 2), (3, 3)} on the set {1, 2, 3} is ___________________ .


In the set Z of all integers, which of the following relation R is not an equivalence relation ?


Mark the correct alternative in the following question:

Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}. Then, R is _______________ .


If `f(x) = (4x + 3)/(6x - 4), x ≠ 2/3`, show that fof (x) = x for all `x ≠ 2/3`. Also, find the inverse of f.


Show that the relation R on R defined as R = {(a, b): a ≤ b}, is reflexive, and transitive but not symmetric.


Let R be relation defined on the set of natural number N as follows:
R = {(x, y): x ∈N, y ∈N, 2x + y = 41}. Find the domain and range of the relation R. Also verify whether R is reflexive, symmetric and transitive


Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
an injective mapping from A to B


The maximum number of equivalence relations on the set A = {1, 2, 3} are ______.


Let R = {(3, 1), (1, 3), (3, 3)} be a relation defined on the set A = {1, 2, 3}. Then R is symmetric, transitive but not reflexive.


Let A = {1, 2, 3}. Which of the following is not an equivalence relation on A?


Let A = {1, 2, 3} and R = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ____________.


Let A = {1, 2, 3}, then the relation R = {(1, 1), (1, 2), (2, 1)} on A is ____________.


Let A = {1, 2, 3, 4, 5, 6} Which of the following partitions of A correspond to an equivalence relation on A?


Let `"f"("x") = ("x" - 1)/("x" + 1),` then f(f(x)) is ____________.


Let S = {1, 2, 3, 4, 5} and let A = S x S. Define the relation R on A as follows:
(a, b) R (c, d) iff ad = cb. Then, R is ____________.


An organization conducted a bike race under 2 different categories-boys and girls. Totally there were 250 participants. Among all of them finally, three from Category 1 and two from Category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project. Let B = {b1,b2,b3} G={g1,g2} where B represents the set of boys selected and G the set of girls who were selected for the final race.

Ravi decides to explore these sets for various types of relations and functions.

  • Let R: B → B be defined by R = {(x, y): x and y are students of same sex}, Then this relation R is ____________.

If A = {1,2,3}, B = {4,6,9} and R is a relation from A to B defined by ‘x is smaller than y’. The range of R is ____________.


If A is a finite set consisting of n elements, then the number of reflexive relations on A is


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 market research group conducted a survey of 2000 consumers and reported that 1720 consumers like product P1 and 1450 consumers like product P2. What is the least number that must have liked both the products?


Statement 1: The intersection of two equivalence relations is always an equivalence relation.

Statement 2: The Union of two equivalence relations is always an equivalence relation.

Which one of the following is correct?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×