Specialized Matrices and Properties

Overview

Having established the foundational principles of matrix operations and vector spaces, we now advance our study to a class of matrices possessing distinct and powerful structural properties. While general matrices provide a broad framework for linear transformations, certain types of matrices exhibit predictable behaviors that greatly simplify analysis and computation. This chapter is dedicated to the systematic exploration of these specialized matrices, whose unique characteristics are not merely theoretical curiosities but are fundamental to solving a wide range of problems in engineering and data analysis. A firm command of these concepts is indispensable, as they frequently appear in the GATE examination, often in questions that test for a deeper, more intuitive understanding of linear algebra beyond rote computation.

In our investigation, we shall begin with the determinant, a fundamental scalar value that encapsulates critical information about a square matrix, including its invertibility and the volume scaling of a linear transformation. We will then proceed to examine orthogonal matrices, which are central to the study of rotations and transformations that preserve geometric properties such as length and angle. Subsequently, we will explore idempotent and projection matrices, which are instrumental in statistical analysis and machine learning, particularly in the context of regression and dimensionality reduction. Finally, we introduce the concept of partitioned matrices, a practical technique for simplifying the manipulation of large and complex matrices. Understanding the interplay between these matrix types and their properties is crucial for developing the analytical facility required to excel in the GATE examination.

---

Chapter Contents

| # | Topic | What You'll Learn |
|---|-------|-------------------|
| 1 | Determinant | A scalar value revealing matrix properties. |
| 2 | Orthogonal Matrix | Matrices preserving length and angle transformations. |
| 3 | Idempotent Matrix | Matrices where repeated application yields itself. |
| 4 | Projection Matrix | Matrices that project vectors onto a subspace. |
| 5 | Partitioned Matrices | Techniques for manipulating matrices as blocks. |

---

Learning Objectives

---

We now turn our attention to Determinant...
## Part 1: Determinant

Introduction

The determinant is a fundamental scalar value that can be computed from the elements of a square matrix. This single number encapsulates a wealth of information about the matrix and the linear transformation it represents. From a geometric perspective, the absolute value of the determinant gives the scaling factor by which areas or volumes are multiplied under the associated linear transformation. Algebraically, the determinant provides a criterion for invertibility; a non-zero determinant signifies that the matrix is invertible and that the corresponding system of linear equations has a unique solution.

For the GATE examination, a firm grasp of the determinant, its properties, and its calculation is indispensable. We will explore the methods for computing determinants and, more critically, the algebraic properties that facilitate the solution of complex matrix problems without resorting to lengthy computations. Our focus will be on the application of these properties to solve problems involving matrix expressions and to deduce characteristics of special matrix forms.

---

Key Concepts

#
## 1. Calculation of Determinants

While the cofactor expansion is the formal definition, for smaller matrices, more direct methods are employed.

Determinant of a $2 \times 2$ Matrix

For a matrix $A = \begin{bmatrix} a & b \\ c & d \end{bmatrix}$, the determinant is calculated as:

Determinant of a $3 \times 3$ Matrix

For a matrix $A = \begin{bmatrix} a & b & c \\ d & e & f \\ g & h & i \end{bmatrix}$, we can use the Sarrus' rule or cofactor expansion. Using cofactor expansion along the first row:

Determinant of a Triangular Matrix

A significant simplification arises for triangular (either upper or lower) matrices.

Worked Example:

Problem: Calculate the determinant of the matrix $M = \begin{bmatrix} 2 & 1 & 5 \\ 0 & -3 & 4 \\ 0 & 0 & 4 \end{bmatrix}$.

Solution:

Step 1: Identify the type of matrix.
The matrix $M$ is an upper triangular matrix, as all entries below the main diagonal are zero.

Step 2: Apply the formula for the determinant of a triangular matrix.
The determinant is the product of the diagonal elements.

Step 3: Compute the final value.

Answer: The determinant of the matrix $M$ is $-24$.

---

#
## 2. Properties of Determinants

The properties of determinants are far more frequently tested in GATE than direct computation. Mastering these is essential for efficient problem-solving. Let $A$ and $B$ be $n \times n$ matrices and $k$ be a scalar.

Multiplicative Property: The determinant of a product of matrices is the product of their determinants.

Transpose Property: The determinant of a matrix is equal to the determinant of its transpose.

Inverse Property: The determinant of the inverse of a matrix is the reciprocal of its determinant. This is valid only if $\det(A) \neq 0$.

Scalar Multiplication Property: If a matrix is multiplied by a scalar $k$, the determinant is scaled by $k^n$.

Effect of Row/Column Operations:

* Swapping two rows/columns multiplies the determinant by $-1$.
* Multiplying a single row/column by a scalar $k$ multiplies the determinant by $k$.
* Adding a multiple of one row/column to another does not change the determinant.

Singular Matrix Property: A square matrix $A$ is singular (non-invertible) if and only if its determinant is zero.

Determinant and Eigenvalues: The determinant of a matrix is the product of its eigenvalues $(\lambda_1, \lambda_2, \ldots, \lambda_n)$.

Worked Example (Based on GATE PYQ concepts):

Problem: Consider the matrix $A = \begin{bmatrix} 1 & 0 & 2 \\ 2 & -1 & 3 \\ 4 & 1 & 8 \end{bmatrix}$. Calculate the determinant of $(A^2 - A)$.

Solution:

Step 1: Factor the matrix expression inside the determinant.
We are asked to find $\det(A^2 - A)$. We can factor out the matrix $A$.

where $I$ is the $3 \times 3$ identity matrix.

Step 2: Apply the multiplicative property of determinants.

Step 3: Calculate $\det(A)$.
Using cofactor expansion along the first row:

Step 4: Calculate the matrix $(A - I)$.

Step 5: Calculate $\det(A - I)$.
Using cofactor expansion along the first row:

Step 6: Compute the final result.

Answer: The determinant of $(A^2 - A)$ is $20$.

---

#
## 3. The Gram Matrix

A special type of matrix, the Gram matrix, has a determinant whose properties are directly linked to the linear independence of a set of vectors.

The determinant of the Gram matrix, known as the Gram determinant, has a profound connection to linear independence.

This property is extremely powerful. If a problem states that a set of vectors is linearly independent, we can immediately conclude that their Gram matrix is invertible and has a non-zero determinant. Conversely, if the vectors are linearly dependent, the Gram matrix is singular.

The geometric interpretation is that the square root of the Gram determinant, $\sqrt{\det(G)}$, gives the volume of the parallelepiped spanned by the vectors. If the vectors are linearly dependent, they lie in a lower-dimensional subspace, and this volume is zero.

Area > 0
v₁
v₂

Linearly Independent
det(G) > 0

Area = 0
v₁
v₂

Linearly Dependent
det(G) = 0

---

Problem-Solving Strategies

---

Common Mistakes

---

Practice Questions

:::question type="NAT" question="Consider the matrix $A$ given by:

The determinant of the matrix $(A^2 - 4A)$ is _______." answer="-36" hint="Factor the matrix expression inside the determinant first. Use the property $\det(XY) = \det(X)\det(Y)$. Note that the matrices are triangular." solution="
Step 1: Factor the matrix expression.
We need to compute $\det(A^2 - 4A)$. We can factor this expression as:

where $I$ is the $3 \times 3$ identity matrix.

Step 2: Apply the multiplicative property of determinants.

Step 3: Calculate $\det(A)$.
The matrix $A$ is a lower triangular matrix. Its determinant is the product of its diagonal elements.

Step 4: Calculate the matrix $(A - 4I)$.

Step 5: Calculate $\det(A - 4I)$.
The resulting matrix $(A - 4I)$ is also a lower triangular matrix. Its determinant is the product of its diagonal elements.

Step 6: Compute the final result.

Result:
Answer: \boxed{-36}
"
:::

