1/19
Comprehensive vocabulary flashcards covering the core linear algebra concepts, theorems, matrix invertibility criteria, system consistency, and linear transformation properties from the Math 54 practice exam.
Underdetermined Homogeneous System
A homogeneous linear system Ax=0 with more variables than equations (n>m). It always contains at least one free variable and therefore always has infinitely many solutions.
Overdetermined Non-homogeneous System
A non-homogeneous linear system with more equations than variables (m>n). Such a system can be inconsistent (no solution), have a unique solution, or have infinitely many solutions.
Augmented Matrix Consistency Criterion
A linear system is consistent if and only if the rightmost column of the augmented matrix is not a pivot column. Having a pivot position in every row does not guarantee consistency, as the pivot in the bottom row could lie in the augmented column ([0…0∣bm] with bm=0).
Spanning Set Consistency Theorem
If vectors b1,…,bk span Rm and each system Ax=bj is consistent, then Ax=b is consistent for every b∈Rm.
Row Equivalence and System Consistency
If two m×n matrices A and B are row equivalent (A∼B), the systems Ax=b and Bx=b do not necessarily share the same consistency for a fixed b, unless A and B are invertible.
Pairwise Non-proportional Vectors
A set of vectors where no two are scalar multiples of each other. In R3, this property is insufficient to guarantee that three vectors are linearly independent, as all three could still lie in the same plane.
Linear Transformation Definition Check
A mapping T must satisfy both additivity (T(u+v)=T(u)+T(v)) and homogeneity (T(cu)=cT(u)) for all scalars c. Satisfying only T(0)=0 and T(2x)=2T(x) is not sufficient to guarantee that T is linear.
Left Inverse vs. Right Inverse in Dimension Mismatch
If linear transformations satisfy S:R2→R3 and T:R3→R2 with T∘S=IR2, the reverse composition S∘T cannot be the identity on R3 because the rank of S∘T is at most 2, which is strictly less than the dimension of R3.
Matrix Polynomial Invertibility
If an n×n matrix A satisfies A2−3A+2I=0, then A is invertible with explicit inverse A−1=21(3I−A), obtained from A(3I−A)=2I.
Commutativity of Matrix Inverses
If A is an invertible matrix and AB=BA, then A−1 commutes with B, satisfying A−1B=BA−1.
Odd-Dimensional Skew-Symmetric Matrix Invertibility
An n×n matrix satisfying AT=−A where n is odd (such as 3×3) satisfies det(A)=det(AT)=det(−A)=(−1)ndet(A)=−det(A), which implies det(A)=0. Hence, it is always singular and not invertible.
Subspace Criteria in Rn
A subset H⊆Rn is a subspace if and only if it contains the zero vector 0, is closed under vector addition, and is closed under scalar multiplication. Being closed under scalar multiplication alone is not sufficient.
Basic Variable
A variable in a system of linear equations that corresponds to a pivot column in the coefficient matrix or its row-reduced echelon form.
Free Variable
A variable in a system of linear equations corresponding to a column in the coefficient matrix that does not contain a pivot position, allowing it to act as an arbitrary parameter in the solution set.
Parametric Vector Form
An algebraic representation of the solution set of a linear system Ax=b written as x=p+su+tv+…, where p is a particular solution and the remaining terms form the general solution of the associated homogeneous system Ax=0.
Linear Combination
A vector w expressed in the form w=c1v1+c2v2+⋯+cpvp, where c1,…,cp are scalars and v1,…,vp are vectors in the same space.
Span Criterion for Columns
The columns of an m×n matrix A span Rm if and only if A has a pivot position in every row. If n<m, the columns can never span Rm.
Onto (Surjective) Linear Transformation
A mapping T:Rn→Rm such that for every b∈Rm, there is at least one x∈Rn satisfying T(x)=b. In terms of its standard matrix, T is onto if and only if the matrix has a pivot in every row.
One-to-One (Injective) Linear Transformation
A mapping T:Rn→Rm where T(u)=T(v) implies u=v. Equivalently, the homogeneous equation T(x)=0 has only the trivial solution x=0, which occurs if and only if the standard matrix has a pivot in every column.
Multiplicative Property of Determinants
For any two n×n matrices A and B, det(AB)=det(A)det(B). For upper or lower triangular matrices, the determinant simplifies to the product of the main diagonal entries.