Eigenvalues and Eigenvectors

Overview

In our study of linear algebra, we now advance from the mechanics of matrix operations to the intrinsic properties that govern their behavior. This chapter introduces the foundational concepts of eigenvalues and eigenvectors, which are arguably among the most significant in all of engineering mathematics. For a given square matrix representing a linear transformation, its eigenvectors are the non-zero vectors whose direction remains unchanged by the transformation. The corresponding eigenvalue is the scalar factor by which the eigenvector is stretched or compressed. This fundamental relationship, expressed as $A\vec{v} = \lambda\vec{v}$, provides profound insight into the nature of the matrix $A$.

The importance of this topic for the GATE examination cannot be overstated. Questions involving eigenvalues and eigenvectors appear consistently, testing not only the ability to perform the necessary computations but also a deeper conceptual understanding of their properties. A thorough command of these concepts is essential for solving problems related to matrix diagonalization, determining matrix powers, and analyzing the properties of systems represented by matrices. We shall systematically develop the methods for finding these values and vectors and then explore the powerful theorems that simplify complex problems.

For the computer science engineer, these concepts are not merely abstract mathematical tools. They form the theoretical underpinnings of numerous critical algorithms in fields such as machine learning, network analysis, and computer graphics. From Principal Component Analysis (PCA) for dimensionality reduction to Google's PageRank algorithm for web searching, the principles we will establish in this chapter are directly applicable to solving real-world computational problems. Our focus, however, will remain on building the rigorous mathematical foundation required to excel in the GATE.

---

Chapter Contents

| # | Topic | What You'll Learn |
|---|-------|-------------------|
| 1 | Characteristic Equation | Solving for eigenvalues using characteristic polynomials. |
| 2 | Properties and Applications | Leveraging key theorems for efficient problem-solving. |

---

Learning Objectives

---

We now turn our attention to Characteristic Equation...
## Part 1: Characteristic Equation

Introduction

In the study of linear algebra, a primary objective is to understand the fundamental properties of a linear transformation as represented by a square matrix. Among the most significant of these properties are the eigenvalues and eigenvectors. The gateway to determining these intrinsic values is the characteristic equation. This polynomial equation, derived from the matrix itself, encapsulates the essential information about how the matrix scales vectors. The roots of this equation, the eigenvalues, are critical in a vast array of applications, from analyzing the stability of systems and performing principal component analysis to solving systems of differential equations.

For the GATE examination, a firm grasp of formulating and solving the characteristic equation is indispensable. While the direct calculation for small matrices is fundamental, a deeper understanding of the properties of the characteristic polynomial and its relationship to matrix invariants like trace and determinant provides powerful shortcuts for solving complex problems efficiently. We shall explore the formulation, properties, and advanced techniques related to the characteristic equation, focusing on methods that are particularly effective in a competitive examination setting.

---

Key Concepts

#
## 1. Formulation of the Characteristic Equation

The construction of the characteristic equation is a procedural task. Let us consider a square matrix $A$ of order $n$. The term $\lambda I$ represents the identity matrix $I$ scaled by a scalar variable $\lambda$. This results in a matrix with $\lambda$ on its main diagonal and zeros elsewhere. The matrix $(A - \lambda I)$ is formed by subtracting $\lambda$ from each of the diagonal elements of $A$.

For a general $2 \times 2$ matrix, the process is as follows:

Let $A = \begin{pmatrix} a & b \\ c & d \end{pmatrix}$.

Then, $A - \lambda I = \begin{pmatrix} a & b \\ c & d \end{pmatrix} - \lambda \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} = \begin{pmatrix} a-\lambda & b \\ c & d-\lambda \end{pmatrix}$.

The characteristic equation is $\det(A - \lambda I) = 0$, which yields:

We observe that $(a+d)$ is the trace of $A$, and $(ad-bc)$ is the determinant of $A$. This leads to a more general property.

#
## 2. Properties of the Characteristic Polynomial

For an $n \times n$ matrix $A$, its characteristic polynomial $p(\lambda) = \det(A - \lambda I)$ has several important properties that are frequently exploited in the GATE exam.

Degree: The characteristic polynomial is of degree $n$. Consequently, an $n \times n$ matrix has exactly $n$ eigenvalues, counting multiplicities (which may be real or complex).

Coefficients: The coefficients of the characteristic polynomial are related to the invariants of the matrix. For a polynomial of the form $p(\lambda) = (-1)^n [\lambda^n - c_{n-1}\lambda^{n-1} + \dots + c_0]$, we find that:

* The sum of the eigenvalues is equal to the trace of the matrix: $\sum_{i=1}^{n} \lambda_i = \text{trace}(A)$.
* The product of the eigenvalues is equal to the determinant of the matrix: $\prod_{i=1}^{n} \lambda_i = \det(A)$.

Worked Example:

Problem: Find the characteristic equation for the matrix $A = \begin{pmatrix} 2 & 1 & 1 \\ 1 & 2 & 1 \\ 0 & 0 & 1 \end{pmatrix}$.

Solution:

Step 1: Calculate the trace of $A$.

Step 2: Calculate the minors of the diagonal elements.

The sum of the minors is $M_{11} + M_{22} + M_{33} = 2 + 2 + 3 = 7$.

Step 3: Calculate the determinant of $A$. Expanding along the third row for simplicity:

Step 4: Substitute these values into the formula for the characteristic equation of a $3 \times 3$ matrix.

Answer: The characteristic equation is $\lambda^3 - 5\lambda^2 + 7\lambda - 3 = 0$. We can also note that the sum of the eigenvalues will be 5, and their product will be 3.

---

#
## 3. The Cayley-Hamilton Theorem

This remarkable theorem establishes a fundamental relationship between a matrix and its characteristic equation.

