DEPARTMENT OF MATHEMATICS

ASSIGNMENT OF LINEAR ALGEBRA(ii)

Math’s(3043)

GROUP ASSIGNMENT
NAME ID NO SECTION
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
 1. Find the Eigen value and corresponding Eigen Vectors of the following matrices

4 0 1 5 0 1
A. −2 1 0 B. 1 1 0
−2 0 1 −7 1 0
Solution

4 0 1
A. Let's find the eigenvalues and corresponding eigenvectors of matrix A:

Matrix A: −2 1 0
−2 0 1
To find the eigenvalues, we solve the characteristic equation |A - λI| = 0, where λ is the
eigenvalue and I is the identity matrix.

4−  0 1
−2 1−  0
−2 0 1− 
The characteristic equation for A is:

(4-λ)((1-λ)(1-λ) - 0) - (-2)(0 - (-2)(1-λ)) + (-2)(0 - (-2)(0)) = 0

(4-λ)(λ2- 2λ + 1) + 4(1-λ) = 0
(4-λ)(λ2 - 2λ + 1) - 4(λ-1) = 0
(λ-2)(λ2 - 2λ + 1) = 0
The roots of this equation are λ = 2 (multiplicity 2) and λ = 1

To find the corresponding eigenvectors, we substitute each eigenvalue back into the equation
(A - λI)x = 0, where x is the eigenvector.

For λ = 2, we have:
(A - 2I)x = 0

2 0 1 1 0
−2 −1 0 2 = 0
−2 0 −1 3 0

2 1+ 3=0 => 1 = − 3/2

Simplifying the matrix equation:

-2 1 - 2 = 0 => 2 = -2x1
-2x1 - 3 = 0 => x3 = -2x1

Choosing x1 = 2 as a free parameter, we get the eigenvector for λ = 2 as: v1 = [2, -4, -2]

For λ = 1, we have:

3 0 1 1 0
(A - I)x = 0

−2 0 0 2 = 0
−2 0 0 3 0

2
 => x1 = - 3/3
Simplifying the matrix equation:
3x1 + x3 = 0
-2x1 = 0 => x1 = 0
-2x1 = 0 => x1 = 0
Choosing x1 = 3 as a free parameter, we get the eigenvector for λ = 1 as:
v2 = [0, 0, 3]

Therefore, the eigenvalues and corresponding eigenvectors of matrix A are:

Eigenvalue λ = 2, eigenvector v1 = [2, -4, -2]
Eigenvalue λ = 1, eigenvector v2 = [0, 0, 3]

B. Let's find the eigenvalues and corresponding eigenvectors of matrix B:

5 0 1
1 1 0
−7 1 0
Matrix B: .

To find the eigenvalues, we solve the characteristic equation |B - λI| = 0, where λ is the
eigenvalue and I is the identity matrix.

5−λ 0 1
1 1−λ 0
−7 1 0−λ
The characteristic equation for B is:

Expanding the determinant, we have: (5-λ)((1-λ)(-λ) - 0) - (1)(-7 - (-7)(1-λ)) + (0 - (-7)(1)) = 0

Simplifying the equation:

(5-λ)(λ2 - λ) + 14(1-λ) = 0

(5-λ)λ(λ-1) + 14(1-λ) = 0

The roots of this equation are λ = 5, λ = 1, and λ = 0.

To find the corresponding eigenvectors, we substitute each eigenvalue back into the equation
(B - λI)x = 0, where x is the eigenvector.

For λ = 5, we have:

0 0 1 1 0
1 −4 0 2 = 0
−7 1 −5 3 0
(B - 5I)x = 0

3
Simplifying the matrix equation:

x3 = 0

x1 - 4x2 = 0 => x1 = 4x2

-7x1 + x2 - 5x3 = 0 => -7x1 + x2 = 0 => -7(4x2) + x2 = 0 => -27x2 = 0 => x2 = 0

Choosing x2 = 1 as a free parameter, we get the eigenvector for λ = 5 as: v1 = [0, 1, 0]

