A function is said to be bijective if for every element in it's codomain there is only one element in it's domain that produces that value. Bijection must satisfy both the surjective properties as well as the injective properties.