返回

12 , 设向量组B: b1 , b2 , ⋯ , br能由向量组A: a1 , a2 , ⋯ , as线性表示为

(b1 , b2 , ⋯ , br)=(a1 , a2 , ⋯ , as)K , 其中K为s×r矩阵 , 且A组线性无关

试证明向量组B线性无关的充要条件是矩阵K的秩R(K)=r

证:

先明确核心前提和定义

1.向量组线性无关的定义:

若存在一组常数k1,k2,,krk_{1},k_{2},\ldots,k_{r},使得k1b1+k2b2++krbr=0k_{1}b_{1} + k_{2}b_{2} + \ldots + k_{r}b_{r} = 0(零向量),

则只有k1=k2==kr=0k_{1} = k_{2} = \ldots = k_{r} = 0时等式成立,称B组线性无关。

2.矩阵乘法与向量组表示:

题目中(b1,b2,,br)=(a1,a2,,as)K(b_{1},b_{2},\ldots,b_{r}) = (a_{1},a_{2},\ldots,a_{s})K,其中KKs×rs \times r矩阵。

我们可以把这个等式转化为“线性组合的矩阵形式”:

设列向量x=(x1x2xr)x = \begin{pmatrix} x_{1} \\ x_{2} \\ \vdots \\ x_{r} \end{pmatrix},则x1b1+x2b2++xrbr=(b1,b2,,br)xx_{1}b_{1} + x_{2}b_{2} + \ldots + x_{r}b_{r} = (b_{1},b_{2},\ldots,b_{r})x

代入题目条件,得:(a1,a2,,as)Kx=0(a_{1},a_{2},\ldots,a_{s})Kx = 0

3.A组线性无关的关键性质:因为a1,,asa_{1},\ldots,a_{s}线性无关,所以由(a1,,as)y=0(a_{1},\ldots,a_{s})y = 0

yyss维列向量),只能推出y=0y = 0

第一步:证明必要性

目标:已知B组线性无关,证明矩阵KK的秩等于其列数rr

(因为KKs×rs \times r矩阵,秩最大为min(s,r)min(s,r),要证R(K)=rR(K) = r)。

证明过程:

1.假设存在rr维列向量xx,使得Kx=0Kx = 0(即齐次线性方程组Kx=0Kx = 0的解)。

2.两边左乘(a1,,as)(a_{1},\ldots,a_{s}),得:(a1,,as)Kx=(a1,,as)0=0(a_{1},\ldots,a_{s})Kx = (a_{1},\ldots,a_{s})0 = 0

3.由题目条件,(a1,,as)K=(b1,,br)(a_{1},\ldots,a_{s})K = (b_{1},\ldots,b_{r}),因此上式可化为:(b1,,br)x=0(b_{1},\ldots,b_{r})x = 0

4.因为B组线性无关,根据线性无关的定义,由(b1,,br)x=0(b_{1},\ldots,b_{r})x = 0只能推出x=0x = 0

5.这说明:齐次线性方程组Kx=0Kx = 0只有零解。

6.回忆线性方程组的核心定理:对于m×nm \times n矩阵MM

齐次方程组Mx=0Mx = 0只有零解的充要条件是R(M)=nR(M) = n(秩等于列数)。

这里KKs×rs \times r矩阵(m=s,n=rm = s,n = r),所以Kx=0Kx = 0只有零解⇒R(K)=rR(K) = r

结论:必要性得证(B线性无关⇒R(K)=r)。

第二步:证明充分性

目标:已知矩阵KK的秩R(K)=rR(K) = r,证明B组线性无关。

证明过程:

1.假设存在rr维列向量x=(x1x2xr)x = \begin{pmatrix} x_{1} \\ x_{2} \\ \vdots \\ x_{r} \end{pmatrix},使得(b1,,br)x=0(b_{1},\ldots,b_{r})x = 0

(即B组的线性组合为零向量,要证只有x=0x = 0)。

2.由题目条件(b1,,br)=(a1,,as)K(b_{1},\ldots,b_{r}) = (a_{1},\ldots,a_{s})K,代入上式得:(a1,,as)Kx=0(a_{1},\ldots,a_{s})Kx = 0

3.因为A组线性无关,根据A组的性质(前面强调的核心性质),

(a1,,as)y=0(a_{1},\ldots,a_{s})y = 0只能推出y=0y = 0。这里y=Kxy = Kx,因此:Kx=0Kx = 0

4.已知R(K)=rR(K) = r,而KKs×rs \times r矩阵(列数为rr)。

