Some summary of Basic Linear Algebra

Let A ∈ M (m, n) be an m × n matrix, and let T : Rn → Rm be the linear operator given

by T (x) = Ax. (i.e., A is the representation matrix of T .) In the following table:

• All the statements in each column are equivalent.

• In the same row, each statement in column (C) is equivalent to the statement in column
(A) and that in column (B) combined.

(A) (B) (C)

1. Linear equations: Ax = b has at most one Ax = b has at least one Ax = b has exactly one
solution for every b ∈ Rm solution for every b ∈ Rm solution for every b ∈ Rm
2. Linear operators: T is injective T is surjective T is bijective
3. Vector sub- KerT = {0} ImT = Rm KerT = {0} and ImT =
spaces: Rm
4. Columns of A: The columns of A are lin- The columns of A spans The columns of A are a
early independent Rm basis of Rm
5. Rows of A: The rows of A spans Rn The rows of A are lin- The rows of A are a basis
early independent of Rn
6. Dimensions: Nullity of T =0 Rank of T =m m=n
7. Inverses: A is invertible (i.e. A is
not singular)
8. Determinant: The determinant of A is
not 0

1
The table is to help you link what we learn about matrices, linear operators, and linear
systems. Please do not memorize the table. Try to understand each equivalence (intuitively,
geometrically, and/or using simple proofs). Rows 7 and 8 of columns (A) and (B) are blank
because inverses and determinants are defined only for square matrices.

Theorem 1.

If (C) is true, then A is a square matrix, that is, m = n.

If A is a square matrix, then all the statements in columns (A), (B), and (C) are equivalent.