Difference between revisions of "Surjection"
Chessboy 123 (talk | contribs) m |
|||
| (5 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
| − | A | + | 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 <math>f: \mathbb Z \to \mathbb Z</math> defined by <math>f(x) = x+1</math> is surjective because every [[integer]] | + | For instance, the function <math>f: \mathbb Z \to \mathbb Z</math> defined by <math>f(x) = x+1</math> is surjective because for every [[integer]], there exists another integer one more than that integer, but the function <math>f: \mathbb N \to\mathbb N</math> defined by <math>f(x) = x+1</math> is not surjective because there exists a [[natural number]] which is not one more than any other natural number. |
| − | See also | + | ==See also == |
| − | * [[ | + | * [[Bijection]] |
| − | * [[ | + | * [[Injection]] |
| + | |||
| + | {{stub}} | ||
Latest revision as of 21:39, 13 May 2020
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 
defined by 
is surjective because for every integer, there exists another integer one more than that integer, but the function 
defined by 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.
