Mastering linear algebra requires connecting algebraic procedures with geometric intuition. Here is a structured approach.
Step-by-step strategy
- Identify the objects: vectors, matrices, transformations, or subspaces.
- Translate the problem into a matrix equation .
- Reduce using Gaussian elimination or compute eigenvalues as needed.
- Interpret the result geometrically.
Common problem types
| Problem | Tool |
|---|---|
| Solve | Row reduction |
| Is invertible? | or rank |
| Find eigenvalues | Characteristic polynomial |
| Diagonalise | |
| Change of basis |
import numpy as np
A = np.array([[2, 1], [1, 3]])
eigenvalues, eigenvectors = np.linalg.eig(A)
print("Eigenvalues:", eigenvalues)
print("Eigenvectors:\n", eigenvectors)
print("Determinant:", np.linalg.det(A))
Checklist before submitting
- Verify dimensions match in every multiplication.
- Check: does ? If so, expect infinite or no solutions.
- Substitute your answer back into the original equation.
Key insight: Linear algebra problems almost always reduce to one question: what does the matrix do to vectors? Eigenvalues and rank answer that question completely.
Common pitfall: Invertibility is all-or-nothing: one collapsed direction (one zero eigenvalue, , dependent columns) breaks every equivalent property at once. Check the cheapest condition and conclude the rest.