5.再次使用线性方程组的核心定理:

对于m×nm \times n矩阵MM,若R(M)=nR(M) = n(秩等于列数),

则齐次方程组Mx=0Mx = 0只有零解。

这里KK的秩R(K)=rR(K) = r(等于列数rr),所以Kx=0Kx = 0只有零解⇒x=0x = 0

6.这说明:由(b1,,br)x=0(b_{1},\ldots,b_{r})x = 0只能推出x=0x = 0

根据线性无关的定义,B组线性无关。

结论:充分性得证(R(K)=r⇒B线性无关)。

13 , 求下列向量组的秩 , 并求一个最大无关组

(1) a1=[1214]\left\lbrack \begin{array}{r} \begin{matrix} 1 \\ 2 \end{matrix} \\ \begin{matrix} - 1 \\ 4 \end{matrix} \end{array} \right\rbrack , a2=[9100104]\left\lbrack \begin{array}{r} \begin{matrix} 9 \\ 100 \end{matrix} \\ \begin{matrix} 10 \\ 4 \end{matrix} \end{array} \right\rbrack , a3=[2428]\left\lbrack \begin{array}{r} \begin{matrix} - 2 \\ - 4 \end{matrix} \\ \begin{matrix} 2 \\ - 8 \end{matrix} \end{array} \right\rbrack (2) a1=[1213]\left\lbrack \begin{array}{r} \begin{matrix} 1 \\ 2 \end{matrix} \\ \begin{matrix} 1 \\ 3 \end{matrix} \end{array} \right\rbrack , a2=[4156]\left\lbrack \begin{array}{r} \begin{matrix} 4 \\ - 1 \end{matrix} \\ \begin{matrix} - 5 \\ - 6 \end{matrix} \end{array} \right\rbrack , a3=[1347]\left\lbrack \begin{array}{r} \begin{matrix} 1 \\ - 3 \end{matrix} \\ \begin{matrix} - 4 \\ - 7 \end{matrix} \end{array} \right\rbrack

解:(1)对(a1 , a2 , a3)作初等行变换 , 求它的行阶梯形

(a1 , a2 , a3)=[121491001042428]r22r1r3+r1r44r1[100098219322000]r[100091002000]\left\lbrack \begin{array}{r} \begin{matrix} 1 \\ 2 \end{matrix} \\ \begin{matrix} - 1 \\ 4 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 9 \\ 100 \end{matrix} \\ \begin{matrix} 10 \\ 4 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} - 2 \\ - 4 \end{matrix} \\ \begin{matrix} 2 \\ - 8 \end{matrix} \end{array} \right\rbrack\overset{\begin{matrix} r_{2} - 2r_{1} \\ r_{3} + r_{1} \\ r_{4} - 4r_{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} 9 \\ 82 \end{matrix} \\ \begin{matrix} 19 \\ - 32 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} - 2 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array} \right\rbrack\overset{r}{\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} 9 \\ 1 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} - 2 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array} \right\rbrack

由此可知R(a1 , a2 , a3)=2 , 并且a1 , a2是它的一个最大无关组

(2) (a1 , a2 , a3)=[121341561347]r22r1r3r1r43r1[10004991815510]r[100049001500]\left\lbrack \begin{array}{r} \begin{matrix} 1 \\ 2 \end{matrix} \\ \begin{matrix} 1 \\ 3 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 4 \\ - 1 \end{matrix} \\ \begin{matrix} - 5 \\ - 6 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ - 3 \end{matrix} \\ \begin{matrix} - 4 \\ - 7 \end{matrix} \end{array} \right\rbrack\overset{\begin{matrix} r_{2} - 2r_{1} \\ r_{3} - r_{1} \\ r_{4} - 3r_{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} 4 \\ - 9 \end{matrix} \\ \begin{matrix} - 9 \\ - 18 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ - 5 \end{matrix} \\ \begin{matrix} - 5 \\ - 10 \end{matrix} \end{array} \right\rbrack\overset{r}{\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} 4 \\ 9 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ 5 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array} \right\rbrack

由此可知R(a1 , a2 , a3)=2 , 并且a1 , a2是它的一个最大无关组

14 , 利用初等行变换求下列矩阵的列向量组的一个最大无关组

并把其余列向量用最大无关组线性表示

