← 🧮 Matrices & Special Types
Subtopic 3 of 4

1.3Inverse and adjoint

The idea

A square matrix has an inverse exactly when its determinant is not zero. You can compute it with row operations or with the adjoint.

Think of it like this: The inverse is the "undo" button: A⁻¹ takes the output of A back to the input.

Why it exists

Invertibility connects to determinants, rank and eigenvalues, and shows up in many true/false statements.

How it works

  1. A⁻¹ exists ⇔ det A ≠ 0 ⇔ rank A = n.
  2. Gauss–Jordan: row reduce [A | I]; when the left half becomes I, the right half is A⁻¹.
  3. Adjoint formula: A⁻¹ = adj(A) / det(A), where adj(A) is the transpose of the cofactor matrix.
  4. |adj A| = |A|ⁿ⁻¹ and |A⁻¹| = 1/|A|.

Worked example: A = [[2, 1],[7, 4]]

det = 8 − 7 = 1, so A⁻¹ = adj(A) = [[4, −1],[−7, 2]]. The lab confirms it with both methods.

Now play with it

  • →Step through Gauss–Jordan on the 3×3 and compare with the adjoint formula.
  • →Load the singular matrix and see why the process fails.
123100
014010
560001
  • R3 ← R3 − (5)·R1
  • R1 ← R1 − (2)·R2
  • R3 ← R3 − (-4)·R2
  • R1 ← R1 − (-5)·R3
  • R2 ← R2 − (4)·R3
A⁻¹ from Gauss–Jordan
-24185
20-15-4
-541
adj(A) / det(A), with det A = 1
-24185
20-15-4
-541
✓ Both methods agree. |adj A| = 1 = |A|^2 = 1

Check yourself

A 3×3 matrix has det A = 2. What is |adj A|?

Remember: Invertible ⇔ det ≠ 0; A⁻¹ = adj A / det A; |adj A| = |A|ⁿ⁻¹.
Exam notes (the dense version)

A⁻¹ exists exactly when det A ≠ 0 (A is non-singular). Then A⁻¹ = adj(A) / det(A), where adj(A) is the transpose of the cofactor matrix. Facts: A·adj(A) = det(A)·I, |adj A| = |A|ⁿ⁻¹, adj(AB) = adj(B)·adj(A), |A⁻¹| = 1/|A|. In practice, find A⁻¹ by Gauss–Jordan: row reduce [A | I] to [I | A⁻¹].

Previous year questions: Matrices & Special Types (3)

PYQs are grouped by topic, so this is the full set for Matrices & Special Types; try the ones that match this subtopic. Open all 3 on the topic page.