Bijective function
A function that is both injective and surjective.
Bijective function
A function is bijective if it is injective and surjective ; equivalently,
where means “there exists exactly one.”
Bijectivity is the precise condition for the existence of an inverse function satisfying and .
Examples:
- , is bijective.
- is bijective.
- is not bijective from to (not injective and not surjective), but it is bijective from to .