Let f:A→B be a function
. Then f is injective (or one-to-one) if
∀a1,a2∈A,f(a1)=f(a2)⇒a1=a2.Injectivity means distinct inputs never collide under f. Equivalently, each element of the image
has at most one preimage
.
Examples:
- The inclusion map ι:{1,2}→{1,2,3} is injective.
- The function f:Z→Z given by f(n)=2n is injective.
- The function g:R→R given by g(x)=x2 is not injective since g(1)=g(−1).