返回

21 , 设A为列满秩矩阵 , AB= C , 证明方程Bx=0与Cx=0同解

证:

步骤1:证明“ B x = 0 Bx = 0 的解是 C x = 0 Cx = 0 的解”

x x B x = 0 Bx = 0 的解,则 B x = 0 Bx = 0

C = A B C = AB ,代入得: C x = ( A B ) x = A ( B x ) = A 0 = 0 Cx = (AB)x = A(Bx) = A0 = 0

因此, x x 也是 C x = 0 Cx = 0 的解。

步骤2:证明“ C x = 0 Cx = 0 的解是 B x = 0 Bx = 0 的解”

x x C x = 0 Cx = 0 的解,则 C x = 0 Cx = 0 ,即 A B x = 0 ABx = 0

由于 A A 是列满秩矩阵(设 A A m × n m \times n 矩阵,列满秩即 R ( A ) = n R(A) = n ),

根据列满秩矩阵的性质:若 A A 列满秩,则“ A y = 0 Ay = 0 ”仅有零解( y = 0 y = 0 )。

y = B x y = Bx ,则 A y = 0 Ay = 0 。结合列满秩性质,得 y = B x = 0 y = Bx = 0 ,即 x x B x = 0 Bx = 0 的解。

步骤3:结论

综上, B x = 0 Bx = 0 C x = 0 Cx = 0 的解完全相同,即同解。

举例验证

构造列满秩矩阵 A A 、矩阵 B B ,计算 C = A B C = AB ,验证 B x = 0 Bx = 0 C x = 0 Cx = 0 同解。

示例1:简单列满秩矩阵

设: A = ( 1 0 0 1 ) ( 2 × 2 R ( A ) = 2 ) A = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}\quad(2 \times 2列满秩,R(A) = 2) B = ( 1 2 3 4 ) B = \begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix} ,则 C = A B = ( 1 2 3 4 ) C = AB = \begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix}

(因 A A 是单位矩阵, A B = B AB = B ,此时 C = B C = B ,显然 B x = 0 Bx = 0 C x = 0 Cx = 0 同解,可更一般化构造)

示例2:非方阵列满秩

设: A = ( 1 0 0 1 1 1 ) ( 3 × 2 R ( A ) = 2 ) A = \begin{pmatrix} 1 & 0 \\ 0 & 1 \\ 1 & 1 \end{pmatrix}\quad(3 \times 2列满秩,R(A) = 2) B = ( 1 1 2 2 ) B = \begin{pmatrix} 1 & - 1 \\ 2 & - 2 \end{pmatrix}

计算 C = A B C = AB C = ( 1 0 0 1 1 1 ) ( 1 1 2 2 ) = ( 1 1 2 2 3 3 ) C = \begin{pmatrix} 1 & 0 \\ 0 & 1 \\ 1 & 1 \end{pmatrix}\begin{pmatrix} 1 & - 1 \\ 2 & - 2 \end{pmatrix} = \begin{pmatrix} 1 & - 1 \\ 2 & - 2 \\ 3 & - 3 \end{pmatrix}

分析同解性

B x = 0 Bx = 0 的解:

B = ( 1 1 2 2 ) B = \begin{pmatrix} 1 & - 1 \\ 2 & - 2 \end{pmatrix} ,其行变换后为 ( 1 1 0 0 ) \begin{pmatrix} 1 & - 1 \\ 0 & 0 \end{pmatrix} ,解为 x = k ( 1 , 1 ) T x = k(1,1)^{T} k k 为任意常数)。

C x = 0 Cx = 0 的解:

C = ( 1 1 2 2 3 3 ) C = \begin{pmatrix} 1 & - 1 \\ 2 & - 2 \\ 3 & - 3 \end{pmatrix} ,行变换后为 ( 1 1 0 0 0 0 ) \begin{pmatrix} 1 & - 1 \\ 0 & 0 \\ 0 & 0 \end{pmatrix} ,解同样为 x = k ( 1 , 1 ) T x = k(1,1)^{T} k k 为任意常数)。

