Skip to content

Mathematics · Ch 1 — Applications of Matrices and Determinants

Properties of Inverses of Matrices

1.2.3

Properties of Inverses of Matrices

Collecting the working laws obeyed by inverses (for non-singular square matrices A,BA,B of the same order, and λ≠0\lambda\ne0 a scalar):

Theorem 1.4. (i) ∣A−1∣=1∣A∣|A^{-1}|=\dfrac1{|A|}. (ii) (AT)−1=(A−1)T(A^T)^{-1}=(A^{-1})^T. (iii) (λA)−1=1λA−1(\lambda A)^{-1}=\dfrac1\lambda A^{-1}.

Proof sketch of (i). From AA−1=InAA^{-1}=I_n, the product rule gives ∣A∣∣A−1∣=1|A||A^{-1}|=1, so ∣A−1∣=1/∣A∣|A^{-1}|=1/|A|.

Theorem 1.5 (left cancellation). If AA is non-singular and AB=ACAB=AC, then B=CB=C (pre-multiply both sides by A−1A^{-1}).

Theorem 1.6 (right cancellation). If AA is non-singular and BA=CABA=CA, then B=CB=C (post-multiply both sides by A−1A^{-1}).

Watch out

Both cancellation laws need AA non-singular. If AA is singular, AB=ACAB=AC (or BA=CABA=CA) does not force B=CB=C -- e.g. with A=(1122)A=\begin{pmatrix}1&1\\2&2\end{pmatrix} (singular, ∣A∣=0|A|=0), one can find B≠CB\ne C with AB=ACAB=AC.

Theorem 1.7 (reversal law). If A,BA,B are non-singular of the same order, ABAB is also non-singular and

(AB)−1=B−1A−1(AB)^{-1}=B^{-1}A^{-1}

(the order flips -- exactly parallel to the transpose law (AB)T=BTAT(AB)^T=B^TA^T). Proof idea: check directly that (B−1A−1)(AB)=B−1(A−1A)B=B−1IB=B−1B=I(B^{-1}A^{-1})(AB)=B^{-1}(A^{-1}A)B=B^{-1}IB=B^{-1}B=I, and similarly the other way.

Theorem 1.8 (double inverse). If AA is non-singular, so is A−1A^{-1}, and (A−1)−1=A(A^{-1})^{-1}=A.

Theorem 1.9 (adjoint identities). For non-singular AA of order nn: (i) adj⁡(A−1)=(adj⁡A)−1=A∣A∣\operatorname{adj}(A^{-1})=(\operatorname{adj}A)^{-1}=\dfrac{A}{|A|}; (ii) ∣adj⁡A∣=∣A∣n−1|\operatorname{adj}A|=|A|^{n-1}; (iii) adj⁡(adj⁡A)=∣A∣n−2A\operatorname{adj}(\operatorname{adj}A)=|A|^{n-2}A; (iv) adj⁡(λA)=λn−1adj⁡A\operatorname{adj}(\lambda A)=\lambda^{n-1}\operatorname{adj}A; (v) ∣adj⁡(adj⁡A)∣=∣A∣(n−1)2|\operatorname{adj}(\operatorname{adj}A)|=|A|^{(n-1)^2}; (vi) (adj⁡A)T=adj⁡(AT)(\operatorname{adj}A)^T=\operatorname{adj}(A^T).

Note

For a non-singular matrix of order 3, (ii) gives ∣adj⁡A∣=∣A∣2>0|\operatorname{adj}A|=|A|^2>0, so adj⁡A\operatorname{adj}A's determinant is always positive; combined with (iii), A=±1adj⁡Aadj⁡(adj⁡A)A=\pm\dfrac1{\operatorname{adj}A}\operatorname{adj}(\operatorname{adj}A) -- a way to recover AA from adj⁡A\operatorname{adj}A alone (up to sign, fixed by checking either product with the given adj⁡A\operatorname{adj}A).

Theorem 1.10. For non-singular A,BA,B of the same order, adj⁡(AB)=(adj⁡B)(adj⁡A)\operatorname{adj}(AB)=(\operatorname{adj}B)(\operatorname{adj}A) -- order reverses, just like the inverse and the transpose.

Application to geometry. Rotating the coordinate axes through angle θ\theta transforms (x,y)(x,y) to (X,Y)(X,Y) via (xy)=W(XY)\begin{pmatrix}x\\y\end{pmatrix}=W\begin{pmatrix}X\\Y\end{pmatrix} with W=(cos⁡θ−sin⁡θsin⁡θcos⁡θ)W=\begin{pmatrix}\cos\theta & -\sin\theta\\ \sin\theta & \cos\theta\end{pmatrix}. Since WTW=WWT=I2W^TW=WW^T=I_2 (using cos⁡2θ+sin⁡2θ=1\cos^2\theta+\sin^2\theta=1), WW satisfies W−1=WTW^{-1}=W^T -- a Definition 1.3: orthogonal matrix is exactly a square matrix AA with AAT=ATA=IAA^T=A^TA=I, equivalently (AA non-singular and) A−1=ATA^{-1}=A^T. …