返回

6.(1)设A= [ 4 1 2 2 2 1 3 1 1 ] \begin{bmatrix} 4 & 1 & - 2 \\ 2 & 2 & 1 \\ 3 & 1 & - 1 \end{bmatrix} , B= [ 1 3 2 2 3 1 ] \begin{bmatrix} 1 & - 3 \\ 2 & 2 \\ 3 & - 1 \end{bmatrix} , 求X使AX=B

(2) 设A= [ 0 2 1 2 1 3 3 3 4 ] \begin{bmatrix} 0 & 2 & 1 \\ 2 & - 1 & 3 \\ - 3 & 3 & - 4 \end{bmatrix} , B= [ 1 2 3 2 3 1 ] \begin{bmatrix} 1 & 2 & 3 \\ 2 & - 3 & 1 \end{bmatrix} , 求X使XA =B

(3)设A= [ 1 1 0 0 1 1 1 0 1 ] \begin{bmatrix} 1 & - 1 & 0 \\ 0 & 1 & - 1 \\ - 1 & 0 & 1 \end{bmatrix} , AX=2X + A , 求X

解:(1)若A是可逆矩阵 , 则可求得矩阵方程的解为X=A-1B

而判断A是否可逆进而求解这两件事可通过(A , B)的行最简形一起解决

即若A~E , 则A可逆 , 并且初等行变换把A变为E的同时 , 把B变为A-1B

