Row Operations | 行变换

📚 Row Operations | 行变换

Row operations are fundamental tools in linear algebra and matrix theory. In A-Level AQA mathematics, they appear primarily in the context of solving systems of simultaneous linear equations and finding inverse matrices. This article explains the three elementary row operations, their notation, and how to apply them systematically to achieve both row echelon and reduced row echelon forms.

行变换是线性代数和矩阵理论中的基本工具。在 AQA A-Level 数学中，它们主要用于求解线性方程组以及求逆矩阵。本文将解释三种基本行操作、它们的记号，以及如何系统地应用它们得到行阶梯形和行最简形。

1. What Are Row Operations? | 什么是行操作？

A matrix can be transformed into a simpler form by applying operations to its rows. These operations are called elementary row operations. Crucially, when applied to the augmented matrix of a linear system, they do not change the solution set. This means the system represented by the new matrix has exactly the same solutions as the original system.

矩阵可以通过对其行进行变换而简化为更简单的形式，这些变换称为基本行操作。重要的是，将其应用于线性方程组的增广矩阵时，方程组的解集不会改变。也就是说，新矩阵所表示的方程组与原方程组有完全相同的解。

For example, the system

x + y = 3
2x − y = 3

can be written as an augmented matrix. Applying a row operation like “replace the second row by itself minus two times the first row” gives a triangular system that is trivial to solve, while preserving the same values of x and y.

例如，方程组 x + y = 3
2x − y = 3 可以写成增广矩阵。应用诸如“将第二行替换为自身减去第一行的两倍”这样的行操作，可以得到一个容易求解的三角形方程组，同时保持 x 和 y 的解不变。

2. The Three Elementary Row Operations | 三种基本行操作

There are exactly three types of elementary row operations. Each one is reversible, making it possible to undo any sequence of operations.

基本行操作恰好有三种类型，而且每种操作都是可逆的，因此任何操作序列都可以被撤销。

Operation	Description	中文描述
Row swap	Interchange two rows. For example, R1 ↔ R2.	交换两行。例如 R1 ↔ R2。
Row scaling	Multiply all entries of a row by a non‑zero constant k. For example, kR2 → R2.	将某一行的所有元素乘以非零常数 k。例如 kR2 → R2。
Row replacement	Add a multiple of one row to another row, leaving the first row unchanged. For example, R3 → R3 + λR1.	将某一行加上另一行的倍数，并保持原行不变。例如 R3 → R3 + λR1。

These three operations generate every possible elementary row transformation. In practice, row replacement is used most often because it allows us to create zeros in convenient positions without altering the determinant (except for the row being changed).

这三种操作能够生成一切基本行变换。在实际应用中，行加合法使用最频繁，因为它能在不改变行列式（除了被修改的行）的情况下，在合适的位置制造零元素。

3. Notation and Shorthand | 记号与简写

When performing row operations, compact notation is essential for clarity and for examiners to follow your logic. The symbol “→” means “replaces”. For instance, R2 → R2 − 2R1 means that the second row is replaced by its old entries minus twice the first row. The first row remains unchanged.

在执行行操作时，简洁的记号对于表达的清晰以及让阅卷者理解你的思路都至关重要。符号“→”意为“替换”。例如，R2 → R2 − 2R1 表示第二行被替换为它原来的元素减去第一行元素的两倍，而第一行保持不变。

You may also see the shorthand R2 ← R2 − 2R1. Some textbooks use using arrows specially designed for elementary operations, but the arrow notation above is standard in UK A-Level examinations.

你也可以看到 R2 ← R2 − 2R1 的写法。一些教科书使用专门设计给基本操作的箭头符号，但上述箭头记号在英国 A-Level 考试中是标准写法。

It is wise to record every operation. Not only does this help you avoid arithmetic mistakes, but it also allows a marker to verify that each transformation is an allowed elementary row operation.