(1) [2575752531949432175354204313213448]\left\lbrack \begin{array}{r} \begin{matrix} 25 \\ 75 \end{matrix} \\ \begin{matrix} 75 \\ 25 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 31 \\ 94 \end{matrix} \\ \begin{matrix} 94 \\ 32 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 17 \\ 53 \end{matrix} \\ \begin{matrix} 54 \\ 20 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 43 \\ 132 \end{matrix} \\ \begin{matrix} 134 \\ 48 \end{matrix} \end{array} \right\rbrack (2) [10211201213025141131]\left\lbrack \begin{array}{r} \begin{matrix} 1 \\ 0 \end{matrix} \\ \begin{matrix} 2 \\ 1 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ 2 \end{matrix} \\ \begin{matrix} 0 \\ 1 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 2 \\ 1 \end{matrix} \\ \begin{matrix} 3 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 2 \\ 5 \end{matrix} \\ \begin{matrix} - 1 \\ 4 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ - 1 \end{matrix} \\ \begin{matrix} 3 \\ - 1 \end{matrix} \end{array} \right\rbrack

解: (1)记A=(a1 , a2 , a3 , a4)

因A=[2575752531949432175354204313213448]r4r1r3r2r22r1[25000311011721343325]r4r2r4r3[25000311001721043320]\left\lbrack \begin{array}{r} \begin{matrix} 25 \\ 75 \end{matrix} \\ \begin{matrix} 75 \\ 25 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 31 \\ 94 \end{matrix} \\ \begin{matrix} 94 \\ 32 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 17 \\ 53 \end{matrix} \\ \begin{matrix} 54 \\ 20 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 43 \\ 132 \end{matrix} \\ \begin{matrix} 134 \\ 48 \end{matrix} \end{array} \right\rbrack\overset{\begin{matrix} r_{4} - r_{1} \\ r_{3} - r_{2} \\ r_{2} - 2r_{1} \end{matrix}}{\Rightarrow}\left\lbrack \begin{array}{r} \begin{matrix} 25 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 31 \\ 1 \end{matrix} \\ \begin{matrix} 0 \\ 1 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 17 \\ 2 \end{matrix} \\ \begin{matrix} 1 \\ 3 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 43 \\ 3 \end{matrix} \\ \begin{matrix} 2 \\ 5 \end{matrix} \end{array} \right\rbrack\overset{\begin{matrix} r_{4} - r_{2} \\ r_{4} - r_{3} \end{matrix}}{\Rightarrow}\left\lbrack \begin{array}{r} \begin{matrix} 25 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 31 \\ 1 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 17 \\ 2 \end{matrix} \\ \begin{matrix} 1 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 43 \\ 3 \end{matrix} \\ \begin{matrix} 2 \\ 0 \end{matrix} \end{array} \right\rbrack

r117r3r22r3[250003110000109120]r131r2[250000100001040120]r1÷25[10000100001085120]\overset{\begin{matrix} r_{1} - 17r_{3} \\ r_{2} - 2r_{3} \end{matrix}}{\Rightarrow}\left\lbrack \begin{array}{r} \begin{matrix} 25 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 31 \\ 1 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 0 \\ 0 \end{matrix} \\ \begin{matrix} 1 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 9 \\ - 1 \end{matrix} \\ \begin{matrix} 2 \\ 0 \end{matrix} \end{array} \right\rbrack\overset{r_{1} - 31r_{2}}{\Rightarrow}\left\lbrack \begin{array}{r} \begin{matrix} 25 \\ 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} 0 \\ 0 \end{matrix} \\ \begin{matrix} 1 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 40 \\ - 1 \end{matrix} \\ \begin{matrix} 2 \\ 0 \end{matrix} \end{array} \right\rbrack\overset{r_{1} \div 25}{\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} 0 \\ 0 \end{matrix} \\ \begin{matrix} 1 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} \frac{8}{5} \\ - 1 \end{matrix} \\ \begin{matrix} 2 \\ 0 \end{matrix} \end{array} \right\rbrack

从A的行最简形可知: a1 , a2 , a3是A的列向量组的一个最大无关组

且a4=85\frac{8}{5}a1 - a2 +2a3

(2)记A=(a1 , a2 , a3 , a4 , a5)