:::question type="MCQ" question="Let $\{v_1, v_2, v_3\}$ be a set of linearly dependent vectors in $\mathbb{R}^4$. Let a $3 \times 3$ matrix $G$ be defined by its elements $G_{ij} = v_i^T v_j$. Which of the following statements about $G$ is always true?" options=["$G$ is positive definite","$G$ is invertible","All eigenvalues of $G$ are positive","det($G$) = 0"] answer="det($G$) = 0" hint="This question concerns the properties of a Gram matrix. Recall the relationship between the linear dependence of vectors and the determinant of their Gram matrix." solution="
The matrix $G$ with elements $G_{ij} = v_i^T v_j$ is the Gram matrix of the vectors $\{v_1, v_2, v_3\}$.

A fundamental property of the Gram matrix is that its determinant is zero if and only if the set of vectors is linearly dependent. Since the problem states that the vectors are linearly dependent, we can directly conclude that $\det(G) = 0$.

Let us analyze the other options:

• $G$ is invertible: A matrix is invertible if and only if its determinant is non-zero. Since $\det(G) = 0$, $G$ is not invertible.


• $G$ is positive definite: A matrix is positive definite if all its eigenvalues are strictly positive. This implies the matrix is invertible, which we have shown is false. A Gram matrix is positive definite if and only if the vectors are linearly independent. It is positive semi-definite if they are dependent, meaning it will have at least one zero eigenvalue.


• All eigenvalues of $G$ are positive: Since $\det(G)$ is the product of its eigenvalues, and $\det(G) = 0$, at least one eigenvalue of $G$ must be zero. Therefore, not all eigenvalues can be positive.

The only statement that is always true is that the determinant of $G$ is 0.
Answer: \boxed{\text{det}(G) = 0}
"
:::

:::question type="MSQ" question="Let $P$ and $Q$ be two invertible $4 \times 4$ matrices such that $\det(P) = 3$ and $\det(Q) = -2$. Which of the following statements is/are correct?" options=["$\det(P^T Q^{-1}) = -1.5$","$\det(2P) = 24$","$\det(P+Q) = 1$","$\det(Q^3) = -8$"] answer="$\det(P^T Q^{-1}) = -1.5$,$\det(Q^3) = -8$" hint="Apply the fundamental properties of determinants: $\det(AB) = \det(A)\det(B)$, $\det(A^T) = \det(A)$, $\det(A^{-1}) = 1/\det(A)$, and $\det(kA) = k^n \det(A)$." solution="
Let's evaluate each option based on the properties of determinants. The matrices are of size $n=4$.

Option A: $\det(P^T Q^{-1}) = -1.5$
Using the multiplicative, transpose, and inverse properties:

This statement is correct.

Option B: $\det(2P) = 24$
Using the scalar multiplication property, $\det(kA) = k^n \det(A)$:

The statement claims the value is 24, which is incorrect.

Option C: $\det(P+Q) = 1$
There is no general formula for $\det(P+Q)$. We cannot assume $\det(P+Q) = \det(P) + \det(Q)$. Without knowing the matrices $P$ and $Q$, we cannot determine $\det(P+Q)$. This statement is not necessarily correct.

Option D: $\det(Q^3) = -8$
Using the property $\det(A^k) = (\det(A))^k$:

This statement is correct.

Therefore, the correct options are A and D.
Answer: \boxed{\det(P^T Q^{-1}) = -1.5, \det(Q^3) = -8}
"
:::

:::question type="MCQ" question="An $n \times n$ matrix $A$ is skew-symmetric. Which of the following is necessarily true?" options=["$\det(A) = 0$ for any $n$","$\det(A) = 0$ only if $n$ is even","$\det(A) = 0$ if $n$ is odd","$\det(A) = 1$"] answer="$\det(A) = 0$ if $n$ is odd" hint="A matrix is skew-symmetric if $A^T = -A$. Use the properties of transpose and scalar multiplication on the determinant." solution="
Step 1: Use the definition of a skew-symmetric matrix.
By definition, $A^T = -A$.

Step 2: Take the determinant of both sides.

Step 3: Apply the determinant properties.
We know that $\det(A^T) = \det(A)$ and $\det(kA) = k^n \det(A)$. Applying these:

Step 4: Analyze the equation for different cases of $n$.

Case 1: $n$ is even
If $n$ is even, then $(-1)^n = 1$. The equation becomes:

This equation is true for any value of $\det(A)$. Thus, for an even-dimensional skew-symmetric matrix, the determinant is not necessarily zero. For example,

has determinant 1.

Case 2: $n$ is odd
If $n$ is odd, then $(-1)^n = -1$. The equation becomes:

This implies that $\det(A) = 0$.

Conclusion:
The determinant of a skew-symmetric matrix must be zero if its dimension $n$ is odd.
Answer: \boxed{\text{det}(A) = 0 \text{ if } n \text{ is odd}}
"
:::

---

Summary

---

What's Next?

---

---

Part 2: Orthogonal Matrix

Introduction

In the study of linear transformations, a particularly important class of matrices is that which preserves the geometric structure of Euclidean space. Specifically, we are often concerned with transformations that do not alter the lengths of vectors or the angles between them. Such transformations, which include rotations and reflections, are fundamental to fields ranging from computer graphics to quantum mechanics. These operations are represented by a special category of matrices known as orthogonal matrices.

An orthogonal matrix is a square matrix whose columns and rows are orthonormal vectors. This seemingly simple algebraic definition has profound geometric consequences. As we shall see, the defining property, $A^T A = I$, is precisely the condition required for a matrix transformation to be an isometry—that is, a transformation that preserves distances. A thorough understanding of orthogonal matrices is indispensable for mastering more advanced topics in linear algebra, such as QR decomposition and Singular Value Decomposition (SVD), which are frequently encountered in data analysis and machine learning algorithms.

---

Key Concepts

1. The Orthonormal Property of Columns and Rows

The definition $A^T A = I$ provides deep insight into the structure of an orthogonal matrix. Let us consider an $n \times n$ matrix $A$ with columns $c_1, c_2, \dots, c_n$, and rows $r_1, r_2, \dots, r_n$.

The transpose of $A$, denoted $A^T$, will have the columns of $A$ as its rows.

Now, let us examine the product $A^T A$:

The entry in the $i$-th row and $j$-th column of this product is the dot product $c_i^T c_j$. For $A^T A$ to be the identity matrix $I$, this product matrix must have 1s on the diagonal and 0s elsewhere. This leads to the following condition:

This is the definition of an orthonormal set of vectors. The vectors are mutually orthogonal ($c_i^T c_j = 0$ for $i \neq j$) and each has a norm (length) of 1 ($c_i^T c_i = ||c_i||^2 = 1$). A similar analysis of $A A^T = I$ shows that the rows of $A$ also form an orthonormal set.

Worked Example:

Problem: Verify that the following matrix $R$ is an orthogonal matrix.

Solution:

Let the columns be $c_1 = \begin{bmatrix} \cos\theta \\ \sin\theta \end{bmatrix}$ and $c_2 = \begin{bmatrix} -\sin\theta \\ \cos\theta \end{bmatrix}$.

Step 1: Check if the columns are orthogonal by computing their dot product.

Since the dot product is zero, the columns are orthogonal.

Step 2: Check if each column has a norm of 1.

For $c_1$:

For $c_2$:

Both columns have a norm of 1.

Answer: Since the columns of $R$ form an orthonormal set, the matrix $R$ is an orthogonal matrix. This particular matrix represents a counter-clockwise rotation by an angle $\theta$ in the 2D plane.

---

2. Geometric Interpretation: Preservation of Norm and Angle

The defining characteristic of an orthogonal transformation is that it preserves the geometry of space. This is formalized by stating that it preserves the Euclidean norm (length) of any vector and the dot product (and thus the angle) between any two vectors.