明智的做法是记录每一步操作。这不仅能帮助你避免算术错误，还能让阅卷者验证每一步变换都是允许的基本行操作。

4. Solving Linear Systems with Row Operations | 用行操作解线性方程组

To solve a system of linear equations using row operations, we first write the system as an augmented matrix. The vertical bar separates the coefficients of the variables from the constants on the right-hand side.

用行操作求解线性方程组时，首先要将方程组写成增广矩阵。竖线将变量的系数与右侧常数项分开。

For example, the system

2x + y − z = 3
x − 2y + 2z = 1
3x + 2y + z = 4

has the augmented matrix

[ 2 1 −1 | 3 ]
[ 1 −2 2 | 1 ]
[ 3 2 1 | 4 ]

We then apply row operations to transform this matrix into row echelon form or reduced row echelon form. Once that is done, the solution can be read off or obtained by back substitution.

接着我们使用行操作把这个矩阵化为行阶梯形或行最简形。完成后，可以直接读取解或通过回代得到解。

It is important to remember that row operations act on entire rows, including the right-hand side constants. Do not treat the augmented column separately.

必须牢记：行操作作用于整行，包括右侧常数部分。不要把增广列单独处理。

5. Row Echelon Form and Gaussian Elimination | 行阶梯形与高斯消元

A matrix is in row echelon form if it satisfies three conditions: all non-zero rows are above any rows of all zeros; the leading entry (first non-zero entry) of each row is to the right of the leading entry of the row above it; and the leading entry in any non-zero row is 1 (in the strict convention).

若矩阵满足以下条件，即为行阶梯形：所有非零行都在全零行之上；每一行最左边的非零元素（首项）位于上一行首项的右侧；以及（在严格约定下）非零行的首项为 1。

Gaussian elimination is the process of using row operations to reach row echelon form. Once the matrix is in this form, the solution is found by back substitution, starting from the last equation and working upwards.

高斯消元法就是通过行操作达到行阶梯形的过程。矩阵达到该形式后，可从最后一个方程开始向上回代求解除值。

For instance, after applying appropriate operations to the augmented matrix above, one might obtain the triangular form

[ 1 −2 2 | 1 ]
[ 0 1 −1 | 1/3 ]
[ 0 0 1 | 1 ]

The last row gives z = 1 directly. Substituting back gives y and then x.

例如，对上述增广矩阵运用适当的操作后，可能得到三角形式 [ 1 −2 2 | 1 ]
[ 0 1 −1 | 1/3 ]
[ 0 0 1 | 1 ]。最后一行直接给出 z = 1，回代可求出 y 和 x。

In AQA examinations, you are expected to show the row operations clearly. You do not always need to normalise every leading entry to 1 before applying back substitution, but doing so can make the arithmetic simpler.

在 AQA 考试中，你需要清晰地展示行操作。在回代前不一定必须将每个首项化为 1，但这样做常常能使计算更简便。

6. Gauss-Jordan Elimination and Reduced Row Echelon Form | 高斯-若尔当消元与行最简形

Reduced row echelon form extends row echelon form by also requiring that every column containing a leading 1 has zeros everywhere else. That is, a leading 1 is the only non-zero element in its column. Applying row operations to reach reduced row echelon form is called Gauss-Jordan elimination.

行最简形是在行阶梯形基础上进一步要求：每个包含首项 1 的列，除了该 1 之外其余元素均为零。也就是说，首项 1 是它所在列唯一的非零元素。通过行操作达到行最简形的过程称为高斯-若尔当消元法。

For a system of equations, reaching reduced row echelon form gives the solution directly without any back substitution. For example, if the final matrix is

[ 1 0 0 | 2 ]
[ 0 1 0 | −1 ]
[ 0 0 1 | 1 ]

then x = 2, y = −1 and z = 1.

