Canonical: https://knowlpedia.com/shared-foundations/bijective-function/

# Bijective function

A function that is both injective and surjective.

A **bijective function** is a [function](https://knowlpedia.com/shared-foundations/function/) \(f:A\to B\) that is both [injective](https://knowlpedia.com/shared-foundations/injective-function/) and [surjective](https://knowlpedia.com/shared-foundations/surjective-function/).

## Remarks

A function is bijective if and only if it has a two-sided [inverse function](https://knowlpedia.com/shared-foundations/inverse-function/). Two sets have the same [cardinality](https://knowlpedia.com/shared-foundations/cardinality/) precisely when a bijection exists between them.

## Examples

- The function \(f:\mathbb Z\to\mathbb Z\), \(f(n)=n+1\), is bijective.
- The map \(\{1,2,3\}\to\{a,b,c\}\) defined by \(1\mapsto a\), \(2\mapsto b\), and \(3\mapsto c\) is bijective.
