Injective function
In mathematics, an injective function (also known as injection, or one-to-one function ) is a function that maps distinct elements of its domain to distinct elements of its codomain; that is, implies (equivalently by contraposition…
≈ 6 min read
Injective function. encyclopegia.org, snapshot enwiki-001346410343. /a/injective-function
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, an injective function (also known as injection, or one-to-one function ) is a function that maps distinct elements of its domain to distinct elements of its codomain; that is, implies (equivalently by contraposition, implies ). In other words, every element of the function's codomain is the image of one element of its domain.
The term must not be confused with 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 is also called a . 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 for more details.
A function f that is not injective is sometimes called many-to-one. Let f be a function whose domain is a set . The function f is said to be injective provided that for all a and b in X, if , then ; that is, f(a) = f(b) implies .
Equivalently, if , then f(a) \neq f(b) in the contrapositive statement. Symbolically, \forall a,b \in X, \;\; f(a)=f(b) \Rightarrow a=b, which is logically equivalent to the contrapositive, \forall a, b \in X, \;\; a \neq b \Rightarrow f(a) \neq 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 ), although some authors specifically reserve ↪ for an inclusion map.
The function f : \R \to \R defined by f(x) = 2 x + 1 is injective. The function g : \R \to \R defined by g(x) = x^2 is injective, because (for example) g(1) = 1 = g(-1). However, if g is redefined so that its domain is the non-negative real numbers , then g is injective.
The exponential function \exp : \R \to \R 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, \infty) \to \R defined by x \mapsto \ln x is injective. The function g : \R \to \R defined by g(x) = x^n - x is not injective, since, for example, .
More generally, when X and Y are both the real line , then an injective function f : \R \to \R is one whose graph is never intersected by any horizontal line more than once. This principle is referred to as the . f(a) = f(b) \rightarrow g(f(a))=g(f(b)) \rightarrow a = b. In this case, g is called a retraction of . Conversely, f is called a section of .
For example: f:\R\rightarrow\R^2,x\mapsto(1,m)^\intercal x is retracted by . 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).
The left inverse g is not necessarily an inverse of f, because the composition in the other order, , may differ from the identity on . 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.
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 ; then g is bijective. Indeed, f can be factored as , where \operatorname{In}_{J,Y} is the inclusion function from J into .
More generally, injective partial functions are called partial bijections. Every function h : W \to Y can be decomposed as h = f \circ g for a suitable injection f and surjection . 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 .
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 to , 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 . f(x) = 2 x + 3 Proof: Let . Suppose . So 2 x + 3 = 2 y + 3 implies , which implies .
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.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1346410343 under CC BY-SA 4.0; modifications have been made.