This theorem is immensely useful for computing higher powers of a matrix and for finding the inverse of a matrix. To find $A^{-1}$, we can write:

This is valid only if $c_0 = \det(A) \neq 0$, which is the condition for the matrix to be invertible.

---

#
## 4. Eigenvalues of Special Matrix Structures

For the GATE exam, recognizing special matrix structures is a critical time-saving skill. A common structure is a matrix that can be expressed as a linear combination of the identity matrix $I$ and the all-ones matrix $J$.

Combining these two properties allows for the immediate determination of eigenvalues for any matrix of the form $A = aJ + bI$. The eigenvalues of such a matrix are:

• $an + b$, with a multiplicity of 1.
• $a(0) + b = b$, with a multiplicity of $n-1$.

Worked Example:

Problem: Find the eigenvalues of the matrix $A = \begin{pmatrix} 2 & 3 & 3 \\ 3 & 2 & 3 \\ 3 & 3 & 2 \end{pmatrix}$.

Solution:

Step 1: Decompose the matrix $A$ into the form $aJ + bI$.

We can write $A$ as:

The first matrix can be written as $3(J-I)$, where $J$ is the all-ones matrix and $I$ is the identity matrix.

Step 2: Identify the parameters $a$, $b$, and $n$.

Here, $a=3$, $b=-1$, and $n=3$.

Step 3: Apply the formula for the eigenvalues of $aJ + bI$.

The first eigenvalue is $an+b$:

The other eigenvalues are equal to $b$:

Answer: The eigenvalues are $8, -1, -1$. This method avoids the calculation of a $3 \times 3$ determinant entirely. The matrix from the PYQ, $\begin{pmatrix} 0 & 1 & 1 & 1 \\ 1 & 0 & 1 & 1 \\ 1 & 1 & 0 & 1 \\ 1 & 1 & 1 & 0 \end{pmatrix}$, is a direct application of this principle with $n=4, a=1, b=-1$. Its eigenvalues are $1(4)-1=3$ and $-1$ (with multiplicity 3). The largest is 3.

---

Problem-Solving Strategies

---

Common Mistakes

---

Practice Questions

:::question type="MCQ" question="What is the characteristic equation for the matrix $A = \begin{pmatrix} 4 & 1 \\ -2 & 1 \end{pmatrix}$?" options=["$\lambda^2 - 5\lambda + 6 = 0$","$\lambda^2 + 5\lambda + 6 = 0$","$\lambda^2 - 5\lambda - 6 = 0$","$\lambda^2 + 6\lambda + 5 = 0$"] answer="$\lambda^2 - 5\lambda + 6 = 0$" hint="Use the formula $\lambda^2 - \text{trace}(A)\lambda + \det(A) = 0$." solution="
Step 1: Calculate the trace of matrix A.

Step 2: Calculate the determinant of matrix A.

Step 3: Substitute these values into the characteristic equation formula for a 2x2 matrix.

Result: The correct characteristic equation is $\lambda^2 - 5\lambda + 6 = 0$.
"
:::

:::question type="NAT" question="Consider the matrix $M = \begin{pmatrix} 2 & 2 & 2 \\ 2 & 2 & 2 \\ 2 & 2 & 2 \end{pmatrix}$. The value of the largest eigenvalue of the matrix $P = M - 3I$ is _________." answer="3" hint="Recognize that matrix M is a multiple of the all-ones matrix, J. Find the eigenvalues of M first, then use the property for eigenvalues of $M-kI$." solution="
Step 1: Identify the structure of matrix M.
The matrix $M$ can be written as $2J$, where $J$ is the $3 \times 3$ all-ones matrix.

Step 2: Find the eigenvalues of $J_3$.
For an $n \times n$ all-ones matrix, the eigenvalues are $n$ (multiplicity 1) and $0$ (multiplicity $n-1$).
For $J_3$ (where $n=3$), the eigenvalues are $3$ and $0$ (with multiplicity 2).

Step 3: Find the eigenvalues of $M = 2J_3$.
If the eigenvalues of $J_3$ are $\lambda_i$, the eigenvalues of $2J_3$ are $2\lambda_i$.
So, the eigenvalues of $M$ are $2 \times 3 = 6$ and $2 \times 0 = 0$ (with multiplicity 2).

Step 4: Find the eigenvalues of $P = M - 3I$.
If the eigenvalues of $M$ are $\mu_i$, the eigenvalues of $M-3I$ are $\mu_i - 3$.
The eigenvalues of $P$ are:

The eigenvalues of $P$ are $3, -3, -3$.

Step 5: Identify the largest eigenvalue.
The largest eigenvalue is 3.

Result: The value of the largest eigenvalue of the matrix $P$ is 3.
"
:::

:::question type="MSQ" question="Let $p(\lambda) = \lambda^3 - 6\lambda^2 + 11\lambda - 6 = 0$ be the characteristic equation of a $3 \times 3$ matrix $A$. Which of the following statements is/are necessarily true?" options=["The determinant of A is 6.","The trace of A is -6.","The eigenvalues of A are 1, 2, and 3.","The matrix A is invertible."] answer="The determinant of A is 6.,The eigenvalues of A are 1, 2, and 3.,The matrix A is invertible." hint="Compare the given polynomial with the general form $\lambda^3 - (\text{trace})\lambda^2 + \dots - (\det) = 0$. Factorize the polynomial to find its roots (the eigenvalues)." solution="
Let the general characteristic equation be $\lambda^3 - (\text{trace}(A))\lambda^2 + C\lambda - \det(A) = 0$.

Comparing this with the given equation $p(\lambda) = \lambda^3 - 6\lambda^2 + 11\lambda - 6 = 0$:

Trace: The coefficient of $\lambda^2$ is $-(\text{trace}(A)) = -6$. Therefore, $\text{trace}(A) = 6$. So, the statement "The trace of A is -6" is false.

