Bijection
From Wikipedia, the free encyclopedia
|
|
The English used in this article may not be easy for everybody to understand. (March 2012) |
"Bijective function" redirects here. For other uses, see Bijective function (disambiguation).
A bijection (or bijective function) is a function that is both injective and surjective. A bijection is sometimes called a one-to-one mapping, or a one-to-one correspondence.
This is the same as saying: a function
with domain
and codomain
is bijective if and only if
and
are different whenever
and
are different, and every element
of
has an element
of
where
.
If
is a bijection from
to
then its inverse,
, is a bijection from
to
.