Bijective Function (Bijection)
Bijective function connects elements of two sets such that, it is both oneone and onto function. The elements of the two sets are mapped in such a manner that every element of the range is in codomain, and is related to a distinct domain element. In simple words, we can say that a function f: A→B is said to be a bijective function or bijection if f is both oneone (injective) and onto (surjective).
In this article, we will explore the concept of the bijective function, and define the concept, its conditions, its properties, and applications with the help of a diagram. We will go through various examples based on bijection to better understand the concept.
What Is a Bijective Function?
A bijective function is a combination of an injective function and a surjective function. Bijective function relates elements of two sets A and B with the domain in set A and the codomain in set B, such that every element in A is related to a distinct element in B, and every element of set B is the image of some element of set A.
The bijective function is both a oneone function and onto function. A bijective function from set A to set B has an inverse function from set B to set A. A bijective function of a set of elements defined to itself is called a permutation. Here every element of the set is related to itself.
From the above examples of bijective function, we can observe that every element of set B has been related to a distinct element of set A. The nonbijective functions have some element in set B which do not have a preimage in set A, or some of the elements in set B is the image for more than one element in set A.
Bijective Function Definition
A function f: A→B is said to be a bijective function if f is both oneone and onto, that is, every element in A has a unique image in B and every element of B has a preimage in set A. In simple words, we can say that a function f is a bijection if it is both injection and surjection.
Bijective Function Conditions
There are some conditions that need to be satisfied for a function to be a bijection. The bijective functions need to satisfy the following four conditions.
 Every element of set A must be paired with an element of set B.
 The element of set A must not be paired with more than one element of set B.
 Each element of set B must be paired with an element of set A.
 The element of set B must not be paired with more than one element of set A.
Properties of Bijection
Now that we have understood the meaning of bijection, given below are a few important properties of bijective functions which are useful in understanding the concept better:
 The domain and codomain sets of a bijective function have an equal number of elements.
 The codomain and range of the bijective function are the same.
 The bijective function has an inverse function.
 The inverse of a bijective function is also a bijection.
 The bijection cannot be a constant function.
 Bijective functions if represented as a graph is always a straight line.
 The bijective function follows a reflexive, symmetric, and transitive property.
 The composition of bijections f and g is also a bijective function. If f and g are bijective functions, then f o g is also a bijection.
Injective Surjective Bijective
In this section, we will discuss the meaning and differences between injective, surjective, and bijective functions. The injective function is also known as the oneone function, and the surjective function is also called the onto function.
Injective  Surjective  Bijective 

A function f: X→Y is said to be injective when for each x_{1}, x_{2} ∈ X if f(x_{1}) = f(x_{2}) then x_{1} = x_{2}.  A function f: X→Y is said to be surjective when, if for each y ∈ Y there exists some x in X such that f(x) = y.  A function f: X→Y is said to be bijective if f is both oneone and onto. 
Example: f: R→R defined as f(x) = 2x  Example: For A = {1,−1,2,3} and B = {1,4,9}, f: A→B defined as f(x) = x^{2} is surjective.  Example: Example: For A = {−1,2,3} and B = {1,4,9}, f: A→B defined as f(x) = x^{2} is bijective. 
Onetoone Correspondence
OnetoOne functions define that each element of one set called Set (A) is mapped with a unique element of another set called Set (B). A function f : X → Y is said to be one to one correspondence, if the images of unique elements of X under f are unique, i.e., for every x_{1} , x_{2} ∈ X, f(x_{1}) = f(x_{2}) implies x_{1} = x_{2} and also range = codomain. Otherwise, we call it a noninvertible function or not a bijective function. Therefore we can say, every element of the codomain of onetoone correspondence is the image of only one element of its domain.
Important Notes on Bijective Function
 A function is a bijection if it is both injective and surjective.
 Every element in A has a unique image in the codomain and every element of the codomain has a preimage in the domain.
Related Topics
Bijective Function Examples

Example 1: Prove that the oneone function f : {1, 2, 3} → {4, 5, 6} is a bijective function.
Solution:
The given function f: {1, 2, 3} → {4, 5, 6} is a oneone function, and hence it relates every element in the domain to a distinct element in the codomain set. The three elements of the domain set relate to all the three elements of the codomain set. Also since the codomain includes all the elements of the second set, the given function is also an onto function as the range is equal to the codomain.
Therefore, the given function is a bijective function.

Example 2: Show that the function f : N → N, given by f(x) = x + 1, if x is odd, and x  1, if x is even, is a surjective function,
Solution:
Let f(x_{1}) = f(x_{2}). Further, let us suppose that x_{1} is odd, and x_{2} is even, then we have x_{1} + 1 = x_{2}  1, or x_{2}  x_{1} = 2, which is not possible.
Also the possibility of x_{1} being even, and x_{2} being odd is also ruled out, using the same argument. Therefore x_{1}, and x_{2} both should be either odd or even.
Let us assume both x_{1}, and x_{2} to be odd, and we have f(x_{1}) = f(x_{2}) ⇒ x_{1} + 1 = x_{2} + 1 ⇒ x_{1} = x_{2}. Also, if both x_{1}, and x_{2} are even, we have \(f(x_1) = f(x_2)\) ) ⇒ f(x_{1}) = f(x_{2}) ⇒ x_{1}  1 = x_{2}  1 ⇒ x_{1} = x_{2}. Therefore, the function f is a oneone function.
Further, any odd number 2n + 1 in the codomain of N is the image of 2n + 2 in the domain of N, and any even number 2n in the codomain of N, is the image of 2n  1 in the domain N. Hence the function is onto function.
Therefore, the given function is a bijective function.
FAQs on Bijective Function
What Is a Bijective Function?
Bijective function relates elements of two sets such that every element of the domain set is related to a distinct element of the codomain set, and every element of the codomain set has been utilized.
How Do We Know If a Function Is a Bijective Function?
A function can be easily identified as a bijective function if it is a oneone function, and every element of the codomain set has a preimage in the domain set.
Are all Functions Bijections?
All the functions are not bijective functions. Some functions can only be injective, or only surjective functions. Some elements of the codomain set may not be utilized or the elements of the codomain set may be related to more than one element of the domain set.
How Many Types of Bijective Functions Are There?
There is only one bijective function, and it does not have any more classifications. A bijective function is a combination of an injective function and a surjective function.
Is x^{2} a Bijective Function?
A square function f(x) = x^{2} is not a bijective function if the codomain of the function is all real numbers.
Is the Inverse of a Bijective Function Bijective?
Yes, the inverse of a bijective function is also a bijective function. If a function f: A → B is defined as f(a) = b is bijective, then its inverse f^{1}(y) = x is also a bijection.
How to Prove Bijective Function?
To prove that a function is a bijective function, we need to show that every element of the domain has a unique image in the codomain set and each codomain element has a preimage in the domain set.
Why do only Bijective Functions Have Inverses?
A function f: A→B has an inverse if and only if it is bijective so that every element of the codomain can be mapped back to an element of the domain that becomes the codomain of the inverse function.
What is Onetoone Correspondence?
A function f : X → Y is said to be one to one correspondence, if the images of unique elements of X under f are unique, i.e., for every x_{1} , x_{2} ∈ X, f(x_{1} ) = f(x_{2} ) implies x_{1} = x_{2} and also range = codomain.
visual curriculum