可见, B x = 0 Bx = 0 C x = 0 Cx = 0 同解,验证结论成立。

22 , 设A为m×n矩阵

试证明方程AX=Em有解的充分必要条件是R(A)=m

证:

证明(矩阵分块与秩的不等式方法)

1. 必要性:若方程有解,则 R ( A ) = m R(A) = m

设存在 n × m n \times m 矩阵 X 0 X_{0} 使得 A X 0 = E m AX_{0} = E_{m}

由矩阵乘积的秩不等式: R ( A B ) m i n { R ( A ) , R ( B ) } , R(AB) \leq min\{ R(A),R(B)\}, R ( E m ) R ( A ) . R(E_{m}) \leq R(A).

因为 R ( E m ) = m R(E_{m}) = m ,所以 m R ( A ) . m \leq R(A).

A A m × n m \times n 矩阵,其秩不超过行数 m m ,即 R ( A ) m . R(A) \leq m.

综上可得 R ( A ) = m . R(A) = m.

2. 充分性:若 R ( A ) = m R(A) = m ,则方程有解

R ( A ) = m R(A) = m 。 将 E m E_{m} 按列分块为 E m = [ e 1 e 2 e m ] , E_{m} = \lbrack e_{1}\mspace{6mu} e_{2}\mspace{6mu}\ldots\mspace{6mu} e_{m}\rbrack,

其中 e j m e_{j} \in \mathbb{R}^{m} 是第 j j 个标准单位向量。

方程 A X = E m AX = E_{m} 等价于求解 m m 个线性方程组 A x j = e j , j = 1 , 2 , , m , Ax_{j} = e_{j},\quad j = 1,2,\ldots,m,

其中 x j x_{j} X X 的第 j j 列。

对任意固定的 j j ,考虑增广矩阵 [ A e j ] . \lbrack A \mid e_{j}\rbrack.

已知 R ( A ) = m R(A) = m ,且 R ( [ A e j ] ) R ( A ) = m R(\lbrack A \mid e_{j}\rbrack) \geq R(A) = m

另一方面, [ A e j ] \lbrack A \mid e_{j}\rbrack 只有 m m 行,因此其秩不超过 m m ,即 R ( [ A e j ] ) m . R(\lbrack A \mid e_{j}\rbrack) \leq m.

于是 R ( [ A e j ] ) = m = R ( A ) . R(\lbrack A \mid e_{j}\rbrack) = m = R(A).

由线性方程组解的存在性定理可知,方程组 A x j = e j Ax_{j} = e_{j} 有解。

依次取 j = 1 , 2 , , m j = 1,2,\ldots,m ,得到解向量 x 1 , x 2 , , x m x_{1},x_{2},\ldots,x_{m}

X = [ x 1 x 2 x m ] , X = \lbrack x_{1}\mspace{6mu} x_{2}\mspace{6mu}\ldots\mspace{6mu} x_{m}\rbrack, A X = [ A x 1 A x 2 A x m ] = [ e 1 e 2 e m ] = E m . AX = \lbrack Ax_{1}\mspace{6mu} Ax_{2}\mspace{6mu}\ldots\mspace{6mu} Ax_{m}\rbrack = \lbrack e_{1}\mspace{6mu} e_{2}\mspace{6mu}\ldots\mspace{6mu} e_{m}\rbrack = E_{m}.

故方程 A X = E m AX = E_{m} 有解。

举例验证

