Skip to content
Calculus and Differential Equations•Unit 1• MAT1001

Fundamentals of Linear Algebra

Matrix classifications, row echelon reduction, rank, systems of linear equations, LU decomposition, eigenvalues/eigenvectors, and quadratic forms.

Learning Mode Filter (#29):Personalize View
Skills Built:Row Echelon Reduction & Rank Determination (ρ(A))Linear System Consistency (Rouché–Capelli Theorem)Gauss Elimination & LU Matrix Factorization (A = LU)Eigenvalues, Eigenvectors & Network Connectivity ModesOrthogonal Diagonalization & Quadratic Form Definiteness

1. Matrix Classifications & Row Echelon Form

A matrix is an ordered rectangular array of numbers arranged into mm horizontal rows and nn vertical columns, denoted as A=[aij]m×nA = [a_{ij}]_{m \times n}.

1.1 Types of Matrices

  • Square Matrix: Number of rows equals number of columns (m=nm = n).
  • Diagonal Matrix: A square matrix where all non-diagonal elements are zero (aij=0a_{ij} = 0 for all i≠ji \ne j).
  • Upper Triangular Matrix: A square matrix where all elements below the main leading diagonal are zero (aij=0a_{ij} = 0 for all i>ji > j).
  • Identity Matrix (II): A diagonal matrix whose main diagonal entries are all 1 (aii=1a_{ii} = 1) and all other entries are zero.
  • Symmetric Matrix: A square matrix that equals its transpose: A=AT  ⟺  aij=ajiA = A^T \iff a_{ij} = a_{ji}

1.2 Row Echelon Form

A non-zero matrix AA is in Row Echelon Form if:

  1. All completely zero rows are situated below all non-zero rows.
  2. The leading non-zero element (pivot) of each row appears strictly to the right of the leading element in the row above it.
  3. All entries in the column beneath each leading pivot are zero.
       [ ROW ECHELON FORM ]                    [ RANK DETERMINATION ]
       
       ┌                  ┐                    
       │  [1]   2    3   2│  Row 1 (Non-zero)  
       │   0   [4]   5   1│  Row 2 (Non-zero)  ──► Non-zero rows = 3
       │   0    0   [1]  0│  Row 3 (Non-zero)      Rank ρ(A) = 3
       │   0    0    0   0│  Row 4 (Zero row)  
       └                  ┘                    

1.3 Rank of a Matrix (ρ(A)\rho(A))

The rank of a matrix AA, denoted by ρ(A)\rho(A), is defined as:

  • The order of the largest non-vanishing (non-zero) determinant minor of AA.
  • Equivalent Operational Definition: The total number of non-zero rows remaining in the matrix after reduction to Row Echelon Form via elementary row operations:
    1. Ri↔RjR_i \leftrightarrow R_j (Interchanging two rows).
    2. Ri→kRiR_i \to k R_i (Multiplying a row by a non-zero scalar k≠0k \ne 0).
    3. Ri→Ri+kRjR_i \to R_i + k R_j (Adding a scalar multiple of row jj to row ii).

2. Systems of Linear Equations & Consistency Criteria

A system of mm linear equations in nn unknowns (x1,x2,…,xnx_1, x_2, \dots, x_n):

a_{11}x_1 + a_{12}x_2 + \dots + a_{1n}x_n &= b_1 \\ a_{21}x_1 + a_{22}x_2 + \dots + a_{2n}x_n &= b_2 \\ &\;\;\vdots \\ a_{m1}x_1 + a_{m2}x_2 + \dots + a_{mn}x_n &= b_m \end{aligned}$$ is represented compactly in matrix form as: $$AX = B$$ Where $A$ is the $m \times n$ coefficient matrix, $X = [x_1, \dots, x_n]^T$ is the unknown vector, and $B = [b_1, \dots, b_m]^T$ is the constant vector. The **augmented matrix** is formed by appending $B$ as the rightmost column: $[A : B]$. ### Rouché–Capelli Consistency Theorem <FormulaStrip formulas={[ { name: "Unique Solution Condition", formula: "ρ(A) = ρ([A:B]) = r = n", unit: "Deterministic", description: "Rank equals number of unknowns; single unique coordinate solution." }, { name: "Infinite Solutions Condition", formula: "ρ(A) = ρ([A:B]) = r < n", unit: "Parametric", description: "Consistent; possesses infinitely many solutions with (n - r) free parameters." }, { name: "Inconsistent Condition", formula: "ρ(A) ≠ ρ([A:B])", unit: "No Solution", description: "Ranks differ; contradictory equations with zero possible solutions." }, { name: "Homogeneous System", formula: "AX = 0 (Always Consistent)", unit: "Zero Vector", description: "Always possesses at least the trivial zero solution X = 0." } ]} /> --- ## 3. Solution Methods: Gauss Elimination and LU Decomposition ### 3.1 Gauss Elimination Method 1. Construct the augmented matrix $[A : B]$. 2. Apply elementary row transformations to reduce $A$ into an **Upper Triangular Matrix** (zeros everywhere beneath the main diagonal). 3. Compute the unknowns in reverse order starting from the bottom equation via **back substitution**. --- ### 3.2 LU Decomposition Method (Doolittle Factorization) <Derivation title="LU Factorization: A = L * U" defaultOpen={true}> Any square matrix $A$ whose principal minors are non-singular can be factored uniquely into the product of a **Unit Lower Triangular Matrix ($L$)** and an **Upper Triangular Matrix ($U$)**: $$A = LU$$ For a $3 \times 3$ system: $$\begin{bmatrix} a_{11} & a_{12} & a_{13} \\ a_{21} & a_{22} & a_{23} \\ a_{31} & a_{32} & a_{33} \end{bmatrix} = \begin{bmatrix} 1 & 0 & 0 \\ l_{21} & 1 & 0 \\ l_{31} & l_{32} & 1 \end{bmatrix} \begin{bmatrix} u_{11} & u_{12} & u_{13} \\ 0 & u_{22} & u_{23} \\ 0 & 0 & u_{33} \end{bmatrix}$$ Given the linear system $AX = B$: 1. Substitute $A = LU \implies LUX = B$. 2. Define the intermediate vector $V = [v_1, v_2, v_3]^T$ such that: $$UX = V$$ 3. The equation becomes: $$LV = B \implies \begin{bmatrix} 1 & 0 & 0 \\ l_{21} & 1 & 0 \\ l_{31} & l_{32} & 1 \end{bmatrix} \begin{bmatrix} v_1 \\ v_2 \\ v_3 \end{bmatrix} = \begin{bmatrix} b_1 \\ b_2 \\ b_3 \end{bmatrix}$$ 4. Solve for $v_1, v_2, v_3$ by **forward substitution**: $$v_1 = b_1$$ $$v_2 = b_2 - l_{21}v_1$$ $$v_3 = b_3 - l_{31}v_1 - l_{32}v_2$$ 5. Solve for $x_1, x_2, x_3$ from $UX = V$ by **back substitution**: $$u_{33}x_3 = v_3 \implies x_3 = \frac{v_3}{u_{33}}$$ $$u_{22}x_2 + u_{23}x_3 = v_2 \implies x_2 = \frac{v_2 - u_{23}x_3}{u_{22}}$$ $$x_1 = \frac{v_1 - u_{12}x_2 - u_{13}x_3}{u_{11}}$$ </Derivation> --- ## 4. Interactive Matrix & Linear Systems Solver <Simulator name="linear-algebra" title="Interactive Linear Algebra Matrix & Systems Solver" /> --- ## 5. Eigenvalues and Eigenvectors Let $A$ be an $n \times n$ square matrix. A non-zero column vector $X \ne 0$ is an **eigenvector** of $A$ corresponding to scalar eigenvalue $\lambda$ if: $$AX = \lambda X \iff (A - \lambda I)X = 0$$ For a non-trivial solution ($X \ne 0$) to exist, the coefficient matrix must be singular: $$|A - \lambda I| = 0 \quad\text{(Characteristic Equation)}$$ ### Shortcut Characteristic Polynomial Formula for $3 \times 3$ Matrix $$\lambda^3 - S_1 \lambda^2 + S_2 \lambda - S_3 = 0$$ Where: - $S_1 = \text{Trace}(A) = a_{11} + a_{22} + a_{33}$ (Sum of leading main diagonal elements). - $S_2$ = Sum of the principal minors of leading diagonal elements: $$S_2 = \begin{vmatrix} a_{22} & a_{23} \\ a_{32} & a_{33} \end{vmatrix} + \begin{vmatrix} a_{11} & a_{13} \\ a_{31} & a_{33} \end{vmatrix} + \begin{vmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{vmatrix}$$ - $S_3 = \det(A)$ (Determinant of matrix $A$). --- ## 5. Diagonalization of Real Symmetric Matrices A real symmetric matrix ($A = A^T$) possesses crucial algebraic properties: 1. All eigenvalues $\lambda_1, \lambda_2, \dots, \lambda_n$ are strictly **real numbers**. 2. Eigenvectors corresponding to distinct eigenvalues are mutually **orthogonal** ($X_i^T X_j = 0$ for $i \ne j$). ### Orthogonal Reduction: 1. Compute the normalized eigenvectors: $$\hat{X}_i = \frac{X_i}{\|X_i\|} = \frac{1}{\sqrt{x_1^2 + x_2^2 + x_3^2}} \begin{bmatrix} x_1 \\ x_2 \\ x_3 \end{bmatrix}$$ 2. Assemble the **Normalized Modal Matrix** $N = [\hat{X}_1 \; \hat{X}_2 \; \hat{X}_3]$. 3. Because $N$ is an orthogonal matrix ($N^{-1} = N^T$), the orthogonal transformation diagonalizes $A$: $$D = N^T A N = \begin{bmatrix} \lambda_1 & 0 & 0 \\ 0 & \lambda_2 & 0 \\ 0 & 0 & \lambda_3 \end{bmatrix}$$ --- ## 6. Quadratic Forms & Canonical Reduction A **quadratic form** is a homogeneous polynomial of the second degree: $$Q(x_1, x_2, x_3) = a_{11}x_1^2 + a_{22}x_2^2 + a_{33}x_3^2 + 2a_{12}x_1x_2 + 2a_{13}x_1x_3 + 2a_{23}x_2x_3$$ Expressed in matrix notation: $$Q = X^T A X$$ Where $A$ is the unique symmetric matrix: $$A = \begin{bmatrix} \text{coeff of } x_1^2 & \frac{1}{2}(\text{coeff of } x_1x_2) & \frac{1}{2}(\text{coeff of } x_1x_3) \\ \frac{1}{2}(\text{coeff of } x_1x_2) & \text{coeff of } x_2^2 & \frac{1}{2}(\text{coeff of } x_2x_3) \\ \frac{1}{2}(\text{coeff of } x_1x_3) & \frac{1}{2}(\text{coeff of } x_2x_3) & \text{coeff of } x_3^2 \end{bmatrix}$$ Under the coordinate transformation $X = NY$ (where $N$ is the normalized modal matrix): $$Q = (NY)^T A (NY) = Y^T (N^T A N) Y = Y^T D Y$$ $$\mathbf{Q = \lambda_1 y_1^2 + \lambda_2 y_2^2 + \lambda_3 y_3^2} \quad\text{(Canonical Sum-of-Squares Form)}$$ ### Classification of the Nature of a Quadratic Form | Classification | Eigenvalue Condition | Geometric Meaning | | :--- | :--- | :--- | | **Positive Definite** | All eigenvalues $\lambda_i > 0$ strictly positive | $Q > 0$ for all non-zero vectors $X \ne 0$ | | **Negative Definite** | All eigenvalues $\lambda_i < 0$ strictly negative | $Q < 0$ for all non-zero vectors $X \ne 0$ | | **Positive Semidefinite** | All $\lambda_i \ge 0$, and at least one $\lambda_i = 0$ | $Q \ge 0$; zero minimum occurs along degenerate directions | | **Negative Semidefinite** | All $\lambda_i \le 0$, and at least one $\lambda_i = 0$ | $Q \le 0$; zero maximum occurs along degenerate directions | | **Indefinite** | Eigenvalues contain **both positive and negative** values | $Q$ assumes positive and negative values (saddle point) | --- ## 7. Worked Examination Solutions <WorkedSolution title="Example 1: Gauss Elimination Solution of Linear System" question="Solve the following simultaneous system using Gauss elimination: 2x + 3y - z = 5, 4x + 4y - 3z = 3, 2x - 3y + 2z = 2." steps={[ "Step 1: Write the augmented matrix [A:B]: [ [2, 3, -1 : 5], [4, 4, -3 : 3], [2, -3, 2 : 2] ]", "Step 2: Eliminate below pivot in column 1 using R2 -> R2 - 2*R1 and R3 -> R3 - R1: Yields [ [2, 3, -1 : 5], [0, -2, -1 : -7], [0, -6, 3 : -3] ]", "Step 3: Eliminate below pivot in column 2 using R3 -> R3 - 3*R2: Yields [ [2, 3, -1 : 5], [0, -2, -1 : -7], [0, 0, 6 : 18] ]", "Step 4: Perform back substitution: 6*z = 18 => z = 3", "Step 5: From row 2: -2*y - (3) = -7 => -2*y = -4 => y = 2", "Step 6: From row 1: 2*x + 3*(2) - (3) = 5 => 2*x + 3 = 5 => 2*x = 2 => x = 1" ]} answer="The unique solution is x = 1, y = 2, z = 3." /> <WorkedSolution title="Example 2: Communication Network Connectivity & Dominant Mode" question="A communications engineer models three interconnected network hubs with connectivity matrix A = [ [3, 1, 1], [1, 3, 1], [1, 1, 3] ]. Determine the eigenvalues, eigenvectors, and identify the dominant communication mode." steps={[ "Step 1: Compute polynomial coefficients: S1 = 3 + 3 + 3 = 9. S2 = (9 - 1) + (9 - 1) + (9 - 1) = 8 + 8 + 8 = 24. S3 = det(A) = 3*(9 - 1) - 1*(3 - 1) + 1*(1 - 3) = 24 - 2 - 2 = 20.", "Step 2: Characteristic equation: λ^3 - 9λ^2 + 24λ - 20 = 0. Factoring: (λ - 5)(λ - 2)^2 = 0 => Eigenvalues are λ1 = 5, λ2 = 2, λ3 = 2.", "Step 3: Find eigenvector for dominant eigenvalue λ1 = 5: Solve (A - 5I)X = 0 => [ [-2, 1, 1], [1, -2, 1], [1, 1, -2] ] * [x1, x2, x3]^T = 0.", "Step 4: Yields x1 = x2 = x3 => X1 = [1, 1, 1]^T.", "Step 5: The dominant communication mode corresponds to the largest eigenvalue λ = 5 with eigenvector [1, 1, 1]^T, representing uniform, synchronized packet traffic distribution across all three hubs." ]} answer="Eigenvalues: λ = 5 (dominant), 2, 2. The dominant communication mode is the symmetric synchronized mode X1 = [1, 1, 1]^T." /> <WorkedSolution title="Example 3: Reduction of Quadratic Form to Canonical Form" question="Reduce the quadratic form Q = 7*x1^2 + 6*x2^2 + 5*x3^2 - 4*x1*x2 - 4*x2*x3 into canonical form by orthogonal transformation and determine its nature." steps={[ "Step 1: Construct the symmetric matrix A: A = [ [7, -2, 0], [-2, 6, -2], [0, -2, 5] ].", "Step 2: Compute characteristic polynomial: S1 = 7 + 6 + 5 = 18. S2 = (30 - 4) + (35 - 0) + (42 - 4) = 26 + 35 + 38 = 99. S3 = det(A) = 7*(30 - 4) - (-2)*(-10 - 0) = 7*(26) - 20 = 182 - 20 = 162.", "Step 3: Characteristic equation: λ^3 - 18λ^2 + 99λ - 162 = 0. Roots are λ1 = 3, λ2 = 6, λ3 = 9.", "Step 4: All eigenvalues are strictly positive (λ1 = 3 > 0, λ2 = 6 > 0, λ3 = 9 > 0).", "Step 5: Write the canonical form: Q = 3*y1^2 + 6*y2^2 + 9*y3^2.", "Step 6: Because all eigenvalues are strictly positive, the quadratic form is Positive Definite." ]} answer="Canonical form: Q = 3*y1^2 + 6*y2^2 + 9*y3^2. Nature of quadratic form: Positive Definite." /> --- ## 8. Common Examination Traps <ExamTraps traps={[ { concept: "Quadratic Matrix Off-Diagonal Coefficients", trap: "Writing the matrix entry a12 equal to the coefficient of x1*x2 directly.", correction: "Remember that Q contains 2*a12*x1*x2. Therefore, entry a12 = a21 must be exactly ONE-HALF (1/2) of the cross-product coefficient in the polynomial." }, { concept: "Orthogonal Matrix Normalization", trap: "Forming the modal matrix N using raw integer eigenvectors without normalizing them.", correction: "The relationship N^T = N^-1 holds ONLY when every column vector has unit Euclidean magnitude (||X|| = 1). Always divide each vector by sqrt(x1^2 + x2^2 + x3^2)." }, { concept: "Rouché-Capelli System Inconsistency", trap: "Concluding an augmented system is inconsistent when rank(A) = rank([A:B]) = 2 < 3.", correction: "When the ranks of A and [A:B] are EQUAL, the system is ALWAYS consistent! If the rank is strictly less than the number of unknowns (r < n), it has infinitely many solutions, NOT zero solutions." }, { concept: "Unit Lower Triangular Matrix L", trap: "Assuming the diagonal entries of L in LU decomposition are arbitrary or equal to eigenvalues.", correction: "In Doolittle's LU decomposition, the diagonal elements of L are fixed by definition to 1 (l11 = l22 = l33 = 1)." } ]} /> --- ## 9. Summary Knowledge Check 1. **How is the rank of a matrix related to its row echelon form?** The rank $\rho(A)$ equals the total number of non-zero rows remaining in the matrix after completing elementary row reduction to Row Echelon Form. 2. **Under what condition does the system $AX = B$ possess infinitely many solutions?** When the rank of the coefficient matrix equals the rank of the augmented matrix, but this value is strictly less than the number of unknowns: $$\rho(A) = \rho([A : B]) = r < n$$ The solution space has $(n - r)$ free arbitrary parameters. 3. **How do you deduce the definiteness of a quadratic form without computing eigenvectors?** Simply compute the eigenvalues $\lambda_1, \lambda_2, \lambda_3$ of the associated symmetric matrix $A$: - If all $\lambda_i > 0 \implies$ **Positive Definite**. - If all $\lambda_i < 0 \implies$ **Negative Definite**. - If all $\lambda_i \ge 0$ with at least one zero $\implies$ **Positive Semidefinite**. - If mixed signs (some positive, some negative) $\implies$ **Indefinite**. --- ## 10. Unit Mastery Quiz export const quizQuestions = [ { question: "What is the rank of a matrix A once reduced to row echelon form?", options: [ "The total number of columns in the matrix", "The number of non-zero rows in its row echelon form ρ(A)", "The product of the diagonal pivot elements", "The sum of the principal diagonal minors" ], correctAnswer: 1, explanation: "The rank ρ(A) is defined as the maximum number of linearly independent row vectors, which precisely equals the count of non-zero rows once reduced to row echelon form.", }, { question: "For a system of linear equations AX = B, what is the necessary and sufficient condition for consistency (at least one solution)?", options: [ "ρ(A) > ρ([A|B])", "ρ(A) = ρ([A|B]) (rank of coefficient matrix equals rank of augmented matrix)", "det(A) = 0", "The coefficient matrix must be symmetric" ], correctAnswer: 1, explanation: "According to the Rouché-Capelli theorem, AX = B is consistent if and only if ρ(A) = ρ([A|B]). If this rank equals the number of variables n, the solution is unique; if rank < n, infinitely many solutions exist.", }, { question: "For a 3x3 matrix A, what are the coefficients S1, S2, S3 in the characteristic equation λ³ - S1·λ² + S2·λ - S3 = 0?", options: [ "S1 = det(A), S2 = rank(A), S3 = trace(A)", "S1 = trace(A), S2 = sum of principal diagonal minors, S3 = det(A)", "S1 = norm(A), S2 = det(A), S3 = trace(A)", "S1 = eigenvalue sum, S2 = row sum, S3 = column sum" ], correctAnswer: 1, explanation: "For any 3x3 matrix, the characteristic equation expands as λ³ - S1·λ² + S2·λ - S3 = 0, where S1 = trace(A), S2 = M11 + M22 + M33 (sum of principal diagonal minors), and S3 = det(A).", }, { question: "What does the Cayley-Hamilton theorem state about every square matrix A?", options: [ "Every square matrix is invertible", "Every square matrix satisfies its own characteristic equation, i.e., p(A) = 0", "Every square matrix has strictly positive eigenvalues", "The transpose of a matrix is equal to its inverse" ], correctAnswer: 1, explanation: "The Cayley-Hamilton theorem establishes that substituting matrix A into its characteristic polynomial yields the zero matrix p(A) = O. This provides a direct method to evaluate matrix powers A^k and inverses A^-1.", }, { question: "A real quadratic form Q(X) = X^T A X is classified as 'Positive Definite' if and only if:", options: [ "All eigenvalues of symmetric matrix A are strictly positive (λi > 0 for all i)", "At least one eigenvalue is zero", "All diagonal elements are negative", "The determinant is strictly negative" ], correctAnswer: 0, explanation: "By Sylvester's criterion and spectral decomposition, a quadratic form is positive definite (Q(X) > 0 for all X ≠ 0) if and only if all eigenvalues of its associated symmetric matrix are strictly positive.", }, ]; <Quiz questions={quizQuestions} unitTitle="Fundamentals of Linear Algebra" />