This cheat sheet covers the essential matrix tools used in college linear algebra, including matrix arithmetic, inverses, determinants, rank, nullity, and common factorizations. Students need these ideas to solve systems of linear equations, analyze linear transformations, and work with data, geometry, and differential equations. A formula-forward reference helps connect computational procedures with the structure behind them.
Key Facts
- Matrix addition and scalar multiplication are entrywise: if and , then and .
- Matrix multiplication is defined by when is and is .
- The inverse of a nonsingular square matrix satisfies , and for matrices, when .
- For a matrix, .
- A square matrix is invertible exactly when , , and the equation has only the trivial solution.
- The rank-nullity theorem states that for an matrix , .
- Eigenvalues satisfy the characteristic equation , and eigenvectors satisfy with .
- Common factorizations include for elimination, for orthogonal decomposition, and for singular value decomposition.
Vocabulary
- Matrix
- A rectangular array of numbers or symbols arranged in rows and columns, often used to represent a linear transformation or system of equations.
- Determinant
- A scalar value assigned to a square matrix that measures signed volume scaling and indicates whether the matrix is invertible.
- Rank
- The rank of a matrix is the dimension of its column space, equal to the number of pivot columns in its row echelon form.
- Nullity
- The nullity of a matrix is the dimension of the solution space of , equal to the number of free variables.
- Eigenvalue
- An eigenvalue is a scalar for which there exists a nonzero vector satisfying .
- Factorization
- A matrix factorization rewrites a matrix as a product of simpler matrices, such as , , or .
Common Mistakes to Avoid
- Multiplying matrices entry by entry, which is wrong because matrix multiplication uses row-column dot products: .
- Assuming , which is wrong because matrix multiplication is generally not commutative and the products may differ or one product may be undefined.
- Using the inverse formula when , which is wrong because a square matrix is invertible only if .
- Confusing rank with the number of rows, which is wrong because rank counts independent columns or pivots and can be less than both the row count and column count.
- Treating every matrix as diagonalizable, which is wrong because diagonalization requires enough linearly independent eigenvectors to form a basis.
Practice Questions
- 1 Compute for and .
- 2 Find and decide whether is invertible for .
- 3 If an matrix has , find using .
- 4 Explain why a matrix with two identical rows must have determinant and cannot be invertible.
Understanding Linear Algebra Matrices and Determinants
A useful way to understand a matrix is as a machine that changes vectors. A vector can represent a position, a velocity, a list of prices, or measurements from an experiment. The matrix tells each output component how to combine input components.
In geometry, a matrix may stretch a shape, rotate it, reflect it, or shear it into a slanted form. The columns show where the basic direction vectors end up. This column view makes multiplication less mysterious.
When one matrix follows another, the rightmost transformation happens first. For that reason, changing the order usually changes the result. This matters when a graphics program rotates an object before moving it, rather than moving it before rotation.
A determinant gives geometric information about a square transformation. Its absolute value tells how much area in two dimensions, or volume in three dimensions, is scaled. A determinant with absolute value two doubles area.
A determinant of zero means that some dimension has been flattened. For example, a two dimensional region might be sent onto a line. Once this happens, different input vectors can produce the same output.
The original input cannot be recovered uniquely. The sign of a determinant records orientation. A negative value means the transformation has flipped the shape, much like a reflection in a mirror.
Rank measures how many independent directions remain after a matrix acts. It is not simply the number of nonzero rows or columns before calculation. Row reduction reveals the number of pivot positions, which gives the rank.
Nullity describes how many independent input directions are sent to the zero vector. These ideas explain whether a system has one solution, no solution, or many solutions. They are important in data analysis because real data often contain repeated or dependent information.
A table may have many columns, yet only a few may contribute genuinely new information. Students should watch for rounding errors here. A calculator may display a very small number instead of zero, which can make rank decisions less clear.
Eigenvectors are special directions that do not turn away from their original line under a transformation. They may grow, shrink, or reverse direction. The matching eigenvalue gives that scale factor.
This is useful for studying repeated changes, such as population models, vibration patterns, web page ranking, and systems that change over time. Factorizations provide practical ways to organize difficult calculations. Lower upper factorization records the row elimination process and makes repeated system solving faster.
Orthogonal factorization uses perpendicular directions, which are stable in numerical work. Singular value decomposition identifies the strongest directions in any data table, even when the table is not square.
When learning these methods, focus on what each factor does. Memorizing a procedure without tracking dimensions, pivot choices, or geometric meaning leads to common mistakes.