A=[10211201213025141131]r32r1r4r1[10001220211225521112]\left\lbrack \begin{array}{r} \begin{matrix} 1 \\ 0 \end{matrix} \\ \begin{matrix} 2 \\ 1 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ 2 \end{matrix} \\ \begin{matrix} 0 \\ 1 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 2 \\ 1 \end{matrix} \\ \begin{matrix} 3 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 2 \\ 5 \end{matrix} \\ \begin{matrix} - 1 \\ 4 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ - 1 \end{matrix} \\ \begin{matrix} 3 \\ - 1 \end{matrix} \end{array} \right\rbrack\overset{\begin{matrix} r_{3} - 2r_{1} \\ r_{4} - r_{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} 1 \\ 2 \end{matrix} \\ \begin{matrix} - 2 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 2 \\ 1 \end{matrix} \\ \begin{matrix} - 1 \\ - 2 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 2 \\ 5 \end{matrix} \\ \begin{matrix} - 5 \\ 2 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ - 1 \end{matrix} \\ \begin{matrix} 1 \\ - 2 \end{matrix} \end{array} \right\rbrack

r3+r2r4÷(2)r3r4[10001200211025101110]r12r3r2r3[10001200001046101210]\overset{\begin{matrix} r_{3} + r_{2} \\ r_{4} \div ( - 2) \\ r_{3} \leftrightarrow r_{4} \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} 1 \\ 2 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 2 \\ 1 \end{matrix} \\ \begin{matrix} 1 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 2 \\ 5 \end{matrix} \\ \begin{matrix} - 1 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ - 1 \end{matrix} \\ \begin{matrix} 1 \\ 0 \end{matrix} \end{array} \right\rbrack\overset{\begin{matrix} r_{1} - 2r_{3} \\ r_{2} - r_{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} 1 \\ 2 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 0 \\ 0 \end{matrix} \\ \begin{matrix} 1 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 4 \\ 6 \end{matrix} \\ \begin{matrix} - 1 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} - 1 \\ - 2 \end{matrix} \\ \begin{matrix} 1 \\ 0 \end{matrix} \end{array} \right\rbrack

r2÷2r1r2[10000100001013100110]\overset{\begin{matrix} r_{2} \div 2 \\ r_{1} - r_{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} 0 \\ 0 \end{matrix} \\ \begin{matrix} 1 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 1 \\ 3 \end{matrix} \\ \begin{matrix} - 1 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} 0 \\ - 1 \end{matrix} \\ \begin{matrix} 1 \\ 0 \end{matrix} \end{array} \right\rbrack

从A的行最简形可知: a1 , a2 , a3是A的列向量组的一个最大无关组

且a4=a1+3a2-a3 , a5=-a2+a3

15 , 设向量组a1=[a31]\begin{bmatrix} a \\ 3 \\ 1 \end{bmatrix} , a2=[2b3]\begin{bmatrix} 2 \\ b \\ 3 \end{bmatrix} , a3=[121]\begin{bmatrix} 1 \\ 2 \\ 1 \end{bmatrix} , a4=[231]\begin{bmatrix} 2 \\ 3 \\ 1 \end{bmatrix}的秩为2 , 求a , b

解: 对含参数a和b的矩阵(a3 , a4 , a1 , a2)作初等行变换 , 以求其行阶梯形

(a3 , a4 , a1 , a2)=[121231a312b3]\left\lbrack \begin{matrix} 1 \\ 2 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 2 \\ 3 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} a \\ 3 \\ 1 \end{matrix}\ \ \ \ \begin{matrix} 2 \\ b \\ 3 \end{matrix} \right\rbrack

