返回

记D= | a 11 a 21 ⋮ a n 1 a 12 a 22 ⋮ a n 2 ⋯ ⋯ ⋯ a 1 n a 2 n ⋮ a n n | \left| \begin{array}{r} \begin{matrix} a_{11} \\ a_{21} \end{matrix} \\ \begin{matrix} \vdots \\ a_{n1} \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} a_{12} \\ a_{22} \end{matrix} \\ \begin{matrix} \vdots \\ a_{n2} \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_{1n} \\ a_{2n} \end{matrix} \\ \begin{matrix} \vdots \\ a_{nn} \end{matrix} \end{array} \right| , DT= | a 11 a 12 ⋮ a 1 n a 21 a 22 ⋮ a 2 n ⋯ ⋯ ⋯ a n 1 a n 2 ⋮ a n n | \left| \begin{array}{r} \begin{matrix} a_{11} \\ a_{12} \end{matrix} \\ \begin{matrix} \vdots \\ a_{1n} \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} a_{21} \\ a_{22} \end{matrix} \\ \begin{matrix} \vdots \\ a_{2n} \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_{n1} \\ a_{n2} \end{matrix} \\ \begin{matrix} \vdots \\ a_{nn} \end{matrix} \end{array} \right|

行列式DT称为行列式D的转置行列式

性质1行列式与它的转置行列式相等

示例验证(以2阶行列式为例)

为直观理解,以2阶矩阵 A = ( a 11 a 12 a 21 a 22 ) A = \begin{pmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{pmatrix} 为例:

A A 的行列式: d e t ( A ) = a 11 a 22 − a 12 a 21 det(A) = a_{11}a_{22} - a_{12}a_{21} ;

A A 的转置: A T = ( a 11 a 21 a 12 a 22 ) A^{T} = \begin{pmatrix} a_{11} & a_{21} \\ a_{12} & a_{22} \end{pmatrix} ;

A T A^{T} 的行列式: d e t ( A T ) = a 11 a 22 − a 21 a 12 det(A^{T}) = a_{11}a_{22} - a_{21}a_{12} 。

显然, d e t ( A ) = d e t ( A T ) det(A) = det(A^{T}) 。

性质2 对换行列式的两行(列) , 行列式变号

以ri表示行列式的第i行 , 以ci表示第i列

对换i , j两行记作ri⟷rj , 对换i , j两列记作ci⟷cj

举例验证:

一、先计算原三阶行列式的值

原行列式为: D = ∣ 2 5 2 1 8 3 6 7 3 ∣ D = \begin{vmatrix} 2 & 5 & 2 \\ 1 & 8 & 3 \\ 6 & 7 & 3 \end{vmatrix}

按三阶行列式定义计算:

D = 2 × 8 × 3 + 1 × 7 × 2 + 6 × 5 × 3 − 6 × 8 × 2 − 1 × 5 × 3 − 2 × 7 × 3 D = 2 \times 8 \times 3 + 1 \times 7 \times 2 + 6 \times 5 \times 3 - 6 \times 8 \times 2 - 1 \times 5 \times 3 - 2 \times 7 \times 3

= 48 + 14 + 90 − 96 − 15 − 42 = 48 + 14 + 90 - 96 - 15 - 42

= 152 − 153 = 152 - 153

=1

二、对换行列式的任意两行(以对换第1、2行为例),

对换第1、2行后,新行列式 D 1 D_{1} 为: D 1 = ∣ 1 8 3 2 5 2 6 7 3 ∣ D_{1} = \begin{vmatrix} 1 & 8 & 3 \\ 2 & 5 & 2 \\ 6 & 7 & 3 \end{vmatrix}

同样按三阶行列式定义展开计算:

D 1 = 1 × 5 × 3 + 2 × 7 × 3 + 6 × 8 × 2 − 6 × 5 × 3 − 2 × 8 × 3 − 1 × 7 × 2 D_{1} = 1 \times 5 \times 3 + 2 \times 7 \times 3 + 6 \times 8 \times 2 - 6 \times 5 \times 3 - 2 \times 8 \times 3 - 1 \times 7 \times 2

= 15 + 42 + 96 − 90 − 48 − 14 = 15 + 42 + 96 - 90 - 48 - 14

= 153 − 152 = 153 - 152

=1

三、验证“对换两行,行列式变号”

原行列式 D = − 1 D = - 1 ,对换行后的行列式 D 1 = 1 D_{1} = 1 ,满足: D 1 = − D D_{1} = - D

推论 如果行列式有两行(列)完全相同 , 则此行列式等于零

证: 把这两行对换 , 有D=-D , 故D=0

性质3 行列式的某一行(列)中所有的元素都乘同一数k ,

等于用数k乘此行列式 , 表达式ri×k(或ci×k)表示第i行(或列)乘k ,

举例:取: D = | 1 0 1 2 1 0 0 1 1 | D = \left| \begin{matrix} 1 & 0 & 1 \\ 2 & 1 & 0 \\ 0 & 1 & 1 \end{matrix} \right|

1)原行列式展开

D = 1 ( 1 ⋅ 1 − 0 ⋅ 1 ) − 0 ( 2 ⋅ 1 − 0 ⋅ 0 ) + 1 ( 2 ⋅ 1 − 1 ⋅ 0 ) = 1 + 2 = 3 D = 1(1 \cdot 1 - 0 \cdot 1) - 0(2 \cdot 1 - 0 \cdot 0) + 1(2 \cdot 1 - 1 \cdot 0) = 1 + 2 = 3

