Determining the Consistency of Linear Systems | 线性方程组相容性的判定方法

📚 Determining the Consistency of Linear Systems | 线性方程组相容性的判定方法

In linear algebra, a system of linear equations is said to be consistent if it possesses at least one solution, and inconsistent if it has no solution. Understanding how to determine consistency is foundational—it tells us whether a mathematical model can be solved at all, and if so, whether the solution is a unique point or an entire family of solutions.

在线性代数中，若线性方程组至少存在一个解，则称其为 相容 的；若没有任何解，则称其为 不相容 的。掌握相容性的判定方法至关重要——它决定了数学模型是否有解，以及解是唯一确定的点，还是无数个解所构成的一个集合。

1. Matrix Representation of Linear Systems | 线性方程组的矩阵表示

Any system can be compactly written as the matrix equation Ax = b, where A is the coefficient matrix, x is the column vector of variables, and b is the column vector of constants. The augmented matrix (A|b) combines A and b and serves as the primary tool for consistency tests.

任何线性方程组都可以简洁地写作矩阵方程 Ax = b，其中 A 是系数矩阵，x 是变量构成的列向量，b 是常数项构成的列向量。将 A 与 b 合并得到 增广矩阵 (A|b)，这是进行相容性判定的核心工具。

2. Visualising Consistency: Geometry of Lines and Planes | 直观理解：直线与平面的几何含义

For two variables, each equation represents a line. Consistent systems correspond to intersecting or coincident lines; inconsistent systems correspond to distinct parallel lines. For three variables, each equation represents a plane. A system is consistent when the planes intersect at a point, along a line, or coincide entirely. It is inconsistent when the planes are parallel but distinct.

对于两个变量，每个方程代表一条直线。若直线相交或重合，则方程组相容；若直线平行但不重合，则方程组不相容。对于三个变量，每个方程代表一个平面。若平面相交于一点、沿一条直线相交，或完全重合，则方程组相容；若平面相互平行但不重合，则方程组不相容。

3. Method 1: Determinants and Cramer’s Rule | 方法一：行列式与克拉默法则

For a square system (n equations, n unknowns) where the determinant of A is non-zero, the system has a unique solution, hence it is definitely consistent. Specifically, Cramer’s rule states:

对于 n 个方程、n 个未知数的方阵系统，若 A 的行列式不为零，则系统存在唯一解，因此必定相容。具体而言，克拉默法则给出：

xᵢ = det(Aᵢ) / det(A)

where Aᵢ is the matrix formed by replacing the i-th column of A with the constant vector b. If det(A) = 0, Cramer’s rule fails, and the system is either inconsistent or has infinitely many solutions—further analysis with rank is required.

其中 Aᵢ 是将 A 的第 i 列替换为常数向量 b 后得到的矩阵。若 det(A) = 0，则克拉默法则失效，此时方程组要么不相容，要么有无穷多解——需要通过秩进行进一步分析。

4. Method 2: Gaussian Elimination (Row Echelon Form) | 方法二：高斯消元法（行阶梯形）

This is the most robust algorithm for any linear system. Transform the augmented matrix into row echelon form using elementary row operations. If an impossible equation appears, such as a row of the form [0, 0, …, 0 | c] where c ≠ 0, the system is inconsistent. Otherwise, it is consistent.

这是适用于任何线性方程组的最稳健算法。通过初等行变换将增广矩阵化为行阶梯形。如果出现不可能成立的方程，例如形如 [0, 0, …, 0 | c] 且 c ≠ 0 的行，则方程组不相容。否则，方程组相容。

If the system is consistent, the number of pivots determines the solution structure. If every column of the coefficient matrix has a pivot, the solution is unique. If there are columns without pivots, the system has infinitely many solutions.

若方程组相容，主元的数量决定了解的结构。若系数矩阵的每一列都有主元，则解是唯一的；若存在没有主元的列，则方程组有无穷多解。

5. Method 3: The Rank Theorem (Rouché–Capelli) | 方法三：秩定理（Rouché–Capelli 定理）

The Rouché–Capelli theorem provides the definitive algebraic condition for consistency. Let rank(A) denote the rank of the coefficient matrix and rank(A|b) denote the rank of the augmented matrix. The system is consistent if and only if these two ranks are equal.

Rouché–Capelli 定理为相容性提供了严格的代数判定条件。设 rank(A) 为

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

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