東京大学 新領域創成科学研究科 メディカル情報生命専攻 2022年8月実施 問題8
Author
zephyr
Description
(1) Describe the eigenvalues and eigenvectors of the following matrix. (λ \lambda λ is a real value.)
A λ = ( λ 1 1 1 λ 1 1 1 λ ) \mathbf{A}_\lambda = \begin{pmatrix}
\lambda & 1 & 1 \\
1 & \lambda & 1 \\
1 & 1 & \lambda
\end{pmatrix} A λ = λ 1 1 1 λ 1 1 1 λ
(2) What is the range of λ \lambda λ such that A λ \mathbf{A}_\lambda A λ is positive semidefinite.
(3) Consider an n × n n \times n n × n symmetric matrix where all diagonal elements are b b b and all non-diagonal elements are a a a . Show that this matrix is non-singular when ∣ b ∣ > ∣ ( n − 1 ) a ∣ |b| > |(n - 1)a| ∣ b ∣ > ∣ ( n − 1 ) a ∣ .
题目描述
对实参数 λ \lambda λ ,求矩阵
A λ = ( λ 1 1 1 λ 1 1 1 λ ) \mathbf A_\lambda=
\begin{pmatrix}
\lambda&1&1\\
1&\lambda&1\\
1&1&\lambda
\end{pmatrix} A λ = λ 1 1 1 λ 1 1 1 λ
的全部特征值及相应特征向量。
求使 A λ \mathbf A_\lambda A λ 为半正定矩阵的 λ \lambda λ 取值范围。
设一个 n × n n\times n n × n 对称矩阵的全部对角元均为 b b b ,全部非对角元均为 a a a 。证明当
∣ b ∣ > ∣ ( n − 1 ) a ∣ |b|>|(n-1)a| ∣ b ∣ > ∣ ( n − 1 ) a ∣
时该矩阵非奇异。
高对称矩阵的特征分解 :把全一方向与其正交补分开,求常对角、常非对角矩阵的两个特征值及特征空间。
半正定判定 :利用实对称矩阵全部特征值非负的充要条件,确定参数 λ \lambda λ 的范围。
严格对角占优 :由 ∣ b ∣ > ( n − 1 ) ∣ a ∣ |b|>(n-1)|a| ∣ b ∣ > ( n − 1 ) ∣ a ∣ 或等价谱表达证明零不可能成为特征值,从而得到非奇异性。
Kai
(1) Eigenvalues and Eigenvectors
To find the eigenvalues μ i \mu_i μ i of the matrix A λ \mathbf{A}_\lambda A λ , we need to solve the characteristic equation det ( A λ − μ I ) = 0 \det(\mathbf{A}_\lambda - \mu \mathbf{I}) = 0 det ( A λ − μ I ) = 0 .
A λ − μ I = ( λ − μ 1 1 1 λ − μ 1 1 1 λ − μ ) \mathbf{A}_\lambda - \mu \mathbf{I} = \begin{pmatrix}
\lambda - \mu & 1 & 1 \\
1 & \lambda - \mu & 1 \\
1 & 1 & \lambda - \mu
\end{pmatrix} A λ − μ I = λ − μ 1 1 1 λ − μ 1 1 1 λ − μ
Using the row addition method for simplification, we can add all rows to the first row:
∣ λ − μ 1 1 1 λ − μ 1 1 1 λ − μ ∣ = ∣ λ − μ + 1 + 1 1 + ( λ − μ ) + 1 1 + 1 + ( λ − μ ) 1 λ − μ 1 1 1 λ − μ ∣ = ∣ λ − μ + 2 λ − μ + 2 λ − μ + 2 1 λ − μ 1 1 1 λ − μ ∣ \begin{vmatrix}
\lambda - \mu & 1 & 1 \\
1 & \lambda - \mu & 1 \\
1 & 1 & \lambda - \mu
\end{vmatrix}
= \begin{vmatrix}
\lambda - \mu + 1 + 1 & 1 + (\lambda - \mu) + 1 & 1 + 1 + (\lambda - \mu) \\
1 & \lambda - \mu & 1 \\
1 & 1 & \lambda - \mu
\end{vmatrix}
= \begin{vmatrix}
\lambda - \mu + 2 & \lambda - \mu + 2 & \lambda - \mu + 2 \\
1 & \lambda - \mu & 1 \\
1 & 1 & \lambda - \mu
\end{vmatrix} λ − μ 1 1 1 λ − μ 1 1 1 λ − μ = λ − μ + 1 + 1 1 1 1 + ( λ − μ ) + 1 λ − μ 1 1 + 1 + ( λ − μ ) 1 λ − μ = λ − μ + 2 1 1 λ − μ + 2 λ − μ 1 λ − μ + 2 1 λ − μ
Now, we can absorb the common factor ( λ − μ + 2 ) (\lambda - \mu + 2) ( λ − μ + 2 ) from the first row:
= ( λ − μ + 2 ) ∣ 1 1 1 1 λ − μ 1 1 1 λ − μ ∣ = ( λ − μ + 2 ) ∣ 1 1 1 0 λ − μ − 1 0 0 0 λ − μ − 1 ∣ = ( λ − μ + 2 ) ( λ − μ − 1 ) 2 = (\lambda - \mu + 2) \begin{vmatrix}
1 & 1 & 1 \\
1 & \lambda - \mu & 1 \\
1 & 1 & \lambda - \mu
\end{vmatrix}
= (\lambda - \mu + 2) \begin{vmatrix}
1 & 1 & 1 \\
0 & \lambda - \mu - 1 & 0 \\
0 & 0 & \lambda - \mu - 1
\end{vmatrix}
= (\lambda - \mu + 2)(\lambda - \mu - 1)^2 = ( λ − μ + 2 ) 1 1 1 1 λ − μ 1 1 1 λ − μ = ( λ − μ + 2 ) 1 0 0 1 λ − μ − 1 0 1 0 λ − μ − 1 = ( λ − μ + 2 ) ( λ − μ − 1 ) 2
Setting the determinant to zero:
So, the eigenvalues are:
μ 1 = λ + 2 , μ 2 = λ − 1 (with multiplicity 2) \mu_1 = \lambda + 2, \quad \mu_2 = \lambda - 1 \quad \text{(with multiplicity 2)} μ 1 = λ + 2 , μ 2 = λ − 1 (with multiplicity 2)
Eigenvectors
For μ 1 = λ + 2 \mu_1 = \lambda + 2 μ 1 = λ + 2 :
A λ − ( λ + 2 ) I = ( − 2 1 1 1 − 2 1 1 1 − 2 ) \mathbf{A}_\lambda - (\lambda + 2) \mathbf{I} = \begin{pmatrix}
-2 & 1 & 1 \\
1 & -2 & 1 \\
1 & 1 & -2
\end{pmatrix} A λ − ( λ + 2 ) I = − 2 1 1 1 − 2 1 1 1 − 2
Solving
( − 2 1 1 1 − 2 1 1 1 − 2 ) v = 0 \begin{pmatrix}
-2 & 1 & 1 \\
1 & -2 & 1 \\
1 & 1 & -2
\end{pmatrix} \mathbf{v} = \mathbf{0} − 2 1 1 1 − 2 1 1 1 − 2 v = 0
, we find:
v 1 = ( 1 1 1 ) \mathbf{v}_1 = \begin{pmatrix}
1 \\
1 \\
1
\end{pmatrix} v 1 = 1 1 1
For μ 2 = λ − 1 \mu_2 = \lambda - 1 μ 2 = λ − 1 :
A λ − ( λ − 1 ) I = ( 1 1 1 1 1 1 1 1 1 ) \mathbf{A}_\lambda - (\lambda - 1) \mathbf{I} = \begin{pmatrix}
1 & 1 & 1 \\
1 & 1 & 1 \\
1 & 1 & 1
\end{pmatrix} A λ − ( λ − 1 ) I = 1 1 1 1 1 1 1 1 1
We need to solve A λ v = ( λ − 1 ) v \mathbf{A}_\lambda \mathbf{v} = (\lambda - 1)\mathbf{v} A λ v = ( λ − 1 ) v , which gives the eigenvectors corresponding to μ 2 \mu_2 μ 2 . This generally results in two linearly independent eigenvectors orthogonal to v 1 \mathbf{v}_1 v 1 :
v 2 = ( 1 0 − 1 ) , v 3 = ( 0 1 − 1 ) \mathbf{v}_2 = \begin{pmatrix}
1 \\
0 \\
-1
\end{pmatrix}, \quad \mathbf{v}_3 = \begin{pmatrix}
0 \\
1 \\
-1
\end{pmatrix} v 2 = 1 0 − 1 , v 3 = 0 1 − 1
(2) Positive Semi-definiteness
A matrix is positive semidefinite if all its eigenvalues are non-negative. For A λ \mathbf{A}_\lambda A λ to be positive semidefinite:
μ 1 = λ + 2 ≥ 0 \mu_1 = \lambda + 2 \geq 0 μ 1 = λ + 2 ≥ 0
μ 2 = λ − 1 ≥ 0 \mu_2 = \lambda - 1 \geq 0 μ 2 = λ − 1 ≥ 0
Solving these inequalities:
λ + 2 ≥ 0 ⟹ λ ≥ − 2 \lambda + 2 \geq 0 \implies \lambda \geq -2 λ + 2 ≥ 0 ⟹ λ ≥ − 2
λ − 1 ≥ 0 ⟹ λ ≥ 1 \lambda - 1 \geq 0 \implies \lambda \geq 1 λ − 1 ≥ 0 ⟹ λ ≥ 1
The most restrictive condition is λ ≥ 1 \lambda \geq 1 λ ≥ 1 .
Thus, the range of λ \lambda λ such that A λ \mathbf{A}_\lambda A λ is positive semidefinite is:
(3) Non-Singularity of Symmetric Matrix
Consider an n × n n \times n n × n symmetric matrix B \mathbf{B} B where all diagonal elements are b b b and all non-diagonal elements are a a a .
B = ( b a a ⋯ a a b a ⋯ a a a b ⋯ a ⋮ ⋮ ⋮ ⋱ ⋮ a a a ⋯ b ) \mathbf{B} = \begin{pmatrix}
b & a & a & \cdots & a \\
a & b & a & \cdots & a \\
a & a & b & \cdots & a \\
\vdots & \vdots & \vdots & \ddots & \vdots \\
a & a & a & \cdots & b
\end{pmatrix} B = b a a ⋮ a a b a ⋮ a a a b ⋮ a ⋯ ⋯ ⋯ ⋱ ⋯ a a a ⋮ b
The matrix B \mathbf{B} B can be written as:
B = b I + a J \mathbf{B} = b\mathbf{I} + a\mathbf{J} B = b I + a J
where J \mathbf{J} J is the n × n n \times n n × n matrix with all elements equal to 1.
The eigenvalues of J \mathbf{J} J are n n n (with multiplicity 1) and 0 0 0 (with multiplicity n − 1 n-1 n − 1 ). Thus, the eigenvalues of B \mathbf{B} B are:
λ 1 = b + ( n − 1 ) a and λ 2 = b − a ( with multiplicity n − 1 ) \lambda_1 = b + (n-1)a \quad \text{and} \quad \lambda_2 = b - a \quad (\text{with multiplicity } n-1) λ 1 = b + ( n − 1 ) a and λ 2 = b − a ( with multiplicity n − 1 )
The matrix B \mathbf{B} B is non-singular if all its eigenvalues are non-zero:
b + ( n − 1 ) a ≠ 0 b + (n-1)a \neq 0 b + ( n − 1 ) a = 0
This holds if:
∣ b ∣ > ∣ ( n − 1 ) a ∣ |b| > |(n-1)a| ∣ b ∣ > ∣ ( n − 1 ) a ∣
since ∣ b ∣ > ( n − 1 ) ∣ a ∣ |b| > (n-1)|a| ∣ b ∣ > ( n − 1 ) ∣ a ∣ implies ∣ b ∣ > ∣ a ∣ |b| > |a| ∣ b ∣ > ∣ a ∣ when n ≥ 2 n \geq 2 n ≥ 2 .
Thus, the matrix B \mathbf{B} B is non-singular when ∣ b ∣ > ∣ ( n − 1 ) a ∣ |b| > |(n-1)a| ∣ b ∣ > ∣ ( n − 1 ) a ∣ .
Knowledge
特征值和特征向量 正定矩阵
难点解题思路
通过求解特征方程来找到特征值。
根据特征值的符号判断矩阵的半正定性。
使用矩阵特征值的性质判断矩阵的非奇异性。
解题技巧和信息
计算特征方程时,使用行列式和代数余子式。
确定半正定矩阵时,所有特征值必须为非负数。
判断矩阵是否非奇异,可以通过特征值是否全非零来实现。
重点词汇
eigenvalue 特征值
eigenvector 特征向量
positive semidefinite 正半定
non-singular 非奇异
参考资料
Linear Algebra and Its Applications by Gilbert Strang, Chap. 6
Introduction to Linear Algebra by Gilbert Strang, Chap. 7