对于方程组而言，化为行最简形后无需回代即可直接得到解。例如，若最终矩阵为 [ 1 0 0 | 2 ]
[ 0 1 0 | −1 ]
[ 0 0 1 | 1 ]，那么 x = 2，y = −1，z = 1。

Gauss-Jordan elimination is also the standard method for finding the inverse of a matrix in A-Level mathematics. You will see this in the next section.

高斯-若尔当消元法也是 A-Level 数学中求逆矩阵的标准方法，下一节将进行说明。

7. Finding the Inverse Matrix by Row Operations | 用行操作求逆矩阵

To find the inverse of an n×n matrix A, we form the augmented matrix [A | I], where I is the identity matrix of the same size. We then apply row operations to transform the left-hand side into I. The right-hand side will then become A⁻¹.

要求一个 n×n 矩阵 A 的逆矩阵，我们构造增广矩阵 [A | I]，其中 I 是同阶单位矩阵。然后通过行操作将左侧化为 I，此时右侧就变成 A⁻¹。

Consider a 2×2 example: A = [ 2 1 ; 5 3 ]. Write

[ 2 1 | 1 0 ]
[ 5 3 | 0 1 ]

Perform R1 → (1/2)R1 to make the first leading 1:

[ 1 1/2 | 1/2 0 ]
[ 5 3 | 0 1 ]

Then R2 → R2 − 5R1:

[ 1 1/2 | 1/2 0 ]
[ 0 1/2 | −5/2 1 ]

Now R2 → 2R2:

[ 1 1/2 | 1/2 0 ]
[ 0 1 | −5 2 ]

Finally R1 → R1 − (1/2)R2:

[ 1 0 | 3 −1 ]
[ 0 1 | −5 2 ]

Hence A⁻¹ = [ 3 −1 ; −5 2 ]. You can verify this by multiplying A and A⁻¹ to get the identity.

考虑一个 2×2 的例子：A = [ 2 1 ; 5 3 ]。写出 [ 2 1 | 1 0 ]
[ 5 3 | 0 1 ]。先做 R1 → (1/2)R1 得到首项 1：[ 1 1/2 | 1/2 0 ]
[ 5 3 | 0 1 ]。然后 R2 → R2 − 5R1：[ 1 1/2 | 1/2 0 ]
[ 0 1/2 | −5/2 1 ]。接着 R2 → 2R2：[ 1 1/2 | 1/2 0 ]
[ 0 1 | −5 2 ]。最后 R1 → R1 − (1/2)R2：[ 1 0 | 3 −1 ]
[ 0 1 | −5 2 ]。因此 A⁻¹ = [ 3 −1 ; −5 2 ]。你可以通过 A 乘 A⁻¹ 得到单位矩阵来验证。

For a 3×3 matrix, the same principle applies but involves more steps. In AQA examinations, if the inverse is found by row operations, every step must be clearly written. A single arithmetic slip can make the entire inverse wrong, so check your work by recomputing the matrix product where time permits.

对于 3×3 矩阵，原理相同但步骤更多。在 AQA 考试中，如果使用行操作求逆矩阵，每一步都必须清晰写出。任何一个算术错误都可能导致整个逆矩阵错误，因此若时间允许，应通过矩阵乘法进行检验。

8. Row Operations and Determinants | 行操作与行列式

Although the primary use of row operations in AQA is for solving systems and finding inverses, it is useful to know how they affect determinants. This knowledge helps to avoid mistakes when interpreting intermediate matrices.

尽管在 AQA 中行操作的主要用途是求解方程组和求逆矩阵，但了解它们对行列式的影响仍然很有帮助，这有助于避免在解读中间矩阵时出错。

Swapping two rows changes the sign of the determinant.

交换两行使行列式变号。
Multiplying a row by a non-zero constant k multiplies the determinant by k.

将某行乘以非零常数 k，行列式也乘以 k。
Adding a multiple of one row to another row leaves the determinant unchanged.

将某一行的倍数加到另一行，行列式不变。

