Surjective Functions (Onto)
What you'll learn: You'll discover what it means for a function to be surjective, ensuring every output value is actually reached.
The Core Idea
A function f: A → B is surjective (or onto) when every element in the codomain B is mapped to by at least one element from the domain A. In other words, the range equals the entire codomain—nothing is left out.
Think of it like a delivery service: if you're surjective, you deliver packages to every single address in your delivery zone. Some addresses might get multiple packages (that's fine), but no address is forgotten.
Formally: f is surjective if for every b ∈ B, there exists at least one a ∈ A such that f(a) = b.
Recognizing Surjections
To verify surjectivity, pick an arbitrary element b from the codomain and show you can find (or construct) at least one domain element a where f(a) = b.
Example: Let f: ℝ → ℝ be defined by f(x) = 2x + 3.
Is this surjective? Take any real number y. We need to find an x such that 2x + 3 = y. Solving: x = (y - 3)/2. Since this works for any y ∈ ℝ, the function is surjective—every real number is hit.
Non-example: Let g: ℝ → ℝ be defined by g(x) = x².
Is this surjective? Consider y = -1. There's no real x where x² = -1. Since -1 (and all negative numbers) are never reached, g is not surjective.
Why It Matters
Surjectivity tells us about coverage: does our function use the full target set? Combined with injectivity (which you just learned), it leads to bijections—perfect one-to-one correspondences.
Key Takeaway: A function is surjective when every element of the codomain is an actual output—the range equals the codomain, leaving nothing unmapped.