Let us prove the equivalence between the algebraic definition ($A^T A = I$) and the geometric property ($||Ax|| = ||x||$).

Proof: $A^T A = I \implies ||Ax|| = ||x||$ for all $x \in \mathbb{R}^n$

Step 1: Start with the squared norm of the transformed vector, $||Ax||^2$.

Step 2: Apply the transpose property $(AB)^T = B^T A^T$.

Step 3: Rearrange the terms using associativity of matrix multiplication.

Step 4: Substitute the condition for an orthogonal matrix, $A^T A = I$.

Step 5: Recognize that $x^T x$ is the definition of the squared norm of $x$.

Since norms are non-negative, taking the square root gives $||Ax|| = ||x||$. Thus, an orthogonal transformation preserves the length of vectors.

This property is fundamental and was the central concept tested in the provided PYQ. We can extend this to show that the dot product is also preserved. For any two vectors $x, y \in \mathbb{R}^n$:

Since $(Ax) \cdot (Ay) = x \cdot y$, the angle between the transformed vectors remains the same as the angle between the original vectors.

x
y


x


Ax



||x||
||Ax|| = ||x||








Orthogonal Transformation (Rotation)
Vector length is preserved.

---

3. Determinant and Eigenvalues

The properties of the determinant and eigenvalues of an orthogonal matrix are direct consequences of its defining relation.

Determinant

Let $A$ be an orthogonal matrix. We know that $A^T A = I$.

Step 1: Take the determinant of both sides of the equation.

Step 2: Use the properties $\det(AB) = \det(A)\det(B)$ and $\det(A^T) = \det(A)$.

Step 3: Solve for $\det(A)$.

This is a powerful result. It tells us that orthogonal transformations preserve volume (since $|\det(A)| = 1$) and are always invertible.

• If $\det(A) = +1$, the transformation is called a proper rotation. It preserves the orientation of space.


• If $\det(A) = -1$, the transformation is an improper rotation, which involves a reflection and possibly a rotation. It reverses the orientation of space.

Eigenvalues

Let $\lambda$ be an eigenvalue of a real orthogonal matrix $A$ with a corresponding eigenvector $v$ (which may be in $\mathbb{C}^n$).

Step 1: Take the norm of both sides.

Step 2: Use the property of norms $||cv|| = |c| ||v||$ for a scalar $c$.

Step 3: Since $A$ is orthogonal, we know it preserves the norm, so $||Av|| = ||v||$.

Step 4: Since $v$ is an eigenvector, it is non-zero, so $||v|| \neq 0$. We can divide by $||v||$.

This means all eigenvalues of an orthogonal matrix must have a modulus (or absolute value) of 1. They lie on the unit circle in the complex plane.

If an eigenvalue of a real orthogonal matrix is a real number, then it must be either $+1$ or $-1$. However, it is crucial to remember that eigenvalues can be complex. For instance, the 2D rotation matrix for $\theta=90^\circ$ has eigenvalues $i$ and $-i$, both of which have a modulus of 1.

---

4. Rank and Invertibility

From the determinant property, we know that $\det(A) \neq 0$ for any orthogonal matrix $A$. A square matrix is invertible if and only if its determinant is non-zero. Therefore, every orthogonal matrix is invertible.

Furthermore, for an $n \times n$ matrix, being invertible is equivalent to having full rank.

Rank of an Orthogonal Matrix: For any $n \times n$ orthogonal matrix $A$,

This means the transformation maps $\mathbb{R}^n$ onto itself, and the null space of $A$ contains only the zero vector. The columns (and rows) are linearly independent, which is a stronger condition than just being orthogonal and is guaranteed by the orthonormality.

---

Problem-Solving Strategies

---

---

Common Mistakes

---

Practice Questions

:::question type="MCQ" question="Which of the following matrices is an orthogonal matrix?" options=["$A = \begin{bmatrix} 1 & 1 \\ 1 & 1 \end{bmatrix}$","$B = \begin{bmatrix} 1 & 0 \\ 0 & -2 \end{bmatrix}$","$C = \frac{1}{\sqrt{2}}\begin{bmatrix} 1 & -1 \\ 1 & 1 \end{bmatrix}$","$D = \begin{bmatrix} 1 & 1 \\ 0 & 1 \end{bmatrix}$"] answer="$C = \frac{1}{\sqrt{2}}\begin{bmatrix} 1 & -1 \\ 1 & 1 \end{bmatrix}$" hint="Check if the columns of each matrix form an orthonormal set. Remember to account for any scalar multiple outside the matrix." solution="
Let's analyze each option by checking for column orthonormality.

Option A: The columns are $c_1 = [1, 1]^T$ and $c_2 = [1, 1]^T$. The norm is $||c_1|| = \sqrt{1^2+1^2} = \sqrt{2} \neq 1$. So, A is not orthogonal.

Option B: The columns are $c_1 = [1, 0]^T$ and $c_2 = [0, -2]^T$. The norm is $||c_2|| = \sqrt{0^2+(-2)^2} = 2 \neq 1$. So, B is not orthogonal.

Option C: The matrix is

The columns are $c_1 = [1/\sqrt{2}, 1/\sqrt{2}]^T$ and $c_2 = [-1/\sqrt{2}, 1/\sqrt{2}]^T$.

• Dot product:

They are orthogonal.

• Norms:

Since the columns are orthonormal, C is an orthogonal matrix.

Option D: The columns are $c_1 = [1, 0]^T$ and $c_2 = [1, 1]^T$. The dot product is

They are not orthogonal. So, D is not orthogonal.

Answer: \boxed{C = \frac{1}{\sqrt{2}}\begin{bmatrix} 1 & -1 \\ 1 & 1 \end{bmatrix}}
"
:::

:::question type="NAT" question="Consider the matrix $A = \begin{bmatrix} 1/2 & a \\ \sqrt{3}/2 & b \end{bmatrix}$. If $A$ is an orthogonal matrix with a determinant of +1, what is the value of $b$?" answer="0.5" hint="For an orthogonal matrix, the columns must be orthonormal. Use this to find the possible values for the second column. Then use the determinant condition to select the correct solution." solution="
Let the columns be $c_1 = [1/2, \sqrt{3}/2]^T$ and $c_2 = [a, b]^T$.

Step 1: Use the orthonormality conditions.
The norm of the first column is

It is a unit vector.

The second column must also be a unit vector:

The columns must be orthogonal:

Step 2: Substitute $a$ into the norm equation.

Step 3: Determine the corresponding values of $a$.
If $b = 1/2$, then $a = -\sqrt{3}/2$.
If $b = -1/2$, then $a = \sqrt{3}/2$.

Step 4: Use the determinant condition $\det(A) = 1$.

Case 1: $b = 1/2, a = -\sqrt{3}/2$

This is a valid solution.

Case 2: $b = -1/2, a = \sqrt{3}/2$

This is not the required solution.

Step 5: The only solution that satisfies all conditions is $b=1/2$.

Answer: \boxed{0.5}
"
:::

:::question type="MSQ" question="Let $Q$ be an $n \times n$ real orthogonal matrix where $n > 1$. Which of the following statements is/are ALWAYS true?" options=["All eigenvalues of $Q$ are real.","The matrix $Q^2$ is also an orthogonal matrix.","The trace of $Q$, Tr$(Q)$, must be an integer.","The columns of $Q$ are linearly independent."] answer="The matrix $Q^2$ is also an orthogonal matrix.,The columns of $Q$ are linearly independent." hint="Consider the properties of orthogonal matrices. For statements that might be false, try to construct a 2x2 counterexample, like a rotation matrix." solution="
Let's analyze each statement.

Statement A: All eigenvalues of $Q$ are real.
This is false. Consider the 2D rotation matrix for $\theta = 90^\circ$:

This is an orthogonal matrix. Its characteristic equation is $\det(Q - \lambda I) = 0$, which is

The eigenvalues are $\lambda = \pm i$, which are not real.

Statement B: The matrix $Q^2$ is also an orthogonal matrix.
Let's check the defining property for $Q^2$. We need to show that $(Q^2)^T (Q^2) = I$.
We know that for an orthogonal matrix $Q$, $Q^T = Q^{-1}$.
The transpose of $Q^2$ is $(Q^2)^T = (Q Q)^T = Q^T Q^T$.
The inverse of $Q^2$ is $(Q^2)^{-1} = (Q Q)^{-1} = Q^{-1} Q^{-1}$.
Since $Q^{-1} = Q^T$, we have:

Since the inverse of $Q^2$ is equal to its transpose, $Q^2$ is an orthogonal matrix. This statement is true.

Statement C: The trace of $Q$, $\operatorname{Tr}(Q)$, must be an integer.
The trace is the sum of the eigenvalues. As shown in statement A, the eigenvalues can be complex numbers like $i$ and $-i$. The trace of that matrix is $0+0=0$, which is an integer. However, consider a rotation by $45^\circ$:

The trace is $1/\sqrt{2} + 1/\sqrt{2} = 2/\sqrt{2} = \sqrt{2}$, which is not an integer. So, this statement is false.

Statement D: The columns of $Q$ are linearly independent.
Since $Q$ is an orthogonal matrix, its determinant is $\pm 1$, which is non-zero. A square matrix has linearly independent columns if and only if its determinant is non-zero. Therefore, the columns of $Q$ must be linearly independent. This statement is true.

Answer: \boxed{\text{The matrix } Q^2 \text{ is also an orthogonal matrix.,The columns of } Q \text{ are linearly independent.}}
"
:::

---

Summary

---

What's Next?

---

---

Part 3: Idempotent Matrix

Introduction

In our study of linear algebra, we encounter various classes of matrices, each distinguished by specific algebraic properties. While general matrices form the bedrock of the subject, certain specialized matrices, such as symmetric, orthogonal, or nilpotent matrices, provide deeper structural insights and are instrumental in a wide range of applications, from geometry to data analysis. Among these is the class of idempotent matrices.

An idempotent matrix is defined by a simple yet powerful property related to its self-multiplication. This property, $A^2 = A$, might seem abstract at first, but it is the algebraic manifestation of a geometric projection. Understanding idempotent matrices is crucial as they form the foundation for projection operators, which are fundamental in statistics, machine learning (particularly in linear regression models), and signal processing. For the GATE examination, a firm grasp of their definition, key properties related to eigenvalues, trace, and rank is essential for solving targeted problems efficiently.

---

Key Concepts

The defining property of an idempotent matrix gives rise to several other important and testable characteristics. Let us explore the most significant of these.

1. Eigenvalues of an Idempotent Matrix

One of the most critical properties of an idempotent matrix pertains to its eigenvalues. This property is frequently leveraged in competitive examinations to determine characteristics of a matrix without extensive computation.

We can prove that the eigenvalues of any idempotent matrix are restricted to only two possible values: 0 or 1.

Proof:

Let $A$ be an idempotent matrix. Let $\lambda$ be an eigenvalue of $A$ and $v$ be the corresponding non-zero eigenvector.

By the definition of an eigenvalue and eigenvector, we have:

Multiplying both sides by $A$ from the left, we get:

Since $A$ is idempotent, we know that $A^2 = A$. Substituting this into the equation:

We also know that $Av = \lambda v$. Substituting this into the right-hand side yields:

Rearranging the terms, we obtain:

Since $v$ is an eigenvector, it is a non-zero vector ($v \neq 0$). Therefore, the scalar multiple must be zero:

This gives us two possible solutions for $\lambda$:

Thus, the only possible eigenvalues for an idempotent matrix are 0 and 1.

2. Properties of $(I - A)$

If a matrix $A$ is idempotent, the related matrix $(I-A)$, where $I$ is the identity matrix of the same order, also exhibits interesting properties.

Property: If $A$ is idempotent, then $(I-A)$ is also idempotent.

Proof:

To prove that $(I-A)$ is idempotent, we must show that $(I-A)^2 = (I-A)$.

Step 1: Expand the square term.

Step 2: Apply the distributive property of matrix multiplication.

Step 3: Use the properties $I^2=I$, $IA=A$, $AI=A$, and the given condition $A^2=A$.

Step 4: Simplify the expression.

Since $(I-A)^2 = (I-A)$, the matrix $(I-A)$ is idempotent. Furthermore, we observe that $A(I-A) = A - A^2 = A - A = O$, where $O$ is the null matrix. This means the column spaces of $A$ and $(I-A)$ are orthogonal.

3. Trace and Rank

A particularly useful property for numerical answer type (NAT) questions connects the trace of an idempotent matrix to its rank.

Justification: The trace of any square matrix is the sum of its eigenvalues. Since the eigenvalues of an idempotent matrix can only be 0 or 1, the trace is simply the count of eigenvalues that are equal to 1. An idempotent matrix is always diagonalizable, and its rank is the number of non-zero eigenvalues. Consequently, the rank is also the count of eigenvalues equal to 1. It follows that the trace and rank must be equal.

Worked Example:

Problem: Verify that the matrix $A = \begin{pmatrix} 2 & -1 \\ 2 & -1 \end{pmatrix}$ is idempotent and confirm that its trace equals its rank.

Solution:

Step 1: Check for idempotency by computing $A^2$.

Since $A^2=A$, the matrix is idempotent.

Step 2: Calculate the trace of $A$.

Step 3: Calculate the rank of $A$.
The second row is a multiple of the first row ($R_2 = 1 \cdot R_1$). Therefore, the rows are linearly dependent. The number of linearly independent rows (or columns) is 1.

Conclusion: We observe that $\operatorname{tr}(A) = \operatorname{rank}(A) = 1$, which confirms the property.

---

Problem-Solving Strategies

---

Common Mistakes

---

Practice Questions

:::question type="MCQ" question="Let $A$ be a non-zero idempotent matrix of order $n$. Which of the following statements is always true?" options=["$A$ is invertible", "$I-A$ is the zero matrix", "$A$ must have an eigenvalue of 0", "The rank of $A$ is equal to its trace"] answer="The rank of $A$ is equal to its trace" hint="Recall the fundamental properties of eigenvalues, trace, and rank for idempotent matrices. Consider the case where $A$ is the identity matrix to eliminate some options." solution="Step 1: Analyze the options.

• Option A: If $A$ is idempotent and $A \neq I$, it must have an eigenvalue of 0, so $\det(A)=0$. Thus, $A$ is not invertible. The identity matrix $I$ is idempotent and invertible, but the statement must be always true. So this option is false.


• Option B: If $I-A = O$, then $A=I$. But $A$ can be any non-zero idempotent matrix, not necessarily the identity matrix. So this is false.


• Option C: The identity matrix $I$ is idempotent, but its only eigenvalue is 1. So this is not always true.


• Option D: A fundamental property of idempotent matrices is that their trace (sum of eigenvalues) equals their rank (number of non-zero eigenvalues). Since eigenvalues can only be 0 or 1, the trace counts the number of '1' eigenvalues, which is precisely the rank. This statement is always true.

Result: The correct option is "The rank of $A$ is equal to its trace".
"
:::

:::question type="NAT" question="An idempotent matrix $A$ of order $4 \times 4$ has a trace of 3. What is the rank of the matrix $(I-A)$?" answer="1" hint="Use the trace-rank property for both $A$ and $(I-A)$. Remember how the trace of $(I-A)$ relates to the trace of $A$." solution="Step 1: Use the trace-rank property for matrix $A$.
For an idempotent matrix, $\operatorname{rank}(A) = \operatorname{tr}(A)$.
Given $\operatorname{tr}(A) = 3$.
Therefore, $\operatorname{rank}(A) = 3$.

