📚 IB Mathematics: Methods for Determining Solutions of Linear Systems | IB数学:线性方程组解的判定方法
In IB Mathematics, solving systems of linear equations is a fundamental skill that appears in both Analysis and Approaches (AA) and Applications and Interpretation (AI). Beyond simply finding solutions, you must be able to determine whether a system has a unique solution, infinitely many solutions, or no solution at all. This article presents a complete, exam-focused guide to classifying and solving linear systems using Gaussian elimination, rank analysis, and determinant methods.
在IB数学中,解线性方程组是一项基础技能,无论是在分析与方法(AA)还是应用与解释(AI)课程中都会出现。除了简单地求解之外,你还必须能够判断方程组是有唯一解、无穷多解还是无解。本文提供一份完整且紧扣考点的指南,教你运用高斯消元法、秩分析和行列式法来分类并求解线性方程组。
1. What is a Linear System? | 什么是线性方程组?
A linear system is a collection of linear equations involving the same set of variables. For example, a system of two equations in two unknowns has the general form:
线性方程组是由包含同一组变量的多个线性方程组成的集合。例如,含有两个未知数的两个方程的一般形式为:
a₁x + b₁y = c₁
a₂x + b₂y = c₂
Similarly, a system of three equations in three unknowns can be written as:
类似地,含有三个未知数的三个方程可以写成:
a₁x + b₁y + c₁z = d₁
a₂x + b₂y + c₂z = d₂
a₃x + b₃y + c₃z = d₃
In IB exams, you will typically encounter systems with 2 or 3 variables, although larger systems may appear in matrix questions.
在IB考试中,你通常会遇到含2个或3个变量的方程组,但在矩阵题目中也可能出现更大的方程组。
Every linear system can be represented in matrix form as AX = B, where A is the coefficient matrix, X is the column vector of variables, and B is the constant vector. Understanding this representation is essential for applying determinant and rank criteria.
每个线性方程组都可以用矩阵形式表示为AX = B,其中A是系数矩阵,X是变量列向量,B是常数向量。理解这种表示方式对于运用行列式和秩的判定准则至关重要。
2. Three Possible Solution Types | 三种可能的解类型
For any linear system, exactly one of the following three situations must occur:
对于任何线性方程组,以下三种情况中恰好有一种会发生:
-
Unique solution: The system has exactly one solution. Geometrically, this corresponds to intersecting lines (2D) or intersecting planes at a single point (3D).
-
无解:方程组没有解。在几何上,这对应于两条平行直线(二维)或没有公共交点的平面(三维)。
-
Infinitely many solutions: The system has infinitely many solutions. Geometrically, this corresponds to coincident lines (2D) or planes intersecting along a line (3D).
These three cases are mutually exclusive and exhaustive. In IB mark schemes, you are often expected to state which case applies before solving the system.
这三种情况是互斥且完备的。在IB评分标准中,你通常需要先说明属于哪种情况,然后再求解方程组。
3. Geometric Interpretation in 2D | 二维几何解释
For a system of two linear equations in two variables, each equation represents a straight line in the xy-plane. The solution set depends on how the two lines relate to each other:
对于含两个变量的两个线性方程,每个方程代表xy平面上的一条直线。解集取决于两条直线之间的位置关系:
| Case | Condition on slopes | Solution type |
| Different slopes | m₁ ≠ m₂ | Unique solution (intersect at one point) |
| Same slope, different intercept | m₁ = m₂, b₁ ≠ b₂ | No solution (parallel lines) |
| Same slope and same intercept | m₁ = m₂, b₁ = b₂ | Infinitely many solutions (same line) |
Consider the system:
考虑方程组:
x + y = 3
x − y = 1
The two lines have slopes −1 and 1 respectively, so they are not parallel. Solving gives x = 2, y = 1, a unique solution.
这两条直线的斜率分别为−1和1,因此它们不平行。解得x = 2,y = 1,这是一个唯一解。
If the second equation were 2x + 2y = 6, it is just the first equation multiplied by 2, so the lines coincide and every point on the line is a solution.
如果第二个方程是2x + 2y = 6,那么它只是第一个方程的2倍,因此两条直线重合,直线上的每个点都是解。
4. Geometric Interpretation in 3D | 三维几何解释
In three variables, each linear equation represents a plane in space. Three planes can intersect in several ways:
在三个变量的情况下,每个线性方程代表空间中的一个平面。三个平面可以有多种相交方式:
-
Unique solution: The three planes meet at a single point.
-
唯一解:三个平面交于一点。
-
No solution: The planes are parallel, or two are parallel, or they intersect pairwise but not all together.
-
无解:三个平面平行,或者其中两个平行,或者两两相交但没有公共交点。
-
Infinitely many solutions: The three planes intersect along a line, or all three coincide.
-
无穷多解:三个平面沿一条直线相交,或者三个平面重合。
Visualising these scenarios is helpful, but for precise classification you should rely on algebraic methods, especially Gaussian elimination.
可视化这些情形有助于理解,但要精确分类,你应该依赖代数方法,尤其是高斯消元法。
5. Gaussian Elimination and Row Echelon Form | 高斯消元法与行阶梯形
Gaussian elimination is the most systematic method for solving linear systems and is heavily tested in IB. The goal is to transform the augmented matrix into row echelon form using elementary row operations.
高斯消元法是求解线性方程组最系统的方法,也是IB考试的重点。目标是通过初等行变换将增广矩阵化为行阶梯形。
Elementary row operations include:
初等行变换包括:
-
Swapping two rows.
-
交换两行。
-
Multiplying a row by a non-zero constant.
-
将某一行乘以非零常数。
-
Adding a multiple of one row to another row.
-
将某一行的倍数加到另一行上。
A matrix is in row echelon form if all non-zero rows are above rows of zeros, and the leading entry of each non-zero row is to the right of the leading entry of the row above.
如果所有非零行都在全零行之上,并且每个非零行的首个非零元素在其上一行首个非零元素的右侧,则矩阵处于行阶梯形。
For example, the following is a row echelon form:
例如,下面就是一个行阶梯形:
⎡ 2 1 −1 | 3 ⎤
⎢ 0 1 4 | 2 ⎥
⎣ 0 0 1 | 5 ⎦
Once in this form, you can use back-substitution to find the solution(s).
一旦化为这种形式,就可以用回代法求解。
6. The Rank Method | 秩判定法
The rank of a matrix is the number of non-zero rows in its row echelon form. For a system AX = B with n variables, define the augmented matrix [A | B]. Then:
矩阵的秩是其行阶梯形中非零行的数量。对于含有n个变量的方程组AX = B,定义增广矩阵[A | B]。于是:
Let r = rank(A) and r’ = rank([A | B])
-
If r ≠ r’, the system is inconsistent (no solution).
-
如果r ≠ r’,方程组不相容(无解)。
-
If r = r’ = n, the system has a unique solution.
-
如果r = r’ = n,方程组有唯一解。
-
If r = r’ < n, the system has infinitely many solutions, with (n − r) free parameters.
-
如果r = r’ < n,方程组有无穷多解,其中有(n − r)个自由参数。
This rank criterion is the most powerful algebraic tool for classifying linear systems and is explicitly listed in the IB syllabus.
秩判定准则是对线性方程组进行分类的最强有力的代数工具,也是IB教学大纲中明确列出的内容。
Example: For the system
示例:对于方程组
x + y + z = 1
2x + 2y + 2z = 2
x − y = 0
The coefficient matrix has rank 2 (because the first and third rows are linearly independent), and the augmented matrix also has rank 2. Since r = r’ = 2 < 3, there are infinitely many solutions with one free parameter.
系数矩阵的秩为2(因为第一行和第三行线性无关),增广矩阵的秩也为2。由于r = r’ = 2 < 3,方程组有无穷多解,含有一个自由参数。
7. Determinant Method for Square Systems | 方阵的行列式判定法
For a system with the same number of equations as variables (a square system), the determinant of the coefficient matrix A provides an immediate classification:
对于方程个数等于变量个数(方阵)的方程组,系数矩阵A的行列式可以立即用于分类:
-
If det(A) ≠ 0, the system has a unique solution, given by X = A⁻¹B (or by Cramer’s rule).
-
如果det(A) ≠ 0,方程组有唯一解,由X = A⁻¹B(或克拉默法则)给出。
-
If det(A) = 0, the system is either inconsistent or has infinitely many solutions. Further analysis via rank is required.
-
如果det(A) = 0,方程组要么无解,要么有无穷多解。需要进一步用秩分析来判断。
For the 2×2 system ax + by = e, cx + dy = f, the determinant is:
对于2×2方程组ax + by = e, cx + dy = f,行列式为:
det(A) = ad − bc
If ad − bc ≠ 0, the unique solution is:
如果ad − bc ≠ 0,唯一解为:
x = (ed − bf) / (ad − bc)
y = (af − ec) / (ad − bc)
This is essentially Cramer’s rule in two dimensions and is a quick way to solve 2×2 systems in exam conditions.
这本质上就是二维情形的克拉默法则,是在考试条件下快速求解2×2方程组的方法。
8. Cramer’s Rule | 克拉默法则
Cramer’s rule is an explicit formula for the unique solution of a square system with det(A) ≠ 0. For each variable xᵢ, replace the i-th column of A with the constant column B, compute the determinant of this new matrix, and divide by det(A).
克拉默法则是方阵方程组在det(A) ≠ 0时唯一解的显式公式。对于每个变量xᵢ,将A的第i列替换为常数列B,计算这个新矩阵的行列式,然后除以det(A)。
xᵢ = det(Aᵢ) / det(A)
For a 3×3 system:
对于3×3方程组:
a₁x + b₁y + c₁z = d₁
a₂x + b₂y + c₂z = d₂
a₃x + b₃y + c₃z = d₃
The solution is:
解为:
x = det(Aₓ) / det(A), y = det(Aᵧ) / det(A), z = det(A_z) / det(A)
Cramer’s rule is efficient for 2×2 and 3×3 systems but becomes impractical for larger systems. In IB exams, it is most useful when the determinant is easy to compute and the system is known to have a unique solution.
克拉默法则对2×2和3×3方程组很高效,但对于更大的方程组则不实用。在IB考试中,当行列式容易计算且已知方程组有唯一解时,它最为有用。
9. Solving with a Free Parameter | 含自由参数的通解
When a system has infinitely many solutions, you must express the general solution in terms of one or more parameters. This is a common IB exam question.
当方程组有无穷多解时,你必须用参数表达通解。这是IB考试中的常见题型。
Example: Solve the system
示例:解方程组
x + y + z = 2
2x + 3y + 4z = 5
Here there are 3 variables but only 2 equations. The coefficient matrix has rank 2, so there will be 3 − 2 = 1 free parameter.
这里有3个变量但只有2个方程。系数矩阵的秩为2,因此有3 − 2 = 1个自由参数。
Let z = t, where t is a real number. Then from the first equation:
令z = t,其中t为实数。则由第一个方程:
x = 2 − y − t
From the second equation: 2x + 3y + 4t = 5. Substituting the expression for x:
由第二个方程:2x + 3y + 4t = 5。代入x的表达式:
2(2 − y − t) + 3y + 4t = 5
4 − 2y − 2t + 3y + 4t = 5
y + 2t = 1
y = 1 − 2t
Then x = 2 − (1 − 2t) − t = 1 + t. Therefore the general solution is:
于是x = 2 − (1 − 2t) − t = 1 + t。因此通解为:
(x, y, z) = (1 + t, 1 − 2t, t), t ∈ ℝ
This represents a line in three-dimensional space, confirming the geometric interpretation.
这表示三维空间中的一条直线,与几何解释相吻合。
10. Common IB Exam Pitfalls | 常见IB考试陷阱
Students often lose marks on linear system questions due to a few avoidable mistakes:
学生在做线性方程组题目时,常因以下可避免的错误而失分:
-
Forgetting to check consistency: When rank(A) = 0 or the row echelon form shows a row like [0 0 0 | 1], the system has no solution. Always verify consistency before claiming infinitely many solutions.
-
忘记检验相容性:当行阶梯形中出现类似[0 0 0 | 1]的行时,方程组无解。在声称有无穷多解之前,一定要先验证相容性。
-
Incorrect free parameter count: The number of free parameters is n − r, not n − r’ (since r = r’ for consistency). Mixing these up is a common error.
-
自由参数个数算错:自由参数个数是n − r,而不是n − r’(因为在相容时r = r’)。混淆这两者是常见错误。
-
Dividing by zero: When using determinant or Cramer’s rule, ensure det(A) is non-zero before applying the formula.
-
除零错误:使用行列式或克拉默法则时,必须先确保det(A) ≠ 0再套用公式。
-
Row operation mistakes: Be careful with signs when adding multiples of rows. A single arithmetic error changes the entire classification.
-
行变换出错:将某行的倍数加到另一行时,要注意符号。一个算术错误就会改变整个分类结果。
To avoid these pitfalls, always write the augmented matrix clearly and perform one row operation at a time.
为避免这些错误,一定要清晰写出增广矩阵,并且每次只执行一个行变换。
11. Worked Examples | 完整例题解析
Example 1: Determine the nature of the solutions of the system
例1:判断以下方程组的解的性质
x + 2y − z = 1
2x + 4y − 2z = 3
x − y + z = 0
Write the augmented matrix:
写出增广矩阵:
⎡ 1 2 −1 | 1 ⎤
⎣ 2 4 −2 | 3 ⎦
⎣ 1 −1 1 | 0 ⎦
Perform row operations: R₂ → R₂ − 2R₁ gives [0 0 0 | 1]. This row reads 0 = 1, which is impossible. Therefore the system is inconsistent and has no solution.
执行行变换:R₂ → R₂ − 2R₁得到[0 0 0 | 1]。这一行表示0 = 1,不可能成立。因此该方程组不相容,无解。
Example 2: For what value of k does the following system have infinitely many solutions?
例2:当k为何值时,以下方程组有无穷多解?
x + y + z = 2
2x + y + 3z = 4
x + 2y + kz = 5
Perform row operations:
执行行变换:
R₂ → R₂ − 2R₁: [0 −1 1 | 0]
R₃ → R₃ − R₁: [0 1 (k−1) | 3]
Now R₃ → R₃ + R₂: [0 0 k | 3]
For infinitely many solutions, the last row must be all zeros, so k = 0 and the constant must also be zero. But here the constant is 3. Wait, let us recompute carefully.
要使方程组有无穷多解,最后一行必须全为零,所以k = 0,同时常数项也必须为零。但这里常数项是3。我们仔细重新计算。
After R₂ → R₂ − 2R₁ and R₃ → R₃ − R₁:
在R₂ → R₂ − 2R₁和R₃ → R₃ − R₁之后:
R₂: 0 -1 1 | 0
R₃: 0 1 (k−1) | 3
Then R₃ → R₃ + R₂ gives:
接着R₃ → R₃ + R₂得到:
0 0 k | 3
For this row to be all zeros on both sides, we need k = 0 and 3 = 0, which is impossible. Hence there is no value of k that gives infinitely many solutions. The system always has either a unique solution (when k ≠ 0) or no solution (when k = 0, because 0 = 3 is impossible).
要使这一行左右两侧全为零,需要k = 0且3 = 0,这不可能。因此不存在这样的k使方程组有无穷多解。该方程组要么有唯一解(k ≠ 0时),要么无解(k = 0时,因为0 = 3不可能成立)。
12. Summary of Decision Strategy | 决策流程总结
When faced with any linear system in an IB exam, follow this structured approach:
在IB考试中遇到任何线性方程组时,请按以下结构化步骤进行:
-
Step 1: Write the system in matrix form AX = B.
-
步骤1:将方程组写成矩阵形式AX = B。
-
Step 2: Form the augmented matrix [A | B].
-
步骤2:构造增广矩阵[A | B]。
-
Step 3: Use Gaussian elimination to reduce to row echelon form.
-
步骤3:使用高斯消元法化为行阶梯形。
-
Step 4: Determine rank(A) and rank([A | B]).
-
步骤4:确定rank(A)和rank([A | B])。
-
Step 5: Apply the rank criterion to classify the system.
-
步骤5:应用秩准则对系统进行分类。
For square systems where det(A) ≠ 0, you may alternatively use the determinant or Cramer’s rule directly. If det(A) = 0, return to the rank method for full classification.
对于det(A) ≠ 0的方阵方程组,你也可以直接使用行列式或克拉默法则。如果det(A) = 0,则回到秩方法进行完整分类。
Mastering these methods will allow you to solve any linear system question confidently and earn full marks in this topic.
掌握这些方法后,你将能够自信地解决任何线性方程组题目,并在这一知识点上获得满分。
Published by TutorHao | IB Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022(同微信)
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导,国外大学本科硕士研究生博士课程论文辅导Cancel reply