一、必要性证明(若方程有解,则 R ( A ) = m R(A) = m

思路: 已知存在 X 0 X_{0} 使得 A X 0 = E m AX_{0} = E_{m} ,则: R ( E m ) R ( A ) R(E_{m}) \leq R(A)

因为 R ( E m ) = m R(E_{m}) = m ,所以 m R ( A ) m \leq R(A)

又因为 A A m × n m \times n 矩阵,秩不超过行数 m m R ( A ) m R(A) \leq m

联立得 R ( A ) = m R(A) = m

举例验证: 取: A = ( 1 0 0 1 1 1 ) , X 0 = ( 1 0 0 0 1 0 ) A = \begin{pmatrix} 1 & 0 \\ 0 & 1 \\ 1 & 1 \end{pmatrix},\quad X_{0} = \begin{pmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \end{pmatrix}

则: A X 0 = ( 1 0 0 1 1 1 ) ( 1 0 0 0 1 0 ) = ( 1 0 0 1 1 1 ) E 3 AX_{0} = \begin{pmatrix} 1 & 0 \\ 0 & 1 \\ 1 & 1 \end{pmatrix}\begin{pmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \end{pmatrix} = \begin{pmatrix} 1 & 0 \\ 0 & 1 \\ 1 & 1 \end{pmatrix} \neq E_{3}

实际上这里 R ( A ) = 2 < 3 R(A) = 2 < 3 ,无法得到 E 3 E_{3}

若取满行秩的矩阵如: A = ( 1 0 0 0 1 0 ) , X 0 = ( 1 0 0 1 0 0 ) A = \begin{pmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \end{pmatrix},\quad X_{0} = \begin{pmatrix} 1 & 0 \\ 0 & 1 \\ 0 & 0 \end{pmatrix}

A X 0 = E 2 AX_{0} = E_{2} ,此时 R ( A ) = 2 = m R(A) = 2 = m

二、充分性证明(若 R ( A ) = m R(A) = m ,则方程有解)

思路: 将 E m E_{m} 按列分块为 [ e 1 e 2 e m ] \lbrack e_{1}\ e_{2}\ \ldots\ e_{m}\rbrack

原方程等价于求解: A x j = e j , j = 1 , , m Ax_{j} = e_{j},\quad j = 1,\ldots,m

因为 R ( A ) = m R(A) = m ,所以对每个 j j ,增广矩阵 [ A e j ] \lbrack A \mid e_{j}\rbrack 的秩也为 m m

故每个方程组都有解。

将所有解向量组合成 X = [ x 1 x 2 x m ] X = \lbrack x_{1}\ x_{2}\ \ldots\ x_{m}\rbrack ,即得 A X = E m AX = E_{m}

举例验证: 取: A = ( 1 2 3 0 1 2 ) A = \begin{pmatrix} 1 & 2 & 3 \\ 0 & 1 & 2 \end{pmatrix} R ( A ) = 2 = m R(A) = 2 = m

解: A x 1 = ( 1 0 ) , A x 2 = ( 0 1 ) Ax_{1} = \begin{pmatrix} 1 \\ 0 \end{pmatrix},\quad Ax_{2} = \begin{pmatrix} 0 \\ 1 \end{pmatrix} ,解得: x 1 = ( 1 0 0 ) , x 2 = ( 2 1 0 ) x_{1} = \begin{pmatrix} 1 \\ 0 \\ 0 \end{pmatrix},\quad x_{2} = \begin{pmatrix} - 2 \\ 1 \\ 0 \end{pmatrix}

则: X = ( 1 2 0 1 0 0 ) , A X = E 2 X = \begin{pmatrix} 1 & - 2 \\ 0 & 1 \\ 0 & 0 \end{pmatrix},\quad AX = E_{2}

二、例题增补

例3.1下列四个3×4矩阵中 , 哪些是行最简形

(1) A1= [ 1 1 0 0 1 0 0 0 1 0 0 0 ] \left\lbrack \begin{matrix} 1 \\ 1 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 1 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 0 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 0 \\ 0 \end{matrix} \right\rbrack (1) A2= [ 1 0 0 1 1 0 0 1 0 1 1 0 ] \left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ 1 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 1 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ 1 \\ 0 \end{matrix} \right\rbrack

(1) A3= [ 1 0 0 0 1 1 0 0 1 1 1 1 ] \left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 1 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 0 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ 1 \\ 1 \end{matrix} \right\rbrack (1) A4= [ 1 0 0 1 0 0 0 1 0 1 1 0 ] \left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 0 \\ 1 \\ 0 \end{matrix}\ \ \ \ \begin{matrix} 1 \\ 1 \\ 0 \end{matrix} \right\rbrack

解:

A1不是行最简形 , 因为它们首先不是行阶梯形

A2不是行最简形

因为它的第2行的首非零元所在列不是单位坐标向量列 , 即该列有其他非零元

A3不是行最简形 , 因为它们首先不是行阶梯形

A4是行最简形

例3.2设矩阵A= [ 2 3 4 4 6 8 5 4 17 3 2 11 ] \left\lbrack \begin{matrix} 2 \\ 3 \\ 4 \end{matrix}\ \ \ \ \ \begin{matrix} - 4 \\ - 6 \\ - 8 \end{matrix}\ \ \ \ \ \begin{matrix} 5 \\ 4 \\ 17 \end{matrix}\ \ \ \ \ \begin{matrix} 3 \\ 2 \\ 11 \end{matrix} \right\rbrack

试求:(1) A的行最简形 ; (2) A的标准形

解:(1)对矩阵A作初等行变换

A= [ 2 3 4 4 6 8 5 4 17 3 2 11 ] r 2 r 1 [ 2 1 4 4 2 8 5 1 17 3 1 11 ] \left\lbrack \begin{matrix} 2 \\ 3 \\ 4 \end{matrix}\ \ \ \ \ \begin{matrix} - 4 \\ - 6 \\ - 8 \end{matrix}\ \ \ \ \ \begin{matrix} 5 \\ 4 \\ 17 \end{matrix}\ \ \ \ \ \begin{matrix} 3 \\ 2 \\ 11 \end{matrix} \right\rbrack\overset{r_{2} - r_{1}}{\Rightarrow}\left\lbrack \begin{matrix} 2 \\ 1 \\ 4 \end{matrix}\ \ \ \ \ \begin{matrix} - 4 \\ - 2 \\ - 8 \end{matrix}\ \ \ \ \ \begin{matrix} 5 \\ - 1 \\ 17 \end{matrix}\ \ \ \ \ \begin{matrix} 3 \\ - 1 \\ 11 \end{matrix} \right\rbrack

r 1 r 2 [ 1 2 4 2 4 8 1 5 17 1 3 11 ] r 2 2 r 1 r 3 4 r 1 [ 1 0 0 2 0 0 1 7 21 1 5 15 ] r 2 × 1 7 r 3 21 r 2 r 1 + r 2 [ 1 0 0 2 0 0 0 1 0 2 7 5 7 0 ] \overset{r_{1} \leftrightarrow r_{2}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 2 \\ 4 \end{matrix}\ \ \ \ \ \begin{matrix} - 2 \\ - 4 \\ - 8 \end{matrix}\ \ \ \ \ \begin{matrix} - 1 \\ 5 \\ 17 \end{matrix}\ \ \ \ \ \begin{matrix} - 1 \\ 3 \\ 11 \end{matrix} \right\rbrack\overset{\begin{matrix} r_{2} - 2r_{1} \\ r_{3} - 4r_{1} \end{matrix}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \ \begin{matrix} - 2 \\ 0 \\ 0 \end{matrix}\ \ \ \ \ \begin{matrix} - 1 \\ 7 \\ 21 \end{matrix}\ \ \ \ \ \begin{matrix} - 1 \\ 5 \\ 15 \end{matrix} \right\rbrack\overset{\begin{matrix} r_{2} \times \frac{1}{7} \\ r_{3} - 21r_{2} \\ r_{1} + r_{2} \end{matrix}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \ \begin{matrix} - 2 \\ 0 \\ 0 \end{matrix}\ \ \ \ \ \begin{matrix} 0 \\ 1 \\ 0 \end{matrix}\ \ \ \ \ \begin{matrix} \frac{- 2}{7} \\ \frac{5}{7} \\ 0 \end{matrix} \right\rbrack

此即为A的行最简形

(2)进一步对A的行最简形作初等列变换:

A [ 1 0 0 2 0 0 0 1 0 2 7 5 7 0 ] c 2 c 3 [ 1 0 0 0 1 0 2 0 0 2 7 5 7 0 ] c 3 + 2 c 1 c 4 + 2 7 c 1 5 7 c 2 [ 1 0 0 0 1 0 0 0 0 0 0 0 ] \Rightarrow \left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \ \begin{matrix} - 2 \\ 0 \\ 0 \end{matrix}\ \ \ \ \ \begin{matrix} 0 \\ 1 \\ 0 \end{matrix}\ \ \ \ \ \begin{matrix} \frac{- 2}{7} \\ \frac{5}{7} \\ 0 \end{matrix} \right\rbrack\overset{c_{2} \longleftrightarrow c_{3}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \ \begin{matrix} 0 \\ 1 \\ 0 \end{matrix}\ \ \ \ \ \begin{matrix} - 2 \\ 0 \\ 0 \end{matrix}\ \ \ \ \ \begin{matrix} \frac{- 2}{7} \\ \frac{5}{7} \\ 0 \end{matrix} \right\rbrack\overset{\begin{matrix} c_{3} + 2c_{1} \\ c_{4} + \frac{2}{7}c_{1} - \frac{5}{7}c_{2} \end{matrix}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \ \begin{matrix} 0 \\ 1 \\ 0 \end{matrix}\ \ \ \ \ \begin{matrix} 0 \\ 0 \\ 0 \end{matrix}\ \ \ \ \ \begin{matrix} 0 \\ 0 \\ 0 \end{matrix} \right\rbrack

此即为A的标准形

例3.3设A是m×n矩阵 , m<n , 其秩R(A)=m , 则( )

(a)存在m阶不可逆矩阵Q , 使QA=(Em , O)

(b)存在m阶可逆矩阵P , 使PA=(Em , O)

(c)齐次线性方程组 Ax=0只有零解

(d)非齐次线性方程组Ax=b一定有无限多解

解: (a)不正确.

因由矩阵秩的性质R(AB)⩽min{R(A) , R(B)},

R(Q)⩾R(QA)=R(Em , O)=m , 与Q为m阶不可逆矩阵矛盾

(b)不正确.

若选项(b)成立 , 则A=P-1(Em , O)=(P-1 , O) , 其中O是m×(n-m)零矩阵.

这表明A的后n-m列均为零列向量.

但对于秩为m的m×n矩阵A来说 , 一般是不满足这一点的

例如A = [ 1 0 0 0 1 1 ] \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 1 \end{bmatrix}

(c)不正确. 反例: 取A = [ 1 0 0 0 1 1 ] \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 1 \end{bmatrix} , 则显然x= [ 0 1 1 ] \begin{bmatrix} 0 \\ 1 \\ - 1 \end{bmatrix} 是它的非零解

(d)正确. 证明如下:

此时 , 非齐次方程Ax=b的系数矩阵和增广矩阵库的秩

满足关系式m= R(A)⩽R(A , b)⩽m

于是 , R(A)= R(A , b)=m<n=未知数个数 , 从而这方程必有无限多解

例3.4设n元线性方程组 { a 11 x 1 + a 12 x 2 + + a 1 n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2 n x n = b 2 a n 1 x 1 + a n 2 x 2 + + a n n x n = b n \left\{ \begin{array}{r} \begin{matrix} a_{11}x_{1} + a_{12}x_{2} + \cdots + a_{1n}x_{n} = b_{1} \\ a_{21}x_{1} + a_{22}x_{2} + \cdots + a_{2n}x_{n} = b_{2} \end{matrix} \\ \begin{matrix} \cdots\cdots\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \cdots\cdots \\ a_{n1}x_{1} + a_{n2}x_{2} + \cdots + a_{nn}x_{n} = b_{n} \end{matrix} \end{array} \right.\ 的系数矩阵A的秩

与n+1阶矩阵C= [ a 11 a n 1 b 1 a 12 a n 2 b 2 a 1 n a n n b n b 1 b n 1 ] \left\lbrack \begin{array}{r} \begin{matrix} a_{11} \\ \vdots \end{matrix} \\ \begin{matrix} a_{n1} \\ b_{1} \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} a_{12} \\ \vdots \end{matrix} \\ \begin{matrix} a_{n2} \\ b_{2} \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} \cdots \\ \end{matrix} \\ \begin{matrix} \cdots \\ \cdots \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} a_{1n} \\ \vdots \end{matrix} \\ \begin{matrix} a_{nn} \\ b_{n} \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} b_{1} \\ \vdots \end{matrix} \\ \begin{matrix} b_{n} \\ 1 \end{matrix} \end{array} \right\rbrack 的秩相等

试证明此线性方程组必有解

证: 因为A= [ a 11 a n 1 a 12 a n 2 a 1 n a n n ] \left\lbrack \begin{matrix} a_{11} \\ \vdots \\ a_{n1} \end{matrix}\ \ \ \ \begin{matrix} a_{12} \\ \vdots \\ a_{n2} \end{matrix}\ \ \ \ \begin{matrix} \cdots \\ \\ \cdots \end{matrix}\ \ \ \ \begin{matrix} a_{1n} \\ \vdots \\ a_{nn} \end{matrix}\ \right\rbrack [A|b]= [ a 11 a n 1 a 12 a n 2 a 1 n a n n b 1 b n ] \left\lbrack \begin{matrix} a_{11} \\ \vdots \\ a_{n1} \end{matrix}\ \ \ \ \begin{matrix} a_{12} \\ \vdots \\ a_{n2} \end{matrix}\ \ \ \ \begin{matrix} \cdots \\ \\ \cdots \end{matrix}\ \ \ \ \begin{matrix} a_{1n} \\ \vdots \\ a_{nn} \end{matrix}\ \ \ \ \begin{matrix} b_{1} \\ \vdots \\ b_{n} \end{matrix} \right\rbrack

C= [ a 11 a n 1 b 1 a 12 a n 2 b 2 a 1 n a n n b n b 1 b n 1 ] \left\lbrack \begin{array}{r} \begin{matrix} a_{11} \\ \vdots \end{matrix} \\ \begin{matrix} a_{n1} \\ b_{1} \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} a_{12} \\ \vdots \end{matrix} \\ \begin{matrix} a_{n2} \\ b_{2} \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} \cdots \\ \end{matrix} \\ \begin{matrix} \cdots \\ \cdots \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} a_{1n} \\ \vdots \end{matrix} \\ \begin{matrix} a_{nn} \\ b_{n} \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} b_{1} \\ \vdots \end{matrix} \\ \begin{matrix} b_{n} \\ 1 \end{matrix} \end{array} \right\rbrack

利用秩的关系

因为 r a n k ( [ A b ] ) r a n k ( C ) rank(\lbrack A \mid b\rbrack) \leq rank(C)

因为 r a n k ( [ A b ] ) r a n k ( A ) rank(\lbrack A \mid b\rbrack) \leq rank(A)

因为 r a n k ( A ) = r a n k ( C ) rank(A) = rank(C)

所以 r a n k ( [ A b ] ) = r a n k ( A ) rank(\lbrack A \mid b\rbrack) = rank(A)

根据线性方程组解的判别定理,该方程组必有解。

例3.5设齐次线性方程组 { a x 1 + b x 2 + + b x n = 0 b x 1 + a x 2 + + b x n = 0 b x 1 + b x 2 + + a x n = 0 \left\{ \begin{array}{r} \begin{matrix} ax_{1} + bx_{2} + \cdots + bx_{n} = 0 \\ bx_{1} + ax_{2} + \cdots + bx_{n} = 0 \end{matrix} \\ \begin{matrix} \cdots\cdots\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \cdots\cdots \\ bx_{1} + bx_{2} + \cdots + ax_{n} = 0 \end{matrix} \end{array} \right.\ , 其中a≠0 , b≠0 , n⩾2

试讨论a , b为何值时 , 方程组仅有零解 , 有无限多解? 在有无限多解时,求通解

解:方程组的系数矩阵A的行列式det A= | a b b b a b b b a | \left| \begin{array}{r} \begin{matrix} a \\ b \end{matrix} \\ \begin{matrix} \vdots \\ b \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} b \\ a \end{matrix} \\ \begin{matrix} \vdots \\ b \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} \cdots \\ \cdots \end{matrix} \\ \begin{matrix} \\ \cdots \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} b \\ b \end{matrix} \\ \begin{matrix} \vdots \\ a \end{matrix} \end{array} \right| =[a+(n-1)b](a-b)n-1

情形1: a≠b且a≠(1-n)b , 方程组仅有零解

情形2: a=b , 对系数矩阵A进行初等行变换 , 并注意到a≠0

A= [ a a a a a a a a a ] r [ 1 0 0 1 0 0 1 0 0 ] \left\lbrack \begin{array}{r} \begin{matrix} a \\ a \end{matrix} \\ \begin{matrix} \vdots \\ a \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} a \\ a \end{matrix} \\ \begin{matrix} \vdots \\ a \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} \cdots \\ \cdots \end{matrix} \\ \begin{matrix} \\ \cdots \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} a \\ a \end{matrix} \\ \begin{matrix} \vdots \\ a \end{matrix} \end{array} \right\rbrack\overset{r}{\Rightarrow}\left\lbrack \begin{array}{r} \begin{matrix} 1 \\ 0 \end{matrix} \\ \begin{matrix} \vdots \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ 0 \end{matrix} \\ \begin{matrix} \vdots \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} \cdots \\ \cdots \end{matrix} \\ \begin{matrix} \\ \cdots \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ 0 \end{matrix} \\ \begin{matrix} \vdots \\ 0 \end{matrix} \end{array} \right\rbrack