Step 2: Determine the trace of $(I-A)$.
The matrix $A$ is of order $4 \times 4$, so $I$ is the $4 \times 4$ identity matrix.
We know that $\operatorname{tr}(I-A) = \operatorname{tr}(I) - \operatorname{tr}(A)$.
The trace of a $4 \times 4$ identity matrix is $1+1+1+1=4$.

Step 3: Use the trace-rank property for matrix $(I-A)$.
If $A$ is idempotent, then $(I-A)$ is also idempotent.
Therefore, $\operatorname{rank}(I-A) = \operatorname{tr}(I-A)$.

Result: The rank of the matrix $(I-A)$ is 1.
"
:::

:::question type="MSQ" question="Let $A$ be a $3 \times 3$ idempotent matrix such that $A \neq I$ and $A \neq O$. Which of the following statements must be true?" options=["$\det(A) = 0$", "$\operatorname{rank}(A) = 1$ or $\operatorname{rank}(A)=2$", "$A$ is diagonalizable", "$A+I$ is idempotent"] answer="$\det(A) = 0$,$\operatorname{rank}(A) = 1$ or $\operatorname{rank}(A)=2$,$A$ is diagonalizable" hint="Analyze the possible eigenvalues and their implications for the determinant, rank, and diagonalizability." solution="Step 1: Analyze the conditions. $A$ is a $3 \times 3$ idempotent matrix. Its eigenvalues $(\lambda_1, \lambda_2, \lambda_3)$ can only be 0 or 1.

• $A \neq I$ implies not all eigenvalues are 1.


• $A \neq O$ implies not all eigenvalues are 0.

Therefore, the set of eigenvalues must be a mix of 0s and 1s.

Step 2: Evaluate each option.

• Option A: $\det(A) = 0$. The determinant is the product of eigenvalues. Since at least one eigenvalue must be 0 (because $A \neq I$), the product of eigenvalues will be 0. So, $\det(A)=0$. This statement is true.

• Option B: $\operatorname{rank}(A) = 1$ or $\operatorname{rank}(A)=2$. The rank equals the number of non-zero eigenvalues. The possible sets of eigenvalues are $\{1, 0, 0\}$ or $\{1, 1, 0\}$. In the first case, the rank is 1. In the second case, the rank is 2. The rank cannot be 3 (as $A \neq I$) or 0 (as $A \neq O$). This statement is true.

• Option C: $A$ is diagonalizable. A matrix is diagonalizable if its minimal polynomial has distinct linear factors. The eigenvalues of $A$ are roots of $\lambda^2 - \lambda = 0$. The minimal polynomial of an idempotent matrix must divide $x^2-x = x(x-1)$. Since the factors are distinct and linear, any idempotent matrix is diagonalizable. This statement is true.

• Option D: $A+I$ is idempotent. Let's check: $(A+I)^2 = A^2 + AI + IA + I^2 = A + A + A + I = 3A+I$. For $A+I$ to be idempotent, we need $3A+I = A+I$, which implies $2A=O$, or $A=O$. But we are given $A \neq O$. So this statement is false.

Result: The correct options are $\det(A) = 0$, $\operatorname{rank}(A) = 1$ or $\operatorname{rank}(A)=2$, and $A$ is diagonalizable.
"
:::

---

Summary

---

What's Next?

---

---

---

Part 4: Projection Matrix

Introduction

In our study of linear algebra, we frequently encounter the problem of finding the "best approximation" of a vector within a given subspace. The concept of projection provides a rigorous framework for this endeavor. A projection matrix is a linear transformation that maps a vector from a vector space onto a specified subspace. Geometrically, this operation finds the vector in the subspace that is closest to the original vector, effectively casting a "shadow" of the vector onto the subspace.

The study of projection matrices is of paramount importance in data analysis and machine learning. They form the theoretical bedrock of fundamental algorithms such as Ordinary Least Squares (OLS) regression, where we project a vector of observations onto the column space of a design matrix to find the best-fit coefficients. Understanding their properties—idempotence, symmetry, and their characteristic eigenvalues and eigenspaces—is not merely an academic exercise; it provides the necessary tools to analyze and solve complex problems that appear in the GATE examination. We shall explore these properties in detail, connecting the geometric intuition with the algebraic formulation.

---

Key Concepts

1. Projection onto a Line

Let us begin with the simplest case: projecting a vector onto a line. Consider a line in $\mathbb{R}^n$ that passes through the origin and is defined by the direction of a non-zero vector $\mathbf{a}$. We wish to find the projection of another vector, $\mathbf{b}$, onto this line.

The projection of $\mathbf{b}$ onto $\mathbf{a}$, which we denote as $\mathbf{p}$, will be some scalar multiple of $\mathbf{a}$. Let us write this as $\mathbf{p} = \hat{x}\mathbf{a}$ for some scalar $\hat{x}$. The defining property of an orthogonal projection is that the error vector, $\mathbf{e} = \mathbf{b} - \mathbf{p} = \mathbf{b} - \hat{x}\mathbf{a}$, must be orthogonal to the direction vector $\mathbf{a}$. This orthogonality condition is expressed as:

Expanding this expression, we have:

Solving for the scalar $\hat{x}$, we find:

Now, substituting this back into our expression for the projection $\mathbf{p}$:

To find the projection matrix $P$, we rearrange this expression to be of the form $\mathbf{p} = P\mathbf{b}$. Using the associativity of matrix multiplication, we can write:

From this, we identify the projection matrix $P$.

Line (Subspace U)


a


b


p = Pb


e = b-p

---

2. Projection onto a Subspace

We now generalize this concept to projection onto a $k$-dimensional subspace $U$ of $\mathbb{R}^n$. Let the subspace $U$ be spanned by a set of linearly independent vectors $\{\mathbf{a}_1, \mathbf{a}_2, \dots, \mathbf{a}_k\}$. We can form a matrix $A$ whose columns are these basis vectors: $A = [\mathbf{a}_1 | \mathbf{a}_2 | \dots | \mathbf{a}_k]$.

Any vector $\mathbf{p}$ in the subspace $U$ (the column space of $A$) can be written as a linear combination of the basis vectors, $\mathbf{p} = A\hat{\mathbf{x}}$ for some coefficient vector $\hat{\mathbf{x}} \in \mathbb{R}^k$. Similar to the line case, the error vector $\mathbf{b} - \mathbf{p} = \mathbf{b} - A\hat{\mathbf{x}}$ must be orthogonal to the subspace $U$. This means it must be orthogonal to every basis vector of $U$:

We can write these $k$ equations compactly in matrix form:

Distributing $A^T$, we obtain the normal equations:

Since the columns of $A$ are linearly independent, the matrix $A^TA$ is invertible. We can solve for the coefficient vector $\hat{\mathbf{x}}$:

The projected vector is $\mathbf{p} = A\hat{\mathbf{x}}$. Substituting the expression for $\hat{\mathbf{x}}$:

This gives us the general formula for the projection matrix.

A significant simplification occurs if the basis for the subspace is orthonormal. Let the columns of a matrix $Q = [\mathbf{q}_1 | \mathbf{q}_2 | \dots | \mathbf{q}_k]$ form an orthonormal basis for the subspace. By definition of orthonormality, $\mathbf{q}_i^T \mathbf{q}_j = 0$ for $i \neq j$ and $\mathbf{q}_i^T \mathbf{q}_i = 1$. This implies that the matrix $Q^TQ$ is the $k \times k$ identity matrix, $I_k$.

Substituting $Q$ for $A$ in the general formula:

This simplified form is extremely useful and frequently tested in GATE.

