京都大学 情報学研究科 知能情報学専攻 2023年8月実施 情報学基礎 F1-1
Author
Isidore , 祭音Myyura
Description
以下の設問において i i i は虚数単位を, C \mathbb{C} C は複素数全体の集合を表す。
また、行列 A \boldsymbol{A} A に対して、A H \boldsymbol{A}^H A H は A \boldsymbol{A} A の共役転置(エルミート転置)を、A − 1 \boldsymbol{A}^{-1} A − 1 は A \boldsymbol{A} A の逆行列をそれぞれ表す。
設問1
行列 D ∈ C 4 × 4 \boldsymbol{D} \in \mathbb{C}^{4 \times 4} D ∈ C 4 × 4 を次で定義する。
D = 1 2 ( 1 1 1 1 1 − i − 1 i 1 − 1 1 − 1 1 i − 1 − i ) \boldsymbol{D} = \frac{1}{2} \begin{pmatrix}
1 & 1 & 1 & 1 \\
1 & -i & -1 & i \\
1 & -1 & 1 & -1 \\
1 & i & -1 & -i
\end{pmatrix} D = 2 1 1 1 1 1 1 − i − 1 i 1 − 1 1 − 1 1 i − 1 − i
このとき、以下の問いに答えよ。
(1) D \boldsymbol{D} D がユニタリ行列であることを示せ。
(2) 行列 G ∈ C 4 × 4 \boldsymbol{G} \in \mathbb{C}^{4 \times 4} G ∈ C 4 × 4 を
G = ( 1 0 0 0 0 i 0 0 0 0 1 0 0 0 0 i ) G = \begin{pmatrix}
1 & 0 & 0 & 0 \\
0 & i & 0 & 0 \\
0 & 0 & 1 & 0 \\
0 & 0 & 0 & i
\end{pmatrix} G = 1 0 0 0 0 i 0 0 0 0 1 0 0 0 0 i
で定義するとき、D H G D \boldsymbol{D}^H \boldsymbol{G} \boldsymbol{D} D H G D の逆行列を導出せよ。
設問2
n n n 次元ベクトル空間 V V V が2つの部分空間 W 1 , W 2 W_1, W_2 W 1 , W 2 の直和であるとする。ベクトル x ∈ V x \in V x ∈ V が
x = x 1 + x 2 , x 1 ∈ W 1 , x 2 ∈ W 2 x = x_1 + x_2, \quad x_1 \in W_1, x_2 \in W_2 x = x 1 + x 2 , x 1 ∈ W 1 , x 2 ∈ W 2
と分解されるとき、x x x を x 1 x_1 x 1 に写す一次変換を考える。
この一次変換を表す V V V のある基底に関する行列を B \boldsymbol{B} B とする。このとき、以下の問いに答えよ。
(1) x x x を x 2 x_2 x 2 に写す一次変換を表す上述の基底に関する行列を導出せよ。
(2) B 2 = B \boldsymbol{B}^2 = \boldsymbol{B} B 2 = B が成り立つことを示せ。
(3) 適当な n n n 次正則行列 P \boldsymbol{P} P をとれば
P − 1 B P = ( 1 ⋱ 1 0 ⋱ 0 ) \boldsymbol{P}^{-1} \boldsymbol{B} \boldsymbol{P} = \begin{pmatrix}
1 & & & & & \\
& \ddots & & & & \\
& & 1 & & & \\
& & & 0 & & \\
& & & & \ddots & \\
& & & & & 0
\end{pmatrix} P − 1 B P = 1 ⋱ 1 0 ⋱ 0
となることを示せ。
Kai
設問1
(1)
Definition of Unitary Matrix: D H D = E D^{H}D=E D H D = E , in which E E E is identity matrix and D H D^H D H stands for Hermitian Matrix.
D H = 1 2 ( 1 1 1 1 1 i − 1 − i 1 − 1 1 − 1 1 − i − 1 i ) \begin{aligned}
D^{H}
&=
\frac{1}{2}
\begin{pmatrix}
1&1&1&1\\
1&i&-1&-i\\
1&-1&1&-1\\
1&-i&-1&i
\end{pmatrix}
\end{aligned} D H = 2 1 1 1 1 1 1 i − 1 − i 1 − 1 1 − 1 1 − i − 1 i
D D H = 1 2 ( 1 1 1 1 1 − i − 1 i 1 − 1 1 − 1 1 i − 1 − i ) 1 2 ( 1 1 1 1 1 i − 1 − i 1 − 1 1 − 1 1 − i − 1 i ) = 1 4 ( 4 0 0 0 0 4 0 0 0 0 4 0 0 0 0 4 ) = E \begin{aligned}
DD^{H}
&=
\frac{1}{2}
\begin{pmatrix}
1&1&1&1\\
1&-i&-1&i\\
1&-1&1&-1\\
1&i&-1&-i
\end{pmatrix}
\frac{1}{2}
\begin{pmatrix}
1&1&1&1\\
1&i&-1&-i\\
1&-1&1&-1\\
1&-i&-1&i
\end{pmatrix}
=
\frac{1}{4}
\begin{pmatrix}
4&0&0&0\\
0&4&0&0\\
0&0&4&0\\
0&0&0&4
\end{pmatrix}
= E
\end{aligned} D D H = 2 1 1 1 1 1 1 − i − 1 i 1 − 1 1 − 1 1 i − 1 − i 2 1 1 1 1 1 1 i − 1 − i 1 − 1 1 − 1 1 − i − 1 i = 4 1 4 0 0 0 0 4 0 0 0 0 4 0 0 0 0 4 = E
D H D = 1 2 ( 1 1 1 1 1 i − 1 − i 1 − 1 1 − 1 1 − i − 1 i ) 1 2 ( 1 1 1 1 1 − i − 1 i 1 − 1 1 − 1 1 i − 1 − i ) = 1 4 ( 4 0 0 0 0 4 0 0 0 0 4 0 0 0 0 4 ) = E \begin{align}
D^{H}D
&=
\frac{1}{2}
\begin{pmatrix}
1&1&1&1\\
1&i&-1&-i\\
1&-1&1&-1\\
1&-i&-1&i
\end{pmatrix}
\frac{1}{2}
\begin{pmatrix}
1&1&1&1\\
1&-i&-1&i\\
1&-1&1&-1\\
1&i&-1&-i
\end{pmatrix}
=
\frac{1}{4}
\begin{pmatrix}
4&0&0&0\\
0&4&0&0\\
0&0&4&0\\
0&0&0&4
\end{pmatrix}
= E
\end{align} D H D = 2 1 1 1 1 1 1 i − 1 − i 1 − 1 1 − 1 1 − i − 1 i 2 1 1 1 1 1 1 − i − 1 i 1 − 1 1 − 1 1 i − 1 − i = 4 1 4 0 0 0 0 4 0 0 0 0 4 0 0 0 0 4 = E
Therefore, D D D is a unitary matrix.
(2)
With a process similar to question (1), we know that G G G is a unitary matrix.
Hence,
( D H G D ) − 1 = ( D H G D ) H = D H G H D = 1 2 ( 1 1 1 1 1 i − 1 − i 1 − 1 1 − 1 1 − i − 1 i ) ( 1 0 0 0 0 − i 0 0 0 0 1 0 0 0 0 − i ) 1 2 ( 1 1 1 1 1 − i − 1 i 1 − 1 1 − 1 1 i − 1 − i ) = 1 4 ( 2 − 2 i 0 2 + 2 i 0 0 2 − 2 i 0 2 + 2 i 2 + 2 i 0 2 − 2 i 0 0 2 + 2 i 0 2 − 2 i ) \begin{aligned}
(D^{H}GD)^{-1} &= (D^{H}GD)^{H} = D^{H}G^{H}D \\
&= \frac{1}{2}
\begin{pmatrix}
1&1&1&1\\
1&i&-1&-i\\
1&-1&1&-1\\
1&-i&-1&i
\end{pmatrix}
\begin{pmatrix}
1&0&0&0\\
0&-i&0&0\\
0&0&1&0\\
0&0&0&-i
\end{pmatrix}
\frac{1}{2}
\begin{pmatrix}
1&1&1&1\\
1&-i&-1&i\\
1&-1&1&-1\\
1&i&-1&-i
\end{pmatrix}\\
&=\frac{1}{4}\begin{pmatrix}
2-2i & 0 & 2+2i & 0 \\
0 & 2-2i & 0 & 2+2i \\
2+2i & 0 & 2-2i & 0 \\
0 & 2+2i & 0 & 2-2i
\end{pmatrix}
\end{aligned} ( D H G D ) − 1 = ( D H G D ) H = D H G H D = 2 1 1 1 1 1 1 i − 1 − i 1 − 1 1 − 1 1 − i − 1 i 1 0 0 0 0 − i 0 0 0 0 1 0 0 0 0 − i 2 1 1 1 1 1 1 − i − 1 i 1 − 1 1 − 1 1 i − 1 − i = 4 1 2 − 2 i 0 2 + 2 i 0 0 2 − 2 i 0 2 + 2 i 2 + 2 i 0 2 − 2 i 0 0 2 + 2 i 0 2 − 2 i
設問2
(1)
According to the question, the linear transformation B B B maps x x x to x 1 x_1 x 1 , so
B x = x 1 \begin{align}
Bx=x_1 \tag{*}
\end{align} B x = x 1 ( * )
Insert x 1 = x − x 2 x_1 = x-x_2 x 1 = x − x 2 , we get
B x = x − x 2 ⇒ ( E − B ) x = x 2 Bx=x - x_2 \Rightarrow (E - B)x = x_2 B x = x − x 2 ⇒ ( E − B ) x = x 2
So E − B E-B E − B is the answer.
(2)
Insert x = x 1 + x 2 x=x_1 + x_2 x = x 1 + x 2 into equation (*),
B x 1 + B x 2 = x 1 Bx_1 + Bx_2 = x_1 B x 1 + B x 2 = x 1
Given V = W 1 ⊕ W 2 V = W_1 \oplus W_2 V = W 1 ⊕ W 2 , by the properties of Projection Matrix we have
B x 1 = x 1 , B x 2 = 0 Bx_1 = x_1, Bx_2 = 0 B x 1 = x 1 , B x 2 = 0
Then we have
B 2 x 1 = B x 1 = x 1 , B 2 x 2 = B x 2 = 0 B^2x_1 = Bx_1 = x_1, B^2x_2 = Bx_2 = 0 B 2 x 1 = B x 1 = x 1 , B 2 x 2 = B x 2 = 0
Therefore, ∀ x ∈ V , B 2 x = x 1 = B x \forall x \in V, \; B^2x= x_1 = Bx ∀ x ∈ V , B 2 x = x 1 = B x , which implies that B 2 = B B^2 = B B 2 = B .
(3)
Consider the eigenvalues λ \lambda λ of B B B , which satisfies
By (2) we have B 2 = B B^2 = B B 2 = B , hence every λ \lambda λ satisfies
λ 2 = λ \lambda^2 = \lambda λ 2 = λ
Hence λ = 1 , 0 \lambda = 1,0 λ = 1 , 0 .
Assume that the algebraic multiplicity of λ = 1 \lambda = 1 λ = 1 is k k k , then the algebraic multiplicity of λ = 0 \lambda = 0 λ = 0 is ( n − k ) (n-k) ( n − k ) .
Therefore, we can derive
P = [ x 1 x 2 . . . . . . x n ] P=\begin{bmatrix}x_1 & x_2 & ...... & x_n \end{bmatrix} P = [ x 1 x 2 ...... x n ]
in which x 1 . . . x k x_1...x_k x 1 ... x k is the eigenvectors corresponding to λ = 1 \lambda = 1 λ = 1 and the others is the eigenvectors corresponding to λ = 0 \lambda = 0 λ = 0 .
Consider all the B x i = λ x i Bx_i=\lambda x_i B x i = λ x i , we can get
B P = P [ E 0 0 0 ] BP = P\begin{bmatrix} E & 0 \\ 0 & 0 \end{bmatrix} BP = P [ E 0 0 0 ]
We give a brief check of whether P P P is non-singular or not.
When λ = 1 \lambda = 1 λ = 1 ,
B x i = x i ⇒ ( E − B ) x i = 0 Bx_i=x_i \Rightarrow (E-B)x_i = 0 B x i = x i ⇒ ( E − B ) x i = 0
So its eigenspace is N ( E − B ) N(E-B) N ( E − B ) . Similarly, λ = 0 \lambda = 0 λ = 0 's eigenspace is N ( B ) N(B) N ( B ) .
Obviously, N ( B ) = W 2 N(B) = W_2 N ( B ) = W 2 and then N ( E − B ) = W 1 N(E-B) = W_1 N ( E − B ) = W 1 . Given V = W 1 ⊕ W 2 V = W_1 \oplus W_2 V = W 1 ⊕ W 2 , the space spanned by column vectors of P P P (which are eigenvectors of B B B ) is exact V V V . Therefore, P P P is non-singular.
Q.E.D.