A function that isonto but not one to one, also called a surjective function that is not injective, is a fundamental concept in mathematics that appears across set theory, algebra, and analysis; this article explains the precise meaning of “onto” and “one‑to‑one,” contrasts the two properties, presents clear examples, highlights why such functions matter, and answers common questions, all while keeping the discussion accessible and engaging for readers of any background. ## Understanding Functions in Mathematics
Domain, Codomain, and Range
A function maps each element from a set called the domain to an element in another set called the codomain. The actual set of outputs produced is known as the range (or image).
- Domain: the set of all permissible inputs.
- Codomain: the set that the function is declared to map into.
- Range: the subset of the codomain that actually gets attained by the function.
Grasping these three notions is essential before discussing surjectivity and injectivity.
What Does “Onto” Mean? (Surjective Functions) A function is onto (or surjective) when every element of the codomain is hit by at least one element of the domain. Formally, a function (f: A \to B) is onto if for every (b \in B) there exists an (a \in A) such that (f(a)=b).
Key points: - The codomain must be explicitly stated; otherwise, “onto” has no reference point.
- Surjectivity does not require each codomain element to have a unique pre‑image; multiple domain elements may map to the same codomain element.
What Does “One‑to‑One” Mean? (Injective Functions)
A function is one‑to‑one (or injective) when different inputs always produce different outputs. Formally, (f: A \to B) is injective if (f(a_1)=f(a_2)) implies (a_1=a_2). Consequences:
- No two distinct domain elements share the same image.
- Injectivity is concerned solely with the uniqueness of outputs, not with covering the entire codomain.
Examples of Functions That Are Onto but Not One‑to‑One
Example 1: Parity Function on Integers
Consider the function (p: \mathbb{Z} \to {0,1}) defined by
[
p(n)=\begin{cases}
0 & \text{if } n \text{ is even},\
1 & \text{if } n \text{ is odd}.
\end{cases}
]
- Onto: Both 0 and 1 appear as outputs (every integer is either even or odd).
- Not one‑to‑one: Infinitely many even numbers map to 0, and infinitely many odd numbers map to 1.
Example 2: Floor‑Division Mapping on Natural Numbers
Define (g: \mathbb{N} \to \mathbb{N}) by (g(n)=\left\lfloor \frac{n}{2} \right\rfloor).
- Onto: For any (k \in \mathbb{N}), choose (n=2k) or (n=2k+1); then (g(n)=k).
- Not one‑to‑one: Both (2k) and (2k+1) share the same image (k).
Example 3: Cubic Polynomial on Real Numbers
Let (h: \mathbb{R} \to \mathbb{R}) be given by (h(x)=x^{3}-x) Worth keeping that in mind..
- **On
