Proof Of One To One Function

You stare at the definition on the whiteboard. A function f is one-to-one if f(x₁) = f(x₂) implies x₁ = x₂.* It looks clean. Even so, obvious, even. Then you try to write the proof for a specific function — maybe something with a square root, or a rational expression — and suddenly the logic feels slippery. Day to day, you end up assuming what you're trying to prove. Or you manipulate both sides until they match and call it a day, not realizing you just proved the converse.

Sound familiar?

Proving a function is injective (that's the fancy word for one-to-one) is one of those skills that separates people who memorize definitions from people who actually understand how functions behave. It shows up in linear algebra, real analysis, discrete math, and even computer science when you're reasoning about hash functions or database keys. And yet, most textbooks give you the definition, show one trivial example like f(x) = 2x + 3*, and move on.

Let's fix that.

What Is a One-to-One Function

At its core, a function is a machine: you feed it an input, it gives you exactly one output. A one-to-one* function — an injective function — adds a restriction: different inputs must always produce different outputs.

If f(a) = f(b)*, then a must equal b. There are no two distinct elements in the domain that map to the same element in the codomain.

Visually, this is the horizontal line test. Draw any horizontal line across the graph. If it hits the curve more than once, the function fails. It's folding the domain onto the range without any overlaps.

But the definition is only the starting point. The real work — and the real confusion — starts when you have to prove* it.

The Formal Definition vs. The Contrapositive

The standard definition: ∀x₁, x₂ ∈ Domain, f(x₁) = f(x₂) ⇒ x₁ = x₂.

Logically equivalent, and often easier to work with, is the contrapositive: ∀x₁, x₂ ∈ Domain, x₁ ≠ x₂ ⇒ f(x₁) ≠ f(x₂).

Both say the same thing. But the contrapositive flips the script. Instead of assuming equal outputs and chasing equal inputs, you assume distinct inputs and show the outputs must* differ. Sometimes one direction flows better algebraically than the other. Knowing both gives you a choice — and choice is power in proof writing.

Why It Matters

You might wonder: why do we care so much about whether a function is injective?

Because injectivity is the gateway to invertibility. That said, in linear algebra, it tells you if a linear transformation has a trivial kernel. Still, a function has an inverse if and only if* it is bijective (both one-to-one and onto). That means you can't "undo" the function uniquely. That's why in calculus, this matters for substitution rules. No injectivity, no inverse. In cryptography, hash functions shouldn't* be injective (collisions are expected), but encryption functions must* be — otherwise decryption is ambiguous.

It also changes how you think about sets. If f: A → B* is injective, the cardinality of A is less than or equal to the cardinality of B. For finite sets, this is intuitive. For infinite sets, it's the foundation of comparing sizes of infinity — Cantor's whole project rests on injections and bijections.

So yeah. It matters.

How to Prove a Function Is One-to-One

There isn't a single algorithm. The strategy depends entirely on the function's form. But there are standard approaches that cover the vast majority of cases you'll encounter in undergraduate math.

Direct Proof (Assume Equal Outputs)

This is the most common starting point. You write:

Let x₁, x₂ be in the domain such that f(x₁) = f(x₂).*

Then you manipulate that equation using algebra, calculus, or logic until you arrive at x₁ = x₂*.

Example: Prove f(x) = 3x - 7* is one-to-one.

Let f(x₁) = f(x₂). Then 3x₁ - 7 = 3x₂ - 7. Add 7: 3x₁ = 3x₂. Divide by 3: x₁ = x₂. Done.

Simple. Linear functions almost always work this way.

Example with a twist: Prove f(x) = x³* is one-to-one on ℝ.

Let x₁³ = x₂³*. Because of that, take cube roots (valid on all reals): x₁ = x₂*. Done.

But what if the function isn't monotonic? In practice, what if it's f(x) = x²* on ℝ? The direct proof fails because x₁² = x₂²* implies x₁ = x₂* or x₁ = -x₂*. You can't conclude x₁ = x₂* without extra assumptions (like restricting the domain to non-negative reals). That's not a failure of the method — it's the method correctly telling you the function isn't* injective on that domain.

Contrapositive Proof (Assume Distinct Inputs)

Sometimes assuming f(x₁) = f(x₂)* leads to a messy equation. Assuming x₁ ≠ x₂* and proving f(x₁) ≠ f(x₂)* can be cleaner.

Example: Prove f(x) = 1/x* is one-to-one on ℝ{0}.

Let x₁ ≠ x₂*, both non-zero. Then 1/x₁ ≠ 1/x₂ because if they were equal, cross-multiplying gives x₁ = x₂*, contradiction. Therefore f(x₁) ≠ f(x₂)*.

This works beautifully for rational functions where cross-multiplication is natural.

Using Calculus: Monotonicity Implies Injectivity

If a function is continuous on an interval and strictly monotonic (strictly increasing or strictly decreasing) on that interval, it's one-to-one there. This is a theorem you can cite — no need to re-prove it every time.

How to use it:

Check continuity on the interval.
Compute the derivative.
Show the derivative is always positive* (strictly increasing) or always negative* (strictly decreasing) on the interior of the interval.
Conclude injectivity.

Example: Prove f(x) = x³ + x* is one-to-one on ℝ.

f'(x) = 3x² + 1*. Consider this: since x² ≥ 0*, 3x² + 1 ≥ 1 > 0 for all x. Day to day, f is strictly increasing on ℝ. Therefore f is one-to-one.

For more on this topic, read our article on which is a non membrane bound organelle or check out why are the atomic masses not whole numbers.

This method is fast, powerful, and avoids algebraic manipulation entirely. But

it has a critical limitation: it only works for continuous functions on intervals. You'd have to check injectivity on each connected component separately. If the domain has gaps — like f(x) = 1/x* on ℝ{0} — the derivative can be negative everywhere (f'(x) = -1/x² < 0*), yet the function isn't strictly decreasing across the whole domain because it jumps from -∞ to +∞ at the asymptote. Also, a zero derivative at isolated points (like f(x) = x³* at x = 0*) doesn't break strict monotonicity, but you need to argue that carefully — usually by showing the derivative is non-negative and zero only at isolated points, which still guarantees strict increase.

