Also found in: Dictionary, Wikipedia.


A mapping ƒ from a set A onto a set B which is both an injection and a surjection; that is, for every element b of B there is a unique element a of A for which ƒ (a) = b. Also known as bijective mapping.


A function is bijective or a bijection or a one-to-one correspondence if it is both injective (no two values map to the same value) and surjective (for every element of the codomain there is some element of the domain which maps to it). I.e. there is exactly one element of the domain which maps to each element of the codomain.

For a general bijection f from the set A to the set B:

f'(f(a)) = a where a is in A and f(f'(b)) = b where b is in B.

A and B could be disjoint sets.

See also injection, surjection, isomorphism, permutation.
References in periodicals archive ?
An affine permutation is a bijection [pi]: Z [right arrow] Z such that
Let S is a right normal orthodox semigroup with an inverse transversal S[degrees], Blyth and Almeida Snatos in [4] proved that there is an order-preserving bijection from the set of all locally maximal S[degrees]-cones to the set of all left amenable orders definable on S and the natural partial order is the smallest left amenable partial order(see theorems 7 and 11 in [4]).
Real part]] is bijection fuzzy map, but the converse not necessarily true.
This clearly define a bijection or relation of equivalence between the hidden variables [[[lambda].
Using the fact that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] is a bounded bijection of H onto [l.
Hence, fixing a triple s [member of] C gives a bijection Aut([pi]) [right arrow] C, [sigma] [right arrow] [sigma] * s.
It can be shown [2] that there is a bijection between the set of expected values, [mu], and the set of natural parameters, [theta].
This mapping is a bijection between Borel probability measures on R and C.
L'homeomorphismeest << une bijection qui, a deux elements voisins d'un ensemble, fait correspondre deux elements egalement voisins d'un autre >> (21).
In order to prove Theorem 1, we first find a combinatorial bijection for nonnesting partitions that leads to a differential equation for the H-triangle analogous to one known for the F-triangle.
Any vg-irresolute bijection from a vg-compact space onto a [vg.