1/16
Looks like no tags are added yet.
Subspace Criteria
A subset H of a vector space V that satisfies three properties: the zero vector of V is in H, H is closed under vector addition, and H is closed under scalar multiplication.
Rank Theorem
For any m×n matrix A, the sum of the rank and the nullity equals the number of columns: rank(A)+dim(Nul(A))=n.
Characteristic Equation
The scalar equation det(A−λI)=0, whose roots are the eigenvalues of the square matrix A.
Algebraic Multiplicity
The multiplicity of an eigenvalue λ as a root of the characteristic polynomial det(A−λI).
Geometric Multiplicity
The dimension of the eigenspace corresponding to an eigenvalue λ, given by dim(Nul(A−λI)), which is always less than or equal to its algebraic multiplicity.
Diagonalizable Matrix
An n×n matrix A that is similar to a diagonal matrix D, meaning A=PDP−1 for an invertible matrix P; this holds if and only if A has n linearly independent eigenvectors.
Similar Matrices
Two square matrices A and B related by A=PBP−1 for some invertible matrix P; similar matrices share the same characteristic polynomial, eigenvalues, and determinant.
Matrix of a Linear Transformation Relative to Bases
The matrix [T]C←B whose j-th column is the coordinate vector of the transformed j-th basis vector, [T(bj)]C, satisfying [T(x)]C=[T]C←B[x]B.
Change-of-Coordinates Matrix (PC←B)
The unique invertible matrix that converts a coordinate vector with respect to basis B into coordinates with respect to basis C, satisfying [x]C=PC←B[x]B.
Orthogonal Complement (W⊥)
The set of all vectors in Rn that are orthogonal to every vector in a subspace W.
Orthogonal Decomposition Theorem
A theorem stating that any vector y∈Rn can be written uniquely as y=y^+z, where y^=projW(y)∈W and z=y−projW(y)∈W⊥.
Least-Squares Solution
A vector x^ that minimizes the Euclidean distance ∥Ax−b∥, which satisfies the normal equations ATAx^=ATb.
Normal Equations
The system of linear equations ATAx=ATb whose solutions provide the least-squares solutions to the linear system Ax=b.
Gram-Schmidt Process
An algorithm that converts any basis {x1,x2,…,xp} for a nonzero subspace into an orthogonal basis {v1,v2,…,vp} by sequentially removing orthogonal projections.
QR Factorization
The decomposition of an m×n matrix A with linearly independent columns into A=QR, where Q has orthonormal columns and R is an n×n upper triangular invertible matrix with positive diagonal entries.
Scaled Rotation Matrix
A 2×2 matrix of the form C=(ab−ba), which scales vectors by r=a2+b2 and rotates them counterclockwise by an angle φ satisfying cos(φ)=ra and sin(φ)=rb.