首页 > 代码库 > 5656265235

5656265235

证明:$(1)$设$r\left( A \right) = r$,则由$Jordan$标准形理论知,存在可逆阵$P$,使得

{P^{ - 1}}AP = \left( {\begin{array}{*{20}{c}} 0&{{E_r}}\\ 0&0 \end{array}} \right)

<script id="MathJax-Element-1" type="math/tex; mode=display">{P^{ - 1}}AP = \left( {\begin{array}{*{20}{c}} 0&{{E_r}}\\ 0&0 \end{array}} \right)</script>

从而可知

{P^{ - 1}}{A^{k - 1}}P = {\left( {{P^{ - 1}}AP} \right)^{k - 1}} = {\left( {\begin{array}{*{20}{c}} 0&{{E_r}}\\ 0&0 \end{array}} \right)^{k - 1}}

<script id="MathJax-Element-2" type="math/tex; mode=display">{P^{ - 1}}{A^{k - 1}}P = {\left( {{P^{ - 1}}AP} \right)^{k - 1}} = {\left( {\begin{array}{*{20}{c}} 0&{{E_r}}\\ 0&0 \end{array}} \right)^{k - 1}}</script>

由于${A^{k - 1}} \ne 0$,则${P^{ - 1}}{A^{k - 1}}P\ne 0$,从而$r\left( A \right) = r \ge k - 1$,而同理由${A^k} = 0$知,$r\left( A \right) = r < k < k + 1 <  \cdots  < n$,

所以有$r\left( A \right) $的最小值为$k-1$,即$Ax=0$的解空间维数的最大值为$n-(k-1)$

$(2)$当$A$的秩最大时,$Ax=0$解空间的维数最小。此时若$p\mid n$,则维数为$\frac{n}{p}$;若$p\nmid n$,则维数为$\left[ {\frac{n}{p}} \right] + 1$