2)D的第 2 行乘 k = 3 k = 3

得 D 1 = | 1 0 1 3 ⋅ 2 3 ⋅ 1 3 ⋅ 0 0 1 1 | = | 1 0 1 6 3 0 0 1 1 | D_{1} = \left| \begin{matrix} 1 & 0 & 1 \\ 3 \cdot 2 & 3 \cdot 1 & 3 \cdot 0 \\ 0 & 1 & 1 \end{matrix} \right| = \left| \begin{matrix} 1 & 0 & 1 \\ 6 & 3 & 0 \\ 0 & 1 & 1 \end{matrix} \right|

按定义展开:

D 1 = 1 ( 3 ⋅ 1 − 0 ⋅ 1 ) − 0 ( 6 ⋅ 1 − 0 ⋅ 0 ) + 1 ( 6 ⋅ 1 − 3 ⋅ 0 ) = 3 + 6 = 9 D_{1} = 1(3 \cdot 1 - 0 \cdot 1) - 0(6 \cdot 1 - 0 \cdot 0) + 1(6 \cdot 1 - 3 \cdot 0) = 3 + 6 = 9

3)对比

k D = 3 ⋅ 3 = 9 = D 1 kD = 3 \cdot 3 = 9 = D_{1} 成立。

推论 行列式中某一行(列)的所有元素的公因子可以提到行列式记号的外面

表达式ri÷k(或ci÷k)表示第i行(或列)提出公因子k

有 | a 11 ⋮ k a i 1 ⋮ a n 1 a 12 ⋮ k a i 2 ⋮ a n 2 ⋯ ⋯ ⋯ a 1 n ⋮ k a i n ⋮ a n n | ⇒ r i ÷ k k | a 11 ⋮ a i 1 ⋮ a n 1 a 12 ⋮ a i 2 ⋮ a n 2 ⋯ ⋯ ⋯ a 1 n ⋮ a i n ⋮ a n n | \left| \begin{array}{r} \begin{matrix} a_{11} \\ \vdots \end{matrix} \\ \begin{matrix} {ka}_{i1} \\ \vdots \\ a_{n1} \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} a_{12} \\ \vdots \end{matrix} \\ \begin{matrix} {ka}_{i2} \\ \vdots \\ a_{n2} \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} {ka}_{in} \\ \vdots \\ a_{nn} \end{matrix} \end{array} \right|\overset{r_{i} \div k}{\Rightarrow}\ \ k\left| \begin{array}{r} \begin{matrix} a_{11} \\ \vdots \end{matrix} \\ \begin{matrix} a_{i1} \\ \vdots \\ a_{n1} \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} a_{12} \\ \vdots \end{matrix} \\ \begin{matrix} a_{i2} \\ \vdots \\ a_{n2} \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_{in} \\ \vdots \\ a_{nn} \end{matrix} \end{array} \right|

性质4行列式中如果有两行(列)元素成比例 , 则此行列式等于零

性质5 若行列式的某一行(列)的元素都是两数之和, 则D等于两个行列式之和

举例验证(3阶行列式)

设 D = | 1 2 3 0 + 4 1 + 5 2 + 6 7 8 9 | D = \left| \begin{matrix} 1 & 2 & 3 \\ 0 + 4 & 1 + 5 & 2 + 6 \\ 7 & 8 & 9 \end{matrix} \right| ,这里第 2 行元素是两个数之和。

直接计算 D

D = | 1 2 3 4 6 8 7 8 9 | = 0 D = \left| \begin{matrix} 1 & 2 & 3 \\ 4 & 6 & 8 \\ 7 & 8 & 9 \end{matrix} \right| = 0 。

拆成两个行列式

D 1 = | 1 2 3 0 1 2 7 8 9 | D_{1} = \left| \begin{matrix} 1 & 2 & 3 \\ 0 & 1 & 2 \\ 7 & 8 & 9 \end{matrix} \right| , D 2 = | 1 2 3 4 5 6 7 8 9 | D_{2} = \left| \begin{matrix} 1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9 \end{matrix} \right|

D 1 = 0 D_{1} = 0 。 D 2 = 0 D_{2} = 0 。

验证 D = D 1 + D 2 D = D_{1} + D_{2}

D 1 + D 2 = 0 + 0 = 0 D_{1} + D_{2} = 0 + 0 = 0

D = 0 D = 0

成立。

性质6把行列式的某一行(列)的各元素乘同一数

然后加到另一行(列)对应的元素上去 , 行列式不变

例如以数k乘第i行加到第j行上(记作rj+kri) , 有

