Precalculus / Chapter 12
Matrices
Cheat sheet
Matrix Operations
- Matrix dimensions are rows × columns. Addition requires matching dimensions and acts entrywise; scalar multiplication multiplies every entry. Matrix multiplication is different: each output entry is a row-column dot product.
- If A is and B is , then AB is . Reversing order may change the result or make multiplication undefined.
- For , . Do not treat a matrix product as entrywise multiplication.
The Inverse and Determinant of a Matrix
- For , . If this is nonzero, and .
- For , . The inverse is not the entrywise reciprocal. Verify by multiplication.
- A determinant of zero means singular: the map loses information and has no inverse on the whole plane. Area scales by ; a negative determinant reverses orientation. Area itself is never negative.
Linear Transformations and Matrices
- A linear map preserves addition and scalar multiplication: and . It sends zero to zero, but that test alone is insufficient; passes the zero test and is not linear.
- For column vectors, an matrix maps to . Its columns are the images of the input basis vectors. If and , then .
- A nonzero translation is affine, not linear. In a matrix map, each output is a sum of constant multiples of the input coordinates, without an added nonzero constant.
Matrices as Functions
- Counterclockwise rotation by θ uses . A quarter-turn sends to and preserves lengths and area.
- With column vectors, A followed by B is BA: the rightmost matrix acts first. Stretching x by 2 and then rotating a quarter-turn sends to ; reversing the order gives .
- If both maps are invertible, . A projection cannot be uniquely undone because many inputs share one output.
Matrices Modeling Contexts
- Using column states, : column j describes destinations from current state j. In a closed transition model, entries are nonnegative and every column sums to 1. Counts keep their total; normalized probability states keep total 1.
- For , starting from gives , then . The entry 0.3 is the fraction moving from B to A. Fractional counts are expectations, not fractions of individual objects.
- A steady state satisfies . With total 100, this P has steady state because . Its repeated updates converge to that balance; not every transition matrix converges. Fixed transfer rates and a closed total are model assumptions.
- If P is invertible, . Here . Current recovers , but current recovers and has no nonnegative previous state under the model.