📚 The Inverse Matrix | 逆矩阵
In matrix algebra, the inverse of a square matrix A is another matrix, denoted A⁻¹, that ‘ ry. In the IB Mathematics curriculum, you are expected to find inverses of 2×2 and 3×3 matrices by hand, interpret the connection between determinant and invertibility, and apply inverses to real problems.
在矩阵代数中，方阵A的逆矩阵是另一个矩阵，记为A⁻¹，它能够“撤销”A的效果。正如一个数乘以它的倒数得到1，一个矩阵乘以其逆矩阵得到单位矩阵。这一概念对于求解线性方程组、理解线性变换以及进行向量几何计算至关重要。在IB数学课程中，你们需要手算2×2和3×3矩阵的逆、理解行列式与可逆性之间的联系，并将逆矩阵应用于实际问题。
1. What Is an Inverse Matrix? | 逆矩阵是什么
An n×n square matrix A is said to be invertible (or non‑ of A and write B = A⁻¹. The inverse is unique; no matrix can have two different inverses.
如果一个n×n方阵A存在一个n×n矩阵B，满足 AB = BA = Iₙ（其中Iₙ是n阶单位矩阵），则称A可逆（或非奇异）。我们称B为A的逆矩阵，记作B = A⁻¹。逆矩阵是唯一的，一个矩阵不可能有两个不同的逆矩阵。
square matrices can have inverses in the standard sense, but not every square matrix is invertible.
由定义可以推出关键性质：Iₙ⁻¹ = Iₙ，且 (A⁻¹)⁻¹ = A。只有方阵才可能在标准意义下拥有逆矩阵，但并非每个方阵都可逆。
2. Why Does the Inverse Matter? | 逆矩阵为何重要
= A⁻¹b. This gives an algebraic method to find the unique solution without row reduction.
一个主要应用是求解矩阵方程。对于写成Ax = b的方程组，如果A可逆，就可以在等式两边左乘A⁻¹，得到x = A⁻¹b。这为寻找唯一解提供了代数的途径，无需行化简。
In geometry, the inverse of a transformation matrix reverses the transformation. If a matrix R represents a rotation or reflection, applying R⁻¹ brings coordinates back to their original positions. This is essential in computer graphics, robotics, and physics simulations.
在几何中，变换矩阵的逆可以逆转变换。如果一个矩阵R表示旋转或反射，应用R⁻¹会把坐标恢复到原始位置。这在计算机图形学、机器人和物理模拟中至关重要。
Inverses also underpin theoretical concepts such as eigenvalues, diagonalisation, and the invertible matrix theorem, all of which feature in the IB Analysis and Approaches HL course.
逆矩阵还是特征值、对角化和可逆矩阵定理等理论概念的基础，这些内容出现在IB数学分析与方法HL课程中。
3. The Determinant and Invertibility | 行列式与可逆性
A square matrix is invertible if and only if its determinant is non‑zero. The determinant, written det(A) or |A| (A) = 0, the transformation collapses the space, making it impossible to reverse uniquely.
方阵可逆的充要条件是其行列式非零。行列式，记作det(A)或|A|，度量了线性变换的缩放因子。如果det(A) = 0，变换会将空间压缩，无法唯一逆转。
x, det(A) = ad − bc. For a 3×3 matrix, the determinant can be expanded by a row or column.
因此，判断逆是否存在时，第一步总是检查行列式。对于2×2矩阵，det(A) = ad − bc。对于3×3矩阵，可按某一行或某一列展开计算行列式。
4. Inverse of a 2×2 Matrix | 二阶矩阵的逆
matrix A = [a b; c d], if det(A) = ad − bc ≠ 0, the inverse is given by a simple formula:
给定一个2×2矩阵 A = [a b; c d]，如果det(A) = ad − bc ≠ 0，其逆矩阵可由一个简单公式给出：
A⁻¹ = (1/(ad − bc)) × [d −b; −c a]
Notice that the elements on the main diagonal are swapped, and the off‑diagonal elements change sign. This pattern is easy to memorise once you have practised a few examples.
注意主对角线元素交换了位置，副对角线元素变号。一旦练习过几个例子，这个模式很容易记住。
A⁻¹ = (1/1) × [3 −1; −5 2] = [3 −1; −5 2]. You can verify by multiplication: A × A⁻¹ = I₂.
例如，若A = [2 1; 5 3]，则det(A) = 2×3 − 1×5 = 1。因此A⁻¹ = (1/1) × [3 −1; −5 2] = [3 −1; −5 2]。可通过乘法验证：A × A⁻¹ = I₂。
5. Inverse of a 3×3 Matrix (Cofactor Method) | 三阶矩阵的逆（伴随矩阵法）
transpose of the cofactor matrix. This method is systematic but requires careful arithmetic.
对于三阶矩阵，求逆需用到伴随矩阵和行列式。公式为 A⁻¹ = (1/det(A)) × adj(A)，其中adj(A)是余子式矩阵的转置。该方法系统性强，但需要仔细运算。
Steps: (1) Compute det(A). If det(A) = 0, stop – anspose this cofactor matrix to get adj(A). (5) Multiply each entry of adj(A) by 1/det(A).
步骤：(1) 计算det(A)。如果det(A)=0，停止——无逆。(2) 建立子式矩阵。(3) 给子式矩阵加上棋盘符号模式（+ − +; − + −; + − +）得到余子式矩阵。(4) 将余子式矩阵转置，得到adj(A)。(5) 将adj(A)的每个元素乘以1/det(A)。
A worked example is shown later in the practice section. The key is to reduce arithmetic errors by double‑checking each cofactor and the determinant.
具体的演算示例将在后面的练习部分展示。关键在于通过反复核对每个余子式和行列式来减少算术错误。
6. Solving Linear Systems with the Inverse | 利用逆矩阵解线性方程组
= A⁻¹b. This directly gives the solution vector without using elimination or substitution.
考虑一个n个未知数n个方程的线性方程组，写成Ax = b。如果A可逆，唯一解就是x = A⁻¹b。这能直接给出解向量，无需消元或代入。
computed earlier, [x; y] = [3 −1; −5 2][5; 13] = [3×5 + (−1)×13; (−5)×5 + 2×13] = [2; 1].
例如，方程组2x + y = 5, 5x + 3y = 13可表示为[2 1; 5 3][x; y] = [5; 13]。用先前求得的系数矩阵的逆，[x; y] = [3 −1; −5 2][5; 13] = [15−13; −25+26] = [2; 1]。
This method is extremely efficient when the same coefficient matrix is used with several different right‑hand sides, because the inverse only needs to be calculated once.
当同一个系数矩阵用于几个不同的右端项时，这一方法极其高效，因为逆矩阵只需要计算一次。
7. Properties of Inverses: Product, Transpose, Scalar | 逆矩阵的性质：乘积、转置、数乘
)⁻¹ = B⁻¹A⁻¹. The order is reversed, so be careful. For a scalar k ≠ 0, (kA)⁻¹ = (1/k)A⁻¹.
有几个代数规则使逆矩阵的运算变得简单。如果A和B是同阶可逆矩阵，那么 (AB)⁻¹ = B⁻¹A⁻¹。顺序是反的，务必注意。对于非零标量k，有 (kA)⁻¹ = (1/k)A⁻¹。
For the transpose, (Aᵀ)⁻¹ = (A⁻¹)ᵀ inverse. This property is useful when proving symmetry in statistics or physics contexts.
对于转置，有 (Aᵀ)⁻¹ = (A⁻¹)ᵀ。这意味着转置的逆等于逆的转置。在统计或物理情境下证明对称性时，这一性质很有用。
Remember that (A + B)⁻¹ is NOT generally equal to A⁻¹ + B⁻¹, a common mistake. Inverses do not distribute over addition.
记住 (A + B)⁻¹ 一般不等于 A⁻¹ + B⁻¹，这是一个常见错误。逆矩阵对加法没有分配律。
8. Geometric Interpretation of the Inverse | 逆矩阵的几何解释
Every invertible matrix corresponds to a linear transformation that maps ℝⁿ to itself in a one‑to‑one and onto fashion. The inverse transformation then maps the image back to the pre‑image. If A scales areas by a factor of det(A), then A⁻¹ scales areas by a factor of 1/det(A).
每个可逆矩阵对应一个将ℝⁿ映射到自身的一一满射的线性变换。逆变换则把像映射回原像。如果A将面积缩放 det(A) 倍，那么A⁻¹将面积缩放 1/det(A) 倍。
ts inverse is simply its transpose, which corresponds to a rotation by −θ. Indeed, R⁻¹ = Rᵀ = [cosθ sinθ; −sinθ cosθ].
例如，一个2×2旋转矩阵 R = [cosθ −sinθ; sinθ cosθ] 有 det(R)=1，它的逆就是它的转置，对应旋转−θ角。实际上，R⁻¹ = Rᵀ = [cosθ sinθ; −sinθ cosθ]。
You can also think of the inverse as ‘undoing’ a shearing or stretching action. This geometric view aids understanding of why a zero determinant means the space is collapsed, so no unique reverse transformation exists.
也可以把逆看作“撤销”剪切或拉伸操作。这种几何视角有助于理解为什么行列式为零意味着空间被压缩，从而不存在唯一的逆变换。
9. Using a GDC to Find Inverses | 使用图形计算器求逆矩阵
IB exams, you are expected to find inverses both by hand and with a calculator. On the TI‑84 or TI‑ erse instantly. This is particularly useful for checking your manual work on 3×3 matrices.
在IB考试中，既要会手算逆矩阵，也要会用计算器。在TI‑84或TI‑Nspire上，你可以输入矩阵，然后按x⁻¹键立即得到逆矩阵。这对于核对3×3矩阵的手算结果尤其有用。
However, be cautious: a calculator may give decimal approximations, while the exact fractional form is usually required. Understand how to convert, and never blindly copy a calculator display if an exact answer can be obtained by hand.
但要小心：计算器可能给出小数近似值，而题目通常要求精确的分数形式。要理解如何转换，切勿在手算可得到精确答案时盲目照抄计算器显示。
Also, use the GDC to compute determinants quickly, which tells you immediately whether a matrix is invertible without having to complete the entire inverse process.
此外，可以利用图形计算器快速计算行列式，这样就能立即知道一个矩阵是否可逆，无需完成整个求逆过程。
10. Common Mistakes and How to Avoid Them | 常见错误及如何避免
Forgetting to check the determinant: Always write det(A) first. If it is zero, stop.
忘记检查行列式：一定要先写det(A)。如果为零，就停止。
Sign errors in the 2×2 formula: The pattern is [d −b; −c a], not [d b; c a].
二阶公式中的符号错误：模式是 [d −b; −c a]，而不是 [d b; c a]。
handling the cofactor sign pattern for 3×3: Use the checkerboard starting with + at (1,1).
三阶余子式符号模式处理错误：使用棋盘规则，从(1,1)处的+开始。
Omitting the transpose when forming adj(A): The adjugate is the transpose of the cofactor matrix, not the cofactor matrix itself.
构建adj(A)时遗漏转置：伴随矩阵是余子式矩阵的转置，而非余子式矩阵本身。
Applying (A + B)⁻¹ = A⁻¹ + B⁻¹: This is false. Test with simple matrices to see why.
套用 (A + B)⁻¹ = A⁻¹ + B⁻¹：这是错误的。用简单矩阵测试一下就能明白。
11. Worked Example 1: 2×2 Inverse and System | 示例1：二阶逆矩阵及方程组
Problem: Find the inverse of M = [4 2; 7 3] and use it to solve 4x + 2y = 8, 7x + 3y = 13.
题目：求M = [4 2; 7 3]的逆矩阵，并用它解方程组 4x + 2y = 8, 7x + 3y = 13。
Step 1: det(M) = 4×3 − 2×7 = 12 − 14 = −2. Since det(M) ≠ 0, M is invertible.
第一步：det(M) = 4×3 − 2×7 = 12 − 14 = −2。由于det(M) ≠ 0，M可逆。
Step 2: M⁻¹ = (1/−2) × [3 −2; −7 4] = [−1.5 1; 3.5 −2] or in fractions, [−3/2 1; 7/2 −2].
第二步：M⁻¹ = (1/−2) × [3 −2; −7 4] = [−1.5 1; 3.5 −2] 或写成分数 [−3/2 1; 7/2 −2]。
so [x; y] = M⁻¹[8; 13] = [−3/2×8 + 1×13; 7/2×8 + (−2)×13] = [−12 + 13; 28 − 26] = [1; 2].
第三步：方程组为 M[x; y] = [8; 13]，所以 [x; y] = M⁻¹[8; 13] = [−12+13; 28−26] = [1; 2]。
12. Worked Example 2: 3×3 Inverse | 示例2：三阶逆矩阵
Problem: Compute the inverse of A = [2 1 3; 0 −1 2; 4 1 0] if it exists.
题目：若存在，求A = [2 1 3; 0 −1 2; 4 1 0]的逆矩阵。
) = (−1)·(0−12) + 2·(2−4) = (−1)(−12) + 2(−2) = 12 − 4 = 8. det(A) ≠ 0, so inverse exists.
第一步：为方便，按第二行展开行列式：det(A) = 0·... + (−1)·(2×0−3×4) + 2·(2×1−1×4) = (−1)(−12) + 2(−2) = 12−4 = 8。det(A) ≠ 0，故逆存在。
Step 2: Compute the matrix of minors, then cofactors, then transpose to get adj(A). The cofactor matrix (with checkerboard signs) is:
[+ ( −1×0 − 2×1 ) − ( 0×0 − 2×4 ) + ( 0×1 − (−1)×4 );
− ( 1×0 − 3×1 ) + ( 2×0 − 3×4 ) − ( 2×1 − 1×4 );
+ ( 1×2 − 3×(−1) ) − ( 2×2 − 3×0 ) + ( 2×(−1) − 1×0 )]
= [+(−2) −(8) +(4); −(−3) +(−12) −(−2); +(5) −(4) +(−2)]
= [−2 −8 4; 3 −12 2; 5 −4 −2].
第二步：计算子式矩阵，然后变成余子式矩阵，再转置得到adj(A)。余子式矩阵（带上棋盘符号）为： [+ ( −1×0 − 2×1 ) − ( 0×0 − 2×4 ) + ( 0×1 − (−1)×4 ); − ( 1×0 − 3×1 ) + ( 2×0 − 3×4 ) − ( 2×1 − 1×4 ); + ( 1×2 − 3×(−1) ) − ( 2×2 − 3×0 ) + ( 2×(−1) − 1×0 )] = [−2 −8 4; 3 −12 2; 5 −4 −2]。
A⁻¹ = [−1/4 3/8 5/8; −1 −3/2 −1/2; 1/2 1/4 −1/4]. This can be verified by multiplication.
转置得adj(A) = [−2 3 5; −8 −12 −4; 4 2 −2]。第三步：A⁻¹ = (1/8) × adj(A)。因此A⁻¹ = [−1/4 3/8 5/8; −1 −3/2 −1/2; 1/2 1/4 −1/4]。可通过乘法验证。
Published by TutorHao | IB Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图