| a 11 ⋮ a i 1 ⋮ a j 1 ⋮ a n 1 a 12 ⋮ a i 2 ⋮ a j 2 ⋮ a n 2 ⋯ ⋯ ⋯ ⋯ a 1 n ⋮ a i n ⋮ a j n ⋮ a n n | r j + k r i = | a 11 ⋮ a i 1 ⋮ a j 1 + k a i 1 ⋮ a n 1 a 12 ⋮ a i 2 ⋮ a j 2 + k a i 2 ⋮ a n 2 ⋯ ⋯ ⋯ ⋯ a 1 n ⋮ a i n ⋮ a j n + k a i n ⋮ a n n | ( i ≠ j ) \left| \begin{array}{r} \begin{array}{r} \begin{matrix} a_{11} \\ \vdots \end{matrix} \\ \begin{matrix} a_{i1} \\ \vdots \end{matrix} \end{array} \\ \begin{matrix} a_{j1} \\ \vdots \\ a_{n1} \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{array}{r} \begin{matrix} a_{12} \\ \vdots \end{matrix} \\ \begin{matrix} a_{i2} \\ \vdots \end{matrix} \end{array} \\ \begin{matrix} a_{j2} \\ \vdots \\ a_{n2} \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{array}{r} \begin{matrix} \cdots \\ \end{matrix} \\ \begin{matrix} \cdots \\ \end{matrix} \end{array} \\ \begin{matrix} \cdots \\ \\ \cdots \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{array}{r} \begin{matrix} a_{1n} \\ \vdots \end{matrix} \\ \begin{matrix} a_{in} \\ \vdots \end{matrix} \end{array} \\ \begin{matrix} a_{jn} \\ \vdots \\ a_{nn} \end{matrix} \end{array} \right|\begin{matrix} \ \ r_{j} + {kr}_{i} \\ = \\ \end{matrix}\left| \begin{array}{r} \begin{array}{r} \begin{matrix} a_{11} \\ \vdots \end{matrix} \\ \begin{matrix} a_{i1} \\ \vdots \end{matrix} \end{array} \\ \begin{matrix} a_{j1} + {ka}_{i1} \\ \vdots \\ a_{n1} \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{array}{r} \begin{matrix} a_{12} \\ \vdots \end{matrix} \\ \begin{matrix} a_{i2} \\ \vdots \end{matrix} \end{array} \\ \begin{matrix} a_{j2} + {ka}_{i2} \\ \vdots \\ a_{n2} \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{array}{r} \begin{matrix} \cdots \\ \end{matrix} \\ \begin{matrix} \cdots \\ \end{matrix} \end{array} \\ \begin{matrix} \cdots \\ \\ \cdots \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{array}{r} \begin{matrix} a_{1n} \\ \vdots \end{matrix} \\ \begin{matrix} a_{in} \\ \vdots \end{matrix} \end{array} \\ \begin{matrix} a_{jn} + {ka}_{in} \\ \vdots \\ a_{nn} \end{matrix} \end{array} \right|(i \neq j)

(如果以数k乘第i列加到第j列上 , 则记作cj+kci)

举例验证

取一个 3 × 3 3 \times 3 行列式: D = | 1 2 3 0 1 4 5 6 0 | = 1 D = \left| \begin{matrix} 1 & 2 & 3 \\ 0 & 1 & 4 \\ 5 & 6 & 0 \end{matrix} \right| = 1 。

第二步:对 D D 做行变换

把第一行乘以 2 2 加到第二行(即 R 2 ← R 2 + 2 R 1 R_{2} \leftarrow R_{2} + 2R_{1} )。

新行列式: D ′ = | 1 2 3 2 5 10 5 6 0 | D' = \left| \begin{matrix} 1 & 2 & 3 \\ 2 & 5 & 10 \\ 5 & 6 & 0 \end{matrix} \right|

第三步:计算 D ′ D'

D ′ = 1 D' = 1

结果仍然是 1 1 ,与 D D 相等,验证了该性质。

上述性质5表明:当某一行(或列)的元素为两数之和时

行列式关于该行(或列)可分解为两个行列式.

若n阶行列式每个元素都表示成两数之和 , 则它可分解成2n个行列式

例如二阶行列式

| a + x b + y c + z d + w | \left| \begin{matrix} a + x & b + y \\ c + z & d + w \end{matrix} \right| = | a b + y c d + w | \left| \begin{matrix} a & b + y \\ c & d + w \end{matrix} \right| + | x b + y z d + w | \left| \begin{matrix} x & b + y \\ z & d + w \end{matrix} \right| = | a b c d | \left| \begin{matrix} a & b \\ c & d \end{matrix} \right| + | a y c w | \left| \begin{matrix} a & y \\ c & w \end{matrix} \right| + | x b z d | \left| \begin{matrix} x & b \\ z & d \end{matrix} \right| + | x y z w | \left| \begin{matrix} x & y \\ z & w \end{matrix} \right|

性质2 , 3 , 6介绍了行列式关于行和关于列的三种运算,

即ri⟷rj , ri×k , ri+krj和ci⟷cj , ci×k , ci+kcj

利用这些运算可简化行列式的计算,

特别是利用运算ri+krj(或ci+kcj)可以把行列式中许多元素化为0

计算行列式常用的一种方法就是利用运算ri+krj

把行列式化为上三角形行列式 , 从而算得行列式的值.

例6计算n阶行列式

(1) D n = | 0 0 ⋯ 0 a 1 n 0 0 ⋯ a 2 , n − 1 a 2 n 0 ⋯ a 3 , n − 2 a 3 , n − 1 a 3 n ⋮ ⋱ ⋮ ⋮ ⋮ a n 1 ⋯ a n , n − 2 a n , n − 1 a n n | . D_{n} = \left| \begin{matrix} 0 & 0 & \cdots & 0 & a_{1n} \\ 0 & 0 & \cdots & a_{2,n - 1} & a_{2n} \\ 0 & \cdots & a_{3,n - 2} & a_{3,n - 1} & a_{3n} \\ \vdots & \ddots & \vdots & \vdots & \vdots \\ a_{n1} & \cdots & a_{n,n - 2} & a_{n,n - 1} & a_{nn} \end{matrix} \right|. ( 2 ) | λ n ⋰ λ 2 λ 1 | \ \ \ (2)\left| \begin{array}{r} \begin{matrix} \\ \end{matrix} \\ \begin{matrix} \\ \lambda_{n} \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} \\ \end{matrix} \\ \begin{matrix} ⋰ \\ \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} \\ \lambda_{2} \end{matrix} \\ \begin{matrix} \\ \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} \lambda_{1} \\ \end{matrix} \\ \begin{matrix} \\ \end{matrix} \end{array} \right|

