Procedure
Testing one-one and onto
Algebra • Functions
Statement
is one-one if ; onto if for each some has . It is bijective if it is both.
How to use it
- 1For onto, solve for , then check that this lies in the domain for every in the codomain.
- 2If the equation has exactly one solution in the domain for every , is bijective.
Worked example
Is , , bijective?
Step-by-step
- 1
Why: Solve for .
- 2For this exists, and would need , impossible
Why: So is in the domain, and it is the only solution.
- 3Exactly one for each : one-one and onto
Answer
Yes, it is bijective.
Watch out
Onto depends on the codomain. With codomain , the value would be missed and would not be onto.