AoPSWiki
Try our innovative online adaptive learning system, Alcumus.
Over 1100 problems and 60+ video lessons. FREE!

Surjection

From AoPSWiki

Revision as of 06:23, 9 May 2008 by I like pie (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

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.

Do you have what it takes to be the next brilliant trader, researcher, or developer at Jane Street Capital? Find out in the Careers in Mathematics Forum.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us