Determinant: The constant term is $-\det(A) = -6$. Therefore, $\det(A) = 6$. So, the statement "The determinant of A is 6" is true.

Eigenvalues: We need to find the roots of the polynomial $\lambda^3 - 6\lambda^2 + 11\lambda - 6 = 0$. By inspection, we can test integer factors of 6.

- For $\lambda=1$: $1 - 6 + 11 - 6 = 0$. So, $(\lambda-1)$ is a factor.
- For $\lambda=2$: $8 - 6(4) + 11(2) - 6 = 8 - 24 + 22 - 6 = 0$. So, $(\lambda-2)$ is a factor.
- For $\lambda=3$: $27 - 6(9) + 11(3) - 6 = 27 - 54 + 33 - 6 = 0$. So, $(\lambda-3)$ is a factor.
The roots are 1, 2, and 3. The statement "The eigenvalues of A are 1, 2, and 3" is true.

Invertibility: A matrix is invertible if and only if its determinant is non-zero. Since $\det(A) = 6 \neq 0$, the matrix $A$ is invertible. The statement "The matrix A is invertible" is true.

Therefore, the correct options are (A), (C), and (D).
"
:::

:::question type="NAT" question="For the matrix $A = \begin{pmatrix} 1 & 0 & 3 \\ 2 & 4 & -1 \\ 0 & 0 & 5 \end{pmatrix}$, the product of its eigenvalues is _________." answer="20" hint="The product of eigenvalues is equal to the determinant of the matrix. What is a special property of this matrix that simplifies finding the determinant?" solution="
Step 1: Recall the property relating eigenvalues and the determinant.
The product of the eigenvalues of a matrix is equal to its determinant.

Step 2: Identify the type of matrix.
The given matrix $A = \begin{pmatrix} 1 & 0 & 3 \\ 2 & 4 & -1 \\ 0 & 0 & 5 \end{pmatrix}$ is an upper triangular matrix.

Step 3: Calculate the determinant of the triangular matrix.
The determinant of a triangular matrix (either upper or lower) is the product of its diagonal elements.

Step 4: Conclude the product of eigenvalues.
Since the product of eigenvalues equals the determinant, the product is 20.
Alternatively, for a triangular matrix, the eigenvalues are the diagonal elements themselves: $\lambda_1 = 1, \lambda_2 = 4, \lambda_3 = 5$. Their product is $1 \times 4 \times 5 = 20$.

Result: The product of the eigenvalues is 20.
"
:::

---

Summary

---

What's Next?

---

---

Part 2: Properties and Applications

Introduction

The study of eigenvalues and eigenvectors is a cornerstone of linear algebra, providing deep insight into the structure and behavior of matrices and the linear transformations they represent. For a given square matrix, an eigenvector represents a direction that remains unchanged (up to scaling) when the linear transformation is applied. The corresponding eigenvalue is the scalar factor by which the eigenvector is stretched or compressed. This seemingly simple relationship, encapsulated in the equation $AX = \lambda X$, has profound implications.

In the context of the GATE examination, a firm grasp of the properties of eigenvalues and eigenvectors is indispensable. These concepts are not merely abstract; they form the basis for solving problems related to matrix powers, systems of differential equations, graph theory, and principal component analysis. Our focus here will be on the core algebraic properties and their direct applications in a problem-solving context, equipping us with the necessary tools to approach GATE questions with both efficiency and accuracy.

---

Key Concepts and Properties

We will now explore the fundamental properties of eigenvalues and eigenvectors that are most frequently tested in competitive examinations.

#
## 1. The Characteristic Equation

To find the eigenvalues of a matrix $A$, we begin with the defining equation $AX = \lambda X$. This can be rewritten as:

Introducing the identity matrix $I$ of the same dimension as $A$, we have:

This is a system of homogeneous linear equations. For a non-trivial (i.e., non-zero) solution for $X$ to exist, the matrix $(A - \lambda I)$ must be singular. A square matrix is singular if and only if its determinant is zero. This gives us the characteristic equation.

Worked Example:

Problem: Find the eigenvalues of the matrix $A = \begin{bmatrix} 4 & 1 \\ 2 & 3 \end{bmatrix}$.

Solution:

Step 1: Set up the characteristic equation $\det(A - \lambda I) = 0$.

Step 2: Calculate the determinant of $(A - \lambda I)$.

Step 3: Set the determinant to zero and solve the resulting polynomial for $\lambda$.

Step 4: Identify the roots, which are the eigenvalues.

Answer: The eigenvalues are $5$ and $2$.

---

#
## 2. Sum of Eigenvalues and the Trace of a Matrix

A remarkably useful property connects the sum of the eigenvalues directly to the sum of the elements on the main diagonal of the matrix. This sum is known as the trace.

Worked Example:

Problem: The matrix $A = \begin{bmatrix} 2 & 9 & 5 \\ 1 & 6 & 7 \\ -4 & 3 & -1 \end{bmatrix}$ has three eigenvalues. What is their sum?

Solution:

Step 1: Identify the property that the sum of eigenvalues equals the trace of the matrix.

Step 2: Identify the elements on the main diagonal of matrix $A$. The diagonal elements are $2, 6,$ and $-1$.

Step 3: Calculate the trace by summing these elements.

Answer: The sum of the eigenvalues is $7$.

This property is particularly useful in graph theory. The trace of the adjacency matrix of a graph is equal to the number of self-loops in the graph. Therefore, the sum of the eigenvalues of an adjacency matrix is simply the count of its self-loops.

---

#
## 3. Product of Eigenvalues and the Determinant of a Matrix

Another powerful property relates the product of the eigenvalues to the determinant of the matrix.

Worked Example:

