Bijection
A function is a bijection when it is both onto and one to one.
Translation: Each element \(a \in A\) is matched with a unique element \(f(a) \in B\), and every element of \(B\) is matched with something from \(A\).
A function is a bijection when it is both onto and one to one.
Translation: Each element \(a \in A\) is matched with a unique element \(f(a) \in B\), and every element of \(B\) is matched with something from \(A\).