In mathematics, an involutory matrix is a square matrix that is its own inverse. That is, multiplication by the matrix A is an involution if and only if A2 = I, where I is the n × n identity matrix. Involutory matrices are all square roots of the identity matrix. This is simply a consequence of the fact that any invertible matrix multiplied by its inverse is the identity. The 2 × 2 real matrix is involutory provided that The Pauli matrices in M(2, C) are involutory: One of the three classes of elementary 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 a signature matrix, all of which are involutory. Some simple examples of involutory matrices are shown below. 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 a signature matrix. Any block-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 also symmetric is an orthogonal matrix, and thus represents an isometry (a linear transformation which preserves Euclidean distance). Conversely every orthogonal involutory matrix is symmetric. As a special case of this, every reflection and 180° rotation matrix is involutory. An involution is non-defective, and each eigenvalue equals , so an involution diagonalizes to a signature matrix. A normal involution is Hermitian (complex) or symmetric (real) and also unitary (complex) or orthogonal (real). The determinant of an involutory matrix over any field is ±1. If A is an n × n matrix, then A is involutory if and only if P+ = (I + A)/2 is idempotent. This relation gives a bijection between involutory matrices and idempotent matrices. Similarly, A is involutory if and only if P− = (I − A)/2 is idempotent.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related courses (5)
MATH-111(e): Linear Algebra
L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire et ses applications.
ME-372: Finite element method
L'étudiant acquiert une initiation théorique à la méthode des éléments finis qui constitue la technique la plus courante pour la résolution de problèmes elliptiques en mécanique. Il apprend à applique
MATH-111(g): Linear Algebra
L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire et ses applications.
Show more
Related lectures (45)
Linear Algebra Basics
Covers fundamental concepts in linear algebra, including linear equations, matrix operations, determinants, and vector spaces.
Determinants Calculation
Covers the calculation of determinants and determining matrix invertibility based on parameter values.
Matrix Invertibility
Covers the proof of the invertibility of a matrix by showing that the transpose of the matrix multiplied by itself results in an identity matrix.
Show more
Related publications (19)

IMPROVED VARIANTS OF THE HUTCH plus plus ALGORITHM FOR TRACE ESTIMATION

Daniel Kressner, Ulf David Persson, Alice Cortinovis

This paper is concerned with two improved variants of the Hutch++ algorithm for estimating the trace of a square matrix, implicitly given through matrix-vector products. Hutch++ combines randomized low-rank approximation in a first phase with stochastic tr ...
SIAM PUBLICATIONS2022

Iterative refinement of Schur decompositions

Daniel Kressner, Zvonimir Bujanovic

The Schur decomposition of a square matrix A is an important intermediate step of state-of-the-art numerical algorithms for addressing eigenvalue problems, matrix functions, and matrix equations. This work is concerned with the following task: Compute a (m ...
SPRINGER2022

On the Averaged Green’s Function of an Elliptic Equation with Random Coefficients

Marius Christopher Lemm

We consider a divergence-form elliptic difference operator on the lattice Zd, with a coefficient matrix that is an i.i.d. perturbation of the identity matrix. Recently, Bourgain introduced novel techniques from harmonic analysis to prove the convergence of ...
2019
Show more
Related concepts (7)
Identity matrix
In linear algebra, the identity matrix of size is the square matrix with ones on the main diagonal and zeros elsewhere. It has unique properties, for example when the identity matrix represents a geometric transformation, the object remains unchanged by the transformation. In other contexts, it is analogous to multiplying by the number 1. The identity matrix is often denoted by , or simply by if the size is immaterial or can be trivially determined by the context.
Square root of a matrix
In mathematics, the square root of a matrix extends the notion of square root from numbers to matrices. A matrix B is said to be a square root of A if the matrix product BB is equal to A. Some authors use the name square root or the notation A1/2 only for the specific case when A is positive semidefinite, to denote the unique matrix B that is positive semidefinite and such that BB = BTB = A (for real-valued matrices, where BT is the transpose of B).
Rotation matrix
In linear algebra, a rotation matrix is a transformation matrix that is used to perform a rotation in Euclidean space. For example, using the convention below, the matrix rotates points in the xy plane counterclockwise through an angle θ about the origin of a two-dimensional Cartesian coordinate system. To perform the rotation on a plane point with standard coordinates v = (x, y), it should be written as a column vector, and multiplied by the matrix R: If x and y are the endpoint coordinates of a vector, where x is cosine and y is sine, then the above equations become the trigonometric summation angle formulae.
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.