CUET MCQs on Relations & Functions
Uploaded by
imsleepingfrCUET MCQs on Relations & Functions
Uploaded by
imsleepingfrCommon questions
Powered by AIUnderstanding injective (one-one) and surjective (onto) properties is key in CUET-level assessments to classify functions and determine the presence of inverse functions. An injective function maps distinct elements of the domain to distinct elements of the codomain, ensuring each element is unique. A surjective function covers every element in the codomain, ensuring completness of mapping, crucial for determining the existence of inverse functions via bijectivity conditions .
A bijective function has an inverse because it is both injective (one-one) and surjective (onto), ensuring a unique mapping for every element in its domain to a unique element in its codomain, and vice versa. Consequently, the inverse function exists from the codomain back to its domain, with the original codomain becoming the domain and vice versa .
For a function f: A -> B to have an inverse mapping from B to A, it must be bijective, meaning it has to be both injective (each element of A maps to a unique element of B) and surjective (every element of B is an output of some input in A). These properties ensure that the inverse function can uniquely and completely relate elements of B back to elements of A .
A reflexive relation R on a set A includes the property that for every element a in A, the pair (a, a) is in R. This distinguishes it from other relations like symmetric (where if (a, b) is in R, then (b, a) must also be in R) or transitive relations (where if (a, b) and (b, c) are in R, then (a, c) must be in R).
The relation {(1,1), (1,2), (2,3), (3,1)} illustrates a specific mapping from set A = {1, 2, 3} to itself, where elements in set A appear as either a first or second element in ordered pairs. This does not form a function because, for the input 1, there are multiple outputs (1 and 2), violating the criterion for a function where each input should map to exactly one output .
The relation {(1,2), (2,3), (3,4)} is not considered to be from set A = {1, 2, 3} to itself because 4, appearing as the second element in the pair (3,4), is not an element of set A. A relation from A to A needs both elements of the ordered pairs to be within set A, ensuring closure within the set .
The Cartesian product A x B describes the set of all possible ordered pairs (a, b) where a is in A and b is in B. A bijective function's inverse is a function from B to A, indicating that each b in B maps back to a unique a in A, effectively reversing the direction of mapping defined by the original function's set of ordered pairs .
The composition (f o g)(x) results in 3x^2 - 1. This is derived by first applying the function g to x, giving g(x) = x^2. The output of g(x) becomes the input to f, thus f(g(x)) = f(x^2) = 3(x^2) - 1 = 3x^2 - 1 .
The function f(x) = 2x + 3 is one-one (injective) because for every distinct input x1 and x2 in its domain, the outputs are distinct; that is, if f(x1) = f(x2), then x1 = x2 must hold. In contrast, f(x) = x^2 and f(x) = |x| are not one-one because there exist distinct inputs (e.g., both positive and negative values such as 2 and -2) that result in the same output .
To determine if functions like a quadratic (e.g., f(x) = x^2) or an absolute value function (e.g., f(x) = |x|) are one-one, one must assess if every distinct input corresponds to a unique output. Quadratics and absolute functions are not one-one over their entire domain because inputs can yield the same output value (as in f(x) = x^2 for x = 2 and x = -2, or f(x) = |x| for x = 2 and x = -2), thereby invalidating the one-oneness condition .