Bijective function

A function that is both injective and surjective.
Bijective function

A f:XYf:X\to Y is bijective if it is and ; equivalently,

yY, ! xX such that f(x)=y,\forall y\in Y,\ \exists!\ x\in X\ \text{such that}\ f(x)=y,

where !\exists! means “there exists exactly one.”

Bijectivity is the precise condition for the existence of an f1:YXf^{-1}:Y\to X satisfying f1(f(x))=xf^{-1}(f(x))=x and f(f1(y))=yf(f^{-1}(y))=y.

Examples:

  • f:RRf:\mathbb{R}\to\mathbb{R}, f(x)=x+1f(x)=x+1 is bijective.
  • exp:R(0,)\exp:\mathbb{R}\to(0,\infty) is bijective.
  • xx2x\mapsto x^2 is not bijective from R\mathbb{R} to R\mathbb{R} (not injective and not surjective), but it is bijective from [0,)[0,\infty) to [0,)[0,\infty).