Understanding Determinants: Calculation and Geometric Meaning | 方阵行列式的计算与几何意义

📚 Understanding Determinants: Calculation and Geometric Meaning | 方阵行列式的计算与几何意义

Determinants are among the most fundamental objects in linear algebra. For every square matrix, the determinant is a single scalar value that encodes vital information about the matrix: whether the matrix is invertible, how it scales area or volume, and whether the associated linear transformation preserves or reverses orientation. In this article, we explore how to calculate determinants for square matrices and then investigate their deep geometric meaning.

行列式是线性代数中最基本的概念之一。对于每一个方阵，行列式都是一个单独的标量值，它蕴含着矩阵的关键信息：矩阵是否可逆、如何缩放面积或体积、以及相应的线性变换是否保持方向。本文将讲解方阵行列式的计算方法，并深入探讨其几何意义。

---

1. What is a Determinant? | 什么是行列式？

A determinant is a scalar value assigned to every square matrix. It is often written as det(A) or |A|. Only square matrices have determinants; rectangular matrices do not. In the simplest case, a 1×1 matrix contains a single entry, and its determinant is just that entry itself.

行列式是赋予每个方阵的一个标量值，常用 det(A) 或 |A| 表示。只有方阵才有行列式，长方形矩阵没有行列式。最简单的情况是 1×1 矩阵，它只有一个元素，其行列式就是这个元素本身。

det([a]) = a

The determinant is not merely a computational tool; it is a deep algebraic object. It can be interpreted as an oriented volume, a measure of singularity, and a central component of eigenvalue problems. For an n×n matrix, the determinant can be defined recursively using minors and cofactors, but a clear understanding begins with small cases.

行列式不仅是计算工具，更是一个深刻的代数对象。它可以被解释为带方向的体积、矩阵奇异性的度量，以及特征值问题的核心组成部分。对于 n×n 矩阵，行列式可以通过子式和代数余子式递归定义，但清晰的理解要从低阶情况开始。

---

2. Determinants of 2×2 and 3×3 Matrices | 二阶与三阶行列式的计算

For a 2×2 matrix, the determinant is easy to remember: multiply the entries on the main diagonal and subtract the product of the entries on the other diagonal.

对于 2×2 矩阵，行列式的计算很容易记住：用主对角线上的两个元素相乘，再减去另一条对角线上两个元素相乘的结果。

A = ( a b ; c d ) ⇒ det(A) = ad − bc

For example, if A = ( 2 3 ; 1 4 ), then det(A) = 2 × 4 − 3 × 1 = 8 − 3 = 5. This number is positive, meaning the transformation associated with A preserves orientation and scales area by a factor of 5.

例如，若 A = ( 2 3 ; 1 4 )，则 det(A) = 2 × 4 − 3 × 1 = 8 − 3 = 5。这个数为正，意味着 A 对应的变换保持方向，并将面积放大 5 倍。

For a 3×3 matrix, the formula can be written using the entries of the first row. Let A be the matrix with entries a, b, c in the first row; d, e, f in the second row; and g, h, i in the third row.

对于 3×3 矩阵，可以利用第一行元素写出计算公式。设矩阵 A 的第一行为 a, b, c，第二行为 d, e, f，第三行为 g, h, i。

det(A) = a(ei − fh) − b(di − fg) + c(dh − eg)

This pattern can be memorized as “expand along the first row”: each entry a, b, c is multiplied by the determinant of the 2×2 matrix left after deleting its row and column, with alternating signs. Although this formula is useful by hand, it becomes impractical for larger matrices.

这个模式可以记忆为“沿第一行展开”：每个元素 a, b, c 乘以删去其所在行和列后得到的 2×2 矩阵的行列式，并交替加减符号。尽管这个公式在手算时很有用，但对于更大的矩阵会变得不实用。

---

3. Cofactor Expansion (Laplace Expansion) | 余子式展开（拉普拉斯展开）

For an n×n matrix, the determinant can be computed by cofactor expansion along any row or column. This method is known as Laplace expansion. First, the minor Mᵢⱼ of entry aᵢⱼ is defined as the determinant of the submatrix obtained by deleting row i and column j.

对于 n×n 矩阵，行列式可以沿任意一行或任意一列进行余子式展开，这就是拉普拉斯展开。首先，元素 aᵢⱼ 的余子式 Mᵢⱼ定义为删去第 i 行和第 j 列后所得子矩阵的行列式。

Cᵢⱼ = (−1)ⁱ⁺ʲ Mᵢⱼ

The cofactor Cᵢⱼ is the minor together with a sign factor that depends on the position (i, j). If i + j is even, the sign is positive; if i + j is odd, the sign is negative. This produces a checkerboard pattern of signs.

代数余子式 Cᵢⱼ是余子式 Mᵢⱼ 加上一个由位置 (i, j) 决定的符号：若 i + j 为偶数，符号为正；若 i + j 为奇数，符号为负。由此形成棋盘式的符号图案。

