In mathematics, an onto function, also known as a surjective function, is a type of mapping where every element of the codomain has at least one corresponding element in the domain. This means the range of the function is equal to its codomain. Onto functions are essential in understanding advanced concepts like inverse functions and bijections. They are widely used in algebra, calculus, and real-world applications involving full data coverage or target mapping.
In mathematics, an onto function (also called a surjective function) is a type of function where every element of the codomain is mapped by at least one element of the domain.
In simple terms, a function is onto if range(f) = codomain(B).
An onto function ensures that no element in the codomain is left unmapped. This makes it a surjective function. In set theory, it means for every , there exists at least one a A such that f(a) = b.
Let f: . Then f is onto if:
, such that f(a) = b
This is the onto function condition for surjectivity.
To check if a function is onto:
In a graph of an onto function, every y-value in the codomain is covered by the graph. For real-valued functions, this means the range spans the entire codomain.
For example, the function:
is onto because for every real number y, we can find an such that:
Hence, every y has a corresponding x: the function is onto.
Example 1: Is the function f(x) = 2x + 3, defined as , an onto function?
Solution:
To check if f is onto, solve for x in terms of y:
Since for every , there exists an , the function is onto.
Answer: The function is onto.
Example 2: Check if , defined as , is an onto function.
Solution:
The range of , not the entire codomain .
Negative values like y = -1 have no real pre-image.
Answer: The function is not onto.
Example 3: Is , defined as , onto?
Solution:
The range of , so values like y = -1 are not covered.
Answer: The function is not onto.
Example 4: Let A = {1, 2, 3}, B = {a, b}, and defined by Is f onto?
Solution:
Elements of B: a and b are both mapped from elements in A. Hence, the codomain is completely covered.
Answer: The function is onto.
Example 5: Check if , defined as , is onto.
Solution:
Let
Solve for x:
The expression is valid for all , which matches the codomain.
Answer: The function is onto.
A function that is both one-one (injective) and onto (surjective) is called bijective.
Properties:
(Session 2025 - 26)