Worked Example:

Problem: Find the projection matrix onto the subspace of $\mathbb{R}^3$ spanned by the orthonormal vectors $\mathbf{q}_1$ and $\mathbf{q}_2$, where:

Solution:

Step 1: Form the matrix $Q$ with the given orthonormal vectors as its columns.

Step 2: Apply the formula $P = QQ^T$.

Step 3: Perform the matrix multiplication.

Step 4: Simplify the resulting matrix.

Answer:

---

3. Core Algebraic Properties of Projection Matrices

An orthogonal projection matrix $P$ possesses two defining algebraic properties.

Symmetry: $P^T = P$.

Let us prove this using the general formula $P = A(A^TA)^{-1}A^T$.

Idempotence: $P^2 = P$.

This property has a clear geometric meaning: projecting a vector that is already in the subspace does not change it. If we project $\mathbf{b}$ to get $\mathbf{p}$, projecting $\mathbf{p}$ again will still yield $\mathbf{p}$. Thus, $P(P\mathbf{b}) = P\mathbf{b}$, which implies $P^2\mathbf{b} = P\mathbf{b}$ for all $\mathbf{b}$, so $P^2 = P$.

Let us prove this algebraically for $P = A(A^TA)^{-1}A^T$:

---

4. Eigenvalues and Eigenspaces

The properties of a projection matrix are elegantly reflected in its eigenvalues and eigenvectors. Let $\lambda$ be an eigenvalue of $P$ with corresponding eigenvector $\mathbf{v} \neq \mathbf{0}$.

Now, let us apply the matrix $P$ again:

Using the idempotence property $P^2 = P$ and the eigenvalue definition $P\mathbf{v} = \lambda\mathbf{v}$:

Since $\mathbf{v}$ is a non-zero vector, we can conclude:

This shows that the only possible eigenvalues for a projection matrix are $\lambda = 0$ and $\lambda = 1$.

The eigenspaces associated with these eigenvalues have a direct geometric interpretation:
* Eigenvalue $\lambda = 1$: The eigenvectors for $\lambda=1$ are vectors that satisfy $P\mathbf{v} = 1 \cdot \mathbf{v} = \mathbf{v}$. These are precisely the vectors that are already in the subspace $U$ onto which we are projecting. Thus, the eigenspace for $\lambda=1$ is the column space of $P$, which is the subspace $U$.
* Eigenvalue $\lambda = 0$: The eigenvectors for $\lambda=0$ are vectors that satisfy $P\mathbf{v} = 0 \cdot \mathbf{v} = \mathbf{0}$. These are the vectors that are mapped to the zero vector by the projection. Geometrically, these are the vectors orthogonal to the subspace $U$. Thus, the eigenspace for $\lambda=0$ is the null space of $P$, which is the orthogonal complement of the column space, $U^\perp$.

---

---

#
## 5. Rank, Trace, and Determinant

The spectral properties of projection matrices lead to important relationships between their rank, trace, and determinant.

* Rank: The rank of a matrix is the dimension of its column space. For a projection matrix $P$ that projects onto a subspace $U$, we have $\operatorname{rank}(P) = \operatorname{dim}(U)$. The rank is also equal to the number of non-zero eigenvalues. Since the only non-zero eigenvalue is $1$, the rank is the multiplicity of the eigenvalue $\lambda = 1$.

* Trace: The trace of a square matrix is the sum of its diagonal elements, which is also equal to the sum of its eigenvalues. For a projection matrix $P \in \mathbb{R}^{n \times n}$ with rank $k$:

* Determinant: The determinant of a matrix is the product of its eigenvalues.

If the projection is onto a proper subspace of $\mathbb{R}^n$ (i.e., $U \neq \mathbb{R}^n$), then the dimension of the subspace $k < n$. This means there must be at least one eigenvalue equal to $0$. Consequently, the product of the eigenvalues will be $0$. The only exception is if $P$ projects onto the entire space $\mathbb{R}^n$, in which case $P$ is the identity matrix $I$, and its determinant is $1$.

* Singular Values: For a symmetric positive semi-definite matrix, the singular values are equal to its eigenvalues. An orthogonal projection matrix $P$ is symmetric ($P^T = P$) and positive semi-definite (since

). Therefore, the singular values of an orthogonal projection matrix are the same as its eigenvalues, which are either $0$ or $1$.

---

Problem-Solving Strategies

When faced with a problem involving a matrix that is described as a projection, or has the form $A=UU^T$ where $U$ has orthonormal columns, immediately recall its fundamental properties.

---

Common Mistakes

---

Practice Questions

:::question type="MCQ" question="Let $P \in \mathbb{R}^{4 \times 4}$ be the matrix that projects vectors onto a 2-dimensional subspace $U \subset \mathbb{R}^4$. Which of the following statements is necessarily true?" options=["$\det(P) = 1$","P is invertible","$\operatorname{tr}(P) = 2$","The nullity of P is 4"] answer="tr(P) = 2" hint="Relate the trace of a projection matrix to the dimension of the subspace it projects onto." solution="
Step 1: Recall the properties of a projection matrix $P$. The rank of $P$ is equal to the dimension of the subspace it projects onto.

Given that $U$ is a 2-dimensional subspace, we have $\operatorname{rank}(P) = 2$.

Step 2: A key property of projection matrices is that their trace is equal to their rank.

Therefore, $\operatorname{tr}(P) = 2$.

Step 3: Analyze the other options.

• Since the rank is 2, which is less than the matrix dimension 4, $P$ is not full rank. A non-full-rank matrix is singular (not invertible) and has a determinant of 0. So, $\det(P) = 0$ and P is not invertible.


• By the Rank-Nullity Theorem, $\operatorname{rank}(P) + \operatorname{nullity}(P) = 4$. Since $\operatorname{rank}(P) = 2$, the nullity is $4 - 2 = 2$.


• Thus, the only statement that is necessarily true is $\operatorname{tr}(P) = 2$.

Answer: \boxed{\operatorname{tr}(P) = 2}
"
:::

:::question type="NAT" question="Consider the vector $\mathbf{a} = \begin{bmatrix} 1 \\ 2 \\ -2 \end{bmatrix}$. Let $P$ be the projection matrix onto the line spanned by $\mathbf{a}$. What is the value of the trace of $P$?" answer="1" hint="The rank of a matrix projecting onto a line is always 1. The trace equals the rank." solution="
Step 1: Identify the subspace. The projection is onto a line spanned by a single non-zero vector $\mathbf{a}$. A line is a 1-dimensional subspace.

Step 2: The rank of a projection matrix is equal to the dimension of the subspace it projects onto.

Step 3: The trace of a projection matrix is equal to its rank.

Therefore, $\operatorname{tr}(P) = 1$.

Alternative Calculation:
We can also compute the matrix $P$ explicitly and find its trace.

Answer: \boxed{1}
"
:::

:::question type="MSQ" question="Let $\mathbf{q}_1, \mathbf{q}_2, \mathbf{q}_3$ be orthonormal vectors in $\mathbb{R}^7$. Let the matrix $M = \mathbf{q}_1\mathbf{q}_1^T + \mathbf{q}_2\mathbf{q}_2^T$. Which of the following statements is/are correct?" options=["The rank of $M$ is 2","M is an invertible matrix","The eigenvalues of $M$ are 0 and 1","$M^3 = M$"] answer="The rank of $M$ is 2,The eigenvalues of $M$ are 0 and 1,$M^3 = M$" hint="Recognize that M is a projection matrix onto the subspace spanned by q1 and q2. Then apply the properties of projection matrices." solution="
Step 1: Identify the matrix $M$. The matrix $M = \mathbf{q}_1\mathbf{q}_1^T + \mathbf{q}_2\mathbf{q}_2^T$ can be written as $M = QQ^T$, where $Q = [\mathbf{q}_1 \mid \mathbf{q}_2]$. Since $\mathbf{q}_1$ and $\mathbf{q}_2$ are orthonormal, $M$ is the orthogonal projection matrix onto the subspace spanned by these two vectors.

