What Is a Surjective Function Definition Formula and Solved Examples
The concept of surjective function is essential in mathematics and helps in solving real-world and exam-level problems efficiently. Understanding surjective functions forms a strong foundation for higher-level topics in functions and relations, making it vital for students preparing for board exams and competitive tests. Vedantu ensures students develop a deep and practical understanding of such concepts to build confidence in maths.
Understanding Surjective Function
A surjective function, also known as an onto function, is a mapping where every element in the codomain has at least one pre-image in the domain. In simple words, if each value in the codomain (output set) is “hit” or “covered” by the function from the domain, the function is surjective. This concept is widely used in function theory, set mappings, and algebraic relations. It is important in topics such as functions and its types, relations and functions, and mappings between sets.
What Does Surjective Function Mean?
In simple terms, a surjective function means:
Every output in the codomain comes from at least one input in the domain.
No element in the codomain is left out.
A surjective function is also called an "onto function".
The range and codomain are exactly the same in a surjective function.
Surjective, Injective, and Bijective: Quick Comparison
Function types can be confusing. The table below will help you see the difference clearly for your exams:
| Type | Definition | Nickname | Covers Every Output? |
|---|---|---|---|
| Injective | Each output has one unique input | One-to-one | No (may not cover all) |
| Surjective | Every output is mapped by some input | Onto | Yes |
| Bijective | Both injective and surjective | One-to-one onto | Yes, and each is unique |
Formula Used in Surjective Function
The standard definition for surjectivity is:
If \( f: A \rightarrow B \), then f is surjective if for every \( b \in B \), there exists at least one \( a \in A \) such that \( f(a) = b \).
Worked Example – How to Check if a Function is Surjective
Let’s solve a step-by-step example:
1. Consider \( f: \mathbb{R} \rightarrow \mathbb{R} \) defined by \( f(x) = 2x + 3 \). Is it surjective?2. Set \( f(x) = y \), so \( y = 2x + 3 \).
3. Solve for x:
Subtract 3: \( y - 3 = 2x \)
Divide by 2: \( x = \frac{y - 3}{2} \)
4. For every real number y, x is a real number.
5. Therefore, for every y in the codomain, there is a real x in the domain.
6. So, f(x) = 2x + 3 is a surjective function from \(\mathbb{R}\) to \(\mathbb{R}\).
Now try this one: Is \( f(x) = x^2 \) surjective from \( \mathbb{R} \) to \( \mathbb{R} \)?
For any negative y, \( x^2 = y \) has no real solution (since square of any real number is non-negative). So, this function is not surjective on these sets.
More Practice Problems
- Show that the function \( f: \mathbb{Z} \rightarrow \mathbb{Z} \), \( f(x) = x+1 \), is a surjective function.
- Is \( f(x) = e^x \) surjective from \( \mathbb{R} \) to \( \mathbb{R} \)?
- Given sets A = {1, 2, 3}, B = {a, b}, define a surjective function from A to B.
- Check if \( f(x) = |x| \) from \(\mathbb{R}\) to \([0, \infty)\) is a surjective function.
Common Mistakes to Avoid
- Forgetting that the codomain matters, not just the set of actual outputs (range).
- Assuming a function is surjective just because every input maps somewhere.
- Mixing up surjective (onto) with injective (one-to-one) functions.
- Not checking solutions for all elements of the codomain.
When is a Function Surjective? (Shortcuts & Visuals)
A function is surjective if:
- The range equals the codomain.
- No element in the codomain is left unmapped.
- In mapping diagrams, every output has at least one incoming arrow from the domain.
For real functions, check if for every y in the codomain you can solve for x in the domain.
Visual representations, like mapping diagrams or function graphs that “hit” the whole output set, can help you understand surjective functions better. For practice, check out function graph examples on Vedantu.
Real-World Applications of Surjective Function
Surjective functions play a role in assigning resources, scheduling events, cryptography, and modeling any process where all possible outcomes must be accounted for. Vedantu’s step-by-step explanations make it easy for students to connect the mathematical idea to real-life scenarios.
We explored the idea of surjective function, how to identify and prove surjectivity, solve related problems, and see how the concept works in real life. Practice more with Vedantu and keep exploring related topics for complete exam preparation.
Related Vedantu Pages
- Onto Function
- Bijective Function
- Functions and Its Types
- Relations and Functions
- Domain and Range Relations
- Differences Between Codomain and Range
- JEE Main Sets, Relations & Functions Revision Notes
- Sets, Relations & Functions Practice Paper
- Important Questions on Functions
- Relations & Functions Worksheet
FAQs on Surjective Function Explained with Definition and Key Properties
1. What is a surjective function?
A surjective function (onto function) is a function in which every element of the codomain has at least one pre-image in the domain. In other words, the range of the function is equal to its codomain.
- For a function f: A → B, f is surjective if for every b ∈ B, there exists a ∈ A such that f(a) = b.
- All outputs in B are "covered" by the function.
- No element in the codomain is left unmapped.
2. How do you determine if a function is surjective?
To determine if a function is surjective, you must show that every element in the codomain has at least one pre-image in the domain.
- Step 1: Take an arbitrary element y in the codomain.
- Step 2: Solve the equation f(x) = y.
- Step 3: If you can always find a solution x in the domain for every y, the function is surjective.
3. What is the difference between injective and surjective functions?
The main difference is that an injective function maps distinct inputs to distinct outputs, while a surjective function covers every element of the codomain.
- Injective (one-to-one): f(a₁) = f(a₂) implies a₁ = a₂.
- Surjective (onto): Every element in the codomain has a pre-image.
- A function can be injective only, surjective only, both (bijective), or neither.
4. Can you give an example of a surjective function?
An example of a surjective function is f: ℝ → ℝ defined by f(x) = x³.
- For any real number y, solve x³ = y.
- The solution is x = ∛y, which exists for all real y.
- Thus, every real number has a pre-image.
5. What is the formula or condition for a function to be surjective?
The formal condition for a function f: A → B to be surjective is: for every b ∈ B, there exists a ∈ A such that f(a) = b.
- This ensures the range equals the codomain.
- Symbolically: ∀b ∈ B, ∃a ∈ A such that f(a) = b.
- If even one element in B has no pre-image, the function is not surjective.
6. Is a linear function always surjective?
A linear function f(x) = ax + b is surjective over ℝ if and only if a ≠ 0 and the codomain is ℝ.
- If a ≠ 0, solving ax + b = y gives x = (y − b)/a.
- A solution exists for every real y.
- If a = 0, the function becomes constant and is not surjective.
7. What is a bijective function in relation to surjective functions?
A bijective function is a function that is both injective and surjective.
- Injective ensures no two inputs share the same output.
- Surjective ensures every element in the codomain is mapped.
- A bijective function has an inverse function.
8. How can you check surjectivity using the range?
You can check surjectivity by comparing the range of the function with its codomain.
- Step 1: Find the range of the function.
- Step 2: Compare it with the codomain.
- If range = codomain, the function is surjective.
9. Is the function f(x) = x² surjective?
The function f(x) = x² is not surjective over ℝ but is surjective over [0, ∞).
- Over ℝ: Negative numbers have no pre-image, so it is not onto.
- Over [0, ∞): For every y ≥ 0, x = ±√y gives a pre-image.
- Thus, surjectivity depends on the chosen codomain.
10. Why is surjective function important in mathematics?
A surjective function is important because it ensures complete coverage of the codomain and is required for a function to have an inverse when combined with injectivity.
- It plays a key role in defining bijections.
- It is used in algebra, calculus, and set theory.
- It ensures every output value is attainable.