(A , B)= [ 4 2 3 1 2 1 2 1 1 1 2 3 3 2 1 ] r 1 r 3 [ 1 2 3 0 2 1 1 1 1 2 2 3 2 2 1 ] \left\lbrack \begin{matrix} 4 \\ 2 \\ 3 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ 2 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} - 2 \\ 1 \\ - 1 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ 2 \\ 3 \end{matrix}\ \ \ \ \begin{matrix} - 3 \\ 2 \\ - 1 \end{matrix} \right\rbrack\overset{r_{1} - r_{3}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 2 \\ 3 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 2 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 1 \\ - 1 \end{matrix}\ \ \ \ \begin{matrix} - 2 \\ 2 \\ 3 \end{matrix}\ \ \ \ \begin{matrix} - 2 \\ 2 \\ - 1 \end{matrix} \right\rbrack

r 2 2 r 1 r 3 3 r 1 [ 1 0 0 0 2 1 1 3 2 2 6 9 2 6 5 ] r 2 r 3 r 3 2 r 2 [ 1 0 0 0 1 0 1 2 1 2 9 12 2 5 4 ] \overset{\begin{matrix} r_{2} - 2r_{1} \\ r_{3} - 3r_{1} \end{matrix}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 2 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 3 \\ 2 \end{matrix}\ \ \ \ \begin{matrix} - 2 \\ 6 \\ 9 \end{matrix}\ \ \ \ \begin{matrix} - 2 \\ 6 \\ 5 \end{matrix} \right\rbrack\overset{\begin{matrix} r_{2} \leftrightarrow r_{3} \\ r_{3} - 2r_{2} \end{matrix}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 1 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 2 \\ - 1 \end{matrix}\ \ \ \ \begin{matrix} - 2 \\ 9 \\ - 12 \end{matrix}\ \ \ \ \begin{matrix} - 2 \\ 5 \\ - 4 \end{matrix} \right\rbrack

r 3 × ( 1 ) r 1 + r 3 r 2 2 r 3 [ 1 0 0 0 1 0 0 0 1 10 15 12 2 3 4 ] \overset{\begin{matrix} r_{3} \times ( - 1) \\ r_{1} + r_{3} \\ r_{2} - 2r_{3} \end{matrix}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 1 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 0 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 10 \\ - 15 \\ 12 \end{matrix}\ \ \ \ \begin{matrix} 2 \\ - 3 \\ 4 \end{matrix} \right\rbrack

于是A可逆 , 且X= [ 10 15 12 2 3 4 ] \left\lbrack \begin{matrix} 10 \\ - 15 \\ 12 \end{matrix}\ \ \ \ \begin{matrix} 2 \\ - 3 \\ 4 \end{matrix} \right\rbrack

(2)因XA=B⇒(XA)T=BT⇒ATXT=BT

对照(1) , 可用初等行变换先求得XT , 再转置求得X , 计算如下:

(AT , BT)= [ 0 2 1 2 1 3 3 3 4 1 2 3 2 3 1 ] r 1 r 3 r 2 2 r 1 [ 1 0 0 3 7 2 4 11 3 3 4 1 1 5 2 ] \left\lbrack \begin{matrix} 0 \\ 2 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 2 \\ - 1 \\ 3 \end{matrix}\ \ \ \ \begin{matrix} - 3 \\ 3 \\ - 4 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ 2 \\ 3 \end{matrix}\ \ \ \ \begin{matrix} 2 \\ - 3 \\ 1 \end{matrix} \right\rbrack\overset{\begin{matrix} r_{1} \leftrightarrow r_{3} \\ r_{2} - 2r_{1} \end{matrix}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 3 \\ - 7 \\ 2 \end{matrix}\ \ \ \ \begin{matrix} - 4 \\ 11 \\ - 3 \end{matrix}\ \ \ \ \begin{matrix} 3 \\ - 4 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ - 5 \\ 2 \end{matrix} \right\rbrack

r 2 + 4 r 3 [ 1 0 0 3 1 2 4 1 3 3 0 1 1 3 2 ] r 1 3 r 2 r 3 2 r 2 [ 1 0 0 0 1 0 1 1 1 3 0 1 8 3 4 ] \overset{r_{2} + 4r_{3}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 3 \\ 1 \\ 2 \end{matrix}\ \ \ \ \begin{matrix} - 4 \\ - 1 \\ - 3 \end{matrix}\ \ \ \ \begin{matrix} 3 \\ 0 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ 3 \\ 2 \end{matrix} \right\rbrack\overset{\begin{matrix} r_{1} - 3r_{2} \\ r_{3} - 2r_{2} \end{matrix}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 1 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ - 1 \\ - 1 \end{matrix}\ \ \ \ \begin{matrix} 3 \\ 0 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} - 8 \\ 3 \\ - 4 \end{matrix} \right\rbrack

r 1 r 3 r 2 r 3 r 3 × ( 1 ) [ 1 0 0 0 1 0 0 0 1 2 1 1 4 7 4 ] \overset{\begin{matrix} r_{1} - r_{3} \\ r_{2} - r_{3} \\ r_{3} \times ( - 1) \end{matrix}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 1 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 0 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 2 \\ - 1 \\ - 1 \end{matrix}\ \ \ \ \begin{matrix} - 4 \\ 7 \\ 4 \end{matrix} \right\rbrack

于是XT= [ 2 1 1 4 7 4 ] \left\lbrack \begin{matrix} 2 \\ - 1 \\ - 1 \end{matrix}\ \ \ \ \begin{matrix} - 4 \\ 7 \\ 4 \end{matrix} \right\rbrack ,从而X= [ 2 1 1 4 7 4 ] \begin{bmatrix} 2 & - 1 & - 1 \\ - 4 & 7 & 4 \end{bmatrix}

(3) 由AX=2X+A得(A-2E)X= A.

欲解此方程 , 首先要判断A -2E为可逆矩阵 , 再进一步求X=(A-2E)-1A

这两件事可由(A-2E , A)的行最简形一起解决

(A-2E , A)= [ 1 0 1 1 1 0 0 1 1 1 0 1 1 1 0 0 1 1 ] r 1 × ( 1 ) r 3 + r 1 r 2 × ( 1 ) [ 1 0 0 1 1 1 0 1 1 1 0 2 1 1 1 0 1 1 ] \left\lbrack \begin{matrix} - 1 \\ 0 \\ - 1 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ - 1 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ - 1 \\ - 1 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ 0 \\ - 1 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 1 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ - 1 \\ 1 \end{matrix} \right\rbrack\overset{\begin{matrix} r_{1} \times ( - 1) \\ r_{3} + r_{1} \\ r_{2} \times ( - 1) \end{matrix}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ 1 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 1 \\ - 1 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 0 \\ - 2 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ - 1 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 1 \\ 1 \end{matrix} \right\rbrack

r 1 r 2 r 3 r 2 [ 1 0 0 0 1 0 1 1 2 1 0 2 2 1 2 1 1 0 ] r 3 ÷ ( 2 ) r 1 + r 3 r 2 r 3 [ 1 0 0 0 1 0 0 0 1 0 1 1 1 0 1 1 1 0 ] \overset{\begin{matrix} r_{1} - r_{2} \\ r_{3} - r_{2} \end{matrix}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 1 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 1 \\ - 2 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 0 \\ - 2 \end{matrix}\ \ \ \ \begin{matrix} 2 \\ - 1 \\ 2 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 1 \\ 0 \end{matrix} \right\rbrack\overset{\begin{matrix} r_{3} \div ( - 2) \\ r_{1} + r_{3} \\ r_{2} - r_{3} \end{matrix}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 1 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 0 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ - 1 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ 0 \\ - 1 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 1 \\ 0 \end{matrix} \right\rbrack

上述结果表明A -2E与E等价 , 故A-2E可逆 , 且X=(A-2E)-1A= [ 0 1 1 1 0 1 1 1 0 ] \left\lbrack \begin{matrix} 0 \\ - 1 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ 0 \\ - 1 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 1 \\ 0 \end{matrix} \right\rbrack

7.在秩是r的矩阵中 , 有没有等于0的r-1阶子式?

有没有等于0的r阶子式?

解: 在秩是r的矩阵中等于0的r-1阶子式可能有 , 也可能没有,

等于0的r阶子式可能有 , 也可能没有

例如:

(i)矩阵 [ 1 0 0 1 ] \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} 的秩为2 , 有等于0的1阶子式(简称1阶零子式,下同),

但没有2阶零子式

(ii)矩阵 [ 1 2 3 1 ] \begin{bmatrix} 1 & 2 \\ 3 & 1 \end{bmatrix} 的秩为2 , 没有1阶零子式 , 也没有2阶零子式

(iii)矩阵 [ 1 0 0 0 1 1 ] \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 1 \end{bmatrix} 的秩为2 , 有1阶零子式 , 也有2阶零子式

(iv)矩阵 [ 1 1 1 1 1 2 ] \begin{bmatrix} 1 & 1 & 1 \\ 1 & 1 & 2 \end{bmatrix} 的秩为2 , 没有1阶零子式 , 但有2阶零子式

8. 从矩阵 A A 中划去一行得到矩阵 B B ,问 A , B A,B 的秩的关系怎样?

: 设 A A m × n m \times n 矩阵,划去其中一行得到矩阵 B B

B B ( m 1 ) × n (m - 1) \times n 矩阵。

考虑分块矩阵 C = ( A B ) , C = \begin{pmatrix} A \\ B \end{pmatrix}, 其中 B B 的行向量来自 A A 中除去某一行的剩余行。

通过初等行变换可将 C C 化简为仅包含 A A 的行向量,因此 R ( C ) = R ( A ) R(C) = R(A)。

对于分块矩阵 ( A B ) \begin{pmatrix} A \\ B \end{pmatrix} ,有秩的不等式 m a x { R ( A ) , R ( B ) } R ( ( A B ) ) R ( A ) + R ( B ) max\{ R(A),R(B)\} \leq R\left( \begin{pmatrix} A \\ B \end{pmatrix} \right) \leq R(A) + R(B)。

代入 R ( C ) = R ( A ) R(C) = R(A) m a x { R ( A ) , R ( B ) } R ( A ) R ( A ) + R ( B ) max\{ R(A),R(B)\} \leq R(A) \leq R(A) + R(B)。

由左边不等式可得 R ( B ) R ( A ) R(B) \leq R(A)。

另一方面,去掉一行最多使秩减少 1 1 ,即 R ( A ) 1 R ( B ) R(A) - 1 \leq R(B)。

综上,有 R ( A ) 1 R ( B ) R ( A ) R(A) - 1 \leq R(B) \leq R(A)

9. 求作一个秩是4的方阵 , 它的两个行向量是(1 , 0 , 1 , 0 , 0) , (1 , -1 , 0 , 0 , 0)

解: [ 1 1 0 1 1 0 0 0 0 0 ] \left\lbrack \begin{matrix} 1 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ - 1 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 0 \end{matrix} \right\rbrack 的秩为2 ,

故满足要求的方阵可以取为 [ 1 1 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 1 0 ] \left\lbrack \begin{array}{r} \begin{matrix} 1 \\ 1 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 0 \\ - 1 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ 0 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 0 \\ 0 \\ 1 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 0 \\ 0 \\ 0 \end{matrix} \\ \begin{matrix} 1 \\ 0 \end{matrix} \end{array} \right\rbrack

注 (1)显然所求矩阵应是5阶方阵

(2)存在无限多个5阶方阵满足要求,我们给出的是最简单、最朴素的方法

在秩为2的行向量组下面 , 再适当地铺上四个台阶

以构成合四个有效台阶的行向量组

10 , 求下列矩阵的秩

(1) [ 3 1 1 1 1 1 0 2 4 2 1 4 ] \left\lbrack \begin{matrix} 3 \\ 1 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ - 1 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 2 \\ - 4 \end{matrix}\ \ \ \ \begin{matrix} 2 \\ - 1 \\ 4 \end{matrix} \right\rbrack , (2) [ 3 2 7 2 1 0 1 3 5 3 1 1 1 3 8 ] \left\lbrack \begin{matrix} 3 \\ 2 \\ 7 \end{matrix}\ \ \ \ \begin{matrix} 2 \\ - 1 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 3 \\ 5 \end{matrix}\ \ \ \ \begin{matrix} - 3 \\ 1 \\ - 1 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ - 3 \\ - 8 \end{matrix} \right\rbrack ,

(3) [ 2 2 3 1 1 3 2 0 8 0 5 3 3 7 8 2 7 5 0 0 ] \left\lbrack \begin{array}{r} \begin{matrix} 2 \\ 2 \end{matrix} \\ \begin{matrix} 3 \\ 1 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ - 3 \end{matrix} \\ \begin{matrix} - 2 \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 8 \\ 0 \end{matrix} \\ \begin{matrix} 5 \\ 3 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 3 \\ 7 \end{matrix} \\ \begin{matrix} 8 \\ 2 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 7 \\ - 5 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array} \right\rbrack

解: (1) [ 3 1 1 1 1 1 0 2 4 2 1 4 ] r 1 r 2 [ 1 3 1 1 1 3 2 0 4 1 2 4 ] \left\lbrack \begin{matrix} 3 \\ 1 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ - 1 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 2 \\ - 4 \end{matrix}\ \ \ \ \begin{matrix} 2 \\ - 1 \\ 4 \end{matrix} \right\rbrack\overset{r_{1} \leftrightarrow r_{2}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 3 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 1 \\ 3 \end{matrix}\ \ \ \ \begin{matrix} 2 \\ 0 \\ - 4 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 2 \\ 4 \end{matrix} \right\rbrack

r 2 3 r 1 r 3 r 1 [ 1 0 0 1 4 4 2 6 6 1 5 5 ] r 3 r 2 [ 1 0 0 1 4 0 2 6 0 1 5 0 ] \overset{\begin{matrix} r_{2} - 3r_{1} \\ r_{3} - r_{1} \end{matrix}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 4 \\ 4 \end{matrix}\ \ \ \ \begin{matrix} 2 \\ - 6 \\ - 6 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 5 \\ 5 \end{matrix} \right\rbrack\overset{r_{3} - r_{2}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 4 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 2 \\ - 6 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 5 \\ 0 \end{matrix} \right\rbrack

故它的秩为2

(2) [ 3 2 7 2 1 0 1 3 5 3 1 1 1 3 8 ] r 1 r 2 r 2 2 r 1 r 3 7 r 1 [ 1 0 0 3 7 21 4 11 33 4 9 27 2 7 22 ] \left\lbrack \begin{matrix} 3 \\ 2 \\ 7 \end{matrix}\ \ \ \ \begin{matrix} 2 \\ - 1 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ 3 \\ 5 \end{matrix}\ \ \ \ \begin{matrix} - 3 \\ 1 \\ - 1 \end{matrix}\ \ \ \ \begin{matrix} - 1 \\ - 3 \\ - 8 \end{matrix} \right\rbrack\overset{\begin{matrix} r_{1} - r_{2} \\ r_{2} - 2r_{1} \\ r_{3} - 7r_{1} \end{matrix}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 3 \\ - 7 \\ - 21 \end{matrix}\ \ \ \ \begin{matrix} - 4 \\ 11 \\ 33 \end{matrix}\ \ \ \ \begin{matrix} - 4 \\ 9 \\ 27 \end{matrix}\ \ \ \ \begin{matrix} 2 \\ - 7 \\ - 22 \end{matrix} \right\rbrack

r 3 3 r 2 [ 1 0 0 3 7 0 4 11 0 4 9 0 2 7 1 ] \overset{r_{3} - 3r_{2}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 3 \\ - 7 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} - 4 \\ 11 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} - 4 \\ 9 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 2 \\ - 7 \\ - 1 \end{matrix} \right\rbrack

于是它的秩为3

(3) [ 2 2 3 1 1 3 2 0 8 0 5 3 3 7 8 2 7 5 0 0 ] r 1 r 4 [ 1 2 3 2 0 3 2 1 3 0 5 8 2 7 8 3 0 5 0 7 ] \left\lbrack \begin{array}{r} \begin{matrix} 2 \\ 2 \end{matrix} \\ \begin{matrix} 3 \\ 1 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ - 3 \end{matrix} \\ \begin{matrix} - 2 \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 8 \\ 0 \end{matrix} \\ \begin{matrix} 5 \\ 3 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 3 \\ 7 \end{matrix} \\ \begin{matrix} 8 \\ 2 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 7 \\ - 5 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array} \right\rbrack\overset{r_{1} \leftrightarrow r_{4}}{\Rightarrow}\left\lbrack \begin{array}{r} \begin{matrix} 1 \\ 2 \end{matrix} \\ \begin{matrix} 3 \\ 2 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 0 \\ - 3 \end{matrix} \\ \begin{matrix} - 2 \\ 1 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 3 \\ 0 \end{matrix} \\ \begin{matrix} 5 \\ 8 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 2 \\ 7 \end{matrix} \\ \begin{matrix} 8 \\ 3 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 0 \\ - 5 \end{matrix} \\ \begin{matrix} 0 \\ 7 \end{matrix} \end{array} \right\rbrack

r 2 2 r 1 r 3 3 r 1 r 4 2 r 1 [ 1 0 0 0 0 3 2 1 3 6 4 2 2 3 2 1 0 5 0 7 ] r 2 r 4 r 3 + 2 r 2 r 4 + 3 r 2 [ 1 0 0 0 0 1 0 0 3 2 0 0 2 1 0 0 0 7 14 16 ] r 3 ÷ 14 r 4 16 r 3 [ 1 0 0 0 0 1 0 0 3 2 0 0 2 1 0 0 0 7 1 0 ] \overset{\begin{matrix} r_{2} - 2r_{1} \\ r_{3} - 3r_{1} \\ r_{4} - 2r_{1} \end{matrix}}{\Rightarrow}\left\lbrack \begin{array}{r} \begin{matrix} 1 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 0 \\ - 3 \end{matrix} \\ \begin{matrix} - 2 \\ 1 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 3 \\ - 6 \end{matrix} \\ \begin{matrix} - 4 \\ 2 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 2 \\ 3 \end{matrix} \\ \begin{matrix} 2 \\ - 1 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 0 \\ - 5 \end{matrix} \\ \begin{matrix} 0 \\ 7 \end{matrix} \end{array} \right\rbrack\overset{\begin{matrix} r_{2} \leftrightarrow r_{4} \\ r_{3} + 2r_{2} \\ r_{4} + 3r_{2} \end{matrix}}{\Rightarrow}\left\lbrack \begin{array}{r} \begin{matrix} 1 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 0 \\ 1 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 3 \\ 2 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 2 \\ - 1 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 0 \\ 7 \end{matrix} \\ \begin{matrix} 14 \\ 16 \end{matrix} \end{array} \right\rbrack\overset{\begin{matrix} r_{3} \div 14 \\ r_{4} - 16r_{3} \end{matrix}}{\Rightarrow}\left\lbrack \begin{array}{r} \begin{matrix} 1 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 0 \\ 1 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 3 \\ 2 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 2 \\ - 1 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 0 \\ 7 \end{matrix} \\ \begin{matrix} 1 \\ 0 \end{matrix} \end{array} \right\rbrack

于是它的秩为3

11 , 设A , B都是m×n矩阵 , 证明R(A)=R(B)是A与B等价的充要条件。

证:

1. 必要性证明

A A B B 等价,即存在可逆矩阵 P m × m P_{m \times m} Q n × n Q_{n \times n} 使得: B = P A Q . B = PAQ.

可逆矩阵乘在左边或右边不改变矩阵的秩

(因为可逆矩阵可以看作初等矩阵的乘积,初等变换不改变秩)。

因此: R ( B ) = R ( P A Q ) = R ( A ) . R(B) = R(PAQ) = R(A).

必要性得证。

2. 充分性证明 设 R ( A ) = R ( B ) = r R(A) = R(B) = r

根据矩阵的等价标准形理论,任一 m × n m \times n 矩阵 M M 满足:

存在可逆矩阵 P m , Q n P_{m},Q_{n} 使得 P M Q = [ I r 0 0 0 ] m × n , PMQ = \begin{bmatrix} I_{r} & 0 \\ 0 & 0 \end{bmatrix}_{m \times n},

其中 I r I_{r} r × r r \times r 单位矩阵,其余块是零矩阵。 我们称此为标准形 D r D_{r}

于是对 A A 存在 P 1 , Q 1 P_{1},Q_{1} 可逆使 P 1 A Q 1 = D r , 其中 D r = [ I r 0 0 0 ] . P_{1}AQ_{1} = D_{r},\quad\text{其中}D_{r} = \begin{bmatrix} I_{r} & 0 \\ 0 & 0 \end{bmatrix}.

B B 存在 P 2 , Q 2 P_{2},Q_{2} 可逆使 P 2 B Q 2 = D r . P_{2}BQ_{2} = D_{r}.

因此 P 1 A Q 1 = P 2 B Q 2 P_{1}AQ_{1} = P_{2}BQ_{2} ,于是 A = P 1 1 P 2 B Q 2 Q 1 1 . A = P_{1}^{- 1}P_{2}BQ_{2}Q_{1}^{- 1}.

P = P 1 1 P 2 P = P_{1}^{- 1}P_{2} ( m × m m \times m 可逆), Q = Q 2 Q 1 1 Q = Q_{2}Q_{1}^{- 1} ( n × n n \times n 可逆),则 A = P B Q . A = PBQ.

矩阵等价具有对称性, A = P B Q A = PBQ 可推出 B = P 1 A Q 1 B = P^{- 1}AQ^{- 1} ,所以 A A B B 等价。

充分性得证。

12 , 设A= [ 1 2 3 k 1 2 k 3 k 2 3 ] \begin{bmatrix} 1 & - 2 & 3k \\ - 1 & 2k & - 3 \\ k & - 2 & 3 \end{bmatrix} , 问k为何值时

可使(1) R(A)=1; (2) R(A)=2; (3) R(A)=3.

解: 对A作初等行变换

A= [ 1 2 3 k 1 2 k 3 k 2 3 ] r 2 + r 1 r 3 k r 1 [ 1 2 3 k 0 2 ( k 1 ) 3 ( k 1 ) 0 2 ( k 1 ) 3 ( k 2 1 ) ] \begin{bmatrix} 1 & - 2 & 3k \\ - 1 & 2k & - 3 \\ k & - 2 & 3 \end{bmatrix}\overset{\begin{matrix} r_{2} + r_{1} \\ r_{3} - kr_{1} \end{matrix}}{\Rightarrow}\begin{bmatrix} 1 & - 2 & 3k \\ 0 & 2(k - 1) & 3(k - 1) \\ 0 & 2(k - 1) & - 3\left( k^{2} - 1 \right) \end{bmatrix}

r 3 r 2 [ 1 2 3 k 0 2 ( k 1 ) 3 ( k 1 ) 0 0 3 ( k 1 ) ( k + 2 ) ] \overset{r_{3} - r_{2}}{\Rightarrow}\begin{bmatrix} 1 & - 2 & 3k \\ 0 & 2(k - 1) & 3(k - 1) \\ 0 & 0 & - 3(k - 1)(k + 2) \end{bmatrix}

于是,(1)当k=1时 , R(A)=1

(2)当k=-2时 , R(A)=2

(3)当k≠1且k≠-2时 , R(A)=3