Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools

Linear Algebra Terms and Definitions

Determinants(4)
Eigen(7)
Linear Systems(6)
Matrices(10)
Orthogonality(6)
Transformations(5)
Vector Spaces(10)
Vectors(7)
55 of 55 terms

55 terms

Vectors

(7 items)

Vector

An ordered list of nn real numbers: v=(v1,v2,,vn)Rn\mathbf{v} = (v_1, v_2, \ldots, v_n) \in \mathbb{R}^n
↑ Back to top

Scalar

An element of the underlying field — in standard linear algebra, a real number cRc \in \mathbb{R}
↑ Back to top

Magnitude (Norm)

v=v12+v22++vn2\|\mathbf{v}\| = \sqrt{v_1^2 + v_2^2 + \cdots + v_n^2}
↑ Back to top

Unit Vector

A vector u^\hat{\mathbf{u}} with u^=1\|\hat{\mathbf{u}}\| = 1
↑ Back to top

Dot Product

uv=u1v1+u2v2++unvn=uvcosθ\mathbf{u} \cdot \mathbf{v} = u_1 v_1 + u_2 v_2 + \cdots + u_n v_n = \|\mathbf{u}\|\,\|\mathbf{v}\|\cos\theta
↑ Back to top

Cross Product

u×v=(u2v3u3v2u3v1u1v3u1v2u2v1)\mathbf{u} \times \mathbf{v} = \begin{pmatrix} u_2 v_3 - u_3 v_2 \\ u_3 v_1 - u_1 v_3 \\ u_1 v_2 - u_2 v_1 \end{pmatrix}
↑ Back to top

Linear Combination

c1v1+c2v2++ckvkc_1\mathbf{v}_1 + c_2\mathbf{v}_2 + \cdots + c_k\mathbf{v}_k

where c1,c2,,ckc_1, c_2, \ldots, c_k are scalars
↑ Back to top

Vector Spaces

(10 items)

Vector Space

A set VV equipped with vector addition and scalar multiplication satisfying the vector space axioms
↑ Back to top

Subspace

A nonempty subset WVW \subseteq V that is itself a vector space under the same operations
↑ Back to top

Span

Span{v1,,vk}={c1v1++ckvkciR}\text{Span}\{\mathbf{v}_1, \ldots, \mathbf{v}_k\} = \{c_1\mathbf{v}_1 + \cdots + c_k\mathbf{v}_k \mid c_i \in \mathbb{R}\}
↑ Back to top

Linear Independence

Vectors v1,,vk\mathbf{v}_1, \ldots, \mathbf{v}_k are linearly independent if
c1v1++ckvk=0    c1=c2==ck=0c_1\mathbf{v}_1 + \cdots + c_k\mathbf{v}_k = \mathbf{0} \implies c_1 = c_2 = \cdots = c_k = 0
↑ Back to top

Basis

A set {v1,,vn}\{\mathbf{v}_1, \ldots, \mathbf{v}_n\} that is linearly independent and spans the entire vector space
↑ Back to top

Dimension

dim(V)=nwhere n is the number of vectors in any basis of V\dim(V) = n \quad \text{where } n \text{ is the number of vectors in any basis of } V
↑ Back to top

Column Space

Col(A)={AxxRn}\text{Col}(A) = \{A\mathbf{x} \mid \mathbf{x} \in \mathbb{R}^n\}

The span of the columns of AA
↑ Back to top

Null Space (Kernel)

Nul(A)={xRnAx=0}\text{Nul}(A) = \{\mathbf{x} \in \mathbb{R}^n \mid A\mathbf{x} = \mathbf{0}\}
↑ Back to top

Row Space

Row(A)=Col(AT)\text{Row}(A) = \text{Col}(A^T)

The span of the rows of AA
↑ Back to top

Left Null Space

Nul(AT)={yRmATy=0}\text{Nul}(A^T) = \{\mathbf{y} \in \mathbb{R}^m \mid A^T\mathbf{y} = \mathbf{0}\}
↑ Back to top

Matrices

(10 items)

Matrix

A rectangular array of numbers with mm rows and nn columns: ARm×nA \in \mathbb{R}^{m \times n}
↑ Back to top

Square Matrix

A matrix with equal numbers of rows and columns: ARn×nA \in \mathbb{R}^{n \times n}
↑ Back to top

Identity Matrix

In=(100010001)I_n = \begin{pmatrix} 1 & 0 & \cdots & 0 \\ 0 & 1 & \cdots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \cdots & 1 \end{pmatrix}
↑ Back to top

Symmetric Matrix

A square matrix satisfying A=ATA = A^T
↑ Back to top

Inverse Matrix

A square matrix A1A^{-1} such that AA1=A1A=IAA^{-1} = A^{-1}A = I
↑ Back to top

Singular Matrix

A square matrix AA with det(A)=0\det(A) = 0
↑ Back to top

Rank

rank(A)=dim(Col(A))=dim(Row(A))\text{rank}(A) = \dim(\text{Col}(A)) = \dim(\text{Row}(A))
↑ Back to top

Trace

tr(A)=a11+a22++ann=i=1naii\text{tr}(A) = a_{11} + a_{22} + \cdots + a_{nn} = \sum_{i=1}^{n} a_{ii}
↑ Back to top

Diagonal Matrix

A square matrix where aij=0a_{ij} = 0 for all iji \neq j
↑ Back to top

Positive Definite Matrix

