Skip to content
Linear Algebra, Optimisation and Numerical Methods / Linear Transformations, Matrix Representation, and Rank-Nullity

Overview

Every matrix studied so far has been a fixed grid of numbers acting on column vectors. This topic makes the leap to the object the unit has been building toward: the linear transformation — a structure-preserving map between vector spaces, of which "AA acting on x\mathbf{x}" is only the coordinate-dependent shadow. Once transformations are abstract, two things become possible that couldn't be asked of a bare matrix: the same map can be represented by different matrices depending on which basis is chosen (opening the door to similarity and, eventually, diagonalisation), and the four fundamental subspaces of Topic 3 get renamed kernel and image, with a single theorem — rank-nullity — proved in full generality rather than merely observed as a dimension-counting pattern.

By the end of this topic you should be able to:

  • verify whether a map is linear and construct its standard matrix;
  • change the matrix representing a linear map under a change of basis, and define similarity;
  • state and prove the rank-nullity theorem for a general linear map;
  • state the equivalent conditions for invertibility and compute A−1A^{-1} in this more general frame.

In this lesson

  1. Contents
  2. The big picture

The full lesson is for members.

Read the full lesson

New to SelfMadeQuant.com? See membership options or browse the Linear Algebra, Optimisation and Numerical Methods syllabus.