Inverse Functions and Bijections
What you'll learn: You'll discover why only bijective functions can have proper inverses and how to construct them systematically.
Why Only Bijections Have Inverses
Imagine a function as a machine that pairs inputs with outputs. An inverse function reverses this process—it takes outputs back to their original inputs. But this reversal only works smoothly when the pairing is perfect.
For an inverse to exist, two conditions must hold:
-
Injectivity (one-to-one): Each output comes from at most one input. Without this, the inverse wouldn't know which input to return—there'd be ambiguity.
-
Surjectivity (onto): Every possible output actually appears. Without this, the inverse would be undefined for some values in the codomain.
A bijective function satisfies both conditions: it pairs elements perfectly, with no leftovers or duplicates. This makes it uniquely invertible.
Constructing an Inverse Function
Given a bijection f: A → B, its inverse f⁻¹: B → A is defined by:
f⁻¹(b) = a if and only if f(a) = b
The inverse "undoes" what the original function does. Key properties:
- f(f⁻¹(b)) = b for all b ∈ B
- f⁻¹(f(a)) = a for all a ∈ A
Example
Let f: ℝ → ℝ where f(x) = 2x + 3. This function is bijective:
- Injective: If f(x₁) = f(x₂), then 2x₁ + 3 = 2x₂ + 3, so x₁ = x₂
- Surjective: For any y ∈ ℝ, we can solve y = 2x + 3 to get x = (y - 3)/2
The inverse is f⁻¹(y) = (y - 3)/2, which perfectly reverses the original mapping.
Key Takeaway: Only bijective functions have inverses because only they establish a perfect, reversible one-to-one correspondence between domain and codomain elements.