One-to-One Functions - College Algebra

SECTION 1

Historical Context & Motivation

The concept of a function evolved over centuries, from the intuitive notion of a rule that assigns outputs to inputs into the rigorous set-theoretic definition used in modern mathematics. As mathematicians refined the function concept, they recognized that not all functions behave the same way with respect to the uniqueness of their outputs. Some functions map distinct inputs to distinct outputs, while others "collapse" multiple inputs onto the same output value. This distinction—between injective (one-to-one) and non-injective functions—became critical once mathematicians needed to reverse the action of a function, that is, to construct inverse functions. The journey from informal correspondence rules to the precise language of injectivity spans several key milestones in the history of mathematics.

1673 • Leibniz Introduces 'Functio'

Gottfried Wilhelm Leibniz used the Latin word functio to describe quantities depending on a curve, laying the groundwork for formalizing the idea that one quantity determines another.

1748 • Euler's Analytic Framework

Leonhard Euler, in Introductio in Analysin Infinitorum, defined a function as an analytic expression composed of variables and constants, making the input–output relationship explicit and algebraic.

1837 • Dirichlet's General Definition

Peter Gustav Lejeune Dirichlet proposed that a function is any rule assigning a unique output to each input, freeing the concept from requiring a single analytic formula and opening the door to studying arbitrary correspondences.

1939 • Bourbaki Formalizes Injectivity

The Bourbaki collective introduced the terms injection, surjection, and bijection to classify functions by their mapping behavior, giving one-to-one functions a precise place in the taxonomy of maps.

This historical arc reveals a central question: given a function f, when can we "undo" it? If two different inputs produce the same output, there is no unambiguous way to reverse the process. Thus the notion of a one-to-one function answers a foundational need in algebra and analysis—it is the precise condition under which a function possesses an inverse that is itself a function.

SECTION 2

Core Principles & Definitions

A function f : A → B is called one-to-one (or injective) if every element of the codomain B is mapped to by at most one element of the domain A. In other words, no two distinct inputs produce the same output. This property is the gateway to constructing inverse functions, and it connects deeply to the structure of the function's graph. The following core ideas form the foundation of the concept.

Formal Definition

A function f is one-to-one if and only if for all a₁, a₂ in the domain, f(a₁) = f(a₂) ⟹ a₁ = a₂. Equivalently, a₁ ≠ a₂ ⟹ f(a₁) ≠ f(a₂).

Horizontal Line Test

A function is one-to-one if and only if every horizontal line intersects its graph in at most one point. This graphical criterion complements the algebraic definition and provides an immediate visual check.

Inverse Existence

A function f possesses an inverse function f⁻¹ if and only if f is one-to-one. The inverse reverses the mapping: f⁻¹(y) = x whenever f(x) = y.

Monotonicity Implies Injectivity

If a function is strictly increasing or strictly decreasing on its entire domain, it is automatically one-to-one. This is a sufficient (but not necessary) condition.

✦

KEY TAKEAWAY

Think of a one-to-one function like a coat-check system at a theater. Each patron (input) hands in a coat and receives a unique ticket number (output). Because no two patrons share the same ticket number, the attendant can always return the correct coat when given a ticket—this reversal is the inverse function. If two different patrons received the same ticket number, the system would break down: you could not unambiguously recover the original coat. That ambiguity is exactly what fails when a function is not one-to-one.

SECTION 3

Visual Explanation — The Horizontal Line Test

The most accessible way to determine whether a function is one-to-one is through the horizontal line test. The idea is straightforward: if you can draw any horizontal line that crosses the graph of the function more than once, then two different x-values share the same y-value, and the function fails to be injective. The diagram below contrasts a one-to-one function with a function that is not one-to-one, illustrating exactly how the test works.

Left: the linear function f(x) = 2x + 1 passes the horizontal line test—every horizontal line (dashed amber) meets the graph at most once. Right: the parabola g(x) = x² fails the test—the dashed red horizontal line intersects the graph at two points, meaning two distinct x-values share the same y-value.

Observe that the linear function on the left is strictly increasing—its slope is positive everywhere—so it cannot repeat a y-value. In contrast, the parabola on the right is symmetric about the y-axis, which means f(−a) = f(a) for every nonzero a, guaranteeing repeated y-values. The horizontal line test is merely the graphical expression of the algebraic definition: if a horizontal line y = c meets the graph at two points (x₁, c) and (x₂, c) with x₁ ≠ x₂, then f(x₁) = f(x₂) = c, violating injectivity.

SECTION 4

Mathematical Framework

