1/27
A collection of vocabulary terms, definitions, and key results from Linear Algebra including matrix properties, eigenvalues, and orthogonality.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
Reduced Echelon Form
A matrix configuration where it is in echelon form, the pivot of each nonzero row is 1, and each leading 1 is the only nonzero entry in its column.
Linear Combination
Given vectors v1,v2,...,vp in Rn and given scalars c1,c2,...,cp, the vector y defined by y=c1v1+...+cpvp with weights c1,...,cp.
Span
The set of all linear combinations of a set of vectors {v1,v2,...,vp} denoted by Span{v1,v2,...,vp}. An element x belongs to the span if it can be written as x=c1v1+c2v2+...+cpvp.
Linear Independence
A set of vectors {v1,v2,...,vp} in Rn where the homogeneous equation x1v1+x2v2+...+xpvp=0 only has the trivial solution.
Matrix Transformation
A transformation T:Rn→Rm defined by the operation T(x)=Ax.
Jacobian
A matrix for a transformation T that transforms (u,v) to (x,y) with x=x(u,v) and y=y(u,v), where the 'destination' coordinate system is in the numerator.
Eigenvalue
A scalar \text{\lambda} such that there exists a nonzero vector x \text{\in} \text{R}^n for which the equation Ax = \text{\lambda}x holds for an n×n matrix A.
Eigenvector
A nonzero vector x as specified in the definition of an eigenvalue, such that Ax = \text{\lambda}x for some scalar \text{\lambda}.
Eigenspace (Eλ)
The set of all solutions of the equation Ax = \text{\lambda}x, which consists of the zero vector and all the eigenvectors corresponding to the eigenvalue \text{\lambda}.
Characteristic Equation
The equation defined by \text{det}(A - \text{\lambda}I) = 0 for a matrix A.
Characteristic Polynomial
The polynomial defined by the expression \text{det}(A - \text{\lambda}I).
Rank
A property of a matrix A, denoted by rank(A), defined as the dimension of the column space of A.
Orthogonality (Vector to Subspace)
A vector x is orthogonal to a subspace W of Rn if x \text{\cdot} w = 0 for each w in W, denoted as x \text{\perp} W.
Orthogonal Complement (W⊥)
The set of all vectors in Rn that are orthogonal to all vectors in a given subspace W.
Orthogonal Set
A set of vectors {u1,...,up} in Rn where u_i \text{\cdot} u_j = 0 for each pair with i=j.
Orthonormal Set
A set of vectors where the dot product u_i \text{\cdot} u_j = 0 if i=j and u_i \text{\cdot} u_i = 1 if i=j.
Orthogonal Basis
A basis for a subspace W of Rn that is also an orthogonal set.
Orthonormal Basis
A basis for a subspace W that is also an orthonormal set.
Gram-Schmidt Process
An algorithm to construct an orthogonal basis {v1,...,vp} for a subspace W starting from any basis {b1,...,bp}.
Similarity
Two n×n matrices A and B are similar if there exists an invertible n×n matrix P such that A=PBP−1.
Diagonalizable Matrix
A square matrix A that is similar to a diagonal matrix D, meaning A=PDP−1 for some invertible matrix P.
Standard Matrix of T
The unique m×n matrix A such that T(x)=Ax, where the columns are the images under T of the standard unit vectors: A=[T(e1)...T(en)].
(i,j)-cofactor
The value given by Cij=(−1)i+jdetAij, where Aij is the matrix obtained from A by deleting the i-th row and j-th column.
Coordinate Vector ([x]B)
The vector of unique weights c1,...,cp such that x=c1b1+...+cpbp for a given basis B={b1,...,bp}.
Rank Theorem
The theorem stating that if a matrix A has n columns, then rank(A)+dim(Nul(A))=n.
Orthogonal Matrix
A square matrix U for which the statements UTU=I, UUT=I, and U−1=UT are equivalent, implying its columns and rows are orthonormal.
Algebraic Multiplicity (a.m.(λ0))
The number of factors (\text{\lambda} - \text{\lambda}_0) in the characteristic polynomial of a matrix.
Geometric Multiplicity (g.m.(λ))
The dimension of the eigenspace corresponding to \text{\lambda}, equal to dim(Eλ).