即得原方程组的同解方程组x1+x2+⋯+xn=0

取x2 , ⋯ , xn为自由未知数 , 即得通解x=k1ξ1+k2ξ2+ ⋯ +kn-1ξn-1 ,

其中k1 , k2 , ⋯ , kn-1属于R , ξ1= [ 1 1 0 0 ] \left\lbrack \begin{array}{r} \begin{matrix} - 1 \\ 1 \\ 0 \end{matrix} \\ \begin{matrix} \vdots \\ 0 \end{matrix} \end{array} \right\rbrack , ξ2= [ 1 0 1 0 ] \left\lbrack \begin{array}{r} \begin{matrix} - 1 \\ 0 \\ 1 \end{matrix} \\ \begin{matrix} \vdots \\ 0 \end{matrix} \end{array} \right\rbrack , ⋯ ξn-1= [ 1 0 0 1 ] \left\lbrack \begin{array}{r} \begin{matrix} - 1 \\ 0 \\ 0 \end{matrix} \\ \begin{matrix} \vdots \\ 1 \end{matrix} \end{array} \right\rbrack

情形3 : a=(1-n)b , 对系数矩阵A进行初等行变换并注意到

A= [ ( 1 n ) b b b b ( 1 n ) b b b b ( 1 n ) b ] b [ 1 n 1 1 1 1 n 1 1 1 1 n ] \left\lbrack \begin{array}{r} \begin{matrix} (1 - n)b \\ b \end{matrix} \\ \begin{matrix} \vdots \\ b \end{matrix} \end{array}\ \ \ \ \ \ \begin{array}{r} \begin{matrix} b \\ (1 - n)b \end{matrix} \\ \begin{matrix} \vdots \\ b \end{matrix} \end{array}\ \ \ \ \ \ \begin{array}{r} \begin{matrix} \cdots \\ \cdots \end{matrix} \\ \begin{matrix} \\ \cdots \end{matrix} \end{array}\ \ \ \ \ \ \begin{array}{r} \begin{matrix} b \\ b \end{matrix} \\ \begin{matrix} \vdots \\ (1 - n)b \end{matrix} \end{array} \right\rbrack\overset{各行除以b}{\Rightarrow}\left\lbrack \begin{array}{r} \begin{matrix} 1 - n \\ 1 \end{matrix} \\ \begin{matrix} \vdots \\ 1 \end{matrix} \end{array}\ \ \ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ 1 - n \end{matrix} \\ \begin{matrix} \vdots \\ 1 \end{matrix} \end{array}\ \ \ \ \ \ \begin{array}{r} \begin{matrix} \cdots \\ \cdots \end{matrix} \\ \begin{matrix} \\ \cdots \end{matrix} \end{array}\ \ \ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ 1 \end{matrix} \\ \begin{matrix} \vdots \\ 1 - n \end{matrix} \end{array} \right\rbrack