解:

(1) 1. 观察行列式结构

原行列式为: D n = | 0 0 ⋯ 0 a 1 n 0 0 ⋯ a 2 , n − 1 a 2 n 0 ⋯ a 3 , n − 2 a 3 , n − 1 a 3 n ⋮ ⋱ ⋮ ⋮ ⋮ a n 1 ⋯ a n , n − 2 a n , n − 1 a n n | D_{n} = \left| \begin{matrix} 0 & 0 & \cdots & 0 & a_{1n} \\ 0 & 0 & \cdots & a_{2,n - 1} & a_{2n} \\ 0 & \cdots & a_{3,n - 2} & a_{3,n - 1} & a_{3n} \\ \vdots & \ddots & \vdots & \vdots & \vdots \\ a_{n1} & \cdots & a_{n,n - 2} & a_{n,n - 1} & a_{nn} \end{matrix} \right|

它不是上三角或下三角行列式。

但非零元素分布呈“反对角线方向”聚集,可以通过行交换化为上三角形式。

2. 逐步行交换化为上三角

我们目标是:将最后一行(第 n n 行)换到第 1 行,将第 n − 1 n - 1 行换到第 2 行,依此类推,最终使矩阵变为上三角。

第一步

将第 n n 行依次与第 n − 1 n - 1 行、第 n − 2 n - 2 行、……、第 1 行交换,

共 n − 1 n - 1 次交换,得到新行列式 D 1 D_{1} 。

交换后,第 1 行变为原来的第 n n 行: ( a n 1 , a n 2 , … , a n n ) (a_{n1},a_{n2},\ldots,a_{nn})

其余行依次上移,最后一行变为原来的第 1 行: ( 0 , 0 , … , 0 , a 1 n ) (0,0,\ldots,0,a_{1n})

由行列式性质,每交换一次行,符号改变一次,

因此: D 1 = ( − 1 ) n − 1 D n ⇒ D n = ( − 1 ) n − 1 D 1 D_{1} = ( - 1)^{n - 1}D_{n}\quad \Rightarrow \quad D_{n} = ( - 1)^{n - 1}D_{1}

第二步

在 D 1 D_{1} 中,第 1 行已经到位(即最终上三角的第 1 行)。

现在将第 n n 行(此时是原来的第 1 行)依次与

第 n − 1 n - 1 行、……、第 2 行交换,共 n − 2 n - 2 次交换,得到 D 2 D_{2} 。

此时: D 2 = ( − 1 ) n − 2 D 1 ⇒ D n = ( − 1 ) ( n − 1 ) + ( n − 2 ) D 2 D_{2} = ( - 1)^{n - 2}D_{1}\quad \Rightarrow \quad D_{n} = ( - 1)^{(n - 1) + (n - 2)}D_{2}

继续此过程

每一步都是将当前最后一行交换到它最终应在的位置,

交换次数依次为: n − 1 , n − 2 , … , 1 n - 1,\ n - 2,\ \ldots,\ 1

总交换次数: S = ( n − 1 ) + ( n − 2 ) + … + 1 = n ( n − 1 ) 2 S = (n - 1) + (n - 2) + \ldots + 1 = \frac{n(n - 1)}{2}

3. 最终上三角行列式

经过所有交换后,行列式变为上三角形式: | a n 1 a n 2 ⋯ a n n 0 a n − 1 , 2 ⋯ a n − 1 , n 0 0 ⋱ ⋮ 0 0 ⋯ a 1 n | \left| \begin{matrix} a_{n1} & a_{n2} & \cdots & a_{nn} \\ 0 & a_{n - 1,2} & \cdots & a_{n - 1,n} \\ 0 & 0 & \ddots & \vdots \\ 0 & 0 & \cdots & a_{1n} \end{matrix} \right|

上三角行列式的值等于对角线元素乘积: 对 角 元 = a n 1 , a n − 1 , 2 , a n − 2 , 3 , … , a 1 n 对角元 = a_{n1},\ a_{n - 1,2},\ a_{n - 2,3},\ \ldots,\ a_{1n}

即: d e t ( 上 三 角 ) = a n 1 ⋅ a n − 1 , 2 ⋅ a n − 2 , 3 ⋯ a 1 n det(上三角) = a_{n1} \cdot a_{n - 1,2} \cdot a_{n - 2,3}\cdots a_{1n}

4. 符号与最终公式

原行列式 D n D_{n} 经过 S = n ( n − 1 ) 2 S = \frac{n(n - 1)}{2} 次行交换得到上三角行列式,

因此: D n = ( − 1 ) n ( n − 1 ) 2 ⋅ ( a n 1 a n − 1 , 2 ⋯ a 1 n ) D_{n} = ( - 1)^{\frac{n(n - 1)}{2}} \cdot \left( a_{n1}a_{n - 1,2}\cdots a_{1n} \right)

也可以按原题中元素的顺序写作: D n = ( − 1 ) n ( n − 1 ) 2 ⋅ a 1 n a 2 , n − 1 a 3 , n − 2 ⋯ a n 1 D_{n} = ( - 1)^{\frac{n(n - 1)}{2}} \cdot a_{1n}a_{2,n - 1}a_{3,n - 2}\cdots a_{n1}

