A Comprehensive Guide to Function
Mappings: Injective, Surjective, and
Bijective
Author: Manus AI
Date: January 27, 2026
Introduction to Functions and Mappings
In mathematics, a function (or mapping) is a rule that assigns each element in a set, called
the domain ($A$), to exactly one element in another set, called the codomain ($B$). The
set of all elements in the codomain that are actually mapped to is called the range of the
function. While the terms "function" and "mapping" are often used interchangeably,
"mapping" is sometimes preferred in more abstract contexts, particularly when the
codomain is not a set of numbers 4 .
The behavior of a function is classified based on how the elements of the domain relate to
the elements of the codomain. These classifications—injective, surjective, and bijective—
are crucial for understanding advanced mathematical concepts, including set cardinality
and invertibility.
1. Injective Functions (One-to-One)
An injective function, also known as a one-to-one function, ensures that every distinct
element in the domain maps to a distinct element in the codomain. In simpler terms, no
two elements in the domain share the same image in the codomain 1 .
Formal Definition
A function $f: A \to B$ is injective if and only if for all $x_1, x_2 \in A$:
f(x_1) = f(x_2) \implies x_1 = x_2
Algebraic Example
Consider the function $f: \mathbb{R} \to \mathbb{R}$ defined by $f(x) = 3x - 5$.
To prove injectivity, assume $f(x_1) = f(x_2)$:
3x_1 - 5 = 3x_2 - 5
3x_1 = 3x_2
x_1 = x_2
Since the assumption $f(x_1) = f(x_2)$ leads directly to $x_1 = x_2$, the function is injective.
Graphical Test
On a graph, an injective function must pass the Horizontal Line Test. Any horizontal line
drawn across the graph must intersect the function's curve at most once.
2. Surjective Functions (Onto)
A surjective function, or an onto function, requires that every element in the codomain is
the image of at least one element in the domain. For a surjective function, the range is
equal to the codomain 2 .
Formal Definition
A function $f: A \to B$ is surjective if and only if for every $y \in B$, there exists at least one
$x \in A$ such that $f(x) = y$.
Algebraic Example
Consider the function $f: \mathbb{R} \to \mathbb{R}$ defined by $f(x) = 3x - 5$.
To prove surjectivity, we must show that for any $y \in \mathbb{R}$ (in the codomain), we
can find an $x \in \mathbb{R}$ (in the domain) such that $f(x) = y$.
Let $y = 3x - 5$. Solving for $x$:
y + 5 = 3x
x = \frac{y + 5}{3}
Since $y$ is a real number, $x = \frac{y + 5}{3}$ is also a real number. Thus, for every $y$ in
the codomain, there is a corresponding $x$ in the domain, and the function is surjective.
3. Bijective Functions (One-to-One Correspondence)
A function that is both injective (one-to-one) and surjective (onto) is called a bijective
function, or a one-to-one correspondence. Bijective functions represent a perfect pairing
between the elements of the domain and the codomain 3 .
Key Property: Invertibility
The most significant property of a bijective function is that it is invertible. The inverse
function, $f^{-1}$, exists and is also a bijection from $B$ to $A$. This is because the perfect
pairing ensures that for every element in $B$, there is exactly one element in $A$ to map
back to.
Algebraic Example
The function $f: \mathbb{R} \to \mathbb{R}$ defined by $f(x) = 3x - 5$ is bijective because,
as shown in the previous sections, it is both injective and surjective.
Summary of Function Mappings
The following table summarizes the three main types of function mappings and the
conditions they satisfy.
Type of Mapping Alternative Name Condition on Condition on Invertibl
Domain ($A$) Codomain ($B$)
Distinct elements The range may be No (unle
Injective One-to-One map to distinct a proper subset of surjectiv
images. the codomain.
At least one The range must
Surjective Onto element maps to equal the No (unle
every element in codomain. injective
the codomain.
One-to-One Distinct elements The range must
Bijective Correspondence map to distinct equal the Yes
images. codomain.
Other Mapping Classifications
In addition to the three primary types, functions can also be classified by what they are not:
• Many-to-One Function: A function that is not injective, meaning at least two distinct
elements in the domain map to the same element in the codomain. For example, $f(x) =
x^2$ on $\mathbb{R}$ is many-to-one since $f(2) = 4$ and $f(-2) = 4$.
• Into Function: A function that is not surjective, meaning the range is a proper subset of
the codomain. For example, $f: \mathbb{R} \to \mathbb{R}$ defined by $f(x) = x^2$ is an
into function because its range is $[0, \infty)$, which is a proper subset of the codomain
$\mathbb{R}$.
Understanding these classifications is fundamental to fields ranging from abstract algebra
and topology to computer science, where bijections are essential for concepts like data
encryption and the comparison of infinite set sizes.
References
[1] Injective, Surjective and Bijective. Math is Fun.
[2] Bijection, injection and surjection. Wikipedia.
[3] Classes of Functions - Types, Difference and Examples. CK-12.
[4] Is there any difference between mapping and function?. Math Stack Exchange.