Invertible matrix

In linear algebra, an invertible matrix (non-singular, non-degenerate or regular) is a square matrix that has an inverse.

Uses your system voice; voice and rate in settings.

≈ 10 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In linear algebra, an invertible matrix (non-singular, non-degenerate or regular) is a square matrix that has an inverse. In other words, if a matrix is invertible, it can be multiplied by its inverse matrix to yield the identity matrix. Invertible matrices are the same size as their inverse.

The inverse of a matrix represents the inverse operation, meaning if a matrix is applied to a particular vector, followed by applying the matrix's inverse, the result is the original vector. An -by- square matrix is called invertible if there exists an -by- square matrix such that \mathbf{AB} = \mathbf{BA} = \mathbf{I}_n , where denotes the -by- identity matrix and the multiplication used is ordinary matrix multiplication.

If this is the case, then the matrix is uniquely determined by , and is called the inverse of , denoted by . Matrix inversion is the process of finding the matrix which when multiplied by the original matrix gives the identity matrix. Ax=b has a unique solution x for every vector b . Equivalently, the columns of A form a basis of the vector space.

These and several other equivalent characterizations are summarized by the invertible matrix theorem. \mathbf{A} = \begin{pmatrix}-1 & \tfrac{3}{2} \\ 1 & -1\end{pmatrix} The matrix \mathbf{A} is invertible, as it has inverse \mathbf{B} = \begin{pmatrix} 2 & 3 \\ 2 & 2\end{pmatrix} , which can be confirmed by computing \mathbf{A}\mathbf{B} = \begin{pmatrix}-1 & \tfrac{3}{2} \\ 1 & -1\end{pmatrix} \begin{pmatrix} 2 & 3 \\ 2 & 2\end{pmatrix} = \begin{pmatrix} (-1) \times 2 + \tfrac 3 2 \times 2 & (-1) \times 3 + \tfrac 3 2 \times 2 \\ 1 \times 2 + (-1) \times 2 & 1 \times 3 + (-1) \times 2\end{pmatrix} = \begin{pmatrix}1 & 0 \\ 0 & 1\end{pmatrix} = \mathbf{I}_2 To check that it is invertible without finding an inverse, \det \mathbf{A} = -\frac{1}{2} can be computed, which is non-zero. \mathbf{C} = \begin{pmatrix} 2 & 4\\ 2 & 4 \end{pmatrix} This matrix is not invertible, because different vectors x and x' have the same value of \mathbf Cx , for example, x=\begin{bmatrix}2\\-1\end{bmatrix} and x'=\begin{bmatrix}0\\0\end{bmatrix} both give \mathbf Cx = \begin{bmatrix}0\\0\end{bmatrix} . So it is impossible to reverse the transformation x\mapsto\mathbf Cx , since different inputs produce the same output.

The determinant of \mathbf{C} is 0, which is a necessary and sufficient condition for a matrix to be non-invertible. \mathbf{A} = \begin{pmatrix}a & b \\ c & d\end{pmatrix} , its inverse is \mathbf{A}^{-1} = \frac{1}{ \det{\mathbf{A}} } \begin{pmatrix}d & -b \\ -c & a\end{pmatrix} . A matrix \mathbf A (over a field such as the real numbers) is invertible if and only if the only solution to the equation \mathbf Ax =0 is the zero vector.

That is, the nullity of \mathbf A is zero: its nullspace consists only of the zero vector. Equivalently, an n\times n matrix is invertible if its rank is n , by the rank-nullity theorem. Such a matrix is said to be of full rank.

Geometrically, this means that the column space of \mathbf A is all of \mathbb R^n . The rank and nullity characterizations are related in the following way: having full rank means that the matrix maps onto all of \mathbb R^n (surjectively), and having nullity zero means that the matrix is one-to-one. That is, it is a bijection, and therefore inveritble.

A more computational criterion for invertibility comes from the standard way of determining the rank and nullity of a matrix. For a square matrix, a matrix is invertible if and only if its row-reduced echelon form is the identity matrix. The reason is that this is the only row-reduced echelon matrix having full rank: all ones down the diagonal and zeros everywhere else.

