Why One-to-One and Onto Matter
Explain how bijections make reversible input–output rules possible.
The bigger question: What does a function tell us—and what can it hide?
On this page
Idea
A bijection is both injective and surjective. Every target has exactly one preimage, so reversing the input-output assignment produces a well-defined inverse function.
Visual guide
Forward pairing
Inverse pairing
Method
If is bijective, then satisfies
Surjectivity guarantees existence of the reverse assignment; injectivity guarantees uniqueness.
Worked example
The function , , is bijective. Its inverse is . If its domain expands to all real numbers, uniqueness is lost. If its codomain expands to all real numbers, some targets have no preimage.
Try it yourself.
Choose an answer and explain your reasoning to yourself. Use a hint if you get stuck.
Hint 1 · Find a starting point
The inverse must accept every codomain value and return exactly one input.
Hint 2 · Take the next step
Onto guarantees an input exists; one-to-one guarantees it is unique.
Show the reasoning
Answer: Both one-to-one and onto
Both conditions are needed for an inverse on the whole codomain.
Before moving on: what would make one of the other answers wrong? Saying why is part of understanding.
Common mistake
An inverse is not a reciprocal: usually differs from .
Check your understanding
Give the inverse of , .
Show answer
. Both compositions simplify to the identity.
Pause before the next idea.
Can you explain how the visualization connects to this lesson’s goal? If a step still feels uncertain, put this lesson on your review list and try the check again another day.