In mathematics, involution means a self- inverse mapping . The name is derived from the Latin word involvere "to wrap up".
A picture with a matching definition and target quantity is said to be an involution if all the following applies: .
This requirement can also be formulated more compactly than or . Here referred to the identity on .
- Every involution is a bijection and it applies .
- If and are involutions, then their composition is itself an involution if and only if holds.
- If there is a bijection of the finite set (i.e. an element of the symmetrical group ), then it is involutor if and only if it can be written as the product of disjunct swaps . In this case one speaks of a self-inverse permutation .
Involutions on vector spaces
Let be a finite-dimensional vector space over the body .
- A (linear) self-mapping is involutive if and only if the minimal polynomial of has the form , or . This means in particular:
- If the characteristic of the basic body is different from 2, then every involutive
- Each involution is a representation of the group Z / 2Z in the general linear group GL (V).
- Over bodies with characteristic 2 there are involutionary endomorphisms that cannot be diagonalized. Thus, in the two-dimensional vector space , the matrix gives an involution that cannot be diagonalized.
Negative and reciprocal
are involutions because it applies
- for all
- for everyone .
If in general an Abelian group is , then the mapping (with additive notation) or (with multiplicative notation) is a group automorphism and an involution. For a non-Abelian group, this mapping is also an involution, but not a group homomorphism (nonetheless a group anti- homomorphism ).
The negation in classical logic is also an involution, because the following applies:
The complex conjugation
When calculating with complex numbers , the formation of the conjugate complex number is an involution: For a complex number with is the conjugate complex number
Performing the conjugation again delivers .
The quaternion conjugation
To the quaternion
with becomes the conjugated quaternion through
educated. Because of the reversal of the order (important for non- commutative rings!) Of the factors in the multiplication
this conjugation is called antiautomorphism .
Performing the conjugation again delivers
So it is an involution.
Both properties together result in an involutive anti-automorphism .
In the set of square matrices above a ring is the transpose
an involution. Since there is a ring, even an involutive anti-automorphism.
Calculate in F 2
In the additive group of the remainder class field , the mapping is an involution:
In geometry , point and line reflections are involutions.
Involuntary ciphers have the peculiarity that the algorithms for encryption and decryption are identical. They are therefore particularly easy to use. A simple example from cryptology is the shift code ROT13 , in which each letter is replaced by the letter shifted by 13 places in the alphabet for encryption . Applying this method twice results in a shift of 26 letters and thus again the original plain text . In history, however, there were also much more complex involutive encryption methods. The best-known example is the German ENIGMA encryption machine , which was used in communications by the German military during World War II .
The logical function Exclusive Or is also self-inverse and is therefore used in encryption algorithms such as One Time Pad .
A body involution is usually understood to be an involution that is also a body automorphism .
So one demands a body involution over a body
as well as for everyone
The best known nontrivial body involution is the conjugation over the complex numbers . For this reason the same notation is used for a body involution as for the complex conjugation: instead of is often written.
Another example is the automorphism of the body
is defined. Note that in contrast to the complex conjugation, it does not receive the amount:
- Involution . In: Michiel Hazewinkel (Ed.): Encyclopaedia of Mathematics . Springer-Verlag , Berlin 2002, ISBN 978-1-55608-010-4 (English, online ).