✍ 写在前面
本笔记为 Coldrain 二刷基础时所记,故笔记内容并没有做到全覆盖,而只针对每一章节重要且容易遗忘的知识点,所以本笔记可用于一轮学习结束之后对重难考点进行查漏补缺,但请不要用于替代考研书籍来进行一轮复习
“岂不闻天无绝人之路,只要我想走,路就在脚下。”—— 25 奥本海豚
1. 行列式
n 阶行列式
∣ a 11 a 12 ⋯ a 1 n a 21 a 22 ⋯ a 2 n ⋮ ⋮ ⋮ a n 1 a n 2 ⋯ a n n ∣ = ∑ j 1 j 2 ⋯ j n ( − 1 ) τ ( j 1 j 2 . . . j n ) a 1 j 1 a 2 j 2 a n j n \begin{vmatrix} a_{11} & a_{12} & \cdots & a_{1n} \\ a_{21} & a_{22} & \cdots & a_{2n} \\ \vdots & \vdots & & \vdots \\ a_{n1} & a_{n2} & \cdots & a_{nn} \end{vmatrix} = \sum\limits_{j_1 j_2 \cdots j_n} (-1)^{\tau(j_1 j_2 ... j_n)} a_{1j_1} a_{2j_2} a_{nj_n} a 11 a 21 ⋮ a n 1 a 12 a 22 ⋮ a n 2 ⋯ ⋯ ⋯ a 1 n a 2 n ⋮ a nn = j 1 j 2 ⋯ j n ∑ ( − 1 ) τ ( j 1 j 2 ... j n ) a 1 j 1 a 2 j 2 a n j n
逆序数:一个排列中,如果一个大的数排在小的数之前,就称这两个数构成一个逆序 ,而一个排列中逆序的总数称为这个排列的逆序数,记作 τ ( j 1 j 2 . . . j n ) \tau(j_1 j_2 ... j_n) τ ( j 1 j 2 ... j n )
行列式的性质
(1)∣ A T ∣ = ∣ A ∣ |A^T| = |A| ∣ A T ∣ = ∣ A ∣
(2)两行(或两列)互换,行列式变号
(3)两行(或两列)相同或对应成比例,行列式的值为 0
(4)用数 k k k 乘行列式 ∣ A ∣ |A| ∣ A ∣ 等于用 k k k 乘它的某行或某列
(5)如果行列式某行(某列)是两个元素之和,则可以把行列式拆成两个行列式之和
(6)把某行(某列)的 k k k 倍加到另一行(或列),行列式值不变
💡 行列式与矩阵的区别
注意区分 k ∣ A ∣ k|A| k ∣ A ∣ 和 k A kA k A :k ( a b c d ) = ( k a k b k c k d ) k \begin{pmatrix} a & b \\ c & d \end{pmatrix} = \begin{pmatrix} ka & kb \\ kc & kd \end{pmatrix} k ( a c b d ) = ( k a k c k b k d ) (∣ k A ∣ = k n ∣ A ∣ |kA| = k^n |A| ∣ k A ∣ = k n ∣ A ∣ )
注意区分 A + B A + B A + B 和 ∣ A ∣ + ∣ B ∣ |A| + |B| ∣ A ∣ + ∣ B ∣ :( a 1 b 1 c 1 d 1 ) + ( a 2 b 2 c 2 d 2 ) = ( a 1 + a 2 b 1 + b 2 c 1 + c 2 d 1 + d 2 ) \begin{pmatrix} a_1 & b_1 \\ c_1 & d_1 \end{pmatrix} + \begin{pmatrix} a_2 & b_2 \\ c_2 & d_2 \end{pmatrix} = \begin{pmatrix} a_1 + a_2 & b_1 + b_2 \\ c_1+c_2 & d_1+d_2 \end{pmatrix} ( a 1 c 1 b 1 d 1 ) + ( a 2 c 2 b 2 d 2 ) = ( a 1 + a 2 c 1 + c 2 b 1 + b 2 d 1 + d 2 ) ,而 ∣ a 1 b 1 c 1 d 1 ∣ + ∣ a 2 b 2 c 1 d 1 ∣ = ∣ a 1 + a 2 b 1 + b 2 c 1 d 1 ∣ \begin{vmatrix} a_1 & b_1 \\ c_1 & d_1 \end{vmatrix} + \begin{vmatrix} a_2 & b_2 \\ c_1 & d_1 \end{vmatrix} = \begin{vmatrix} a_1 + a_2 & b_1 + b_2 \\ c_1 & d_1 \end{vmatrix} a 1 c 1 b 1 d 1 + a 2 c 1 b 2 d 1 = a 1 + a 2 c 1 b 1 + b 2 d 1
行列式展开公式
(1)余子式:在 n n n 阶行列式 ∣ a 11 a 12 ⋯ a 1 n a 21 a 22 ⋯ a 2 n ⋮ ⋮ ⋮ a n 1 a n 2 ⋯ a n n ∣ \begin{vmatrix} a_{11} & a_{12} & \cdots & a_{1n} \\ a_{21} & a_{22} & \cdots & a_{2n} \\ \vdots & \vdots & & \vdots \\ a_{n1} & a_{n2} & \cdots & a_{nn} \end{vmatrix} a 11 a 21 ⋮ a n 1 a 12 a 22 ⋮ a n 2 ⋯ ⋯ ⋯ a 1 n a 2 n ⋮ a nn 中划去 a i j a_{ij} a ij 所在的第 i i i 行和第 j j j 列的元素,由剩下的元素构成的一个 n − 1 n-1 n − 1 阶行列式称为 a i j a_{ij} a ij 的余子式,记为 M i j M_{ij} M ij
(2)代数余子式:A i j = ( − 1 ) i + j M i j A_{ij} = (-1)^{i+j} M_{ij} A ij = ( − 1 ) i + j M ij
(3)行列式按行展开:∣ A ∣ = a i 1 A i 1 + a i 2 A i 2 + ⋯ + a i n A i n = ∑ k = 1 n a i k A i k |A| = a_{i1}A_{i1} + a_{i2}A_{i2} + \cdots + a_{in}A_{in} = \sum\limits_{k=1}^n a_{ik}A_{ik} ∣ A ∣ = a i 1 A i 1 + a i 2 A i 2 + ⋯ + a in A in = k = 1 ∑ n a ik A ik
(4)行列式按列展开:∣ A ∣ = a 1 j A 1 j + a 2 j A 2 j + ⋯ + a n j A n j = ∑ k = 1 n a k j A k j |A| = a_{1j}A_{1j} + a_{2j}A_{2j} + \cdots + a_{nj}A_{nj} = \sum\limits_{k=1}^n a_{kj}A_{kj} ∣ A ∣ = a 1 j A 1 j + a 2 j A 2 j + ⋯ + a nj A nj = k = 1 ∑ n a k j A k j
(5)行列式任一行(列)元素与另一行(列)元素的代数余子式乘积之和为 0,即 ∑ k = 1 n a i k A j k = a i 1 A j 1 + a i 2 A j 2 + ⋯ + a i n A j n = 0 , i ≠ j \sum\limits_{k=1}^n a_{ik}A_{jk} = a_{i1}A_{j1} + a_{i2}A_{j2} + \cdots + a_{in}A_{jn} = 0, i\ne j k = 1 ∑ n a ik A j k = a i 1 A j 1 + a i 2 A j 2 + ⋯ + a in A j n = 0 , i = j (∑ k = 1 n a k i A k j = a 1 i A 1 j + a 2 i A 2 j + ⋯ + a n i A n j = 0 , i ≠ j \sum\limits_{k=1}^n a_{ki}A_{kj} = a_{1i}A_{1j} + a_{2i}A_{2j} + \cdots + a_{ni}A_{nj} = 0, i\ne j k = 1 ∑ n a k i A k j = a 1 i A 1 j + a 2 i A 2 j + ⋯ + a ni A nj = 0 , i = j )
💡 学会展开之后,做题时有一种比较巧妙的操作:加边
(1)设 x 1 x 2 x 3 x 4 ≠ 0 x_1 x_2 x_3 x_4 \ne 0 x 1 x 2 x 3 x 4 = 0 ,则 ∣ x 1 + a 1 2 a 1 a 2 a 1 a 3 a 1 a 4 a 2 a 1 x 2 + a 2 2 a 2 a 3 a 2 a 4 a 3 a 1 a 3 a 2 x 3 + a 3 2 a 3 a 4 a 4 a 1 a 4 a 2 a 4 a 3 x 4 + a 4 2 ∣ = ∣ 1 a 1 a 2 a 3 a 4 0 x 1 + a 1 2 a 1 a 2 a 1 a 3 a 1 a 4 0 a 2 a 1 x 2 + a 2 2 a 2 a 3 a 2 a 4 0 a 3 a 1 a 3 a 2 x 3 + a 3 2 a 3 a 4 0 a 4 a 1 a 4 a 2 a 4 a 3 x 4 + a 4 2 ∣ = ∣ 1 a 1 a 2 a 3 a 4 − a 1 x 1 0 0 0 − a 2 0 x 2 0 0 − a 3 0 0 x 3 0 − a 4 0 0 0 x 4 ∣ = ∣ 1 + ∑ i = 1 4 a i 2 x i 2 0 0 0 0 − a 1 x 1 0 0 0 − a 2 0 x 2 0 0 − a 3 0 0 x 3 0 − a 4 0 0 0 x 4 ∣ = x 1 x 2 x 3 x 4 ( 1 + ∑ i = 1 4 a i 2 x i 2 ) \begin{vmatrix} x_1 + a_1^2 & a_1a_2 & a_1a_3 & a_1a_4 \\ a_2a_1 & x_2 + a_2^2 & a_2a_3 & a_2a_4 \\ a_3a_1 & a_3a_2 & x_3 + a_3^2 & a_3a_4 \\ a_4a_1 & a_4a_2 & a_4a_3 & x_4 + a_4^2 \end{vmatrix} = \begin{vmatrix} 1 & a_1 & a_2 & a_3 & a_4 \\ 0 & x_1 + a_1^2 & a_1a_2 & a_1a_3 & a_1a_4 \\ 0 & a_2a_1 & x_2 + a_2^2 & a_2a_3 & a_2a_4 \\ 0 & a_3a_1 & a_3a_2 & x_3 + a_3^2 & a_3a_4 \\ 0 & a_4a_1 & a_4a_2 & a_4a_3 & x_4 + a_4^2 \end{vmatrix} = \begin{vmatrix} 1 & a_1 & a_2 & a_3 & a_4 \\ -a_1 & x_1 & 0 & 0 & 0 \\ -a_2 & 0 & x_2 & 0 & 0 \\ -a_3 & 0 & 0 & x_3 & 0 \\ -a_4 & 0 & 0 & 0 & x_4 \end{vmatrix} = \begin{vmatrix} 1 + \sum\limits_{i=1}^{4} \frac{a_i^2}{x_i^2} & 0 & 0 & 0 & 0 \\ -a_1 & x_1 & 0 & 0 & 0 \\ -a_2 & 0 & x_2 & 0 & 0 \\ -a_3 & 0 & 0 & x_3 & 0 \\ -a_4 & 0 & 0 & 0 & x_4 \end{vmatrix} = x_1 x_2 x_3 x_4(1 + \sum\limits_{i=1}^{4}\frac{a_i^2}{x_i^2}) x 1 + a 1 2 a 2 a 1 a 3 a 1 a 4 a 1 a 1 a 2 x 2 + a 2 2 a 3 a 2 a 4 a 2 a 1 a 3 a 2 a 3 x 3 + a 3 2 a 4 a 3 a 1 a 4 a 2 a 4 a 3 a 4 x 4 + a 4 2 = 1 0 0 0 0 a 1 x 1 + a 1 2 a 2 a 1 a 3 a 1 a 4 a 1 a 2 a 1 a 2 x 2 + a 2 2 a 3 a 2 a 4 a 2 a 3 a 1 a 3 a 2 a 3 x 3 + a 3 2 a 4 a 3 a 4 a 1 a 4 a 2 a 4 a 3 a 4 x 4 + a 4 2 = 1 − a 1 − a 2 − a 3 − a 4 a 1 x 1 0 0 0 a 2 0 x 2 0 0 a 3 0 0 x 3 0 a 4 0 0 0 x 4 = 1 + i = 1 ∑ 4 x i 2 a i 2 − a 1 − a 2 − a 3 − a 4 0 x 1 0 0 0 0 0 x 2 0 0 0 0 0 x 3 0 0 0 0 0 x 4 = x 1 x 2 x 3 x 4 ( 1 + i = 1 ∑ 4 x i 2 a i 2 )
💡 余子式与代数余子式的计算问题一般有三种方法
(1)余子式的定义(计算 1~2 个余子式时适用)
(2)展开定理(计算一行或一列余子式适用):k 1 A i 1 + k 2 A i 2 + ⋯ + k n A i n = ∣ ⋮ ⋮ ⋮ ⋮ k 1 k 2 ⋯ k n ⋮ ⋮ ⋮ ⋮ ∣ k_1 A_{i1} + k_2 A_{i2} + \cdots + k_n A_{in} = \begin{vmatrix} \vdots & \vdots & \vdots & \vdots \\ k_1 & k_2 & \cdots & k_n \\ \vdots & \vdots & \vdots & \vdots \end{vmatrix} k 1 A i 1 + k 2 A i 2 + ⋯ + k n A in = ⋮ k 1 ⋮ ⋮ k 2 ⋮ ⋮ ⋯ ⋮ ⋮ k n ⋮
(3)伴随矩阵(题目需要计算所有代数余子式时适用)
特殊行列式
(1)上(下)三角形行列式的值等于主对角线元素的乘积:∣ a 11 a 12 ⋯ a 1 n 0 a 22 ⋯ a 2 n ⋮ ⋮ ⋱ ⋮ 0 0 ⋯ a n n ∣ = ∣ a 11 0 ⋯ 0 a 21 a 22 ⋯ 0 ⋮ ⋮ ⋮ a n 1 a n 2 ⋯ a n n ∣ = a 11 a 22 ⋯ a n n \begin{vmatrix} a_{11} & a_{12} & \cdots & a_{1n} \\ 0 & a_{22} & \cdots & a_{2n} \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \cdots & a_{nn} \end{vmatrix} = \begin{vmatrix} a_{11} & 0 & \cdots & 0 \\ a_{21} & a_{22} & \cdots & 0 \\ \vdots & \vdots & & \vdots \\ a_{n1} & a_{n2} & \cdots & a_{nn} \end{vmatrix} = a_{11} a_{22} \cdots a_{nn} a 11 0 ⋮ 0 a 12 a 22 ⋮ 0 ⋯ ⋯ ⋱ ⋯ a 1 n a 2 n ⋮ a nn = a 11 a 21 ⋮ a n 1 0 a 22 ⋮ a n 2 ⋯ ⋯ ⋯ 0 0 ⋮ a nn = a 11 a 22 ⋯ a nn
(2)关于副对角线的行列式:∣ a 11 ⋯ a 1 , n − 1 a 1 , n a 21 ⋯ a 2 , n − 1 a 2 n ⋮ ⋮ ⋮ a n 1 ⋯ 0 0 ∣ = ∣ 0 ⋯ 0 a 1 , n 0 ⋯ a 2 , n − 1 a 2 n ⋮ ⋮ ⋮ a n 1 ⋯ a n , n − 1 a n , n ∣ = ∣ 0 ⋯ 0 a 1 , n 0 ⋯ a 2 , n − 1 0 ⋮ ⋮ ⋮ a n 1 ⋯ 0 0 ∣ = ( − 1 ) n ( n − 1 ) 2 a 1 n a 2 , n − 1 ⋯ a n , 1 \begin{vmatrix} a_{11} & \cdots & a_{1, n-1} & a_{1,n} \\ a_{21} & \cdots & a_{2, n-1} & a_{2n} \\ \vdots & & \vdots & \vdots \\ a_{n1} & \cdots & 0 & 0 \end{vmatrix} = \begin{vmatrix} 0 & \cdots & 0 & a_{1,n} \\ 0 & \cdots & a_{2, n-1} & a_{2n} \\ \vdots & & \vdots & \vdots \\ a_{n1} & \cdots & a_{n, n-1} & a_{n, n} \end{vmatrix} = \begin{vmatrix} 0 & \cdots & 0 & a_{1,n} \\ 0 & \cdots & a_{2, n-1} & 0 \\ \vdots & & \vdots & \vdots \\ a_{n1} & \cdots & 0 & 0 \end{vmatrix} = (-1)^{\textcolor{red}{\frac{n(n-1)}{2}}} a_{1n}a_{2,n-1}\cdots a_{n,1} a 11 a 21 ⋮ a n 1 ⋯ ⋯ ⋯ a 1 , n − 1 a 2 , n − 1 ⋮ 0 a 1 , n a 2 n ⋮ 0 = 0 0 ⋮ a n 1 ⋯ ⋯ ⋯ 0 a 2 , n − 1 ⋮ a n , n − 1 a 1 , n a 2 n ⋮ a n , n = 0 0 ⋮ a n 1 ⋯ ⋯ ⋯ 0 a 2 , n − 1 ⋮ 0 a 1 , n 0 ⋮ 0 = ( − 1 ) 2 n ( n − 1 ) a 1 n a 2 , n − 1 ⋯ a n , 1
(3)n n n 阶 a b ab ab 型行列式:∣ a b ⋯ b b a ⋯ b ⋮ ⋮ ⋱ ⋮ b b ⋯ a ∣ = [ a + ( n − 1 ) b ] ( a − b ) n − 1 \begin{vmatrix} a & b & \cdots & b \\ b & a & \cdots & b \\ \vdots & \vdots & \ddots & \vdots \\ b & b & \cdots & a \end{vmatrix} = [a + (n - 1)b](a - b)^{n-1} a b ⋮ b b a ⋮ b ⋯ ⋯ ⋱ ⋯ b b ⋮ a = [ a + ( n − 1 ) b ] ( a − b ) n − 1
(4)拉普拉斯展开式:设 A A A 为 m m m 阶矩阵,B B B 为 n n n 阶矩阵,则 ∣ A O O B ∣ = ∣ A O C B ∣ = ∣ A C O B ∣ = ∣ A ∣ ∣ B ∣ \begin{vmatrix} A & O \\ O & B \end{vmatrix} = \begin{vmatrix} A & O \\ C & B \end{vmatrix} = \begin{vmatrix} A & C \\ O & B \end{vmatrix} = |A||B| A O O B = A C O B = A O C B = ∣ A ∣∣ B ∣ 、∣ O A B O ∣ = ∣ O A B C ∣ = ∣ C A B O ∣ = ( − 1 ) m n ∣ A ∣ ∣ B ∣ \begin{vmatrix} O & A \\ B & O \end{vmatrix} = \begin{vmatrix} O & A \\ B & C \end{vmatrix} = \begin{vmatrix} C & A \\ B & O \end{vmatrix} = (-1)^{\textcolor{red}{mn}}|A||B| O B A O = O B A C = C B A O = ( − 1 ) mn ∣ A ∣∣ B ∣
(5)范德蒙德行列式:∣ 1 1 ⋯ 1 x 1 x 2 ⋯ x n x 1 2 x 2 2 ⋯ x n 2 ⋯ ⋯ ⋯ ⋯ x 1 n − 1 x 2 n − 1 ⋯ x n n − 1 ∣ = ∏ 1 ≤ i < j ≤ n ( x j − x i ) \begin{vmatrix} 1 & 1 & \cdots & 1 \\ x_1 & x_2 & \cdots & x_n \\ x_1^2 & x_2^2 & \cdots & x_n^2 \\ \cdots & \cdots & \cdots & \cdots \\ x_1^{n-1} & x_2^{n-1} & \cdots & x_{\textcolor{red}{n}}^{\textcolor{red}{n-1}} \end{vmatrix} = \prod\limits_{1\le i < j \le n} (x_j - x_i) 1 x 1 x 1 2 ⋯ x 1 n − 1 1 x 2 x 2 2 ⋯ x 2 n − 1 ⋯ ⋯ ⋯ ⋯ ⋯ 1 x n x n 2 ⋯ x n n − 1 = 1 ≤ i < j ≤ n ∏ ( x j − x i )
⭐⭐⭐(6)三对角线行列式:D n D_n D n 按第一行展开得到 a D n − 1 + b D n − 2 aD_{n-1} + bD_{n-2} a D n − 1 + b D n − 2 ,然后向后递推(可能会用到二阶差分方程:传送门 )
💡 ∣ 0 1 0 0 0 0 2 0 0 0 0 3 4 0 0 0 ∣ \begin{vmatrix} 0 & 1 & 0 & 0 \\ 0 & 0 & 2 & 0 \\ 0 & 0 & 0 & 3 \\ 4 & 0 & 0 & 0 \end{vmatrix} 0 0 0 4 1 0 0 0 0 2 0 0 0 0 3 0 也是拉普拉斯的经典形式!
💡 2 道关于范德蒙行列式的难题:
(1)∣ a a 2 b c b b 2 a c c c 2 a b ∣ = ∣ a a 2 a 2 + a b + b c + a c b b 2 b 2 + a b + b c + a c c c 2 c 2 + a b + b c + a c ∣ = ∣ a a 2 a b + b c + a c b b 2 a b + b c + a c c c 2 a b + b c + a c ∣ = ( a b + b c + a c ) ∣ 1 a a 2 1 b b 2 1 c c 2 ∣ \begin{vmatrix} a & a^2 & bc \\ b & b^2 & ac \\ c & c^2 & ab \end{vmatrix} = \begin{vmatrix} a & a^2 & a^2 + ab + bc + ac \\ b & b^2 & b^2 + ab + bc + ac \\ c & c^2 & c^2 + ab + bc + ac \end{vmatrix} = \begin{vmatrix} a & a^2 & ab + bc + ac \\ b & b^2 & ab + bc + ac \\ c & c^2 & ab + bc + ac \end{vmatrix} = (ab + bc + ac)\begin{vmatrix} 1 & a & a^2\\ 1 & b & b^2 \\ 1 & c & c^2 \end{vmatrix} a b c a 2 b 2 c 2 b c a c ab = a b c a 2 b 2 c 2 a 2 + ab + b c + a c b 2 + ab + b c + a c c 2 + ab + b c + a c = a b c a 2 b 2 c 2 ab + b c + a c ab + b c + a c ab + b c + a c = ( ab + b c + a c ) 1 1 1 a b c a 2 b 2 c 2
(2)计算 D n = ∣ 1 1 ⋯ 1 x 1 x 2 ⋯ x n x 1 2 x 2 2 ⋯ x n 2 ⋮ ⋮ ⋱ ⋮ x 1 n − 2 x 2 n − 2 ⋯ x n n − 2 x 1 n x 2 n ⋯ x n n ∣ ⇒ D n + 1 ∣ 1 1 ⋯ 1 1 x 1 x 2 ⋯ x n y x 1 2 x 2 2 ⋯ x n 2 y 2 ⋮ ⋮ ⋱ ⋮ ⋮ x 1 n − 2 x 2 n − 2 ⋯ x n n − 2 y n − 2 x 1 n − 1 x 2 n − 1 ⋯ x n n − 1 y n − 1 x 1 n x 2 n ⋯ x n n y n ∣ = ( y − x 1 ) ( y − x 2 ) ⋯ ( y − x n ) ∏ 1 ≤ i < j ≤ n ( x j − x i ) D_n = \begin{vmatrix} 1 & 1 & \cdots & 1 \\ x_1 & x_2 & \cdots & x_n \\ x_1^2 & x_2^2 & \cdots & x_n^2 \\ \vdots & \vdots & \ddots & \vdots \\ x_1^{n-2} & x_2^{n-2} & \cdots & x_n^{n-2} \\ x_1^{n} & x_2^{n} & \cdots & x_n^{n} \end{vmatrix} \Rightarrow D_{n+1} \begin{vmatrix} 1 & 1 & \cdots & 1 & 1 \\ x_1 & x_2 & \cdots & x_n & y \\ x_1^2 & x_2^2 & \cdots & x_n^2 & y^2 \\ \vdots & \vdots & \ddots & \vdots &\vdots \\ x_1^{n-2} & x_2^{n-2} & \cdots & x_n^{n-2} & y^{n-2} \\ x_1^{n-1} & x_2^{n-1} & \cdots & x_n^{n-1} & \textcolor{red}{y^{n-1}} \\ x_1^{n} & x_2^{n} & \cdots & x_n^{n} & y^n \end{vmatrix} = (y-x_1)(y-x_2)\cdots (y-x_n) \prod\limits_{1\le i < j \le n}(x_j - x_i) D n = 1 x 1 x 1 2 ⋮ x 1 n − 2 x 1 n 1 x 2 x 2 2 ⋮ x 2 n − 2 x 2 n ⋯ ⋯ ⋯ ⋱ ⋯ ⋯ 1 x n x n 2 ⋮ x n n − 2 x n n ⇒ D n + 1 1 x 1 x 1 2 ⋮ x 1 n − 2 x 1 n − 1 x 1 n 1 x 2 x 2 2 ⋮ x 2 n − 2 x 2 n − 1 x 2 n ⋯ ⋯ ⋯ ⋱ ⋯ ⋯ ⋯ 1 x n x n 2 ⋮ x n n − 2 x n n − 1 x n n 1 y y 2 ⋮ y n − 2 y n − 1 y n = ( y − x 1 ) ( y − x 2 ) ⋯ ( y − x n ) 1 ≤ i < j ≤ n ∏ ( x j − x i ) ;D n + 1 D_{n+1} D n + 1 中 y n − 1 y^{n-1} y n − 1 的系数为 − ( x 1 + x 2 + ⋯ + x n ) ∏ 1 ≤ i < j ≤ n ( x j − x i ) -(x_1 + x_2 + \cdots + x_n)\prod\limits_{1\le i < j \le n} (x_j - x_i) − ( x 1 + x 2 + ⋯ + x n ) 1 ≤ i < j ≤ n ∏ ( x j − x i ) ;D n + 1 D_{n+1} D n + 1 按 n + 1 n+1 n + 1 列展开得 D n + 1 = A 1 , n + 1 + ⋯ + y n − 1 A n , n + 1 + y n A n + 1 , n + 1 ⇒ A n , n + 1 = − ( x 1 + x 2 + ⋯ + x n ) ∏ 1 ≤ i < j ≤ n ( x j − x i ) ⇒ D n = M n , n + 1 = − A n , n + 1 = ( x 1 + x 2 + ⋯ + x n ) ∏ 1 ≤ i < j ≤ n ( x j − x i ) D_{n+1} = A_{1,n+1} + \cdots + y^{n-1} A_{n, n+1} + y^nA_{n+1, n+1} \Rightarrow A_{n, n+1} = -(x_1 + x_2 + \cdots + x_n)\prod\limits_{1\le i < j \le n} (x_j - x_i) \Rightarrow D_n = M_{n, n+1} = -A_{n, n+1} = (x_1 + x_2 + \cdots + x_n)\prod\limits_{1\le i < j \le n} (x_j - x_i) D n + 1 = A 1 , n + 1 + ⋯ + y n − 1 A n , n + 1 + y n A n + 1 , n + 1 ⇒ A n , n + 1 = − ( x 1 + x 2 + ⋯ + x n ) 1 ≤ i < j ≤ n ∏ ( x j − x i ) ⇒ D n = M n , n + 1 = − A n , n + 1 = ( x 1 + x 2 + ⋯ + x n ) 1 ≤ i < j ≤ n ∏ ( x j − x i )
【(2)的补充】(3)∣ 1 1 1 1 a b c d a 2 b 2 c 2 d 2 a 4 b 4 c 4 d 4 ∣ = ( a + b + c + d ) ( d − a ) ( d − b ) ( d − c ) ( c − a ) ( c − b ) ( b − a ) \begin{vmatrix} 1 & 1 & 1 & 1 \\ a & b & c & d \\ a^2 & b^2 & c^2 & d^2 \\ a^4 & b^4 & c^4 & d^4 \end{vmatrix} = (a + b + c + d)(d-a)(d-b)(d-c)(c-a)(c-b)(b-a) 1 a a 2 a 4 1 b b 2 b 4 1 c c 2 c 4 1 d d 2 d 4 = ( a + b + c + d ) ( d − a ) ( d − b ) ( d − c ) ( c − a ) ( c − b ) ( b − a )
克莱姆法则 (有时候有奇效)
(1)对 n n n 个方程 n n 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 \begin{cases} 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 \\ \cdots \\ a_{n1}x_1 + a_{n2}x_2 + \cdots + a_{nn}x_n = b_n \end{cases} ⎩ ⎨ ⎧ 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 nn x n = b n ,若系数行列式 D = ∣ a 11 a 12 ⋯ a 1 n a 21 a 22 ⋯ a 2 n ⋮ ⋮ ⋮ a n 1 a n 2 ⋯ a n n ∣ ≠ 0 D = \begin{vmatrix} a_{11} & a_{12} & \cdots & a_{1n} \\ a_{21} & a_{22} & \cdots & a_{2n} \\ \vdots & \vdots & & \vdots \\ a_{n1} & a_{n2} & \cdots & a_{nn} \end{vmatrix} \ne 0 D = a 11 a 21 ⋮ a n 1 a 12 a 22 ⋮ a n 2 ⋯ ⋯ ⋯ a 1 n a 2 n ⋮ a nn = 0 (⇔ \Leftrightarrow ⇔ 系数矩阵 A A A 可逆 ⇔ \Leftrightarrow ⇔ 矩阵 A A A 满秩),则方程组有唯一解,且解为 x i = D i D x_i = \dfrac{D_i}{D} x i = D D i ,其中 D i D_i D i 是由常数项 b 1 , b 2 , ⋯ , b n b_1, b_2, \cdots, b_n b 1 , b 2 , ⋯ , b n 替换掉 D D D 中的第 i i i 列元素得到的行列式(反之,D = 0 D = 0 D = 0 时方程组有无穷多的解)
(2)对 n n n 个方程 n n n 个未知数的齐次线性方程组 { a 11 x 1 + a 12 x 2 + ⋯ + a 1 n x n = 0 a 21 x 1 + a 22 x 2 + ⋯ + a 2 n x n = 0 ⋯ a n 1 x 1 + a n 2 x 2 + ⋯ + a n n x n = 0 \begin{cases} a_{11}x_1 + a_{12}x_2 + \cdots + a_{1n}x_n = 0 \\ a_{21}x_1 + a_{22}x_2 + \cdots + a_{2n}x_n = 0 \\ \cdots \\ a_{n1}x_1 + a_{n2}x_2 + \cdots + a_{nn}x_n = 0 \end{cases} ⎩ ⎨ ⎧ a 11 x 1 + a 12 x 2 + ⋯ + a 1 n x n = 0 a 21 x 1 + a 22 x 2 + ⋯ + a 2 n x n = 0 ⋯ a n 1 x 1 + a n 2 x 2 + ⋯ + a nn x n = 0 ,若 D ≠ 0 D \ne 0 D = 0 则齐次方程组只有 0 解;若 D = 0 D = 0 D = 0 则齐次方程组有非零解
抽象行列式的计算 (综合提高)
(1)设 α 1 \alpha_1 α 1 、α 2 \alpha_2 α 2 、α 3 \alpha_3 α 3 均为三维列向量,矩阵 A = ( α 1 , α 2 , α 3 ) A = (\alpha_1, \alpha_2, \alpha_3) A = ( α 1 , α 2 , α 3 ) ,已知 ∣ A ∣ |A| ∣ A ∣ 求 B = ( α 1 + α 2 + α 3 , α 1 + 2 α 2 + 4 α 3 , α 1 + 3 α 2 + 9 α 3 ) B = (\alpha_1 + \alpha_2 + \alpha_3, \alpha_1 + 2\alpha_2 + 4\alpha_3, \alpha_1 + 3\alpha_2 + 9\alpha_3) B = ( α 1 + α 2 + α 3 , α 1 + 2 α 2 + 4 α 3 , α 1 + 3 α 2 + 9 α 3 ) (思路:B = ( α 1 , α 2 , α 3 ) ⋅ ( 1 1 1 1 2 4 1 3 9 ) B = (\alpha_1, \alpha_2, \alpha_3)\cdot \begin{pmatrix} 1 & 1 & 1 \\ 1 & 2 & 4 \\ 1 & 3 & 9 \end{pmatrix} B = ( α 1 , α 2 , α 3 ) ⋅ 1 1 1 1 2 3 1 4 9 )
(2)三阶矩阵 A , B A, B A , B 满足 A 2 B − A − B = E A^2 B - A - B = E A 2 B − A − B = E ,其中 E E E 为三阶单位矩阵,已知 A A A 求 ∣ B ∣ |B| ∣ B ∣ (提示:A B = 0 AB = 0 A B = 0 ,则有 r ( A ) + r ( B ) ≤ n r(A) + r(B) \le n r ( A ) + r ( B ) ≤ n ;行列式不为 0,则矩阵满秩)
(3)B B B 是 3 阶正交矩阵,且 ∣ B ∣ < 0 |B| < 0 ∣ B ∣ < 0 ,A A A 是三阶矩阵,且 ∣ A − B ∣ = 6 |A - B| = 6 ∣ A − B ∣ = 6 ,求 ∣ E − B A T ∣ |E - BA^T| ∣ E − B A T ∣ (提示:正交矩阵的行列式要么等于 1,要么等于 -1,且 E = B B T = B T B E = BB^T = B^TB E = B B T = B T B )
2. 矩阵
初等矩阵的定义 :单位矩阵经过一次初等变换(行列交换、行列数乘、数乘后加至其他行列)所得的矩阵,称为初等矩阵
(1)E i j E_{ij} E ij 表示单位矩阵 E E E 交换第 i i i 行与第 j j j 行(或交换第 i i i 列与第 j j j 列)所得的初等矩阵
(2)E i ( k ) ( k ≠ 0 ) E_i(k)(k\ne 0) E i ( k ) ( k = 0 ) 表示单位矩阵 E E E 的第 i i i 行(或列)乘以非零常数 k k k 所得的初等矩阵
(3)E i j ( c ) E_{ij}(c) E ij ( c ) 表示单位矩阵 E E E 的第 j j j 行乘以 c c c 加到第 i i i 行(或第 i i i 列乘以 c c c 加到第 j j j 列)所得的初等矩阵(不建议记,写法有争议,老头不太会考)
左行右列定理 :
(1)矩阵 A A A 左乘初等矩阵 P P P 得到 P A PA P A ,相当于对 A A A 作了一次与 P P P 完全相同的初等行变换
(2)矩阵 A A A 右乘初等矩阵 P P P 得到 A P AP A P ,相当于对 A A A 作了一次与 P P P 完全相同的初等列变换
例如 ( 1 0 0 2 1 0 0 0 1 ) ( 1 2 3 4 5 6 7 8 9 ) = ( 1 2 3 6 9 12 7 8 9 ) \begin{pmatrix} 1 & 0 & 0 \\ 2 & 1 & 0 \\ 0 & 0 & 1 \end{pmatrix} \begin{pmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9 \end{pmatrix} = \begin{pmatrix} 1 & 2 & 3 \\ 6 & 9 & 12 \\ 7 & 8 & 9 \end{pmatrix} 1 2 0 0 1 0 0 0 1 1 4 7 2 5 8 3 6 9 = 1 6 7 2 9 8 3 12 9
提示:利用初等矩阵将初等变换过程转化为用初等矩阵左乘、右乘矩阵,从而建立等式关系
初等矩阵的行列式、逆矩阵、转置矩阵
(1)∣ E i j ∣ = − 1 |E_{ij}| = -1 ∣ E ij ∣ = − 1 ,∣ E i ( k ) ∣ = k ( k ≠ 0 ) |E_i(k)| = k(k\ne 0) ∣ E i ( k ) ∣ = k ( k = 0 ) ,∣ E i j ( c ) ∣ = 1 |E_{ij}(c)| = 1 ∣ E ij ( c ) ∣ = 1
(2)E i j − 1 = E i j E_{ij}^{-1} = E_{ij} E ij − 1 = E ij ,E i − 1 ( k ) = E i ( 1 k ) E_i^{-1}(k) = E_i(\dfrac{1}{k}) E i − 1 ( k ) = E i ( k 1 ) ,E i j − 1 ( c ) = E i j ( − c ) E_{ij}^{-1}(c) = E_{ij}(-c) E ij − 1 ( c ) = E ij ( − c )
(3)E i j T = E i j E_{ij}^T = E_{ij} E ij T = E ij ,E i T ( k ) = E i ( k ) E_i^T(k) = E_i(k) E i T ( k ) = E i ( k ) ,E i j T ( k ) = E j i ( k ) E_{ij}^T(k) = E_{ji}(k) E ij T ( k ) = E j i ( k )
(4)此外,根据 ∣ A ∣ A − 1 = A ∗ |A|A^{-1} = A^* ∣ A ∣ A − 1 = A ∗ ,还可以得到伴随矩阵的关系
💡 上述三种初等矩阵都是可逆矩阵(矩阵 A A A 可逆 ⇔ ∣ A ∣ ≠ 0 \Leftrightarrow |A| \ne 0 ⇔ ∣ A ∣ = 0 )
伴随矩阵
(1)定义:A ∗ = ∣ A 11 A 21 ⋯ A n 1 A 12 A 22 ⋯ A n 2 ⋮ ⋮ ⋱ ⋮ A 1 n A 2 n ⋯ A n n ∣ A^* = \begin{vmatrix} A_{11} & A_{21} & \cdots & A_{n1} \\ A_{12} & A_{22} & \cdots & A_{n2} \\ \vdots & \vdots & \ddots & \vdots \\ A_{1n} & A_{2n} & \cdots & A_{nn} \end{vmatrix} A ∗ = A 11 A 12 ⋮ A 1 n A 21 A 22 ⋮ A 2 n ⋯ ⋯ ⋱ ⋯ A n 1 A n 2 ⋮ A nn 且有 A A ∗ = A ∗ A = ∣ A ∣ E AA^* = A^* A = |A|E A A ∗ = A ∗ A = ∣ A ∣ E
(2)性质:
a. A A ∗ = A ∗ A = ∣ A ∣ E AA^* = A^* A = |A|E A A ∗ = A ∗ A = ∣ A ∣ E
b. ∣ A ∗ ∣ = ∣ A ∣ n − 1 |A^*| = |A|^{n-1} ∣ A ∗ ∣ = ∣ A ∣ n − 1
c. A ∗ = ∣ A ∣ A − 1 A^* = |A|A^{-1} A ∗ = ∣ A ∣ A − 1
d. ( A B ) ∗ = B ∗ A ∗ (AB)^* = B^* A^* ( A B ) ∗ = B ∗ A ∗ (穿透性质)
e. ( A T ) ∗ = ( A ∗ ) T (A^T)^* = (A^*)^T ( A T ) ∗ = ( A ∗ ) T ,( A − 1 ) ∗ = ( A ∗ ) − 1 (A^{-1})^* = (A^*)^{-1} ( A − 1 ) ∗ = ( A ∗ ) − 1 ,( A ∗ ) ∗ = ∣ A ∣ n − 2 A (A^*)^* = |A|^{n-2} A ( A ∗ ) ∗ = ∣ A ∣ n − 2 A
⚠️ 注意伴随矩阵的下标!这里也可能会出题 🌚【880-十-基础题-选择-3】
矩阵的秩相关结论 (要牢记)
(1)0 ≤ r ( A m × n ) ≤ min { m , n } 0 \le r(A_{m\times n}) \le \min\{m, n\} 0 ≤ r ( A m × n ) ≤ min { m , n }
(2)r ( k A ) = r ( A ) ( k ≠ 0 ) r(kA) = r(A)(k\ne 0) r ( k A ) = r ( A ) ( k = 0 )
(3)r ( A ) = r ( P A ) = r ( A Q ) = r ( P A Q ) r(A) = r(PA) = r(AQ) = r(PAQ) r ( A ) = r ( P A ) = r ( A Q ) = r ( P A Q ) (P , Q P,Q P , Q 均可逆,即 A A A 做初等变换之后秩不变)
(4)r ( A B ) ≤ min { r ( A ) , r ( B ) } r(AB) \le \min \{r(A), r(B)\} r ( A B ) ≤ min { r ( A ) , r ( B )} (秩越乘越小 \textcolor{red}{秩越乘越小} 秩越乘越小 )
(5)若 A m × n B n × s = O A_{m\times n}B_{n\times s} = O A m × n B n × s = O ,r ( A ) + r ( B ) ≤ n r(A) + r(B) \le n r ( A ) + r ( B ) ≤ n (重中之重 \textcolor{red}{重中之重} 重中之重 ,考研最喜欢考这个了)
(6)r ( A + B ) ≤ r ( [ A , B ] ) ≤ r ( A ) + r ( B ) r(A + B) \le r([A, B]) \le r(A) + r(B) r ( A + B ) ≤ r ([ A , B ]) ≤ r ( A ) + r ( B )
(7)r ( A ∗ ) = { n , r ( A ) = n 1 , r ( A ) = n − 1 0 , r ( A ) < n − 1 r(A^*) = \begin{cases} n, r(A) = n \\ 1, r(A) = n-1 \\ 0, r(A) < n-1 \end{cases} r ( A ∗ ) = ⎩ ⎨ ⎧ n , r ( A ) = n 1 , r ( A ) = n − 1 0 , r ( A ) < n − 1 (一定要记住 \textcolor{red}{一定要记住} 一定要记住 )
(8)r ( A ) = r ( A T ) = r ( A A T ) = r ( A T A ) r(A) = r(A^T) = r(AA^T) = r(A^TA) r ( A ) = r ( A T ) = r ( A A T ) = r ( A T A ) (后面在方程组那里会用到)
(9)若 A 2 = A A^2 = A A 2 = A 则 r ( A ) + r ( A − E ) = n r(A) + r(A - E) = n r ( A ) + r ( A − E ) = n
(10)若 A 2 = E A^2 = E A 2 = E 则 r ( A + E ) + r ( A − E ) = n r(A+E) + r(A - E) = n r ( A + E ) + r ( A − E ) = n
(11)A x = 0 Ax = 0 A x = 0 的基础解系所含向量的个数 s = n − r ( A ) s = n - r(A) s = n − r ( A )
(12)若 A ~ Λ A~\Lambda A ~ Λ ,则 n i = n − r ( λ i E − A ) n_i = n - r(\lambda_i E -A) n i = n − r ( λ i E − A ) ,其中 λ i \lambda_i λ i 是 n i n_i n i 重特征根(重中之重 \textcolor{red}{重中之重} 重中之重 )
(13)若 A ~ Λ A~\Lambda A ~ Λ ,则 r ( A ) r(A) r ( A ) 等于非零特征值的个数,重根按重数算
(14)r ( ( A O O B ) ) = r ( A ) + r ( B ) r(\begin{pmatrix} A & O \\ O & B \end{pmatrix}) = r(A) + r(B) r ( ( A O O B ) ) = r ( A ) + r ( B )
(15)r ( ( A O C B ) ) ≥ r ( A ) + r ( B ) r(\begin{pmatrix} A & O \\ C & B \end{pmatrix}) \ge r(A) + r(B) r ( ( A C O B ) ) ≥ r ( A ) + r ( B ) (A A A 可逆时取等号)
(16)若 A A A 满秩,则 ∣ A ∣ ≠ 0 |A| \ne 0 ∣ A ∣ = 0 ,进而矩阵 A A A 可逆(可逆的充要条件是 ∣ A ∣ ≠ 0 |A|\ne 0 ∣ A ∣ = 0 ),所以 A B AB A B 相当于对矩阵 B B B 做初等行变换,从而 r ( A B ) = r ( B ) r(AB) = r(B) r ( A B ) = r ( B )
(17)α \alpha α 为 n n n 维列向量,则 r ( α α T ) = 1 r(\alpha \alpha^T) = 1 r ( α α T ) = 1
(18)秩为 1 的 n n n 阶方阵 A A A ,A n = [ t r ( A ) ] n − 1 A A^n = [tr(A)]^{n-1} A A n = [ t r ( A ) ] n − 1 A (不知道是不是 🐙 的小巧思)
💡 上述结论的证明:
(9)A 2 = A ⇒ A ( E − A ) = 0 ⇒ r ( A ) + r ( E − A ) ≤ n A^2 = A \Rightarrow A(E-A) = 0 \Rightarrow r(A) + r(E-A) \le n A 2 = A ⇒ A ( E − A ) = 0 ⇒ r ( A ) + r ( E − A ) ≤ n (用结论 5),又根据结论 6 有 r ( A ) + r ( E − A ) ≥ r ( E ) = n r(A) + r(E - A) \ge r(E) = n r ( A ) + r ( E − A ) ≥ r ( E ) = n ,两边一夹故有 r ( A ) + r ( A − E ) = n r(A) + r(A - E) = n r ( A ) + r ( A − E ) = n
(10)同(9)
分块矩阵
(1)先回忆一下上一章的拉普拉斯展开式
(2)分块对角矩阵的幂:( A 1 A 2 ⋱ A n ) n = ( A 1 n A 2 n ⋱ A n n ) \begin{pmatrix} A_1 & & & \\ & A_2 & & \\ & & \ddots & \\ & & & A_n \end{pmatrix}^n = \begin{pmatrix} A_1^n & & & \\ & A_2^n & & \\ & & \ddots & \\ & & & A_n^n \end{pmatrix} A 1 A 2 ⋱ A n n = A 1 n A 2 n ⋱ A n n (分块副对角矩阵的幂没有这个规律)
(3)分块对角矩阵的逆:若 B , C B, C B , C 分别是 m m m 阶与 n n n 阶可逆矩阵,则 ( B O O C ) − 1 = ( B − 1 O O C − 1 ) \begin{pmatrix} B & O \\ O & C \end{pmatrix}^{-1} = \begin{pmatrix} B^{-1} & O \\ O & C^{-1} \end{pmatrix} ( B O O C ) − 1 = ( B − 1 O O C − 1 ) ,( O B C O ) − 1 = ( O C − 1 B − 1 O ) \begin{pmatrix} O & B \\ C & O \end{pmatrix}^{-1} = \begin{pmatrix} O & C^{-1} \\ B^{-1} & O \end{pmatrix} ( O C B O ) − 1 = ( O B − 1 C − 1 O )
(4)分块矩阵的转置:( A B ) T = ( A T B T ) \begin{pmatrix} A & B \end{pmatrix} ^T = \begin{pmatrix} A^T \\ B^T \end{pmatrix} ( A B ) T = ( A T B T ) ,( A B ) T = ( A T B T ) \begin{pmatrix} A \\ B \end{pmatrix}^T = \begin{pmatrix} A^T & B^T \end{pmatrix} ( A B ) T = ( A T B T )
矩阵乘法的进一步解读 (非常重要 \textcolor{red}{非常重要} 非常重要 )
若 A A A 是 m × n m\times n m × n 矩阵,B B B 是 n × s n\times s n × s 矩阵且 A B = O AB = O A B = O ,对 B B B 和 O O O 矩阵按列分块有 A B = A [ b 1 , b 2 , ⋯ , b s ] = [ A b 1 , A b 2 , . . . , A b s ] = [ 0 , 0 , . . . , 0 ] AB = A [b_1, b_2, \cdots, b_s] = [Ab_1, Ab_2, ..., Ab_s] = [0,0,..., 0] A B = A [ b 1 , b 2 , ⋯ , b s ] = [ A b 1 , A b 2 , ... , A b s ] = [ 0 , 0 , ... , 0 ] ,A b i = 0 Ab_i = 0 A b i = 0 ,即 B B B 的列向量是齐次方程组 A x = 0 Ax = 0 A x = 0 的解
若 A B = C AB = C A B = C ,则对 B , C B, C B , C 按行分块有 ( a 11 a 12 ⋯ a 1 n a 21 a 22 ⋯ a 2 n ⋮ ⋮ ⋱ ⋮ a m 1 a m 2 ⋯ a m n ) ( β 1 β 2 ⋮ β n ) = ( α 1 α 2 ⋮ α m ) ⇔ { a 11 β 1 + a 12 β 2 + ⋯ + a 1 n β n = α 1 a 21 β 1 + a 22 β 2 + ⋯ + a 2 n β n = α 2 ⋮ a m 1 β 1 + a m 2 β 2 + ⋯ + a m n β n = α m \begin{pmatrix} a_{11} & a_{12} & \cdots & a_{1n} \\ a_{21} & a_{22} & \cdots & a_{2n} \\ \vdots & \vdots & \ddots & \vdots \\ a_{m1} & a_{m2} & \cdots & a_{mn} \end{pmatrix} \begin{pmatrix} \beta_1 \\ \beta_2 \\ \vdots \\ \beta_n \end{pmatrix} = \begin{pmatrix} \alpha_1 \\ \alpha_2 \\ \vdots \\ \alpha_m \end{pmatrix} \Leftrightarrow \begin{cases} a_{11}\beta_1 + a_{12}\beta_2 + \cdots + a_{1n}\beta_n = \alpha_1 \\ a_{21}\beta_1 + a_{22}\beta_2 + \cdots + a_{2n}\beta_n = \alpha_2 \\ \vdots \\ a_{m1}\beta_1 + a_{m2}\beta_2 + \cdots + a_{mn}\beta_n = \alpha_m \end{cases} a 11 a 21 ⋮ a m 1 a 12 a 22 ⋮ a m 2 ⋯ ⋯ ⋱ ⋯ a 1 n a 2 n ⋮ a mn β 1 β 2 ⋮ β n = α 1 α 2 ⋮ α m ⇔ ⎩ ⎨ ⎧ a 11 β 1 + a 12 β 2 + ⋯ + a 1 n β n = α 1 a 21 β 1 + a 22 β 2 + ⋯ + a 2 n β n = α 2 ⋮ a m 1 β 1 + a m 2 β 2 + ⋯ + a mn β n = α m
【前列线定理】可见矩阵 A B AB A B 的 行向量 \textcolor{red}{行向量} 行向量 α 1 , α 2 , ⋯ , α m \alpha_1, \alpha_2, \cdots, \alpha_m α 1 , α 2 , ⋯ , α m 可由 B B B 的 行向量 \textcolor{red}{行向量} 行向量 线性表出,矩阵 A B AB A B 的 列向量 \textcolor{red}{列向量} 列向量 可由 A A A 的 列向量 \textcolor{red}{列向量} 列向量 线性表出(例题参考 18 年真题:r ( A , A B ) = r ( A ) , r ( A , B A ) r(A , AB) = r(A), r(A , BA) r ( A , A B ) = r ( A ) , r ( A , B A ) 不一定等于 r ( A ) r(A) r ( A ) )
分块矩阵的广义初等变换 (左行右列)
(1)行互换:( A B C D ) → ( C D A B ) \begin{pmatrix} A & B \\ C & D \end{pmatrix} \rightarrow \begin{pmatrix} C & D \\ A & B \end{pmatrix} ( A C B D ) → ( C A D B ) ,( O E E O ) ( A B C D ) = ( C D A B ) \begin{pmatrix} O & E \\ E & O \end{pmatrix} \begin{pmatrix} A & B \\ C & D \end{pmatrix} = \begin{pmatrix} C & D \\ A & B \end{pmatrix} ( O E E O ) ( A C B D ) = ( C A D B )
(2)行倍加:( A B C D ) → ( A + M C B + M D C D ) \begin{pmatrix} A & B \\ C & D \end{pmatrix} \rightarrow \begin{pmatrix} A +MC & B+MD \\ C & D \end{pmatrix} ( A C B D ) → ( A + M C C B + M D D ) ,( E M O E ) ( A B C D ) = ( A + M C B + M D C D ) \begin{pmatrix} E & M \\ O & E \end{pmatrix} \begin{pmatrix} A & B \\ C & D \end{pmatrix} = \begin{pmatrix} A +MC & B+MD \\ C & D \end{pmatrix} ( E O M E ) ( A C B D ) = ( A + M C C B + M D D )
(3)行倍乘:( A B C D ) → ( M A M B C D ) \begin{pmatrix} A & B \\ C & D \end{pmatrix} \rightarrow \begin{pmatrix} MA & MB \\ C & D \end{pmatrix} ( A C B D ) → ( M A C M B D ) ,( M O O E ) ( A B C D ) = ( M A M B C D ) \begin{pmatrix} M & O \\ O & E \end{pmatrix} \begin{pmatrix} A & B \\ C & D \end{pmatrix} = \begin{pmatrix} MA & MB \\ C & D \end{pmatrix} ( M O O E ) ( A C B D ) = ( M A C M B D )
(4)列互换:( A B C D ) → ( B A D C ) \begin{pmatrix} A & B \\ C & D \end{pmatrix} \rightarrow \begin{pmatrix} B & A \\ D & C \end{pmatrix} ( A C B D ) → ( B D A C ) ,( A B C D ) ( O E E O ) = ( B A D C ) \begin{pmatrix} A & B \\ C & D \end{pmatrix} \begin{pmatrix} O & E \\ E & O \end{pmatrix} = \begin{pmatrix} B & A \\ D & C \end{pmatrix} ( A C B D ) ( O E E O ) = ( B D A C )
(5)列倍加:( A B C D ) → ( A + B M B C + D M D ) \begin{pmatrix} A & B \\ C & D \end{pmatrix} \rightarrow \begin{pmatrix} A +BM & B \\ C + DM & D \end{pmatrix} ( A C B D ) → ( A + B M C + D M B D ) ,( A B C D ) ( E O M E ) = ( A + B M B C + D M D ) \begin{pmatrix} A & B \\ C & D \end{pmatrix} \begin{pmatrix} E & O \\ M & E \end{pmatrix} = \begin{pmatrix} A +BM & B \\ C + DM & D \end{pmatrix} ( A C B D ) ( E M O E ) = ( A + B M C + D M B D )
(6)列倍乘:( A B C D ) → ( A M B C M D ) \begin{pmatrix} A & B \\ C & D \end{pmatrix} \rightarrow \begin{pmatrix} AM & B \\ CM & D \end{pmatrix} ( A C B D ) → ( A M C M B D ) ,( A B C D ) ( M O O E ) = ( A M B C M D ) \begin{pmatrix} A & B \\ C & D \end{pmatrix} \begin{pmatrix} M & O \\ O & E \end{pmatrix}= \begin{pmatrix} AM & B \\ CM & D \end{pmatrix} ( A C B D ) ( M O O E ) = ( A M C M B D )
💡 如果 r ( A ) = r r(A) = r r ( A ) = r ,则意味着存在一个 r r r 阶子式不为 0,且任意的 r + 1 r + 1 r + 1 阶子式为 0
3. 向量组
向量内积
(1)定义:设 α = ( a 1 , a 2 , . . . , a n ) T , β = ( b 1 , b 2 , . . . , b n ) T \alpha = (a_1, a_2, ..., a_n)^T, \beta = (b_1, b_2, ..., b_n)^T α = ( a 1 , a 2 , ... , a n ) T , β = ( b 1 , b 2 , ... , b n ) T ,则内积 ( α , β ) = ( a 1 , a 2 , . . . , a n ) ( b 1 b 2 ⋮ b n ) = α T β (\alpha, \beta) = (a_1, a_2, ..., a_n) \begin{pmatrix} b_1 \\ b_2 \\ \vdots \\ b_n \end{pmatrix} = \alpha^T \beta ( α , β ) = ( a 1 , a 2 , ... , a n ) b 1 b 2 ⋮ b n = α T β
(2)性质
a. ( α , α ) = α T α = a 1 2 + a 2 2 + . . . + a n 2 (\alpha, \alpha) = \alpha^T \alpha = a_1^2 + a_2^2 + ... + a_n^2 ( α , α ) = α T α = a 1 2 + a 2 2 + ... + a n 2
b. 向量的模(或长度)∣ ∣ α ∣ ∣ = ( α , α ) = a 1 2 + a 2 2 + . . . + a n 2 ||\alpha|| = \sqrt{(\alpha, \alpha)} = \sqrt{a_1^2 + a_2^2 + ... + a_n^2} ∣∣ α ∣∣ = ( α , α ) = a 1 2 + a 2 2 + ... + a n 2
c. ( α , α ) = α T α = 0 ⇔ α = 0 (\alpha, \alpha) = \alpha^T \alpha = 0 \Leftrightarrow \alpha = 0 ( α , α ) = α T α = 0 ⇔ α = 0
d. ( α , β ) = ( β , α ) = α T β = β T α (\alpha, \beta) = (\beta, \alpha) = \alpha^T\beta = \beta^T \alpha ( α , β ) = ( β , α ) = α T β = β T α
判断向量组线性相关性的主要方法
(1)线性相关的定义:存在一组不全为 0 的 k k k ,使得 k 1 α 1 + k 2 α 2 + ⋯ + k s α s = 0 k_1\alpha_1 + k_2\alpha_2 + \cdots + k_s\alpha_s = 0 k 1 α 1 + k 2 α 2 + ⋯ + k s α s = 0 (也就是说存在一个向量是其余向量的线性组合)
(2)齐次线性方程组 ( α 1 , α 2 , ⋯ , α s ) ( k 1 k 2 ⋮ k n ) = 0 (\alpha_1, \alpha_2, \cdots, \alpha_s) \begin{pmatrix} k_1 \\ k_2 \\ \vdots \\ k_n \end{pmatrix} = 0 ( α 1 , α 2 , ⋯ , α s ) k 1 k 2 ⋮ k n = 0 有非零解(线性无关的话是只有零解)
(3)r ( α 1 , α 2 , ⋯ , α s ) < s ( 线性无关的话 = s ) r(\alpha_1, \alpha_2, \cdots, \alpha_s) < s(线性无关的话=s) r ( α 1 , α 2 , ⋯ , α s ) < s ( 线性无关的话 = s )
💡 向量组线性无关等价于该向量组中任意一个向量均不能由其他向量线性表示
判断向量组线性表示的主要方法
(1)线性表出的定义:β = k 1 α 1 + k 2 α 2 + ⋯ + k s α s \beta = k_1 \alpha_1 + k_2 \alpha_2 + \cdots + k_s \alpha_s β = k 1 α 1 + k 2 α 2 + ⋯ + k s α s
(2)非齐次线性方程组 ( α 1 , α 2 , ⋯ , α s ) ( k 1 k 2 ⋮ k s ) = β (\alpha_1, \alpha_2, \cdots, \alpha_s) \begin{pmatrix} k_1 \\ k_2 \\ \vdots \\ k_s \end{pmatrix} = \beta ( α 1 , α 2 , ⋯ , α s ) k 1 k 2 ⋮ k s = β 有解
(3)r ( α 1 , α 2 , ⋯ , α s ) = r ( α 1 , α 2 , ⋯ , α s , β ) r(\alpha_1, \alpha_2, \cdots, \alpha_s) = r(\alpha_1, \alpha_2, \cdots, \alpha_s, \beta) r ( α 1 , α 2 , ⋯ , α s ) = r ( α 1 , α 2 , ⋯ , α s , β )
💡 判定线性相关性的常用定理
(1)整体与部分:若 α , β \alpha, \beta α , β 线性相关,则 α , β , γ \alpha, \beta, \gamma α , β , γ 必线性相关;若 α , β , γ \alpha, \beta, \gamma α , β , γ 线性无关,则 α , β \alpha , \beta α , β 必线性无关
(2)接长于局部:若 α 1 , α 2 \alpha_1, \alpha_2 α 1 , α 2 线性无关,β 1 , β 2 \beta_1, \beta_2 β 1 , β 2 维数相同,则 ( α 1 β 1 ) , ( α 2 β 2 ) \begin{pmatrix} \alpha_1 \\ \beta_1 \end{pmatrix},\begin{pmatrix} \alpha_2 \\ \beta_2 \end{pmatrix} ( α 1 β 1 ) , ( α 2 β 2 ) 必线性无关;若 ( α 1 β 1 ) , ( α 2 β 2 ) \begin{pmatrix} \alpha_1 \\ \beta_1 \end{pmatrix},\begin{pmatrix} \alpha_2 \\ \beta_2 \end{pmatrix} ( α 1 β 1 ) , ( α 2 β 2 ) 线性相关,则原向量组 α 1 , α 2 \alpha_1, \alpha_2 α 1 , α 2 必线性相关
(3)以少表多,多的相关:如果向量组 β 1 , β 2 , ⋯ , β t \beta_1, \beta_2, \cdots, \beta_t β 1 , β 2 , ⋯ , β t 可以由向量组 α 1 , α 2 , ⋯ , α s \alpha_1, \alpha_2, \cdots, \alpha_s α 1 , α 2 , ⋯ , α s 线性表示,且 t > s t > s t > s ,则 β 1 , β 2 , ⋯ , β t \beta_1, \beta_2, \cdots, \beta_t β 1 , β 2 , ⋯ , β t 线性相关
(4)非零向量之间正交的话,那么必然线性无关;零向量天生与任意向量正交,与任意向量线性相关
⚠️ 易错题:设 n n n 维向量组 α 1 , α 2 , ⋯ , α n − 1 \alpha_1, \alpha_2, \cdots, \alpha_{n-1} α 1 , α 2 , ⋯ , α n − 1 线性无关,β 1 , β 2 \beta_1, \beta_2 β 1 , β 2 均与 α 1 , α 2 , ⋯ , α n − 1 \alpha_1,\alpha_2, \cdots, \alpha_{n-1} α 1 , α 2 , ⋯ , α n − 1 正交,则()
A. α 1 , α 2 , ⋯ , α n − 1 , β 1 \alpha_1,\alpha_2, \cdots, \alpha_{n-1}, \beta_1 α 1 , α 2 , ⋯ , α n − 1 , β 1 线性无关(错,当 β 1 \beta_1 β 1 为零向量时线性相关)
B. β 1 , β 2 \beta_1, \beta_2 β 1 , β 2 线性相关(对,从方程组的角度理解,设 β 1 , β 2 \beta_1, \beta_2 β 1 , β 2 为齐次方程组 A x = 0 Ax = 0 A x = 0 的解,那么由于 n − r ( A ) = n − ( n − 1 ) = 1 n - r(A) = n - (n-1) = 1 n − r ( A ) = n − ( n − 1 ) = 1 ,所以解系中自由向量只有 1 个,即 β 1 , β 2 \beta_1, \beta_2 β 1 , β 2 成比例,故线性相关)
C. β 1 , β 2 \beta_1, \beta_2 β 1 , β 2 线性无关
D. β 1 , β 2 \beta_1, \beta_2 β 1 , β 2 均可由 α 1 , α 2 , ⋯ , α n − 1 \alpha_1, \alpha_2, \cdots, \alpha_{n-1} α 1 , α 2 , ⋯ , α n − 1 线性表示
极大线性无关组 (这一块的内容比较死板)
(1)定义:若向量组 α 1 , α 2 , ⋯ , α s \alpha_1, \alpha_2, \cdots, \alpha_s α 1 , α 2 , ⋯ , α s 中存在 r r r 个(这个 r r r 就是秩)向量 α i 1 , α i 2 , ⋯ , α i r \alpha_{i1}, \alpha_{i2}, \cdots, \alpha_{ir} α i 1 , α i 2 , ⋯ , α i r 线性无关,且再添加任一个 α j ( j = 1 , 2 , ⋯ , s ) \alpha_j(j=1,2,\cdots, s) α j ( j = 1 , 2 , ⋯ , s ) 就有 α i 1 , α i 2 , ⋯ , α i r , α j \alpha_{i1}, \alpha_{i2} , \cdots, \alpha_{ir}, \alpha_{j} α i 1 , α i 2 , ⋯ , α i r , α j 线性相关,则称 α i 1 , α i 2 , ⋯ , α i r \alpha_{i1}, \alpha_{i2}, \cdots, \alpha_{ir} α i 1 , α i 2 , ⋯ , α i r 是向量组 α 1 , α 2 , ⋯ , α s \alpha_1, \alpha_2, \cdots, \alpha_s α 1 , α 2 , ⋯ , α s 的一个极大线性无关组,向量组 α 1 , α 2 , ⋯ , α s \alpha_1, \alpha_2, \cdots, \alpha_s α 1 , α 2 , ⋯ , α s 的极大线性无关组 α i 1 , α i 2 , ⋯ , α i r \alpha_{i1}, \alpha_{i2}, \cdots, \alpha_{ir} α i 1 , α i 2 , ⋯ , α i r 中所含向量个数 r r r ,称为向量组的秩,记为 r ( α 1 , α 2 , ⋯ , α s ) r(\alpha_1, \alpha_2, \cdots, \alpha_s) r ( α 1 , α 2 , ⋯ , α s )
(2)若向量组的秩为 r r r ,则:
a. 其中任意 r r r 个向量都可为其最大无关组?(❌)
b. 其中任意 r r r 个线性无关的向量都可以为其最大无关组?(✅)
c. 其中多于 r r r 个向量组成的向量组一定线性相关?(✅)
d. 其中 r r r 个向量组成的向量组一定线性无关?(❌)
(3)求极大线性无关组的方法(利用初等行变换不改变列向量组的线性相关性,也因此求解的时候只能都作初等行变换或都作列变换)
a. 构造 A = [ α 1 , α 2 , ⋯ , α s ] A = [\alpha_1, \alpha_2, \cdots, \alpha_s] A = [ α 1 , α 2 , ⋯ , α s ]
b. A A A 行变换为阶梯形矩阵
c. 算出台阶数,按列找出一个秩为 r r r 的子矩阵即可
向量组等价
(1)若 α i , β i \alpha_i, \beta_i α i , β i 同维,则:
{ α 1 , α 2 , ⋯ , α s } ≅ { β 1 , β 2 , ⋯ , β t } \{\alpha_1, \alpha_2, \cdots, \alpha_s\} \cong \{\beta_1, \beta_2, \cdots, \beta_t\} { α 1 , α 2 , ⋯ , α s } ≅ { β 1 , β 2 , ⋯ , β t }
⇔ { α 1 , α 2 , ⋯ , α s } \Leftrightarrow \{\alpha_1, \alpha_2, \cdots, \alpha_s\} ⇔ { α 1 , α 2 , ⋯ , α s } 与 { β 1 , β 2 , ⋯ , β t } \{\beta_1, \beta_2, \cdots, \beta_t\} { β 1 , β 2 , ⋯ , β t } 可以互相线性表出(用的比较少)
⇔ r { α 1 , α 2 , ⋯ , α s } = r { β 1 , β 2 , ⋯ , β t } \Leftrightarrow r\{\alpha_1, \alpha_2, \cdots, \alpha_s\} = r\{\beta_1, \beta_2, \cdots, \beta_t\} ⇔ r { α 1 , α 2 , ⋯ , α s } = r { β 1 , β 2 , ⋯ , β t } ,且可单方向表出,即只需要知道 α 1 , α 2 , ⋯ , α s \alpha_1, \alpha_2, \cdots, \alpha_s α 1 , α 2 , ⋯ , α s 与 β 1 , β 2 , ⋯ , β t \beta_1, \beta_2, \cdots, \beta_t β 1 , β 2 , ⋯ , β t 这两个向量组中的某一个向量组可由另一个向量组线性表出
⇔ r { α 1 , α 2 , ⋯ , α s } = r { β 1 , β 2 , ⋯ , β t } = r ( α 1 , α 2 , ⋯ , α s , β 1 , β 2 , ⋯ , β t ) \Leftrightarrow r\{\alpha_1, \alpha_2, \cdots, \alpha_s\} = r\{\beta_1, \beta_2, \cdots, \beta_t\} = r(\alpha_1, \alpha_2, \cdots, \alpha_s, \beta_1, \beta_2, \cdots, \beta_t) ⇔ r { α 1 , α 2 , ⋯ , α s } = r { β 1 , β 2 , ⋯ , β t } = r ( α 1 , α 2 , ⋯ , α s , β 1 , β 2 , ⋯ , β t ) (三秩相同)
(2)提醒:若向量组的秩为 r r r ,则
a. 此向量组与自己的极大线性无关组等价
b. 此向量组的任意两个极大线性无关组等价
(3)易错点:
a. 两个向量组等价,一个线性无关,另一个也必线性无关吗?(❌)
b. 两个向量组等价,向量的个数一定相同吗?(❌)
⚠️ 易错题:设 n n n 维向量组(I)α 1 , α 2 , ⋯ , α k ( k < n ) \alpha_1, \alpha_2, \cdots, \alpha_k(k<n) α 1 , α 2 , ⋯ , α k ( k < n ) 线性无关,则 n n n 维向量组(II)β 1 , β 2 , ⋯ , β k \beta_1, \beta_2, \cdots, \beta_k β 1 , β 2 , ⋯ , β k 也线性无关的充要条件是()
A. β 1 , β 2 , ⋯ , β k \beta_1, \beta_2, \cdots, \beta_k β 1 , β 2 , ⋯ , β k 可由 α 1 , α 2 , ⋯ , α k \alpha_1, \alpha_2, \cdots, \alpha_k α 1 , α 2 , ⋯ , α k 线性表示(❌)
B. α 1 , α 2 , ⋯ , α k \alpha_1, \alpha_2, \cdots, \alpha_k α 1 , α 2 , ⋯ , α k 可由 β 1 , β 2 , ⋯ , β k \beta_1, \beta_2, \cdots, \beta_k β 1 , β 2 , ⋯ , β k 线性表示(❌)
C. 向量组(I)和向量组(II)等价(❌)
D. 矩阵 ( α 1 , α 2 , ⋯ , α k ) (\alpha_1, \alpha_2, \cdots, \alpha_k) ( α 1 , α 2 , ⋯ , α k ) 与 ( β 1 , β 2 , ⋯ , β k ) (\beta_1, \beta_2, \cdots, \beta_k) ( β 1 , β 2 , ⋯ , β k ) 等价(✅)
正交矩阵 (后面会用到)
(1)定义:设 A A A 是 n n n 阶方阵,若 A T A = E A^TA = E A T A = E 则 A A A 为正交矩阵
(2)性质:
a. A T A = E A^TA = E A T A = E
b. A T = A − 1 A^T = A^{-1} A T = A − 1
c. A A A 的行向量和列向量都是标准正交基(也就是每一行每一列的模都为 1,且相互正交)
💡 总结梳理:
(1)本章重点是 A B = C AB = C A B = C 问题
(2)对于 A B = C AB =C A B = C ,我们知道 A B AB A B 的列可以由 A A A (左边的)的列线性表出(前列腺定理…)
(3)那么,A B AB A B 的列可以被 A A A 的列表出,可以得到 r ( A B ) ≤ r ( A ) r(AB) \le r(A) r ( A B ) ≤ r ( A )
(4)做题的时候还遇到了 r ( A , A B ) = r ( A ) r(A, AB) = r(A) r ( A , A B ) = r ( A ) (如果 A A A 和 A B AB A B 能拼在一起的话)
(5)此外,还有 B B B 的每一列 b i b_i b i 都是非齐次方程组 A x = C i Ax = C_i A x = C i 的解
(6)对于 A B = C AB = C A B = C ,我们还有 A B AB A B 的行可以由 B B B (右边的)的行线性表出
(7)进而 r ( A B ) ≤ r ( B ) r(AB) \le r(B) r ( A B ) ≤ r ( B )
(8)根据 3 和 7,我们可以得到结论:秩越乘越小,即 r ( A B ) ≤ min { r ( A ) , r ( B ) } r(AB) \le \min\{r(A), r(B)\} r ( A B ) ≤ min { r ( A ) , r ( B )}
(9)同 4,我们依然可以得到 r ( B A B ) = r ( B ) r\begin{pmatrix} B \\ AB \end{pmatrix} = r(B) r ( B A B ) = r ( B )
(10)特殊的,若 A B = 0 AB = 0 A B = 0 ,那么就由非齐次的问题变成了一个齐次的问题,既然是齐次问题那么它对应的就是线性相关和线性无关的问题
(11)在此基础上,若 B ≠ 0 B\ne 0 B = 0 的话,A A A 的列向量不满秩(列相关)
(12)B B B 的每一列 b i b_i b i 都是 A x = 0 Ax = 0 A x = 0 的解,根据方程组解的结构,n − r ( A ) ≥ r ( B ) n - r(A) \ge r(B) n − r ( A ) ≥ r ( B ) ,进而有 r ( A ) + r ( B ) ≤ n r(A) + r(B) \le n r ( A ) + r ( B ) ≤ n
(13)若 A ≠ 0 A \ne 0 A = 0 ,B B B 的行也是不满秩的,后续结论同 12
(14)对于向量组等价问题,要牢牢记住那三个充要条件
(15)对于前面提到的 A B = C AB = C A B = C 题型,有进一步补充:若 B B B 可逆,则 A B AB A B 的列等价于 A A A 的列(证明要会);若 A A A 可逆,则 A B AB A B 的行等价于 B B B 的行(乘以可逆矩阵,相当于做行变换和列变换)
(16)此外,初等行列变换也是相当重要的:初等行变换对应行等价,且不改变列的相关性;初等列变换对于列等价,且不改变行的线性相关性
向量空间
(1)基本概念:若 ξ 1 , ξ 2 , ⋯ , ξ n \xi_1, \xi_2, \cdots, \xi_n ξ 1 , ξ 2 , ⋯ , ξ n 是 n n n 维向量空间 R n R^n R n 中的线性无关的有序向量组,则任一向量 α ∈ R \alpha \in R α ∈ R 均可由 ξ 1 , ξ 2 , ⋯ , ξ n \xi_1, \xi_2, \cdots, \xi_n ξ 1 , ξ 2 , ⋯ , ξ n 线性表示为 α = a 1 ξ 1 + a 2 ξ 2 + ⋯ , a n ξ n \alpha = a_1\xi_1 + a_2\xi_2 + \cdots, a_n\xi_n α = a 1 ξ 1 + a 2 ξ 2 + ⋯ , a n ξ n ,称有序向量组 ξ 1 , ξ 2 , ⋯ , ξ n \xi_1, \xi_2, \cdots, \xi_n ξ 1 , ξ 2 , ⋯ , ξ n 是 R n R^n R n 的一个基,基向量的个数 n n n 称为空间的维度,而 [ a 1 , a 2 , ⋯ , a n ] [a_1, a_2, \cdots, a_n] [ a 1 , a 2 , ⋯ , a n ] 称为向量 α \alpha α 在基 ξ 1 , ξ 2 , ⋯ , ξ n \xi_1, \xi_2, \cdots, \xi_n ξ 1 , ξ 2 , ⋯ , ξ n 下的坐标
(2)基变换公式:[ η 1 , η 2 , ⋯ , η n ] = [ ξ 1 , ξ 2 , ⋯ , ξ n ] ( c 11 c 12 ⋯ c 1 n c 21 c 22 ⋯ c 2 n ⋮ ⋮ ⋱ ⋮ c n 1 c n 2 ⋯ c n n ) = [ ξ 1 , ξ 2 , ⋯ , ξ n ] C [\eta_1, \eta_2, \cdots, \eta_n] = [\xi_1, \xi_2, \cdots, \xi_n]\begin{pmatrix} c_{11} & c_{12} & \cdots & c_{1n} \\ c_{21} & c_{22} & \cdots & c_{2n} \\ \vdots & \vdots & \ddots & \vdots \\ c_{n1} & c_{n2} & \cdots & c_{nn} \end{pmatrix} = [\xi_1, \xi_2, \cdots, \xi_n]C [ η 1 , η 2 , ⋯ , η n ] = [ ξ 1 , ξ 2 , ⋯ , ξ n ] c 11 c 21 ⋮ c n 1 c 12 c 22 ⋮ c n 2 ⋯ ⋯ ⋱ ⋯ c 1 n c 2 n ⋮ c nn = [ ξ 1 , ξ 2 , ⋯ , ξ n ] C ,其中 C C C 为由基 ξ 1 , ξ 2 , ⋯ , ξ n \xi_1, \xi_2, \cdots, \xi_n ξ 1 , ξ 2 , ⋯ , ξ n 到基 η 1 , η 2 , ⋯ , η n \eta_1, \eta_2, \cdots, \eta_n η 1 , η 2 , ⋯ , η n 的过渡矩阵(C C C 的第 i i i 列是 η i \eta_i η i 在基 ξ 1 , ξ 2 , ⋯ , ξ n \xi_1, \xi_2, \cdots, \xi_n ξ 1 , ξ 2 , ⋯ , ξ n 下的坐标,且过渡矩阵为可逆矩阵)
(3)坐标变换公式:设 α \alpha α 在基 ξ 1 , ξ 2 , ⋯ , ξ n \xi_1, \xi_2, \cdots, \xi_n ξ 1 , ξ 2 , ⋯ , ξ n 和 η 1 , η 2 , ⋯ , η n \eta_1, \eta_2, \cdots, \eta_n η 1 , η 2 , ⋯ , η n 下的坐标分别为 x = [ x 1 , x 2 , ⋯ , x n ] T x = [x_1, x_2, \cdots, x_n]^T x = [ x 1 , x 2 , ⋯ , x n ] T 和 y = [ y 1 , y 2 , ⋯ , y n ] T y = [y_1, y_2, \cdots, y_n]^T y = [ y 1 , y 2 , ⋯ , y n ] T ,那么 α = [ ξ 1 , ξ 2 , ⋯ , ξ n ] x = [ η 1 , η 2 , ⋯ , η n ] y ⇔ x = C y \alpha = [\xi_1, \xi_2, \cdots, \xi_n]x = [\eta_1, \eta_2, \cdots, \eta_n]y \Leftrightarrow x = Cy α = [ ξ 1 , ξ 2 , ⋯ , ξ n ] x = [ η 1 , η 2 , ⋯ , η n ] y ⇔ x = C y (或 y = C − 1 x y = C^{-1}x y = C − 1 x )
施密特正交化 (用来求正交基的,考试最多考到 β 3 \beta_3 β 3 )
β 1 = α 1 \beta_1 = \alpha_1 β 1 = α 1
β 2 = α 2 − ( α 2 , β 1 ) ( β 1 , β 1 ) β 1 \beta_2 = \alpha_2 - \dfrac{(\alpha_2, \beta_1)}{(\beta_1, \beta_1)} \beta_1 β 2 = α 2 − ( β 1 , β 1 ) ( α 2 , β 1 ) β 1
β 3 = α 3 − ( α 3 , β 1 ) ( β 1 , β 1 ) β 1 − ( α 3 , β 2 ) ( β 2 , β 2 ) β 2 \beta_3 = \alpha_3 - \dfrac{(\alpha_3, \beta_1)}{(\beta_1, \beta_1)} \beta_1 - \dfrac{(\alpha_3, \beta_2)}{(\beta_2, \beta_2)} \beta_2 β 3 = α 3 − ( β 1 , β 1 ) ( α 3 , β 1 ) β 1 − ( β 2 , β 2 ) ( α 3 , β 2 ) β 2
⚠️ 求完正交基后,别忘了标准化为标准正交基
4. 线性方程组
齐次线性方程组
(1)有解的条件(m m m 个方程,n n n 个未知量)(重点 \textcolor{red}{重点} 重点 )
a. r ( A ) = n r(A) = n r ( A ) = n (即 α 1 , α 2 , ⋯ , α n \alpha_1, \alpha_2, \cdots, \alpha_n α 1 , α 2 , ⋯ , α n 线性无关时),方程组只有零解
b. r ( A ) = r < n r(A) = r < n r ( A ) = r < n 时(即线性相关时),方程组有非零解,且有 n − r n - r n − r 个线性无关解
(2)解的性质:
a. 若 A ξ 1 = 0 , A ξ 2 = 0 A \xi_1 = 0, A\xi_2 = 0 A ξ 1 = 0 , A ξ 2 = 0 ,则 A ( k 1 ξ 1 + k 2 ξ 2 ) = 0 A(k_1 \xi_1 + k_2 \xi_2)= 0 A ( k 1 ξ 1 + k 2 ξ 2 ) = 0 ,其中 k 1 , k 2 k_1, k_2 k 1 , k 2 为任意常数
b. 类消去律:若 A m × n A_{m\times n} A m × n ,r ( A ) = n r(A) = n r ( A ) = n (满秩),A B = A C AB = AC A B = A C ,则 B = C B = C B = C
(3)基础解系和解的结构
a. 基础解系满足:是方程组 A x = 0 Ax = 0 A x = 0 的解、线性无关、方程组 A x = 0 Ax = 0 A x = 0 的任意解均可由 ξ 1 , ξ 2 , ⋯ , ξ n \xi_1, \xi_2, \cdots, \xi_n ξ 1 , ξ 2 , ⋯ , ξ n 线性表示
b. 通解:k 1 ξ 1 + k 2 ξ 2 + ⋯ + k n ξ n k_1 \xi_1 + k_2 \xi_2 + \cdots + k_n \xi_n k 1 ξ 1 + k 2 ξ 2 + ⋯ + k n ξ n
c. 基础解系中向量个数 s = n − r ( A ) s = n - r(A) s = n − r ( A ) (如果是 A m × n A_{m\times n} A m × n ,则是 s = n − r ( A ) s = n - r(A) s = n − r ( A ) )
(4)求解方式:
a. 先将系数矩阵初等行变换为行阶梯形矩阵,阶梯数位 r = r ( A ) r = r(A) r = r ( A )
b. 按列找出一个秩为 r r r 的子矩阵,剩余列位置的未知数设为自由变量
c. 按基础解系的定义求处 ξ 1 , ξ 2 , ⋯ , ξ n \xi_1, \xi_2, \cdots, \xi_n ξ 1 , ξ 2 , ⋯ , ξ n 并写出通解
非齐次线性方程组
(1)有解的条件(重点 \textcolor{red}{重点} 重点 )
a. 若 r ( A ) ≠ r ( [ A , b ] ) r(A) \ne r([A, b]) r ( A ) = r ([ A , b ]) (即 b b b 不能用 α 1 , α 2 , ⋯ , α n \alpha_1, \alpha_2, \cdots, \alpha_n α 1 , α 2 , ⋯ , α n 线性表示),则方程组无解
b. 若 r ( A ) = r ( [ A , b ] ) = n r(A) = r([A, b]) = n r ( A ) = r ([ A , b ]) = n (即 α 1 , α 2 , ⋯ , α n \alpha_1, \alpha_2, \cdots, \alpha_n α 1 , α 2 , ⋯ , α n 线性无关,α 1 , α 2 , ⋯ , α n , b \alpha_1, \alpha_2, \cdots, \alpha_n, b α 1 , α 2 , ⋯ , α n , b 线性相关),则方程组有唯一解
c. 若 r ( A ) = r ( [ A , b ] ) = r < n r(A) = r([A, b]) = r < n r ( A ) = r ([ A , b ]) = r < n ,则方程组有无穷多解(也就是说只要 r ( A ) = r ( [ A , b ] ) r(A) = r([A, b]) r ( A ) = r ([ A , b ]) ,方程组一定是有解的)
(2)解的性质(⭐⭐⭐ 非常重要)
a. 设 η 1 , η 2 \eta_1, \eta_2 η 1 , η 2 都是 A x = b Ax = b A x = b 的解,则 η 1 − η 2 \eta_1 - \eta_2 η 1 − η 2 是它的导出组 A x = 0 Ax = 0 A x = 0 的解
b. 设 η 1 , η 2 , ⋯ , η s \eta_1, \eta_2, \cdots, \eta_s η 1 , η 2 , ⋯ , η s 都是 A x = b Ax = b A x = b 的解,则 k 1 η 1 + k 2 η 2 + ⋯ + k s η s = { 是 A x = b 的解 , 当 k 1 + k 2 + ⋯ + k s = 1 是 A x = 0 的解 , 当 k 1 + k 2 + ⋯ + k s = 0 k_1 \eta_1 + k_2\eta_2 + \cdots + k_s \eta_s = \begin{cases} 是 Ax = b 的解,& 当 k_1 + k_2 + \cdots + k_s = 1 \\ 是 Ax = 0 的解,& 当 k_1 + k_2 + \cdots + k_s = 0 \end{cases} k 1 η 1 + k 2 η 2 + ⋯ + k s η s = { 是 A x = b 的解 , 是 A x = 0 的解 , 当 k 1 + k 2 + ⋯ + k s = 1 当 k 1 + k 2 + ⋯ + k s = 0 (证明方法就是左乘一个 A A A )
c. 设 η \eta η 是 A x = b Ax = b A x = b 的一个解,ξ \xi ξ 是它的导出组 A x = 0 Ax = 0 A x = 0 的解,则 ξ + η \xi + \eta ξ + η 是 A x = b Ax = b A x = b 的解
(3)求解方法:先求齐次解,再求特解,合并得到通解
💡 小结论:A x = 0 Ax = 0 A x = 0 有 n − r ( A ) n -r(A) n − r ( A ) 个线性无关的解,则 A x = β Ax = \beta A x = β 至多有 n − r ( A ) + 1 n - r(A) + 1 n − r ( A ) + 1 个线性无关的解(反过来,若 A x = β Ax = \beta A x = β 有 n − r ( A ) + 1 n - r(A) + 1 n − r ( A ) + 1 个线性无关的解,则 A x = 0 Ax = 0 A x = 0 至少有 n − r ( A ) n -r(A) n − r ( A ) 个线性无关的解)
克拉默法则 (这里重新回顾一下)
(1)内容:对 n n n 个方程 n n n 个未知数(n × n n\times n n × n 的方阵)的非齐次线性方程组 A n × n x = b A_{n\times n}x = b A n × n x = b ,若 ∣ A ∣ ≠ 0 |A| \ne 0 ∣ A ∣ = 0 (满秩),则方程组有唯一解,且解为 x i = ∣ A i ∣ ∣ A ∣ x_i = \dfrac{|A_i|}{|A|} x i = ∣ A ∣ ∣ A i ∣ (其中 A i A_i A i 是指将 A A A 的第 i i i 列用 b b b 替换)
(2)例子:设 A = ( a 11 a 12 0 a 21 a 22 0 0 0 1 ) A = \begin{pmatrix} a_{11} & a_{12} & 0 \\ a_{21} & a_{22} & 0 \\ 0 & 0 & 1 \end{pmatrix} A = a 11 a 21 0 a 12 a 22 0 0 0 1 ,A ( x 1 x 2 x 3 ) = ( 0 0 1 ) A\begin{pmatrix} x_1 \\ x_2 \\ x_3 \end{pmatrix} =\begin{pmatrix} 0 \\ 0 \\ 1 \end{pmatrix} A x 1 x 2 x 3 = 0 0 1 ,则有 x 1 = ∣ A 1 ∣ ∣ A ∣ = ∣ 0 a 12 0 0 a 22 0 1 0 1 ∣ ∣ A ∣ = 0 x_1 = \dfrac{|A_1|}{|A|} = \dfrac{\begin{vmatrix} \textcolor{red}{0} & a_{12} & 0 \\ \textcolor{red}{0} & a_{22} & 0 \\ \textcolor{red}{1} & 0 & 1 \end{vmatrix}}{|A|} = 0 x 1 = ∣ A ∣ ∣ A 1 ∣ = ∣ A ∣ 0 0 1 a 12 a 22 0 0 0 1 = 0
求两个方程组的公共解的三个方法 (这块想要学得好,一定要结合向量组等价)
(1)联立求解 ( A B ) x = 0 \begin{pmatrix} A \\ B \end{pmatrix} x = 0 ( A B ) x = 0
(2)求出 A m × n x = 0 A_{m\times n}x = 0 A m × n x = 0 的通解 k 1 ξ 1 + k 2 ξ 2 + ⋯ + k s ξ s k_1 \xi_1 + k_2 \xi_2 + \cdots + k_s\xi_s k 1 ξ 1 + k 2 ξ 2 + ⋯ + k s ξ s ,代入 B m × n x = 0 B_{m\times n}x = 0 B m × n x = 0 ,求出 k i k_i k i 之间的关系,代回 A m × n x = 0 A_{m\times n}x = 0 A m × n x = 0 的通解
(3)给出 A m × n x = 0 A_{m\times n} x = 0 A m × n x = 0 的基础解系 ξ 1 , ξ 2 , ⋯ , ξ s \xi_1, \xi_2, \cdots, \xi_s ξ 1 , ξ 2 , ⋯ , ξ s 与 B m × n x = 0 B_{m\times n}x = 0 B m × n x = 0 的基础解系 η 1 , η 2 , ⋯ , η t \eta_1, \eta_2, \cdots, \eta_t η 1 , η 2 , ⋯ , η t ,则公共解 γ = k 1 ξ 1 + k 2 ξ 2 + ⋯ + k s ξ s = l 1 η 1 + l 2 η 2 + ⋯ + l t η t \gamma = k_1 \xi_1 + k_2 \xi_2 + \cdots + k_s\xi_s = l_1\eta_1 + l_2\eta_2 + \cdots + l_t\eta_t γ = k 1 ξ 1 + k 2 ξ 2 + ⋯ + k s ξ s = l 1 η 1 + l 2 η 2 + ⋯ + l t η t
同解方程组
(1)A x = 0 , B x = 0 Ax = 0, Bx = 0 A x = 0 , B x = 0 是同解方程组的充要条件:
a. A x = 0 Ax = 0 A x = 0 的解满足 B x = 0 Bx = 0 B x = 0 且 B x = 0 Bx = 0 B x = 0 的解满足 A x = 0 Ax = 0 A x = 0
b. r ( A ) = r ( B ) r(A) = r(B) r ( A ) = r ( B ) 且 A x = 0 Ax = 0 A x = 0 的解满足 B x = 0 Bx = 0 B x = 0
c. r ( A ) = r ( B ) = r ( ( A B ) ) r(A) = r(B) = r(\begin{pmatrix} A \\ B \end{pmatrix}) r ( A ) = r ( B ) = r ( ( A B ) ) (三秩相同)
(2)综上,同解方程组有一个更本质的表达:行向量组等价(用这个做题更快)
(3)同解方程组的常用结论:
⭐⭐⭐ a. A x = 0 Ax = 0 A x = 0 和 B x = 0 Bx = 0 B x = 0 同解 ⇔ A \Leftrightarrow A ⇔ A 与 B B B 行向量组等价 ⇔ r ( A ) = r ( B ) = r ( ( A B ) ) ⇒ r ( A ) = r ( B ) \Leftrightarrow r(A) = r(B) = r(\begin{pmatrix} A \\ B \end{pmatrix}) \Rightarrow r(A) = r(B) ⇔ r ( A ) = r ( B ) = r ( ( A B ) ) ⇒ r ( A ) = r ( B )
b. A x = α , B x = β Ax = \alpha, Bx = \beta A x = α , B x = β 同解 ⇔ ( A , α ) \Leftrightarrow (A, \alpha) ⇔ ( A , α ) 与 ( B , β ) (B, \beta) ( B , β ) 行向量组等价 ⇔ r ( A , α ) = r ( B , β ) = r ( ( A α B β ) ) ⇒ r ( A , α ) = r ( B , β ) \Leftrightarrow r(A, \alpha) = r(B, \beta) = r(\begin{pmatrix} A & \alpha \\ B & \beta \end{pmatrix}) \Rightarrow r(A, \alpha) = r(B, \beta) ⇔ r ( A , α ) = r ( B , β ) = r ( ( A B α β ) ) ⇒ r ( A , α ) = r ( B , β )
(易错)c. 设 m × n m\times n m × n 矩阵 A = ( α 1 T α 2 T ⋮ α n T ) A = \begin{pmatrix} \alpha_1^T \\ \alpha_2^T \\ \vdots \\ \alpha_n^T \end{pmatrix} A = α 1 T α 2 T ⋮ α n T ,B = ( β 1 T β 2 T ⋮ β n T ) B = \begin{pmatrix} \beta_1^T \\ \beta_2^T \\ \vdots \\ \beta_n^T \end{pmatrix} B = β 1 T β 2 T ⋮ β n T ,A A A 的行向量组可以由 B B B 的行向量组线性表示 ⇔ B x = 0 \Leftrightarrow Bx = 0 ⇔ B x = 0 的解都是 A x = 0 Ax = 0 A x = 0 的解(B x = 0 Bx = 0 B x = 0 的约束更多,集合范围小一点)⇔ \Leftrightarrow ⇔ 存在矩阵 C C C 使 A = C B ⇒ r ( A ) ≤ r ( B ) A = CB \Rightarrow r(A) \le r(B) A = C B ⇒ r ( A ) ≤ r ( B )
d. A T A x = 0 A^T Ax = 0 A T A x = 0 与 A x = 0 Ax = 0 A x = 0 同解(四秩相等,都是同解)
e. 设矩阵 P P P 列满秩,则 P A x = 0 PAx = 0 P A x = 0 与 A x = 0 Ax = 0 A x = 0 同解
f. 若 A x = 0 Ax = 0 A x = 0 的解均是 B x = 0 Bx = 0 B x = 0 的解,则 A x = 0 Ax = 0 A x = 0 与 ( A B ) x = 0 \begin{pmatrix} A \\ B \end{pmatrix} x = 0 ( A B ) x = 0 同解
💡 例题 1:设有齐次线性方程组 A x = 0 Ax = 0 A x = 0 和 B x = 0 Bx = 0 B x = 0 ,其中 A , B A, B A , B 均为 m × n m\times n m × n 矩阵,现有四个命题
(1)若 A x = 0 Ax = 0 A x = 0 的解均是 B x = 0 Bx = 0 B x = 0 的解,则 r ( A ) ≥ r ( B ) r(A) \ge r(B) r ( A ) ≥ r ( B ) (✅,因为解的集合越小,说明约束越多,方程数越多,故秩越大)
(2)若 r ( A ) ≥ r ( B ) r(A) \ge r(B) r ( A ) ≥ r ( B ) ,则 A x = 0 Ax = 0 A x = 0 的解均是 B x = 0 Bx = 0 B x = 0 的解(❌,不一定是 B B B 的解,解集不一定包含于 B B B )
(3)若 A x = 0 Ax = 0 A x = 0 与 B x = 0 Bx = 0 B x = 0 同解,则 r ( A ) = r ( B ) r(A) = r(B) r ( A ) = r ( B ) (✅)
(4)若 r ( A ) = r ( B ) r(A) = r(B) r ( A ) = r ( B ) ,则 A x = 0 Ax = 0 A x = 0 与 B x = 0 Bx = 0 B x = 0 同解(❌)
💡 例题 2:设 A A A 是 n n n 阶矩阵,对方程组(I)A x = 0 Ax = 0 A x = 0 和(II)A T A x = 0 A^TAx = 0 A T A x = 0 ,则有:
(1)A T A x = 0 ⇒ x T A T A x = 0 ⇒ ( A x ) T ( A x ) = 0 ⇒ ∣ ∣ A x ∣ ∣ 2 = 0 ⇒ A x = 0 A^TA x= 0 \Rightarrow x^TA^TAx = 0 \Rightarrow (Ax)^T(Ax) = 0 \Rightarrow ||Ax||^2 = 0 \Rightarrow Ax = 0 A T A x = 0 ⇒ x T A T A x = 0 ⇒ ( A x ) T ( A x ) = 0 ⇒ ∣∣ A x ∣ ∣ 2 = 0 ⇒ A x = 0
(2)A x = 0 ⇒ A T A x = 0 Ax = 0 \Rightarrow A^T Ax = 0 A x = 0 ⇒ A T A x = 0
💡 此外,当遇到分块矩阵作为系数矩阵的方程组时,千万不要做列变换 \textcolor{red}{不要做列变换} 不要做列变换 ,因为会改变解系
5. 特征值与特征向量(相似理论)
⚠️ 线代的核心内容,考试重难点
特征值与特征向量的定义
设 A A A 为 n n n 阶矩阵,若 A α = λ α ( α ≠ 0 ) A\alpha = \lambda \alpha(\alpha \ne 0) A α = λ α ( α = 0 ) ,则称 λ \lambda λ 是 A A A 的特征值,α \alpha α 是 A A A 的属于 λ \lambda λ 的特征向量
⚠️ 易错点:特征向量不能为 0
求特征值与特征向量
(1)方法一(具体型)
a. 解方程 ∣ λ E − A ∣ = 0 |\lambda E - A| = 0 ∣ λ E − A ∣ = 0 ,求得特征值 λ \lambda λ (这里计算的时候千万别把正负号写错写漏了,所以要养成解题好习惯:先写对角,再添 − A -A − A )
b. 解方程组 ( λ E − A ) α = 0 (\lambda E - A) \alpha = 0 ( λ E − A ) α = 0 ,得特征向量 α \alpha α
(2)方法二(抽象型):利用定义 A α = λ α ( α ≠ 0 ) A \alpha = \lambda \alpha(\alpha \ne 0) A α = λ α ( α = 0 )
用特征值命题
(1)λ 0 \lambda_0 λ 0 是 A A A 的特征值 ⇔ ∣ λ 0 E − A ∣ = 0 \Leftrightarrow |\lambda_0 E - A| = 0 ⇔ ∣ λ 0 E − A ∣ = 0 (建立方程求参数或证明行列式 ∣ λ 0 E − A ∣ = 0 |\lambda_0 E - A| = 0 ∣ λ 0 E − A ∣ = 0 );λ 0 \lambda_0 λ 0 不是 A A A 的特征值 ⇔ ∣ λ 0 E − A ∣ ≠ 0 \Leftrightarrow |\lambda_0 E -A| \ne 0 ⇔ ∣ λ 0 E − A ∣ = 0 (矩阵可逆;满秩)
⭐⭐(2)若 λ 1 , λ 2 , ⋯ , λ n \lambda_1, \lambda_2, \cdots, \lambda_n λ 1 , λ 2 , ⋯ , λ n 是 A A A 的 n n n 个特征值,则 { ∣ A ∣ = λ 1 λ 2 ⋯ λ n t r ( A ) = λ 1 + λ 2 + ⋯ + λ n \begin{cases} |A| = \lambda_1 \lambda_2 \cdots \lambda_n \\ tr(A) = \lambda_1 + \lambda_2 + \cdots + \lambda_n \end{cases} { ∣ A ∣ = λ 1 λ 2 ⋯ λ n t r ( A ) = λ 1 + λ 2 + ⋯ + λ n (矩阵的迹 t r ( A ) tr(A) t r ( A ) 是矩阵对角线元素之和)
⭐⭐⭐⭐⭐(3)重要结论:
a. 记住下表(表中 λ \lambda λ 在分母上的,设 λ ≠ 0 \lambda \ne 0 λ = 0 )
b. f ( x ) f(x) f ( x ) 为多项式,若矩阵 A A A 满足 f ( A ) = O f(A) = O f ( A ) = O ,λ \lambda λ 是 A A A 的任一特征值,则 λ \lambda λ 满足 f ( λ ) = 0 f(\lambda) = 0 f ( λ ) = 0
c. 虽然 A T A^T A T 的特征值与 A A A 相同,但特征向量不再是 ξ \xi ξ ,要单独计算才能得出
d. A ∗ A^* A ∗ 的特征值其一:∣ A ∣ λ 1 = λ 1 λ 2 ⋯ λ n λ 1 = λ 2 λ 3 ⋯ λ n \dfrac{|A|}{\lambda_1} = \dfrac{\lambda_1 \lambda_2 \cdots \lambda_n}{\lambda_1} = \lambda_2 \lambda_3 \cdots \lambda_n λ 1 ∣ A ∣ = λ 1 λ 1 λ 2 ⋯ λ n = λ 2 λ 3 ⋯ λ n (即剩余特征值之积)
e. A 2 = A ⇔ A 2 − A = 0 ⇔ λ 2 − λ = 0 ⇔ A^2 = A \Leftrightarrow A^2 - A = 0 \Leftrightarrow\lambda^2 - \lambda = 0 \Leftrightarrow A 2 = A ⇔ A 2 − A = 0 ⇔ λ 2 − λ = 0 ⇔ 特征值只能为 0 或 1
用特征向量命题
(1)ξ ( ≠ 0 ) \xi(\ne 0) ξ ( = 0 ) 是 A A A 的属于 λ 0 \lambda_0 λ 0 的特征向量 ⇔ ξ \Leftrightarrow \xi ⇔ ξ 是 ( λ 0 E − A ) x = 0 (\lambda_0 E - A) x = 0 ( λ 0 E − A ) x = 0 的非零解
(2)重要结论
a. k k k 重特征值 λ \lambda λ 至多只有 k k k 个线性无关的特征向量(直接用,不用证明)
b. 若 ξ 1 , ξ 2 \xi_1, \xi_2 ξ 1 , ξ 2 是 A A A 的属于不同特征值 λ 1 , λ 2 \lambda_1, \lambda_2 λ 1 , λ 2 的特征向量,则 ξ 1 , ξ 2 \xi_1, \xi_2 ξ 1 , ξ 2 线性无关
c. 若 ξ 1 , ξ 2 \xi_1, \xi_2 ξ 1 , ξ 2 是 A A A 的属于同一特征值 λ \lambda λ 的特征向量,则 k 1 ξ 1 + k 2 ξ 2 k_1 \xi_1 + k_2 \xi_2 k 1 ξ 1 + k 2 ξ 2 (k 1 , k 2 k_1,k_2 k 1 , k 2 不同时为 0)仍是 A A A 的属于特征值 λ \lambda λ 的特征向量
d. 若 ξ 1 , ξ 2 \xi_1, \xi_2 ξ 1 , ξ 2 是 A A A 的属于不同特征值 λ 1 , λ 2 \lambda_1, \lambda_2 λ 1 , λ 2 的特征向量,则当 k 1 ≠ 0 , k 2 ≠ 0 k_1\ne 0, k_2\ne 0 k 1 = 0 , k 2 = 0 时,k 1 ξ 1 + k 2 ξ 2 k_1\xi_1 + k_2\xi_2 k 1 ξ 1 + k 2 ξ 2 不是 A A A 的特征向量(常考 k 1 = k 2 = 1 k_1 = k_2 = 1 k 1 = k 2 = 1 的情形)
❓ 可以从 “特征空间” 的角度来理解?
💡 这些条件在告诉你特征值或特征向量
(1)A B = O ⇒ A [ β 1 , β 2 , ⋯ , β n ] = [ 0 , 0 , ⋯ , 0 ] AB = O \Rightarrow A[\beta_1, \beta_2, \cdots, \beta_n] = [0, 0, \cdots, 0] A B = O ⇒ A [ β 1 , β 2 , ⋯ , β n ] = [ 0 , 0 , ⋯ , 0 ] ,即 A β i = 0 β i ( i = 1 , 2 , ⋯ , n ) A\beta_i = 0 \beta_i(i = 1, 2, \cdots, n) A β i = 0 β i ( i = 1 , 2 , ⋯ , n ) ,若其中 β i \beta_i β i 均为非零列向量,则 β i \beta_i β i 为 A A A 的属于 λ = 0 \lambda = 0 λ = 0 的特征向量(这条结论还可以翻译成:齐次方程组 A x = 0 Ax = 0 A x = 0 的自由解向量对应了 A A A 特征值为 0 时的特征向量)
(2)A B = C ⇒ A [ β 1 , β 2 , ⋯ , β n ] = [ γ 1 , γ 2 , ⋯ , γ n ] AB = C \Rightarrow A[\beta_1, \beta_2, \cdots, \beta_n] = [\gamma_1, \gamma_2, \cdots, \gamma_n] A B = C ⇒ A [ β 1 , β 2 , ⋯ , β n ] = [ γ 1 , γ 2 , ⋯ , γ n ] ,若 [ γ 1 , γ 2 , ⋯ , γ n ] = [ λ 1 β 1 , λ 2 β 2 , ⋯ , λ n β n ] [\gamma_1, \gamma_2, \cdots, \gamma_n] = [\lambda_1\beta_1, \lambda_2\beta_2, \cdots, \lambda_n\beta_n] [ γ 1 , γ 2 , ⋯ , γ n ] = [ λ 1 β 1 , λ 2 β 2 , ⋯ , λ n β n ] ,A β i = λ i β i A\beta_i = \lambda_i\beta_i A β i = λ i β i ,其中 γ i = λ i β i \gamma_i = \lambda_i \beta_i γ i = λ i β i ,β i \beta_i β i 为非零列向量,则 β i \beta_i β i 为 A A A 的属于 λ i \lambda_i λ i 的特征向量
(3)若 A A A 的每行元素之和均为 k k k ,则 A ( 1 1 ⋮ 1 ) = k ( 1 1 ⋮ 1 ) ⇒ k A \begin{pmatrix} 1 \\ 1 \\ \vdots \\ 1 \end{pmatrix} = k\begin{pmatrix} 1 \\ 1 \\ \vdots \\ 1 \end{pmatrix} \Rightarrow k A 1 1 ⋮ 1 = k 1 1 ⋮ 1 ⇒ k 是特征值,( 1 1 ⋮ 1 ) \begin{pmatrix} 1 \\ 1 \\ \vdots \\ 1 \end{pmatrix} 1 1 ⋮ 1 是 A A A 的属于 k k k 的特征向量
💡 关于秩为 1 的矩阵 A A A
(1)A A A 可以表示成 α β T \alpha \beta^T α β T (列向量乘以行向量)
(2)t r ( A ) = β T α = α T β tr(A) = \beta^T \alpha = \alpha^T \beta t r ( A ) = β T α = α T β (等于内积)
(3)A n = [ t r ( A ) ] n − 1 ⋅ A A^n = [tr(A)]^{n-1} \cdot A A n = [ t r ( A ) ] n − 1 ⋅ A
(4)A A A 的特征值为 t r ( A ) tr(A) t r ( A ) 和 n − 1 n-1 n − 1 个 0(可以从方程组的角度来理解){ 一定可以相似对角化( A ~ Λ ) , t r ( A ) ≠ 0 不能相似对角化 , t r ( A ) = 0 \begin{cases} 一定可以相似对角化(A~\Lambda), & tr(A) \ne 0 \\ 不能相似对角化, & tr(A) = 0 \end{cases} { 一定可以相似对角化( A ~ Λ ) , 不能相似对角化 , t r ( A ) = 0 t r ( A ) = 0
相似矩阵
(1)定义:设 A , B A, B A , B 是两个 n n n 阶方阵,若存在 n n n 阶可逆矩阵 P P P 使得 P − 1 A P = B P^{-1}AP = B P − 1 A P = B ,则称 A A A 相似于 B B B ,记为 A ~ B A~B A ~ B
(2)相似矩阵的性质
a. A ~ A A~A A ~ A
b. 若 A ~ B A~B A ~ B ,B ~ C B~C B ~ C ,则 A ~ C A~C A ~ C
c. 若 A ~ B A~B A ~ B ,则 ∣ A ∣ = ∣ B ∣ |A| = |B| ∣ A ∣ = ∣ B ∣ 、r ( A ) = r ( B ) r(A) = r(B) r ( A ) = r ( B ) 、t r ( A ) = t r ( B ) tr(A) = tr(B) t r ( A ) = t r ( B ) 、λ A = λ B \lambda_A = \lambda_B λ A = λ B (或 ∣ λ E − A ∣ = ∣ λ E − B ∣ |\lambda E - A| = |\lambda E - B| ∣ λ E − A ∣ = ∣ λ E − B ∣ )、r ( λ E − A ) = r ( λ E − B ) r(\lambda E - A) = r(\lambda E - B) r ( λ E − A ) = r ( λ E − B ) ,且 A , B A, B A , B 的各阶主子式之和相等
(3)重要结论:
a. A ~ B ⇒ A T ~ B T , A − 1 ~ B − 1 , A ∗ ~ B ∗ A~B \Rightarrow A^T ~B^T, A^{-1} ~B^{-1}, A^*~B^* A ~ B ⇒ A T ~ B T , A − 1 ~ B − 1 , A ∗ ~ B ∗ (后面两个要求 A A A 可逆)
b. A ~ B ⇒ A m ~ B m , f ( A ) ~ f ( B ) A~B \Rightarrow A^m ~B^m, f(A)~f(B) A ~ B ⇒ A m ~ B m , f ( A ) ~ f ( B )
c. A ~ B , B ~ Λ ⇒ A ~ Λ A~B, B~\Lambda \Rightarrow A~\Lambda A ~ B , B ~ Λ ⇒ A ~ Λ
d. A ~ Λ , B ~ Λ ⇒ A ~ B A~\Lambda, B~\Lambda \Rightarrow A~B A ~ Λ , B ~ Λ ⇒ A ~ B
e. A ~ C , B ~ D ⇒ ( A O O B ) ~ ( C O O D ) A~C, B~D \Rightarrow \begin{pmatrix} A & O \\ O & B \end{pmatrix} ~ \begin{pmatrix} C & O \\ O & D \end{pmatrix} A ~ C , B ~ D ⇒ ( A O O B ) ~ ( C O O D )
⚠️ 矩阵相似和等价的区别
(1)矩阵等价只要求两个矩阵同型即可,而矩阵相似要求两个矩阵为同型方阵 \textcolor{red}{方阵} 方阵
(2)相似必等价,等价不一定相似
(3)等价只要求 P A Q = B PAQ = B P A Q = B (P , Q P, Q P , Q 均可逆),但相似要求 P − 1 A P = B P^{-1}AP = B P − 1 A P = B
A 的相似对角化
(1)定义:P − 1 A P = Λ P^{-1} A P = \Lambda P − 1 A P = Λ (这里 P P P 的每一个列向量都是其所在列的特征值一一对应的特征向量,即 P = [ ξ 1 , ξ 2 , ⋯ , ξ n ] , Λ = ( λ 1 λ 2 ⋱ λ n ) P = [\xi_1, \xi_2, \cdots, \xi_n], \Lambda = \begin{pmatrix} \lambda_1 & & & \\ & \lambda_2 & & \\ & & \ddots & \\ & & & \lambda_n \end{pmatrix} P = [ ξ 1 , ξ 2 , ⋯ , ξ n ] , Λ = λ 1 λ 2 ⋱ λ n )
(2)充要条件
a. A A A 有 n n n 个线性无关的特征向量 ⇔ A ~ Λ \Leftrightarrow A~\Lambda ⇔ A ~ Λ
b. n i = n − r ( λ i E − A ) ⇔ A ~ Λ n_i = n - r(\lambda_i E - A) \Leftrightarrow A~\Lambda n i = n − r ( λ i E − A ) ⇔ A ~ Λ (n i n_i n i 重根下有 n i n_i n i 个线性无关的特征向量,就可以相似对角化)
(3)充分条件:
a. A A A 是实对称矩阵 ⇒ A ~ Λ \Rightarrow A~\Lambda ⇒ A ~ Λ
b. A A A 有 n n n 个互异特征值 ⇒ A ~ Λ \Rightarrow A~\Lambda ⇒ A ~ Λ
c. A 2 = A ⇒ A ~ Λ A^2 = A \Rightarrow A~\Lambda A 2 = A ⇒ A ~ Λ
d. A 2 = E ⇒ A ~ Λ A^2 = E \Rightarrow A~\Lambda A 2 = E ⇒ A ~ Λ
e. r ( A ) = 1 r(A) = 1 r ( A ) = 1 且 t r ( A ) ≠ 0 ⇒ A ~ Λ tr(A) \ne 0 \Rightarrow A~\Lambda t r ( A ) = 0 ⇒ A ~ Λ
(4)必要条件:
a. A ~ Λ ⇒ r ( A ) A~\Lambda \Rightarrow r(A) A ~ Λ ⇒ r ( A ) 等于非零特征值的个数(重根按重数算)
实对称矩阵
(1)若 A A A 为实对称矩阵,则
a. 特征值均为实数,特征向量均为实向量
b. 不同特征值对应的特征向量正交(即 λ 1 ≠ λ 2 ⇒ ξ 1 ⊥ ξ 2 ⇒ ( ξ 1 , ξ 2 ) = 0 \lambda_1 \ne \lambda_2 \Rightarrow \xi_1 \perp \xi_2 \Rightarrow (\xi_1, \xi_2) = 0 λ 1 = λ 2 ⇒ ξ 1 ⊥ ξ 2 ⇒ ( ξ 1 , ξ 2 ) = 0 ,建方程)
c. 可用正交矩阵相似对角化(即存在正交矩阵 P P P 使 P − 1 A P = P T A P = Λ P^{-1} A P = P^T AP = \Lambda P − 1 A P = P T A P = Λ )
(2)实对称矩阵相似对角化的基本步骤:
a. 求特征值
b. 求特征值对应的特征向量
c. 将特征向量正交化、单位化
d. 令 Q Q Q 为单位正交化之后的特征向量组成的矩阵,则 Q Q Q 为正交矩阵,且 Q − 1 A Q = Q T A Q = Λ Q^{-1}AQ = Q^T AQ = \Lambda Q − 1 A Q = Q T A Q = Λ
💡 正交比线性无关更强一些
正交矩阵
(1)正交矩阵的特征值 λ ∈ { 1 , − 1 } \lambda \in \{1, -1\} λ ∈ { 1 , − 1 }
(2)若 A A A 为正交矩阵,则 A T A = E A^T A= E A T A = E
⇔ A − 1 = A T \Leftrightarrow A^{-1} = A^T ⇔ A − 1 = A T
⇔ A \Leftrightarrow A ⇔ A 由规范正交基组成
⇔ A T \Leftrightarrow A^T ⇔ A T 是正交矩阵
⇔ A − 1 \Leftrightarrow A^{-1} ⇔ A − 1 是正交矩阵
⇔ A ∗ \Leftrightarrow A^* ⇔ A ∗ 是正交矩阵
(3)若 A , B A, B A , B 为同阶正交矩阵,则 A B AB A B 为正交矩阵(A + B A+B A + B 不一定)
💡 例题一道(注意 A A A 右乘 α \alpha α 和 β \beta β 的小技巧)
6. 二次型
二次型及其表示
(1)含有 n n n 个变量:x 1 , x 2 , ⋯ , x n x_1, x_2, \cdots, x_n x 1 , x 2 , ⋯ , x n 的二次齐次函数 f ( x 1 , x 2 , ⋯ , x n ) = a 11 x 1 2 + a 22 x 2 2 + ⋯ + a n n x n 2 + 2 a 12 x 1 x 2 + 2 a 13 x 1 x 3 + ⋯ + 2 a n − 1 , n x n − 1 x n f(x_1, x_2, \cdots, x_n) = a_{11}x_1^2 + a_{22}x_2^2 + \cdots + a_{nn}x_n^2 + 2a_{12}x_1x_2 + 2a_{13}x_1x_3 + \cdots + 2a_{n-1, n}x_{n-1}x_n f ( x 1 , x 2 , ⋯ , x n ) = a 11 x 1 2 + a 22 x 2 2 + ⋯ + a nn x n 2 + 2 a 12 x 1 x 2 + 2 a 13 x 1 x 3 + ⋯ + 2 a n − 1 , n x n − 1 x n ,称为 n n n 元二次型
(2)也可以写成 f ( x 1 , x 2 , ⋯ , x n ) = ∑ i = 1 n ∑ j = 1 n a i j x i x j f(x_1, x_2, \cdots, x_n) = \sum\limits_{i=1}^{n} \sum\limits_{j=1}^{n}a_{ij} x_i x_j f ( x 1 , x 2 , ⋯ , x n ) = i = 1 ∑ n j = 1 ∑ n a ij x i x j 的形式。出现该形式时,不要犹豫,立即推:记 x = ( x 1 , x 2 , ⋯ , x n ) T x = (x_1, x_2, \cdots, x_n)^T x = ( x 1 , x 2 , ⋯ , x n ) T ,A = ( a i j ) n × n A = (a_{ij})_{n\times n} A = ( a ij ) n × n ,则 f ( x 1 , x 2 , ⋯ , x n ) = x T A x f(x_1, x_2, \cdots, x_n) = x^T A x f ( x 1 , x 2 , ⋯ , x n ) = x T A x (需要注意的是,此时 A A A 矩阵还不能称为二次型矩阵,若增加条件 a i j = a j i a_{ij} = a_{ji} a ij = a j i ,也即 A T = A A^T = A A T = A ,此时实对称矩阵 A A A 被称为二次型矩阵,且 r ( A ) r(A) r ( A ) 是二次型的秩)
💡 若上述 2 中得到的 A A A 不是实对称的,那么可以通过 A + A T 2 \dfrac{A+A^T}{2} 2 A + A T 调整成二次型矩阵,从而二次型矩阵的秩也应当是调整后的矩阵的秩
💡 遇到 f ( x 1 , x 2 , x 3 ) = ( x 1 − x 2 + x 3 ) 2 + ( x 2 + x 3 ) 2 + ( x 1 + a x 3 ) 2 f(x_1, x_2, x_3) = (x_1 - x_2 + x_3)^2 + (x_2 + x_3)^2 + (x_1 + ax_3)^2 f ( x 1 , x 2 , x 3 ) = ( x 1 − x 2 + x 3 ) 2 + ( x 2 + x 3 ) 2 + ( x 1 + a x 3 ) 2 这种比较麻烦的形式,直接令 y 1 = x 1 − x 2 + x 3 , y 2 = x 2 + x 3 , y 3 = x 1 + a x 3 y_1 = x_1 - x_2 + x_3 , y_2 = x_2 + x_3 , y_3 = x_1 + ax_3 y 1 = x 1 − x 2 + x 3 , y 2 = x 2 + x 3 , y 3 = x 1 + a x 3 ,那么有 ( y 1 y 2 y 3 ) = ( 1 − 1 1 0 1 1 1 0 a ) ( x 1 x 2 x 3 ) = B ( x 1 x 2 x 3 ) \begin{pmatrix} y_1 \\ y_2 \\ y_3 \end{pmatrix} = \begin{pmatrix} 1 & -1 & 1 \\ 0 & 1 & 1 \\ 1 & 0 & a \end{pmatrix} \begin{pmatrix} x_1 \\ x_2 \\ x_3 \end{pmatrix} = B \begin{pmatrix} x_1 \\ x_2 \\ x_3 \end{pmatrix} y 1 y 2 y 3 = 1 0 1 − 1 1 0 1 1 a x 1 x 2 x 3 = B x 1 x 2 x 3 ,那么根据 f = y 1 2 + y 2 2 + y 3 2 = y T y = ( B x ) T B x = x T B T B x f = y_1^2 + y_2^2 + y_3^2 = y^T y = (Bx)^TBx = x^TB^TBx f = y 1 2 + y 2 2 + y 3 2 = y T y = ( B x ) T B x = x T B T B x ,即二次型矩阵等于 B T B B^TB B T B
矩阵合同
(1)定义:设 A , B A, B A , B 为 n n n 阶方阵,若存在可逆矩阵 C C C 使得 C T A C = B C^T AC = B C T A C = B ,则称 A A A 与 B B B 合同,记作 A ≃ B A\simeq B A ≃ B
(2)合同的性质:
a. A ≃ A A\simeq A A ≃ A
b. 若 A ≃ B A\simeq B A ≃ B ,则 B ≃ A B\simeq A B ≃ A
c. 若 A ≃ B , B ≃ C A \simeq B, B\simeq C A ≃ B , B ≃ C ,则 A ≃ C A \simeq C A ≃ C
d. r ( A ) = r ( B ) r(A) = r(B) r ( A ) = r ( B )
(3)两个实对称矩阵合同的充要条件:有相同的正负惯性指数
💡 上面图里的 Q T = Q − 1 ⇒ Q Q^T = Q^{-1} \Rightarrow Q Q T = Q − 1 ⇒ Q 是正交矩阵
二次型的标准形、规范形
(1)定义:
a. 若二次型中只含有平方项,没有交叉项(即所有交叉项的系数均为 0),即形如 d 1 x 1 2 + d 2 x 2 2 + ⋯ + d n x n 2 d_1x_1^2 + d_2x_2^2 + \cdots + d_nx_n^2 d 1 x 1 2 + d 2 x 2 2 + ⋯ + d n x n 2 的二次型称为标准形(系数不唯一)
b. 若标准型中,系数 d i ( i = 1 , 2 , ⋯ , n ) d_i(i=1, 2, \cdots, n) d i ( i = 1 , 2 , ⋯ , n ) 仅为 1 , − 1 , 0 1, -1, 0 1 , − 1 , 0 ,即形如 x 1 2 + ⋯ + x p 2 − x p − 1 2 − ⋯ x p + q 2 x_1^2 + \cdots + x_p^2 - x_{p-1}^2 - \cdots x_{p+q}^2 x 1 2 + ⋯ + x p 2 − x p − 1 2 − ⋯ x p + q 2 的二次型称为规范形(系数唯一)
(2)常用定理
a. 任何二次型均可以通过配方法(作可逆线性变换)化为标准形及规范形,用矩阵语言表述:任何实对称矩阵 A A A 必存在可逆矩阵 C C C 使得 C T A C = Λ C^TAC = \Lambda C T A C = Λ (这个对角矩阵是不唯一的)
b. 任何二次型也可以通过正交变换化成标准形,用矩阵语言表述即是任何实对称矩阵 A A A 一定存在正交矩阵 Q Q Q 使得 Q − 1 A Q = Q T A Q = Λ Q^{-1}AQ = Q^TAQ = \Lambda Q − 1 A Q = Q T A Q = Λ (正交矩阵不唯一,但这个对角矩阵是唯一的,表征的是特征值的排布,是沟通矩阵相似与二次型的桥梁,高级双料特工)
(3)坐标变换和惯性定理
a. 坐标变换:( x 1 x 2 x 3 ) = ( c 11 c 12 c 13 c 21 c 22 c 23 c 31 c 32 c 33 ) ( y 1 y 2 y 3 ) \begin{pmatrix} x_1 \\ x_2 \\ x_3 \end{pmatrix} = \begin{pmatrix} c_{11} & c_{12} & c_{13} \\ c_{21} & c_{22} & c_{23} \\ c_{31} & c_{32} & c_{33} \end{pmatrix} \begin{pmatrix} y_1 \\ y_2 \\ y_3 \end{pmatrix} x 1 x 2 x 3 = c 11 c 21 c 31 c 12 c 22 c 32 c 13 c 23 c 33 y 1 y 2 y 3 (其中 C C C 是可逆矩阵)
b. 无论选取什么样的可逆线性变换,将二次型化成标准形或规范形,其正项个数 p p p ,负项个数 q q q 都是不变的,p p p 称为正惯性指数,q q q 称为负惯性指数
c. 两个二次型(或者叫实对称矩阵)合同的充要条件是有相同的正、负惯性指数,或有相同的秩及正(或负)惯性指数,或有相同的正、负特征值个数
💡 C T A C C^TAC C T A C 变换称为合同变换,而矩阵相似那个地方的变换是 P − 1 A P P^{-1}AP P − 1 A P ,不要搞混,一定要区分开来
配方法化标准形
(1)必备工具
a. ( a + b ) 2 = a 2 + 2 a b + b 2 (a + b)^2 = a^2 + 2ab + b^2 ( a + b ) 2 = a 2 + 2 ab + b 2
b. ( a + b + c ) 2 = a 2 + b 2 + c 2 + 2 a b + 2 a c + 2 b c (a + b + c)^2 = a^2 + b^2 + c^2 + 2ab + 2ac + 2bc ( a + b + c ) 2 = a 2 + b 2 + c 2 + 2 ab + 2 a c + 2 b c
(2)标准配方过程:第一步先把 x 1 x_1 x 1 全部配完,然后再配 x 2 , x 3 x_2, x_3 x 2 , x 3
(3)例题:
(4)其他常用技巧:
a. 遇到大量交叉项或交叉项不好处理的时候,可以通过 { x 1 = y 1 + y 2 x 2 = y 1 − y 2 x 3 = y 3 \begin{cases} x_1 = y_1 + y_2 \\ x_2 = y_1 - y_2 \\ x_3 = y_3 \end{cases} ⎩ ⎨ ⎧ x 1 = y 1 + y 2 x 2 = y 1 − y 2 x 3 = y 3 (根据实际情况灵活构造)来构造平方项,然后再用 z = B y z = By z = B y 来构造出规范形和 x = C z x = Cz x = C z
正交变换法 (和配方法的地位不相上下,但没法像配方法一样一步配到规范形)
基本步骤对于 f = x T A x f = x^T Ax f = x T A x
(1)求 A A A 的特征值 λ 1 , λ 2 , ⋯ , λ n \lambda_1, \lambda_2, \cdots, \lambda_n λ 1 , λ 2 , ⋯ , λ n
(2)求 A A A 的对应于特征值 λ 1 , λ 2 , ⋯ , λ n \lambda_1, \lambda_2, \cdots, \lambda_n λ 1 , λ 2 , ⋯ , λ n 的特征向量 ξ 1 , ξ 2 , ⋯ , ξ n \xi_1, \xi_2, \cdots, \xi_n ξ 1 , ξ 2 , ⋯ , ξ n
(3)将 ξ 1 , ξ 2 , ⋯ , ξ n \xi_1, \xi_2, \cdots, \xi_n ξ 1 , ξ 2 , ⋯ , ξ n 正交化(如果需要的话)、单位化为 η 1 , η 2 , ⋯ , η n \eta_1, \eta_2, \cdots, \eta_n η 1 , η 2 , ⋯ , η n
(4)令 Q = [ η 1 , η 2 , ⋯ , η n ] Q = [\eta_1, \eta_2, \cdots, \eta_n] Q = [ η 1 , η 2 , ⋯ , η n ] 则 Q Q Q 为正交矩阵且 Q − 1 A Q = Q T A Q = Λ Q^{-1}AQ = Q^TAQ = \Lambda Q − 1 A Q = Q T A Q = Λ
于是 f = x T A x → ( Q y ) T A ( Q y ) = y T Q T A Q y = y T Λ y f = x^TAx \rightarrow (Qy)^T A(Qy) = y^TQ^T AQ y = y^T \Lambda y f = x T A x → ( Q y ) T A ( Q y ) = y T Q T A Q y = y T Λ y
注:
a. 正交变换 x = Q y x = Qy x = Q y 下得到的 Λ \Lambda Λ 的主对角线元素是 A A A 的特征值
b. 应用正交变换法只能将二次型化为标准形,而不能化为规范形。一般来说,化二次型为规范形还需要进行一步线性变换 y = C z y = Cz y = C z
💡 这里回想一下之前学过的性质:
(1)正交矩阵的特征值只能是 1 或 -1(从而可以一步化到规范形)
(2)如果 A , B A,B A , B 均是实对称矩阵,且 A ~ B A~B A ~ B ,则一定存在一个正交矩阵 Q Q Q 使得 Q T A Q = B Q^TAQ = B Q T A Q = B
💡 平方和形式(即 f = ( . . . ) 2 + ( . . . ) 2 + ⋯ f = (...)^2 + (...)^2 + \cdots f = ( ... ) 2 + ( ... ) 2 + ⋯ )的二次型具有哪些性质(设 y = B x y = Bx y = B x )
(1)f ≥ 0 f \ge 0 f ≥ 0 ,那么特征值一定 ≥ 0 \ge 0 ≥ 0 ,也就无负惯性指数(因为总能找到一个 x = Q y x = Qy x = Q y 这样一个正交变换使 f = λ 1 y 1 2 + λ 2 y 2 2 + λ 3 y 3 2 f = \lambda_1 y_1^2 + \lambda_2 y_2^2 + \lambda_3 y_3^2 f = λ 1 y 1 2 + λ 2 y 2 2 + λ 3 y 3 2 )
(2)正惯性指数 p = r ( B ) p = r(B) p = r ( B ) (因为秩 r = p + q r = p + q r = p + q ,无负惯性指数,即 q = 0 q = 0 q = 0 ,r ( B T B ) = p = r ( B ) r(B^TB) = p = r(B) r ( B T B ) = p = r ( B ) )
(3)当 r ( B ) r(B) r ( B ) 满秩时,p = n p = n p = n ,正惯性指数拉满了,那么 f f f 正定
⚠️ 不过要注意,( . . . ) 2 − ( . . . ) 2 (...)^2 - (...)^2 ( ... ) 2 − ( ... ) 2 就不行了
正定二次型及其判别
(1)定义:n n n 元二次型 f ( x 1 , x 2 , ⋯ , x n ) = x T A x f(x_1, x_2, \cdots, x_n) = x^TAx f ( x 1 , x 2 , ⋯ , x n ) = x T A x ,若对任意 x = [ x 1 , x 2 , ⋯ , x n ] T ≠ 0 x = [x_1, x_2, \cdots, x_n]^T \ne 0 x = [ x 1 , x 2 , ⋯ , x n ] T = 0 ,均有 x T A x > 0 x^TAx > 0 x T A x > 0 ,则称 f f f 为正定二次型,称二次型对应的矩阵 A A A 为正定矩阵
(2)二次型正定的充要条件
a. 对任意 x ≠ 0 x\ne 0 x = 0 有 x T A x > 0 x^TAx > 0 x T A x > 0
b. f f f 的正惯性指数 p = n p = n p = n
c. 存在可逆矩阵 D D D 使得 A = D T D = ∣ ∣ D ∣ ∣ 2 A= D^TD = ||D||^2 A = D T D = ∣∣ D ∣ ∣ 2
d. A ≃ E A\simeq E A ≃ E
e. A A A 的特征值 λ i > 0 \lambda_i > 0 λ i > 0
f. A A A 的全部顺序主子式均大于 0
(3)二次型正定的必要条件
a. a i i > 0 a_{ii} > 0 a ii > 0
b. ∣ A ∣ > 0 |A| > 0 ∣ A ∣ > 0