Proof. For simplicity, denote α = Tr A \alpha = \operatorname{Tr} A α = Tr A . Consider the block matrix:
M = [ A 0 0 α I n − k A ] . M = \left[\begin{array}{c|c} A & 0 \\ \hline 0 & \alpha I_n - kA \end{array}\right]. M = [ A 0 0 α I n − k A ] .
We perform on
M M M a sequence of elementary transformations on rows and columns (that do not change the rank) as follows:
M → R 1 [ A 0 A α I n − k A ] → C 1 [ A k A A α I n ] → R 2 → R 2 [ A − k α A 2 0 A α I n ] → C 2 [ A − k α A 2 0 0 α I n ] = N \begin{aligned}
M &\xrightarrow{R_1} \left[\begin{array}{c|c} A & 0 \\ \hline A & \alpha I_n - kA \end{array}\right] \xrightarrow{C_1} \left[\begin{array}{c|c} A & kA \\ \hline A & \alpha I_n \end{array}\right] \xrightarrow{R_2} \\
&\xrightarrow{R_2} \left[\begin{array}{c|c} A - \frac{k}{\alpha}A^2 & 0 \\ \hline A & \alpha I_n \end{array}\right] \xrightarrow{C_2} \left[\begin{array}{c|c} A - \frac{k}{\alpha}A^2 & 0 \\ \hline 0 & \alpha I_n \end{array}\right] = N
\end{aligned} M R 1 [ A A 0 α I n − k A ] C 1 [ A A k A α I n ] R 2 R 2 [ A − α k A 2 A 0 α I n ] C 2 [ A − α k A 2 0 0 α I n ] = N
where
R 1 : R_1: R 1 : is the left multiplication by [ I n 0 I n I n ] \left[\begin{array}{c|c} I_n & 0 \\ \hline I_n & I_n \end{array}\right] [ I n I n 0 I n ] ;
C 1 : C_1: C 1 : is the right multiplication by [ I n k I n 0 I n ] \left[\begin{array}{c|c} I_n & kI_n \\ \hline 0 & I_n \end{array}\right] [ I n 0 k I n I n ] ;
R 2 : R_2: R 2 : is the left multiplication by [ I n − k α A 0 I n ] \left[\begin{array}{c|c} I_n & -\frac{k}{\alpha}A \\ \hline 0 & I_n \end{array}\right] [ I n 0 − α k A I n ] ;
C 2 : C_2: C 2 : is the right multiplication by [ I n 0 − 1 α A I n ] \left[\begin{array}{c|c} I_n & 0 \\ \hline -\frac{1}{\alpha}A & I_n \end{array}\right] [ I n − α 1 A 0 I n ] .
It follows that
rank A + rank ( α I n − k A ) = rank M = rank N = rank ( A − k α A 2 ) + n . \operatorname{rank} A + \operatorname{rank}(\alpha I_n - kA) = \operatorname{rank} M = \operatorname{rank} N = \operatorname{rank}\left(A - \frac{k}{\alpha}A^2\right) + n. rank A + rank ( α I n − k A ) = rank M = rank N = rank ( A − α k A 2 ) + n .
Note that
rank ( A − k α A 2 ) = 0 ⇔ A − k α A 2 = 0 ⇔ k α A ⏟ B = ( k α A ) 2 ⇔ B = B 2 ⇒ rank B = Tr B = Tr ( k α A ) = k α Tr A = k \begin{aligned}
\operatorname{rank}\left(A - \frac{k}{\alpha}A^2\right) = 0 &\Leftrightarrow A - \frac{k}{\alpha}A^2 = 0 \Leftrightarrow \underbrace{\frac{k}{\alpha}A}_{B} = \left(\frac{k}{\alpha}A\right)^2 \Leftrightarrow B = B^2 \\
&\Rightarrow \operatorname{rank} B = \operatorname{Tr} B = \operatorname{Tr}\left(\frac{k}{\alpha}A\right) = \frac{k}{\alpha}\operatorname{Tr} A = k
\end{aligned} rank ( A − α k A 2 ) = 0 ⇔ A − α k A 2 = 0 ⇔ B α k A = ( α k A ) 2 ⇔ B = B 2 ⇒ rank B = Tr B = Tr ( α k A ) = α k Tr A = k
so finally
rank A = rank B = k \operatorname{rank} A = \operatorname{rank} B = k rank A = rank B = k .
Μεταγραφή από το επίσημο κείμενο λύσεων, σελίδες 3–4. Η μεταγραφή δεν έχει ελεγχθεί δεύτερη φορά· αν έχεις αμφιβολία, κοίτα το πρωτότυπο.