Another criterion is that a matrix is invertible if and only if its determinant is non-zero. There are many methods to compute the inverse matrix, when it exists. A basic method is to use Gaussian elimination, for example.

This proceeds by considering the inverse matrix A^{-1} as a product of elementary matrices, A^{-1}=E_kE_{k-1}\dots E_1 where the E_i are the elementary matrices corresponding to the elementary row operations needed to put A into its row-reduced echelon form. This method has the advantage that it will produce a row-reduced echelon form regardless of invertibility, and so gives a criterion to decide if a matrix is invertible which is often more efficient than computing the determinant: the matrix is invertible if and only if, at the end of the process, the echelon form is the identity matrix rather than some matrix of lower rank.

To convert this to a practical method for determining using this method, one uses an augmented matrix whose left side is the matrix to invert and whose right side is the identity matrix. Then, Gaussian elimination is used to convert the left side into the identity matrix, which causes the right side to become the inverse of the input matrix.

For example, take the following matrix: \mathbf{A} = \begin{pmatrix}-1 & \tfrac{3}{2} \\ 1 & -1\end{pmatrix} The first step to compute its inverse is to create the augmented matrix \left(\!\!\begin{array}{cc|cc} -1 & \tfrac{3}{2} & 1 & 0 \\ 1 & -1 & 0 & 1 \end{array}\!\!\right) Call the first row of this matrix R_1 and the second row R_2 . Then, add row 1 to row 2 (R_1 + R_2 \to R_2).

This yields \left(\!\!\begin{array}{cc|cc} -1 & \tfrac{3}{2} & 1 & 0 \\ 0 & \tfrac{1}{2} & 1 & 1 \end{array}\!\!\right) Next, subtract row 2, multiplied by 3, from row 1 (R_1 - 3\, R_2 \to R_1), which yields \left(\!\!\begin{array}{cc|cc} -1 & 0 & -2 & -3 \\ 0 & \tfrac{1}{2} & 1 & 1 \end{array}\!\!\right) Finally, multiply row 1 by −1 (-R_1 \to R_1) and row 2 by 2 (2\, R_2 \to R_2). This yields the identity matrix on the left side and the inverse matrix on the right: \left(\!\!\begin{array}{cc|cc} 1 & 0 & 2 & 3 \\ 0 & 1 & 2 & 2 \end{array}\!\!\right) Thus, \mathbf{A}^{-1} = \begin{pmatrix} 2 & 3 \\ 2 & 2 \end{pmatrix} It works because the process of Gaussian elimination can be viewed as a sequence of applying left matrix multiplication using elementary row operations using elementary matrices ( \mathbf E_n ), such as \mathbf E_n \mathbf E_{n-1} \cdots \mathbf E_2 \mathbf E_1 \mathbf A = \mathbf I Applying right-multiplication using \mathbf A^{-1}, we get \mathbf E_n \mathbf E_{n-1} \cdots \mathbf E_2 \mathbf E_1 \mathbf I = \mathbf I \mathbf A^{-1}.

And the right side \mathbf I \mathbf A^{-1} = \mathbf A^{-1}, which is the inverse we want. (\mathbf A^{-1})^{-1} = \mathbf A (k \mathbf A)^{-1} = k^{-1} \mathbf A^{-1} for nonzero scalar (\mathbf{Ax})^+ = \mathbf x^+ \mathbf A^{-1} if has orthonormal columns, where denotes the Moore–Penrose inverse and is a vector (\mathbf A^\mathrm{T})^{-1} = (\mathbf A^{-1})^\mathrm{T} For any invertible -by- matrices and , (\mathbf{AB})^{-1} = \mathbf B^{-1} \mathbf A^{-1}.

More generally, if \mathbf A_1, \dots, \mathbf A_k are invertible -by- matrices, then (\mathbf A_1 \mathbf A_2 \cdots \mathbf A_{k-1} \mathbf A_k)^{-1} = \mathbf A_k^{-1} \mathbf A_{k-1}^{-1} \cdots \mathbf A_2^{-1} \mathbf A_1^{-1}. \det \mathbf A^{-1} = (\det \mathbf A)^{-1}. Left and right inverses are equal.

