Matrix Algebra & Determinants: Properties, Operations & Applications

Core Concepts & Definitions

1. Matrix Algebra

1.1 Matrix Basics

• A matrix $A$ of size $m\times n$ is a rectangular array of scalars: $$A=\left[\begin{array}{cccc}{a}_{11}& a_{12}& \cdots & a_{1n}\\ a_{21}& a_{22}& \cdots & a_{2n}\\ ⋮& ⋮& \ddots & ⋮\\ a_{m1}& a_{m2}& \cdots & a_{mn}\end{array}\right]$$
• Types:
  • Square matrix: $m=n$ (e.g., $2\times 2$, $3\times 3$).
  • Diagonal matrix: Non-zero entries only on the diagonal ($a_{ij}=0$ for $i\ne j$).
  • Identity matrix $I$: Diagonal entries = 1, others = 0.
  • Zero matrix: All entries = 0.
  • Upper/lower triangular: Entries below/above the diagonal are zero.

1.2 Matrix Operations

Key Properties:

• Non-commutative: $AB\ne BA$ in general.
• Associative: $(AB)C=A(BC)$.
• Distributive: $A(B+C)=AB+AC$.

Worked Example: Find $AB$ where: $$A=\left[\begin{array}{cc}1& -1\\ 2& 3\end{array}\right],B=\left[\begin{array}{cc}4& 0\\ 1& 5\end{array}\right]$$ Solution: $$AB=\left[\begin{array}{cc}(1)(4)+(-1)(1)& (1)(0)+(-1)(5)\\ (2)(4)+(3)(1)& (2)(0)+(3)(5)\end{array}\right]=\left[\begin{array}{cc}3& -5\\ 11& 15\end{array}\right]$$

2. Matrix Inverse

flowchart TD
    A[Augmented Matrix [A|I]] --> B[Row Operations]
    B --> C[Row Reduced to [I|A⁻¹]]
    C --> D[Extract A⁻¹]
    style A fill:#f9f, style D fill:#bbf

Gaussian elimination process for finding matrix inverse

2.1 Definition

A matrix $A$ is invertible (or non-singular) if there exists a matrix $A^{-1}$ such that: $$A{A}^{-1}=A^{-1}A=I$$

• Only square matrices can have inverses.
• Conditions for invertibility:
  • $\det (A)\ne 0$ (non-zero determinant).
  • Rows/columns are linearly independent.

2.2 Methods to Find $A^{-1}$

Method 1: Adjugate (Adjoint) Method

For a $2\times 2$ matrix: $$A=\left[\begin{array}{cc}a& b\\ c& d\end{array}\right],A^{-1}=\frac{1}{\det (A)}\left[\begin{array}{cc}d& -b\\ -c& a\end{array}\right]$$ Example: Find $A^{-1}$ for $A=\left[\begin{array}{cc}1& 0\\ 3& 4\end{array}\right]$. Solution: $$\det (A)=(1)(4)-(0)(3)=4$$ $$A^{-1}=\frac{1}{4}\left[\begin{array}{cc}4& 0\\ -3& 1\end{array}\right]=\left[\begin{array}{cc}1& 0\\ -0.75& 0.25\end{array}\right]$$

Method 2: Gaussian Elimination (Row Reduction)

Augment $A$ with $I$ and row-reduce to $[I|A^{-1}]$: $$[A|I]\stackrel{\text{row ops}}{\to }[I|A^{-1}]$$ Example: Find $A^{-1}$ for $A=\left[\begin{array}{cc}1& 2\\ 3& 4\end{array}\right]$. Solution: $$\left[\begin{array}{ccccc}1& 2& |& 1& 0\\ 3& 4& |& 0& 1\end{array}\right]\stackrel{R_2\leftarrow R_2-3R_1}{\to }\left[\begin{array}{ccccc}1& 2& |& 1& 0\\ 0& -2& |& -3& 1\end{array}\right]\stackrel{R_2\leftarrow -\frac{1}{2}{R}_2}{\to }\left[\begin{array}{ccccc}1& 2& |& 1& 0\\ 0& 1& |& 1.5& -0.5\end{array}\right]\stackrel{R_1\leftarrow R_1-2R_2}{\to }\left[\begin{array}{ccccc}1& 0& |& -2& 1\\ 0& 1& |& 1.5& -0.5\end{array}\right]$$ Thus, $$A^{-1}=\left[\begin{array}{cc}-2& 1\\ 1.5& -0.5\end{array}\right]$$

2.3 Applications of Matrix Inverse

• Solving linear systems: $AX=B⟹X=A^{-1}B$.
• Computer graphics (transformations).
• Cryptography (e.g., Hill cipher).

3. Determinants

3.1 Definition

For a square matrix $A$, the determinant $\det (A)$ is a scalar value that:

• Indicates if $A$ is invertible ($\det (A)\ne 0$).
• Measures the scaling factor of the linear transformation represented by $A$.

3.2 Properties of Determinants

3.3 Evaluation of Determinants

Method 1: Cofactor Expansion (Laplace Expansion)

For an $n\times n$ matrix, expand along a row or column: $$\det (A)=\sum _{j=1}^n(-1{)}^{i+j}{a}_{ij}\det (M_{ij})$$ where $M_{ij}$ is the minor (submatrix without row $i$, column $j$).

Example: Compute $\det (A)$ for: $$A=\left[\begin{array}{ccc}-2& 8& -9\\ -1& 7& 0\\ 1& -4& 2\end{array}\right]$$ Solution: Expand along the first row: $$\det (A)=(-2)\cdot \left|\begin{array}{cc}7& 0\\ -4& 2\end{array}\right|-8\cdot \left|\begin{array}{cc}-1& 0\\ 1& 2\end{array}\right|+(-9)\cdot \left|\begin{array}{cc}-1& 7\\ 1& -4\end{array}\right|$$ $$=(-2)(14-0)-8(-2-0)+(-9)(4-7)=-28+16+27=15$$

Method 2: Row Reduction (Upper Triangular Form)

• Use row operations to convert $A$ to upper triangular form.
• $\det (A)=$ product of diagonal entries.

Example: Compute $\det (B)$ for: $$B=\left[\begin{array}{ccc}1& 5& -6\\ -1& -4& 4\\ -2& -7& 9\end{array}\right]$$ Solution:

1. $R_2\leftarrow R_2+R_1$: $$\left[\begin{array}{ccc}1& 5& -6\\ 0& 1& -2\\ -2& -7& 9\end{array}\right]$$
2. $R_3\leftarrow R_3+2R_1$: $$\left[\begin{array}{ccc}1& 5& -6\\ 0& 1& -2\\ 0& 3& -3\end{array}\right]$$
3. $R_3\leftarrow R_3-3R_2$: $$\left[\begin{array}{ccc}1& 5& -6\\ 0& 1& -2\\ 0& 0& 3\end{array}\right]$$ Now, $\det (B)=(1)(1)(3)=3$.

Method 3: Special Cases

• Diagonal/Upper/Lower Triangular: $\det (A)={\prod }_{i=1}^n{a}_{ii}$.
• 2×2 Matrix: $$\det \left[\begin{array}{cc}a& b\\ c& d\end{array}\right]=ad-bc$$
• 3×3 Matrix (Rule of Sarrus): $$\det \left[\begin{array}{ccc}a& b& c\\ d& e& f\\ g& h& i\end{array}\right]=aei+bfg+cdh-ceg-bdi-afh$$

3.4 Applications of Determinants

• Solving linear systems: $\det (A)=0$ implies no unique solution (either no solution or infinitely many).
• Area/Volume scaling: $|\det (A)|$ gives the scaling factor of the linear transformation.
• Cramer’s Rule: For $AX=B$, $x_i=\frac{\det (A_i)}{\det (A)}$, where $A_i$ replaces the $i$-th column of $A$ with $B$.

4. Rank of a Matrix

4.1 Definition

The rank of a matrix $A$, $\text{rank}(A)$, is the maximum number of linearly independent rows or columns.

4.2 Properties

• $\text{rank}(A)\le \min (m,n)$ for $m\times n$ matrix.
• $\text{rank}(A)=n$ for an $n\times n$ invertible matrix.
• $\text{rank}(AB)\le \min (\text{rank}(A),\text{rank}(B))$.

4.3 Finding Rank

1. Row Echelon Form (REF): Convert $A$ to REF and count non-zero rows. Example: Find the rank of: $$A=\left[\begin{array}{ccc}0& 3& -6\\ 3& -7& 8\\ 3& -9& 12\end{array}\right]$$ Solution:

   • $R_2\leftrightarrow R_1$: $$\left[\begin{array}{ccc}3& -7& 8\\ 0& 3& -6\\ 3& -9& 12\end{array}\right]$$
   • $R_3\leftarrow R_3-R_1$: $$\left[\begin{array}{ccc}3& -7& 8\\ 0& 3& -6\\ 0& 2& 4\end{array}\right]$$
   • $R_3\leftarrow R_3-\frac{2}{3}{R}_2$: $$\left[\begin{array}{ccc}3& -7& 8\\ 0& 3& -6\\ 0& 0& 8\end{array}\right]$$
   • Rank = 3 (all rows are non-zero).

2. Using Determinants:

   • The rank is the largest $k$ such that some $k\times k$ submatrix has non-zero determinant.

4.4 Applications

• Solving linear systems: Rank determines the number of free variables.
• Linear transformations: Rank indicates the dimension of the image space.