r 1 r n r 2 r n r n 1 r n [ n 0 1 0 n 1 n n 1 n ] n 1 n , n [ 1 0 0 0 1 0 1 1 0 ] \overset{\begin{matrix} r_{1} - r_{n} \\ r_{2} - r_{n} \\ r_{n - 1} - r_{n} \end{matrix}}{\Rightarrow}\left\lbrack \begin{array}{r} \begin{matrix} - n \\ 0 \end{matrix} \\ \begin{matrix} \vdots \\ 1 \end{matrix} \end{array}\ \ \ \ \ \ \begin{array}{r} \begin{matrix} 0 \\ - n \end{matrix} \\ \begin{matrix} \vdots \\ 1 \end{matrix} \end{array}\ \ \ \ \ \ \begin{array}{r} \begin{matrix} \cdots \\ \cdots \end{matrix} \\ \begin{matrix} \\ \cdots \end{matrix} \end{array}\ \ \ \ \ \ \begin{array}{r} \begin{matrix} n \\ n \end{matrix} \\ \begin{matrix} \vdots \\ 1 - n \end{matrix} \end{array} \right\rbrack\overset{前n - 1行除以n\ ,\ 并加到第n行\ }{\Rightarrow}\left\lbrack \begin{array}{r} \begin{matrix} - 1 \\ 0 \end{matrix} \\ \begin{matrix} \vdots \\ 0 \end{matrix} \end{array}\ \ \ \ \ \ \begin{array}{r} \begin{matrix} 0 \\ - 1 \end{matrix} \\ \begin{matrix} \vdots \\ 0 \end{matrix} \end{array}\ \ \ \ \ \ \begin{array}{r} \begin{matrix} \cdots \\ \cdots \end{matrix} \\ \begin{matrix} \\ \cdots \end{matrix} \end{array}\ \ \ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ 1 \end{matrix} \\ \begin{matrix} \vdots \\ 0 \end{matrix} \end{array} \right\rbrack

于是 , 得到同解方程组 { x 1 = x n x 2 = x n x n 1 = x n \left\{ \begin{array}{r} \begin{matrix} x_{1} = x_{n} \\ x_{2} = x_{n} \end{matrix} \\ \begin{matrix} \vdots \\ x_{n - 1} = x_{n} \end{matrix} \end{array} \right.\

即得通解x=kξ , 其中k属于R , ξ=(1 , 1 , ⋯ ,)T