# Injective function

Last updated

In mathematics, an injective function (also known as injection, or one-to-one function) is a function f that maps distinct elements to distinct elements; that is, f(x1) = f(x2) implies x1 = x2. [1] In other words, every element of the function's codomain is the image of at most one element of its domain. [2] The term one-to-one function must not be confused with one-to-one correspondence that refers to bijective functions, which are functions such that each element in the codomain is an image of exactly one element in the domain.

## Contents

A homomorphism between algebraic structures is a function that is compatible with the operations of the structures. For all common algebraic structures, and, in particular for vector spaces, an injective homomorphism is also called a monomorphism . However, in the more general context of category theory, the definition of a monomorphism differs from that of an injective homomorphism. [3] This is thus a theorem that they are equivalent for algebraic structures; see Homomorphism § Monomorphism for more details.

A function ${\displaystyle f}$ that is not injective is sometimes called many-to-one. [2]

## Definition

Let ${\displaystyle f}$ be a function whose domain is a set ${\displaystyle X.}$ The function ${\displaystyle f}$ is said to be injective provided that for all ${\displaystyle a}$ and ${\displaystyle b}$ in ${\displaystyle X,}$ if ${\displaystyle f(a)=f(b),}$ then ${\displaystyle a=b}$; that is, ${\displaystyle f(a)=f(b)}$ implies ${\displaystyle a=b.}$ Equivalently, if ${\displaystyle a\neq b,}$ then ${\displaystyle f(a)\neq f(b).}$

Symbolically,

${\displaystyle \forall a,b\in X,\;\;f(a)=f(b)\Rightarrow a=b,}$

which is logically equivalent to the contrapositive, [4]

${\displaystyle \forall a,b\in X,\;\;a\neq b\Rightarrow f(a)\neq f(b).}$

## Examples

• For any set ${\displaystyle X}$ and any subset ${\displaystyle S\subseteq X,}$ the inclusion map ${\displaystyle S\to X}$ (which sends any element ${\displaystyle s\in S}$ to itself) is injective. In particular, the identity function ${\displaystyle X\to X}$ is always injective (and in fact bijective).
• If the domain of a function is the empty set, then the function is the empty function, which is injective.
• If the domain of a function has one element (that is, it is a singleton set), then the function is always injective.
• The function ${\displaystyle f:\mathbb {R} \to \mathbb {R} }$ defined by ${\displaystyle f(x)=2x+1}$ is injective.
• The function ${\displaystyle g:\mathbb {R} \to \mathbb {R} }$ defined by ${\displaystyle g(x)=x^{2}}$ is not injective, because (for example) ${\displaystyle g(1)=1=g(-1).}$ However, if ${\displaystyle g}$ is redefined so that its domain is the non-negative real numbers [0,+∞), then ${\displaystyle g}$ is injective.
• The exponential function ${\displaystyle \exp$ :\mathbb {R} \to \mathbb {R} } defined by ${\displaystyle \exp(x)=e^{x}}$ is injective (but not surjective, as no real value maps to a negative number).
• The natural logarithm function ${\displaystyle \ln$ :(0,\infty )\to \mathbb {R} } defined by ${\displaystyle x\mapsto \ln x}$ is injective.
• The function ${\displaystyle g:\mathbb {R} \to \mathbb {R} }$ defined by ${\displaystyle g(x)=x^{n}-x}$ is not injective, since, for example, ${\displaystyle g(0)=g(1)=0.}$

More generally, when ${\displaystyle X}$ and ${\displaystyle Y}$ are both the real line ${\displaystyle \mathbb {R} ,}$ then an injective function ${\displaystyle f:\mathbb {R} \to \mathbb {R} }$ is one whose graph is never intersected by any horizontal line more than once. This principle is referred to as the horizontal line test . [2]

## Injections can be undone

Functions with left inverses are always injections. That is, given ${\displaystyle f:X\to Y,}$ if there is a function ${\displaystyle g:Y\to X}$ such that for every ${\displaystyle x\in X,}$

${\displaystyle g(f(x))=x}$ (${\displaystyle f}$ can be undone by ${\displaystyle g}$), then ${\displaystyle f}$ is injective. In this case, ${\displaystyle g}$ is called a retraction of ${\displaystyle f.}$ Conversely, ${\displaystyle f}$ is called a section of ${\displaystyle g.}$

Conversely, every injection ${\displaystyle f}$ with non-empty domain has a left inverse ${\displaystyle g,}$ which can be defined by fixing an element ${\displaystyle a}$ in the domain of ${\displaystyle f}$ so that ${\displaystyle g(x)}$ equals the unique pre-image of ${\displaystyle x}$ under ${\displaystyle f}$ if it exists and ${\displaystyle g(x)=1}$ otherwise. [5]

The left inverse ${\displaystyle g}$ is not necessarily an inverse of ${\displaystyle f,}$ because the composition in the other order, ${\displaystyle f\circ g,}$ may differ from the identity on ${\displaystyle Y.}$ In other words, an injective function can be "reversed" by a left inverse, but is not necessarily invertible, which requires that the function is bijective.

