Bijective Functions (One-to-One Correspondence)
What You'll Learn
You'll learn how bijective functions create a perfect pairing between two sets, where every element from each set has exactly one unique partner in the other.
The Core Idea
A bijective function (or bijection) is a function that is both injective (one-to-one) and surjective (onto). This means:
- Injective: No two different elements in the domain map to the same element in the codomain
- Surjective: Every element in the codomain is mapped to by at least one element in the domain
When both properties hold simultaneously, you get a one-to-one correspondence — a perfect matching between sets where each element on the left pairs with exactly one element on the right, and vice versa.
Why This Matters
Think of a bijection like assigning lockers to students when you have exactly the right number of lockers: each student gets their own unique locker (injective), and no locker sits empty (surjective). Perfect pairing!
Bijections are special because they're invertible — you can "reverse" them. If f: A → B is bijective, there exists an inverse function f⁻¹: B → A that undoes what f does.
Example
Consider f: ℝ → ℝ defined by f(x) = 2x + 3.
- Injective? If
f(x₁) = f(x₂), then2x₁ + 3 = 2x₂ + 3, sox₁ = x₂. ✓ - Surjective? For any
y ∈ ℝ, we can solvey = 2x + 3to getx = (y - 3)/2. ✓
Since f is both injective and surjective, it's bijective — establishing a perfect one-to-one correspondence between all real numbers.
Key Takeaway: A bijective function creates a perfect pairing between sets where each element has exactly one unique partner — it's both one-to-one (injective) and onto (surjective), making it invertible and preserving the "size" of sets.