Difference between revisions of "Involution"
m (→Examples) |
|||
Line 1: | Line 1: | ||
− | An involution is a function whose inverse is itself. | + | An involution is a function whose inverse is itself. |
== Examples == | == Examples == | ||
* The function <math>y(x)=x</math> has the inverse <math>x(y)=y</math>, which is the same function, and thus <math>f(x)=x</math> is an involution. | * The function <math>y(x)=x</math> has the inverse <math>x(y)=y</math>, which is the same function, and thus <math>f(x)=x</math> is an involution. | ||
− | * The logical NOT is an involution because <math>\neg \neg p} \equiv p</math>. | + | * The [[logical NOT]] is an involution because <math>\neg \neg p} \equiv p</math>. |
+ | * The additive negation is an involution because <math>--x=x</math>. | ||
+ | * The [[multiplicative inverse]] is an involution because <math>\frac{1}{\frac{1}{x}}=x</math>. In fact, for any <math>n \neq 0</math>, <math>f(x)=\frac{n}{x}</math> is an involution. | ||
+ | |||
+ | == Properties == | ||
+ | * An function is an involution [[iff]] it is symmetric about the line <math>f(x)=x</math> in the coordinate plane. |
Revision as of 18:29, 19 September 2008
An involution is a function whose inverse is itself.
Examples
- The function has the inverse , which is the same function, and thus is an involution.
- The logical NOT is an involution because $\neg \neg p} \equiv p$ (Error compiling LaTeX. Unknown error_msg).
- The additive negation is an involution because .
- The multiplicative inverse is an involution because . In fact, for any , is an involution.
Properties
- An function is an involution iff it is symmetric about the line in the coordinate plane.