VIETNAM GENERAL CONFEDERATION OF LABOUR

TON DUC THANG UNIVERSITY

FACULTY OF MATHEMATICS AND STATISTICS

LINEAR ALGEBRA
FINAL REPORT

Student: Huỳnh Thiên Mẫn

Code: 241807004

Major: Applied Mathematics

Lecturer: Dr.Le Thi Ngoc Giau

TP. HỒ CHÍ MINH, THANG 9 NĂM 2024

 CONTENT
1. Problem 6 2
2. Problem 7 3
3. Problem 8 4
4. Problem 9 6
5. Problem 10 6
6. Problem 11 7
7. Problem 12 8
8. Jordan Exercise 9
9. Báo Cáo Nhóm 1 15
9.1. Huỳnh Thiên Mẫn 15
Application of Linear System 15
I. Network Analysis 15
II. Design of Traffic Patterns 16
III. Balancing Chemical Equation 17
IV. Polynomial Interpolation 18
THEOREM 1.9.1 Polynomial Interpolation (phần nợ) 19
V. Approximate Integration 20
VI. Leontief Input-Output Models 21
THEOREM 1.10.1 (phần nợ) 22
9.2. Trần Gia Huy 23
9.3. Phạm Thùy Trang 24

1
1. Problem 6

Let � be an � × � matrix, prove that det �� − � has the form:

det �� − � = �� + ��−1 ��−1 + ��−2 ��−2 + … + �1 � + �0 �0 , �1, …, �� ∈ ℝ

Solution:

We have the classical adjoint of �, denoted by ��� �, is the transpose of the matrix of cofactors.
� ��� � = ���� �
In particular, setting � = �� − �, it follows that
�� − � ��� �� − � = � � �
where � � = ��� �� − � is the characteristic polynomial. Since � � is an �th-order
polynomial, it follows that ���(�� − �) is a matrix polynomial of order � − 1. Thus, we can
write:
��� �� − � = �0 + �1 � + �2 �2 + … + �� ��−1
where �0 , �1 , …, ��−1 are � × � matrices. Inserting the above result into eq. (11) and using eq.
(4), one obtains:
�� − � �0 + �1 � + �2�2 + … + �� ��−1 = �� + ��−1 �� + ��−1 �� + … + �1 � + �� �

=> ��0 = �� �
=>− ��−1 + ��� = ��−� � � = 1, 2, … , � − 1
=>− ��−1 = �
So that, we get:
� � = �� + �1 ��−1 + �2 ��−2 + … + �� � + �� �
= ��0 + − �0 + �1 � � + �1 + �2 �2 + … + − ��−2 + ��−1 � ��−1 − ��−1 ��
= � �0 − �0 + �2 �1 − �1 + �3 �2 − �2 + … + ��−1 ��−2 − ��−2 + �� ��−1 − ��−1
=0
which completes the proof of the Cayley-Hamilton theorem.

2
2. Problem 7

Let ��1 , ��2 , …, �� be the eigenspaces of an � × � matrix.

�
Let �1, �2 , …, �� be bases corresponding to ��1 , ��2 , …, �� . Prove if �=1 �� = � then � is
diagonizable.

Solution:
�
Let �1 , �2 , …, �� be the number of vectors of �1 , �2 , …, �� , � = �=1 �� , then � is a set which has �
vectors, denotes � = ��1 , ��2 , …, �1 �1 , �2 1 , �2 2 , …, �2 �2 , …, ��1 , ��2 , …, ���

Put � = ��1 |��2 |…|�1 �1 |�2 1|�2 2 |…|��� |

So we have:

�� = � ��1 |��2 |…|�1 �1 |�2 1 |�2 2 |…|��� = ���1 |���2 |…|��1 �1 |��2 1 |��2 2 |…|����

For each �� � � = 1, �� it is an element of bases, then ��� is an eigenvector of �, that is for each �� � ,
we have a �� such that ���� = �� ���

Therefore,
�� = �1 ��1 �1 ��2 … �1 �1 �1 �2 �2 1 �2 �2 2 … �� ���
�1 0 ⋯ 0 ⋯ 0
0 �1 ⋯ ⋮ ⋮ ⋮
⋮ ⋮ ⋱ 0 ⋯ 0
= ��1 |��2 |…|�1 �1 |�2 1 |�2 2 |…|���
0 0 ⋯ �2 ⋮ ⋮
⋮ ⋮ ⋯ ⋯ ⋱ ⋮
0 ⋯ 0 ⋯ 0 ��
= �� (� is a � × � diagonal matrix)
Then � = ���−1 , we conclude that � is diagonalizable.

