Difference between revisions of "Inverse"

From PKC
Jump to navigation Jump to search
Line 7: Line 7:
If <math>f</math> is an invertible function with domain <math>X</math> and codomain <math>Y</math>, then
If <math>f</math> is an invertible function with domain <math>X</math> and codomain <math>Y</math>, then


: <math> f^{-1}\left( \, f(x) \, \right) = x</math>, for every <math>x \in X</math>; and <math> f\left( \, f^{-1}(y) \, \right) = y</math>, for every <math>y \in Y. </math>.<ref name=":2" />
: <math> f^{-1}\left( \, f(x) \, \right) = x</math>, for every <math>x \in X</math>; and <math> f\left( \, f^{-1}(y) \, \right) = y</math>, for every <math>y \in Y. </math>.


Using the [[composition of functions]], we can rewrite this statement as follows:
Using the [[composition of functions]], we can rewrite this statement as follows:

Revision as of 14:26, 6 August 2021

The notion of inverse in mathematical operation is simply the anti-operator.

Excerpt from Wikipedia

The following paragraph is copied from Wikipedia.

Compositional inverseInverses and composition

If is an invertible function with domain and codomain , then

, for every ; and , for every .

Using the composition of functions, we can rewrite this statement as follows:

and

where is the identity function on the set ; that is, the function that leaves its argument unchanged. In Category Theory, this statement is used as the definition of an inverse morphism.