Mathematics, Discrete Mathematics, Programming.
possible input. A nice example is defining f: Z → Z on f(x) = x. Recall that our function will take in inputs and outputs that are integers. Proving that it is injective is as easy as fixing two arbitrary values. Fix arbitrary a and b in set Z. f(a) = a f(b) = b as you can see a and b are not