In mathematics, an injective function is a function that preserves distinctness: it never maps distinct elements of its domain to the same element of its codomain. In other words, every element of the function's codomain is mapped to by at most one element of its domain. If in addition all of the elements in the codomain are in fact mapped to by some element of the domain, then the function is said to be bijective (see figures).
An injective function is called an injection, and is also said to be a onetoone function (not to be confused with onetoone correspondence, i.e. a bijective function). Occasionally, an injective function from X to Y is denoted f: X ↣ Y, using an arrow with a barbed tail. Alternately, it may be denoted Y^{X} using a notation derived from that used for falling factorial powers, since if X and Y are finite sets with respectively x and y elements, the number of injections X ↣ Y is y^{x} (see the twelvefold way).
A function f that is not injective is sometimes called manytoone. (However, this terminology is also sometimes used to mean "singlevalued", i.e., each argument is mapped to at most one value; this is the case for any function, but is used to stress the opposition with multivalued functions, which are not true functions.)
A monomorphism is a generalization of an injective function in category theory.
Contents
Definition
Let f be a function whose domain is a set A. The function f is injective if for all a and b in A, if f(a) = f(b), then a = b; that is, f(a) = f(b) implies a = b. Equivalently, if a ≠ b, then f(a) ≠ f(b).
Examples
 For any set X and any subset S of X the inclusion map S → X (which sends any element s of S to itself) is injective. In particular the identity function X → X is always injective (and in fact bijective).
 The function f : R → R defined by f(x) = 2x + 1 is injective.
 The function g : R → R defined by g(x) = x^{2} is not injective, because (for example) g(1) = 1 = g(−1). However, if g is redefined so that its domain is the nonnegative real numbers [0,+∞), then g is injective.
 The exponential function exp : R → R defined by exp(x) = e^{x} is injective (but not surjective as no value maps to a negative number).
 The natural logarithm function ln : (0, ∞) → R defined by x ↦ ln x is injective.
 The function g : R → R defined by g(x) = x^{n} − x is not injective, since, for example, g(0) = g(1).
Full article ▸
