Injectivity, Surjectivity, and Bijectivity for Functions on
We consider . For each function , we determine where is injective , surjective , or bijective.
Key idea: on an interval, injectivity is guaranteed if the function is strictly monotone; surjectivity depends on whether the range equals .
We will treat “where it is injective/surjective” as the largest subdomain(s) of on which those properties hold.
Mermaid roadmap:
Injective vs Surjective vs Bijective (Intuition + Examples)
Common toolkit (used in both parts)
- Image (range):
- Injective:
- Surjective onto :
- Bijective: both injective and surjective
Injectivity subdomains: if a function changes monotonicity at some point (e.g., where derivative changes sign), it is typically injective only on intervals that do not cross that point.
Surjectivity: if or , then it cannot be onto .
Important note (for this problem): Both parts specify , so “surjective” means onto exactly.
Pro Tip
To find injective regions on an interval, look for where monotonicity breaks (often where or changes sign). Then compare the resulting range to for surjectivity.
How to classify injective/surjective/bijective
Fix $A=B=[-1,1]$
1) Identify codomainSurjectivity means ."
Check collisions
2) Injectivity testIf with , not injective."
Use strict monotonicity
3) Monotonicity shortcutStrictly increasing/decreasing on a subinterval implies injective there."
Compute range endpoints
4) Surjectivity testIf and and the range is continuous, then likely onto ."
(i) on
We analyze on the symmetric interval .
Step 1: Determine injective regions
Consider where achieves its “turning point” on .
- has derivative .
- when , i.e. . Within , the critical point is at and also at (from ).
Thus the monotonicity switches at and . Therefore is:
- strictly increasing on ,
- strictly decreasing on ,
- strictly increasing on .
Hence is injective on each of those subintervals, but not injective on subdomains that include both sides of a switch (e.g., including both and typically creates collisions because the function is not one-to-one globally).
We can also exhibit a collision explicitly:
- (odd), so collisions occur when two different give the same sine value—e.g. symmetry around can produce equal outputs at distinct points within .
Largest injective subdomains (maximal intervals):
- ,
- ,
- .
(Each is an interval where is strictly monotone, hence injective.)
Step 2: Determine surjectivity onto
Compute the range over :
Since is continuous and it attains and on , its image is exactly .
Therefore, is surjective on .
Step 3: Bijectivity
For bijectivity, we need injective on all of plus surjective.
- We already know is not injective on all of (because it is not monotone on the whole interval).
- It is surjective on all of .
So is not bijective on , but it is bijective on each maximal injective subinterval where the range matches the codomain of that restricted mapping.
However, the codomain is still in the original statement. If we interpret the question strictly as: “where is injective/surjective/bijective as a function ,” then:
- Surjectivity on holds.
- Injectivity holds only on those subdomains (as restricted functions), while surjectivity generally fails on smaller subdomains unless their ranges still cover .
So the final classification:
- Injective: on , ,
- Surjective: on all
- Bijective: none on all of (not injective globally)
Classification workflow for $g(x)=\sin(\pi x)$
- 1Step 1
Compute and solve in to locate and .
- 2Step 2
Check the sign of to conclude increasing on , decreasing on , increasing on .
- 3Step 3
On each monotonic interval, is strictly monotone, hence injective there.
- 4Step 4
Evaluate and , and use continuity to get .
- 5Step 5
Because , is surjective on . Since is not injective on all of , it is not bijective on .
Key values of on
Used to decide surjectivity (does the range hit both -1 and 1?).
(ii) on
This is a linear function, so its behavior is straightforward.
Step 1: Injectivity on
A linear function (with ) is strictly monotone (here increasing because ), hence injective on all of .
So is injective on .
Step 2: Surjectivity onto
Compute the image of the endpoints:
Because is continuous and linear, .
But , and . In particular, values like and are not attained.
So is not surjective on .
Step 3: Bijectivity
Bijectivity requires both injectivity and surjectivity onto the given codomain .
- Injective: yes on all of
- Surjective: no onto
Therefore is not bijective (as a map ).
If we were allowed to change the codomain to , then would become bijective—but under the problem’s fixed , it is not.
Be careful about the codomain
Injectivity depends only on the domain restriction. Surjectivity depends on the codomain . Here is fixed, so cannot be surjective since its range is only .
Final answers (summary tables)
(i) with
- Injective on: , ,
- Surjective on:
- Bijective on: nowhere on all of (not injective globally)
(ii) with
- Injective on:
- Surjective on: nowhere (range misses )
- Bijective on: nowhere (injective but not surjective onto )
Common edge-case interpretations
Injective/Surjective/Bijective quick checks
Knowledge Check
For , which statement about is correct?