5. Linear Independence and Null Space

5.1 Linear Independence

A set of vectors $\{v_1,v_2,\dots ,v_k\}$ is linearly independent if: $$c_1{v}_1+c_2{v}_2+\cdots +c_k{v}_k=0⟹c_1=c_2=\cdots =c_k=0$$

• For matrices: Columns (or rows) are linearly independent if the matrix has full column (or row) rank.

Example: Check if the columns of $A=\left[\begin{array}{ccc}0& 1& 4\\ 1& 2& -1\\ 5& 8& 0\end{array}\right]$ are linearly independent. Solution:

• Form a matrix with columns as vectors and check rank: $$\text{rank}(A)=3(\text{since }\det (A)\ne 0)$$
• Thus, columns are linearly independent.

5.2 Null Space (Kernel)

The null space of $A$, $\text{Null}(A)$, is the set of all solutions to $A\mathbf{x}=0$: $$\text{Null}(A)=\{\mathbf{x}\mid A\mathbf{x}=0\}$$

• Basis for Null Space: Found by solving $A\mathbf{x}=0$ in REF.
• Dimension of Null Space = $n-\text{rank}(A)$ (for $n\times n$ matrix).

Example: Find the basis for $\text{Null}(A)$ where: $$A=\left[\begin{array}{ccc}1& 2& 3\\ 2& 3& 4\end{array}\right]$$ Solution:

1. Convert $A$ to REF: $$\left[\begin{array}{ccc}1& 2& 3\\ 0& -1& -2\end{array}\right]$$
2. Back-substitute:
   • $x_2+2x_3=0⟹x_2=-2x_3$.
   • $x_1+2x_2+3x_3=0⟹x_1=x_3$.
3. General solution: $$\mathbf{x}=x_3\left[\begin{array}{c}1\\ -2\\ 1\end{array}\right]$$
4. Basis: $\left\{\left[\begin{array}{c}1\\ -2\\ 1\end{array}\right]\right\}$.

Verification: Check if $\mathbf{v}=\left[\begin{array}{c}5\\ -3\\ -2\end{array}\right]$ is in $\text{Null}(A)$ for: $$A=\left[\begin{array}{ccc}-1& -3& 2\\ -5& -9& 1\end{array}\right]$$ Solution: $$A\mathbf{v}=\left[\begin{array}{c}-1(-2)+-3(-3)+2(5)\\ -5(-2)+-9(-3)+1(5)\end{array}\right]=\left[\begin{array}{c}2+9+10\\ 10+27+5\end{array}\right]=\left[\begin{array}{c}21\\ 42\end{array}\right]\ne 0$$ Correction: The original question had $\mathbf{v}=\left[\begin{array}{c}5\\ -3\\ -2\end{array}\right]$, but $A\mathbf{v}\ne 0$. Likely a typo in the exam; verify with correct $\mathbf{v}$.

Exam Tip

Common Pitfalls & Strategies

1. Matrix Multiplication:

   • Mistake: Assuming $AB=BA$. Always check dimensions and compute carefully.
   • Tip: Use the "dot product of rows and columns" rule.

2. Determinant Calculation:

   • Mistake: Forgetting the $(-1{)}^{i+j}$ sign in cofactor expansion.
   • Tip: Expand along the row/column with the most zeros to simplify calculations.

3. Inverse Existence:

   • Mistake: Assuming all square matrices are invertible. Always check $\det (A)\ne 0$.
   • Tip: For $2\times 2$ matrices, compute $ad-bc\ne 0$.

4. Rank and Null Space:

   • Mistake: Confusing rank with the number of non-zero rows in the original matrix (must be in REF).
   • Tip: Always reduce to REF before counting rank.

5. Linear Independence:

   • Mistake: Assuming columns are independent just because the matrix is square.
   • Tip: Use determinant or row reduction to verify.

High-Score Techniques

• Show all steps: Partial credit is given for correct intermediate steps.
• Use properties: For determinants, use row operations to simplify before expanding.
• Verify answers: For inverses, multiply $A$ and $A^{-1}$ to check if $I$ is obtained.
• Practice cofactor expansion: Memorize the pattern for $3\times 3$ matrices to save time.

Past Exam Patterns

• Direct computation: 60% of questions ask for determinant/inverse/rank calculations.
• Theoretical questions: 20% define concepts (e.g., null space, rank, linear independence).
• Application-based: 20% relate to solving systems or verifying properties (e.g., $A\mathbf{v}=0$).

Recommended Practice

1. Drill cofactor expansion for $3\times 3$ and $4\times 4$ matrices.
2. Solve systems using inverses and Cramer’s Rule.
3. Find null spaces and bases for subspaces (common in TU/PU exams).
4. Prove linear independence using determinants or row reduction.