A symmetric matrix AA satisfying xTAx>0\mathbf{x}^T A \mathbf{x} > 0 for all nonzero x\mathbf{x}
↑ Back to top

Determinants

(4 items)

Determinant

A scalar det(A)R\det(A) \in \mathbb{R} assigned to every square matrix, defined recursively via cofactor expansion
↑ Back to top

Minor

Mij=det(A^ij)M_{ij} = \det(\hat{A}_{ij})

where A^ij\hat{A}_{ij} is the matrix obtained by deleting row ii and column jj
↑ Back to top

Cofactor

Cij=(1)i+jMijC_{ij} = (-1)^{i+j} M_{ij}
↑ Back to top

Cofactor Matrix (Adjugate)

adj(A)=CT\text{adj}(A) = C^T

where CC is the matrix of cofactors
↑ Back to top

Linear Systems

(6 items)

System of Linear Equations

A collection of equations Ax=bA\mathbf{x} = \mathbf{b} where AA is an m×nm \times n matrix and bRm\mathbf{b} \in \mathbb{R}^m
↑ Back to top

Augmented Matrix

[Ab][A \mid \mathbf{b}]

The matrix AA with the vector b\mathbf{b} appended as an extra column
↑ Back to top

Row Echelon Form

A matrix where:
• all zero rows are at the bottom
• each leading entry (pivot) is to the right of the pivot in the row above
• all entries below each pivot are zero
↑ Back to top

Reduced Row Echelon Form

Row echelon form with the additional requirements:
• every pivot is 11
• each pivot is the only nonzero entry in its column
↑ Back to top

Pivot

The first nonzero entry in each row of a matrix in row echelon form
↑ Back to top

Homogeneous System

Ax=0A\mathbf{x} = \mathbf{0}
↑ Back to top

Transformations

(5 items)

Linear Transformation

A function T:VWT: V \to W satisfying:
T(u+v)=T(u)+T(v)T(\mathbf{u} + \mathbf{v}) = T(\mathbf{u}) + T(\mathbf{v})

T(cu)=cT(u)T(c\mathbf{u}) = cT(\mathbf{u})
↑ Back to top

Image (Range)

Im(T)={T(v)vV}\text{Im}(T) = \{T(\mathbf{v}) \mid \mathbf{v} \in V\}
↑ Back to top

Matrix Representation

A matrix AA such that T(v)=A[v]BT(\mathbf{v}) = A[\mathbf{v}]_{\mathcal{B}} for a chosen basis B\mathcal{B}
↑ Back to top

Change of Basis Matrix

A matrix PP that converts coordinates from one basis to another: [v]B=P1[v]B[\mathbf{v}]_{\mathcal{B}'} = P^{-1}[\mathbf{v}]_{\mathcal{B}}
↑ Back to top

Similar Matrices

Matrices AA and BB are similar if B=P1APB = P^{-1}AP for some invertible matrix PP
↑ Back to top

Eigen

(7 items)

Eigenvalue

A scalar λ\lambda such that Av=λvA\mathbf{v} = \lambda\mathbf{v} for some nonzero vector v\mathbf{v}
↑ Back to top

Eigenvector

A nonzero vector v\mathbf{v} such that Av=λvA\mathbf{v} = \lambda\mathbf{v} for some scalar λ\lambda
↑ Back to top

Eigenspace

Eλ={vRnAv=λv}=Nul(AλI)E_\lambda = \{\mathbf{v} \in \mathbb{R}^n \mid A\mathbf{v} = \lambda\mathbf{v}\} = \text{Nul}(A - \lambda I)
↑ Back to top

Characteristic Polynomial

p(λ)=det(AλI)p(\lambda) = \det(A - \lambda I)
↑ Back to top

Algebraic Multiplicity

The multiplicity of λ\lambda as a root of the characteristic polynomial
↑ Back to top

Geometric Multiplicity

geo. mult.(λ)=dim(Eλ)=dim(Nul(AλI))\text{geo. mult.}(\lambda) = \dim(E_\lambda) = \dim(\text{Nul}(A - \lambda I))
↑ Back to top

Singular Value

σi=λi(ATA)\sigma_i = \sqrt{\lambda_i(A^TA)}

where λi\lambda_i are the eigenvalues of ATAA^TA
↑ Back to top

Orthogonality

(6 items)

Inner Product

A function ,:V×VR\langle \cdot, \cdot \rangle: V \times V \to \mathbb{R} satisfying symmetry, linearity, and positive-definiteness
↑ Back to top

Orthogonal Vectors

Vectors u\mathbf{u} and v\mathbf{v} are orthogonal if u,v=0\langle \mathbf{u}, \mathbf{v} \rangle = 0
↑ Back to top

Orthogonal Set

A set of vectors {v1,,vk}\{\mathbf{v}_1, \ldots, \mathbf{v}_k\} where vi,vj=0\langle \mathbf{v}_i, \mathbf{v}_j \rangle = 0 for all iji \neq j
↑ Back to top

Orthonormal Set

An orthogonal set where every vector is a unit vector: vi,vj=δij\langle \mathbf{v}_i, \mathbf{v}_j \rangle = \delta_{ij}
↑ Back to top

Orthogonal Complement

W={vVv,w=0 for all wW}W^\perp = \{\mathbf{v} \in V \mid \langle \mathbf{v}, \mathbf{w} \rangle = 0 \text{ for all } \mathbf{w} \in W\}
↑ Back to top

Orthogonal Matrix

A square matrix QQ satisfying QTQ=QQT=IQ^TQ = QQ^T = I
↑ Back to top