2. Elementary Row Operations | 2. 初等行变换

📚 2. Elementary Row Operations | 2. 初等行变换

ese three simple yet powerful moves: swapping rows, scaling rows, and adding multiples of one row to another. They preserve the solution set of a linear system while transforming the associated augmented matrix into row echelon form or reduced row echelon form. Mastering these operations allows you to tackle everything from 2 × 2 systems to large-scale problems with confidence and precision.

初等行变换是求解线性方程组和进行矩阵操作的基石。在 IB 数学中，尤其是在分析数学（AA）或应用与解释（AI）的高阶线性代数部分，你会遇到这三种看似简单却威力强大的操作：交换两行、用一个非零常数乘以某一行、以及把一行的倍数加到另一行上。这些操作保持线性方程组的解集不变，同时把对应的增广矩阵转化为行阶梯形或简化行阶梯形。熟练掌握这些变换，你就能自信而精确地应对从 2×2 方程组到更大规模的问题。

---

1. What Are Elementary Row Operations? | 什么是初等行变换？

An elementary row operation is any one of three allowed moves on the rows of a matrix that does not change the solution of the associated linear system. You can (i) interchange two rows, (ii) multiply a row by a non-zero scalar, or (iii) add a scalar multiple of one row to another row. The symbols R_i ↔ R_j, R_i → kR_i (k ≠ 0) and R_i → R_i + kR_j are commonly used to record these steps. In IB examinations, you are expected to write the operation beside the matrix at each stage, showing a clear, logical sequence.

初等行变换是指对矩阵的行进行的三种允许操作，它们不改变对应线性方程组的解。这三类操作是：(i) 交换两行，(ii) 用一个非零常数乘以某一行，(iii) 把一行的标量倍数加到另一行上。通常用符号 R_i ↔ R_j、R_i → kR_i (k ≠ 0) 和 R_i → R_i + kR_j 来记录这些步骤。在 IB 考试中，你需要在每一阶段的矩阵旁边写出操作，展示清晰、有逻辑的序列。

---

2. Type 1: Row Switching | 第1类：交换两行

Swapping two rows, denoted R_i ↔ R_j, is the simplest operation. It is often used to bring a non-zero pivot into the pivot position or to rearrange the matrix for easier elimination. For example, if the first row begins with a zero, swapping it with a row that has a non-zero leading coefficient is the first step before forward elimination. This operation is plainly reversible and leaves the determinant of the matrix multiplied by −1 if the matrix is square, which is an important conceptual link to later topics.

交换两行，记作 R_i ↔ R_j，是最简单的操作。它经常用于把一个非零主元带到主元位置，或者重新排列矩阵以便后续消元。例如，如果第一行以零开头，在向前消元之前，先把它和一个首元非零的行交换是第一步。这一操作显然是可逆的，而且当矩阵为方阵时，行列式会乘以 −1，这是与后续主题的一个重要概念联系。

---

3. Type 2: Row Scaling | 第2类：行倍乘

Row scaling means multiplying every entry in a row by a non-zero constant k, written R_i → kR_i. This operation is mainly used to create a leading 1 in a pivot column. For instance, if a row starts with 3, you can multiply the entire row by 1/3 to turn the pivot into 1. Care must be taken: k must not be zero, otherwise information is lost. In the context of solving equations, scaling a row corresponds to multiplying both sides of an equation by a non-zero number, which clearly preserves equality.

行倍乘是指用一个非零常数 k 乘以某一行中的每一个元素，写作 R_i → kR_i。这一操作主要用于在主元列中产生首项 1。例如，如果某行以 3 开头，你可以将整行乘以 1/3，使主元变成 1。必须注意：k 不能为零，否则信息会丢失。在解方程的语境中，倍乘一行相当于把方程两边同乘以一个非零数，这显然保持了等式的平衡。

---

4. Type 3: Row Addition | 第3类：行倍加

The row addition operation R_i → R_i + kR_j adds a scalar multiple of row j to row i. This is the workhorse of Gaussian elimination, because it allows you to create zeros below (or above) a pivot. The operation can be thought of as adding two equations together after suitable scaling, which again does not alter the solution set. In matrix terms, it is equivalent to left-multiplying by an elementary matrix that differs from the identity only by the value k in the (i, j) position.

行倍加操作 R_i → R_i + kR_j 是将第 j 行的标量倍数加到第 i 行。这是高斯消元法的核心，因为它能让你在主元下方（或上方）产生零元素。可以把这个操作看作是在适当倍乘后将两个方程相加，同样不改变解集。在矩阵理论中，它等价于左乘一个初等矩阵，该矩阵仅在 (i, j) 位置处与单位矩阵相差一个数值 k。