Problem: Find the product of the eigenvalues of the matrix $A = \begin{bmatrix} 1 & 0 & 2 \\ 2 & -1 & 3 \\ 4 & 1 & 8 \end{bmatrix}$.

Solution:

Step 1: Recall that the product of eigenvalues is equal to the determinant of the matrix.

Step 2: Calculate the determinant of the $3 \times 3$ matrix $A$. We can expand along the first row.

Step 3: Evaluate the $2 \times 2$ determinants.

Answer: The product of the eigenvalues is $1$.

---

#
## 4. Eigenvalues of Powers of a Matrix

The relationship between the eigenvalues of a matrix $A$ and its powers, such as $A^k$, is straightforward and frequently tested.

Worked Example:

Problem: The eigenvalues of matrix $A = \begin{bmatrix} 1 & 2 \\ 2 & 1 \end{bmatrix}$ are $3$ and $-1$. Find the eigenvalues of the matrix $A^4$.

Solution:

Step 1: Identify the eigenvalues of matrix $A$.

Step 2: Apply the property that the eigenvalues of $A^k$ are $\lambda_i^k$. Here, $k=4$.

The first eigenvalue of $A^4$ is $\lambda_1^4$.

The second eigenvalue of $A^4$ is $\lambda_2^4$.

Answer: The eigenvalues of $A^4$ are $81$ and $1$.

---

Problem-Solving Strategies

---

Common Mistakes

---

Practice Questions

:::question type="NAT" question="A $3 \times 3$ matrix $A$ is known to have eigenvalues $-2, 3,$ and $5$. What is the trace of the matrix $A^2$?" answer="38" hint="First, find the eigenvalues of $A^2$ using the properties of eigenvalues of matrix powers. Then, recall the relationship between the trace and the sum of eigenvalues." solution="
Step 1: Let the eigenvalues of $A$ be $\lambda_1 = -2$, $\lambda_2 = 3$, and $\lambda_3 = 5$.

Step 2: The eigenvalues of the matrix $A^2$ are the squares of the eigenvalues of $A$. Let the eigenvalues of $A^2$ be $\lambda_1', \lambda_2', \lambda_3'$.

Step 3: The trace of a matrix is the sum of its eigenvalues. Therefore, $\text{tr}(A^2)$ is the sum of the eigenvalues of $A^2$.

Result: The trace of $A^2$ is 38.
"
:::

:::question type="MCQ" question="Consider the matrix $M = \begin{bmatrix} 2 & 7 & 1 \\ 0 & -1 & 3 \\ 0 & 0 & 4 \end{bmatrix}$. What is the product of the eigenvalues of $M$?" options=["$-8$","$5$","$8$","$0$"] answer="$-8$" hint="Recall the property relating the product of eigenvalues to the determinant. Also, consider the properties of triangular matrices." solution="
Step 1: The product of the eigenvalues of a matrix is equal to its determinant.

Step 2: The given matrix $M$ is an upper triangular matrix. The determinant of a triangular (upper or lower) matrix is the product of its main diagonal elements.

Step 3: Identify the main diagonal elements of $M$. They are $2, -1,$ and $4$.

Step 4: Calculate the product of the diagonal elements to find the determinant.

Result: The product of the eigenvalues is $-8$.
"
:::

:::question type="MCQ" question="Which of the following vectors is an eigenvector of the matrix $A = \begin{bmatrix} 5 & 4 \\ 1 & 2 \end{bmatrix}$?" options=["$\begin{bmatrix} 1 \\\\ 1 \end{bmatrix}$","$\begin{bmatrix} 4 \\\\ -1 \end{bmatrix}$","$\begin{bmatrix} 1 \\\\ 4 \end{bmatrix}$","$\begin{bmatrix} 2 \\\\ 1 \end{bmatrix}$"] answer="$\begin{bmatrix} 4 \\\\ -1 \end{bmatrix}$" hint="Use the verification method: check if $AX = \lambda X$ for each option vector $X$." solution="
We will test each option by computing $AX$.

Option A: Let $X = \begin{bmatrix} 1 \\ 1 \end{bmatrix}$.

The result $\begin{bmatrix} 9 \\ 3 \end{bmatrix}$ is not a scalar multiple of $\begin{bmatrix} 1 \\ 1 \end{bmatrix}$. So, this is not an eigenvector.

Option B: Let $X = \begin{bmatrix} 4 \\ -1 \end{bmatrix}$.

Now, we check if $\begin{bmatrix} 16 \\ 2 \end{bmatrix}$ is a scalar multiple of $\begin{bmatrix} 4 \\ -1 \end{bmatrix}$. We see that $4 \times \begin{bmatrix} 4 \\ -1 \end{bmatrix} = \begin{bmatrix} 16 \\ -4 \end{bmatrix}$, which is not the result. Let us re-check the calculation. Ah, there appears to be a mistake in the problem-solver's analysis. Let us re-evaluate. Is $\begin{bmatrix} 16 \\ 2 \end{bmatrix} = \lambda \begin{bmatrix} 4 \\ -1 \end{bmatrix}$? From the first component, $16 = \lambda \cdot 4 \implies \lambda = 4$. From the second component, $2 = \lambda \cdot (-1) \implies \lambda = -2$. Since $\lambda$ is not consistent, this is not an eigenvector.

Let's re-examine the eigenvalues of A.
$\det(A-\lambda I) = (5-\lambda)(2-\lambda) - 4 = 10 - 7\lambda + \lambda^2 - 4 = \lambda^2 - 7\lambda + 6 = (\lambda-6)(\lambda-1) = 0$.
So $\lambda=6$ and $\lambda=1$.
For $\lambda=1$: $(A-I)X=0 \implies \begin{bmatrix} 4 & 4 \\ 1 & 1 \end{bmatrix} \begin{bmatrix} x \\ y \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix} \implies x+y=0$. An eigenvector is $\begin{bmatrix} 1 \\ -1 \end{bmatrix}$.
For $\lambda=6$: $(A-6I)X=0 \implies \begin{bmatrix} -1 & 4 \\ 1 & -4 \end{bmatrix} \begin{bmatrix} x \\ y \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix} \implies -x+4y=0 \implies x=4y$. An eigenvector is $\begin{bmatrix} 4 \\ 1 \end{bmatrix}$.

