Function |
---|

x ↦ f (x) |

History of the function concept |

Examples of domains and codomains |

Classes/properties |

Constructions |

Generalizations |

In mathematics, a **surjective function** (also known as **surjection**, or **onto function** /ˈɒn.tuː/ ) is a function *f* such that, for every element *y* of the function's codomain, there exists *at least* one element *x* in the function's domain such that *f*(*x*) = *y*. In other words, for a function *f* : *X* → *Y*, the codomain *Y* is the image of the function's domain *X*.^{ [1] }^{ [2] } 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*.

- Definition
- Examples
- Properties
- Surjections as right invertible functions
- Surjections as epimorphisms
- Surjections as binary relations
- Cardinality of the domain of a surjection
- Composition and decomposition
- Induced surjection and induced bijection
- The set of surjections
- Gallery
- See also
- References
- Further reading

The term *surjective* and the related terms * injective * and * bijective * were introduced by Nicolas Bourbaki,^{ [3] }^{ [4] } a group of mainly French 20th-century mathematicians who, under this pseudonym, wrote a series of books presenting an exposition of modern advanced mathematics, beginning in 1935. The French word * sur * means *over* or *above*, and relates to the fact that the image of the domain of a surjective function completely covers the function's codomain.

Any function induces a surjection by restricting its codomain to the image of its domain. Every surjective function has a right inverse assuming the axiom of choice, and every function with a right inverse is necessarily a surjection. The composition of surjective functions is always surjective. Any function can be decomposed into a surjection and an injection.

A **surjective function** is a function whose image is equal to its codomain. Equivalently, a function with domain and codomain is surjective if for every in there exists at least one in with .^{ [1] } Surjections are sometimes denoted by a two-headed rightwards arrow ( U+21A0↠RIGHTWARDS TWO HEADED ARROW),^{ [5] } as in .

Symbolically,

- If , then is said to be surjective if

- .
^{ [2] }^{ [6] }

- For any set
*X*, the identity function id_{X}on*X*is surjective. - The function
*f*:**Z**→ {0, 1} defined by*f*(*n*) =*n***mod**2 (that is, even integers are mapped to 0 and odd integers to 1) is surjective. - The function
*f*:**R**→**R**defined by*f*(*x*) = 2*x*+ 1 is surjective (and even bijective), because for every real number*y*, we have an*x*such that*f*(*x*) =*y*: such an appropriate*x*is (*y*− 1)/2. - The function
*f*:**R**→**R**defined by*f*(*x*) =*x*^{3}− 3*x*is surjective, because the pre-image of any real number*y*is the solution set of the cubic polynomial equation*x*^{3}− 3*x*−*y*= 0, and every cubic polynomial with real coefficients has at least one real root. However, this function is not injective (and hence not bijective), since, for example, the pre-image of*y*= 2 is {*x*= −1,*x*= 2}. (In fact, the pre-image of this function for every*y*, −2 ≤*y*≤ 2 has more than one element.) - The function
*g*:**R**→**R**defined by*g*(*x*) =*x*^{2}is*not*surjective, since there is no real number*x*such that*x*^{2}= −1. However, the function*g*:**R**→**R**_{≥0}defined by*g*(*x*) =*x*^{2}(with the restricted codomain)*is*surjective, since for every*y*in the nonnegative real codomain*Y*, there is at least one*x*in the real domain*X*such that*x*^{2}=*y*. - The natural logarithm function ln : (0, +∞) →
**R**is a surjective and even bijective (mapping from the set of positive real numbers to the set of all real numbers). Its inverse, the exponential function, if defined with the set of real numbers as the domain and the codomain, is not surjective (as its range is the set of positive real numbers). - The matrix exponential is not surjective when seen as a map from the space of all
*n*×*n*matrices to itself. It is, however, usually defined as a map from the space of all*n*×*n*matrices to the general linear group of degree*n*(that is, the group of all*n*×*n*invertible matrices). Under this definition, the matrix exponential is surjective for complex matrices, although still not surjective for real matrices. - The projection from a cartesian product
*A*×*B*to one of its factors is surjective, unless the other factor is empty. - In a 3D video game, vectors are projected onto a 2D flat screen by means of a surjective function.

A function is bijective if and only if it is both surjective and injective.

If (as is often done) a function is identified with its graph, then surjectivity is not a property of the function itself, but rather a property of the mapping.^{ [7] } This is, the function together with its codomain. Unlike injectivity, surjectivity cannot be read off of the graph of the function alone.

The function *g* : *Y* → *X* is said to be a right inverse of the function *f* : *X* → *Y* if *f*(*g*(*y*)) = *y* for every *y* in *Y* (*g* can be undone by *f*). In other words, *g* is a right inverse of *f* if the composition *f*o*g* of *g* and *f* in that order is the identity function on the domain *Y* of *g*. The function *g* need not be a complete inverse of *f* because the composition in the other order, *g*o*f*, may not be the identity function on the domain *X* of *f*. In other words, *f* can undo or "*reverse*" *g*, but cannot necessarily be reversed by it.

