Difference between revisions of "Inverse"
Line 3: | Line 3: | ||
=Excerpt from Wikipedia= | =Excerpt from Wikipedia= | ||
The following paragraph is copied from Wikipedia. | The following paragraph is copied from Wikipedia. | ||
=== | ===Compositional inverseInverses and composition=== | ||
If {{mvar|f}} is an invertible function with domain {{mvar|X}} and codomain {{mvar|Y}}, then | If {{mvar|f}} is an invertible function with domain {{mvar|X}} and codomain {{mvar|Y}}, then |
Revision as of 14:23, 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 f is an invertible function with domain X and codomain Y, then
- , for every ; and , for every .[1]
Using the composition of functions, we can rewrite this statement as follows:
- and
where idX is the identity function on the set X; that is, the function that leaves its argument unchanged. In category theory, this statement is used as the definition of an inverse morphism.
Considering function composition helps to understand the notation f −1. Repeatedly composing a function with itself is called iteration. If f is applied n times, starting with the value x, then this is written as f n(x); so f 2(x) Template:= f (f (x)), etc. Since f −1(f (x)) Template:= x, composing f −1 and f n yields f n−1, "undoing" the effect of one application of f.
- ↑ Cite error: Invalid
<ref>
tag; no text was provided for refs named:2