Let us correct the options in the question to reflect a correct answer. Let's change option B to $\begin{bmatrix} 4 \\ 1 \end{bmatrix}$ and re-solve.

Corrected Question: Which of the following vectors is an eigenvector of the matrix $A = \begin{bmatrix} 5 & 4 \\ 1 & 2 \end{bmatrix}$?
Options: ["$\begin{bmatrix} 1 \\\\ 1 \end{bmatrix}$","$\begin{bmatrix} 4 \\\\ 1 \end{bmatrix}$","$\begin{bmatrix} 1 \\\\ 4 \end{bmatrix}$","$\begin{bmatrix} 2 \\\\ 1 \end{bmatrix}$"] answer="$\begin{bmatrix} 4 \\\\ 1 \end{bmatrix}$"

Solution (with corrected option):
We test the corrected option B: Let $X = \begin{bmatrix} 4 \\ 1 \end{bmatrix}$.

Now, we check if $\begin{bmatrix} 24 \\ 6 \end{bmatrix}$ is a scalar multiple of $\begin{bmatrix} 4 \\ 1 \end{bmatrix}$. We can see that $6 \times \begin{bmatrix} 4 \\ 1 \end{bmatrix} = \begin{bmatrix} 24 \\ 6 \end{bmatrix}$. Since $AX = 6X$, the vector $\begin{bmatrix} 4 \\ 1 \end{bmatrix}$ is an eigenvector with a corresponding eigenvalue of $\lambda = 6$. " :::

:::question type="MSQ" question="Let $A = \begin{bmatrix} 1 & 3 \\ 4 & 2 \end{bmatrix}$. Which of the following statements is/are correct?" options=["The sum of the eigenvalues is 3.","The product of the eigenvalues is -10.","The matrix $A$ is singular.","The eigenvalues of $A-3I$ are $2$ and $-4$."] answer="The sum of the eigenvalues is 3.,The product of the eigenvalues is -10.,The eigenvalues of $A-3I$ are $2$ and $-4$." hint="Evaluate each statement using the properties of trace, determinant, and eigenvalue transformations." solution="
Statement 1: The sum of the eigenvalues is 3.
The sum of eigenvalues is equal to the trace of the matrix.
$\text{tr}(A) = 1 + 2 = 3$.
This statement is correct.

Statement 2: The product of the eigenvalues is -10.
The product of eigenvalues is equal to the determinant of the matrix.
$\det(A) = (1)(2) - (3)(4) = 2 - 12 = -10$.
This statement is correct.

Statement 3: The matrix $A$ is singular.
A matrix is singular if its determinant is 0. Since $\det(A) = -10 \neq 0$, the matrix is non-singular.
This statement is incorrect.

Statement 4: The eigenvalues of $A-3I$ are $2$ and $-4$.
First, let's find the eigenvalues of $A$.
$\det(A-\lambda I) = (1-\lambda)(2-\lambda) - 12 = 0$
$\lambda^2 - 3\lambda + 2 - 12 = 0$
$\lambda^2 - 3\lambda - 10 = 0$
$(\lambda - 5)(\lambda + 2) = 0$
The eigenvalues of $A$ are $\lambda_1 = 5$ and $\lambda_2 = -2$.
If $\lambda$ is an eigenvalue of $A$, then $\lambda - k$ is an eigenvalue of $A-kI$. Here, $k=3$.
The eigenvalues of $A-3I$ are:
$\lambda_1' = \lambda_1 - 3 = 5 - 3 = 2$
$\lambda_2' = \lambda_2 - 3 = -2 - 3 = -5$
The statement says the eigenvalues are 2 and -4. This is incorrect.

Let's re-read the question and my work. Ah, I made a calculation error for statement 4. The eigenvalue should be -5 not -4. Let me adjust the option to make it correct for the MSQ format. Let's make the option "The eigenvalues of $A-3I$ are $2$ and $-5$."
Re-evaluating Statement 4 (with corrected option): The eigenvalues of $A-3I$ are $2$ and $-5$.
As calculated above, the eigenvalues of $A$ are $5$ and $-2$. The eigenvalues of $A-3I$ are $5-3=2$ and $-2-3=-5$.
This statement is now correct.

Final Answer with corrected options: Statements 1, 2, and 4 are correct.
"
:::

---

Summary

---

What's Next?

---

Chapter Summary

In this chapter, we have developed a comprehensive understanding of eigenvalues and eigenvectors, which are fundamental concepts in linear algebra with wide-ranging applications in engineering and science. We began by defining the core relationship $A\mathbf{x} = \lambda\mathbf{x}$ and proceeded to establish the characteristic equation, $\det(A - \lambda I) = 0$, as the primary tool for determining the eigenvalues of a square matrix. Our discussion then explored the indispensable properties of eigenvalues and eigenvectors, providing powerful shortcuts for problem-solving. Finally, we examined the significance of the Cayley-Hamilton theorem and its utility in matrix computations. The key principles from our study are summarized below.

---

Chapter Review Questions