(2)由(1)得 | λ n ⋰ λ 2 λ 1 | = ( − 1 ) n ( n − 1 ) 2 λ 1 λ 2 ⋯ λ n \left| \begin{array}{r} \begin{matrix} \\ \end{matrix} \\ \begin{matrix} \\ \lambda_{n} \end{matrix} \end{array}\ \ \begin{array}{r} \begin{matrix} \\ \end{matrix} \\ \begin{matrix} ⋰ \\ \end{matrix} \end{array}\ \ \begin{array}{r} \begin{matrix} \\ \lambda_{2} \end{matrix} \\ \begin{matrix} \\ \end{matrix} \end{array}\ \ \begin{array}{r} \begin{matrix} \lambda_{1} \\ \end{matrix} \\ \begin{matrix} \\ \end{matrix} \end{array} \right| = ( - 1)^{\frac{n(n - 1)}{2}}\lambda_{1}\lambda_{2}\cdots\lambda_{n}

例7计算D= | 3 − 5 2 1 1 1 0 − 5 − 1 3 1 3 2 − 4 − 1 − 3 | \left| \begin{array}{r} \begin{matrix} 3 \\ - 5 \end{matrix} \\ \begin{matrix} 2 \\ 1 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 1 \\ 1 \end{matrix} \\ \begin{matrix} 0 \\ - 5 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} - 1 \\ 3 \end{matrix} \\ \begin{matrix} 1 \\ 3 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 2 \\ - 4 \end{matrix} \\ \begin{matrix} - 1 \\ - 3 \end{matrix} \end{array} \right|

解: D ⇒ r 1 ↔ r 4 − | 1 − 5 2 3 − 5 1 0 1 3 3 1 − 1 − 3 − 4 − 1 2 | ⇒ r 2 + 5 r 1 r 3 − 2 r 1 r 4 − 3 r 1 − | 1 0 0 0 − 5 − 24 10 16 3 18 − 5 − 10 − 3 − 19 5 11 | \overset{r_{1} \leftrightarrow r_{4}}{\Rightarrow} - \left| \begin{array}{r} \begin{matrix} 1 \\ - 5 \end{matrix} \\ \begin{matrix} 2 \\ 3 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} - 5 \\ 1 \end{matrix} \\ \begin{matrix} 0 \\ 1 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 3 \\ 3 \end{matrix} \\ \begin{matrix} 1 \\ - 1 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} - 3 \\ - 4 \end{matrix} \\ \begin{matrix} - 1 \\ 2 \end{matrix} \end{array} \right|\overset{\begin{matrix} r_{2} + 5r_{1} \\ r_{3} - 2r_{1} \\ r_{4} - 3r_{1} \end{matrix}}{\Rightarrow} - \left| \begin{array}{r} \begin{matrix} 1 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} - 5 \\ - 24 \end{matrix} \\ \begin{matrix} 10 \\ 16 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 3 \\ 18 \end{matrix} \\ \begin{matrix} - 5 \\ - 10 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} - 3 \\ - 19 \end{matrix} \\ \begin{matrix} 5 \\ 11 \end{matrix} \end{array} \right|

⇒ r 3 ÷ 2 − 5 | 1 0 0 0 − 5 − 24 2 16 3 18 − 1 − 10 − 3 − 19 1 11 | ⇒ r 2 ↔ r 3 5 | 1 0 0 0 − 5 2 − 24 16 3 − 1 18 − 10 − 3 1 − 19 11 | \overset{r_{3} \div 2}{\Rightarrow} - 5\left| \begin{array}{r} \begin{matrix} 1 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} - 5 \\ - 24 \end{matrix} \\ \begin{matrix} 2 \\ 16 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 3 \\ 18 \end{matrix} \\ \begin{matrix} - 1 \\ - 10 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} - 3 \\ - 19 \end{matrix} \\ \begin{matrix} 1 \\ 11 \end{matrix} \end{array} \right|\overset{r_{2} \leftrightarrow r_{3}}{\Rightarrow}5\left| \begin{array}{r} \begin{matrix} 1 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} - 5 \\ 2 \end{matrix} \\ \begin{matrix} - 24 \\ 16 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 3 \\ - 1 \end{matrix} \\ \begin{matrix} 18 \\ - 10 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} - 3 \\ 1 \end{matrix} \\ \begin{matrix} - 19 \\ 11 \end{matrix} \end{array} \right|

⇒ r 3 + 12 r 2 r 4 − 8 r 2 5 | 1 0 0 0 − 5 2 0 0 3 − 1 6 − 2 − 3 1 − 7 3 | ⇒ r 3 ↔ r 4 − 5 | 1 0 0 0 − 5 2 0 0 3 − 1 − 2 6 − 3 1 3 − 7 | ⇒ r 4 + 3 r 3 − 5 | 1 0 0 0 − 5 2 0 0 3 − 1 − 2 0 − 3 1 3 2 | \overset{\begin{matrix} r_{3} + 12r_{2} \\ r_{4} - 8r_{2} \end{matrix}}{\Rightarrow}5\left| \begin{array}{r} \begin{matrix} 1 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} - 5 \\ 2 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 3 \\ - 1 \end{matrix} \\ \begin{matrix} 6 \\ - 2 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} - 3 \\ 1 \end{matrix} \\ \begin{matrix} - 7 \\ 3 \end{matrix} \end{array} \right|\overset{r_{3} \leftrightarrow r_{4}}{\Rightarrow} - 5\left| \begin{array}{r} \begin{matrix} 1 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} - 5 \\ 2 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 3 \\ - 1 \end{matrix} \\ \begin{matrix} - 2 \\ 6 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} - 3 \\ 1 \end{matrix} \\ \begin{matrix} 3 \\ - 7 \end{matrix} \end{array} \right|\overset{r_{4} + 3r_{3}}{\Rightarrow} - 5\left| \begin{array}{r} \begin{matrix} 1 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} - 5 \\ 2 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 3 \\ - 1 \end{matrix} \\ \begin{matrix} - 2 \\ 0 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} - 3 \\ 1 \end{matrix} \\ \begin{matrix} 3 \\ 2 \end{matrix} \end{array} \right|

