Surjective Function
Jump to navigation
Jump to search
A surjective function is a function that maps every set member of the function domain to a set member of the function range.
- Example(s):
- f(x) -> x2.
- a Surjective Relation.
- …
- Counter-Example(s):
- See: Bijective Function, Injective Function.
References
2011
- (Wikipedia, 2011) ⇒ http://en.wikipedia.org/wiki/Surjective_function
- In mathematics, a function [math]\displaystyle{ f }[/math] which takes elements of a set X and turns them into elements of another set Y is surjective (or onto) if each element of Y can be obtained by applying [math]\displaystyle{ f }[/math] to some element of X. (There might be multiple elements of X that are turned into the same element of Y by applying [math]\displaystyle{ f }[/math].) A surjective function is called a surjection. The term surjective and the related terms injective and bijective were introduced by Nicolas Bourbaki.
- http://upload.wikimedia.org/wikipedia/commons/6/6c/Surjection.svg