Q.Let A=R−{3}, B=R−{1}. Let f:A→B be defined by f(x)=x−3x−2, ∀x∈A. Then show that f is bijective.
🔒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 — Bijection Proof
Proving a Function is a Bijection
A bijection is a function that is both one-one (injective) and onto (surjective). To prove that a given function f:A→B is a bijection, you establish these two things separately — there is no shortcut that does both at once.
Step 1 — prove it is one-one
Assume f(x1)=f(x2) for x1,x2∈A and derive x1=x2.
Injectivity means no two different inputs share an output.
Step 2 — prove it is onto
Take an arbitrary y∈B and produce an x∈A — usually by solving f(x)=y for x — such that f(x)=y, checking that this x really lies in A.
Surjectivity means every element of the codomain is used.
Once both parts hold, f is a bijection.
Both parts are compulsory. A function can be one-one but not onto (e.g. f:N→N, f(x)=2x misses the odd numbers) or onto but not one-one. Proving only one property does not prove a bijection.
A worked template
To show f:R→R, f(x)=2x+3 is a bijection:
- One-one: 2x1+3=2x2+3⇒2x1=2x2⇒x1=x2.
- Onto: given any y∈R, set x=2y−3∈R; then f(x)=2(2y−3)+3=y.
So f is a bijection, with inverse f−1(y)=2y−3.
Why it matters …
Concept: Bijection Proof — show injectivity (one-to-one) and surjectivity (onto).
Step 1 – Injectivity:
Assume f(x1)=f(x2). Then
x1−3x1−2=x2−3x2−2
Cross-multiply: (x1−2)(x2−3)=(x2−2)(x1−3).
Expand and simplify: x1x2−3x1−2x2+6=x1x2−3x2−2x1+6
⇒−3x1−2x2=−3x2−2x1⇒x1=x2. Hence f is injective.
Step 2 – Surjectivity:
For any y∈B (y=1), solve y=x−3x−2 for x.
y(x−3)=x−2⇒yx−3y=x−2⇒yx−x=3y−2 …
The function f(x)=x−3x−2 is a bijection from R∖{3} to R∖{1}. We prove it is both one-to-one (injective) and onto (surjective) by direct algebraic manipulation, showing that every element in B has exactly one preimage in A.
The core idea: a rational function of this form is a Möbius transformation — it’s essentially a linear function in disguise. For such functions, injectivity follows from the fact that if two inputs give the same output, cross-multiplying forces the inputs to be equal. Surjectivity follows because we can solve y=f(x) for x in terms of y, and the only value y cannot take is the one that makes the denominator zero in the expression for x.
Let’s walk through it step by step.
- Injectivity (one-to-one) Suppose f(x1)=f(x2) for some x1,x2∈A. That means
x1−3x1−2=x2−3x2−2.
Cross-multiply (valid since denominators are never zero in A):
(x1−2)(x2−3)=(x2−2)(x1−3).
Expand both sides:
x1x2−3x1−2x2+6=x1x2−3x2−2x1+6.
Cancel x1x2 and 6 from both sides:
−3x1−2x2=−3x2−2x1.
Bring terms together:
−3x1+2x1=−3x2+2x2⇒−x1=−x2.
Hence x1=x2. So f is injective.
Notice we never divided by anything that could be zero — the cross-multiplication is safe because x1,x2=3 by definition of A.
- Surjectivity (onto) We need to show: for every y∈B (i.e., y∈R, y=1), there exists some x∈A (i.e., x∈R, x=3) such that f(x)=y. Start with the equation:
y=x−3x−2.
Solve for x in terms of y:
y(x−3)=x−2⇒yx−3y=x−2.
Bring x terms together:
yx−x=3y−2⇒x(y−1)=3y−2.
Since y=1 (because y∈B), we can divide by y−1:
x=y−13y−2.
This gives a candidate x for each y. We must check two things: …
Method: The two-step bijection proof for a rational function
Use this for any 'show f is bijective' question, especially f(x)=cx+dax+b type maps between sets with points removed.
Steps
Step 1: Prove one-one algebraically.
Assume f(x1)=f(x2), cross-multiply (safe because the denominators are non-zero on the domain), expand, and cancel. The mixed x1x2 terms cancel, leaving a linear equation that forces x1=x2.
Step 2: Prove onto by solving y=f(x) for x.
Take an arbitrary y in the codomain and rearrange y=x−3x−2 to isolate x: collect the x-terms, factor, and divide. This yields a formula x=g(y) — the candidate preimage.
Step 3: Check the candidate actually lies in the domain. …
Common Mistakes
Mistake 1: Proving only one of one-one and onto and calling it bijective.
Why it's wrong: a bijection needs BOTH properties; one alone (e.g. only injectivity) is insufficient. Correct approach: give a separate argument for one-one and for onto.
Mistake 2: Forgetting to check the preimage lies in the domain.
Why it's wrong: after solving x=y−13y−2 you must confirm x=3, otherwise the 'preimage' is outside A=R∖{3}. Correct approach: show x=3 leads to the contradiction −2=−3, so x is always a valid element of A. …
- AP EAPCET 2023Set eng-2023-05-16-AN1 markMCQQ.Let A⊆R, B⊆R and f:A→B be defined by f(x)=x2−3x+2. If f is a bijection, then (A) A=(−∞,0],B=(−∞,4−1] (B) A=(−∞,23],B=[4−1,∞) (C) A=[23,∞),B=(−∞,4−1] (D) A=(−∞,∞),B=[4−1,∞)
›Reveal solutionSolution
A quadratic is only a bijection once you cut its domain to one monotonic branch and set the codomain equal to the exact range on that branch; here that gives A=(−∞,23], B=[−41,∞).
Concept and Intuition
f(x)=x2−3x+2 is a parabola opening upward with vertex at x=23 (from x=−b/2a=3/2), where f(23)=49−29+2=−41. A parabola is never one-to-one on all of R, so "bijection" forces us to pick a domain on which f is strictly monotonic, and then the codomain B must equal exactly the set of values f takes there (otherwise it isn't onto).
Step-by-Step Solution
- Vertex: x=23, fmin on right branch=−41.
- Test option (B): A=(−∞,23]. On this ray f is strictly decreasing (left of the vertex), so it's injective.
- As x→−∞, f(x)→∞; at x=23, f=−41. So the range on A is exactly [−41,∞) — matching B in option (B). Hence f:A→B is a bijection. …
- AP EAPCET 2022Set eng-2022-07-05-AN1 markMCQQ.If a function f:R−{l}→R−{m} defined by f(x)=x−2x+3 is a bijection, then 3l+2m= (A) 10 (B) 12 (C) 8 (D) 14
›Reveal solutionSolution
The domain gap l is where the denominator vanishes, and the codomain gap m is the horizontal-asymptote value the function never attains. Together 3l+2m=8.
Concept and Intuition
A Möbius-type map f(x)=cx+dax+b is undefined exactly where the denominator is zero, and it never attains the value that would require dividing by zero when solving y=f(x) for x — that value is precisely a/c (the horizontal asymptote). Removing both these single points from domain and codomain makes the map a genuine bijection.
Step-by-Step Solution
- f(x)=x−2x+3 is undefined at x=2, so the domain is R−{2}, giving l=2.
- Rewrite: f(x)=x−2(x−2)+5=1+x−25. This shows f(x)=1 would need x−25=0, impossible, so y=1 is never attained. …
- AP EAPCET 2024Set eng-2024-05-20-FN1 markMCQQ.Let a>1 and 0<b<1. If f:R→[0,1] is defined by f(x)={ax,bx,−∞<x<00≤x<∞, then f(x) is (A) A bijection (B) One-one but not onto (C) Onto but not one-one (D) Neither one-one nor onto
›Reveal solutionSolution
Neither branch of f ever reaches 0 (fails onto), and the two branches' ranges overlap on the whole of (0,1), so every value there is hit twice (fails one-one).
Concept and Intuition
To test a piecewise function for injectivity/surjectivity, examine each piece's range separately, then check for both (i) values in the codomain that are missed entirely, and (ii) values that are produced by both pieces (a collision across the pieces, not just within one).
Step-by-Step Solution
- Piece 1 (x<0): f(x)=ax with a>1 is strictly increasing in x. As x→−∞, ax→0+; as x→0−, ax→1−. So this piece is a bijection from (−∞,0) onto the open interval (0,1) — it never actually equals 0 or 1.
- Piece 2 (x≥0): f(x)=bx with 0<b<1 is strictly decreasing in x. At x=0, f=1; as x→∞, f→0+. So this piece bijects [0,∞) onto (0,1] — it attains 1 (at x=0) but never actually reaches 0.
- Onto check: is every value in the codomain [0,1] achieved? The value 0 is approached but never attained by either piece, so f is not onto. …
- AP EAPCET 2026Set eng-2026-05-14-FN1 markMCQQ.If a real valued function f:A→B defined by f(x)=∣x∣−[x] is a bijection, then A and B are respectively (A) [−∞,0] and [0,∞) (B) [−3,−2) and (5,6] (C) [1,2) and [3,4) (D) [0,∞) and [0,1)
›Reveal solutionSolution
The key idea is that f(x)=∣x∣−[x] equals the fractional part of ∣x∣ when x≥0, but behaves differently for negative x; for f to be a bijection, the domain and codomain must be chosen so that f is both one-to-one and onto. The correct pair is A=[1,2) and B=[3,4), option (C).
Why a Bijection Proof Works
A bijection means every element of A maps to a unique element of B (injective), and every element of B is hit (surjective). The function f(x)=∣x∣−[x] involves the absolute value and the greatest integer (floor) function. The floor [x] is the greatest integer ≤x. For x≥0, ∣x∣=x, so f(x)=x−[x], which is the fractional part of x, always in [0,1). For x<0, ∣x∣=−x, and [x] is negative or zero, so the expression behaves differently. The trick is to see that f is periodic in a certain sense, and we must pick intervals where it is strictly monotonic and covers a range exactly once.
Step-by-Step Reasoning
-
Understand f for x≥0
For x≥0, ∣x∣=x, so f(x)=x−[x]. This is the fractional part {x}, which lies in [0,1). It is periodic with period 1, and on each interval [n,n+1) (for integer n≥0), f(x)=x−n, which increases linearly from 0 to 1 (excluding 1). So on [0,∞), f is not injective because many x give the same fractional part (e.g., f(0.5)=0.5, f(1.5)=0.5). It is surjective onto [0,1).
-
Understand f for x<0
For x<0, ∣x∣=−x, so f(x)=−x−[x]. Write x=−n+r where n is a positive integer and r∈[0,1) (so x is in (−n,−n+1]). Then [x]=−n (since x is between −n and −n+1, the floor is −n). Then f(x)=−(−n+r)−(−n)=n−r+n=2n−r. So on (−n,−n+1], f(x)=2n−r, which decreases from 2n (when r=0, i.e., x=−n) to 2n−1 (when r→1−, i.e., x→−n+1−). Note: at x=−n, f(−n)=2n; at x=−n+1 (if included), f=2n−1. So the range on each negative interval is (2n−1,2n] (or [2n−1,2n] depending on endpoints). These intervals are disjoint and cover positive numbers > 0.
-
Combine the two cases
- For x≥0, f(x)∈[0,1).
- For x<0, f(x)∈(1,∞) (since 2n−1≥1 for n≥1, and 2n grows without bound). So f maps nonnegative numbers to [0,1) and negative numbers to (1,∞). The value 1 is never attained? Check: f(x)=1 would require x−[x]=1 (impossible, fractional part < 1) or 2n−r=1 => r=2n−1, but r∈[0,1), so only n=1 gives r=1, but r=1 is not in [0,1) (open at 1). So 1 is not in the range. Also 0 is attained at x=0 and at x any integer ≥0? Actually f(0)=0, f(1)=0, so not injective on [0,∞).
-
Condition for bijection
For f to be a bijection, the domain A must be chosen so that f is one-to-one on A and onto B. Since f is periodic on [0,∞), we must restrict A to an interval of length less than 1 (or exactly 1 but half-open) to avoid repeats. Similarly, on the negative side, each interval (−n,−n+1] gives a distinct range interval (2n−1,2n], so we can pick one such interval. The codomain B must match the image of A.
-
Test the options
- (A) A=[−∞,0] (likely (−∞,0]) and B=[0,∞). On (−∞,0], f takes values in (1,∞) plus f(0)=0, so 0 is hit, but [0,1) is not covered (except 0). Not onto [0,∞). Also not injective on (−∞,0] because multiple x give same f? Actually on (−∞,0], each negative interval gives a distinct range, but f is decreasing on each, so injective if we take a single interval. But (−∞,0] includes many intervals, so not injective. So no. …
-
- AP EAPCET 2025Set eng-2025-05-26-FN1 markMCQQ.A real valued function f:A→B defined by f(x)=4+x24−x2 ∀x∈A is a bijection. If −4∈A then A∩B= (A) (−1,1] (B) [0,1] (C) [0,∞) (D) (−1,0]
›Reveal solutionSolution
With −4∈A forcing A=(−∞,0] (the branch making the even function injective) and range B=(−1,1] on that branch, A∩B=(−1,0].
Concept and Intuition
f(x)=4+x24−x2 depends on x only through x2, so f(−x)=f(x) — it is an even function and therefore NOT one-one over all of R (e.g. f(1)=f(−1)). For f:A→B to be stated as a bijection, its domain A must be cut down to a set where distinct inputs never share the same x2 value — i.e., restricted to only non-negative or only non-positive x. Since we are told −4∈A, the restriction must be to the non-positive branch, A=(−∞,0], and B (as codomain of a bijection) must equal the exact range of f on that branch.
Step-by-Step Solution
- Rewrite f(x)=4+x24−x2=4+x2−(4+x2)+8=−1+4+x28.
- On A=(−∞,0], let u=x2∈[0,∞) as x ranges over A (bijective correspondence between x≤0 and u≥0, since squaring is injective on non-positive reals). Then f=−1+4+u8.
- As u increases from 0 to ∞, 4+u8 decreases from 2 to 0+, so f decreases from 1 (at u=0, i.e. x=0) to values approaching −1 (but never reaching it, as u→∞, i.e. x→−∞). …
- AP EAPCET 2024Set eng-2024-05-19-AN1 markMCQQ.If a real valued function f:[a,∞)→[b,∞) defined by f(x)=2x2−3x+5 is a bijection, then 3a+2b= (A) 20 (B) 10 (C) 12 (D) 6
›Reveal solutionSolution
A quadratic is a bijection on [a,∞)→[b,∞) exactly when a is its vertex and b is the corresponding minimum value; computing these for f(x)=2x2−3x+5 gives 3a+2b=10 — option (B).
Concept and Intuition
A quadratic f(x)=Ax2+Bx+C with A>0 is a downward-then-upward parabola with a single minimum at its vertex x0=−2AB. Restricted to [x0,∞), it is strictly increasing, hence one-one (injective); its range there is exactly [f(x0),∞), so it is automatically onto (surjective) that range. So for f:[a,∞)→[b,∞) to be a bijection, a must equal the vertex x0 (any larger a would still be injective, but then b must equal f(a) for surjectivity to hold onto exactly [b,∞) — and the natural/expected choice, matching how these problems are always set, is that a is exactly the vertex itself, the smallest valid starting point making it a bijection onto its natural range).
Step-by-Step Solution
- Here A=2,B=−3. Vertex: a=−2AB=−4−3=43.
- Minimum value: b=f(a)=2(43)2−3(43)+5. …
- AP EAPCET 2026Set eng-2026-05-18-FN1 markMCQQ.If the co domain of the function f(x)=⎩⎨⎧3sinx−4cosx,log(sinx),for x∈(tan−134−2π, tan−134+2π)for x∈(65π,π) is (−∞,5), then f is (A) an injection but not a surjection (B) a surjection but not an injection (C) a bijection (D) neither an injection nor a surjection
›Reveal solutionSolution
The function is defined piecewise on two disjoint intervals, and its range on each piece is computed and combined. The combined range equals the given codomain (−∞,5), but the function is not one-to-one because the same output can come from both pieces. Hence f is surjective but not injective — option (B).
We are given a piecewise function:
f(x)={3sinx−4cosx,log(sinx),x∈I1=(tan−134−2π, tan−134+2π)x∈I2=(65π,π)
and told that the codomain is (−∞,5). We must decide whether f is injective, surjective, both, or neither.
Intuition — Why a Bijection Proof Approach Works
The key is to find the actual range of f over its entire domain. If the range equals the codomain, the function is surjective. If every output comes from exactly one input, it is injective. Because the two pieces are on disjoint intervals, we can analyze each separately and then combine. The danger is assuming that because the pieces are separate, the function is automatically one-to-one — but the same y-value could appear in both pieces.
Step-by-step reasoning
- Simplify the first piece The expression 3sinx−4cosx can be rewritten as a single sine wave. Recall: Rsin(x−ϕ)=Rsinxcosϕ−Rcosxsinϕ. We want Rcosϕ=3 and Rsinϕ=4. Then R=32+42=5, and tanϕ=34, so ϕ=tan−134. Hence:
3sinx−4cosx=5sin(x−tan−134).
- Determine the range of the first piece on its interval The interval for x is:
I1=(tan−134−2π, tan−134+2π).
Let u=x−tan−134. Then as x runs over I1, u runs over (−2π,2π).
On this open interval, sinu is strictly increasing from −1 to 1, but does not include the endpoints because the interval is open.
So 5sinu takes all values in (−5,5).
Thus the range of the first piece is (−5,5).
-
Analyze the second piece
For x∈I2=(65π,π), we have f(x)=log(sinx).
On this interval, sinx is positive and decreasing: at x=65π, sinx=21; as x→π−, sinx→0+.
So sinx∈(0,21].
Taking log (natural log, presumably), log(sinx) ranges from log(0+)=−∞ up to log(21)=−log2.
Hence the range of the second piece is (−∞,−log2].
-
Combine the ranges
First piece: (−5,5)
Second piece: (−∞,−log2]
Note that −log2≈−0.693, which lies inside (−5,5). So the union of the two ranges is:
(−∞,5). …
🎓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.