The algebraic treatment of one-to-one functions revolves around two complementary approaches: proving injectivity directly from the definition, and leveraging monotonicity as a sufficient condition. Both techniques appear frequently in college algebra and form the backbone of more advanced work in real analysis and abstract algebra.

DEFINITION OF INJECTIVITY

f(a₁) = f(a₂) ⟹ a₁ = a₂ for all a₁, a₂ ∈ Domain(f)

To prove a function is one-to-one, assume f(a₁) = f(a₂) and show algebraically that a₁ must equal a₂. To disprove it, find a counterexample: two distinct inputs with the same output.

CONTRAPOSITIVE FORM

a₁ ≠ a₂ ⟹ f(a₁) ≠ f(a₂)

The contrapositive is logically equivalent and sometimes more convenient. It states that distinct inputs must produce distinct outputs.

MONOTONICITY CRITERION

a₁ < a₂ ⟹ f(a₁) < f(a₂) (strictly increasing) OR a₁ < a₂ ⟹ f(a₁) > f(a₂) (strictly decreasing)

Either strict monotonicity condition guarantees injectivity. If f is strictly increasing on an interval I, then for any a₁ ≠ a₂ in I, f(a₁) ≠ f(a₂). The converse does not hold: a function can be one-to-one without being monotone on disconnected domains.

💡

Algebraic Strategy

When asked to prove that f is one-to-one, begin by writing f(a₁) = f(a₂) and simplify. If you can isolate a₁ = a₂ without additional conditions, the function is injective. When asked to disprove it, search for two explicit domain values that map to the same output—one counterexample suffices.

SECTION 5

Classifying Functions by Injectivity

A useful exercise in developing fluency with one-to-one functions is classifying common function families. Some families are always one-to-one on their natural domains, some are never one-to-one, and others require domain restrictions. The diagram below provides a mapping-style visualization comparing an injective function with a non-injective function, using arrow diagrams that connect elements of the domain to elements of the range.

Left: An injective mapping where each element of Range B receives at most one arrow, so the function is one-to-one. Right: A non-injective mapping where the element 'a' in Range B receives arrows from both 1 and 2 in Domain A, violating the one-to-one condition.

Function Family	One-to-One on Natural Domain?	Reason / Notes
Linear: f(x) = mx + b, m ≠ 0	Always	Strictly increasing (m > 0) or strictly decreasing (m < 0).
Quadratic: f(x) = ax² + bx + c	Never (full domain)	Parabolas are symmetric; restrict domain to one side of the vertex for injectivity.
Cubic: f(x) = x³	Always	Strictly increasing on all of ℝ.
Exponential: f(x) = bˣ, b > 0, b ≠ 1	Always	Strictly monotone; this is why logarithms (inverse functions) exist.
Absolute Value: f(x) = \|x\|	Never (full domain)	f(−a) = f(a) for all a; restrict to [0, ∞) or (−∞, 0] for injectivity.
Sine: f(x) = sin x	Never (full domain)	Periodic; restrict to [−π/2, π/2] to define arcsin.

Classification of common function families by injectivity

SECTION 6

Worked Example — Proving Injectivity Algebraically

Let us prove that the function f(x) = (2x − 3)/(x + 5), defined for x ≠ −5, is one-to-one using the algebraic definition. We will then find its inverse to illustrate why injectivity matters.

Show that f(x) = (2x − 3)/(x + 5) is one-to-one and find f⁻¹(x)

1
Step 1 — Set Up the Injectivity Condition

Assume f(a₁) = f(a₂). This means: (2a₁ − 3)/(a₁ + 5) = (2a₂ − 3)/(a₂ + 5)
2
Step 2 — Cross-Multiply

Multiply both sides by (a₁ + 5)(a₂ + 5), which is nonzero since a₁ ≠ −5 and a₂ ≠ −5: (2a₁ − 3)(a₂ + 5) = (2a₂ − 3)(a₁ + 5)
3
Step 3 — Expand Both Sides

Left side: 2a₁a₂ + 10a₁ − 3a₂ − 15. Right side: 2a₁a₂ + 10a₂ − 3a₁ − 15.
4
Step 4 — Simplify and Isolate

Subtract 2a₁a₂ − 15 from both sides: 10a₁ − 3a₂ = 10a₂ − 3a₁ 13a₁ = 13a₂ a₁ = a₂

Since f(a₁) = f(a₂) implies a₁ = a₂, f is one-to-one.
5
Step 5 — Find the Inverse Function

Replace f(x) with y: y = (2x − 3)/(x + 5). Swap x and y: x = (2y − 3)/(y + 5). Solve for y: x(y + 5) = 2y − 3 xy + 5x = 2y − 3 xy − 2y = −5x − 3 y(x − 2) = −5x − 3 y = (−5x − 3)/(x − 2)

