Definition
A bijective function (or bijection) is a function that is both injective (one-to-one) and surjective (onto). It creates a perfect one-to-one correspondence between every element of the domain and every element of the codomain.
Why It Matters
They are the mathematical requirement for perfect translations and data compression, ensuring no information is lost between systems. This one-to-one link is what allows for the perfect reconstruction of digital signals after transmission.
Core Concepts
- Perfect Correspondence: Each element in the codomain is mapped to by exactly one element in the domain.
- Invertibility: A function has a well-defined inverse if and only if it is bijective.
- How to read: “The inverse function f inverse exists if and only if f is bijective.”
- Meaning: Bijection guarantees you can undo without ambiguity—every output maps back to exactly one input.
- Cardinality: If a bijection exists between two sets, they must have the same size (cardinality). This is how we compare the sizes of infinite sets.