Involution — Definition, Formula & Examples
An involution is a function that, when applied twice, gives back the original value. In other words, doing the operation once and then doing it again undoes itself.
A function on a set is an involution if , meaning for every . Equivalently, is its own inverse: .
Key Formula
Where:
- = A function from a set to itself
- = Any element in the domain of f
How It Works
To check whether a function is an involution, compose it with itself and see if you recover the identity. If for all in the domain, the function is an involution. In group theory, involutions are precisely the elements of order 2 (plus the identity, which is a trivial involution). In linear algebra, a matrix is an involution when .
Worked Example
Problem: Determine whether the function (defined on ) is an involution.
Step 1: Compute by substituting into itself.
Step 2: Since for every , the function satisfies the involution condition.
Answer: Yes, is an involution because applying it twice returns the original input.
Why It Matters
Involutions appear throughout mathematics: matrix transposition, complex conjugation, and negation are all everyday involutions. In abstract algebra, counting involutions in a group reveals structural information used in the classification of finite simple groups. In cryptography, ciphers like the Enigma machine relied on involutory permutations so that the same procedure could encrypt and decrypt.
Common Mistakes
Mistake: Confusing involutions with idempotent functions. An idempotent satisfies , not .
Correction: Remember: an involution undoes itself (returns to ), while an idempotent repeats itself (stays at ). These are different conditions unless is the identity.