The Horizontal Line Test (Graphical Intuition)

For real-valued functions of a real variable, the horizontal line test is the visual counterpart to the definition: f is one-to-one iff every horizontal line intersects the graph at most once. This isn't a formal proof, but it's an excellent diagnostic tool. If you can sketch the graph (or visualize it), you'll often see injectivity — or a counterexample — immediately. Use it to guide your algebraic approach.

Composition and Known Results

Injectivity plays nicely with composition:

If g ∘ f* is injective, then f must be injective. Even so, (Proof: if f(x₁) = f(x₂), then g(f(x₁)) = g(f(x₂)), so x₁ = x₂*. )
If f and g are both injective, then g ∘ f* is injective.

This lets you build new injective functions from old ones. Here's one way to look at it: if you know eˣ and x³ are injective, then e^{x³}* is injective without any further work.

Similarly, restrictions preserve injectivity: if f is injective on A, it's injective on any subset B ⊆ A*. This is why restricting f(x) = x²* to [0, ∞) makes it one-to-one — you're throwing away the "mirror" half that caused the collision.

When the Domain Is Discrete or Finite

For functions on finite sets, integers, or other discrete domains, calculus doesn't apply. But you fall back to the direct definition or, if the set is small enough, brute-force checking: list all inputs, compute outputs, and verify no output repeats. For infinite discrete domains (like ℤ or ℕ), algebraic manipulation of f(x₁) = f(x₂)* remains the standard path.

Example: Prove f: ℕ → ℕ* defined by f(n) = 2n + 1* is injective.

Let f(n₁) = f(n₂)*. Then 2n₁ + 1 = 2n₂ + 1 ⇒ 2n₁ = 2n₂ ⇒ n₁ = n₂. Done.

Common Pitfalls

Confusing the converse: Proving x₁ = x₂ ⇒ f(x₁) = f(x₂)* proves f is a function (well-defined), not that it's injective. The implication must go from equal outputs* to equal inputs*.
Ignoring the domain: f(x) = x²* is not injective on ℝ, but it is on [0, ∞) or (-∞, 0]. Always state the domain explicitly.
Dividing by a variable expression without checking it's non-zero: In f(x) = x/(x-1), assuming f(x₁) = f(x₂) leads to cross-multiplication. You must note x₁, x₂ ≠ 1* because they're in the domain.
Misapplying monotonicity: A positive derivative implies strictly increasing only* if the domain is an interval. On disconnected domains, check each piece.

Summary Checklist

When asked to prove a function is one-to-one:

Identify the domain and codomain. Injectivity is a property of the function*, which includes its domain.
Choose your weapon:
- Direct algebra (f(x₁) = f(x₂) ⇒ x₁ = x₂*) for polynomials, rational functions, simple transcendentals.
- Contrapositive (x₁ ≠ x₂ ⇒ f(x₁) ≠ f(x₂)*) when cross-multiplication or difference-of-squares simplifies things.
- Calculus (monotonicity) for differentiable functions on intervals — fastest when the derivative has a clear sign.
- Composition/Restriction if the function is built from known injective pieces.
Execute carefully. Watch for domain restrictions, sign flips, and division by zero.
Conclude explicitly: "So, f is one-to-one on [domain]."

Injectivity is one of those concepts that feels trivial until you need to prove it for something messy — like a piecewise function with a parameter, or a map between abstract sets where "graphing" means nothing. The

key insight is that injectivity is fundamentally about reversibility: if you can always recover the input from the output, your function earns the right to have an inverse (at least on its image). This is why we care so much about proving it rigorously — it's the gateway to invertibility, which in turn unlocks everything from solving equations to defining isomorphisms in advanced mathematics.

Whether you're working with a simple linear function or a complex transformation in functional analysis, the core principle remains unchanged: distinct inputs must produce distinct outputs. Master the techniques outlined here, and you'll be equipped to handle injectivity proofs across any mathematical context you encounter.

Conclusion

Proving that a function is one-to-one is a foundational skill that bridges computational mathematics and abstract reasoning. While the concept itself is intuitive — no two inputs map to the same output — the methods for establishing it range from straightforward algebra to sophisticated calculus-based arguments.

The choice of technique depends entirely on the nature of your function: discrete domains call for direct verification, continuous functions on intervals can take advantage of derivatives, and complex compositions may require breaking the problem into simpler, known-injective pieces. What remains constant is the logical structure: you must show that equal outputs necessarily imply equal inputs.

More than just a technical exercise, understanding injectivity provides deep insight into the behavior of mathematical mappings and their invertibility. It's a concept that will serve you well not only in calculus and analysis, but in linear algebra, abstract algebra, topology, and beyond. By mastering these proof techniques now, you're building a toolkit that will prove invaluable throughout your mathematical journey.