Surjective function

A function whose outputs cover the entire codomain
Surjective function

A surjective function is a f:ABf:A\to B such that for every bBb\in B there exists at least one aAa\in A with f(a)=bf(a)=b.

Surjectivity can be expressed using the : ff is surjective exactly when f(A)f(A) equals its BB. Surjectivity is one of the two conditions (along with injectivity) needed for a .

Examples:

  • The function f:RRf:\mathbb{R}\to\mathbb{R} given by f(x)=x3f(x)=x^3 is surjective, since every real number has a real cube root.
  • The parity map p:Z{0,1}p:\mathbb{Z}\to\{0,1\} (even 0\mapsto 0, odd 1\mapsto 1) is surjective.