:::question type="MCQ" question="The characteristic equation of a $3 \times 3$ matrix $A$ is given by $\lambda^3 - 4\lambda^2 + 5\lambda - 2 = 0$. What is the determinant of the matrix $A^2$?" options=["2","4","8","16"] answer="B" hint="Recall the relationship between the eigenvalues of a matrix $A$ and the eigenvalues of $A^2$. Also, remember the property connecting the determinant and the product of eigenvalues." solution="
The characteristic equation for matrix $A$ is $p(\lambda) = \lambda^3 - 4\lambda^2 + 5\lambda - 2 = 0$. The roots of this equation are the eigenvalues of $A$.

Let the eigenvalues of $A$ be $\lambda_1, \lambda_2, \lambda_3$.
From the properties of eigenvalues, we know that the product of the eigenvalues is equal to the determinant of the matrix. For a polynomial $a\lambda^n + \dots + c\lambda + d = 0$, the product of the roots is $(-1)^n (d/a)$.
Here, $n=3$, $a=1$, and $d=-2$.

We are asked to find the determinant of $A^2$. A key property is that if $\lambda_1, \lambda_2, \lambda_3$ are the eigenvalues of $A$, then $\lambda_1^2, \lambda_2^2, \lambda_3^2$ are the eigenvalues of $A^2$.
Therefore, the determinant of $A^2$ is the product of its eigenvalues:

Alternatively, we can use the property $\det(A^k) = (\det(A))^k$.

Substituting the value of $\det(A)$:

Thus, the correct option is B.
"
:::

:::question type="NAT" question="Consider the matrix $M = \begin{pmatrix} 2 & 1 & 1 \\ 1 & 2 & 1 \\ 1 & 1 & 2 \end{pmatrix}$. The sum of the squares of the eigenvalues of $M$ is ________." answer="18" hint="The sum of the squares of the eigenvalues, $\sum \lambda_i^2$, is equal to the trace of $M^2$. Calculate $M^2$ first." solution="
Let the eigenvalues of the matrix $M$ be $\lambda_1, \lambda_2, \lambda_3$. We are asked to find the value of $\lambda_1^2 + \lambda_2^2 + \lambda_3^2$.

A crucial property of eigenvalues states that the sum of the squares of the eigenvalues of a matrix is equal to the trace of the square of that matrix.

First, we calculate the matrix $M^2$:



The trace of a matrix is the sum of its main diagonal elements.

Therefore, the sum of the squares of the eigenvalues of $M$ is 18.
"
:::

:::question type="MCQ" question="Which of the following vectors is an eigenvector of the matrix $A = \begin{pmatrix} 5 & 4 \\ 1 & 2 \end{pmatrix}$?" options=["$\begin{pmatrix} 4 \\ -1 \end{pmatrix}$","$\begin{pmatrix} 1 \\ 4 \end{pmatrix}$","$\begin{pmatrix} 1 \\ 1 \end{pmatrix}$","$\begin{pmatrix} 1 \\ -1 \end{pmatrix}$"] answer="A" hint="For each option vector $\mathbf{x}$, calculate $A\mathbf{x}$ and check if the result is a scalar multiple of $\mathbf{x}$, i.e., $A\mathbf{x} = \lambda\mathbf{x}$." solution="
To determine if a vector $\mathbf{x}$ is an eigenvector of matrix $A$, we must check if it satisfies the condition $A\mathbf{x} = \lambda\mathbf{x}$ for some scalar eigenvalue $\lambda$. We will test each option.

Option A: Let $\mathbf{x} = \begin{pmatrix} 4 \\ -1 \end{pmatrix}$.

Now, we check if $\begin{pmatrix} 16 \\ 2 \end{pmatrix}$ is a scalar multiple of $\begin{pmatrix} 4 \\ -1 \end{pmatrix}$.

From the first component, $16 = \lambda(4) \implies \lambda = 4$.
From the second component, $2 = \lambda(-1) \implies \lambda = -2$.
Since we get different values for $\lambda$, this is not an eigenvector. Let me re-calculate. Ah, wait. The question is which one IS an eigenvector. Let's re-calculate.
Let's find the eigenvalues first.
$\det(A - \lambda I) = (5-\lambda)(2-\lambda) - 4 = 10 - 7\lambda + \lambda^2 - 4 = \lambda^2 - 7\lambda + 6 = 0$.
$(\lambda-1)(\lambda-6) = 0$. Eigenvalues are $\lambda=1, 6$.

For $\lambda = 1$: $(A-I)\mathbf{x} = 0 \implies \begin{pmatrix} 4 & 4 \\ 1 & 1 \end{pmatrix}\begin{pmatrix} x_1 \\ x_2 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \end{pmatrix}$. This gives $x_1+x_2=0$, so an eigenvector is $\begin{pmatrix} 1 \\ -1 \end{pmatrix}$. This is option D.

For $\lambda = 6$: $(A-6I)\mathbf{x} = 0 \implies \begin{pmatrix} -1 & 4 \\ 1 & -4 \end{pmatrix}\begin{pmatrix} x_1 \\ x_2 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \end{pmatrix}$. This gives $x_1-4x_2=0$, so an eigenvector is $\begin{pmatrix} 4 \\ 1 \end{pmatrix}$. This is not an option.

Let me re-check the options and my work.
Option A: $\mathbf{x} = \begin{pmatrix} 4 \\ -1 \end{pmatrix}$.
$A\mathbf{x} = \begin{pmatrix} 5 & 4 \\ 1 & 2 \end{pmatrix} \begin{pmatrix} 4 \\ -1 \end{pmatrix} = \begin{pmatrix} 20-4 \\ 4-2 \end{pmatrix} = \begin{pmatrix} 16 \\ 2 \end{pmatrix}$.
Is $\begin{pmatrix} 16 \\ 2 \end{pmatrix} = \lambda \begin{pmatrix} 4 \\ -1 \end{pmatrix}$? No.

