Introduction
Understanding how to prove a function is surjective is a fundamental skill in mathematics, especially in set theory and calculus. In real terms, a surjective (or onto) function maps every element of its codomain to at least one element in its domain, meaning the range of the function equals the entire codomain. In practice, this article explains the concept step‑by‑step, provides a clear methodology, and offers several illustrative examples. By the end, you will be equipped to construct rigorous proofs that demonstrate surjectivity for a wide variety of functions.
Understanding Surjective Functions
A function (f: A \rightarrow B) is surjective if for every (b \in B) there exists at least one (a \in A) such that (f(a) = b). Simply put, the image of the function (the set of all output values) covers the whole codomain.
Key points to remember:
- Domain ((A)) is the set of all permissible inputs.
- Codomain ((B)) is the set that the function is declared to map into.
- Range (or image) is the actual set of outputs produced by (f).
If the range equals the codomain, the function is surjective. This property is distinct from injectivity (one‑to‑one) and bijectivity (both one‑to‑one and onto).
Steps to Prove a Function Is Surjective
-
Identify the codomain
Clearly state the set (B) that the function is mapped into. This is essential because surjectivity is defined relative to (B) But it adds up.. -
Take an arbitrary element of the codomain
Let (b) be any element in (B). To prove surjectivity, you must show that you can find a corresponding (a) in the domain such that (f(a) = b) Still holds up.. -
Solve the equation (f(a) = b) for (a)
Manipulate the expression (f(a) = b) algebraically or logically to isolate (a). The solution(s) must belong to the domain (A) Simple, but easy to overlook.. -
Verify that the solution lies in the domain
Check that the obtained (a) satisfies any constraints of the domain (e.g., non‑negativity, integer constraints, real numbers) And that's really what it comes down to.. -
Conclude existence
Since you have exhibited at least one (a) for an arbitrary (b), the definition of surjectivity is satisfied Not complicated — just consistent. But it adds up.. -
Summarize
State explicitly that because every (b \in B) has a pre‑image (a \in A), the function (f) is surjective.
Example of the Step‑by‑Step Process
Consider the function (f: \mathbb{R} \rightarrow \mathbb{R}) defined by (f(x) = 2x + 3).
- Codomain: (B = \mathbb{R}).
- Arbitrary element: Let (b \in \mathbb{R}) be any real number.
- Solve: Set (2x + 3 = b). Subtract 3: (2x = b - 3). Divide by 2: (x = \frac{b - 3}{2}).
- Domain check: Since (\frac{b - 3}{2}) is a real number for any real (b), it belongs to (\mathbb{R}).
- Conclusion: For every (b) there exists an (x) (namely (\frac{b - 3}{2})) such that (f(x) = b). Hence, (f) is surjective.
Common Pitfalls When Proving Surjectivity
- Assuming the codomain equals the range without justification: Always demonstrate that every element of (B) is attained, not just that the range looks “large.”
- Overlooking domain restrictions: A solution to (f(a) = b) may fall outside the allowed domain, invalidating the proof.
- Using specific values only: Proving surjectivity requires a general argument for an arbitrary (b); checking a few examples is insufficient.
- Confusing surjectivity with injectivity: Remember that surjectivity concerns coverage of the codomain, while injectivity concerns distinct inputs producing distinct outputs.
Formal Proof Templates
Below are two common templates you can adapt depending on the nature of the function Most people skip this — try not to..
Template 1: Algebraic Functions
- Let (f: A \rightarrow B) be defined by a formula.
- Take an arbitrary (b \in B).
- Set (f(a) = b) and solve for (a).
- Verify that the solution (a) satisfies the domain conditions.
- Conclude that (\forall b \in B, \exists a \in A) such that (f(a) = b).
Template 2: Piecewise or Constructive Functions
- Define the function piecewise, specifying each branch.
- For an arbitrary (b \in B), determine which branch can produce (b).
- Provide an explicit construction of (a) (or a method to find it) for each case.
- Ensure the constructed (a) lies in the appropriate sub‑domain.
- Conclude surjectivity by covering all possible (b).
Worked Examples
Example 1: Linear Function
Function: (f: \mathbb{Z} \rightarrow \mathbb{Z}) defined by (f(n) = 3n + 1).
Proof:
- Codomain: (B = \mathbb{Z}).
- Arbitrary element: Let (b \in \mathbb{Z}) be any integer.
- Solve: (3n + 1 = b \Rightarrow 3n = b - 1 \Rightarrow n = \frac{b - 1}{3}).
- Domain check: For (n) to be an integer, (b - 1) must be divisible by 3. Not every integer (b) satisfies this, so the function is not surjective onto (\mathbb{Z}).
Conclusion: The function fails to hit every integer, hence it is not surjective.
Example 2: Quadratic Function onto Positive Reals
Function: (f: \mathbb{R} \rightarrow (0, \infty)) defined by (f(x) = x^2).
Proof:
- Codomain: (B = (0, \infty)).