Q.Show that the function f:R→{x∈R:−1<x<1} defined by f(x)=1+∣x∣x, x∈R is one one and onto function.
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
A bijection sets up a perfect one-to-one correspondence between A and B. For finite sets this forces ∣A∣=∣B∣, and in general it is exactly the condition for f to possess an inverse function f−1:B→A.
Proving a function is a bijection by separately establishing injectivity and surjectivity is a standard long-answer question format in the CBSE Class 12 Relations and Functions chapter, closely matching the worked template shown here. "Prove f(x) = 2x + 3 is a bijection" style problems are commonly searched by board exam students, and the same two-step method is used in JEE Main function proofs.
Concept: Bijection Proof — show injectivity (one-one) and surjectivity (onto) separately.
Step 1: One-one.
Take x1,x2∈R with f(x1)=f(x2).
Then 1+∣x1∣x1=1+∣x2∣x2.
If x1 and x2 have the same sign (or are zero), cross-multiplying gives x1=x2. If they have opposite signs, the left side is non-negative and the right side non-positive (or vice versa), forcing both to be zero, so x1=x2=0. Hence f is injective.
Step 2: Onto.
Let y∈(−1,1). We need x such that f(x)=y.
If y≥0, take x=1−yy≥0; then ∣x∣=x and f(x)=y.
If y<0, take x=1+yy (negative); then ∣x∣=−x and f(x)=y.
Thus every y in (−1,1) has a preimage, so f is surjective.
The function f(x)=1+∣x∣x is a bijection from R onto (−1,1).
The function f(x)=1+∣x∣x is a bijection from R to (−1,1). It is strictly increasing (hence one-one) and its range is exactly (−1,1) (hence onto). The key insight: the absolute value in the denominator splits the function into two simple rational pieces, each mapping its half of the real line onto half of the interval.
Why a Bijection Proof Works
To show a function is both one-one (injective) and onto (surjective), we need to prove two things:
-
One-one: Different inputs give different outputs. For a real function, showing it is strictly increasing (or strictly decreasing) is often the cleanest route — because if a<b implies f(a)<f(b), then f(a)=f(b) can only happen when a=b.
-
Onto: Every element in the codomain (−1,1) is actually hit by some input. This means we need to show the range of f is exactly (−1,1).
The function f(x)=1+∣x∣x is cleverly designed: the ∣x∣ in the denominator "clamps" the output between −1 and 1 without ever reaching them. For positive x, it becomes 1+xx; for negative x, it becomes 1−xx (since ∣x∣=−x when x<0). Both are simple rational functions that are easy to analyze.
The split at x=0 is natural: ∣x∣ changes behaviour there. Always handle absolute value functions by considering cases x≥0 and x<0 separately.
Step-by-Step Proof
1. Write the function piecewise.
For x≥0, ∣x∣=x, so
f(x)=1+xx.
For x<0, ∣x∣=−x, so
f(x)=1−xx.
Notice that for x<0, the denominator 1−x>1, so f(x) is negative (since numerator is negative, denominator positive).
2. Show f is one-one (injective).
We'll prove f is strictly increasing on all of R.
Case 1: x≥0.
Consider f(x)=1+xx. For 0≤a<b, we have
f(b)−f(a)=1+bb−1+aa=(1+b)(1+a)b(1+a)−a(1+b)=(1+b)(1+a)b−a>0.
So f is strictly increasing on [0,∞).
Case 2: x<0.
For a<b<0, write a=−p, b=−q with p>q>0 (since a<b<0 means −a>−b>0). Then
f(a)=1+p−p,f(b)=1+q−q.
Since p>q, and t↦1+tt is strictly increasing for t>0 (shown in Case 1), we have 1+pp>1+qq, so −1+pp<−1+qq, meaning f(a)<f(b). So f is also strictly increasing on (−∞,0).
At the junction x=0:
For any x<0, f(x)<0=f(0). For any x>0, f(x)>0=f(0). So the function is strictly increasing across 0 as well.
Thus f is strictly increasing on all of R, which implies it is one-one.
A common mistake: assuming a piecewise function is automatically increasing if each piece is increasing. You must also check the behaviour at the boundary (x=0 here) to ensure no "jump down" occurs. Here f(0)=0 sits between the negative outputs (left) and positive outputs (right), so the function is indeed strictly increasing overall.
3. Show f is onto (surjective).
We need to prove that for any y∈(−1,1), there exists an x∈R such that f(x)=y.
Case 1: y≥0.
We look for x≥0 such that 1+xx=y. Solve:
x=y(1+x)⟹x=y+yx⟹x−yx=y⟹x(1−y)=y⟹x=1−yy.
Since 0≤y<1, 1−y>0, so x≥0 is valid. Check: f(1−yy)=1+y/(1−y)y/(1−y)=(1−y+y)/(1−y)y/(1−y)=y. So every y∈[0,1) is hit.
Case 2: y<0.
We look for x<0 such that 1−xx=y (since ∣x∣=−x for x<0). Solve:
x=y(1−x)⟹x=y−yx⟹x+yx=y⟹x(1+y)=y⟹x=1+yy.
Since −1<y<0, 1+y>0, so x=1+yy is negative (numerator negative, denominator positive). Check: f(1+yy)=1−y/(1+y)y/(1+y)=(1+y−y)/(1+y)y/(1+y)=y. So every y∈(−1,0) is hit.
Together, every y∈(−1,1) is attained: for y≥0 we use x=1−yy, and for y<0 we use x=1+yy.
Notice the symmetry: the inverse function is also piecewise. For y≥0, f−1(y)=1−yy; for y<0, f−1(y)=1+yy. This is a neat check that the function is indeed bijective.
4. Conclude.
Since f is both one-one and onto, it is a bijection from R to (−1,1).
The function f(x)=1+∣x∣x is a bijection from R onto (−1,1); it is both one-one (strictly increasing) and onto (every y∈(−1,1) has a preimage).
Method: Proving a bijection for an absolute-value function via cases
For f(x)=1+∣x∣x, split at x=0 to remove the modulus, then prove one-one (monotonic) and onto (solve for a preimage) piece by piece.
Steps
Step 1: Write the function piecewise
For x≥0, f(x)=1+xx; for x<0, f(x)=1−xx. Handle each piece separately.
Step 2: One-one via strict monotonicity
Show each piece is strictly increasing (compare f(b)−f(a) for a<b), and check the pieces join without a downward jump at x=0. A strictly increasing function is one-one.
Step 3: Onto by inverting on each range
For a target y in the codomain, solve f(x)=y per case: y≥0 gives x=1−yy, y<0 gives x=1+yy; confirm the sign of x matches the case. Every y∈(−1,1) then has a preimage.
Common Mistakes
Mistake 1: Trying to handle 1+∣x∣x without splitting the modulus into cases.
Why it's wrong: ∣x∣ behaves differently for x≥0 and x<0, so a single manipulation mishandles the sign. Correct approach: write 1+xx for x≥0 and 1−xx for x<0, then work each case.
Mistake 2: Assuming a piecewise function is increasing just because each piece is.
Why it's wrong: the pieces could jump downward at the join. Correct approach: check x=0 — here f(x)<0 for x<0 and f(x)>0 for x>0 around f(0)=0, so it is strictly increasing overall.
- 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.
- One-one check: consider any value v∈(0,1) (strictly between 0 and 1). Piece 1 gives exactly one x1<0 with ax1=v (since it's a bijection onto (0,1)). Piece 2 gives exactly one x2>0 with bx2=v (since it's a bijection from (0,∞) onto (0,1), excluding the point x=0↦1). So every v∈(0,1) has two distinct pre-images, x1 and x2 — f is not one-one.
- Hence f is neither one-one nor onto.
Common Mistakes
- Checking injectivity only within each piece and forgetting to check for collisions between the two pieces.
- Assuming the codomain restriction to [0,1] automatically makes the map onto, without checking whether every value is actually attained.
✓Final answerThe correct option is (D) — Neither one-one nor onto.
ANSWER: D
- 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.
- (B) A=[−3,−2) and B=(5,6]. For x∈[−3,−2), we have n=3 (since x in (−3,−2]? Actually [−3,−2) includes −3 but not −2. At x=−3, f(−3)=6; as x→−2−, f(x)→5. So the image is (5,6] (including 6, excluding 5). That matches B=(5,6]. And on this interval, f is strictly decreasing, so injective. So this is a bijection! But wait: the question asks for A and B respectively. Option (B) gives A=[−3,−2) and B=(5,6], which works. However, we must check if any other option also works.
- (C) A=[1,2) and B=[3,4). For x∈[1,2), f(x)=x−1 (since [x]=1), so f(x)∈[0,1). That gives B=[0,1), not [3,4). So this is false unless we misinterpret? Wait, f(x)=∣x∣−[x], for x≥0 it's fractional part, so [1,2) maps to [0,1). But option says B=[3,4). That doesn't match. So (C) is wrong.
- (D) A=[0,∞) and B=[0,1). As argued, f on [0,∞) is not injective (many x give same fractional part), so not a bijection.
So only (B) seems to work. But let's double-check (C) — maybe they intend A to be negative? No, [1,2) is positive. So (C) is out.
However, wait: The problem says "A and B are respectively" meaning we need the pair. Option (B) gives a valid bijection. But is there any trick? For A=[−3,−2), f maps to (5,6], which matches B. So (B) is correct.
But let's verify the endpoints: x=−3 gives f(−3)=∣−3∣−[−3]=3−(−3)=6; x approaching −2 from below gives f(x)=−x−[x], with [x]=−3 for x∈(−3,−2), so f(x)=−x−(−3)=−x+3, which as x→−2− gives 2+3=5, but not including 5. So image is (5,6], exactly B. So yes.
Thus the correct option is (B).
Watch outA common mistake is to assume f(x) is always the fractional part. For negative x, ∣x∣−[x] is not the fractional part; it gives values greater than 1. Always test with a negative example like x=−2.5: f=2.5−(−3)=5.5.
TipFor x in (−n,−n+1], f(x)=2n−{−x}? Actually simpler: f(x)=−x−[x] and [x]=−n, so f(x)=−x+n. Since x=−n+r, f=n+r? Wait recalc: x=−n+r, 0≤r<1, then f=−(−n+r)−(−n)=n−r+n=2n−r. So it decreases from 2n to 2n−1 as r goes 0 to 1. So the range is (2n−1,2n].
✓Final answerThe correct option is (B).
ANSWER: B
-
- 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→−∞).
- So as x ranges over (−∞,0], f(x) ranges over (−1,1]: this is exactly B (since f:A→B is onto by definition of bijection).
- Compute A∩B=(−∞,0]∩(−1,1]: this keeps every value that is both ≤0 and in (−1,1], giving (−1,0].
Common Mistakes
- Taking A=[0,∞) by default (the "natural" injective branch) without checking that −4∈A forces the other branch, (−∞,0].
- Getting the open/closed endpoints of the range wrong — the limit −1 is approached as x→−∞ but never attained (open), while f(0)=1 is attained exactly (closed).
✓Final answerThe correct option is (D) — (−1,0].
ANSWER: D
- 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.
- Check the rejects: (A) A=(−∞,0] gives range [f(0),∞)=[2,∞), not (−∞,−41]. (C) A=[23,∞) gives range [−41,∞), but B is stated as (−∞,−41] — wrong. (D) the full line is not injective at all.
Common Mistakes
- Forgetting that a bijection needs the codomain to be the exact range, not just an over-estimate.
- Picking the wrong side of the vertex (left branch decreasing vs. right branch increasing) and mismatching it with the stated range.
✓Final answerThe correct option is (B) — A=(−∞,23],B=[4−1,∞).
ANSWER: B
- 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.
- For f to be a bijection onto R−{m}, this excluded value must be exactly m: m=1.
- 3l+2m=3(2)+2(1)=6+2=8.
Common Mistakes
- Swapping which constant is l (domain gap) and which is m (codomain gap).
- Trying to solve y=x−2x+3 for x incorrectly and missing that y=1 is the singular value.
✓Final answerThe correct option is (C) — 8.
ANSWER: C
- 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. =2⋅169−49+5=89−818+840=831.
- Compute 3a+2b=3⋅43+2⋅831=49+862=818+862=880=10.
Common Mistakes
- Forgetting to restrict the domain to exactly the vertex (using an arbitrary a instead) — the bijection condition pins down a uniquely as the vertex.
- Arithmetic slips converting 43 and 831 to a common denominator.
✓Final answerThe correct option is (B) — 3a+2b=10.
ANSWER: B
- 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).
This exactly matches the given codomain. Therefore f is surjective.
- Check injectivity
Since the two intervals are disjoint, we must check whether a single y-value can come from both pieces.
For example, take y=0.
- From the first piece: 5sinu=0 when u=0, i.e., x=tan−134, which is inside I1.
- From the second piece: log(sinx)=0 when sinx=1, but sinx=1 at x=2π, which is not in I2. So that doesn't work. But try y=−1:
- First piece: 5sinu=−1 gives sinu=−0.2, which has a solution in (−π/2,π/2).
- Second piece: log(sinx)=−1 gives sinx=e−1≈0.3679. On (65π,π), sinx decreases from 0.5 to 0, so it takes the value 0.3679 exactly once. Thus the same output −1 comes from two different inputs (one in each piece). Hence f is not injective.
Watch outA common mistake is to think that because the domain intervals are disjoint, the function is automatically one-to-one. But injectivity requires that no two distinct inputs (even from different pieces) give the same output. Always check for overlap in the ranges.
✓Final answerThe correct option is (B).
ANSWER: B
🎓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.