Question: are all injective functions bijective?
Answer: A function is bijective if it is both injective and surjective. ... A function f : X → Y is bijective if and only if it is invertible, that is, there is a function g: Y → X such that g o f = identity function on X and f o g = identity function on Y. This function maps each image to its unique preimage.