Bijection

A bijective function, f: X → Y, where set X is {1, 2, 3, 4} and set Y is {A, B, C, D}. For example, f(1) = D.

A bijection, bijective function, or one-to-one correspondence between two mathematical sets is a function such that each element of the second set (the codomain) is mapped to from exactly one element of the first set (the domain). Equivalently, a bijection is a relation between two sets such that each element of either set is paired with exactly one element of the other set.

A function is bijective if and only if it is invertible; that is, a function $f:X\to Y$ is bijective if and only if there is a function $g:Y\to X,$ the inverse of $f$ , such that each of the two ways for composing the two functions produces an identity function: $g(f(x))=x$ for each $x$ in $X$ and $f(g(y))=y$ for each $y$ in $Y.$

For example, the multiplication by two defines a bijection from the integers to the even numbers, which has the division by two as its inverse function.

A function is bijective if and only if it is both injective (or one-to-one)—meaning that each element in the codomain is mapped to from at most one element of the domain—and surjective (or onto)—meaning that each element of the codomain is mapped to from at least one element of the domain. The term one-to-one correspondence must not be confused with one-to-one function, which means injective but not necessarily surjective.

The elementary operation of counting establishes a bijection from some finite set to the first natural numbers $(1, 2, 3, ...)$ , up to the number of elements in the counted set. It results that two finite sets have the same number of elements if and only if there exists a bijection between them. More generally, two sets are said to have the same cardinal number if there exists a bijection between them.

A bijective function from a set to itself is also called a permutation,^[1] and the set of all permutations of a set forms its symmetric group.

Some bijections with further properties have received specific names, which include automorphisms, isomorphisms, homeomorphisms, diffeomorphisms, permutation groups, and most geometric transformations. Galois correspondences are bijections between sets of mathematical objects of apparently very different nature.

^ Hall 1959, p. 3

[1] Hall 1959, p. 3

[1]

Function
$x \mapsto f (x)$
History of the function concept
Examples of domains and codomains
$X$ → $\mathbb {B}$ , $\mathbb {B}$ → $X$ , $\mathbb {B} ^{n}$ → $X$ $X$ → $\mathbb {Z}$ , $\mathbb {Z}$ → $X$ $X$ → $\mathbb {R}$ , $\mathbb {R}$ → $X$ , $\mathbb {R} ^{n}$ → $X$ $X$ → $\mathbb {C}$ , $\mathbb {C}$ → $X$ , $\mathbb {C} ^{n}$ → $X$
Classes/properties
Constant Identity Linear Polynomial Rational Algebraic Analytic Smooth Continuous Measurable Injective Surjective Bijective
Constructions
Restriction Composition λ Inverse
Generalizations
Binary relation Partial Multivalued Implicit Space
v t e