For λ = 1, we have:

(B - I)x = 0

4 0 1 1 0
1 0 0 2 = 0
−7 1 −1 3 0
Simplifying the matrix equation:

4x1 + x3 = 0 => x1 = -x3/4

x2 = 0
-7x1 + x2 - x3 = 0
=> -7x1 - x3 = 0
=> -7(-x3/4) - x3 = 0
=> 7x3/4 - x3 = 0
=> (-7/4 + 1)x3 = 0
=> -3x3/4 = 0
=> x3 = 0

Choosing x1 = 4 as a free parameter, we get the eigenvector for λ = 1 as: v2 = [4, 0, 0]

For λ = 0, we have:
(B - 0I)x = 0

5 0 1 1 0
1 1 0 2 = 0
−7 1 0 3 0
Simplifying the matrix equation:

5x1 + x3 = 0
=> x1 = -x3/5
x1 + x2 = 0
=> x2 = -x1 = x3/5
-7x1 + x2 = 0
=> -7(-x3/5) + x3/5 = 0
=> 6x3/5 = 0
=> x3 = 0

4
Choosing x1 = 5 as a free parameter, we get the eigenvector for λ = 0 as: v3 = [5, -5, 0]
Therefore, the eigenvalues and corresponding eigenvectors of matrix B are:
Eigenvalue λ = 5, eigenvector v1 = v1 = [0, 1, 0]
Eigenvalue λ = 1, eigenvector v2 [4, 0, 0]
Eigen Value λ = 0, eigenvector v3 [5, -5, 0]

2. = + + + ⋯+ ℎ!" #!$ %" " &' " (% $) * +! )"!