Thus, when you perform a row scaling operation, the determinant of the resulting matrix is scaled accordingly. If you later compute the determinant of the transformed matrix, you must divide or multiply to recover the original determinant.

因此，当你进行行乘以常数的操作时，所得矩阵的行列式相应地被缩放。如果你之后计算变换矩阵的行列式，需要除以或乘以该常数才能还原原行列式。

9. Common Mistakes and Exam Tips | 常见错误与考试提示

One common mistake is to mix row operations with column operations. Only row operations are allowed in these methods. Performing a column operation can change the solution set of the system or make the matrix no longer equivalent to the original.

一个常见错误是将行操作与列操作混淆。这些方法中只允许行操作。进行列操作可能会改变方程组的解集，或者使矩阵不再与原矩阵等价。

Another frequent error is forgetting to update the right-hand side of the augmented matrix when working with equations. Every row operation must be applied to all elements of the row, including the constant term.

另一个常见错误是在处理方程组时忘记更新增广矩阵右侧的常数项。每个行操作必须应用于该行的所有元素，包括常数项。

To maximise marks, always label your row operations and keep fractions in exact form rather than decimals. If a leading entry is awkward, swap rows or multiply the row by a convenient integer to make the calculation cleaner.

为了获得更高分数，请始终标注你的行操作，并保留分数的精确形式而不是用小数。如果某个首项不方便，可以交换行或将该行乘以一个合适的整数，让计算更简洁。

Finally, remember that two matrices related by a sequence of elementary row operations are called row equivalent. This equivalence preserves the solution set. If you suspect your final answer is wrong, substitute your solution into the original equations as a check.

最后，请记住，由一串基本行操作联系起来的两个矩阵称为行等价。这种等价性保持解集不变。如果你怀疑最终答案有误，可以把你的解代回原始方程进行检验。

10. Worked Example | 完整例题

Solve the system:

2x + y − z = 3
x − 2y + 2z = 1
3x + 2y + z = 4

Write the augmented matrix:

[ 2 1 −1 | 3 ]
[ 1 −2 2 | 1 ]
[ 3 2 1 | 4 ]

Swap R1 and R2 for a simpler first pivot:

R1 ↔ R2

[ 1 −2 2 | 1 ]
[ 2 1 −1 | 3 ]
[ 3 2 1 | 4 ]

Eliminate the first column below the pivot:

R2 → R2 − 2R1
R3 → R3 − 3R1

[ 1 −2 2 | 1 ]
[ 0 5 −5 | 1 ]
[ 0 8 −5 | 1 ]

Scale R2 to make the second pivot convenient:

R2 → (1/5)R2

[ 1 −2 2 | 1 ]
[ 0 1 −1 | 1/5 ]
[ 0 8 −5 | 1 ]

Eliminate below the second pivot:

R3 → R3 − 8R2

[ 1 −2 2 | 1 ]
[ 0 1 −1 | 1/5 ]
[ 0 0 3 | −3/5 ]

Now R3 → (1/3)R3:

R3 → (1/3)R3

[ 1 −2 2 | 1 ]
[ 0 1 −1 | 1/5 ]
[ 0 0 1 | −1/5 ]

Back substitution from the last row: z = −1/5. From the second row, y − z = 1/5, so y = z + 1/5 = 0. From the first row, x − 2y + 2z = 1, giving x = 1 + 2y − 2z = 1 − 2(−1/5) = 7/5.

从最后一行回代：z = −1/5。由第二行 y − z = 1/5，得 y = z + 1/5 = 0。由第一行 x − 2y + 2z = 1，得 x = 1 + 2y − 2z = 1 − 2(−1/5) = 7/5。

Hence the solution is x = 7/5, y = 0, z = −1/5. Substituting these values into the original equations confirms the result.

因此解为 x = 7/5，y = 0，z = −1/5。将这些值代回原方程组可以验证结果。

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

Row Operations | 行变换