Injective function

From Wikipedia, the free encyclopedia

(Redirected from Injective map)
Jump to: navigation, search
An injective function. (Injection)
An injective function. (Injection)
Another injective function. (Bijection)
Another injective function. (Bijection)
A non-injective function. (Surjection)
A non-injective function. (Surjection)

In mathematics, an injective function is a function which associates distinct arguments to distinct values. More precisely, a function f is said to be injective if it maps distinct x in the domain to distinct y in the codomain, such that f(x) = y.

Put another way, f is injective if f(a) = f(b) implies a = b (or ab implies f(a) ≠ f(b)), for any a, b in the domain.

An injective function is called an injection, and is also said to be an information-preserving or one-to-one function (however, the latter name is best avoided, since some authors understand it to mean a one-to-one correspondence, i.e. a bijective function).

A function f that is not injective is sometimes called many-to-one. However, this name too is best avoided, since it is sometimes used to mean "single-valued", i.e. each argument is mapped to at most one value.

Contents

  • For any set X, the identity function on X is injective.
  • The function f : R → R defined by f(x) = 2x + 1 is injective.
  • The function g : R → R defined by g(x) = x2 is not 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 : \mathbf{R} \to \mathbf{R} : x \mapsto \mathrm{e}^x is injective (but not surjective as no value maps to a negative number).
  • The natural logarithm function \ln : (0,+\infty) \to \mathbf{R} : x \mapsto \ln{x} is injective.
  • The function g : R → R defined by g(x) = xnx is not injective, since, for example, g(0) = g(1).

More generally, when X and Y are both the real line R, then an injective function f : R → R is one whose graph is never intersected by any horizontal line more than once.

Functions with left inverses (often called sections) are always injections. That is to say, for f : X → Y, if there exists a function g : Y → X such that, for every x \in X

g(f(x)) = x \, (f can be undone by g)

then f is injective. Conversely, it is usually assumed that every injection with non-empty domain has a left inverse.

Note that g may not be a complete inverse of f because the composition in the other order, f o g, may not be the identity on Y. In other words, a function that can be undone or "reversed", such as f, is not necessarily invertible (bijective). Injections are "reversible" but not always invertible.

Although it is impossible to reverse a non-injective (and therefore information-losing) function, you can at least obtain a "quasi-inverse" of it, that is a multiple-valued function.

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

  • If f and g are both injective, then f o g is injective.
The composition of two injective functions is injective.
The composition of two injective functions is injective.
  • If g o f is injective, then f is injective (but g need not be).
  • f : X → Y is injective if and only if, given any functions g, h : W → X, whenever f o g = f o h, then g = h.
  • If f : X → Y is injective and A is a subset of X, then f −1(f(A)) = A. Thus, A can be recovered from its image f(A).
  • If f : X → Y is injective and A and B are both subsets of X, then f(A ∩ B) = f(A) ∩ f(B).
  • Every function h : W → Y can be decomposed as h = f o g for a suitable injection f and surjection g. 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 h.
  • If f : X → Y is an injective function, then Y has at least as many elements as X, in the sense of cardinal numbers.
  • If both X and Y are finite with the same number of elements, then f : X → Y is injective if and only if f is surjective.
  • Every embedding is injective.

In the language of category theory, injective functions are precisely the monomorphisms in the category of sets.

Look up injective in Wiktionary, the free dictionary.
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.