行列式典型例题

16 minIntermediate2026/6/14

行列式计算与证明的典型例题集锦,涵盖化上三角、范德蒙德、递推法、加边法、抽象行列式等题型。

1. 化上三角法

例1

计算 1111123414916182764\begin{vmatrix} 1 & 1 & 1 & 1 \\ 1 & 2 & 3 & 4 \\ 1 & 4 & 9 & 16 \\ 1 & 8 & 27 & 64 \end{vmatrix}

:这是范德蒙德行列式,x1=1,x2=2,x3=3,x4=4x_1 = 1, x_2 = 2, x_3 = 3, x_4 = 4

D=1j<i4(xixj)=(21)(31)(41)(32)(42)(43)=1×2×3×1×2×1=12D = \prod_{1 \leq j < i \leq 4}(x_i - x_j) = (2-1)(3-1)(4-1)(3-2)(4-2)(4-3) = 1 \times 2 \times 3 \times 1 \times 2 \times 1 = 12

例2

计算 3111131111311113\begin{vmatrix} 3 & 1 & 1 & 1 \\ 1 & 3 & 1 & 1 \\ 1 & 1 & 3 & 1 \\ 1 & 1 & 1 & 3 \end{vmatrix}

:各行之和为 66,将第 2、3、4 列加到第 1 列:

D=6111631161316113=61111131111311113D = \begin{vmatrix} 6 & 1 & 1 & 1 \\ 6 & 3 & 1 & 1 \\ 6 & 1 & 3 & 1 \\ 6 & 1 & 1 & 3 \end{vmatrix} = 6 \begin{vmatrix} 1 & 1 & 1 & 1 \\ 1 & 3 & 1 & 1 \\ 1 & 1 & 3 & 1 \\ 1 & 1 & 1 & 3 \end{vmatrix}

各行减第一行:

=61111020000200002=6×1×2×2×2=48= 6 \begin{vmatrix} 1 & 1 & 1 & 1 \\ 0 & 2 & 0 & 0 \\ 0 & 0 & 2 & 0 \\ 0 & 0 & 0 & 2 \end{vmatrix} = 6 \times 1 \times 2 \times 2 \times 2 = 48

2. 递推法

例3

计算 Dn=2100012100012000002100012D_n = \begin{vmatrix} 2 & 1 & 0 & \cdots & 0 & 0 \\ 1 & 2 & 1 & \cdots & 0 & 0 \\ 0 & 1 & 2 & \cdots & 0 & 0 \\ \vdots & \vdots & \vdots & \ddots & \vdots & \vdots \\ 0 & 0 & 0 & \cdots & 2 & 1 \\ 0 & 0 & 0 & \cdots & 1 & 2 \end{vmatrix}

:按第一行展开:

Dn=2Dn11110002100002=2Dn1Dn2D_n = 2D_{n-1} - 1 \cdot \begin{vmatrix} 1 & 1 & 0 & \cdots & 0 \\ 0 & 2 & 1 & \cdots & 0 \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & 0 & \cdots & 2 \end{vmatrix} = 2D_{n-1} - D_{n-2}

Dn2Dn1+Dn2=0D_n - 2D_{n-1} + D_{n-2} = 0,特征方程 t22t+1=0t^2 - 2t + 1 = 0(t1)2=0(t-1)^2 = 0

通解 Dn=(C1+C2n)1n=C1+C2nD_n = (C_1 + C_2 n) \cdot 1^n = C_1 + C_2 n

D1=2D_1 = 2D2=2112=3D_2 = \begin{vmatrix} 2 & 1 \\ 1 & 2 \end{vmatrix} = 3,得 C1+C2=2C_1 + C_2 = 2C1+2C2=3C_1 + 2C_2 = 3,解得 C1=C2=1C_1 = C_2 = 1

Dn=n+1D_n = n + 1

例4

计算 Dn=abbbbabbbbabbbbaD_n = \begin{vmatrix} a & b & b & \cdots & b \\ b & a & b & \cdots & b \\ b & b & a & \cdots & b \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ b & b & b & \cdots & a \end{vmatrix}

:各行加到第一行,提取公因子 a+(n1)ba + (n-1)b

Dn=[a+(n1)b]1111babbbbabbbbaD_n = [a + (n-1)b] \begin{vmatrix} 1 & 1 & 1 & \cdots & 1 \\ b & a & b & \cdots & b \\ b & b & a & \cdots & b \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ b & b & b & \cdots & a \end{vmatrix}

各行减第一行的 bb 倍:

=[a+(n1)b]11110ab0000ab0000ab= [a + (n-1)b] \begin{vmatrix} 1 & 1 & 1 & \cdots & 1 \\ 0 & a-b & 0 & \cdots & 0 \\ 0 & 0 & a-b & \cdots & 0 \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & 0 & \cdots & a-b \end{vmatrix}

