Square matrix which is its own inverse
Inmathematics , aninvolutory matrix is asquare matrix that is its owninverse . That is, multiplication by the matrixA n × n {\displaystyle {\mathbf {A}}_{n\times n}} is aninvolution if and only ifA 2 = I , {\displaystyle {\mathbf {A}}^{2}={\mathbf {I}},} whereI {\displaystyle {\mathbf {I}}} is then × n {\displaystyle n\times n} identity matrix . Involutory matrices are allsquare roots of the identity matrix. This is a consequence of the fact that anyinvertible matrix multiplied by its inverse is the identity.[ 1]
The2 × 2 {\displaystyle 2\times 2} real matrix( a b c − a ) {\displaystyle {\begin{pmatrix}a&b\\c&-a\end{pmatrix}}} is involutory provided thata 2 + b c = 1. {\displaystyle a^{2}+bc=1.} [ 2]
ThePauli matrices inM ( 2 , C ) {\displaystyle M(2,\mathbb {C} )} are involutory:σ 1 = σ x = ( 0 1 1 0 ) , σ 2 = σ y = ( 0 − i i 0 ) , σ 3 = σ z = ( 1 0 0 − 1 ) . {\displaystyle {\begin{aligned}\sigma _{1}=\sigma _{x}&={\begin{pmatrix}0&1\\1&0\end{pmatrix}},\\\sigma _{2}=\sigma _{y}&={\begin{pmatrix}0&-i\\i&0\end{pmatrix}},\\\sigma _{3}=\sigma _{z}&={\begin{pmatrix}1&0\\0&-1\end{pmatrix}}.\end{aligned}}}
One of the three classes ofelementary matrix is involutory, namely the row-interchange elementary matrix. A special case of another class of elementary matrix, that which represents multiplication of a row or column by −1, is also involutory; it is in fact a trivial example of asignature matrix , all of which are involutory.
Some simple examples of involutory matrices are shown below.
I = ( 1 0 0 0 1 0 0 0 1 ) ; I − 1 = ( 1 0 0 0 1 0 0 0 1 ) R = ( 1 0 0 0 0 1 0 1 0 ) ; R − 1 = ( 1 0 0 0 0 1 0 1 0 ) S = ( + 1 0 0 0 − 1 0 0 0 − 1 ) ; S − 1 = ( + 1 0 0 0 − 1 0 0 0 − 1 ) {\displaystyle {\begin{array}{cc}\mathbf {I} ={\begin{pmatrix}1&0&0\\0&1&0\\0&0&1\end{pmatrix}};&\mathbf {I} ^{-1}={\begin{pmatrix}1&0&0\\0&1&0\\0&0&1\end{pmatrix}}\\\\\mathbf {R} ={\begin{pmatrix}1&0&0\\0&0&1\\0&1&0\end{pmatrix}};&\mathbf {R} ^{-1}={\begin{pmatrix}1&0&0\\0&0&1\\0&1&0\end{pmatrix}}\\\\\mathbf {S} ={\begin{pmatrix}+1&0&0\\0&-1&0\\0&0&-1\end{pmatrix}};&\mathbf {S} ^{-1}={\begin{pmatrix}+1&0&0\\0&-1&0\\0&0&-1\end{pmatrix}}\\\end{array}}} where
I is the 3 × 3 identity matrix (which is trivially involutory);R is the 3 × 3 identity matrix with a pair of interchanged rows;S is asignature matrix .Anyblock-diagonal matrices constructed from involutory matrices will also be involutory, as a consequence of the linear independence of the blocks.
An involutory matrix which is alsosymmetric is anorthogonal matrix , and thus represents anisometry (alinear transformation which preservesEuclidean distance ). Conversely every orthogonal involutory matrix is symmetric.[ 3] As a special case of this, everyreflection and 180°rotation matrix is involutory.
An involution isnon-defective , and eacheigenvalue equals± 1 {\displaystyle \pm 1} , so an involutiondiagonalizes to a signature matrix.
Anormal involution isHermitian (complex) or symmetric (real) and alsounitary (complex) or orthogonal (real).
Thedeterminant of an involutory matrix over anyfield is ±1.[ 4]
IfA is ann × n matrix, thenA is involutory if and only ifP + = ( I + A ) / 2 {\displaystyle {\mathbf {P}}_{+}=({\mathbf {I}}+{\mathbf {A}})/2} isidempotent . This relation gives abijection between involutory matrices and idempotent matrices.[ 4] Similarly,A is involutory if and only ifP − = ( I − A ) / 2 {\displaystyle {\mathbf {P}}_{-}=({\mathbf {I}}-{\mathbf {A}})/2} isidempotent . These two operators form the symmetric and antisymmetric projectionsv ± = P ± v {\displaystyle v_{\pm }={\mathbf {P}}_{\pm }v} of a vectorv = v + + v − {\displaystyle v=v_{+}+v_{-}} with respect to the involutionA , in the sense thatA v ± = ± v ± {\displaystyle {\mathbf {A}}v_{\pm }=\pm v_{\pm }} , orA P ± = ± P ± {\displaystyle {\mathbf {AP}}_{\pm }=\pm {\mathbf {P}}_{\pm }} . The same construct applies to anyinvolutory function , such as thecomplex conjugate (real and imaginary parts),transpose (symmetric and antisymmetric matrices), andHermitian adjoint (Hermitian andskew-Hermitian matrices).
IfA is an involutory matrix inM ( n , R ) , {\displaystyle M(n,\mathbb {R} ),} which is amatrix algebra over thereal numbers , andA is not a scalar multiple ofI , then thesubalgebra { x I + y A : x y ∈ R } {\displaystyle \{x{\mathbf {I}}+y{\mathbf {A}}:xy\in \mathbb {R} \}} generated by A isisomorphic to thesplit-complex numbers .
IfA andB are two involutory matrices whichcommute with each other (i.e.AB =BA ) thenAB is also involutory.
IfA is an involutory matrix then everyinteger power ofA is involutory. In fact,A n will be equal toA ifn isodd andI ifn iseven .
^ Higham, Nicholas J. (2008), "6.11 Involutory Matrices",Functions of Matrices: Theory and Computation , Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM), pp. 165– 166,doi :10.1137/1.9780898717778 ,ISBN 978-0-89871-646-7 ,MR 2396439 .^ Peter Lancaster & Miron Tismenetsky (1985)The Theory of Matrices , 2nd edition, pp 12,13Academic Press ISBN 0-12-435560-9 ^ Govaerts, Willy J. F. (2000),Numerical methods for bifurcations of dynamical equilibria , Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM), p. 292,doi :10.1137/1.9780898719543 ,ISBN 0-89871-442-7 ,MR 1736704 .^a b Bernstein, Dennis S. (2009), "3.15 Facts on Involutory Matrices",Matrix Mathematics (2nd ed.), Princeton, NJ: Princeton University Press, pp. 230– 231,ISBN 978-0-691-14039-1 ,MR 2513751 .