f⁻¹(x) = (−5x − 3)/(x − 2), defined for x ≠ 2.
6
Step 6 — Verify the Inverse

Check that f(f⁻¹(x)) = x. Substitute f⁻¹(x) into f: f((−5x − 3)/(x − 2)) = [2 × (−5x − 3)/(x − 2) − 3] / [(−5x − 3)/(x − 2) + 5] = [(−10x − 6 − 3(x − 2))/(x − 2)] / [(−5x − 3 + 5(x − 2))/(x − 2)] = (−10x − 6 − 3x + 6)/(−5x − 3 + 5x − 10) = (−13x)/(−13) = x ✓

The composition yields x, confirming that the inverse is correct.

SECTION 7

One-to-One vs. Onto vs. Bijective

Injectivity is one of three major properties used to classify functions in mathematics. The other two are surjectivity (onto) and bijectivity (one-to-one and onto simultaneously). Understanding how these properties relate to one another clarifies when inverse functions exist and what their domains and ranges look like. The table below compares these three classifications.

Property	Definition	Inverse Implications
Injective (One-to-One)	Every element of the codomain is hit by at most one element of the domain. f(a₁) = f(a₂) ⟹ a₁ = a₂.	A left inverse exists. The function can be "undone" on its range, but the range may be a proper subset of the codomain.
Surjective (Onto)	Every element of the codomain is hit by at least one element of the domain. For every b ∈ B, there exists a ∈ A with f(a) = b.	A right inverse exists. Every output value is achievable, but some outputs may come from multiple inputs.
Bijective (One-to-One and Onto)	Every element of the codomain is hit by exactly one element of the domain. The function is both injective and surjective.	A two-sided inverse f⁻¹ exists as a function from B to A, and it is itself a bijection.

Comparison of injectivity, surjectivity, and bijectivity

✦

KEY TAKEAWAY

In college algebra, when you find "the inverse" of a function, you are implicitly assuming the function is bijective from its domain onto its range. If f is one-to-one but not onto its stated codomain, you can always make it bijective by restricting the codomain to the range of f. This is exactly what happens when we define arcsin: sin is restricted to [−π/2, π/2] (making it injective) and the codomain is restricted to [−1, 1] (making it surjective), so arcsin becomes a well-defined bijection.

SECTION 8

Connections to Advanced Theory

The concept of injectivity extends well beyond college algebra. In linear algebra, a linear transformation T : V → W is injective if and only if its null space (kernel) contains only the zero vector. In real analysis, the Intermediate Value Theorem combined with strict monotonicity provides powerful tools for proving injectivity of continuous functions. In abstract algebra, injective homomorphisms (monomorphisms) preserve algebraic structure faithfully, making them essential in studying group and ring embeddings.

College Algebra Concept	Advanced Generalization
f(a₁) = f(a₂) ⟹ a₁ = a₂	ker(T) = {0} in linear algebra; trivial kernel criterion for linear maps
Horizontal Line Test on the graph of y = f(x)	Fiber analysis: for a function f, each fiber f⁻¹({y}) has cardinality ≤ 1
Strictly monotone ⟹ one-to-one	In topology, continuous injections on compact Hausdorff spaces are embeddings
Finding f⁻¹ by swapping x and y	Constructing inverse morphisms in category theory; reflection of graphs over y = x generalizes to dual objects

How one-to-one functions generalize in advanced mathematics

Understanding injectivity at the college algebra level therefore builds intuition that carries into nearly every branch of higher mathematics. The simple question "can I reverse this function?" matures into deep structural questions about mappings between sets, vector spaces, topological spaces, and algebraic objects.

SECTION 9

Practice Problems

Question 1: CONCEPTUAL

Explain in your own words why the function f(x) = x² is not one-to-one on the domain (−∞, ∞), but becomes one-to-one when the domain is restricted to [0, ∞). What geometric feature of the parabola is responsible for this?

Show answer

The function f(x) = x² is not one-to-one on (−∞, ∞) because distinct inputs such as x = 3 and x = −3 both yield the same output: f(3) = f(−3) = 9. This occurs because the parabola is symmetric about the y-axis—its axis of symmetry is the vertical line x = 0. Any horizontal line y = c (with c > 0) intersects the graph at two points, (√c, c) and (−√c, c), so the horizontal line test fails. When the domain is restricted to [0, ∞), we keep only the right half of the parabola, which is strictly increasing. On this restricted domain, every horizontal line meets the graph at most once, so the function becomes one-to-one.

Question 2: BASIC CALCULATION