corresponding power of A (where * so * = + * + * +⋯+ *

P(A) to be a matrix formed by replacing each power of t in P(t) with the

Show that if  is an Eigen value of A ,then one Eigen value of P(A) is P(  )

Solution
To prove this, let's consider the matrix A and its eigenvector v corresponding to the
eigenvalue λ:
A v=λv
Now, let's substitute A with its corresponding power in the polynomial P(t):
P(A) = C₀I + C₁A + C₂A² + ... + CₙAⁿ
Substituting A v with λ v in each term:
P(A) v = (C₀I + C₁A + C₂A² + ... + CₙAⁿ) v
= C₀I v + C₁A v + C₂A² v + ... + CₙAⁿ v
Since A v = λ v, we can replace Av with λ v:
P(A) v = C₀I v + C₁(λ v) + C₂(λ v)² + ... + Cₙ(λ v)ⁿ
= C₀I v + C₁λ v + C₂λ² v + ... + Cₙλⁿ v
= (C₀I + C₁λ + C₂λ² + ... + Cₙλⁿ) v
Now, let's consider the polynomial P(t) with its value at λ:
P(λ) = C₀ + C₁λ + C₂λ² + ... + Cₙλⁿ
Comparing P(A) v with (C₀ + C₁λ + C₂λ² + ... + Cₙλⁿ) v, we can see that they are equal:
P(A) v = (C₀ + C₁λ + C₂λ² + ... + Cₙλⁿ) v
Since v is an eigenvector of A with eigenvalue λ, we have: A v = λv
Therefore, we can rewrite the equation as:
P(A)v = P(λ)v
This shows that P(A) has an eigenvalue of P(λ) corresponding to the eigenvector v.
Hence, we have proved that if λ is an eigenvalue of matrix A, then P(A) has an
eigenvalue of P(λ).

1 −2 8
3. ,! * = 0 −1 0 then find i. * .
0 0 −1

0 = / 0 for all positive integers

Hint. For square matrices P & C in a fixed k. if c is invertible ,then
/

To find *10, we can use the given hint and diagonalizable matrix *
Solution

A. Let's follow the steps

Step 1: Find the matrix C and its inverse.
Since C needs to be invertible, we can choose C as the matrix A itself, and its inverse
will be A-1. So, C = A and C-1 = A-1.A:

5
 step 2: Compute C-1AC.
C-1AC = A-1AA = A-1A2 = A-1(AA) = A-1A2

A2 = A ×A =
Step 3: Compute A2.

Performing the matrix multiplication, we get:

A2 = [[11 + (-2)0 + 80, 1(-2) + (-2)(-1) + 80, 18 + (-2)0 + 8(-1)],

[1 + (-1)0 + 0, 0*(-2) + (-1)(-1) + 0, 8 + (-1)0 + 0(-1)],
[1 + 0 + (-1)0, 0(-2) + 0(-1) + (-1)0, 8 + 0 + (-1)(-1)]]
Simplifying, we have:

1 −4 0
A2 = 0 1 0
0 0 1

Step 4: Compute A-1.

To find A-1, we can calculate the inverse of matrix A. The inverse of A exists if the
determinant of A is non-zero.

To calculate the determinant of A, we have:

det(A) = 1 × ( (-1) × (-1) - 0 × 0) - (-2) × (0 × (-1) - 0 ×0) + 8 × (0 × 0 - (-1) × 0)

= 1 × (1 - 0) - (-2) × (0 - 0) + 8 × (0 - 0)
=1-0+0
=1

Since the determinant of A is non-zero, the inverse of A exists.

Now, we can calculate A-1 using standard methods or by using the following formula:

A-1 = (1/det(A)) × adj(A)

Where adj(A) is the ad joint of A.

The ad joint of A can be calculated by taking the transpose of the cofactor matrix of A.

Since A is a 3x3 matrix, we can calculate the ad joint as follows:

6
 11 12 13 2

21 22 23
31 32 33
adj(A) =

Where Cij is the cofactor of the element Aij.

To calculate the cofactors, we have:

C11 = (-1)^(1+1) * det([[1, 0], [0, -1]]) = (-1) * (1 * (-1) - 0 * 0) = -1

C12 = (-1)^(1+2) * det([[0, 0], [0, -1]]) = 1 * (0 * (-1) - 0 * 0) = 0
C13 = (-1)^(1+3) * det([[0, -1], [0, 0]]) = (-1) * (0 * 0 - (-1) * 0) = 0
C21 = (-1)^(2+1) * det([[0, 0], [0, -1]]) = 1 * (0 * (-1) - 0 * 0) = 0
C22 = (-1)^(2+2) * det([[1, 0], [0, -1]]) = (-1) * (1 * (-1) - 0 * 0) = -1
C23 = (-1)^(2+3) * det([[1, -2], [0, 0]]) = 1 * (1 * 0 - (-2) * 0) = 0

C31 = (-1)^(3+1) * det([[-2, 8], [0, -1]]) = (-1) * ((-2) * (-1) - 8 * 0) = -2

C32 = (-1)^(3+2) * det([[1, 8], [0, -1]]) = 1 * (1 * (-1) - 8 * 0) = -1
C33 = (-1)^(3+3) * det([[1, -2], [0, -1]]) = (-1) * (1 * (-1) - (-2) * 0) = -1

Now, we can form the adjugate matrix:

11 12 13 2

21 22 23
31 32 33
adj(A) =

Plugging in the values we calculated earlier:

−1 0 −2
adj(A) = 0 −1 −1
0 0 −1

Step 5: Compute A-1.

Using the formula A^(-1) = (1/det(A)) * adj(A), we can calculate A-1:

−1 0 −2
A = 0 −1 −1
0 0 −1
-1

Step 6: Compute A^10.

Now that we have A^(-1), we can find A10 using the formula provided in the hint:
(C-1PC)n = C-1PnC.

7
 In this case, P is A, and C is also A. Thus:

(C-1)PC)n = (A-1)AA)n = A-1AnA

Since n = 10, we have:

A10 = A-1A10A

−1 0 −2 1 −2 8
Substituting the values:

0 −1 −1 0 −1 0
0 0 −1 0 0 −1
Performing the matrix multiplication, we get:

A10 = [[-1×1 + 0×0 + (-2)0, -1(-2) + 0× (-1) + (-2)0, -1×8 + 0×0 + (-2)(-1)],
[0×1 + (-1)0 + (-1)0, 0(-2) + (-1)(-1) + (-1)0, 0×8 + (-1)0 + (-1)(-1)],
[0×1 + 0×0 + (-1)0, 0(-2) + 0(-1) + (-1)0, 0×8 + 0×0 + (-1)(-1)]]

Simplifying, we obtain:

1 −2 −6
0 1 0
0 0 1
10
A =

Therefore, the matrix A10 is:

1 −2 −6
0 1 0
0 0 1
A10 =

A and determine / * .
4. Determine the whether A is diagonalizable .If so find a matrix C that diagonalizable

1 0 0
0 1 1
0 1 1
A=

Solution

To determine if matrix A is diagonalizable, we need to check if it has a full set of linearly

independent eigenvectors. Let's find the eigenvalues and eigenvectors of matrix A first.

8
Given matrix A:

1 0 0
0 1 1
0 1 1
A=

To find the eigenvalues, we solve the characteristic equation det(A - λI) = 0, where I is the
identity matrix:

1−λ 0 1
1 1−λ 0
−7 1 1−λ
Expanding along the third row, we get:

(1-λ)((1-λ)(1-λ) - 0) - 1(0 - 0) + (0 - 1)(0 - 0) = 0

(1-λ)((1-λ)2) = 0

(1-λ)(λ2 - 2λ + 1) = 0

(1-λ)(λ-1)2 = 0

So, the eigenvalues are λ1 = 1 with algebraic multiplicity 2 and λ2 = 1 with algebraic
multiplicity 1.

Now, let's find the eigenvectors corresponding to each eigenvalue.

For λ = 1:

(A - I)v = 0, where v is the eigenvector corresponding to λ = 1.

0 0 0 0
0 0 1 4' 4 = 0
0 1 0 5 0
From the second row, y = 0. From the third row, z = 0. So, the eigenvector corresponding to
λ = 1 is [0, 0, 0].

Since there is only one linearly independent eigenvector for the eigenvalue λ = 1, matrix A
is not diagonalizable.

Since A is not diagonalizable, we cannot find a matrix C that diagonalizes A.

9
Say True or False .Justify your answer
a. If A is diagonalizable , then A has n different Eigen values.
If A is diagonalizable, then A has n different eigenvalues.
False. A matrix can be diagonalizable even if it has repeated
eigenvalues. Diagonalizability depends on the linearly independent
eigenvectors, not the distinct eigenvalues.
b. If A is invertible ,then A is diagonalizable.
False. An invertible matrix does not guarantee diagonalizability.
Diagonalizability depends on the eigenvectors, and an invertible matrix
may not have a complete set of linearly independent eigenvectors.
c. If A is diagonalizable & B is similar to A , then B is diagonalizable
True. Similar matrices have the same eigenvalues. If A is
diagonalizable, it means it has a complete set of linearly independent
eigenvectors. Since B is similar to A, it also has the same eigenvectors,

d. If A is n by n matrix and A is similar to n by n matrix B ,then *6 is similar

and therefore, B is diagonalizable.

to 7 6
True. Similar matrices have the same eigenvalues. If A is similar to B, it
means they have the same eigenvectors. Taking the transpose of both
matrices does not change the eigenvalues or eigenvectors, so A^T and

e. If A is n by n matrix A and *6 have the same Eigen values .

B^T will also be similar

True. The eigenvalues of a matrix and its transpose are the same. The
characteristic polynomial of a matrix and its transpose are identical,

f. If A is invertible & similar B ,then B is invertible & */ is similar to 7 /

resulting in the same eigenvalues.

True. Similar matrices have the same eigenvalues, and if A is invertible,

it means it has nonzero eigenvalues. Since B is similar to A, it also has
the same nonzero eigenvalues. Therefore, B is invertible. Furthermore,
the inverse of a similar matrix also corresponds to the inverse of the
original matrix, so A^(-1) is similar to B^(-1).

10