A function ff from AA to BB is injective if x=yx = y whenever f(x)=f(y)f(x) = f(y). An injective function is also called one-to-one or an injection; it is the same as a monomorphism in the category of sets.

A bijection is a function that is both injective and surjective.

In constructive mathematics, a strongly extensional function between sets equipped with tight apartness relations is called strongly injective if f(x)f(y)f(x) \ne f(y) whenever xyx \ne y (which implies that the function is injective). This is the same as a regular monomorphism in the category of such sets and strongly extensional functions (while any merely injective function, if strongly extensional, is still a monomorphism). Some authors use ‘one-to-one’ for an injective function as defined above and reserve ‘injective’ for the stronger notion.

Last revised on November 7, 2017 at 09:51:26. See the history of this page for a list of all contributions to it.