📚 Linear Dependence and Independence of Vectors | 向量的线性相关与线性无关判定
Linear dependence and independence are fundamental concepts in vector algebra that underpin much of linear algebra, analytic geometry, and higher-dimensional mathematics. In this article, we will define these concepts precisely, develop practical criteria for determining whether a set of vectors is linearly dependent or independent, and illustrate each idea with worked examples relevant to the IB Mathematics syllabus.
线性相关与线性无关是向量代数中的基础概念，它们是线性代数、解析几何以及高维数学的重要基石。在本文中，我们将精确定义这些概念，建立判断一组向量是否线性相关或线性无关的实用准则，并结合 IB 数学课程中的考点，通过典型例题逐一说明。
1. Definition of Linear Combination | 线性组合的定义
Before discussing dependence, we must first understand what it means to combine vectors. Given vectors v₁, v₂, …, vₙ in the same vector space and scalars c₁, c₂, …, cₙ (real numbers for IB), the expression c₁v₁ + c₂v₂ + … + cₙvₙ is called a linear combination of these vectors.
在讨论线性相关之前，我们首先需要理解“组合”向量的含义。给定同一向量空间中的向量 v₁, v₂, …, vₙ 以及标量 c₁, c₂, …, cₙ（IB 课程中为实数），表达式 c₁v₁ + c₂v₂ + … + cₙvₙ 称为这些向量的一个线性组合。
For example, in two-dimensional space, the vector (3, 5) can be written as a linear combination of the standard basis vectors: (3, 5) = 3(1, 0) + 5(0, 1). Similarly, we could express it using other vectors, such as (3, 5) = 2(1, 1) + 1(1, 3). The flexibility of linear combinations is what gives vector spaces their structure.
例如，在二维空间中，向量 (3, 5) 可以写成标准基向量的线性组合：(3, 5) = 3(1, 0) + 5(0, 1)。类似地，我们也可以用其他向量来表示它，例如 (3, 5) = 2(1, 1) + 1(1, 3)。线性组合的这种灵活性赋予了向量空间其内在结构。
2. Linear Dependence: The Core Definition | 线性相关：核心定义
A set of vectors v₁, v₂, …, vₙ is said to be linearly dependent if there exist scalars c₁, c₂, …, cₙ, not all zero, such that c₁v₁ + c₂v₂ + … + cₙvₙ = 0. Note that the right-hand side is the zero vector (0, 0, …, 0).
一组向量 v₁, v₂, …, vₙ 被称为线性相关，如果存在不全为零的标量 c₁, c₂, …, cₙ，使得 c₁v₁ + c₂v₂ + … + cₙvₙ = 0。注意等式右边是零向量 (0, 0, …, 0)。
The key phrase is “not all zero.” If the only way to make the linear combination equal the zero vector is to take all scalars equal to zero, the vectors are linearly independent. Intuitively, linear dependence means that at least one vector in the set can be written as a linear combination of the others — it carries redundant information.
关键短语是“不全为零”。如果使线性组合等于零向量的唯一方式是令所有标量都为零，则这些向量线性无关。直观地看，线性相关意味着集合中至少有一个向量可以写成其余向量的线性组合——它携带了冗余信息。
c₁v₁ + c₂v₂ + … + cₙvₙ = 0, not all cᵢ = 0 → linearly dependent
c₁v₁ + c₂v₂ + … + cₙvₙ = 0 ⇒ all cᵢ = 0 → linearly independent
Let us illustrate with a simple example. In R², the vectors u = (1, 2) and v = (2, 4) are linearly dependent because v = 2u, so 2u − v = (2, 4) − (2, 4) = (0, 0). Here c₁ = 2 and c₂ = −1, which are not both zero.
我们用一个简单例子来说明。在 R² 中，向量 u = (1, 2) 与 v = (2, 4) 线性相关，因为 v = 2u，所以 2u − v = (2, 4) − (2, 4) = (0, 0)。此时 c₁ = 2，c₂ = −1，它们不全为零。
3. Geometric Interpretation | 几何直观解释
In two dimensions, two vectors are linearly dependent if and only if they are parallel (collinear), meaning one is a scalar multiple of the other. If two vectors are not parallel, they are linearly independent, and together they span the entire plane.
在二维空间中，两个向量线性相关当且仅当它们平行（共线），即其中一个向量是另一个的标量倍。如果两个向量不平行，则它们线性无关，并且二者共同张成整个平面。
In three dimensions, three vectors are linearly dependent if and only if they are coplanar (all lying in the same plane through the origin). Three vectors that are not coplanar are linearly independent and span all of R³.
在三维空间中，三个向量线性相关当且仅当它们共面（即全部位于过原点的同一平面内）。三个不共面的向量线性无关，并张成整个 R³。
More generally, in Rⁿ, at most n vectors can be linearly independent. If we have more than n vectors in Rⁿ, they must be linearly dependent. This is a powerful counting argument that often appears in exam questions.
更一般地，在 Rⁿ 中，最多只有 n 个向量可以线性无关。如果我们在 Rⁿ 中有超过 n 个向量，则它们必定线性相关。这是一个强有力的计数论证，在考试题目中经常出现。
4. The Determinant Method for n Vectors in Rⁿ | 行列式判定法：Rⁿ 中的 n 个向量
For a set of n vectors in Rⁿ, we can arrange them as the columns (or rows) of a square matrix and compute its determinant. If the determinant is zero, the vectors are linearly dependent; if the determinant is non-zero, they are linearly independent.
对于 Rⁿ 中的 n 个向量，我们可以将它们排列成一个方阵的列（或行）并计算其行列式。如果行列式为零，则向量线性相关；如果行列式不为零，则它们线性无关。
This method works because the determinant measures the n-dimensional volume of the parallelepiped formed by the vectors. A zero volume indicates that the vectors do not span the full space, which is exactly the geometric meaning of linear dependence.
这种方法之所以有效，是因为行列式度量的是由这些向量构成的平行体在 n 维空间中的体积。体积为零表明这些向量不能张成整个空间，这正是线性相关的几何含义。
Example: Determine whether the vectors a = (1, 1, 2), b = (2, −1, 1), c = (3, 0, 3) are linearly independent.
例题：判断向量 a = (1, 1, 2)，b = (2, −1, 1)，c = (3, 0, 3) 是否线性无关。
Form the matrix with these vectors as columns:
将这三个向量作为列构成矩阵：
| 1 | 2 | 3 |
| 1 | −1 | 0 |
| 2 | 1 | 3 |
Compute the determinant:
计算行列式：
det = 1[(−1)(3) − (0)(1)] − 2[(1)(3) − (0)(2)] + 3[(1)(1) − (−1)(2)]
= 1(−3) − 2(3) + 3(1 + 2) = −3 − 6 + 9 = 0
Since the determinant is zero, the vectors are linearly dependent. Indeed, we can verify that c = a + b = (1, 1, 2) + (2, −1, 1) = (3, 0, 3).
由于行列式为零，这些向量线性相关。事实上，我们可以验证 c = a + b = (1, 1, 2) + (2, −1, 1) = (3, 0, 3)。
5. Solving the Vector Equation Directly | 直接求解向量方程
When the number of vectors is not equal to the dimension of the space, or when a determinant is cumbersome, we can set up the equation c₁v₁ + c₂v₂ + … = 0 and solve the resulting system of linear equations. If the only solution is the trivial solution (all cᵢ = 0), the vectors are independent; otherwise they are dependent.
当向量个数不等于空间维数，或者行列式计算较为繁琐时，我们可以建立方程 c₁v₁ + c₂v₂ + … = 0 并求解相应的线性方程组。如果唯一解是平凡解（所有 cᵢ = 0），则向量线性无关；否则它们线性相关。
Example: Are the vectors u = (1, 2, 1), v = (2, 5, 3), w = (1, 1, 0) linearly independent? Consider c₁u + c₂v + c₃w = 0.
例题：向量 u = (1, 2, 1)，v = (2, 5, 3)，w = (1, 1, 0) 是否线性无关？考虑 c₁u + c₂v + c₃w = 0。
This gives the system:
这给出方程组：
c₁ + 2c₂ + c₃ = 0
2c₁ + 5c₂ + c₃ = 0
c₁ + 3c₂ + 0c₃ = 0
From the third equation, c₁ = −3c₂. Substituting into the first: −3c₂ + 2c₂ + c₃ = 0 ⇒ c₃ = c₂. Substituting into the second: 2(−3c₂) + 5c₂ + c₂ = −6c₂ + 6c₂ = 0, which is satisfied for any c₂. Thus we have a free parameter, e.g. c₂ = 1 gives c₁ = −3, c₃ = 1. A non-trivial solution exists, so the vectors are linearly dependent.
由第三个方程得 c₁ = −3c₂。代入第一个方程：−3c₂ + 2c₂ + c₃ = 0 ⇒ c₃ = c₂。代入第二个方程：2(−3c₂) + 5c₂ + c₂ = −6c₂ + 6c₂ = 0，对任意 c₂ 均成立。因此存在自由参数，例如令 c₂ = 1，则 c₁ = −3，c₃ = 1。存在非平凡解，所以这些向量线性相关。
In fact, we can verify: −3u + v + w = −3(1, 2, 1) + (2, 5, 3) + (1, 1, 0) = (−3+2+1, −6+5+1, −3+3+0) = (0, 0, 0).
事实上，我们可以验证：−3u + v + w = −3(1, 2, 1) + (2, 5, 3) + (1, 1, 0) = (−3+2+1, −6+5+1, −3+3+0) = (0, 0, 0)。
6. Using Row Reduction (Gaussian Elimination) | 使用行化简（高斯消元法）
Row reduction provides a systematic algorithm for testing linear independence. Form a matrix whose rows (or columns) are the given vectors, then reduce it to row echelon form. If every row has a leading non-zero entry (i.e. the rank equals the number of vectors), the vectors are linearly independent. If any row becomes all zeros, the vectors are linearly dependent.
行化简为检验线性无关提供了一种系统化的算法。将给定向量作为矩阵的行（或列），然后将矩阵化为行阶梯形。如果每一行都有非零首项（即秩等于向量个数），则向量线性无关。如果任何一行变为全零行，则向量线性相关。
Example: Test whether p = (1, 2, −1), q = (2, 3, 1), r = (3, 5, 0) are linearly independent.
例题：检验 p = (1, 2, −1)，q = (2, 3, 1)，r = (3, 5, 0) 是否线性无关。
Form the matrix with rows p, q, r:
以 p、q、r 为行构成矩阵：
| 1 | 2 | −1 |
| 2 | 3 | 1 |
| 3 | 5 | 0 |
Row operations: R₂ ← R₂ − 2R₁ gives (0, −1, 3). R₃ ← R₃ − 3R₁ gives (0, −1, 3). Then R₃ ← R₃ − R₂ gives (0, 0, 0). Since we obtain a zero row, the rank is 2, less than 3, so the vectors are linearly dependent.
行操作：R₂ ← R₂ − 2R₁ 得 (0, −1, 3)。R₃ ← R₃ − 3R₁ 得 (0, −1, 3)。然后 R₃ ← R₃ − R₂ 得 (0, 0, 0)。由于出现了零行，秩为 2，小于 3，因此这些向量线性相关。
Notice that r = p + q = (1, 2, −1) + (2, 3, 1) = (3, 5, 0), confirming the result. This method is especially useful for larger systems and for vectors in higher dimensions.
注意到 r = p + q = (1, 2, −1) + (2, 3, 1) = (3, 5, 0)，验证了该结果。此方法对于较大规模的方程组以及更高维空间中的向量尤为有用。
7. Special Cases: Zero Vector and Repeated Vectors | 特殊情况：零向量与重复向量
Any set of vectors that contains the zero vector 0 is automatically linearly dependent. Indeed, c0 = 0 for any non-zero c, so we can choose c = 1 for the zero vector and c = 0 for all others. Similarly, if any two vectors in the set are identical, the set is linearly dependent: v − v = 0 with coefficients 1 and −1.
任何包含零向量 0 的向量集合必然线性相关。事实上，对任意非零 c 都有 c0 = 0，因此我们可以对零向量取 c = 1，对其余向量取 c = 0。类似地，如果集合中有两个向量完全相同，则该集合线性相关：v − v = 0，系数分别为 1 和 −1。
More generally, if one vector is a scalar multiple of another, the set is dependent. This is a quick check that can save time in exam situations. For instance, (1, 2, 3) and (−2, −4, −6) are dependent because the second is −2 times the first.
更一般地，如果一个向量是另一个向量的标量倍，则该集合线性相关。这是一个在考试中可以节省时间的快速检查方法。例如，(1, 2, 3) 与 (−2, −4, −6) 线性相关，因为第二个是第一个的 −2 倍。
Another important special case: a single vector is linearly independent if and only if it is not the zero vector. A set of two vectors is dependent if and only if they are parallel. These simple rules are frequently tested in IB Paper 1 questions.
另一个重要的特殊情况：单独一个向量线性无关当且仅当它不是零向量。两个向量组成的集合线性相关当且仅当它们平行。这些简单规则经常出现在 IB Paper 1 的题目中。
8. Relationship with Basis and Dimension | 与基和维数的关系
A basis of a vector space is a set of vectors that is both linearly independent and spans the entire space. The number of vectors in a basis is called the dimension of the space. For example, the standard basis of R³ is {(1,0,0), (0,1,0), (0,0,1)}, which has three linearly independent vectors, so dim(R³) = 3.
向量空间的基是一组既线性无关又能张成整个空间的向量。基中向量的个数称为该空间的维数。例如，R³ 的标准基是 {(1,0,0), (0,1,0), (0,0,1)}，它包含三个线性无关的向量，因此 dim(R³) = 3。
Linear independence is essential for a set to be a basis. If vectors are dependent, they contain redundancy and cannot span the space efficiently. Conversely, if they are independent but do not span the space, they form a basis for a smaller subspace only.
线性无关是成为基的必要条件。如果向量线性相关，则它们含有冗余，不能高效地张成空间。反之，如果它们线性无关但不能张成整个空间，则它们只能构成某个更小的子空间的基。
In IB problems, you may be asked to show that three vectors form a basis for R³. This is equivalent to showing that they are linearly independent (or that the determinant of the matrix formed by them is non-zero). Knowing this equivalence allows you to choose the most efficient method.
在 IB 题目中，你可能会被要求证明三个向量构成 R³ 的基。这等价于证明它们线性无关（或由它们构成的矩阵的行列式不为零）。理解这种等价关系可以让你选择最有效率的方法。
9. Worked Example: Parametric Dependence | 综合例题：参数相关性判定
Problem: For what value of k are the vectors a = (1, 2, k), b = (2, k, 4), c = (k, 2, 1) linearly dependent?
例题：当 k 取何值时，向量 a = (1, 2, k)，b = (2, k, 4)，c = (k, 2, 1) 线性相关？
Solution: These are three vectors in R³, so we compute the determinant of the matrix with columns a, b, c:
解：这是 R³ 中的三个向量，因此我们计算以 a、b、c 为列的矩阵的行列式：
| 1 | 2 | k |
| 2 | k | 2 |
| k | 4 | 1 |
det = 1(k·1 − 2·4) − 2(2·1 − 2·k) + k(2·4 − k·k)
= (k − 8) − 2(2 − 2k) + k(8 − k²)
= k − 8 − 4 + 4k + 8k − k³ = 13k − 12 − k³
Set det = 0: −k³ + 13k − 12 = 0, or k³ − 13k + 12 = 0. Factor: (k − 1)(k² + k − 12) = (k − 1)(k + 4)(k − 3) = 0. Hence k = 1, k = 3, or k = −4.
令 det = 0：−k³ + 13k − 12 = 0，即 k³ − 13k + 12 = 0。因式分解：(k − 1)(k² + k − 12) = (k − 1)(k + 4)(k − 3) = 0。因此 k = 1，k = 3 或 k = −4。
Thus the vectors are linearly dependent for k = 1, 3, −4, and linearly independent for all other real values of k.
因此，当 k = 1，3，−4 时向量线性相关；当 k 为其他所有实数值时，向量线性无关。
10. Common Mistakes and Exam Tips | 常见错误与考试技巧
Mistake 1: Confusing linear dependence with the zero vector equation. Remember that the equation c₁v₁ + … = 0 always has the trivial solution c₁ = … = 0. Dependence requires the existence of a non-trivial solution.
错误一：将线性相关与零向量方程混淆。记住方程 c₁v₁ + … = 0 总是存在平凡解 c₁ = … = 0。线性相关要求存在非平凡解。
Mistake 2: Using the determinant method when the number of vectors does not equal the dimension. The determinant method only applies to n vectors in Rⁿ. For example, three vectors in R² cannot be tested with a 3×3 determinant.
错误二：当向量个数不等于空间维数时使用行列式法。行列式法仅适用于 Rⁿ 中的 n 个向量。例如，R² 中的三个向量不能使用 3×3 行列式来检验。
Mistake 3: Forgetting that the zero vector makes a set automatically dependent. Check for this before doing lengthy computations.
错误三：忘记零向量会使集合必然线性相关。在进行冗长计算之前，先检查是否存在零向量。
Exam tip: When asked to determine dependence, first check the number of vectors versus the dimension. If there are more vectors than the dimension, they must be dependent — no calculation needed. If equal, the determinant or row reduction works well. If fewer, solve the vector equation directly.
考试技巧：当被要求判断相关性时，首先比较向量个数与空间维数。如果向量个数大于维数，则它们必然线性相关——无需计算。如果相等，使用行列式或行化简即可。如果较少，则直接求解向量方程。
11. Extension: Linear Dependence in Function Spaces | 拓展：函数空间中的线性相关
Linear dependence is not limited to coordinate vectors. In IB higher-level contexts, you may encounter sets of functions such as f₁(x) = sin x, f₂(x) = cos x, f₃(x) = 2 sin x. These are linearly dependent because f₃ = 2f₁. In general, functions f₁, f₂, …, fₙ are linearly dependent on an interval if there exist constants, not all zero, such that c₁f₁(x) + c₂f₂(x) + … + cₙfₙ(x) = 0 for every x in the interval.
线性相关不仅限于坐标向量。在 IB 高级课程的背景下，你可能会遇到函数集合，例如 f₁(x) = sin x，f₂(x) = cos x，f₃(x) = 2 sin x。这些函数线性相关，因为 f₃ = 2f₁。一般地，如果存在不全为零的常数，使得在区间内每一点 x 均有 c₁f₁(x) + c₂f₂(x) + … + cₙfₙ(x) = 0，则函数 f₁, f₂, …, fₙ 在该区间上线性相关。
For example, the functions 1, x, and 2x + 3 are linearly dependent on any interval because 2x + 3 = 2(x) + 3(1). The Wronskian provides a determinant-based test for differentiability classes of functions, but that is beyond the IB syllabus; for IB, simple observation of algebraic relationships between functions is sufficient.
例如，函数 1、x 与 2x + 3 在任何区间上线性相关，因为 2x + 3 = 2(x) + 3(1)。Wronskian 行列式为可微函数类提供了基于行列式的检验方法，但这超出了 IB 大纲；对于 IB 而言，通过观察函数之间的代数关系即可判断。
12. Summary and Revision Checklist | 总结与复习清单
To determine whether a set of vectors is linearly dependent or independent, follow this checklist:
判断一组向量是否线性相关或线性无关，请遵循以下清单：
- Check if the zero vector is present — if so, the set is dependent. / 检查是否包含零向量——若包含，则集合线性相关。
- Check if any vector is a scalar multiple of another — if so, the set is dependent. / 检查是否存在一个向量是另一个的标量倍——若存在，则集合线性相关。
- If the number of vectors exceeds the dimension of the space, the set is automatically dependent. / 如果向量个数大于空间维数，则集合必然线性相关。
- For n vectors in Rⁿ, compute the determinant of the matrix formed by them. Non-zero determinant ⇒ independent; zero determinant ⇒ dependent. / 对于 Rⁿ 中的 n 个向量，计算由它们构成的矩阵的行列式。行列式非零 ⇒ 线性无关；行列式为零 ⇒ 线性相关。
- For other cases, solve c₁v₁ + … + cₙvₙ = 0. If only the trivial solution exists, the vectors are independent. / 对于其他情况，求解 c₁v₁ + … + cₙvₙ = 0。若仅有平凡解，则向量线性无关。
- Use row reduction to find the rank of the matrix; rank equal to the number of vectors means independence. / 使用行化简求矩阵的秩；秩等于向量个数意味着线性无关。
Mastering these techniques will enable you to handle any linear dependence or independence question confidently in the IB examination.
掌握这些技巧将使你在 IB 考试中自信地应对任何关于线性相关与线性无关的题目。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导