Course Summary
Linear algebra starts from vectors and linear combinations and climbs towards the structure of a vector space itself. The course first builds the geometric intuition that a matrix is a linear transformation, then works through determinants, matrix operations, the rank of a matrix, inverse matrices, the structure of solution spaces, and systems of linear equations; it then describes the skeleton of a transformation with inner products, eigenvalues and eigenvectors, and finally rises to change of basis, abstract vector spaces, and quadratic forms. Looking back over the whole course, one thread runs through every chapter: start from concrete vectors and transformations, abstract to the structure of a linear space, and let eigenvalues and quadratic forms answer what the transformation stretches and rotates the space into.
| Topic | Core content | Key methods |
|---|---|---|
| Vectors and Linear Combinations | Definition of a vector, addition and scalar multiplication, linear combinations, span, linear dependence and independence, bases and dimension | Draw the geometry to judge whether a set of vectors can span the whole space |
| Linear Transformations and Matrices | A matrix as the table of a transformation, the same transformation represented in a new basis, similar matrices | Track where the basis vectors go; convert basis to standard basis and back with , , to obtain |
| Determinants | Definition of the determinant, the six basic properties, expansion by a row or a column, the geometric meaning as a volume-scaling factor | Row operations to simplify, the expansion method, the property method |
| Matrices and Their Operations | Addition, scalar multiplication, multiplication, transpose, elementary matrices, block matrices, the rank of a matrix | Elementary row transformations to row echelon form, then read the rank off the number of nonzero rows |
| Inverse Matrices and Solution Spaces | The inverse as the reverse transformation, the adjugate matrix, the dimension of the solution space, the rank conditions for one solution, infinitely many solutions, or no solution | ; the solution space of has dimension |
| Systems of Linear Equations | Homogeneous and non-homogeneous systems, Gaussian and Gauss-Jordan elimination, the structure of the solution set, Cramer’s rule | Elementary row transformations; general solution = one particular solution + the general homogeneous solution |
| Inner Products and Orthogonalisation | The inner product, the length and angle it defines, orthogonal vectors, Gram-Schmidt orthogonalisation, orthogonal matrices | Use the inner product to test orthogonality; run Gram-Schmidt to build an orthogonal basis |
| Eigenvalues and Eigenvectors | , the characteristic equation, the trace and determinant relations, real symmetric matrices | Solve ; check the conditions for diagonalisability |
| Change of Basis and Abstract Vector Spaces | The change-of-basis matrix , coordinates relative to a basis, abstract vector spaces, the spaces of polynomials and of matrices | The columns of are the new basis vectors in standard coordinates; |
| Quadratic Forms | The matrix of a quadratic form, standard forms, congruence transformations, the law of inertia, positive definiteness | Completing the square or a congruence transformation to reach a standard form; the leading principal minors decide positive definiteness |
These three topics are where linear algebra computation and proof problems land most often, so the conditions below have to be remembered exactly:
| Topic | Core result | How to use it |
|---|---|---|
| Determinant properties | A zero row or column gives ; two proportional rows or columns give ; adding times one row or column to another leaves unchanged | is the condition for to be invertible and for |
| The rank of a matrix | is the order of the highest-order nonzero minor, and also the number of nonzero rows in row echelon form | is invertible the rows and columns of are linearly independent |
| The characteristic equation | Eigenvalues come from ; substitute each eigenvalue back into for the eigenvectors | and make a quick check |
| Similarity diagonalisation | is diagonalisable it has linearly independent eigenvectors; distinct eigenvalues guarantee diagonalisability | A real symmetric matrix is always orthogonally diagonalisable, and all of its eigenvalues are real |
| Testing positive definiteness | A quadratic form is positive definite all leading principal minors are positive, and equivalently all eigenvalues are positive | The positive index of inertia is then and the negative index is ; the law of inertia fixes these indices under congruence |
Key takeaway: whether the determinant is zero threads “invertible / full rank / a unique solution to the system” into one line; an eigenvalue is the scaling factor along a direction the transformation leaves unchanged, and similarity diagonalisation is the search for a basis in which the transformation only stretches and never rotates; the quickest test for positive definiteness is the leading principal minors, with the all-positive-eigenvalue criterion as an equivalent.
When a linear algebra problem turns up, choose the method along the following path:
- Classify the problem first: is it a determinant computation, a rank or inverse computation, a system of linear equations, an eigenvalue problem, or a quadratic form? Name the object first, then pick the tool.
- Start with row operations for determinants and rank: reduce to row echelon form with elementary row transformations, record the determinant multiplier at every step, and read the rank off the number of nonzero rows instead of expanding a high-order determinant by hand.
- Keep the structure of the solution set in mind: for a homogeneous system find a fundamental system of solutions; for a non-homogeneous system find one particular solution first and write the general solution as that particular solution plus the general homogeneous solution.
- Follow the fixed steps for eigenvalues and diagonalisation: compute the characteristic equation to get , then find the eigenvectors one by one, build and , and check ; a real symmetric matrix can always be orthogonally diagonalised.
- Write the matrix of a quadratic form before judging it: the diagonal entries of that matrix are the coefficients of the squared terms and the off-diagonal entries are half the coefficients of the mixed terms; reduce to a standard form by completing the square or by a congruence transformation, and decide positive definiteness from the leading principal minors.
- 1
Exploring Functions in Advanced Mathematics
PrerequisiteFunctions are a core idea of advanced mathematics. This course walks through foundational concepts, key properties, and classic constants so you can read, reason, and compute with confidence.
Go to course - 2
Vector Algebra and Analytic Geometry of Space
PrerequisiteMaster vector operations and the equations of points, lines, and planes in space, together with their mutual relationships.
Go to course - 3
Linear Algebra
Current courseMaster determinants, matrices, vectors, systems of linear equations, eigenvalues, and quadratic forms, and understand the abstract structure of linear spaces.
Go to course
