Difference between revisions of "Involution"
(→Properties) |
|||
Line 1: | Line 1: | ||
− | An involution is a function whose inverse is itself. | + | An involution is a function whose inverse is itself. That is, <math>f(f(x))=x</math>. |
From the perspective of set theory and functions, if a relation is a function and is symmetric, then it is an involution. | From the perspective of set theory and functions, if a relation is a function and is symmetric, then it is an involution. | ||
Latest revision as of 07:05, 9 May 2024
An involution is a function whose inverse is itself. That is, . From the perspective of set theory and functions, if a relation is a function and is symmetric, then it is an involution.
Examples
- The function has the inverse , which is the same function, and thus is an involution.
- The logical NOT is an involution because .
- The additive negation is an involution because .
- The identity function is an involution because therefore, and . Hence, it is an involution.
- The multiplicative inverse is an involution because . In fact, for any is an involution.
Properties
- Function is an involution . This induces that both and are in f. By the definition of the inverse of a function, is the inverse of the function f. Therefore, the function f must contain . From this, it is obtained that . Simmilalry, we can show that . Thus, .
Rewriting the first line we have: function is an involution .
- A function is an involution iff it is symmetric about the line in the coordinate plane.
- All involutions are bijections.
This article is a stub. Help us out by expanding it.