=[a+(n1)b](ab)n1= [a + (n-1)b](a-b)^{n-1}

3. 加边法

例5

计算 Dn=1+a11111+a21111+anD_n = \begin{vmatrix} 1+a_1 & 1 & \cdots & 1 \\ 1 & 1+a_2 & \cdots & 1 \\ \vdots & \vdots & \ddots & \vdots \\ 1 & 1 & \cdots & 1+a_n \end{vmatrix}ai0a_i \neq 0

:加边升阶:

Dn=111101+a111011+a210111+anD_n = \begin{vmatrix} 1 & 1 & 1 & \cdots & 1 \\ 0 & 1+a_1 & 1 & \cdots & 1 \\ 0 & 1 & 1+a_2 & \cdots & 1 \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ 0 & 1 & 1 & \cdots & 1+a_n \end{vmatrix}

第一行乘 (1)(-1) 加到各行:

=11111a10010a20100an= \begin{vmatrix} 1 & 1 & 1 & \cdots & 1 \\ -1 & a_1 & 0 & \cdots & 0 \\ -1 & 0 & a_2 & \cdots & 0 \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ -1 & 0 & 0 & \cdots & a_n \end{vmatrix}

j+1j+1 列乘 1aj\dfrac{1}{a_j} 加到第一列(j=1,2,,nj = 1, 2, \ldots, n):

=1+j=1n1aj1110a10000a20000an=(1+j=1n1aj)i=1nai= \begin{vmatrix} 1 + \sum_{j=1}^{n}\frac{1}{a_j} & 1 & 1 & \cdots & 1 \\ 0 & a_1 & 0 & \cdots & 0 \\ 0 & 0 & a_2 & \cdots & 0 \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & 0 & \cdots & a_n \end{vmatrix} = \left(1 + \sum_{j=1}^{n}\frac{1}{a_j}\right) \prod_{i=1}^{n} a_i

4. 拆行(列)法

例6

计算 1+abcb1+bcab1+c\begin{vmatrix} 1+a & b & c \\ b & 1+b & c \\ a & b & 1+c \end{vmatrix}

:将第一列拆为 (1,0,0)T+(a,b,a)T(1,0,0)^T + (a,b,a)^T

D=1bc01+bc0b1+c+abcb1+bcab1+cD = \begin{vmatrix} 1 & b & c \\ 0 & 1+b & c \\ 0 & b & 1+c \end{vmatrix} + \begin{vmatrix} a & b & c \\ b & 1+b & c \\ a & b & 1+c \end{vmatrix}

=[(1+b)(1+c)bc]+a1bc010001=(1+b+c)+a=1+a+b+c= [(1+b)(1+c) - bc] + a\begin{vmatrix} 1 & b & c \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{vmatrix} = (1+b+c) + a = 1 + a + b + c

5. 抽象行列式

例7

AA 为三阶方阵,A=12|A| = \dfrac{1}{2},求 (3A)12A|(3A)^{-1} - 2A^*|

A=AA1=12A1A^* = |A|A^{-1} = \dfrac{1}{2}A^{-1}

(3A)1=13A1(3A)^{-1} = \dfrac{1}{3}A^{-1}

(3A)12A=13A1212A1=13A1A1=23A1(3A)^{-1} - 2A^* = \frac{1}{3}A^{-1} - 2 \cdot \frac{1}{2}A^{-1} = \frac{1}{3}A^{-1} - A^{-1} = -\frac{2}{3}A^{-1}

(3A)12A=23A1=(23)3A1=8271A=8272=1627|(3A)^{-1} - 2A^*| = \left|-\frac{2}{3}A^{-1}\right| = \left(-\frac{2}{3}\right)^3 |A^{-1}| = -\frac{8}{27} \cdot \frac{1}{|A|} = -\frac{8}{27} \cdot 2 = -\frac{16}{27}

例8

A,BA, B 均为 nn 阶方阵,A=2|A| = 2B=3|B| = -3,求 2AB1A2|2AB^{-1}A^2|

2AB1A2=2nAB1A2=2n2134=2n+33|2AB^{-1}A^2| = 2^n |A| \cdot |B^{-1}| \cdot |A|^2 = 2^n \cdot 2 \cdot \frac{1}{-3} \cdot 4 = -\frac{2^{n+3}}{3}

例9

α1,α2,α3\boldsymbol{\alpha}_1, \boldsymbol{\alpha}_2, \boldsymbol{\alpha}_3 为三维列向量,A=α1,α2,α3=2|A| = |\boldsymbol{\alpha}_1, \boldsymbol{\alpha}_2, \boldsymbol{\alpha}_3| = 2,求 α1+α2,α2+α3,α3+α1|\boldsymbol{\alpha}_1 + \boldsymbol{\alpha}_2, \boldsymbol{\alpha}_2 + \boldsymbol{\alpha}_3, \boldsymbol{\alpha}_3 + \boldsymbol{\alpha}_1|