=-5×2×(-2)×2=40

例8计算D= | 3 1 1 1 1 3 1 1 1 1 3 1 1 1 1 3 | \left| \begin{array}{r} \begin{matrix} 3 \\ 1 \end{matrix} \\ \begin{matrix} 1 \\ 1 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 1 \\ 3 \end{matrix} \\ \begin{matrix} 1 \\ 1 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 1 \\ 1 \end{matrix} \\ \begin{matrix} 3 \\ 1 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 1 \\ 1 \end{matrix} \\ \begin{matrix} 1 \\ 3 \end{matrix} \end{array} \right|

解: 这个行列式的特点是各列4个数之和都是6

把第2 , 3 ,4行同时加到第1行 , 提出公因子6 , 然后各行减去第一行

D ⇒ r 1 + r 2 + r 3 + r 4 | 6 1 1 1 6 3 1 1 6 1 3 1 6 1 1 3 | ⇒ r 1 ÷ 6 6 | 1 1 1 1 1 3 1 1 1 1 3 1 1 1 1 3 | ⇒ r 2 − r 1 r 3 − r 1 r 4 − r 1 6 | 1 0 0 0 1 2 0 0 1 0 2 0 1 0 0 2 | = 48 \overset{r_{1} + r_{2} + r_{3} + r_{4}}{\Rightarrow}\left| \begin{array}{r} \begin{matrix} 6 \\ 1 \end{matrix} \\ \begin{matrix} 1 \\ 1 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 6 \\ 3 \end{matrix} \\ \begin{matrix} 1 \\ 1 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 6 \\ 1 \end{matrix} \\ \begin{matrix} 3 \\ 1 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 6 \\ 1 \end{matrix} \\ \begin{matrix} 1 \\ 3 \end{matrix} \end{array} \right|\overset{r_{1} \div 6}{\Rightarrow}6\left| \begin{array}{r} \begin{matrix} 1 \\ 1 \end{matrix} \\ \begin{matrix} 1 \\ 1 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 1 \\ 3 \end{matrix} \\ \begin{matrix} 1 \\ 1 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 1 \\ 1 \end{matrix} \\ \begin{matrix} 3 \\ 1 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 1 \\ 1 \end{matrix} \\ \begin{matrix} 1 \\ 3 \end{matrix} \end{array} \right|\overset{\begin{matrix} r_{2} - r_{1} \\ r_{3} - r_{1} \\ r_{4} - r_{1} \end{matrix}}{\Rightarrow}6\left| \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} 1 \\ 0 \end{matrix} \\ \begin{matrix} 2 \\ 0 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} 1 \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 2 \end{matrix} \end{array} \right| = 48

例9 计算D= | a a a a b a + b 2 a + b 3 a + b c a + b + c 3 a + 2 b + c 6 a + 3 b + c d a + b + c + d 4 a + 3 b + 2 c + d 10 a + 6 b + 3 c + d | \left| \begin{array}{r} \begin{matrix} a \\ a \end{matrix} \\ \begin{matrix} a \\ a \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} b \\ a + b \end{matrix} \\ \begin{matrix} 2a + b \\ 3a + b \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} c \\ a + b + c \end{matrix} \\ \begin{matrix} 3a + 2b + c \\ 6a + 3b + c \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} d \\ a + b + c + d \end{matrix} \\ \begin{matrix} 4a + 3b + 2c + d \\ 10a + 6b + 3c + d \end{matrix} \end{array} \right|

解:把第一行乘-1,加到第二行,加到第三行,加到第四行

得 | a 0 0 0 b a 2 a 3 a c a + b 3 a + 2 b 6 a + 3 b d a + b + c 4 a + 3 b + 2 c 10 a + 6 b + 3 c | \left| \begin{array}{r} \begin{matrix} a \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} b \\ a \end{matrix} \\ \begin{matrix} 2a \\ 3a \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} c \\ a + b \end{matrix} \\ \begin{matrix} 3a + 2b \\ 6a + 3b \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} d \\ a + b + c \end{matrix} \\ \begin{matrix} 4a + 3b + 2c \\ 10a + 6b + 3c \end{matrix} \end{array} \right|

把第二行乘-2,加到第三行,把第二行乘-3,加到第四行

得 | a 0 0 0 b a 0 0 c a + b a 3 a d a + b + c 2 a + b 7 a + 3 b | \left| \begin{array}{r} \begin{matrix} a \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} b \\ a \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} c \\ a + b \end{matrix} \\ \begin{matrix} a \\ 3a \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} d \\ a + b + c \end{matrix} \\ \begin{matrix} 2a + b \\ 7a + 3b \end{matrix} \end{array} \right|

把第三行乘-3,加到第四行