Use the algebraic definition to prove that f(x) = 5x − 7 is one-to-one.

Show answer

Assume f(a₁) = f(a₂). Then 5a₁ − 7 = 5a₂ − 7. Adding 7 to both sides gives 5a₁ = 5a₂, and dividing both sides by 5 yields a₁ = a₂. Since the assumption f(a₁) = f(a₂) forces a₁ = a₂ with no additional conditions, the function f(x) = 5x − 7 is one-to-one by the definition of injectivity. Alternatively, since f is a linear function with nonzero slope m = 5, it is strictly increasing on ℝ, which guarantees injectivity.

Question 3: INTERMEDIATE

Determine whether h(x) = x³ − 3x is one-to-one on the domain (−∞, ∞). If it is not, provide a specific counterexample (two distinct inputs that produce the same output).

Show answer

The function h(x) = x³ − 3x is not one-to-one on (−∞, ∞). To find a counterexample, note that h(0) = 0³ − 3(0) = 0 and h(−√3) = (−√3)³ − 3(−√3) = −3√3 + 3√3 = 0. Wait—let us recalculate more carefully. h(0) = 0. We need another x with h(x) = 0: x³ − 3x = 0 → x(x² − 3) = 0, so x = 0, x = √3, or x = −√3. Thus h(0) = h(√3) = h(−√3) = 0. Since 0 ≠ √3 but h(0) = h(√3), the function fails to be injective. The function has a local maximum at x = −1 and a local minimum at x = 1 (found via h'(x) = 3x² − 3 = 0), which causes the graph to "turn back" and repeat y-values.

Question 4: APPLIED

A chemistry lab uses the function C(t) =

50e^{−0.2t}

to model the concentration (in mg/L) of a reactant at time t ≥ 0. Is C(t) one-to-one on [0, ∞)? If so, find C⁻¹ and interpret it: what does C⁻¹(10) represent in context?

Show answer

The function C(t) =

50e^{−0.2t}

is one-to-one on [0, ∞) because the exponential function

e^{−0.2t}

is strictly decreasing for t ≥ 0, and multiplying by the positive constant 50 preserves strict monotonicity. To find the inverse, set y =

50e^{−0.2t}

and solve for t: y/50 =

e^{−0.2t}

, so ln(y/50) = −0.2t, giving t = −5 ln(y/50) = 5 ln(50/y). Thus C⁻¹(y) = 5 ln(50/y). Evaluating C⁻¹(10) = 5 ln(50/10) = 5 ln 5 ≈ 8.05 minutes. This means the concentration reaches 10 mg/L approximately 8.05 minutes after the reaction begins.

Question 5: CRITICAL THINKING

Suppose f : ℝ → ℝ is a polynomial of degree n ≥ 2. Prove that if n is even, then f cannot be one-to-one on all of ℝ. Then discuss: is every odd-degree polynomial necessarily one-to-one? Provide a justification or counterexample.

Show answer

If f is a polynomial of even degree n, then as x → +∞ and x → −∞, f(x) → +∞ (if the leading coefficient is positive) or f(x) → −∞ (if negative). In either case, f tends to the same infinity in both directions. By the Intermediate Value Theorem, f must achieve every sufficiently large (or sufficiently small) value at least twice—once as x increases from −∞ and once as x decreases from +∞. More precisely, a continuous function that starts at +∞, dips to some minimum value, and returns to +∞ must repeat values, so f cannot be injective. For odd-degree polynomials, the answer is no—not every odd-degree polynomial is one-to-one. For instance, f(x) = x³ − 3x (from Problem 3) has degree 3 but is not injective on ℝ because it has a local maximum and local minimum, allowing it to repeat output values. However, odd-degree polynomials that are strictly monotone (e.g., f(x) = x³, which has f'(x) = 3x² ≥ 0 with equality only at x = 0) are indeed one-to-one.

SUMMARY

Summary

A one-to-one (injective) function is defined by the property that f(a₁) = f(a₂) implies a₁ = a₂—no two distinct inputs ever produce the same output. This condition can be verified algebraically through the definition, or visually through the horizontal line test, which checks that every horizontal line meets the graph at most once. Strictly monotone functions—those that are strictly increasing or strictly decreasing on their entire domain—are automatically one-to-one.

The central significance of injectivity is that a function possesses an inverse function if and only if it is one-to-one. Functions that fail injectivity, such as quadratics and trigonometric functions on their natural domains, can often be made one-to-one through domain restriction. The classification of functions as injective, surjective, or bijective provides a complete framework for understanding when and how functions can be reversed, a concept that extends into linear algebra, analysis, and abstract algebra.