3
3. Problem 8

Let equation

�1 �2 ��
� − �1 � − �2 … � − �� = 0, where �1 + �2 + … + �� = �

a) Show that dim ��� ≤ ��

b) Prove that if ∃�, dim ��� < �� , then � is not diagonalizable.

Solution:

a) Suppose dim ��� = �, then there are � eigenvector ��1 , ��2 , …, ��� corresponding �� such
that ���� = ���� , � = 1, �

We choose any � − � vectors ���+1 , ���+2 , …, �� ∈ ℝ� , such that ��1 , ��2 , …, ��� , ���+1 , …, �� is
linearly independent, denote � = ��1 , ��2 , …, ��� , ���+1 , …, ��

Put the matrix � = ���+1 |���+2 |…|�� � such that ���� = ��� � , � = � + 1, �

We denote � is the upper matrix of � with size � × � − � and � is the below matrix of �
�
with size � − � × � − � , that is: � =
�

We examine:

��� − � �

= ��� − � �� 1 ��� − � �� 3 …| ��� − � �� � | ��� − � �� �+1|…| ��� − � �� �

= ��� − �� �� 1 ��� − �� �� 3 … ��� − �� �� � ��� − �� �� �+1 − ����+1 |…| ��� − �� �

� − � � �� −�
= �
0 ���−� − �

Since the column vectors of � are linearly independent, then � ≠ 0, we write:

1 1 � − �� �� −� 1
��� − � = ��� − � � = ��� − � � = �
� � 0 ���−� − � �

We will use a useful formula for the determinant of block matrices:

� �
= det � det �
0 �

Then

4
 � − � � �� −� � �
= � − �� ���−� − � = � − �� ���−� − �
0 ���−� − �

We find the eigenvalues of � by solving the equation:

�
��� − � = 0 ⇔ � − �� ���−� − �

� ��
Thus if � = �� , then � − �� ���−� − � = � − �� it implies to � ≤ ��

We conclude that dim ��� ≤ ��

b) Using contradiction:

5
4. Problem 9

Let � be an � × � matrix, �� ∙ �� = � ∙ �. For all �, � ∈ ℝ� , prove that � is orthogonal.

Solution:

Suppose that � is a square matrix such that �� ∙ �� = � ∙ � �, � ∈ ℝ� .

Let �� denote the �-th standard basis vector for ℝ� , and let �� denote the �-th column of �, as
above. Then

1 �� � = �
��� �� = ��� � ��� = ��� ∙ ��� = �� ∙ �� =
0 �� � ≠ �

So that the columns of A are an orthonormal set, and A is an orthogonal matrix.

5. Problem 10

If � is a finite-dimensional subspace of an inner product space �, and if � is a vector in �, prove

that ����� � is the best approximation to � from � in the sense that

� − ����� � < � − �

for every vector � in � that is different from ����� �.

Solution:

∀� ∈ �, we have:

� − � = � − ����� � + � − ������

2 2 2
=> � − � = � − ����� � + � − ����� �

If � ≠ ����� �, it follows that the second term in this sum is positive, and hence that

2 2
� − ������ < �−�

=> � − ����� � < � − �

6
6. Problem 11

Let � be an � × � matrix, � = �1 , �2 , …, �� be the set of column vectors of �, � = ���� � .

Put �' = �1 , �2 , …, �� as the largest set in � that is linearly independent. Prove that ���� �' =
�.

Solution:

7
7. Problem 12

Let the vector space �, � be an � × � matrix, and the system equation �� = �, prove that if there
exists �0 ∈ ℝ� such that �� ��0 = �� �, then �0 = ����� �, where � is the column space of �.

Solution:

Suppose x0 is the least-squares solution of the equation

Ax  b
We need to prove that x0 is a solution to the equation
AT Ax  AT b
We have:
Ax0  projW b
=> b  Ax0  b  projW b .
Multiplying both sides of the equation by AT we get:
AT  b  Ax0   AT b  projW b  .
We also have:
ℝ� = � ⊕ �⊥
=> ℝ� = ����� ⊕ ������ = � ⊕ ������
=> W   NullAT .
We have:
b  projW b  W 
=> b  projW b  NullA T .
And
AT  b  projW b   0 .
Therefore,
AT Ax0  AT b .
Suppose x0 is a solution to the equation AT Ax  AT b .
We need to prove x0 is the least-squares solution to the equation Ax  b .
Indeed,
AT Ax0  AT b .
=> AT  b  Ax0   0 .
Thus,
b  Ax0  NullAT  W 
But we also have: Ax0  W and b  Ax0  b  Ax0 .
Thus, Ax0  projW b .

