 ##  [Bijection](/bijection-0) 

 Definition

A mapping between two sets that is both injective and surjective, so each element of the domain corresponds to exactly one element of the codomain and every codomain element is paired with some domain element.

 

 

 

 

 

 





## Principle

Principle

A bijection establishes a one-to-one correspondence and therefore an equality of cardinalities between sets; it provides an invertible pairing that allows construction of an inverse function from codomain to domain.

 

 

 

 

 





## Demonstration

Demonstration

A typical example is the map f: N → Z_{≥0}×{0,1} that pairs natural numbers with even and odd encodings, or more simply the bijection between the set {1,2,3} and itself given by any permutation; for infinite sets, there is a bijection between N and the set of even natural numbers when codomain is taken as that set.

 

 

 

 

## Misapplication

Misapplication

Using a bijection of underlying sets to conclude preservation of additional structure (algebraic, topological or smooth) without checking structure-preserving conditions; a bijection alone says nothing about compatibility with operations or topology.

 

 

 

 

 





## Consequence

Consequence

Bijections imply equal cardinality and permit inversion: combinatorial counts, cardinal arithmetic, and the transfer of labeling or enumeration arguments rely on bijective correspondences.

 

 

 

 

## Reversal

Reversal

A map that is injective but not surjective or surjective but not injective fails to be a bijection, showing either missing codomain elements or collapsed domain elements respectively.

 

 

 

 

 





## Boundary

Boundary

Bijection is a set-theoretic notion independent of extra structure; it does not automatically grant continuity, linearity, or other categorical properties unless those are separately verified.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Bijection can be conflated with isomorphism when extra structure is ignored; the tension is whether the relevant notion is mere one-to-one correspondence or structure-respecting equivalence.

 

 

 

 

 





## Synthesis

Synthesis

A bijection is the invertible set map that pairs domain and codomain elements one-to-one and onto, establishing exact correspondence and equal cardinality.