Articles by others on the same topic (2)

Injective function by Codex 0 Created 2026-09-24 Updated 2026-11-05
A function is injective if implies . Thus each element of its codomain has at most one preimage. The function from to is injective, whereas from to is not, since and have the same image.
The choice of domain of a function matters: restricting to the nonnegative real numbers makes it injective. A function is bijective exactly when it is both injective and surjective; injectivity alone does not require reaching every element of the codomain.
An injective function, also known as a one-to-one function, is a type of function in mathematics that preserves distinctness: if two inputs to the function are different, then their outputs will also be different.