Finite Math Examples

A bijection is a function giving an exact pairing of the elements of two sets. Every element of one set should be paired with exactly one element of the other set, and every element of the other set should be paired with exactly one element of the first set, and there should be no unpaired elements. Since ${\displaystyle (-5,1),(-2,8),(0,1)}$ is not injective function, then it cannot be bijective function.