Injective function: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Richard Pinch
(added example class of strictly montonic functions)
mNo edit summary
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
{{subpages}}
In [[mathematics]], an '''injective function''' or '''one-to-one function''' or '''injection''' is a [[function (mathematics)|function]] which has different output values on different input values: ''f'' is injective if <math>x_1 \neq x_2</math> implies that <math>f(x_1) \neq f(x_2)</math>.
In [[mathematics]], an '''injective function''' or '''one-to-one function''' or '''injection''' is a [[function (mathematics)|function]] which has different output values on different input values: ''f'' is injective if <math>x_1 \neq x_2</math> implies that <math>f(x_1) \neq f(x_2)</math>.


Line 7: Line 8:
==See also==
==See also==
* [[Bijective function]]
* [[Bijective function]]
* [[Surjective function]]
* [[Surjective function]][[Category:Suggestion Bot Tag]]

Latest revision as of 12:00, 1 September 2024

This article is a stub and thus not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and subject to a disclaimer.

In mathematics, an injective function or one-to-one function or injection is a function which has different output values on different input values: f is injective if implies that .

An injective function f has a well-defined partial inverse . If y is an element of the image set of f, then there is at least one input x such that . If f is injective then this x is unique and we can define to be this unique value. We have for all x in the domain.

A strictly monotonic function is injective, since in this case implies that .

See also