Linear Algebra
Chapter 1/Matrices and Systems of Equations

1.4Matrix Algebra

Matrix algebra looks like ordinary algebra with two loud exceptions: multiplication doesn't commute, and you can't cancel. Almost every true/false trap in this chapter lives in one of those two gaps.

What you must be able to do

  • Associativity and distributivity hold; commutativity does not: in general.
  • is the multiplicative identity; its columns are the standard vectors .
  • is nonsingular/invertible if for some ; that is unique and written .
  • and — both reverse the order.
Theorem 1.4.1 · Algebraic rules
For all scalars and matrices of compatible size: ; ; ; ; ; ; plus the usual scalar rules.

Associativity is why you can write without parentheses, and it's the step that makes well defined.

!The three that fail
. does not force or . with does not force . Cancellation needs to be nonsingular, not merely nonzero.

The identity and powers

Definition · Identity matrix
with if and otherwise. Then , and — its columns are the standard basis vectors.
Worked example

Powers of a rank-one matrix

0/3 steps
Find , , and a formula for .

Inverses

Definition · Nonsingular / invertible
An matrix is nonsingular if there is a matrix with . Then is unique, denoted . If no such exists, is singular.

Uniqueness is a one-liner: if and both work, . And note that 'singular/nonsingular' applies only to square matrices — never call a matrix singular.

Theorem 1.4.2
If and are nonsingular matrices, then is nonsingular and .

By induction, . Think of putting on socks then shoes: to undo, remove shoes first.

  • — same order reversal as the inverse rule

Check yourself

Q1
If and are nonsingular matrices, then equals:
T / F
If for matrices, then or .
T / F
If and , then .