Q.Give an example of a map
🔒You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
🔒 Start your 14-day free trial to unlock the full solution →Concept understanding — One One Onto
One-One Onto (Bijective) Functions
Picture seating students on chairs so that every student gets a chair, every chair is used, no two students share one and none is left empty. A function that manages this perfect pairing between its domain and codomain is one-one onto, or bijective.
One-one (injective)
f is one-one if different inputs always give different outputs — no two students on one chair. Formally, f(x1)=f(x2)⟹x1=x2 (equivalently x1=x2⟹f(x1)=f(x2)).
f(x)=2x on R is one-one, since 2a=2b⇒a=b. But f(x)=x2 is not: f(2)=f(−2)=4 while 2=−2.
Onto (surjective)
f is onto if every element of the codomain is actually hit — no chair left empty. Formally, for every y in the codomain there is some x with f(x)=y. Here f(x)=2x is onto (take x=y/2), whereas f:R→R, f(x)=x2 is not, since negative values are never outputs.
Both together — bijective
A function that is one-one and onto is bijective: a one-to-one correspondence in which the two sets match up exactly.
One-one and onto are independent properties. f(x)=ex (from R to R) is one-one but not onto; f(x)=x3−x is onto but not one-one. You must verify both.
Why it matters
Only a bijection has a genuine inverse function: because each output comes from exactly one input (one-one) and every codomain element is used (onto), the map can be reversed unambiguously. …
Concept: One-One (Injective) and Onto (Surjective) Functions
A function f:A→B is one-one if f(x1)=f(x2)⟹x1=x2. It is onto if every element of B has a pre-image in A.
(i) One-one but not onto:
Take f:N→N defined by f(n)=n+1.
- If f(a)=f(b), then a+1=b+1⟹a=b, so it is one-one.
- But 1∈N has no pre-image (since n+1=1 gives n=0∈/N), so it is not onto.
(ii) Not one-one but onto:
Take f:R→[0,∞) defined by f(x)=x2.
- f(−1)=f(1)=1, so it is not one-one.
- Every y≥0 has x=y∈R, so it is onto.
(iii) Neither one-one nor onto: …
The key idea is to construct functions that deliberately break or preserve the two defining properties of a bijection: injectivity (one-one) and surjectivity (onto). For each case, we pick a simple domain and codomain — usually finite sets or R — and define a rule that either fails to be distinct on distinct inputs, fails to cover the whole codomain, or both.
Why this approach works
A function f:A→B is one-one (injective) if f(x1)=f(x2) implies x1=x2 — no two different inputs map to the same output. It is onto (surjective) if every element of B is the image of at least one element of A — the range equals the codomain.
To produce examples for each combination, we can use small finite sets where the behaviour is crystal clear, or use familiar real functions whose graphs make the properties obvious. The trick is to choose the domain and codomain deliberately: a function can fail to be onto simply by having a codomain larger than its range, and can fail to be one-one by sending two inputs to the same output.
1. A function that is one-one but not onto
Take f:N→N defined by f(n)=n+1.
- One-one: If f(m)=f(n), then m+1=n+1, so m=n. Distinct inputs give distinct outputs.
- Not onto: The output 1 is never reached, because n+1≥2 for all n∈N. So the range is {2,3,4,…}, which is a proper subset of N.
A classic variant: f:Z→Z with f(x)=2x is one-one but not onto (odd integers are missed). The "shift by 1" trick works for any infinite set with a smallest element.
2. A function that is not one-one but onto
Take f:R→[0,∞) defined by f(x)=x2.
- Not one-one: f(2)=4 and f(−2)=4, so two different inputs map to the same output.
- Onto: For any y≥0, we can pick x=y (or x=−y) and get f(x)=y. Every non-negative real number is hit. …
Method: Designing functions with a chosen one-one / onto combination
Use this when asked to give an example of a function that is one-one-not-onto, onto-not-one-one, or neither — the skill is engineering the two properties independently.
Steps
Step 1: Recall that one-one and onto are separate dials you can set independently.
One-one (injective): f(x1)=f(x2)⟹x1=x2. Onto (surjective): every codomain element is an output. You control each by choosing the rule and, crucially, the codomain.
Step 2: To break onto, make the codomain bigger than the range.
Onto depends entirely on the declared codomain. A shift like f(n)=n+1 on N→N misses 1, so it is not onto; the same idea works whenever the target set has an element the rule can never produce.
Step 3: To break one-one, let two inputs collide. …
Common Mistakes
Mistake 1: Ignoring the codomain when judging 'onto'.
Why it's wrong: surjectivity depends entirely on the declared codomain — f(x)=x2 is onto for R→[0,∞) but not for R→R. Correct approach: always state the codomain and check the range equals it.
Mistake 2: Giving the same function for the 'onto not one-one' and 'neither' cases without changing the codomain.
Why it's wrong: x2 only switches between 'onto' and 'not onto' when you change the target set from [0,∞) to R. Correct approach: adjust the codomain deliberately to engineer each required combination. …
Showing the 12 most recent of 45 on this concept.
- CBSE 2024Set 65/3/11 markMCQQ.Let R+ denote the set of all non-negative real numbers. Then the function f:R+→R+ defined as f(x)=x2+1 is: (A) one-one but not onto (B) onto but not one-one (C) both one-one and onto (D) neither one-one nor onto
›Reveal solutionSolution
The function f(x)=x2+1 maps non-negative real numbers to non-negative real numbers. It is one-one because distinct non-negative inputs always produce distinct outputs, but it is not onto because values in the codomain between 0 and 1 (exclusive) do not have a pre-image. The function is one-one but not onto.
To determine if a function is one-one (injective) and/or onto (surjective), we need to understand what these terms mean in the context of the given domain and codomain.
The function is f:R+→R+ defined as f(x)=x2+1.
Here, R+ denotes the set of all non-negative real numbers, which is the interval [0,∞).
So, the domain is [0,∞) and the codomain is also [0,∞).
Understanding One-one (Injectivity):
A function f:A→B is one-one if every distinct element in the domain A maps to a distinct element in the codomain B. In other words, no two different inputs produce the same output.
Mathematically, this means: If f(x1)=f(x2) for any x1,x2∈A, then it must imply x1=x2.
Understanding Onto (Surjectivity):
A function f:A→B is onto if every element in the codomain B has at least one corresponding element in the domain A that maps to it. This means the range of the function must be equal to its codomain.
Mathematically, this means: For every y∈B, there exists at least one x∈A such that f(x)=y.
Let's analyze the given function step-by-step.
- Check for One-one (Injectivity): We assume f(x1)=f(x2) for any x1,x2 in the domain R+.
x12+1=x22+1
Subtracting $1$ from both sides:x12=x22
Taking the square root of both sides:x1=±x2
Now, we must consider the domain. Since $x_1, x_2 \in \mathbb{R}_+$, both $x_1$ and $x_2$ must be non-negative. If $x_2 > 0$, then $x_1 = -x_2$ would mean $x_1$ is negative, which is not allowed in $\mathbb{R}_+$. Therefore, the only possibility for $x_1, x_2 \in \mathbb{R}_+$ is $x_1 = x_2$. This confirms that if the outputs are the same, the inputs must also be the same. > [!WARNING] > If the domain were $\mathbb{R}$ (all real numbers) instead of $\mathbb{R}_+$, then $x_1 = \pm x_2$ would mean the function is *not* one-one. For example, $f(2) = 2^2+1 = 5$ and $f(-2) = (-2)^2+1 = 5$, but $2 \neq -2$. The restriction of the domain to $\mathbb{R}_+$ is crucial here. Thus, the function $f(x) = x^2 + 1$ is one-one on $\mathbb{R}_+$.2. Check for Onto (Surjectivity):
For the function to be onto, every element y in the codomain R+ must have a pre-image x in the domain R+ such that f(x)=y.
Let y∈R+ be an arbitrary element in the codomain. We set f(x)=y:
x2+1=y …
- CBSE 2024Set 65/1/11 markMCQQ.A function f:R+→R (where R+is the set of all non-negative real numbers) defined by f(x)=4x+3, then this function is : (A) One-one but not onto (B) Onto but not one-one (C) Both one-one and onto (D) Neither one-one nor onto
›Reveal solutionSolution
A linear function with positive slope is always one-one (strictly increasing). But here the codomain is all real numbers, while the range is only numbers ≥3, so it is not onto. The function is one-one but not onto.
We need to check two properties: one-one (injective) and onto (surjective). The function is f(x)=4x+3, with domain R+ (all non-negative reals, including zero) and codomain R (all real numbers).
The key idea: a linear function with non-zero slope is always one-one. But whether it is onto depends on whether its range equals the entire codomain. Here the domain is restricted to x≥0, so the range is [3,∞), not all of R.
Let’s go step by step.
- Checking one-one (injective) A function is one-one if different inputs give different outputs. For f(x)=4x+3, suppose f(a)=f(b). Then:
4a+3=4b+3⟹4a=4b⟹a=b
So f is injective.
Alternatively, the derivative f′(x)=4>0 means f is strictly increasing, which also guarantees one-one.
TipFor linear functions f(x)=mx+c, if m=0, it is always one-one on any domain. The sign of m tells you if it's increasing or decreasing.
- Checking onto (surjective) A function is onto if every element in the codomain R has a preimage in the domain R+. That is, for any y∈R, we need some x≥0 such that f(x)=y. Solve 4x+3=y for x: x=4y−3 …
- CBSE 2025Set 65/4/11 markMCQQ.For real x, let f(x)=x3+5x+1. Then : (A) f is one-one but not onto on R (B) f is onto on R but not one-one (C) f is one-one and onto on R (D) f is neither one-one nor onto on R
›Reveal solutionSolution
The function f(x)=x3+5x+1 is strictly increasing (since f′(x)=3x2+5>0 for all real x), so it is one-one. As a cubic with odd degree and positive leading coefficient, its range is all real numbers, so it is onto R. Hence the correct option is (C).
-
Understanding one-one (injective) — why the derivative tells the story
A function is one-one if different inputs give different outputs. For a differentiable function, a sufficient condition is that the derivative never changes sign — that is, the function is strictly monotonic (always increasing or always decreasing).
Here, f′(x)=3x2+5. Since x2≥0 for all real x, we have 3x2≥0, so 3x2+5≥5>0. The derivative is always positive.
Therefore f is strictly increasing on R. A strictly increasing function is automatically one-one: if x1<x2, then f(x1)<f(x2), so no two distinct x's can map to the same y.
-
Understanding onto (surjective) — why the range is all reals
A function f:R→R is onto if every real number appears as an output. For a polynomial of odd degree with a positive leading coefficient, the end behaviour guarantees this:
- As x→−∞, x3→−∞, so f(x)→−∞.
- As x→+∞, x3→+∞, so f(x)→+∞. Since f is continuous (every polynomial is continuous), by the Intermediate Value Theorem it takes every value between −∞ and +∞. That is, the range is R. …
-
- CBSE 2024Set 65/2/11 markMCQQ.Let f:R+→[−5,∞) be defined as f(x)=9x2+6x−5, where R+ is the set of all non-negative real numbers. Then, f is: (A) one-one (B) onto (C) bijective (D) neither one-one nor onto
›Reveal solutionSolution
A quadratic function on [0,∞) is strictly increasing, hence one-one; checking the range shows it maps onto [−5,∞) exactly. The function is bijective.
The question asks us to determine whether f is one-one (injective), onto (surjective), both (bijective), or neither. Understanding these properties for a quadratic restricted to non-negative reals requires examining both monotonicity and range.
A function is one-one if distinct inputs always produce distinct outputs: f(x1)=f(x2)⟹x1=x2. For continuous functions, strict monotonicity (always increasing or always decreasing) guarantees this property.
A function is onto if every element in the codomain [−5,∞) is actually achieved by some input from the domain R+.
Checking if f is one-one
The derivative tells us about monotonicity:
f′(x)=18x+6
For all x∈R+=[0,∞), we have f′(x)=18x+6≥6>0. The function is strictly increasing on its entire domain.
TipA strictly monotonic function on any interval is automatically one-one — if x1<x2, then f(x1)<f(x2), so they can never be equal.
Therefore f is one-one.
Checking if f is onto
We need to verify that the range of f (the set of all actual outputs) equals the codomain [−5,∞).
- Find the minimum value. Since f is strictly increasing on [0,∞), the minimum occurs at the left endpoint x=0:
f(0)=9(0)2+6(0)−5=−5
- Find the behavior as x→∞. The leading term 9x2 dominates: …
- CBSE 2026Set CX1 markMCQQ.The function f(x)=2x, x∈R is:(a) one-one but not onto(b) one-one and onto(c) many-one and onto(d) many-one but not onto
›Reveal solutionSolution
f(x)=2x on R is a bijection — both one-one and onto — option (b).
One-one: If f(x1)=f(x2) then 2x1=2x2⇒x1=x2. So f is injective.
…
- CBSE 2026Set ANNUAL1 markMCQQ.Let f:R→R defined as f(x)=3−4x, then f(x) is:(a) one-one onto(b) onto only(c) neither one-one nor onto(d) none of these
›Reveal solutionSolution
f(x)=3−4x is a linear function with non-zero slope, so it is both one-one and onto.
Given f:R→R, f(x)=3−4x.
One-one: Let f(x1)=f(x2). Then 3−4x1=3−4x2⇒x1=x2. So f is injective.
…
- CBSE 2026Set ANNUAL1 markMCQQ.If A = {0, 1, 4, 9, 16, 25, ......} then function defined by f: Z → A, f(x) = x² is:(a) one-one but not onto(b) onto but not one-one(c) one-one and onto(d) neither one-one nor onto
›Reveal solutionSolution
Two different integers with the same absolute value (like 2 and −2) give the same square, so f is not one-one; but every element of A is a perfect square that some integer squares to, so f is onto.
f:Z→A is defined by f(x)=x2, where A={0,1,4,9,16,25,…} is the set of all perfect squares of non-negative integers.
One-one check: Take x=2 and x=−2. Both are in Z and f(2)=4=f(−2), but 2=−2. Different inputs give the same output — f is not one-one.
…
- CBSE 2026Set ANNUAL1 markMCQQ.Let f : R → R be defined by f(x) = 3x, choose the correct answer:(a) f is one-one onto(b) f is many-one onto(c) f is one-one but not onto(d) f is neither one-one nor onto
›Reveal solutionSolution
f(x)=3x is a straight-line map with non-zero slope, so it is both injective and surjective on R — a bijection.
Checking one-one (injective):
Let f(x1)=f(x2). Then 3x1=3x2⇒x1=x2. So distinct inputs never share an output — f is one-one.
Checking onto (surjective): …
- CBSE 2026Set ANNUAL1 markQ.Prove that the function f:R→R, given by f(x)=2x, is both one-one and onto.
›Reveal solutionSolution
Prove injectivity by showing f(x1)=f(x2) forces x1=x2, and prove surjectivity by exhibiting a pre-image for an arbitrary y∈R.
Given f:R→R, f(x)=2x.
Step 1: One-one (injective).
Let x1,x2∈R such that f(x1)=f(x2).
2x1=2x2⟹x1=x2
So f(x1)=f(x2)⟹x1=x2, hence f is one-one.
Step 2: Onto (surjective).
Let y∈R be arbitrary (any element of the codomain). We need x∈R (the domain) such that f(x)=y.
…
- CBSE 2026Set ANNUAL1 markMCQQ.Let f:R→R be defined as f(x)=x4. Then(a) f is one-one and onto(b) f is many-one and onto(c) f is one-one but not onto(d) f is neither one-one nor onto
›Reveal solutionSolution
Find a counter-example pair with equal outputs to disprove one-one, and note the range excludes negative numbers to disprove onto.
Given f:R→R, f(x)=x4.
One-one? Consider x1=1 and x2=−1:
f(1)=14=1,f(−1)=(−1)4=1
f(1)=f(−1)=1 but 1=−1. So f is not one-one (it is many-one).
…
- CBSE 2025Set 65/4/11 markMCQQ.If f:N→W is defined as f(n)={2n,0,if n is evenif n is odd, then f is : (A) injective only (B) surjective only (C) a bijection (D) neither surjective nor injective
›Reveal solutionSolution
The function maps all odd naturals to 0 and each even natural to half its value, so it is surjective onto W (every whole number is hit) but not injective (many inputs give the same output). The correct option is (B).
The core idea here is to understand what the function does to its domain, N (the set of natural numbers, typically {1,2,3,…}), and where it lands, W (the set of whole numbers, {0,1,2,3,…}). The definition splits the domain into two clear cases: odd numbers and even numbers.
For every odd natural number — 1, 3, 5, 7, … — the output is 0. That means infinitely many inputs all map to the single output 0. That alone kills injectivity: a function is injective (one-to-one) only if different inputs always give different outputs. Here, f(1)=0, f(3)=0, f(5)=0, and so on, so it is clearly not injective.
For every even natural number — 2, 4, 6, 8, … — the output is half of that number. So f(2)=1, f(4)=2, f(6)=3, f(8)=4, and so on. This gives us every positive whole number exactly once. And the odd numbers already cover 0. So every whole number — 0, 1, 2, 3, … — appears as an output at least once. That makes the function surjective (onto).
Let’s walk through it step by step.
-
Check injectivity (one-to-one)
Take two different inputs, say n=1 and n=3. Both are odd, so f(1)=0 and f(3)=0. Since 1=3 but f(1)=f(3), the function is not injective.
Watch outA common mistake is to only check the even case and think the function looks one-to-one. But the odd case collapses everything to 0 — that’s the trap.
-
Check surjectivity (onto)
We need to see if every element of W (the codomain) is actually hit by some n in N. …
-
- CBSE 2025Set ANNUAL1 markMCQQ.Let f:R→R be defined as f(x)=x2, where R is the set of real numbers. Choose the correct answer:(a) f is one-one onto(b) f is many-one onto(c) f is one-one but not onto(d) f is neither one-one nor onto
›Reveal solutionSolution
f(x)=x2 on R→R is neither one-one nor onto.
Not one-one: f(−1)=1=f(1) but −1=1, so two different inputs give the same output.
…
🎓Unlock everything free for 14 days
- ✓Full step-by-step solutions
- ✓Concept-first explanations
- ✓Methods, shortcuts & mistakes
- ✓PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.