## Injections may be made invertible

In fact, to turn an injective function ${\displaystyle f:X\to Y}$ into a bijective (hence invertible) function, it suffices to replace its codomain ${\displaystyle Y}$ by its actual range ${\displaystyle J=f(X).}$ That is, let ${\displaystyle g:X\to J}$ such that ${\displaystyle g(x)=f(x)}$ for all ${\displaystyle x\in X}$; then ${\displaystyle g}$ is bijective. Indeed, ${\displaystyle f}$ can be factored as ${\displaystyle \operatorname {In} _{J,Y}\circ g,}$ where ${\displaystyle \operatorname {In} _{J,Y}}$ is the inclusion function from ${\displaystyle J}$ into ${\displaystyle Y.}$

More generally, injective partial functions are called partial bijections.

## Other properties

• If ${\displaystyle f}$ and ${\displaystyle g}$ are both injective then ${\displaystyle f\circ g}$ is injective.
• If ${\displaystyle g\circ f}$ is injective, then ${\displaystyle f}$ is injective (but ${\displaystyle g}$ need not be).
• ${\displaystyle f:X\to Y}$ is injective if and only if, given any functions ${\displaystyle g,}$${\displaystyle h:W\to X}$ whenever ${\displaystyle f\circ g=f\circ h,}$ then ${\displaystyle g=h.}$ In other words, injective functions are precisely the monomorphisms in the category Set of sets.
• If ${\displaystyle f:X\to Y}$ is injective and ${\displaystyle A}$ is a subset of ${\displaystyle X,}$ then ${\displaystyle f^{-1}(f(A))=A.}$ Thus, ${\displaystyle A}$ can be recovered from its image ${\displaystyle f(A).}$
• If ${\displaystyle f:X\to Y}$ is injective and ${\displaystyle A}$ and ${\displaystyle B}$ are both subsets of ${\displaystyle X,}$ then ${\displaystyle f(A\cap B)=f(A)\cap f(B).}$
• Every function ${\displaystyle h:W\to Y}$ can be decomposed as ${\displaystyle h=f\circ g}$ for a suitable injection ${\displaystyle f}$ and surjection ${\displaystyle g.}$ This decomposition is unique up to isomorphism, and ${\displaystyle f}$ may be thought of as the inclusion function of the range ${\displaystyle h(W)}$ of ${\displaystyle h}$ as a subset of the codomain ${\displaystyle Y}$ of ${\displaystyle h.}$
• If ${\displaystyle f:X\to Y}$ is an injective function, then ${\displaystyle Y}$ has at least as many elements as ${\displaystyle X,}$ in the sense of cardinal numbers. In particular, if, in addition, there is an injection from ${\displaystyle Y}$ to ${\displaystyle X,}$ then ${\displaystyle X}$ and ${\displaystyle Y}$ have the same cardinal number. (This is known as the Cantor–Bernstein–Schroeder theorem.)
• If both ${\displaystyle X}$ and ${\displaystyle Y}$ are finite with the same number of elements, then ${\displaystyle f:X\to Y}$ is injective if and only if ${\displaystyle f}$ is surjective (in which case ${\displaystyle f}$ is bijective).
• An injective function which is a homomorphism between two algebraic structures is an embedding.
• Unlike surjectivity, which is a relation between the graph of a function and its codomain, injectivity is a property of the graph of the function alone; that is, whether a function ${\displaystyle f}$ is injective can be decided by only considering the graph (and not the codomain) of ${\displaystyle f.}$

## Proving that functions are injective

A proof that a function ${\displaystyle f}$ is injective depends on how the function is presented and what properties the function holds. For functions that are given by some formula there is a basic idea. We use the definition of injectivity, namely that if ${\displaystyle f(x)=f(y),}$ then ${\displaystyle x=y.}$ [6]

Here is an example:

${\displaystyle f(x)=2x+3}$

Proof: Let ${\displaystyle f:X\to Y.}$ Suppose ${\displaystyle f(x)=f(y).}$ So ${\displaystyle 2x+3=2y+3}$ implies ${\displaystyle 2x=2y,}$ which implies ${\displaystyle x=y.}$ Therefore, it follows from the definition that ${\displaystyle f}$ is injective.

There are multiple other methods of proving that a function is injective. For example, in calculus if ${\displaystyle f}$ is a differentiable function defined on some interval, then it is sufficient to show that the derivative is always positive or always negative on that interval. In linear algebra, if ${\displaystyle f}$ is a linear transformation it is sufficient to show that the kernel of ${\displaystyle f}$ contains only the zero vector. If ${\displaystyle f}$ is a function with finite domain it is sufficient to look through the list of images of each domain element and check that no image occurs twice on the list.

A graphical approach for a real-valued function ${\displaystyle f}$ of a real variable ${\displaystyle x}$ is the horizontal line test. If every horizontal line intersects the curve of ${\displaystyle f(x)}$ in at most one point, then ${\displaystyle f}$ is injective or one-to-one.

## Notes

