Collecting the working laws obeyed by inverses (for non-singular square matrices A,B of the same order, and λ=0 a scalar):
Theorem 1.4. (i) ∣A−1∣=∣A∣1. (ii) (AT)−1=(A−1)T. (iii) (λA)−1=λ1A−1.
Proof sketch of (i). From AA−1=In, the product rule gives ∣A∣∣A−1∣=1, so ∣A−1∣=1/∣A∣.
Theorem 1.5 (left cancellation). If A is non-singular and AB=AC, then B=C (pre-multiply both sides by A−1).
Theorem 1.6 (right cancellation). If A is non-singular and BA=CA, then B=C (post-multiply both sides by A−1).
Both cancellation laws need A non-singular. If A is singular, AB=AC (or BA=CA) does not force B=C -- e.g. with A=(1212) (singular, ∣A∣=0), one can find B=C with AB=AC.
Theorem 1.7 (reversal law). If A,B are non-singular of the same order, AB is also non-singular and
(AB)−1=B−1A−1
(the order flips -- exactly parallel to the transpose law (AB)T=BTAT). Proof idea: check directly that (B−1A−1)(AB)=B−1(A−1A)B=B−1IB=B−1B=I, and similarly the other way.
Theorem 1.8 (double inverse). If A is non-singular, so is A−1, and (A−1)−1=A.
Theorem 1.9 (adjoint identities). For non-singular A of order n: (i) adj(A−1)=(adjA)−1=∣A∣A; (ii) ∣adjA∣=∣A∣n−1; (iii) adj(adjA)=∣A∣n−2A; (iv) adj(λA)=λn−1adjA; (v) ∣adj(adjA)∣=∣A∣(n−1)2; (vi) (adjA)T=adj(AT).
For a non-singular matrix of order 3, (ii) gives ∣adjA∣=∣A∣2>0, so adjA's determinant is always positive; combined with (iii), A=±adjA1adj(adjA) -- a way to recover A from adjA alone (up to sign, fixed by checking either product with the given adjA).
Theorem 1.10. For non-singular A,B of the same order, adj(AB)=(adjB)(adjA) -- order reverses, just like the inverse and the transpose.
Application to geometry. Rotating the coordinate axes through angle θ transforms (x,y) to (X,Y) via (xy)=W(XY) with W=(cosθsinθ−sinθcosθ). Since WTW=WWT=I2 (using cos2θ+sin2θ=1), W satisfies W−1=WT -- a Definition 1.3: orthogonal matrix is exactly a square matrix A with AAT=ATA=I, equivalently (A non-singular and) A−1=AT. …