8
8. Jordan Exercise

1 −1 1 1 0
0 1 0 0 0
�= 0 0 2 1 1
0 0 0 2 0
0 0 0 0 2

Solution:

We have the characteristic polynomial

� − 1 −1 1 1 0
0 �−1 0 0 0
2 3
�� � = det �� − � = 0 0 �−2 1 1 = �−1 �−2
0 0 0 �−2 0
0 0 0 0 �−2
2 2
�� � = � − 1 �−2

 For � = 1
Let � = � − �

0 −1 1 1 0
0 0 0 0 0
Ker � = Ker 0 0 −1 1 1 = Ker �, 0,0,0,0 � : � ∈ ℂ = 1,0,0,0,0
0 0 0 −1 0
0 0 0 0 −1

0 −1 1 1 0 0 −1 1 1 0
0 0 0 0 0 0 0 0 0 0
Ker �2 = Ker 0 0 −1 1 1 0 0 −1 1 1
0 0 0 −1 0 0 0 0 −1 0
0 0 0 0 −1 0 0 0 0 −1

0 0 −1 0 1
0 0 0 0 0
= Ker 0 0 1 −2 −2 �, �, 0,0,0 � : �, � ∈ ℂ = 1,0,0,0,0 � , 0,1,0,0,0 �

0 0 0 1 0
0 0 0 0 1

Basic of �2 � = 0

We have:

�1 = 1,0,0,0,0 � , �2 = 0,1,0,0,0 �

We consider:

9
 0 −1 1 1 0 1
0 0 0 0 0 0
�2−1 �1 = 0 0 −1 1 1 0 =0
0 0 0 −1 0 0
0 0 0 0 −1 0

 This is not eigenvector.

0 −1 1 1 0 0
0 0 0 0 0 1
�2−1 �2 = 0 0 −1 1 1 0 ≠0
0 0 0 −1 0 0
0 0 0 0 −1 0

 This is eigenvector.

Now, we will create a chain of Jordan for eigenvector �2 .

0
1
�1 = �2 = 0
0
0

−1
0
�2 = ��1 = 0
0
0

Basic of �� = 0

We have:
�
�1 = 1,0,0,0,0

We consider:

1 0 0 0 0 1
0 1 0 0 0 0
�1−1 �1 = 0 0 1 0 0 0 ≠0
0 0 0 1 0 0
0 0 0 0 1 0

10
 1
0
�1 = �1 = 0
0
0

 For � = 2
Let ℎ = 2� − �

1 −1 1 1 0
0 1 0 0 0
Ker ℎ = Ker 0 0 0 1 1
0 0 0 0 0
0 0 0 0 0
1 −1 1 1 0
0 1 0 0 0
= Ker 0 0 0 1 1
0 0 0 0 0
0 0 0 0 0

= Ker � − �, 0, − �, �, � � : � ∈ ℂ = 1,0,1,0,0 , −1,0,0, − 1,1

1 −1 1 1 0 1 −1 1 1 0
0 1 0 0 0 0 1 0 0 0
Ker ℎ2 = Ker 0 0 0 1 1 0 0 0 1 1
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0

1 −2 1 2 1
0 1 0 0 0
= Ker 0 0 0 0 0 −� − 2� − �, 0, �, �, � � : �, �, � ∈ ℂ
0 0 0 0 0
0 0 0 0 0

= 1,0,1,0,0 , 0,0,0,1,0 , −1,0,0,0,1

Basic of ℎ2 � = 0

We have:

�1 = 1,0,1,0,0 � , �2 = 0,0,0,1,0 � , �3 = −1,0,0,0,1 �

We consider:

11
 1 −1 1 1 0 1
0 1 0 0 0 0
ℎ2−1 �1 = 0 0 0 1 1 1 =0
0 0 0 0 0 0
0 0 0 0 0 0

 This is not eigenvector.

1 −1 1 1 0 0
0 1 0 0 0 0
�2−1 �2 = 0 0 0 1 1 0 ≠0
0 0 0 0 0 1
0 0 0 0 0 0

 This is eigenvector.

