Bijective Function

Rarely Tested

Bijective Function

## Definition / Concept

A function is bijective if it is both one-one and onto.

## Formula

$$f\text{ is bijective}\Leftrightarrow f\text{ is one-one and onto}$$

## Conditions / Special Cases

For finite sets, a bijection between $A$ and $B$ requires:

$$n(A)=n(B)$$

A bijective function has a unique inverse function.

## Usage

- Used to establish one-to-one correspondence between two sets.

- Essential for inverse-function problems.

Question 1

Assertion (A)  :If f : [0, ∞) → [0, ∞) is a monotonic bijection, then f(0) = 0.

Reason (R)  : A monotone increasing bijection from [0, ∞) onto [0, ∞) must map the least value of the domain to the least value of the codomain, and no monotone decreasing bijection from [0, ∞) onto [0, ∞) can exist.

Go back to topics

Join CAT 2026 course by 5-Time CAT 100%iler

Start your IIM journey with the right preparation and crack CAT 2026.