(α1+α2α2+α3α3+α1)=(α1α2α3)(101110011)\begin{pmatrix} \boldsymbol{\alpha}_1 + \boldsymbol{\alpha}_2 & \boldsymbol{\alpha}_2 + \boldsymbol{\alpha}_3 & \boldsymbol{\alpha}_3 + \boldsymbol{\alpha}_1 \end{pmatrix} = \begin{pmatrix} \boldsymbol{\alpha}_1 & \boldsymbol{\alpha}_2 & \boldsymbol{\alpha}_3 \end{pmatrix} \begin{pmatrix} 1 & 0 & 1 \\ 1 & 1 & 0 \\ 0 & 1 & 1 \end{pmatrix}

101110011=1+1=2\begin{vmatrix} 1 & 0 & 1 \\ 1 & 1 & 0 \\ 0 & 1 & 1 \end{vmatrix} = 1 + 1 = 2

α1+α2,α2+α3,α3+α1=A2=2×2=4|\boldsymbol{\alpha}_1 + \boldsymbol{\alpha}_2, \boldsymbol{\alpha}_2 + \boldsymbol{\alpha}_3, \boldsymbol{\alpha}_3 + \boldsymbol{\alpha}_1| = |A| \cdot 2 = 2 \times 2 = 4

6. 证明题

例10

证明:奇数阶反对称行列式为零。

证明:设 AAnn 阶反对称矩阵(nn 为奇数),则 AT=AA^T = -A

A=AT=A=(1)nA=A|A| = |A^T| = |-A| = (-1)^n |A| = -|A|

2A=02|A| = 0,即 A=0|A| = 0

例11

AAnn 阶正交矩阵(ATA=IA^TA = I),证明 A=±1|A| = \pm 1

证明ATA=I=1|A^TA| = |I| = 1,又 ATA=ATA=A2|A^TA| = |A^T| \cdot |A| = |A|^2,故 A2=1|A|^2 = 1A=±1|A| = \pm 1

例12

AAnn 阶实矩阵,AAT=IAA^T = IA<0|A| < 0,证明 A+I=0|A + I| = 0

证明

A+I=A+AAT=A(I+AT)=AI+AT|A + I| = |A + AA^T| = |A(I + A^T)| = |A| \cdot |I + A^T|

I+AT=(I+A)T=I+A=A+I|I + A^T| = |(I + A)^T| = |I + A| = |A + I|,故:

A+I=AA+I|A + I| = |A| \cdot |A + I|

因为 A<01|A| < 0 \neq 1,所以 A+I=0|A + I| = 0

7. 代数余子式相关

例13

D=3112513420111533D = \begin{vmatrix} 3 & 1 & -1 & 2 \\ -5 & 1 & 3 & -4 \\ 2 & 0 & 1 & -1 \\ 1 & -5 & 3 & -3 \end{vmatrix},求 A31+A32+A33+A34A_{31} + A_{32} + A_{33} + A_{34}

A31+A32+A33+A34A_{31} + A_{32} + A_{33} + A_{34} 相当于将第三行替换为 (1,1,1,1)(1,1,1,1) 后的行列式:

3112513411111533\begin{vmatrix} 3 & 1 & -1 & 2 \\ -5 & 1 & 3 & -4 \\ 1 & 1 & 1 & 1 \\ 1 & -5 & 3 & -3 \end{vmatrix}

按第三行展开,计算得 A31+A32+A33+A34=24A_{31} + A_{32} + A_{33} + A_{34} = 24

例14

设三阶行列式 D=123456789D = \begin{vmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9 \end{vmatrix},求 M12+M22+M32M_{12} + M_{22} + M_{32}

M12=A12M_{12} = -A_{12}M22=A22M_{22} = A_{22}M32=A32M_{32} = -A_{32}

M12+M22+M32=A12+A22A32M_{12} + M_{22} + M_{32} = -A_{12} + A_{22} - A_{32}

这等于将第二列替换为 (0,1,0)T(0, -1, 0)^T 后的行列式取负:

=103416709=[(1)(921)]=12= -\begin{vmatrix} 1 & 0 & 3 \\ 4 & -1 & 6 \\ 7 & 0 & 9 \end{vmatrix} = -[(-1)(9-21)] = -12

例15

AAnn 阶方阵,A=a0|A| = a \neq 0,求 A|A^*|

:由 AA=AIA^*A = |A|I,两边取行列式:

AA=An|A^*| \cdot |A| = |A|^n

A=An1=an1|A^*| = |A|^{n-1} = a^{n-1}