得 | a 0 0 0 b a 0 0 c a + b a 0 d a + b + c 2 a + b a | = a 4 \left| \begin{array}{r} \begin{matrix} a \\ 0 \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} b \\ a \end{matrix} \\ \begin{matrix} 0 \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} c \\ a + b \end{matrix} \\ \begin{matrix} a \\ 0 \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} d \\ a + b + c \end{matrix} \\ \begin{matrix} 2a + b \\ a \end{matrix} \end{array} \right| = a^{4}

上述诸例都是利用运算ri+hrj把行列式化为上三角形行列式,

用归纳法不难证明任何n阶行列式总能利用运算ri+krj化为上三角形行列式

或化为下三角形行列式(这时要先把a1n , ⋯ , an-1, n化为0)

类似地

利用列运算ci+kcj , 也可把行列式化为上三角形行列式或下三角形行列式.

例10设D= | a 11 ⋮ a k 1 c 11 ⋮ c n 1 ⋯ ⋯ ⋯ ⋯ a 1 k ⋮ a k k c 1 k ⋮ c n k b 11 ⋮ b n 1 ⋯ ⋯ b 1 n ⋮ b n n | \left| \begin{array}{r} \begin{matrix} a_{11} \\ \vdots \\ a_{k1} \end{matrix} \\ \begin{matrix} c_{11} \\ \vdots \\ c_{n1} \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} \cdots \\ \\ \cdots \end{matrix} \\ \begin{matrix} \cdots \\ \\ \cdots \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} a_{1k} \\ \vdots \\ a_{kk} \end{matrix} \\ \begin{matrix} c_{1k} \\ \vdots \\ c_{nk} \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} \\ \\ \end{matrix} \\ \begin{matrix} b_{11} \\ \vdots \\ b_{n1} \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} \\ \\ \end{matrix} \\ \begin{matrix} \cdots \\ \\ \cdots \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} \\ \\ \end{matrix} \\ \begin{matrix} b_{1n} \\ \vdots \\ b_{nn} \end{matrix} \end{array} \right|

D1=det(aij)= | a 11 ⋯ a 1 k ⋮ ⋮ a k 1 ⋯ a k k | \left| \begin{matrix} a_{11} & \cdots & a_{1k} \\ \vdots & & \vdots \\ a_{k1} & \cdots & a_{kk} \end{matrix} \right| , D2=det(bij)= | b 11 ⋯ b 1 n ⋮ ⋮ b n 1 ⋯ b n n | \left| \begin{matrix} b_{11} & \cdots & b_{1n} \\ \vdots & & \vdots \\ b_{n1} & \cdots & b_{nn} \end{matrix} \right|

试证明D=D1D2

证: 对D1作运算ri+λrj , 把D1化为下三角形行列式,

设为D1= | p 11 ⋮ ⋱ p k 1 ⋯ p k k | \left| \begin{matrix} p_{11} & & \\ \vdots & \ddots & \\ p_{k1} & \cdots & p_{kk} \end{matrix} \right| =p11⋯pkk

对D2作运算ci+λcj , 把D2化为下三角形行列式

设为D2= | q 11 ⋮ ⋱ q n 1 ⋯ q n n | \left| \begin{matrix} q_{11} & & \\ \vdots & \ddots & \\ q_{n1} & \cdots & q_{nn} \end{matrix} \right| =q11⋯qnn

于是 , 对D的前k行作运算ri+λrj , 再对后n列作运算ci+λcj

把D化为下三角形行列式D= | p 11 ⋮ p k 1 c 11 ⋮ c n 1 ⋱ ⋯ ⋯ ⋯ p k k c 1 k ⋮ c n k q 11 ⋮ q n 1 ⋱ ⋯ q n n | \left| \begin{array}{r} \begin{matrix} p_{11} \\ \vdots \\ p_{k1} \end{matrix} \\ \begin{matrix} c_{11} \\ \vdots \\ c_{n1} \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} \\ \ddots \\ \cdots \end{matrix} \\ \begin{matrix} \cdots \\ \\ \cdots \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} \\ \\ p_{kk} \end{matrix} \\ \begin{matrix} c_{1k} \\ \vdots \\ c_{nk} \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} \\ \\ \end{matrix} \\ \begin{matrix} q_{11} \\ \vdots \\ q_{n1} \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} \\ \\ \end{matrix} \\ \begin{matrix} \\ \ddots \\ \cdots \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} \\ \\ \end{matrix} \\ \begin{matrix} \\ \\ q_{nn} \end{matrix} \end{array} \right|

故D=p11 ⋯pkkq11⋯ qnn=D1D2

例11计算2n阶行列式D2n= | a c ⋱ ⋰ a c b d ⋰ ⋱ b d | \left| \begin{array}{r} \begin{matrix} a \\ \\ \end{matrix} \\ \begin{matrix} \\ \\ c \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} \\ \ddots \\ \end{matrix} \\ \begin{matrix} \\ ⋰ \\ \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} \\ \\ a \end{matrix} \\ \begin{matrix} c \\ \\ \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} \\ \\ b \end{matrix} \\ \begin{matrix} d \\ \\ \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} \\ ⋰ \\ \end{matrix} \\ \begin{matrix} \\ \ddots \\ \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} b \\ \\ \end{matrix} \\ \begin{matrix} \\ \\ d \end{matrix} \end{array} \right|

其中未写出的元素为0

解:把D2n中的第2n行依次与第2n-1行⋯第2行对换(作2n-2次相邻两行的对换)

