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
0/3 stepsPowers of a rank-one matrix
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 .