Every function with a right inverse is necessarily a surjection. The proposition that every surjective function has a right inverse is equivalent to the axiom of choice.

If *f* : *X* → *Y* is surjective and *B* is a subset of *Y*, then *f*(*f*^{ −1}(*B*)) = *B*. Thus, *B* can be recovered from its preimage *f*^{ −1}(*B*).

For example, in the first illustration in the gallery, there is some function *g* such that *g*(*C*) = 4. There is also some function *f* such that *f*(4) = *C*. It doesn't matter that *g* is not unique (it would also work if *g*(*C*) equals 3); it only matters that *f* "reverses" *g*.

A function *f* : *X* → *Y* is surjective if and only if it is right-cancellative:^{ [8] } given any functions *g*,*h* : *Y* → *Z*, whenever *g*o*f* = *h*o*f*, then *g* = *h*. This property is formulated in terms of functions and their composition and can be generalized to the more general notion of the morphisms of a category and their composition. Right-cancellative morphisms are called epimorphisms. Specifically, surjective functions are precisely the epimorphisms in the category of sets. The prefix *epi* is derived from the Greek preposition *ἐπί* meaning *over*, *above*, *on*.

Any morphism with a right inverse is an epimorphism, but the converse is not true in general. A right inverse *g* of a morphism *f* is called a section of *f*. A morphism with a right inverse is called a split epimorphism.

Any function with domain *X* and codomain *Y* can be seen as a left-total and right-unique binary relation between *X* and *Y* by identifying it with its function graph. A surjective function with domain *X* and codomain *Y* is then a binary relation between *X* and *Y* that is right-unique and both left-total and right-total.

The cardinality of the domain of a surjective function is greater than or equal to the cardinality of its codomain: If *f* : *X* → *Y* is a surjective function, then *X* has at least as many elements as *Y*, in the sense of cardinal numbers. (The proof appeals to the axiom of choice to show that a function *g* : *Y* → *X* satisfying *f*(*g*(*y*)) = *y* for all *y* in *Y* exists. *g* is easily seen to be injective, thus the formal definition of |*Y*| ≤ |*X*| is satisfied.)

Specifically, if both *X* and *Y* are finite with the same number of elements, then *f* : *X* → *Y* is surjective if and only if *f* is injective.

Given two sets *X* and *Y*, the notation *X* ≤^{*}*Y* is used to say that either *X* is empty or that there is a surjection from *Y* onto *X*. Using the axiom of choice one can show that *X* ≤^{*}*Y* and *Y* ≤^{*}*X* together imply that |*Y*| = |*X*|, a variant of the Schröder–Bernstein theorem.

The composition of surjective functions is always surjective: If *f* and *g* are both surjective, and the codomain of *g* is equal to the domain of *f*, then *f*o*g* is surjective. Conversely, if *f*o*g* is surjective, then *f* is surjective (but *g*, the function applied first, need not be). These properties generalize from surjections in the category of sets to any epimorphisms in any category.

Any function can be decomposed into a surjection and an injection: For any function *h* : *X* → *Z* there exist a surjection *f* : *X* → *Y* and an injection *g* : *Y* → *Z* such that *h* = *g*o*f*. To see this, define *Y* to be the set of preimages *h*^{−1}(*z*) where *z* is in *h*(*X*). These preimages are disjoint and partition *X*. Then *f* carries each *x* to the element of *Y* which contains it, and *g* carries each element of *Y* to the point in *Z* to which *h* sends its points. Then *f* is surjective since it is a projection map, and *g* is injective by definition.

Any function induces a surjection by restricting its codomain to its range. Any surjective function induces a bijection defined on a quotient of its domain by collapsing all arguments mapping to a given fixed image. More precisely, every surjection *f* : *A* → *B* can be factored as a projection followed by a bijection as follows. Let *A*/~ be the equivalence classes of *A* under the following equivalence relation: *x* ~ *y* if and only if *f*(*x*) = *f*(*y*). Equivalently, *A*/~ is the set of all preimages under *f*. Let *P*(~) : *A* → *A*/~ be the projection map which sends each *x* in *A* to its equivalence class [*x*]_{~}, and let *f*_{P} : *A*/~ → *B* be the well-defined function given by *f*_{P}([*x*]_{~}) = *f*(*x*). Then *f* = *f*_{P} o *P*(~).

Given fixed A and B, one can form the set of surjections *A* ↠ *B*. The cardinality of this set is one of the twelve aspects of Rota's Twelvefold way, and is given by , where denotes a Stirling number of the second kind.

