This chapter is central to understanding how inputs map to outputs and how different types of functions (like injective, surjective, bijective) behave. For board exams, it builds the foundation for solving inverse-function, composition, and identity/idempotent relations. For competitive exams (JEE/NEET/CBSE), these same ideas are frequently used to test logical reasoning quickly through algebraic conditions, equivalence relations, and function composition properties.
20
Minutes
15
Questions
1 / -0
Marking
Q1. Let be defined by . Then
Q2. Let be defined by
For which real pairs is one-to-one?
Q3. Let and . Suppose is an injective function. How many functions satisfy ?
Q4. Let be defined by . The inverse is given by:
Q5. Assertion: If and are functions and is bijective, then is injective and is surjective. Reason: Because being injective forces to be injective, and being surjective forces to be surjective.
Both Assertion and Reason are true and Reason is the correct explanation of the Assertion.
Both Assertion and Reason are true but Reason is not the correct explanation of the Assertion.
Assertion is true but Reason is false.
Both Assertion and Reason are false.
Q6. Let be defined by . Which of the following is true about ?
is injective but not surjective.
is surjective but not injective.
is bijective (both one-one and onto).
is neither injective nor surjective.
Q7. Let be defined by the piecewise rule
Which of the following properties does have?
is surjective but not injective.
is injective but not surjective.
is bijective.
is neither injective nor surjective.
Q8. Let be linear functions and with . If for all real , which of the following must hold?
Q9. Assertion (A): The relation on defined by is an equivalence relation.
Reason (R): Every equivalence class of is countable. Which one is correct?
A is true, R is false.
A is true, R is true but R does not explain A.
A is true, R is true and R explains A.
A is false, R is true.
Q10. Let be a polynomial with real coefficients satisfying for all real . Which of the following describes all such polynomials?
All constant polynomials and the identity polynomial .
All constant polynomials and all linear polynomials with .
All polynomials whose degree is or a power of .
Only constant polynomials.
Q11. Let be a linear function such that
for all real and . Then equals:
Q12. Let be a relation on defined by iff . The number of distinct equivalence classes of is:
$Infinite
Q13. Let be defined by
The range of is:
Q14. Let satisfy for all real . Which one of the following statements is necessarily true?
must be the identity function for all
For every , , i.e., acts as the identity on its image
must be a constant function
is necessarily injective
Q15. Define a relation on by iff . Which statement is correct?
is an equivalence relation on but not an equivalence relation on
is an equivalence relation on
is not an equivalence relation on either or
is a partial order on