---

5. Elementary Matrices | 初等矩阵

Each elementary row operation can be achieved by left-multiplying the matrix by a special square matrix called an elementary matrix. For row switching R_i ↔ R_j, the elementary matrix E is the identity matrix with rows i and j swapped. For row scaling R_i → kR_i, E is the identity with the (i,i) entry replaced by k. For row addition R_i → R_i + kR_j row operations corresponds to multiplying by an invertible matrix P, so that PA = RREF(A).

每一个初等行变换都可以通过将矩阵左乘一个特殊的方阵来实现，这个方阵称为初等矩阵。对于交换两行 R_i ↔ R_j，初等矩阵 E 是将单位矩阵的第 i 行与第 j 行交换。对于行倍乘 R_i → kR_i，E 是将单位矩阵的 (i,i) 元素替换为 k。对于行倍加 R_i → R_i + kR_j，E 的 (i,j) 元素等于 k。因为这些初等矩阵都是可逆的，整个行变换序列相当于左乘一个可逆矩阵 P，使得 PA = RREF(A)。

---

6. Row Echelon Form (REF) | 行阶梯形矩阵

A matrix is in row echelon form (REF) if (1) all non-zero rows are above any rows of all zeros; (2) the leading coefficient (the first non-zero entry from the left) of a non-zero row is always strictly to the right of the leading coefficient of the row above it; (3) all entries in a column below a leading coefficient are zero. This 'staircase' structure is the target of forward elimination. It is sufficient for solving systems via back substitution, and IB marks are often awarded for correctly displaying REF and annotating the row operations that lead to it.

一个矩阵如果满足以下条件，则称其为行阶梯形矩阵（REF）：(1) 所有非零行都在全零行的上方；(2) 非零行的首项系数（左边第一个非零元素）总是严格位于上一行首项系数的右侧；(3) 首项系数所在列的下方所有元素均为零。这种“阶梯”结构是向前消元的目标。通过回代就可以求解方程组，这种形式已足够。IB 给分时，常因正确展示阶梯形并标注所进行的行操作而得分。

---

7. Reduced Row Echelon Form (RREF) | 简化行阶梯形矩阵

Taking REF one step further, a matrix is in reduced row echelon form (RREF) if it additionally satisfies: (4) the leading coefficient in each non-zero row is 1; (5) each leading 1 is the only non-zero entry in its column. RREF is unique for every matrix, regardless of the sequence of row operations used. This makes it the fingerprint of the linear system, directly showing the solution or revealing inconsistency. IB tasks may ask you to go all the way to RREF, especially when dealing with matrix inverses or checking consistency.

在行阶梯形（REF）的基础上，如果矩阵额外满足：(4) 每个非零行的首项系数为 1；(5) 每个首项 1 所在列的其他元素均为零，则称其为简化行阶梯形矩阵（RREF）。对于任何一个矩阵，无论以何种顺序进行行变换，RREF 都是唯一的。这使它成为线性方程组的特征指纹，能够直接显示解或暴露出矛盾。IB 的任务可能要求你一直化简到 RREF，特别是在处理矩阵的逆或检查一致性时。

---

8. Gaussian Elimination | 高斯消元法

Gaussian elimination systematically applies elementary row operations to transform an augmented matrix into row echelon form. The algorithm proceeds column by column: find the leftmost column that is not all zeros, bring a non-zero entry to the pivot position (often by row swap), then use row addition to create zeros below that pivot. Move to the next column and repeat. Once REF is obtained, back substitution yields the values of the variables. Mastering the order of operations and the notation R_i → … is essential for obtaining full marks on IB proof-style questions.

高斯消元法系统地应用初等行变换，将增广矩阵转化为行阶梯形。算法按列进行：找到最左侧的非全零列，将一个非零元素带到主元位置（常通过行交换），然后利用行倍加在该主元下方产生零。移到下一列并重复。一旦得到 REF，通过回代即可求出各个变量的值。掌握变换的顺序和记法 R_i → … 对于在 IB 证明类题目中拿到满分至关重要。

---

广告 / Sponsored

9. Gauss-Jordan Elimination | 高斯-约当消元法

