Difference between revisions of "Surjection"

m
Line 4: Line 4:
  
 
==See also ==
 
==See also ==
 +
* [[Bijection]]
 +
* [[Injection]]
  
* [[bijection|Bijection]]
+
{{stub}}
* [[injection|Injection]]
 

Revision as of 02:23, 9 May 2008

A surjection is a function which takes each value in its codomain at some value in its domain. That is, the range (or image) of the function is equal to its codomain. (For every function, the range is a subset of the codomain.) In adjectival form, we say that a function is surjective or onto.

For instance, the function $f: \mathbb Z \to \mathbb Z$ defined by $f(x) = x+1$ is surjective because every integer is one more than some other integer, but the function $f: \mathbb N \to\mathbb N$ defined by $f(x) = x+1$ is not surjective because there exists a natural number which is not one more than any other natural number.

See also

This article is a stub. Help us out by expanding it.

Invalid username
Login to AoPS