- Surjective composition: the first function need not be surjective.
**Non-surjective functions**in the Cartesian plane. Although some parts of the function are surjective, where elements*y*in*Y*do have a value*x*in*X*such that*y*=*f*(*x*), some parts are not.**Left:**There is*y*_{0}in*Y*, but there is no*x*_{0}in*X*such that*y*_{0}=*f*(*x*_{0}).**Right:**There are*y*_{1},*y*_{2}and*y*_{3}in*Y*, but there are no*x*_{1},*x*_{2}, and*x*_{3}in*X*such that*y*_{1}=*f*(*x*_{1}),*y*_{2}=*f*(*x*_{2}), and*y*_{3}=*f*(*x*_{3}).- Interpretation for
**surjective functions**in the Cartesian plane, defined by the mapping*f*:*X*→*Y*, where*y*=*f*(*x*),*X*= domain of function,*Y*= range of function. Every element in the range is mapped onto from an element in the domain, by the rule*f*. There may be a number of domain elements which map to the same range element. That is, every*y*in*Y*is mapped from an element*x*in*X*, more than one*x*can map to the same*y*.**Left:**Only one domain is shown which makes*f*surjective.**Right:**two possible domains*X*_{1}and*X*_{2}are shown.

Wikimedia Commons has media related to Surjectivity .

A **bijection**, **bijective function**, or **one-to-one correspondence** between two mathematical sets is a function such that each element of the second set is mapped to from exactly one element of the first set. Equivalently, a bijection is a relation between two sets such that each element of either set is paired with exactly one element of the other set.

In mathematics, an **equivalence relation** is a binary relation that is reflexive, symmetric and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. A simpler example is equality. Any number is equal to itself (reflexive). If , then (symmetric). If and , then (transitive).

In mathematics, an **endomorphism** is a morphism from a mathematical object to itself. An endomorphism that is also an isomorphism is an automorphism. For example, an endomorphism of a vector space *V* is a linear map *f*: *V* → *V*, and an endomorphism of a group *G* is a group homomorphism *f*: *G* → *G*. In general, we can talk about endomorphisms in any category. In the category of sets, endomorphisms are functions from a set *S* to itself.

In mathematics, given two groups, (*G*, ∗) and (*H*, ·), a **group homomorphism** from (*G*, ∗) to (*H*, ·) is a function *h* : *G* → *H* 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, the **inverse function** of a function f is a function that undoes the operation of f. The inverse of f exists if and only if f is bijective, and if it exists, is denoted by

In mathematics, a **partial function**f 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** or **natural domain** of f. If S equals X, that is, if f is defined on every element in X, then f is said to be a **total 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; that is, *x*_{1} ≠ *x*_{2} implies *f*(*x*_{1}) ≠ *f*(*x*_{2}). (Equivalently, *f*(*x*_{1}) = *f*(*x*_{2}) implies *x*_{1} = *x*_{2} in the equivalent contrapositive statement.) In other words, every element of the function's codomain is the image of *at most* one element of its domain. 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.

In mathematics, the concept of an **inverse element** generalises the concepts of opposite and reciprocal of numbers.

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

In category theory, an **epimorphism** is a morphism *f* : *X* → *Y* that is right-cancellative in the sense that, for all objects *Z* and all morphisms *g*_{1}, *g*_{2}: *Y* → *Z*,

In mathematics, a **function** from a set X to a set Y assigns to each element of X exactly one element of Y. The set X is called the domain of the function and the set Y is called the codomain of the function.

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, the **range of a function** may refer to either of two closely related concepts:

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, 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 on hom-sets, and a **full functor** is surjective on hom-sets. A functor that has both properties is called a **fully faithful functor**.

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 analysis and topology, continuous functions, and so on.

- 1 2 "Injective, Surjective and Bijective".
*www.mathsisfun.com*. Retrieved 2019-12-07. - 1 2 "Bijection, Injection, And Surjection | Brilliant Math & Science Wiki".
*brilliant.org*. Retrieved 2019-12-07. - ↑ Miller, Jeff, "Injection, Surjection and Bijection",
*Earliest Uses of Some of the Words of Mathematics*, Tripod. - ↑ Mashaal, Maurice (2006).
*Bourbaki*. American Mathematical Soc. p. 106. ISBN 978-0-8218-3967-6. - ↑ "Arrows – Unicode" (PDF). Retrieved 2013-05-11.
- ↑ Farlow, S. J. "Injections, Surjections, and Bijections" (PDF).
*math.umaine.edu*. Retrieved 2019-12-06. - ↑ T. M. Apostol (1981).
*Mathematical Analysis*. Addison-Wesley. p. 35. - ↑ Goldblatt, Robert (2006) [1984].
*Topoi, the Categorial Analysis of Logic*(Revised ed.). Dover Publications. ISBN 978-0-486-45026-1 . Retrieved 2009-11-25.

- Bourbaki, N. (2004) [1968].
*Theory of Sets*. Elements of Mathematics. Vol. 1. Springer. doi:10.1007/978-3-642-59309-3. ISBN 978-3-540-22525-6. LCCN 2004110815.

This page is based on this Wikipedia article

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.