r22r1r3r1[100211a32a1a2b41]r3r2[100210a32aa22b45b]\overset{\begin{matrix} r_{2} - 2r_{1} \\ r_{3} - r_{1} \end{matrix}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \ \ \begin{matrix} 2 \\ - 1 \\ - 1 \end{matrix}\ \ \ \ \ \ \begin{matrix} a \\ 3 - 2a \\ 1 - a \end{matrix}\ \ \ \ \ \ \begin{matrix} 2 \\ b - 4 \\ 1 \end{matrix} \right\rbrack\overset{r_{3} - r_{2}}{\Rightarrow}\left\lbrack \begin{matrix} 1 \\ 0 \\ 0 \end{matrix}\ \ \ \ \ \ \begin{matrix} 2 \\ - 1 \\ 0 \end{matrix}\ \ \ \ \ \ \begin{matrix} a \\ 3 - 2a \\ a - 2 \end{matrix}\ \ \ \ \ \ \begin{matrix} 2 \\ b - 4 \\ 5 - b \end{matrix} \right\rbrack

故R(a1 , a2 , a3 , a4)=2 ⟺R(a3 , a4 , a1 , a2)=2⟺a-2=0且5-b=0 , 得a=2 , b=5

16 , 设向量组A: a1 , a2 ; B: a1 , a2 , a3; C: a1 , a2 , a4的秩为RA=RB=2 , RC=3

求向量组D: a1 , a2 , 2a3 -3a4的秩

解:

定义法(基于线性无关性判定)

核心思路:向量组的秩是其极大线性无关组的向量个数,

需证明a1,a2,2a33a4a_{1},a_{2},2a_{3} - 3a_{4}线性无关,进而得秩为3。

步骤:

1.由RA=2R_{A} = 2得基础性质:

向量组A:a1,a2A:a_{1},a_{2}的秩为2,故a1,a2a_{1},a_{2}线性无关,

2.由RB=2R_{B} = 2推导a3a_{3}的表达式:

向量组B:a1,a2,a3B:a_{1},a_{2},a_{3}的秩为2,而a1,a2a_{1},a_{2}已线性无关,

a3a_{3}可由a1,a2a_{1},a_{2}线性表示(极大无关组为a1,a2a_{1},a_{2}),

即存在常数k1,k2k_{1},k_{2}使得:a3=k1a1+k2a2a_{3} = k_{1}a_{1} + k_{2}a_{2}

3.由RC=3R_{C} = 3推导2a33a42a_{3} - 3a_{4}a1,a2a_{1},a_{2}线性无关:

向量组C:a1,a2,a4C:a_{1},a_{2},a_{4}的秩为3,故a1,a2,a4a_{1},a_{2},a_{4}线性无关。

假设存在常数x1,x2,x3x_{1},x_{2},x_{3}使得:x1a1+x2a2+x3(2a33a4)=0x_{1}a_{1} + x_{2}a_{2} + x_{3}(2a_{3} - 3a_{4}) = 0

a3=k1a1+k2a2a_{3} = k_{1}a_{1} + k_{2}a_{2}代入上式,

整理得:(x1+2x3k1)a1+(x2+2x3k2)a23x3a4=0(x_{1} + 2x_{3}k_{1})a_{1} + (x_{2} + 2x_{3}k_{2})a_{2} - 3x_{3}a_{4} = 0

a1,a2,a4a_{1},a_{2},a_{4}线性无关,故系数必须全为0:{x1+2x3k1=0x2+2x3k2=03x3=0\left\{ \begin{matrix} x_{1} + 2x_{3}k_{1} = 0 \\ x_{2} + 2x_{3}k_{2} = 0 \\ - 3x_{3} = 0 \end{matrix} \right.\

解得x3=0x_{3} = 0,进而x1=0,x2=0x_{1} = 0,x_{2} = 0。因此a1,a2,2a33a4a_{1},a_{2},2a_{3} - 3a_{4}线性无关。

4.结论:线性无关的向量组秩等于向量个数,故RD=3R_{D} = 3

17 , 设有n维向量组A: a1 , a2 , ⋯ , an

试证明它们线性无关的充要条件 是任一n维向量都可由它们线性表示

证:

方法:利用向量组秩与空间维数的关系

核心依据:n维向量空间n\mathbb{R}^{n}的维数为n

(所有n维向量构成的空间,其基的个数为n);

向量组的秩等于其生成子空间的维数;线性无关向量组的秩等于向量个数。

证明过程:

1.必要性(线性无关⇒任一n维向量可由A表示)

𝒂𝟏,𝒂𝟐,,𝒂𝒏\mathbf{a}_{\mathbf{1}},\mathbf{a}_{\mathbf{2}},\ldots,\mathbf{a}_{\mathbf{n}}线性无关,则向量组A的秩R(A)=nR(A) = n

(线性无关向量组的秩=向量个数)。

向量组A生成的子空间L(𝒂𝟏,,𝒂𝒏)nL(\mathbf{a}_{\mathbf{1}},\ldots,\mathbf{a}_{\mathbf{n}}) \subseteq \mathbb{R}^{n},且子空间的维数dimL(A)=R(A)=n\dim L(A) = R(A) = n

n\mathbb{R}^{n}是n维空间,且其子空间L(A)L(A)也是n维,故L(A)=nL(A) = \mathbb{R}^{n}

(n维空间的n维子空间必为自身)。

因此,任一n维向量𝜷n=L(A)\mathbf{\beta} \in \mathbb{R}^{n} = L(A),即𝜷\mathbf{\beta}可由𝒂𝟏,,𝒂𝒏\mathbf{a}_{\mathbf{1}},\ldots,\mathbf{a}_{\mathbf{n}}线性表示。

2.充分性(任一n维向量可由A表示⇒线性无关)

n\mathbb{R}^{n}的标准基𝜺𝟏=(1,0,,0)T,𝜺𝟐=(0,1,,0)T,,𝜺𝒏=(0,0,,1)T\mathbf{\varepsilon}_{\mathbf{1}} = (1,0,\ldots,0)^{T},\mathbf{\varepsilon}_{\mathbf{2}} = (0,1,\ldots,0)^{T},\ldots,\mathbf{\varepsilon}_{\mathbf{n}} = (0,0,\ldots,1)^{T}

(标准基是线性无关的n维向量组)。

由条件,每个𝜺𝒊\mathbf{\varepsilon}_{\mathbf{i}}可由𝒂𝟏,,𝒂𝒏\mathbf{a}_{\mathbf{1}},\ldots,\mathbf{a}_{\mathbf{n}}线性表示,故向量组{𝜺𝟏,,𝜺𝒏}\{\mathbf{\varepsilon}_{\mathbf{1}},\ldots,\mathbf{\varepsilon}_{\mathbf{n}}\}可由A线性表示。

根据向量组秩的性质:若向量组X可由向量组Y线性表示,则R(X)R(Y)R(X) \leq R(Y)

{𝜺𝟏,,𝜺𝒏}\{\mathbf{\varepsilon}_{\mathbf{1}},\ldots,\mathbf{\varepsilon}_{\mathbf{n}}\}线性无关,故R(𝜺𝟏,,𝜺𝒏)=nR(\mathbf{\varepsilon}_{\mathbf{1}},\ldots,\mathbf{\varepsilon}_{\mathbf{n}}) = n,因此nR(A)n \leq R(A)

又因A是含n个向量的n维向量组,其秩R(A)nR(A) \leq n

(向量组的秩不超过向量个数)。

R(A)=nR(A) = n,即𝒂𝟏,,𝒂𝒏\mathbf{a}_{\mathbf{1}},\ldots,\mathbf{a}_{\mathbf{n}}线性无关(秩=向量个数的向量组线性无关)。

18 , 设向量组a1 , a2 , ⋯ , am线性相关 , 且a1≠0

试证明存在某个向量ak(2⩽k⩽m) , 使ak能由a1 , a2 , ⋯ , ak-1线性表示

证:由于向量组𝒂1,𝒂2,,𝒂m\mathbf{a}_{1},\mathbf{a}_{2},\ldots,\mathbf{a}_{m}是线性相关的,

那么一定至少存在一个不为0的系数c,使得c1𝒂1+c2𝒂2++cm𝒂m=𝟎.c_{1}\mathbf{a}_{1} + c_{2}\mathbf{a}_{2} + \cdots + c_{m}\mathbf{a}_{m} = \mathbf{0}.

kk是最大的下标(1km1 \leq k \leq m)使得ck0c_{k} \neq 0

由于系数c不全为零,这样的下标kk一定存在。

k=1k = 1,则向量组只有一个向量,表出式为c1𝒂1=𝟎c_{1}\mathbf{a}_{1} = \mathbf{0}

因为向量组线性相关,需要c10c_{1} \neq 0,这样导致𝒂1=𝟎\mathbf{a}_{1} = \mathbf{0},这与已知a1≠0矛盾。

故向量组至少有2个向量,k2k \geq 2

因此有表出式c1𝒂1+c2𝒂2++ck𝒂k=𝟎c_{1}\mathbf{a}_{1} + c_{2}\mathbf{a}_{2} + \cdots + c_{k}\mathbf{a}_{k} = \mathbf{0}成立,ck0.其中{系数c}_{k} \neq 0.

可解出:𝒂k=c1ck𝒂1c2ck𝒂2ck1ck𝒂k1,\mathbf{a}_{k} = - \frac{c_{1}}{c_{k}}\mathbf{a}_{1} - \frac{c_{2}}{c_{k}}\mathbf{a}_{2} - \cdots - \frac{c_{k - 1}}{c_{k}}\mathbf{a}_{k - 1},

即向量𝒂k\mathbf{a}_{k}可由𝒂1,𝒂2,,𝒂k1\mathbf{a}_{1},\mathbf{a}_{2},\ldots,\mathbf{a}_{k - 1}线性表示。且2km2 \leq k \leq m,满足要求。

所以存在某个向量ak(2⩽k⩽m) , 使ak能由a1 , a2 , ⋯ , ak-1线性表示