Skip to content

Mathematics · Ch 1 — Applications of Matrices and Determinants

Summary

1.7

Summary

Adjoint. adj⁡A=\operatorname{adj}A= transpose of the cofactor matrix of AA.

Central identity. A(adj⁡A)=(adj⁡A)A=∣A∣ InA(\operatorname{adj}A)=(\operatorname{adj}A)A=|A|\,I_n.

Inverse formula. A−1=1∣A∣adj⁡AA^{-1}=\dfrac1{|A|}\operatorname{adj}A.

Standing laws (non-singular A,BA,B of the same order, λ≠0\lambda\ne0): (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}; (iv) (AB)−1=B−1A−1(AB)^{-1}=B^{-1}A^{-1}; (v) (A−1)−1=A(A^{-1})^{-1}=A.

Adjoint identities (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); (vii) adj⁡(AB)=(adj⁡B)(adj⁡A)\operatorname{adj}(AB)=(\operatorname{adj}B)(\operatorname{adj}A).

Orthogonal matrix. AA orthogonal   ⟺  AAT=ATA=I  ⟺  A\iff AA^T=A^TA=I\iff A non-singular and A−1=ATA^{-1}=A^T.

Methods for AX=BAX=B (AA square, non-singular unless noted).

  1. Matrix inversion: X=A−1BX=A^{-1}B.
  2. Cramer's rule: x=Δ1/Δ, y=Δ2/Δ, z=Δ3/Δx=\Delta_1/\Delta,\ y=\Delta_2/\Delta,\ z=\Delta_3/\Delta (Δ≠0\Delta\ne0).
  3. Gaussian elimination: row-reduce [A∣B][A|B] to echelon form, back-substitute (works even if AA is singular or non-square). …