Step 2: Analyze the rank. The subspace is spanned by two orthonormal (and thus linearly independent) vectors. Therefore, the dimension of the subspace is 2. The rank of the projection matrix equals this dimension.

So, "The rank of $M$ is 2" is correct.

Step 3: Analyze invertibility. The matrix $M$ is a $7 \times 7$ matrix. Since its rank is 2, which is less than 7, the matrix is singular (not invertible). So, "M is an invertible matrix" is incorrect.

Step 4: Analyze eigenvalues. Since $M$ is a projection matrix, its eigenvalues can only be $0$ or $1$. The multiplicity of eigenvalue $1$ is the rank (2), and the multiplicity of eigenvalue $0$ is $n - \operatorname{rank} = 7 - 2 = 5$. So, "The eigenvalues of $M$ are 0 and 1" is correct.

Step 5: Analyze the property $M^3 = M$. The defining property of a projection matrix is idempotence, i.e., $M^2 = M$. We can use this to evaluate $M^3$.

So, "$M^3 = M$" is correct.
"
:::

:::question type="NAT" question="Let $P = \frac{1}{3} \begin{bmatrix} 2 & -1 & -1 \\ -1 & 2 & -1 \\ -1 & -1 & 2 \end{bmatrix}$ be a projection matrix. What is the dimension of the null space of $P$?" answer="1" hint="First find the rank of the matrix, which is equal to its trace. Then use the Rank-Nullity theorem." solution="
Step 1: The matrix $P$ is given as a projection matrix. We can find its rank by calculating its trace.

Step 2: The rank of a projection matrix is equal to its trace.

Step 3: The matrix $P$ is a $3 \times 3$ matrix, so it operates on $\mathbb{R}^3$. We apply the Rank-Nullity Theorem: $\operatorname{rank}(P) + \operatorname{nullity}(P) = n$.

Step 4: Solve for the nullity.

The dimension of the null space is the nullity of the matrix.

Answer: \boxed{1}
"
:::

---

Summary

---

What's Next?

---

---

---

Part 5: Partitioned Matrices

Introduction

In our study of linear algebra, we often encounter large matrices whose manipulation can be computationally intensive and conceptually cumbersome. A powerful technique for simplifying such problems is matrix partitioning, also known as blocking. This method involves dividing a matrix into smaller, more manageable sub-matrices called blocks or cells. By treating these blocks as individual elements, we can perform operations such as addition, multiplication, and inversion in a structured manner.

This approach is not merely a notational convenience; it often reveals underlying structures within the matrix and can lead to significant computational efficiencies. For the GATE examination, a firm understanding of how to operate on partitioned matrices—particularly multiplication and the calculation of determinants and inverses for special block structures—is essential for solving certain complex problems with elegance and speed. We will explore the fundamental operations and properties associated with these matrices.

---

Key Concepts

The primary utility of partitioned matrices arises from our ability to perform standard matrix operations at the block level, provided certain dimensional constraints are met.

1. Addition of Partitioned Matrices

Two matrices partitioned in the same way can be added block-by-block. Let us consider two matrices, $M$ and $N$, partitioned conformably:

For addition to be defined, the matrices $M$ and $N$ must have the same dimensions, and the corresponding blocks must also have the same dimensions (i.e., $A$ and $E$ are same-sized, $B$ and $F$, etc.). The sum is then computed as follows:

This is a direct extension of standard matrix addition.

2. Multiplication of Partitioned Matrices

Block matrix multiplication follows a rule analogous to the standard row-by-column matrix multiplication, but with blocks as elements. This is permissible only if the partitioning of the matrices is conformable for multiplication.

Consider two partitioned matrices $M$ and $N$ as defined above. For the product $MN$ to be defined, the number of columns in each block of a row of $M$ must match the number of rows in the corresponding block of a column of $N$. More simply, the column partitioning of the first matrix must match the row partitioning of the second matrix.

Worked Example:

Problem: Let matrices $M$ and $N$ be partitioned as follows:

Compute the product $MN$ using block multiplication.

Solution:

Step 1: Identify the blocks and their dimensions.
The partitioning gives:
$A = \begin{bmatrix} 1 & 2 \\ 0 & 1 \end{bmatrix}$, $B = \begin{bmatrix} 1 \\ 0 \end{bmatrix}$, $C = \begin{bmatrix} 1 & 0 \end{bmatrix}$, $D = \begin{bmatrix} 1 \end{bmatrix}$
$E = \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix}$, $G = \begin{bmatrix} 2 & 1 \end{bmatrix}$
The column partition of $M$ (2 columns, 1 column) matches the row partition of $N$ (2 rows, 1 row), so the multiplication is conformable.

Step 2: Apply the block multiplication formula.
The product $MN$ is partitioned as $\begin{bmatrix} AE+BG \\ CE+DG \end{bmatrix}$.

Step 3: Calculate the individual block products.

Step 4: Combine the results.

Step 5: Form the final partitioned matrix.

Answer:

---

3. Determinant and Inverse of Block Matrices

Calculating the determinant and inverse of a general partitioned matrix can be complex. However, for certain special structures, particularly block triangular and block diagonal matrices, the computations simplify considerably.

A block diagonal matrix is a partitioned matrix where the off-diagonal blocks are zero matrices.

A block triangular matrix has zero blocks either above or below the main block diagonal.

For these formulas to be applicable, the diagonal blocks $A$ and $D$ must be square matrices.

---

Problem-Solving Strategies

---

Common Mistakes

---

Practice Questions

:::question type="MCQ" question="Let $M = \begin{bmatrix} A & B \\ 0 & D \end{bmatrix}$, where $A = \begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix}$ and $D = \begin{bmatrix} 3 & 2 \\ 4 & 3 \end{bmatrix}$. What is the determinant of $M$?" options=["1", "2", "3", "4"] answer="1" hint="The matrix M is block upper triangular. The determinant of such a matrix is the product of the determinants of its diagonal blocks." solution="
Step 1: Identify the structure of matrix $M$.
$M$ is a block upper triangular matrix with diagonal blocks $A$ and $D$.

Step 2: Apply the formula for the determinant of a block triangular matrix.
The formula is $\det(M) = \det(A) \cdot \det(D)$.

Step 3: Calculate the determinant of block $A$.

Step 4: Calculate the determinant of block $D$.

Step 5: Compute the final determinant.

Result:
Answer: \boxed{1}
"
:::

:::question type="NAT" question="Consider the block diagonal matrix $P = \begin{bmatrix} A & 0 \\ 0 & B \end{bmatrix}$, where $A = \begin{bmatrix} 1 & 2 \\ 0 & 1 \end{bmatrix}$ and $B = \begin{bmatrix} 0.5 \end{bmatrix}$. If $P^{-1} = \begin{bmatrix} C & 0 \\ 0 & D \end{bmatrix}$, what is the sum of all elements in matrix $C$?" answer="0" hint="For a block diagonal matrix, the inverse is the block diagonal matrix of the inverses. Find the inverse of block A first." solution="
Step 1: Recall the formula for the inverse of a block diagonal matrix.
If $P = \begin{bmatrix} A & 0 \\ 0 & B \end{bmatrix}$, then $P^{-1} = \begin{bmatrix} A^{-1} & 0 \\ 0 & B^{-1} \end{bmatrix}$.
From the problem statement, $C = A^{-1}$.