That is, if \mathbf{LA} = \mathbf I and \mathbf{AR} = \mathbf I then \mathbf L = \mathbf L(\mathbf{AR}) = (\mathbf{LA}) \mathbf R = \mathbf R . The rows of the inverse matrix of a matrix are orthonormal to the columns of (and vice versa interchanging rows for columns). To see this, suppose that where the rows of are denoted as v_i^{\mathrm{T}} and the columns of as u_j for 1 \leq i,j \leq n. Then clearly, the Euclidean inner product of any two v_i^{\mathrm{T}} u_j = \delta_{i,j}.

This property can also be useful in constructing the inverse of a square matrix in some instances, where a set of orthogonal vectors (but not necessarily orthonormal vectors) to the columns of are known. In which case, one can apply the iterative Gram–Schmidt process to this initial set to determine the rows of the inverse .

A matrix that is its own inverse (i.e., a matrix such that and consequently ) is called an involutory matrix. \operatorname{adj}(\mathbf{A})\mathbf{A} = \mathbf{A}\operatorname{adj}(\mathbf{A}) = \det(\mathbf{A})I. In particular, if is invertible, then \mathbf{A}^{-1} = \frac{1}{\det(\mathbf{A})} \operatorname{adj}(\mathbf{A}) \mathbf{AB} = \mathbf{I} \ for finite square matrices and , then also \mathbf{BA} = \mathbf{I}\ This identity does not hold for non-square rectangular matrices, and need not be true for linear operators in infinite dimensions. \frac{\mathrm{d}}{\mathrm{d}t} \mathbf{A}^{-1} = - \mathbf{A}^{-1} \frac{\mathrm{d}\mathbf{A}}{\mathrm{d}t} \mathbf{A}^{-1} To derive the above expression for the derivative of the inverse of A, one can differentiate the definition of the matrix inverse \mathbf{A}^{-1}\mathbf{A}=\mathbf{I} using the product rule, and then solve for the derivative of the inverse of A: \mathbf{0} \frac{ \mathrm{d}}{ \mathrm{d}t} \mathbf{A}^{n} &= \sum_{i=1}^n \mathbf{A}^{i-1}\frac{ \mathrm{d}\mathbf{A}}{ \mathrm{d}t}\mathbf{A}^{n-i},\\ \frac{ \mathrm{d}}{ \mathrm{d}t} \mathbf{A}^{-n} &= -\sum_{i=1}^n \mathbf{A}^{-i}\frac{ \mathrm{d}\mathbf{A}}{ \mathrm{d}t}\mathbf{A}^{-(n+1-i)} \end{align} In particular, \begin{align} (\mathbf{A} + \varepsilon \mathbf{X})^{n} &= \mathbf{A}^{n} + \varepsilon \sum_{i=1}^n \mathbf{A}^{i-1}\mathbf{X}\mathbf{A}^{n-i} + \mathcal{O}\left(\varepsilon^2\right),\\ (\mathbf{A} + \varepsilon \mathbf{X})^{-n} &= \mathbf{A}^{-n} - \varepsilon \sum_{i=1}^n \mathbf{A}^{-i}\mathbf{X}\mathbf{A}^{-(n+1-i)} + \mathcal{O}\left(\varepsilon^2\right) \end{align} The derivative of a matrix determinant with respect to one of its elements is a matrix cofactor, which exhibits the transpose of the matrix inverse: \frac{\mathrm{d}}{\mathrm{d} A_{ij}} \det(\mathbf{A}) = \mathbf{C}_{ij} = {A^{-1}}_{ji} \det(\mathbf{A}) \mathbf{A} = \mathbf{P} \mathbf{D} \mathbf{P}^{-1} where \mathbf{D} is a diagonal matrix and \mathbf{P} is an invertible matrix. This expression allows arbitrary powers of \mathbf{A} to be written in the compact form \mathbf{A}^{k} = \mathbf{P} \mathbf{D}^{k} \mathbf{P}^{-1} where k is a positive integer.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1378159424 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001378159424 · captured 2026-10-03 · ledger · version history

Cite this page as: encyclopegia.org, “Invertible matrix”, snapshot enwiki-001378159424. https://encyclopegia.org/a/invertible-matrix

Sources cited in this revision

3 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.