Question 1 (CBSE 2019): Relations
Check whether the relation R in the set of real numbers defined by is reflexive, symmetric or transitive.
Explanation:
Reflexive: We need to check if for all . This is not always true. For a counterexample, let . The condition becomes , which is . This is false. Therefore, R is not reflexive.
Symmetric: We need to check if implies . For a counterexample, let . The pair is in R because . However, for the pair , the condition is , which is false. Therefore, R is not symmetric.
Transitive: We need to check if and implies . For a counterexample, let .
- ? . (True)
- ? . (True)
- Is ? . (False) Since the condition fails, R is not transitive.
Question 2 (CBSE 2011): Relations
Show that the relation R in the set A of all the books in a library, given by is an equivalence relation.
Explanation:
Reflexive: For any book , it is true that book and book have the same number of pages. So, . R is reflexive.
Symmetric: If , it means book and book have the same number of pages. This implies that book and book also have the same number of pages. So, . R is symmetric.
Transitive: If and , it means and have the same number of pages, and and have the same number of pages. It follows that and must have the same number of pages. So, . R is transitive. Since R is reflexive, symmetric, and transitive, it is an equivalence relation.
Question 3 (CBSE 2017): Relations
Show that the relation R on the set A = {1, 2, 3} given by R = {(1, 2), (2, 1)} is symmetric but neither reflexive nor transitive.
Explanation:
Reflexive: For R to be reflexive on A={1,2,3}, it must contain (1,1), (2,2), and (3,3). None of these are in R. Thus, R is not reflexive.
Symmetric: For every pair in R, the pair must also be in R. The only non-diagonal pair is (1,2). Its reverse, (2,1), is also in R. Thus, R is symmetric.
Transitive: We have and . For transitivity, this requires that must also be in R. Since is not in R, the condition fails. Thus, R is not transitive.
Question 4 (CBSE 2020): Relations
Let R be a relation on the set of natural numbers given by . Determine if (6,8) is in R.
Explanation: For the pair to be in R, it must satisfy two conditions:
: Here, , and is true.
: Here, and . is true.
Since both conditions are satisfied, the pair (6,8) is in R.
Question 5 (CBSE Sample Paper): Relations
Let A = {1, 2, 3}. Write the smallest equivalence relation on A.
Explanation: An equivalence relation must be reflexive, symmetric, and transitive. To be the 'smallest', it must contain only the pairs that are absolutely necessary.
Reflexivity: The relation must contain (1,1), (2,2), and (3,3) to be reflexive on A.
Symmetry & Transitivity: The set (the identity relation) has no pairs that violate symmetry or transitivity. For example, for symmetry, there are no pairs where , so the condition is vacuously true. The same applies to transitivity.
Therefore, the identity relation itself is the smallest possible equivalence relation on any set.
Answer: .
Question 6 (CBSE 2018): Relations
Show that the relation R on the set of points in a plane, given by is an equivalence relation.
Explanation: Let OP denote the distance of a point P from the origin.
Reflexive: For any point P, OP = OP. Thus, . R is reflexive.
Symmetric: If , then OP = OQ. This equality implies OQ = OP. Thus, . R is symmetric.
Transitive: If and , then OP = OQ and OQ = OS. By the transitive property of equality, this implies OP = OS. Thus, . R is transitive.
Since R is reflexive, symmetric, and transitive, it is an equivalence relation. (Geometrically, this relation groups all points that lie on the same circle centered at the origin).
Question 7 (CBSE 2019): Relations
Let A = {1, 2, 3, …, 9} and R be the relation on defined by if . Prove that R is an equivalence relation.
Explanation: The condition can be rearranged to .
Reflexive: We check if . This requires , which is true. R is reflexive.
Symmetric: If , then . We check if , which requires . Since these are the same equation, the property holds. R is symmetric.
Transitive: If and , then (1) and (2) . We want to prove . Adding the two equations:
Cancelling and from both sides gives . R is transitive.
Therefore, R is an equivalence relation.
Question 8 (CBSE 2012): Functions
Show that the function , given by , is one-one but not onto.
Explanation:
One-one (Injective): Let for some . This means . Dividing by 2, we get . Since implies , the function is one-one.
Onto (Surjective): For a function to be onto, its range must be equal to its codomain.
The codomain is .
The range is the set of all outputs: . The range is the set of all even natural numbers.
Since the range is not equal to the codomain (for example, the odd number 3 is in the codomain but has no pre-image), the function is not onto.
Question 9 (CBSE 2017): Functions
Let be defined as . Show that f is neither one-one nor onto.
Explanation:
One-one: To show it's not one-one, we need a counterexample. Let and . Here . But and . Since different inputs produce the same output, f is not one-one (it is many-one).
Onto: The codomain is . The range of consists of only non-negative numbers, since any real number raised to the fourth power is non-negative. The range is . Since the range is not equal to the codomain (e.g., -1 has no pre-image), f is not onto.
Question 10 (CBSE 2016): Functions
State whether the function given by is one-one and onto.
Explanation:
One-one: Let for .
Then . Since the domain is natural numbers (which are positive), we can take the positive square root of both sides, which implies . Therefore, the function is one-one.
Onto: The codomain is . The range is the set of outputs: .
The range is the set of perfect squares. Since the range is not equal to the codomain (e.g., 2 has no pre-image), the function is not onto.
Question 11 (CBSE 2018): Functions
Show that the function from to is neither one-one nor onto.
Explanation:
One-one: To show it's not one-one, we find a counterexample. Let and . Then and .
Since different inputs give the same output, f is not one-one.
Onto: The codomain is . The range of the modulus function is the set of all non-negative numbers, .
Since the range is not equal to the codomain (e.g., any negative number like -1 has no pre-image), f is not onto.
Question 12 (CBSE 2011): Functions
Let and . Consider the function defined by . Is f one-one and onto?
Explanation:
One-one: Let . Then
Cross-multiplying gives which simplifies to
This further simplifies to , or . So, f is one-one.
Onto: Let be an arbitrary element in the codomain B. Set and solve for x.
Since , we know , so a valid pre-image can always be found. We must also check that this is never 3. If , then which is a contradiction. Thus, the pre-image is never 3, so it is always in the domain A. f is onto.
Conclusion: Yes, the function is one-one and onto (bijective).
Question 13 (CBSE 2014): Composition and Inverses
Let and , . Find .
Explanation: The composition is defined as .
Substitute g(x): Start with the outer function and replace its variable with the entire function .
Apply f: Now apply the rule for , which is 'add 7' to the input.
Answer: .
Question 14 (CBSE 2015): Composition and Inverses
If and , then find .
Explanation: The composition is defined as .
Substitute f(x):
Start with the outer function and replace its variable with the entire function .
.
Apply g:
Now apply the rule for , which is 'take the cube root' of the input.
.
Answer: .
Question 15 (CBSE 2018): Composition and Inverses
Let be defined by . Find its inverse.
Explanation:
Replace f(x) with y: .
Swap x and y: .
Solve for y: .
State the inverse: .
Answer: .
Question 16 (CBSE 2017): Composition and Inverses
Let be given by . Find .
Explanation: We need to compute .
Substitute f(x) into itself:
Replace f(x) with its definition:
Simplify: The cube and the cube root cancel each other out.
Answer: .
Question 17 (CBSE 2014): Composition and Inverses
Let . Show that and find the inverse of f.
Explanation: Part 1: Show that .
Compose the function with itself:
Simplify: Multiply the numerator and the denominator by to clear the complex fraction.
Part 2: Find the inverse of f.
Since we have shown that , this means that applying the function twice returns the original input. This is the definition of a function that is its own inverse.
Therefore, .
Answer: .
Question 18 (CBSE 2011): Composition and Inverses
Consider given by . Find the inverse of f.
Explanation: Here, represents the set of non-negative real numbers, i.e., .
Replace f(x) with y: .
Swap x and y: .
Solve for y: .
Choose the Correct Root: The range of the inverse function must be the domain of the original function , which is . To ensure our output is non-negative, we must choose the positive root.
Therefore, .
Question 19 (CBSE 2019): Composition and Inverses
If and , find .
Explanation: We need to find .
Substitute f(x) into g(x):
Apply the function g: The rule for is to take 5 times the input, subtract 2, and take the absolute value.
Answer: .
Question 20 (CBSE Sample Paper): Composition and Inverses
If , find .
Explanation: We need to compute .
Substitute f(x) into itself:
Apply the function f: The rule for is to square the input and subtract 1.
Expand and Simplify:
Answer: .
Question 21 (CBSE 2019): Composition and Inverses
Show that the function in defined as is one-one and onto. Hence, find .
Explanation: This question is related to Example 17.
Method 1: Using Composition In Example 17, we showed that . Let's analyze this result.
Since , applying the function to any output of returns the original input. This means is its own inverse. .
A function that has an inverse must be bijective (one-one and onto).
Therefore, the function is one-one and onto, and its inverse is .
Method 2: Direct Proof
One-one: We would show through cross-multiplication, which holds true.
Onto: We would solve for in terms of to get . This shows that a pre-image exists for every except . Since the codomain is given as , the function is onto.
Question 22 (CBSE 2020): Composition and Inverses
Let be defined by . Show that f is invertible.
Explanation: A function is invertible if it is bijective (both one-one and onto).
One-one:
Let
The function is injective.
Onto: Let . We need to find an such that . Set . Solving for gives . For every real number , this formula gives a valid real number . Thus, the function is surjective.
Since the function is both one-one and onto, it is bijective and therefore invertible.
Question 23 (CBSE 2012): Composition and Inverses
If a function is defined by , find .
Explanation:
Replace f(x) with y: .
Swap x and y: .
Solve for y: .
State the inverse: .
Answer: .
Question 24 (CBSE 2015): Functions
Let be defined by and . Find and .
Explanation: This question is about the algebra of functions.
Sum of functions, : This is defined as .
To find , we substitute :
Product of functions, : This is defined as .
To find , we substitute :
Answer: and .
Question 25 (CBSE 2013): Composition and Inverses
If , find .
Explanation: We need to compute .
To simplify the complex fraction, multiply the numerator and denominator by :
Answer: .
Question 26 (CBSE 2018): Relations
Let R be a relation on defined by if is divisible by 4. Show it is an equivalence relation.
Explanation:
Reflexive: For any integer , . Since , 0 is divisible by 4. R is reflexive.
Symmetric: If , then is divisible by 4. Since , is also divisible by 4. Thus, . R is symmetric.
Transitive: If and , then and are divisible by 4. This means and for some integers . (Note: if is a multiple of 4, then must also be a multiple of 4). Adding the two equations:
This means is divisible by 4, and so is . Thus, . R is transitive.
Conclusion: It is an equivalence relation.
Question 27 (CBSE 2019): Functions
Let be defined by . Is f one-one and onto?
Explanation:
One-one: Let . Then . Taking the reciprocal of both sides gives . The function is one-one.
Onto: The codomain is . The range of is the set of all non-zero real numbers, . Since the range is not equal to the codomain (the value 0 has no pre-image), the function is not onto.
Question 28 (CBSE 2020): Relations
Let . Let . Is R transitive?
Explanation: The condition for transitivity is: if and , then must also be in R. We only need to check cases where the 'if' part is true.
- Let's check the chain and . This requires to be in R, which it is. This case holds.
- Let's check . There are no pairs of the form in R to continue a chain.
There are no other chains of the form and where and .
Since we cannot find any instance where the 'if' condition is met but the 'then' condition fails, the relation is transitive by vacuous truth.
Question 29 (CBSE 2016): Composition and Inverses
Let and . Find .
Explanation: We need to calculate . We work from the inside out.
Evaluate the inner function g(2): .
Evaluate the outer function f(3): .
Answer: 9.
Question 30 (CBSE 2012): Relations
If a relation R is defined on the set A={1,2,3,4,5,6} as . Is R an equivalence relation?
Explanation:
Reflexive: Is divisible by ? Yes, any non-zero integer is divisible by itself. R is reflexive.
Symmetric: If is divisible by , is divisible by ? Not always. For a counterexample, take the pair (2,4). Since 4 is divisible by 2, . However, 2 is not divisible by 4, so . R is not symmetric.
Transitive: If is divisible by and is divisible by , is divisible by ? Yes. If and , then . R is transitive.
Conclusion: Since the relation is not symmetric, it is not an equivalence relation.