Functions:Bijective
Jump to navigation
Jump to search
A function is bijective if it is both injective and surjective. That is, a bijective function maps each element of the domain to a distinct element in the codomain, and every element in the codomain is mapped to by exactly one element of the domain.
Examples of bijective functions:
- such that , , and
Resources
- Course Textbook, pages 154-164