Injective function

In mathematics, an injective function (also known as injection, or one-to-one function) is a function f that maps distinct elements of its domain to distinct elements of its codomain; that is, x₁ ≠ x₂ implies f(x₁) Template:≠ f(x₂) (equivalently by contraposition, f(x₁) = f(x₂) implies x₁ = x₂). In other words, every element of the function's codomain is the image of Template:Em one element of its domain. The term Template:Em must not be confused with Template:Em 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.

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 Template:Em is also called a Template:Em. However, in the more general context of category theory, the definition of a monomorphism differs from that of an injective homomorphism. This is thus a theorem that they are equivalent for algebraic structures; see Template:Slink for more details.

A function $f$ that is not injective is sometimes called many-to-one.

Definition

Template:Dark mode invert Let $f$ be a function whose domain is a set Template:Tmath. The function $f$ is said to be injective provided that for all $a$ and $b$ in $X,$ if Template:Tmath, then Template:Tmath; that is, $f(a)=f(b)$ implies Template:Tmath. Equivalently, if Template:Tmath, then $f(a)\ne f(b)$ in the contrapositive statement.

Symbolically,$$\mathrm{\forall }a,b\in X,f(a)=f(b)\Rightarrow a=b,$$ which is logically equivalent to the contrapositive,$$\mathrm{\forall }a,b\in X,a\ne b\Rightarrow f(a)\ne f(b).$$An injective function (or, more generally, a monomorphism) is often denoted by using the specialized arrows ↣ or ↪ (for example, $f:A\rightarrowtail B$ or Template:Tmath), although some authors specifically reserve ↪ for an inclusion map.

Examples

For visual examples, readers are directed to the gallery section.

• For any set $X$ and any subset Template:Tmath, the inclusion map $S\to X$ (which sends any element $s\in S$ to itself) is injective. In particular, the identity function $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 $f:\mathbb{ℝ}\to \mathbb{ℝ}$ defined by $f(x)=2x+1$ is injective.
• The function $g:\mathbb{ℝ}\to \mathbb{ℝ}$ defined by $g(x)=x^2$ is Template:Em injective, because (for example) $g(1)=1=g(-1).$ However, if $g$ is redefined so that its domain is the non-negative real numbers [0, +∞), then $g$ is injective.
• The exponential function $\exp :\mathbb{ℝ}\to \mathbb{ℝ}$ defined by $\exp (x)=e^x$ is injective (but not surjective, as no real value maps to a negative number).
• The natural logarithm function $\ln :(0,\mathrm{\infty })\to \mathbb{ℝ}$ defined by $x\mapsto \ln x$ is injective.
• The function $g:\mathbb{ℝ}\to \mathbb{ℝ}$ defined by $g(x)=x^n-x$ is not injective, since, for example, Template:Tmath.

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

Injections can be undone

Functions with left inverses are always injections. That is, given Template:Tmath, if there is a function $g:Y\to X$ such that for every Template:Tmath, Template:Tmath, then $f$ is injective. The proof is that $$f(a)=f(b)\to g(f(a))=g(f(b))\to a=b.$$

In this case, $g$ is called a retraction of Template:Tmath. Conversely, $f$ is called a section of Template:Tmath. For example: $f:\mathbb{ℝ}\to {\mathbb{ℝ}}^2,x\mapsto (1,m{)}^{⊺}x$ is retracted by Template:Tmath.

Conversely, every injection $f$ with a non-empty domain has a left inverse $g$. It can be defined by choosing an element $a$ in the domain of $f$ and setting $g(y)$ to the unique element of the pre-image $f^{-1}[y]$ (if it is non-empty) or to $a$ (otherwise).Template:Refn

The left inverse $g$ is not necessarily an inverse of $f,$ because the composition in the other order, Template:Tmath, may differ from the identity on Template:Tmath. 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 $f:X\to Y$ into a bijective (hence invertible) function, it suffices to replace its codomain $Y$ by its actual image $J=f(X).$ That is, let $g:X\to J$ such that $g(x)=f(x)$ for all Template:Tmath; then $g$ is bijective. Indeed, $f$ can be factored as Template:Tmath, where ${\mathrm{In}}_{J,Y}$ is the inclusion function from $J$ into Template:Tmath.

More generally, injective partial functions are called partial bijections.

Other properties

• If $f$ and $g$ are both injective then $f\circ g$ is injective.
• If $g\circ f$ is injective, then $f$ is injective (but $g$ need not be).
• $f:X\to Y$ is injective if and only if, given any functions Template:Tmath, $h:W\to X$ whenever Template:Tmath, then Template:Tmath. In other words, injective functions are precisely the monomorphisms in the category Set of sets.
• If $f:X\to Y$ is injective and $A$ is a subset of Template:Tmath, then Template:Tmath. Thus, $A$ can be recovered from its image Template:Tmath.
• If $f:X\to Y$ is injective and $A$ and $B$ are both subsets of Template:Tmath, then Template:Tmath.
• Every function $h:W\to Y$ can be decomposed as $h=f\circ g$ for a suitable injection $f$ and surjection Template:Tmath. This decomposition is unique up to isomorphism, and $f$ may be thought of as the inclusion function of the range $h(W)$ of $h$ as a subset of the codomain $Y$ of Template:Tmath.
• If $f:X\to Y$ is an injective function, then $Y$ has at least as many elements as $X,$ in the sense of cardinal numbers. In particular, if, in addition, there is an injection from Template:Tmath to Template:Tmath, then $X$ and $Y$ have the same cardinal number. (This is known as the Cantor–Bernstein–Schroeder theorem.)
• If both $X$ and $Y$ are finite with the same number of elements, then $f:X\to Y$ is injective if and only if $f$ is surjective (in which case $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 $f$ is injective can be decided by only considering the graph (and not the codomain) of Template:Tmath.

Proving that functions are injective

A proof that a function $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 Template:Tmath, then Template:Tmath.

Here is an example: $$f(x)=2x+3$$

Proof: Let Template:Tmath. Suppose Template:Tmath. So $2x+3=2y+3$ implies Template:Tmath, which implies Template:Tmath. Therefore, it follows from the definition that $f$ is injective.

There are multiple other methods of proving that a function is injective. For example, in calculus if $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 $f$ is a linear transformation it is sufficient to show that the kernel of $f$ contains only the zero vector. If $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 $f$ of a real variable $x$ is the horizontal line test. If every horizontal line intersects the curve of $f(x)$ in at most one point, then $f$ is injective or one-to-one.

See also

• Template:Annotated link
• Template:Annotated link
• Template:Annotated link
• Template:Annotated link

References

• , p. 17 ff.
• , p. 38 ff.

External links

• Earliest Uses of Some of the Words of Mathematics: entry on Injection, Surjection and Bijection has the history of Injection and related terms.
• Khan Academy – Surjective (onto) and Injective (one-to-one) functions: Introduction to surjective and injective functions