PROJECTENGRAM

[REV] CSMATH2 COMPREHENSIVE FINALS REVIEWER

Tags: #◇Computer Science #◇CSMATH2 #◇Linear Algebra #◇Reviewer #◇Finals


CSMATH2 Comprehensive Finals Reviewer

◇Overview

This reviewer consolidates Linear Algebra and Matrix Theory (CSMATH2). Core subjects include systems of linear equations, Gaussian elimination and Gauss-Jordan reduction to Reduced Row Echelon Form (RREF), matrix algebra and inverses, determinants, vector spaces, subspaces, linear independence, basis and dimension, linear transformations, eigenvalues, eigenvectors, and matrix diagonalization.


◇1. Master Matrix & Vector Theorem Matrix

Concept / TheoremMathematical FormulationInvertibility Criteria / Condition
System SolutionsAx=bA \mathbf{x} = \mathbf{b}Unique iff rank(A)=rank([A∣b])=n\text{rank}(A) = \text{rank}([A \mid \mathbf{b}]) = n; Infinitely many if rank <n< n; Inconsistent if rank(A)<rank([A∣b])\text{rank}(A) < \text{rank}([A \mid \mathbf{b}]).
Matrix InvertibilityAA−1=A−1A=InA A^{-1} = A^{-1} A = I_nAA invertible   ⟺  det⁡(A)≠0  ⟺  rank(A)=n  ⟺  Nullity(A)=0\iff \det(A) \ne 0 \iff \text{rank}(A) = n \iff \text{Nullity}(A) = 0.
Determinant Propertiesdet⁡(AB)=det⁡(A)det⁡(B)\det(A B) = \det(A)\det(B)det⁡(AT)=det⁡(A)\det(A^T) = \det(A), det⁡(A−1)=1det⁡(A)\det(A^{-1}) = \frac{1}{\det(A)}, det⁡(cA)=cndet⁡(A)\det(c A) = c^n \det(A).
Rank-Nullity Theoremrank(A)+nullity(A)=n\text{rank}(A) + \text{nullity}(A) = nWhere nn is the number of columns of AA.
Characteristic Equationdet⁡(A−λI)=0\det(A - \lambda I) = 0Roots λ\lambda are eigenvalues; (A−λI)v=0(A - \lambda I)\mathbf{v} = \mathbf{0} yields eigenvectors v≠0\mathbf{v} \ne \mathbf{0}.
DiagonalizationP−1AP=DP^{-1} A P = DAA is diagonalizable   ⟺  A\iff A has nn linearly independent eigenvectors.

◇2. Row Operations & Determinant Effects


◇3. High-Yield Exam Checklist

  • Does det⁡(A+B)=det⁡(A)+det⁡(B)\det(A + B) = \det(A) + \det(B)? NO! (Determinant does not distribute over addition).
  • For a scalar cc and n×nn \times n matrix AA, what is det⁡(cA)\det(cA)? cndet⁡(A)c^n \det(A).
  • Is an eigenvector ever allowed to be the zero vector 0\mathbf{0}? NO, by definition v≠0\mathbf{v} \ne \mathbf{0}.
  • How do you find the null space? Solve homogeneous system Ax=0A \mathbf{x} = \mathbf{0}.
  • Can a matrix with distinct eigenvalues always be diagonalized? YES, distinct eigenvalues guarantee linearly independent eigenvectors.

◇References & Navigation

CONFIRMATION // 理解度の確認

ACTIVE RECALL VERIFICATION

Select an answer to verify conceptual comprehension and reveal the technical rationale.

Q1

If AA is a 3×33 \times 3 matrix with det⁡(A)=4\det(A) = 4, what is det⁡(2A)\det(2A)?

Q2

Let AA be a 4×74 \times 7 matrix. If the dimension of the null space of AA is 4, what is the rank of AA?

Q3

For which value of kk is the matrix [2k46]\begin{bmatrix} 2 & k \\ 4 & 6 \end{bmatrix} singular (non-invertible)?

Q4

What are the eigenvalues of the matrix A=[3102]A = \begin{bmatrix} 3 & 1 \\ 0 & 2 \end{bmatrix}?

Q5

Which of the following subsets of R3\mathbb{R}^3 is a valid vector subspace?