|
( Bijection)
In mathematics, a bijection, or a bijective function is a function f from a set X to a set Y with the property that, for every y in Y, there is exactly one x in X such that
f(x) = y. Alternatively, f is bijective if it is a one-to-one correspondence between those sets; i.e., both one-to-one (injective) and onto (surjective). (It should be noted that one-to-one function means one-to-one correspondence (i.e., bijection) to some authors, but injection to others.) For example, consider the function succ, defined from the set of integers  to , that to each integer x associates the integer succ(x) = x + 1. For another example, consider the function sumdif that to each pair (x,y) of real numbers associates the pair sumdif(x,y) = (x&_160;+&_160;y, x&_160;-&_160;y). A bijective function from a set to itself is also called a permutation.
|
Bijection Subcategories
Bijection Articles
|
|