Ah, I must have made a mistake in the problem design. Let's correct the question's correct option to match my findings. Eigenvector for $\lambda=1$ is $\begin{pmatrix} 1 \\ -1 \end{pmatrix}$ (Option D). Eigenvector for $\lambda=6$ is $\begin{pmatrix} 4 \\ 1 \end{pmatrix}$. Let's make Option A $\begin{pmatrix} 4 \\ 1 \end{pmatrix}$.
Correction during thought process: The question should have a valid answer. Let's set the correct answer to be D based on the calculation for $\lambda=1$.

Let's re-write the solution for D.
Option D: Let $\mathbf{x} = \begin{pmatrix} 1 \\ -1 \end{pmatrix}$.

Here, we see that $A\mathbf{x} = 1 \cdot \mathbf{x}$.
This satisfies the condition $A\mathbf{x} = \lambda\mathbf{x}$ with $\lambda = 1$.
Therefore, $\begin{pmatrix} 1 \\ -1 \end{pmatrix}$ is an eigenvector of matrix $A$.

Final Answer to be reflected in the question attributes should be D.
Correction: The prompt asks me to create the content. I will change the option list to make option A the correct one, as originally intended in my scratchpad, for variety.

Let's re-create the question with a correct option A.
Let $A = \begin{pmatrix} 6 & -2 \\ -1 & 5 \end{pmatrix}$.
Characteristic eq: $(6-\lambda)(5-\lambda) - 2 = 0 \implies 30 - 11\lambda + \lambda^2 - 2 = 0 \implies \lambda^2 - 11\lambda + 28 = 0$.
$(\lambda-4)(\lambda-7)=0$. Eigenvalues are 4, 7.
For $\lambda=7$: $(A-7I)\mathbf{x} = 0 \implies \begin{pmatrix} -1 & -2 \\ -1 & -2 \end{pmatrix}\begin{pmatrix} x_1 \\ x_2 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \end{pmatrix}$.
$x_1+2x_2=0$. Eigenvector is $\begin{pmatrix} -2 \\ 1 \end{pmatrix}$ or $\begin{pmatrix} 2 \\ -1 \end{pmatrix}$.
For $\lambda=4$: $(A-4I)\mathbf{x} = 0 \implies \begin{pmatrix} 2 & -2 \\ -1 & 1 \end{pmatrix}\begin{pmatrix} x_1 \\ x_2 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \end{pmatrix}$.
$x_1-x_2=0$. Eigenvector is $\begin{pmatrix} 1 \\ 1 \end{pmatrix}$.

Let's change the matrix in the question to $A = \begin{pmatrix} 6 & -2 \\ -1 & 5 \end{pmatrix}$ and the options to:
A) $\begin{pmatrix} 1 \\ 1 \end{pmatrix}$ (Correct for $\lambda=4$)
B) $\begin{pmatrix} 2 \\ 1 \end{pmatrix}$
C) $\begin{pmatrix} 1 \\ -1 \end{pmatrix}$
D) $\begin{pmatrix} 1 \\ 2 \end{pmatrix}$

This works. I will use this revised question.

:::question type="MCQ" question="Which of the following vectors is an eigenvector of the matrix $A = \begin{pmatrix} 6 & -2 \\ -1 & 5 \end{pmatrix}$?" options=["$\begin{pmatrix} 1 \\ 1 \end{pmatrix}$","$\begin{pmatrix} 2 \\ 1 \end{pmatrix}$","$\begin{pmatrix} 1 \\ -1 \end{pmatrix}$","$\begin{pmatrix} 1 \\ 2 \end{pmatrix}$"] answer="A" hint="For an option vector $\mathbf{x}$, calculate the product $A\mathbf{x}$ and check if the result is a scalar multiple of $\mathbf{x}$ (i.e., $A\mathbf{x} = \lambda\mathbf{x}$)." solution="
To determine if a vector $\mathbf{x}$ is an eigenvector of matrix $A$, we must verify that it satisfies the equation $A\mathbf{x} = \lambda\mathbf{x}$ for some scalar eigenvalue $\lambda$. We will test each option.

Option A: Let $\mathbf{x} = \begin{pmatrix} 1 \\ 1 \end{pmatrix}$.

We can write the resulting vector as:

This is of the form $\lambda\mathbf{x}$ with $\lambda = 4$. Since the condition is satisfied, $\begin{pmatrix} 1 \\ 1 \end{pmatrix}$ is an eigenvector of $A$ with a corresponding eigenvalue of 4.

For completeness, let's check another option.
Option B: Let $\mathbf{x} = \begin{pmatrix} 2 \\ 1 \end{pmatrix}$.

There is no scalar $\lambda$ such that $\begin{pmatrix} 10 \\ 3 \end{pmatrix} = \lambda \begin{pmatrix} 2 \\ 1 \end{pmatrix}$, as $10 = 2\lambda \implies \lambda=5$, while $3 = 1\lambda \implies \lambda=3$. The values of $\lambda$ are inconsistent.

Thus, the correct option is A.
"
:::

:::question type="NAT" question="A $3 \times 3$ real matrix $P$ has a trace of 8 and a determinant of 12. If one of its eigenvalues is 2, what is the largest eigenvalue of the matrix $P$?" answer="6" hint="Use the properties relating the trace and determinant of a matrix to the sum and product of its eigenvalues." solution="
Let the eigenvalues of the $3 \times 3$ matrix $P$ be $\lambda_1, \lambda_2,$ and $\lambda_3$.
We are given the following information:

$\text{trace}(P) = 8$

$\det(P) = 12$

One eigenvalue is 2. Let's set $\lambda_1 = 2$.

We use the fundamental properties of eigenvalues:
The sum of eigenvalues equals the trace of the matrix.

The product of eigenvalues equals the determinant of the matrix.



Now we have a system of two equations with two unknowns, $\lambda_2$ and $\lambda_3$. We can form a quadratic equation with roots $\lambda_2$ and $\lambda_3$: $x^2 - (\text{sum of roots})x + (\text{product of roots}) = 0$.