再把第2n列依次与第2n-1列⋯第2列对换, 得

D2n=(-1)2(2n-2) | a c 0 ⋮ 0 b d 0 ⋮ 0 0 0 a c ⋱ ⋰ ⋯ ⋯ a c b d ⋰ ⋱ 0 0 b d | \left| \begin{array}{r} \begin{array}{r} \begin{array}{r} \begin{matrix} a \\ c \end{matrix} \\ \begin{matrix} 0 \\ \end{matrix} \end{array} \\ \begin{matrix} \vdots \\ \end{matrix} \end{array} \\ \begin{matrix} \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{array}{r} \begin{array}{r} \begin{matrix} b \\ d \end{matrix} \\ \begin{matrix} 0 \\ \end{matrix} \end{array} \\ \begin{matrix} \vdots \\ \end{matrix} \end{array} \\ \begin{matrix} \\ 0 \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{array}{r} \begin{array}{r} \begin{matrix} 0 \\ 0 \end{matrix} \\ \begin{matrix} a \\ \end{matrix} \end{array} \\ \begin{matrix} \\ \end{matrix} \end{array} \\ \begin{matrix} \\ c \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{array}{r} \begin{array}{r} \begin{matrix} \\ \end{matrix} \\ \begin{matrix} \\ \ddots \end{matrix} \end{array} \\ \begin{matrix} \\ \end{matrix} \end{array} \\ \begin{matrix} ⋰ \\ \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{array}{r} \begin{array}{r} \begin{matrix} \cdots \\ \cdots \end{matrix} \\ \begin{matrix} \\ \end{matrix} \end{array} \\ \begin{matrix} a \\ c \end{matrix} \end{array} \\ \begin{matrix} \\ \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{array}{r} \begin{array}{r} \begin{matrix} \\ \end{matrix} \\ \begin{matrix} \\ \end{matrix} \end{array} \\ \begin{matrix} b \\ d \end{matrix} \end{array} \\ \begin{matrix} \\ \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{array}{r} \begin{array}{r} \begin{matrix} \\ \end{matrix} \\ \begin{matrix} \\ ⋰ \end{matrix} \end{array} \\ \begin{matrix} \\ \end{matrix} \end{array} \\ \begin{matrix} \ddots \\ \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{array}{r} \begin{array}{r} \begin{matrix} 0 \\ 0 \end{matrix} \\ \begin{matrix} b \\ \end{matrix} \end{array} \\ \begin{matrix} \\ \end{matrix} \end{array} \\ \begin{matrix} \\ d \end{matrix} \end{array} \right|

根据例10的结果 , 有D2n=D2D2(n-1)=(ad-bc)D2(n-1)

以此作递推公式 , 即得D2n=(ad-bc)2D2(n-2)=⋯=(ad-bc)n-1D2=(ad-bc)n

以n等于3为例

| a c a c a c b d b d b d | \left| \begin{array}{r} \begin{matrix} a \\ \\ \end{matrix} \\ \begin{matrix} \\ \\ c \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} \\ a \\ \end{matrix} \\ \begin{matrix} \\ c \\ \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} \\ \\ a \end{matrix} \\ \begin{matrix} c \\ \\ \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} \\ \\ b \end{matrix} \\ \begin{matrix} d \\ \\ \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} \\ b \\ \end{matrix} \\ \begin{matrix} \\ d \\ \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} b \\ \\ \end{matrix} \\ \begin{matrix} \\ \\ d \end{matrix} \end{array}\ \right|

解:把D6中的第6行依次与第5行,第4行,第3行,第2行对换,

(作4次相邻两行的对换)

再把第6列依次与第5列,第4列,第3列,第2列对换 ,

| a c b d a c a c b d b d | \ \ \ \left| \begin{array}{r} \begin{matrix} a \\ c \\ \end{matrix} \\ \begin{matrix} \\ \\ \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} b \\ d \\ \end{matrix} \\ \begin{matrix} \\ \\ \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} \\ \\ a \end{matrix} \\ \begin{matrix} \\ \\ c \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} \\ \\ \end{matrix} \\ \begin{matrix} a \\ c \\ \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} \\ \\ \end{matrix} \\ \begin{matrix} b \\ d \\ \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} \\ \\ b \end{matrix} \\ \begin{matrix} \\ \\ d \end{matrix} \end{array}\ \right|

依此类推得

D6=(-1)8 | a c b d a c b d a c b d | \left| \begin{array}{r} \begin{matrix} a \\ c \\ \end{matrix} \\ \begin{matrix} \\ \\ \end{matrix} \end{array}\ \ \ \ \begin{array}{r} \begin{matrix} b \\ d \\ \end{matrix} \\ \begin{matrix} \\ \\ \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} \\ \\ a \end{matrix} \\ \begin{matrix} c \\ \\ \end{matrix} \end{array}\ \ \ \ \ \begin{array}{r} \begin{matrix} \\ \\ b \end{matrix} \\ \begin{matrix} d \\ \\ \end{matrix} \end{array}\ \ \ \begin{array}{r} \begin{matrix} \\ \\ \end{matrix} \\ \begin{matrix} \\ a \\ c \end{matrix} \end{array}\ \ \ \ \ \ \ \begin{array}{r} \begin{matrix} \\ \\ \end{matrix} \\ \begin{matrix} \\ b \\ d \end{matrix} \end{array}\ \ \right|

4

D6=D2D4=(ad-bc)D4

以此作递推公式 , 即得D6=(ad-bc)2D2=(ad-bc)3