Revision notes

Chapter 1 Applications of Matrices and Determinants: Foundation

The key points, rules to remember, tables and diagrams from all 5 lessons, on one page for quick revision. To keep a copy, use your browser's Print and choose "Save as PDF".

Lesson 1

Adjoint of a square matrix and the inverse of a non-singular matrix

Finding adj A for a 3 × 3 matrix

  1. Write the sign pattern [+ − +; − + −; + − +] tells you the sign (−1)ⁱ⁺ʲ.
  2. Find all nine minors Delete the row and column of each element and evaluate the 2 × 2 determinant.
  3. Attach the signs Each minor times its sign is the cofactor Aᵢⱼ.
  4. Transpose Rows of the cofactor matrix become columns of adj A.
  5. Check A(adj A) should be |A| times the identity matrix.

If |A| ≠ 0, then A⁻¹ = (1/|A|) adj A. For A = [a b; c d] with ad − bc ≠ 0, A⁻¹ = (1/(ad − bc)) [d −b; −c a].

— Formula for the inverse
When does A⁻¹ exist?
SituationWhat it meansInverse
|A| ≠ 0A is non-singularA⁻¹ = (1/|A|) adj A, unique
|A| = 0A is singularDoes not exist
A not squareAB = BA = I cannot both holdNot defined

Key takeaways: the cofactor is the minor with the sign (−1)ⁱ⁺ʲ; adj A is the transpose of the cofactor matrix; A(adj A) = (adj A)A = |A|I always; a square matrix has an inverse exactly when |A| ≠ 0, the inverse is unique and equals (1/|A|) adj A. Always check by multiplying back.

Read the full lesson

Lesson 2

Properties of inverses and adjoints, orthogonal matrices and cryptography

Results on adj A (A non-singular of order n)
ResultReason in one line
(adj A)⁻¹ = adj(A⁻¹) = (1/|A|)AInvert adj A = |A|A⁻¹; or replace A by A⁻¹ in adj A = |A|A⁻¹
|adj A| = |A|ⁿ⁻¹Take determinants in A(adj A) = |A|Iₙ: |A||adj A| = |A|ⁿ
adj(adj A) = |A|ⁿ⁻²AApply A(adj A) = |A|I to the matrix adj A, then pre-multiply by A
|adj(adj A)| = |A|^((n−1)²)Take determinants of the previous line
adj(λA) = λⁿ⁻¹ adj Aadj(λA) = |λA|(λA)⁻¹ = λⁿ|A|(1/λ)A⁻¹
(adj A)ᵀ = adj(Aᵀ)Transpose adj A = |A|A⁻¹ and use |Aᵀ| = |A|
adj(AB) = (adj B)(adj A)|AB|(AB)⁻¹ = |B|B⁻¹·|A|A⁻¹

A square matrix A is orthogonal if AAᵀ = AᵀA = I. Equivalently, A is non-singular and A⁻¹ = Aᵀ.

— Orthogonal matrix

Sending a message with a matrix key

  1. Convert letters to numbers A = 1, B = 2, ..., Z = 26 and a blank space = 0.
  2. Cut into row matrices Blocks of the key's order; pad the last block with zeros.
  3. Encode Post-multiply each block by the encoding matrix A and send.
  4. Decode The receiver post-multiplies each block by A⁻¹.
  5. Read the message Turn the numbers back into letters.

Key takeaways: inverse and transpose both reverse the order of a product; cancellation is allowed only by a non-singular matrix; |adj A| = |A|ⁿ⁻¹ and adj(adj A) = |A|ⁿ⁻²A; an orthogonal matrix has A⁻¹ = Aᵀ, like the rotation matrix; and a non-singular matrix with its inverse works as a key for coding messages.

Read the full lesson

Lesson 3

Elementary transformations, row-echelon form and the rank of a matrix

Reducing a matrix to row-echelon form

  1. Pivot Bring a row with a non-zero entry in the first possible column to the top (interchange if needed). That entry is the pivot.
  2. Clear below Use Rᵢ → Rᵢ + λR₁ to make every entry under the pivot zero.
  3. Move down Ignore the first row and repeat on the rows below.
  4. Stop When every remaining row is a zero row or no rows are left.
A row-echelon form is not unique, but its number of non-zero rows is.

Write [A | Iₙ]. Use row operations to turn the left half into Iₙ. The right half is then A⁻¹: [A | Iₙ] ~ [Iₙ | A⁻¹].

— Gauss-Jordan method

Key takeaways: the three row operations never change the rank; the rank is the order of the largest non-zero minor, and for an echelon form it is the number of non-zero rows; ρ(A) ≤ min{m, n}; and reducing [A | I] to [I | A⁻¹] gives the inverse without any cofactors.

Read the full lesson

Lesson 4

Solving systems of linear equations: matrix inversion, Cramer's rule and Gaussian elimination

Two equations in two unknowns

  • Unique solution
    • x + y = 4 and x − y = 2
    • Lines cross at one point (3, 1)
    • Consistent
  • Infinitely many
    • x + 2y = 3 and 2x + 4y = 6
    • Second equation is twice the first
    • Same line: consistent
  • No solution
    • x + 2y = 3 and 2x + 4y = 7
    • Parallel, distinct lines
    • Inconsistent

x = Δ₁/Δ, y = Δ₂/Δ, z = Δ₃/Δ, where Δ₁, Δ₂, Δ₃ replace the x-, y- and z-columns of Δ by the constants. Valid only when Δ ≠ 0.

— Cramer's rule
Choosing a method
MethodNeedsBest for
Matrix inversionA square, |A| ≠ 0Several systems with the same A
Cramer's ruleA square, Δ ≠ 0Small systems; one unknown alone
Gaussian eliminationNothing extraAny system, including singular or non-square A

Key takeaways: write the system as AX = B and check |A| first; X = A⁻¹B and Cramer's xᵢ = Δᵢ/Δ need |A| ≠ 0; Gaussian elimination with back substitution always works; and always substitute the answer back into an equation you did not use last.

Read the full lesson

Lesson 5

Consistency of linear systems by the rank method, and homogeneous systems

A system AX = B is consistent if and only if ρ(A) = ρ([A | B]).

— Rouché-Capelli theorem (stated without proof in the textbook)

Deciding the type of solution (n unknowns)

  • ρ(A) = ρ([A | B]) = n Consistent
    • Unique solution
  • ρ(A) = ρ([A | B]) = n − k, k ≠ 0 Consistent
    • Infinitely many solutions
    • They form a k-parameter family
  • ρ(A) ≠ ρ([A | B]) Inconsistent
    • No solution
    • The echelon form has a row 0 = non-zero

A homogeneous system of n equations in n unknowns has a non-trivial solution if and only if |A| = 0.

— Homogeneous systems

Key takeaways: compare ρ(A) with ρ([A | B]); equal ranks mean consistent, and the solution is unique when the rank equals the number of unknowns, otherwise a family with (n − rank) parameters; unequal ranks mean no solution. A homogeneous square system has non-trivial solutions exactly when |A| = 0.

Read the full lesson

Privacy · Terms · Refunds · Delivery