Difference between revisions of "Involution"
(New page: An involution is a function whose inverse is itself. == Examples == * The logical NOT is an involution because <math>\neg \neg p} \equiv p</math>.) |
m (→Examples) |
||
| Line 3: | Line 3: | ||
== 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 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>. | ||
Revision as of 08:55, 31 August 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).
has the inverse 
, which is the same function, and thus 
is an involution.