Substituting the values from (1) and (2):

Using the quadratic formula to find the roots:

So, the other two eigenvalues are $\lambda_2 = 3 + \sqrt{3}$ and $\lambda_3 = 3 - \sqrt{3}$.

The three eigenvalues of matrix $P$ are $2$, $3 - \sqrt{3}$, and $3 + \sqrt{3}$.
We need to find the largest eigenvalue.

• $\lambda_1 = 2$


• $\lambda_2 = 3 - \sqrt{3} \approx 3 - 1.732 = 1.268$
  
  • $\lambda_3 = 3 + \sqrt{3} \approx 3 + 1.732 = 4.732$

    Wait, this doesn't result in an integer answer. GATE NAT questions are usually integers or simple decimals. Let me adjust the problem parameters.

    Let trace = 11, det = 30, one eigenvalue = 5.
    $\lambda_1 = 5$.
    $\lambda_1 + \lambda_2 + \lambda_3 = 11 \implies 5 + \lambda_2 + \lambda_3 = 11 \implies \lambda_2 + \lambda_3 = 6$.
    $\lambda_1 \lambda_2 \lambda_3 = 30 \implies 5 \lambda_2 \lambda_3 = 30 \implies \lambda_2 \lambda_3 = 6$.
    This gives $x^2 - 6x + 6 = 0$, same issue.

    Let trace = 9, det = 24, one eigenvalue = 3.
    $\lambda_1 = 3$.
    $3 + \lambda_2 + \lambda_3 = 9 \implies \lambda_2 + \lambda_3 = 6$.
    $3 \lambda_2 \lambda_3 = 24 \implies \lambda_2 \lambda_3 = 8$.
    $x^2 - 6x + 8 = 0 \implies (x-2)(x-4) = 0$.
    The other eigenvalues are 2 and 4.
    The three eigenvalues are 2, 3, 4. The largest is 4. This is a good NAT question.

    Let's try another one. Trace = 8, det = 12, one eigenvalue = 6.
    $\lambda_1 = 6$.
    $6 + \lambda_2 + \lambda_3 = 8 \implies \lambda_2 + \lambda_3 = 2$.
    $6 \lambda_2 \lambda_3 = 12 \implies \lambda_2 \lambda_3 = 2$.
    $x^2 - 2x + 2 = 0$. Roots are $x = \frac{2 \pm \sqrt{4-8}}{2} = 1 \pm i$. The eigenvalues are $6, 1+i, 1-i$. The question states it's a real matrix, which is fine as complex eigenvalues appear in conjugate pairs. The largest real eigenvalue is 6. The question just asks for the largest eigenvalue. This is ambiguous. Let's stick to the case with all real eigenvalues.

    The one with eigenvalues 2, 3, 4 seems good. Let's use that.
    Trace = 9, det = 24, one eigenvalue = 3. Largest eigenvalue = 4.

    Let's re-write the solution with these new numbers.
    The eigenvalues are $\lambda_1, \lambda_2, \lambda_3$.
    Given: $\text{trace}(P) = 9$, $\det(P) = 24$, and $\lambda_1 = 3$.
    Sum of eigenvalues: $\lambda_1 + \lambda_2 + \lambda_3 = 9 \implies 3 + \lambda_2 + \lambda_3 = 9 \implies \lambda_2 + \lambda_3 = 6$.
    Product of eigenvalues: $\lambda_1 \lambda_2 \lambda_3 = 24 \implies 3 \lambda_2 \lambda_3 = 24 \implies \lambda_2 \lambda_3 = 8$.
    We are looking for two numbers that sum to 6 and have a product of 8. These are 2 and 4.
    So, $\lambda_2 = 2$ and $\lambda_3 = 4$.
    The eigenvalues of matrix $P$ are $\{2, 3, 4\}$.
    The largest among these is 4.
    This is a much cleaner question.
    "
    :::

    ---

    What's Next?

    💡 Continue Your GATE Journey

    Having completed this chapter on Eigenvalues and Eigenvectors, you have established a firm foundation for several advanced topics in Engineering Mathematics. The concepts we have discussed are not isolated; rather, they form a crucial link between the fundamentals of matrix algebra and its application in solving complex engineering problems.

    Key connections to your learning path:

    • Relation to Previous Chapters: Our entire discussion was built upon the principles of Matrices and Determinants. The calculation of eigenvalues via the characteristic equation, $\det(A - \lambda I) = 0$, is a direct application of determinant theory. Similarly, eigenvectors are vectors within the Vector Spaces you have previously studied, representing special directions under a linear transformation.

    • Immediate Next Steps: The most direct extension of this chapter is Diagonalization of Matrices. We have seen that eigenvectors corresponding to distinct eigenvalues are linearly independent. This property is the cornerstone of diagonalization, a process that simplifies a matrix $A$ into the form $A = PDP^{-1}$, where $D$ is a diagonal matrix of eigenvalues. This technique is invaluable for efficiently computing powers of a matrix ($A^k$).

    • Future Applications in Engineering Mathematics: The methods developed here are indispensable for solving Systems of Linear Differential Equations. The solution to a system $\mathbf{y}' = A\mathbf{y}$ is constructed directly from the eigenvalues and eigenvectors of the matrix $A$. This application is a recurring theme in various engineering disciplines.

    • Broader Engineering Context: The significance of eigenvalues extends far beyond this course. In Mechanical Engineering, they determine the natural frequencies of vibrating systems. In Control Systems, they dictate the stability of a system. In Computer Science and Data Science, they are central to algorithms like Principal Component Analysis (PCA) for dimensionality reduction. A solid grasp of the material in this chapter will therefore be of great benefit in your core engineering subjects.