Injective Functions (One-to-One)
What You'll Learn
You'll learn how injective functions guarantee that different inputs always map to different outputs, making them "one-to-one."
The Core Idea
An injective function (also called a one-to-one function) is a special type of function where no two distinct elements in the domain map to the same element in the codomain. In other words, if f(a) = f(b), then it must be true that a = b.
Think of it like assigning unique student ID numbers: each student gets exactly one ID, and no two students share the same ID. If you see ID #4729, you know exactly which student it belongs to—you can work backward uniquely.
Formal Definition
A function f: A → B is injective if and only if:
For all x₁, x₂ ∈ A, if f(x₁) = f(x₂), then x₁ = x₂.
Equivalently (using the contrapositive): if x₁ ≠ x₂, then f(x₁) ≠ f(x₂).
Examples
- Injective:
f(x) = 2x + 3on real numbers. Different inputs always yield different outputs. - Not injective:
g(x) = x²on real numbers. Hereg(2) = g(-2) = 4, so distinct inputs map to the same output. - Injective: The function mapping each person to their fingerprint pattern (assuming no two people share identical prints).
Why It Matters
Injective functions are crucial because they preserve distinctness—you can always "reverse-engineer" which input produced a given output. This property is essential for defining inverse functions and understanding function composition in deeper mathematics.
Key Takeaway: An injective (one-to-one) function never maps two different inputs to the same output, ensuring each element of the range corresponds to exactly one element in the domain.