+	−	+
−	+	−
+	−	+

Then, for any fixed row i, the determinant is the sum over all columns j of aᵢⱼ Cᵢⱼ. Similarly, for any fixed column j, the determinant is the sum over all rows i of aᵢⱼ Cᵢⱼ.

于是，对任意固定的行 i，行列式等于对所有列 j 求和 aᵢⱼ Cᵢⱼ。类似地，对任意固定的列 j，行列式等于对所有行 i 求和 aᵢⱼ Cᵢⱼ。

det(A) = Σⱼ₌₁ⁿ aᵢⱼ Cᵢⱼ (固定行 i)

det(A) = Σᵢ₌₁ⁿ aᵢⱼ Cᵢⱼ (固定列 j)

For example, consider A = ( 1 2 3 ; 0 1 4 ; 2 3 7 ). Expanding along the first row gives det(A) = 1×(1×7 − 4×3) − 2×(0×7 − 4×2) + 3×(0×3 − 1×2) = −5 + 16 − 6 = 5. This recursive method is theoretically elegant, but its computational cost grows extremely quickly for large n.

例如，考虑 A = ( 1 2 3 ; 0 1 4 ; 2 3 7 )。沿第一行展开得 det(A) = 1×(1×7 − 4×3) − 2×(0×7 − 4×2) + 3×(0×3 − 1×2) = −5 + 16 − 6 = 5。这种递归方法在理论上非常优美，但当 n 增大时，其计算量会急剧增长。

---

4. Properties of Determinants | 行列式的性质

Several useful properties make determinant calculation simpler and provide deep insight into matrix algebra. These properties hold for all square matrices of the same size.

行列式的一些重要性质不仅简化了计算，也提供了对矩阵代数的深刻认识。以下性质对所有同阶方阵都成立。

• The determinant of a matrix equals the determinant of its transpose: det(Aᵀ) = det(A).

  矩阵的行列式等于其转置矩阵的行列式：det(Aᵀ) = det(A)。

• If two rows (or two columns) are interchanged, the determinant changes sign.

  交换两行（或两列），行列式改变符号。

• If a row is multiplied by a constant k, the determinant is also multiplied by k.

  若某一行乘以常数 k，则行列式也乘以 k。

• Adding a multiple of one row to another row does not change the determinant.

  把某一行加上另一行的倍数，行列式不变。

• If a matrix has two identical rows or columns, its determinant is zero.

  若矩阵有两行或两列完全相同，则行列式为零。

• The determinant of a triangular matrix equals the product of its diagonal entries.

  三角矩阵的行列式等于其对角线元素之积。

• The determinant of a product is the product of the determinants: det(AB) = det(A)det(B).

  乘积的行列式等于行列式的乘积：det(AB) = det(A)det(B)。

• If A is invertible, then det(A⁻¹) = 1 / det(A).

  若 A 可逆，则 det(A⁻¹) = 1 / det(A)。

Another important consequence is that det(cA) = cⁿ det(A) for an n×n matrix A, because multiplying the whole matrix by c multiplies every row by c. These properties allow us to compute determinants efficiently without performing full cofactor expansions.

另一个重要结论是：对于 n×n 矩阵 A，det(cA) = cⁿ det(A)，因为整个矩阵乘以 c 相当于每一行都乘以 c。利用这些性质，我们可以在不进行完整余子式展开的情况下高效地计算行列式。

---

5. Row Reduction Methods | 行化简法计算行列式

The most practical method for computing determinants of large matrices is row reduction. By applying elementary row operations, we convert the matrix into an upper triangular form, and then the determinant is simply the product of the diagonal entries. We must carefully track how each row operation affects the determinant.

计算大型矩阵行列式最实用的方法是行化简。通过初等行变换，我们将矩阵化为上三角形，然后行列式就等于对角线元素之积。在此过程中，需要仔细记录每个初等行变换对行列式的影响。

• Row swap: multiplies the determinant by −1.

  交换两行：行列式乘以 −1。

• Row scaling: multiplies the determinant by the same scaling factor.

  某行乘以倍数：行列式也乘以同样的倍数。

• Row addition: no effect on the determinant.

  某行加上另一行的倍数：行列式不变。

Consider the matrix A = ( 1 2 3 ; 0 1 4 ; 2 3 7 ). First, apply R₃ ← R₃ − 2R₁ to eliminate the first entry of the third row. The matrix becomes ( 1 2 3 ; 0 1 4 ; 0 −1 1 ). Next, apply R₃ ← R₃ + R₂ to eliminate the second entry of the third row. The matrix becomes ( 1 2 3 ; 0 1 4 ; 0 0 5 ).

考虑矩阵 A = ( 1 2 3 ; 0 1 4 ; 2 3

Published by TutorHao | IB Mathematics Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）