Gauss-Jordan elimination continues the process beyond REF to reach RREF directly, without back substitution. After achieving REF, you use row addition upwards to clear the entries above each leading 1. This method is particularly useful for finding the inverse of a matrix: augment the matrix with the identity matrix and apply row operations until the left half becomes I; the right half will then be A⁻¹. IB candidates often prefer Gauss-Jordan for multi-purpose tasks, as it gives a complete, ready-to-read solution set.

高斯-约当消元法在 REF 之后继续化简，直接得到 RREF，无需回代。在得到 REF 后，你接着向上进行行倍加，清除每个首项 1 上方的元素。该方法在求逆矩阵时特别有用：将矩阵与单位矩阵横向合并为增广矩阵，进行行变换直到左半部分变为 I，此时右半部分就是 A⁻¹。IB 考生常在多种任务中偏爱高斯-约当法，因为它给出完整、一目了然的解集。

---

10. Worked Example: Solving a System | 例题：求解方程组

Let' ystem: x + 2y + z = 4, 2x + 5y + 3z = 9, −x + y − z = −2. Start with the augmented matrix:

求解方程组：x + 2y + z = 4, 2x + 5y + 3z = 9, −x + y − z = −2。首先写出增广矩阵：

1	2	1	4
2	5	3	9
-1	1	-1	-2

Apply R₂ → R₂ − 2R₁ and R₃ → R₃ + R₁:

进行 R₂ → R₂ − 2R₁ 和 R₃ → R₃ + R₁：

1	2	1	4
0	1	1	1
0	3	0	2

Then R₃ → R₃ − 3R₂:

接着 R₃ → R₃ − 3R₂：

1	2	1	4
0	1	1	1
0	0	-3	-1

Now back substitute (or continue to RREF): R₃ → −⅓R₃ gives z = 1/3. Then R₂ → R₂ − R₃ gives y = 2/3, and finally R₁ → R₁ − 2R₂ − R₃ , 2/3, 1/3). Each row operation was chosen to systematically eliminate variables while preserving equivalence.

现在回代（或继续到 RREF）：R₃ → −⅓R₃ 得 z = 1/3。然后 R₂ → R₂ − R₃ 得 y = 2/3，最后 R₁ → R₁ − 2R₂ − R₃ 得 x = 2。唯一解为 (2, 2/3, 1/3)。每一步行变换都是为了系统地消去变量，同时保持等价的方程组。

---

11. Common Errors and How to Avoid Them | 常见错误及避免方法

• Avoid multiplying a row by zero. This destroys the equation and cannot be reversed in the context of the linear system. Always check that k ≠ 0.

  避免将一行乘以零。这会破坏方程，并且在方程组的语境下无法逆转。每次务必检查 k ≠ 0。

• Do not forget to apply the operation to the entire row, including the augment column. Many marks are lost when a student changes the coefficient matrix but leaves the constant column untouched.

  不要忘记将操作应用于整行，包括增广列。许多学生因只改变系数矩阵而没动常数项列而丢分。

• When adding a multiple of another row, ensure you only modify the target row R_i, not the multiplied row R_j. R_j must remain unchanged unless explicitly subjected to its own operation.

  在加上另一行的倍数时，确保只修改目标行 R_i，而不改变被乘的行 R_j。除非对其执行独立操作，否则 R_j 必须保持不变。

• Write row operation labels clearly. IB examiners expect a step-by-step record such as R₂ − 2R₁ on the side. This demonstrates your logical process and can earn method marks even if a minor arithmetic slip occurs.

  清楚地写出操作标签。IB 考官期望在旁边逐步记录，例如 R₂ − 2R₁。这能够展示你的逻辑过程，即使出现小的计算失误仍可获得方法分数。

---

12. Summary and Practice Tips | 总结与练习提示

ing operation symbol; avoid skipping steps mentally. Use non-zero scalars carefully and always verify that the new rows satisfy the original equations. A solid command of these operations not only speeds up your work but also deepens your understanding of linear dependence, rank, and the invertible matrix theorem. With consistent drill, you will find that even 4×4 systems become manageable puzzles rather than overwhelming chores.

初等行变换是你在 IB 大纲中处理任何矩阵相关问题的基本工具包。三种变换——交换、倍乘、倍加——组合起来可以进行高斯消元、高斯-约当消元以及求逆矩阵。练习时每一步都写出操作符号，避免在脑中跳步。谨慎使用非零常数，并始终检查新行是否满足原始方程。牢固掌握这些操作不仅能提升速度，还能加深你对线性相关、秩以及可逆矩阵定理的理解。通过持续训练，你会发现即便是 4×4 的方程组也会变成可以驾驭的谜题，而不是令人头疼的苦差事。

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

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