Linear Algebra
Chapter 1/Matrices and Systems of Equations

1.3Matrix Arithmetic

The single most important reframing in the course: is a linear combination of the columns of . Once you see that, consistency, column space, rank, and least squares all become the same question asked in different accents.

What you must be able to do

  • — a combination of columns, weighted by the entries of .
  • is consistent iff is a linear combination of the columns of (Thm 1.3.1).
  • = (row of ) · (column of ). needs cols() = rows().
  • flips rows and columns; is symmetric if (square only).

Notation: is the entry in row , column . Column vectors are boldface lowercase, is the th column of , and (with the arrow) is the th row. An matrix is a vector in .

Two ways to see

Row picture
The th entry of is the scalar product . This is how you compute.
Column picture
. This is how you think. Solving asks: can be built from the columns?
Theorem 1.3.1 · Consistency
is consistent if and only if can be written as a linear combination of the column vectors of .

In §3.6 this gets the upgrade it deserves: consistent ⟺ lies in the column space of .

Definition · Linear combination
For vectors in and scalars , the vector is a linear combination. Everything in Chapter 3 is built from this one idea.

Matrix multiplication

Definition
If is and is , then is the matrix with entries

Equivalently, column by column: . Each column of the product is acting on the corresponding column of .

Worked example

and are not the same animal

0/3 steps
Compute both products for

Transpose

Definition · Transpose
is the matrix with : row of is column of . A square matrix is symmetric if .
Connection
Symmetry is a Chapter 5 concept in disguise. is always symmetric — that's the matrix at the heart of the normal equations in §5.3, and its symmetry is why least squares behaves so well.

Check yourself

Q1
is . The system is consistent exactly when:
T / F
If is and is , then both and are defined and both are .
T / F
If is any matrix, then is symmetric.