From Wikipedia, the free encyclopedia

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).^[1] (See also Bijection, injection and surjection.)

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 + y, x − y).

A bijective function is also called a permutation. This is more commonly used when X = Y. It should be noted that one-to-one function means one-to-one correspondence (i.e., bijection) to some authors, but injection to others. The set of all bijections from X to Y is denoted as XY.

Bijective functions play a fundamental role in many areas of mathematics, for instance in the definition of isomorphism (and related concepts such as homeomorphism and diffeomorphism), permutation group, projective map, and many others.

Contents 1 Composition and inverses 2 Bijections and cardinality 3 Examples and counterexamples 4 Properties 5 References 6 Bijections and category theory 7 See also

A function f is bijective if and only if its inverse relation f ⁻¹ is a function. In that case, f ⁻¹ is also a bijection.

The composition g o f of two bijections f XY and g YZ is a bijection. The inverse of g o f is (g o f)⁻¹ = (f ⁻¹) o (g⁻¹).

On the other hand, if the composition g o f of two functions is bijective, we can only say that f is injective and g is surjective.

A relation f from X to Y is a bijective function if and only if there exists another relation g from Y to X such that g o f is the identity function on X, and f o g is the identity function on Y. Consequently, the sets have the same cardinality.

If X and Y are finite sets, then there exists a bijection between the two sets X and Y if and only if X and Y have the same number of elements. Indeed, in axiomatic set theory, this is taken as the very definition of "same number of elements", and generalising this definition to infinite sets leads to the concept of cardinal number, a way to distinguish the various sizes of infinite sets.

• For any set X, the identity function id_X from X to X, defined by id_X(x) = x, is bijective.
• The function f from the real line R to R defined by f(x) = 2x + 1 is bijective, since for each y there is a unique x = (y − 1)/2 such that f(x) = y.
• The exponential function g : R R, with g(x) = e^x, is not bijective: for instance, there is no x in R such that g(x) = −1, showing that g is not surjective. However if the codomain is changed to be the positive real numbers R⁺ = (0,+∞), then g becomes bijective; its inverse is the natural logarithm function ln.
• The function h : R [0,+∞) with h(x) = x² is not bijective: for instance, h(−1) = h(+1) = 1, showing that h is not injective. However, if the domain too is changed to [0,+∞), then h becomes bijective; its inverse is the positive square root function.
• is not a bijection because −1, 0, and +1 are all in the domain and all map to 0.
• is not a bijection because π/3 and 2π/3 are both in the domain and both map to (√3)/2.

• A function f from the real line R to R is bijective if and only if its plot is intersected by any horizontal line at exactly one point.
• If X is a set, then the bijective functions from X to itself, together with the operation of functional composition (^o), form a group, the symmetric group of X, which is denoted variously by S(X), S_X, or X! (the last reads "X factorial").
• For a subset A of the domain and subset B of the codomain we have:

|f(A)| = |A| and |f⁻¹(B)| = |B|.

• If X and Y are finite sets with the same cardinality, and f: X → Y, then the following are equivalent:

1. f is a bijection.
2. f is a surjection.
3. f is an injection.

• At least for a finite set S, there is a bijection between the set of possible total orderings of the elements and the set of bijections from S to S. That is to say, the number of permutations (another name for bijections) of elements of S is the same as the number of total orderings of that set -- namely, n!.

Notice that a one-to-one function is injective, but may fail to be surjective, while a one-to-one correspondence is both injective and surjective.^[1]

1. ^ ^{a b} (Note: the use of "one-to-one" to describe an injective function is problematic, since some authors understand it to mean one-to-one correspondence, i.e. a bijective function.)

Formally, bijections are precisely the isomorphisms in the category Set of sets and functions.

• injective function
• symmetric group
• surjective function
• Bijective numeration
• Bijective proof