1. "The Definitive Glossary of Higher Mathematical Jargon — One-to-One". Math Vault. 2019-08-01. Retrieved 2019-12-07.
2. "Injective, Surjective and Bijective". www.mathsisfun.com. Retrieved 2019-12-07.
3. "Section 7.3 (00V5): Injective and surjective maps of presheaves—The Stacks project". stacks.math.columbia.edu. Retrieved 2019-12-07.
4. Farlow, S. J. "Injections, Surjections, and Bijections" (PDF). math.umaine.edu. Retrieved 2019-12-06.
5. Unlike the corresponding statement that every surjective function has a right inverse, this does not require the axiom of choice, as the existence of ${\displaystyle a}$ is implied by the non-emptiness of the domain. However, this statement may fail in less conventional mathematics such as constructive mathematics. In constructive mathematics, the inclusion ${\displaystyle \{0,1\}\to \mathbb {R} }$ of the two-element set in the reals cannot have a left inverse, as it would violate indecomposability, by giving a retraction of the real line to the set {0,1}.
6. Williams, Peter. "Proving Functions One-to-One". Archived from the original on 4 June 2017.

## Related Research Articles

In mathematics, a bijection, bijective function, one-to-one correspondence, or invertible function, is a function between the elements of two sets, where each element of one set is paired with exactly one element of the other set, and each element of the other set is paired with exactly one element of the first set. There are no unpaired elements. In mathematical terms, a bijective function f: XY is a one-to-one (injective) and onto (surjective) mapping of a set X to a set Y. The term one-to-one correspondence must not be confused with one-to-one function.

In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric and transitive. The relation "is equal to" is the canonical example of an equivalence relation.

In mathematics, given two groups, and, a group homomorphism from to is a function h : GH such that for all u and v in G it holds that

In algebra, a homomorphism is a structure-preserving map between two algebraic structures of the same type. The word homomorphism comes from the Ancient Greek language: ὁμός meaning "same" and μορφή meaning "form" or "shape". However, the word was apparently introduced to mathematics due to a (mis)translation of German ähnlich meaning "similar" to ὁμός meaning "same". The term "homomorphism" appeared as early as 1892, when it was attributed to the German mathematician Felix Klein (1849–1925).

In mathematics, an inverse function is a function that "reverses" another function: if the function f applied to an input x gives a result of y, then applying its inverse function g to y gives the result x, i.e., g(y) = x if and only if f(x) = y. The inverse function of f is also denoted as .

In mathematics, a partial functionf from a set X to a set Y is a function from a subset S of X to Y. The subset S, that is, the domain of f viewed as a function, is called the domain of definition of f. If S equals X, that is, if f is defined on every element in X, then f is said to be total.

In ring theory, a branch of abstract algebra, a ring homomorphism is a structure-preserving function between two rings. More explicitly, if R and S are rings, then a ring homomorphism is a function f : RS such that f is:

In mathematics, a surjective function is a function f that maps an element x to every element y; that is, for every y, there is an x such that f(x) = y. In other words, every element of the function's codomain is the image of at least one element of its domain. It is not required that x be unique; the function f may map one or more elements of X to the same element of Y.

In mathematics, the codomain or set of destination of a function is the set into which all of the output of the function is constrained to fall. It is the set Y in the notation f: XY. The term range is sometimes ambiguously used to refer to either the codomain or image of a function.

In category theory, an epimorphism is a morphism f : XY that is right-cancellative in the sense that, for all objects Z and all morphisms g1, g2: YZ,

In mathematics, a function is a binary relation between two sets that associates each element of the first set to exactly one element of the second set. Typical examples are functions from integers to integers, or from the real numbers to real numbers.

In mathematics, more specifically topology, a local homeomorphism is a function between topological spaces that, intuitively, preserves local structure. If is a local homeomorphism, is said to be an étale space over Local homeomorphisms are used in the study of sheaves. Typical examples of local homeomorphisms are covering maps.

In mathematics, more specifically in topology, an open map is a function between two topological spaces that maps open sets to open sets. That is, a function is open if for any open set in the image is open in Likewise, a closed map is a function that maps closed sets to closed sets. A map may be open, closed, both, or neither; in particular, an open map need not be closed and vice versa.

In mathematics, especially in the field of category theory, the concept of injective object is a generalization of the concept of injective module. This concept is important in cohomology, in homotopy theory and in the theory of model categories. The dual notion is that of a projective object.

In algebra, a module homomorphism is a function between modules that preserves the module structures. Explicitly, if M and N are left modules over a ring R, then a function is called an R-module homomorphism or an R-linear map if for any x, y in M and r in R,

In mathematics, the image of a function is the set of all output values it may produce.

In category theory, a faithful functor is a functor that is injective when restricted to each set of morphisms that have a given source and target.

In mathematics, injections, surjections, and bijections are classes of functions distinguished by the manner in which arguments and images are related or mapped to each other.

In mathematics, particularly in category theory, a morphism is a structure-preserving map from one mathematical structure to another one of the same type. The notion of morphism recurs in much of contemporary mathematics. In set theory, morphisms are functions; in linear algebra, linear transformations; in group theory, group homomorphisms; in topology, continuous functions, and so on.