Formula sheet
Every formula from every topic. Type to filter.
🧮 Matrices & Special Types
Transpose of a product
(AB)ᵀ = BᵀAᵀ
Inverse of a product
(AB)⁻¹ = B⁻¹A⁻¹
Trace identity
tr(AB) = tr(BA); tr(A + B) = tr A + tr B
Adjoint
A · adj(A) = det(A) · I; A⁻¹ = adj(A) / det(A)
Determinant of the adjoint
|adj A| = |A|^(n−1)
Orthogonal matrix
AAᵀ = I, A⁻¹ = Aᵀ, det A = ±1
Symmetric + skew split
A = ½(A + Aᵀ) + ½(A − Aᵀ)
Invertible ⇔
det ≠ 0 ⇔ rank = n ⇔ columns independent ⇔ Ax = 0 only for x = 0
🔢 Determinants
2×2 determinant
|a b; c d| = ad − bc
Cofactor expansion
det A = Σⱼ aᵢⱼ · (−1)^(i+j) · Mᵢⱼ
Scalar multiple
det(kA) = kⁿ det(A) (n×n)
Product
det(AB) = det(A) det(B); det(Aᵏ) = det(A)ᵏ
Inverse and transpose
det(A⁻¹) = 1/det A; det(Aᵀ) = det A
Row swap
swapping two rows multiplies det by −1
Vandermonde
det[1 xᵢ xᵢ² …] = Π_{i<j} (xⱼ − xᵢ)
Triangular matrix
det = product of diagonal entries
📐 Rank, Elimination & LU
Rank bound
rank(A) ≤ min(m, n); rank A = rank Aᵀ
Product
rank(AB) ≤ min(rank A, rank B)
Sum
rank(A + B) ≤ rank A + rank B
Rank–nullity
rank(A) + nullity(A) = n (number of columns)
Outer product
rank(uvᵀ) = 1 (u, v ≠ 0)
LU solve
Ax = b → Ly = b, then Ux = y
LU determinant
det A = Π uᵢᵢ (L has 1s on its diagonal)
Gaussian elimination cost
≈ n³/3 multiplications
🔗 Systems of Linear Equations
Rouché–Capelli
consistent ⇔ rank A = rank [A | b]
Unique solution
rank A = rank [A | b] = n
Infinitely many
rank A = rank [A | b] < n (n − rank free variables)
No solution
rank A < rank [A | b]
Homogeneous non-trivial solution
exists ⇔ rank A < n (⇔ det A = 0 for square A)
Cramer's rule
xᵢ = det(Aᵢ) / det(A)
General solution
x = x_p + x_h, where A x_h = 0
More unknowns than equations
m < n ⇒ Ax = 0 has a non-trivial solution
🎯 Eigenvalues & Eigenvectors
Definition
Av = λv, v ≠ 0
Characteristic equation
det(A − λI) = 0
Sum and product
Σλᵢ = trace(A); Πλᵢ = det(A)
2×2 shortcut
λ² − (trace)λ + (det) = 0
Function of a matrix
eigenvalues of Aᵏ: λᵏ; A⁻¹: 1/λ; A + cI: λ + c
Rank 1 matrix
uvᵀ has non-zero eigenvalue vᵀu
Cayley–Hamilton (2×2)
A² − (tr A)A + (det A)I = 0
Diagonalisation
A = PDP⁻¹; Aᵏ = PDᵏP⁻¹
Multiplicities
1 ≤ geometric ≤ algebraic; diagonalisable ⇔ equal for all λ
🧭 Vector Spaces
Subspace test
0 ∈ U; u, v ∈ U ⇒ u + v ∈ U; u ∈ U, c ∈ R ⇒ cu ∈ U
Independence test
columns independent ⇔ rank = number of columns
Dimension of Rⁿ
n (any n independent vectors form a basis)
Sum of subspaces
dim(U + W) = dim U + dim W − dim(U ∩ W)
Column space / row space
both have dimension rank(A)
Null space
dimension = n − rank(A)
Left null space
dimension = m − rank(A)
Orthogonality
row space ⊥ null space; column space ⊥ left null space