Step 2: Calculate the inverse of matrix $A$.
For a $2 \times 2$ matrix $\begin{bmatrix} a & b \\ c & d \end{bmatrix}$, the inverse is $\frac{1}{ad-bc} \begin{bmatrix} d & -b \\ -c & a \end{bmatrix}$.
For $A = \begin{bmatrix} 1 & 2 \\ 0 & 1 \end{bmatrix}$:

Step 3: Identify matrix $C$.
$C = A^{-1} = \begin{bmatrix} 1 & -2 \\ 0 & 1 \end{bmatrix}$.

Step 4: Calculate the sum of all elements in $C$.
Sum = $1 + (-2) + 0 + 1 = 0$.

Result:
Answer: \boxed{0}
"
:::

:::question type="MSQ" question="Let $M = \left[ \begin{array}{cc|c} 1 & 0 & 2 \\ 0 & 1 & 3 \\ \hline 4 & 5 & 6 \end{array} \right] = \begin{bmatrix} I & A \\ B & C \end{bmatrix}$ and $N = \left[ \begin{array}{c} 1 \\ 1 \\ \hline 1 \end{array} \right] = \begin{bmatrix} X \\ Y \end{bmatrix}$. Which of the following statements are correct?" options=["The block multiplication $MN$ is conformable.", "The top block of the product $MN$ is $\begin{bmatrix} 3 \\ 4 \end{bmatrix}$.", "The bottom block of the product $MN$ is $\begin{bmatrix} 15 \end{bmatrix}$.", "The resulting matrix $MN$ is a $3 \times 1$ matrix."] answer="A,B,C,D" hint="First, check if the dimensions are conformable for block multiplication. Then, compute the product block by block using the formula $\begin{bmatrix} IX + AY \\ BX + CY \end{bmatrix}$." solution="
Statement A: Conformability
The column partition of $M$ is (2 columns | 1 column).
The row partition of $N$ is (2 rows | 1 row).
Since the partitions match, the block multiplication is conformable. Thus, statement A is correct.

Statement B & C: Block Multiplication
The product is $MN = \begin{bmatrix} I & A \\ B & C \end{bmatrix} \begin{bmatrix} X \\ Y \end{bmatrix} = \begin{bmatrix} IX + AY \\ BX + CY \end{bmatrix}$.
Let's identify the blocks:
$I = \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix}$, $A = \begin{bmatrix} 2 \\ 3 \end{bmatrix}$, $B = \begin{bmatrix} 4 & 5 \end{bmatrix}$, $C = \begin{bmatrix} 6 \end{bmatrix}$.
$X = \begin{bmatrix} 1 \\ 1 \end{bmatrix}$, $Y = \begin{bmatrix} 1 \end{bmatrix}$.

Top Block Calculation: $IX + AY$

Thus, statement B is correct.

Bottom Block Calculation: $BX + CY$

Thus, statement C is correct.

Statement D: Resulting Matrix Dimension
The final matrix is

This is a $3 \times 1$ matrix.
Thus, statement D is correct.

All four statements are correct.
"
:::

---

Summary

---

What's Next?

---

Chapter Summary

---

Chapter Review Questions

:::question type="MCQ" question="Let $P$ be a non-zero $n \times n$ matrix that is both orthogonal and idempotent. Which of the following statements is necessarily true about $P$?" options=["$P$ must be the identity matrix, $I$","$P$ must be the zero matrix, $O$","$P$ can be any non-zero projection matrix","$P$ is singular"] answer="A" hint="Use the defining properties of both matrix types. An orthogonal matrix is always invertible." solution="
A matrix $P$ is idempotent if it satisfies the relation $P^2 = P$.
A matrix $P$ is orthogonal if it satisfies the relation $P^T P = I$, which implies that $P$ is invertible and its inverse is $P^{-1} = P^T$.

Since $P$ is orthogonal, it is invertible. We can therefore pre-multiply the idempotent equation by $P^{-1}$:

Using the associative property of matrix multiplication, we get:

Since $P^{-1} P = I$, the equation simplifies to:


Thus, the only non-zero matrix that is simultaneously orthogonal and idempotent is the identity matrix. Option A is the correct conclusion.
Result:
Answer: \boxed{\text{A}}
"
:::

:::question type="NAT" question="A vector $v \in \mathbb{R}^3$ is projected onto the subspace spanned by the linearly independent vectors $u_1 = \begin{bmatrix} 1 \\ 1 \\ 0 \end{bmatrix}$ and $u_2 = \begin{bmatrix} 0 \\ 1 \\ 1 \end{bmatrix}$. If $P$ is the orthogonal projection matrix for this subspace, what is the value of the determinant of $P$?" answer="0" hint="Recall the relationship between the rank, eigenvalues, and determinant of a projection matrix. Direct computation of $P$ is not required." solution="
The matrix $P$ projects vectors from the 3-dimensional space $\mathbb{R}^3$ onto a 2-dimensional subspace (a plane spanned by $u_1$ and $u_2$).

Method 1: Using Properties of Projection Matrices

The rank of a projection matrix is equal to the dimension of the subspace onto which it projects. Here, the subspace is spanned by two linearly independent vectors, so its dimension is 2. Therefore, $\operatorname{rank}(P) = 2$.

The eigenvalues of any projection matrix can only be 0 or 1.

The number of eigenvalues equal to 1 is the rank of the matrix. Since $\operatorname{rank}(P) = 2$, the matrix $P$ has two eigenvalues equal to 1.

Since $P$ is a $3 \times 3$ matrix, it must have 3 eigenvalues in total. The remaining eigenvalue must be 0.

The determinant of a matrix is the product of its eigenvalues.

Therefore, the determinant of $P$ is 0.

Method 2: Direct Calculation (for verification)

Let $A = \begin{bmatrix} u_1 & u_2 \end{bmatrix} = \begin{bmatrix} 1 & 0 \\ 1 & 1 \\ 0 & 1 \end{bmatrix}$.
The projection matrix is $P = A(A^T A)^{-1} A^T$.

Since $P$ is formed from the product of non-square matrices, we cannot simply take individual determinants. However, we have established that $P$ is a singular matrix (its rank is 2, which is less than its dimension 3), and therefore its determinant must be 0.
Result:
Answer: \boxed{0}
"
:::

:::question type="MCQ" question="Consider the $5 \times 5$ block lower triangular matrix $M = \begin{bmatrix} A & O \\ C & D \end{bmatrix}$, where $A$ is a $3 \times 3$ idempotent matrix with $\operatorname{rank}(A)=2$, and $D$ is a $2 \times 2$ orthogonal matrix. What is the value of $\det(M)$?" options=["0","1","-1","Cannot be determined"] answer="A" hint="The determinant of a block triangular matrix is the product of the determinants of its diagonal blocks. Relate the rank of the idempotent matrix $A$ to its eigenvalues." solution="
The matrix $M$ is a block lower triangular matrix. The determinant of such a matrix is the product of the determinants of its diagonal blocks:

We must now determine $\det(A)$ and $\det(D)$.

Analysis of Matrix A:

• $A$ is a $3 \times 3$ idempotent matrix, which means $A^2 = A$.


• The eigenvalues of an idempotent matrix can only be 0 or 1.


• For an idempotent matrix, the rank is equal to the trace, which is also equal to the number of eigenvalues that are 1.


• We are given $\operatorname{rank}(A) = 2$. Therefore, $A$ has two eigenvalues equal to 1.


• Since $A$ is a $3 \times 3$ matrix, it has three eigenvalues in total. The third eigenvalue must be 0.


• The determinant of $A$ is the product of its eigenvalues: $\det(A) = 1 \times 1 \times 0 = 0$.

Analysis of Matrix D:

• $D$ is an orthogonal matrix. The determinant of any orthogonal matrix is either +1 or -1.

Calculating det(M):
Now we can compute the determinant of $M$:

Thus, the determinant of $M$ is 0.
Result:
Answer: \boxed{0}
"
:::

---

What's Next?