Bijective Function

A function is bijective or “invertible” if it is

Both one-to-one and onto (injective and surjective)

In other words: each element of one set is paired with exactly one element of the other set, and vice versa