1 −1 1 1 0 −1
0 1 0 0 0 0
�2−1 �3 = 0 0 0 1 1 0 ≠0
0 0 0 0 0 0
0 0 0 0 0 1

 This is eigenvector.

Now, we will create a chain of Jordan for eigenvector �2 .

0
0
�1 = �2 = 0
1
0

−1
0
�2 = ��1 = 0
0
0

Now, we will create a chain of Jordan for eigenvector �3 .

−1
0
�1 = �3 = 0
0
1

12
 −1
0
�2 = ��1 = 1
0
0

Basic of ℎ� = 0

We have:

�1 = 1,0,1,0,0 � , �2 = −1,0,0, − 1,1 �

We consider:

1 0 0 0 0 1
0 1 0 0 0 0
ℎ1−1 �1 = 0 0 1 0 0 1 ≠0
0 0 0 1 0 0
0 0 0 0 1 0

Now, we will create a chain of Jordan for eigenvector �1 .

1
0
�1 = �1 = 1
0
0

Now, we will create a chain of Jordan for eigenvector �2 .

1 0 0 0 0 −1
0 1 0 0 0 0
ℎ1−1 �2 = 0 0 1 0 0 0 ≠0
0 0 0 1 0 −1
0 0 0 0 1 1
−1
0
�1 = �2 = 0
−1
1
−1 0 1 0 −1
0 1 0 0 0
�= 0 0 1 0 0
0 0 0 1 −1
0 0 0 0 1

13
 −1 0 1 1 −1
0 1 0 0 0
�−1 = 0 0 1 0 0
0 0 0 1 −1
0 0 0 0 1

1 1 0 0 0
0 1 0 0 0
=> � = �−1 �� = 0 0 2 1 0
0 0 0 2 0
0 0 0 0 2

14
9. Báo Cáo Nhóm 1
9.1. Huỳnh Thiên Mẫn
Application of Linear System
In this section we will discuss some brief applications of linear systems:
I. Network Analysis

15
II. Design of Traffic Patterns

16
III.Balancing Chemical Equation

17
IV. Polynomial Interpolation

18
  THEOREM 1.9.1 Polynomial Interpolation (phần nợ)
Given any � points in the ��-plane that have distinct �-coordinates, there is a unique polynomial
of degree � − 1 or less whose graph passes through those points.
Proof:
We need to prove the polynomial interpolation has existence and unique.

19
V. Approximate Integration

20
VI. Leontief Input-Output Models
Remark 1: Suppose the open sector of an economy (the sector that does not produce outputs)
wants the economy to supply it with goods, products, and utilities with monetary values.

The column vector � that has these numbers as successive components is called the outside
demand vector.

Since the product-producing sectors consume some of their own output, the monetary value of
their output must cover their own needs plus the outside demand.

The column vector � that has these monetary value numbers as successive components is
called the production vector for the economy.

By multiplying � by the consumption matrix � for the economy, whose columns are the inputs
required for each output, we obtain ��, the portion of the production vector � that will be
consumed by the productive sectors.

The vector �� is called the intermediate demand vector for the economy. Once the
intermediate demand is met, the portion of the production that is left to satisfy the outside
demand is � − ��.

Thus � must satisfy the equation � − �� = �, which we find convenient to rewrite as

�−� �=�

21
 Remark 2: In the case where an open economy has � product-producing sectors, the
consumption matrix, production vector, and outside demand vector have the form
�11 �12 ⋯ �1� �1 �1
�21 �21 ⋯ �2� �2 �2
�= ⋮ ⋮ ⋮ ,� = ⋮ ,� = ⋮
��1 ��2 ⋯ ��� �� ��
where all entries are nonnegative and
��� = the monetary value of the output of the �th sector that is needed by the �th sector to
produce one unit of output.
�� = the monetary value of the output of the �th sector.
�� = the monetary value of the output of the �th sector that is required to meet the demand of
the open sector.

 THEOREM 1.10.1 (phần nợ)

If � is the consumption matrix for an open economy, and if all of the column sums are less
than 1, then the matrix � − � is invertible, the entries of � − � −1 are nonnegative, and the
economy is productive.
Proof:

If � has row sums less than 1 then �� has column sums less than 1.

Therefore
−1
(� − ��) is invertible and � − �� entries are nonnegative.

Since

� − � � = �� − � � �
= � − �� �

−1
then � − � is invertible and � − � = �� − � � � −1
= �� − � � −1 �
that has nonnegative
entries.

22
9.2. Trần Gia Huy

23
9.3. Phạm Thùy Trang

24