| English | 释义 | 拼音 |
|---|---|---|
| matrix equation/ˈmeɪtrɪks ɪˈkweɪʒn/ | 矩阵方程 | jǔ zhèn fāng chéng |
| non-singular/ˌnɒnˈsɪŋɡjʊlə/ | 非奇异 | fēi qí yì |
| singular/ˈsɪŋɡjʊlə/ | 奇异 | qí yì |
| consistent/kənˈsɪstənt/ | 相容 | xiāng róng |
| inconsistent/ˌɪnkənˈsɪstənt/ | 不相容 | bù xiāng róng |
| eigenvector/ˈaɪɡənvektə/ | 特征向量 | tè zhēng xiàng liàng |
| eigenvalue/ˈaɪɡənvæljuː/ | 特征值 | tè zhēng zhí |
| scalar/ˈskeɪlə/ | 标量 | biāo liàng |
| stretch/stretʃ/ | 拉伸 | lā shēn |
| characteristic equation/ˌkærɪktəˈrɪstɪk ɪˈkweɪʒn/ | 特征方程 | tè zhēng fāng chéng |
| diagonalisation/daɪˌæɡənəlaɪˈzeɪʃn/ | 对角化 | duì jiǎo huà |
| diagonal matrix/daɪˈæɡənl ˈmeɪtrɪks/ | 对角矩阵 | duì jiǎo jǔ zhèn |
| linearly independent/ˈlɪnɪəli ˌɪndɪˈpendənt/ | 线性无关 | xiàn xìng wú guān |
| Cayley–Hamilton theorem/ˈkeɪli ˈhæmɪltən ˈθɪərəm/ | 凯莱–哈密顿定理 | kǎi lái – hā mì dùn dìng lǐ |
One map, many repeated moves
- A matrix can describe one change in a model. Repeating the change needs a power such as $A^{20}$; multiplying twenty times hides the structure.
- This lesson joins three tools: solve a matrix equation 矩阵方程, find special vectors, then simplify powers and inverses. Keep track of when a solution or inverse exists.
Put three equations into one matrix
- Put the coefficients of $x,y,z$ in that order in every row. The right-hand side is a column, not another row of the coefficient matrix.
- To read the matrix equation back, multiply each row by the unknown column. A missing variable has coefficient zero.
将x+2y−z=4、3x−z=2和y+z=5写成矩阵方程,然后读出其第二行。
写出方法并在与模型比较前检查所给条件。
Find and check the unique point
- Here $\det C=1\ne0$, so $C$ is non-singular 非奇异: there is exactly one solution. Inverse multiplication is valid, but elimination is shorter here.
- Subtract the first equation from the second to get $y=2$. The first then gives $x+z=4$, and the third gives $2x+3z=11$; hence $(x,y,z)=(1,2,3)$.
Check all three original equations: $1+2+3=6$, $1+4+3=8$ and $2+2+9=13$. Geometrically, the three planes meet at one point. Checking only two planes is not enough.
解方程组x+y+z=7,x+2y+z=10,2x+y+3z=13。验证每个方程并描述交点情况。
写出方法并在与模型比较前检查所给条件。
A zero determinant needs another check
- A singular 奇异 coefficient matrix has determinant zero. The equations may be consistent 相容 (at least one solution) or inconsistent 不相容 (no solution); singular does not mean no solution.
- For $x+y+z=3$ and $x+2y+z=4$, subtraction gives $y=1$, $x+z=2$. A third equation $2x+3y+2z=7$ adds no condition: the common line is $(x,y,z)=(2-t,1,t)$, $t\in\mathbb R$.
Change only the third right-hand side to $8$. Subtracting the first two equations from the third gives $0=1$, so no point lies on all three planes. Pairwise intersections do not prove a common intersection. Coincident planes can also occur; three identical equations leave a whole plane of solutions.

Each panel uses the value of y forced by the first two equations. The remaining lines represent the conditions on x and z.
解x+y+z=5、x+2y+z=7、2x+3y+2z=12。给出所有解并解释几何意义。
写出方法并在与模型比较前检查所给条件。
保留上一题的前两个方程,但将第三个方程的右侧改为13。此时零行列式是否对应一条解直线?
写出方法并在与模型比较前检查所给条件。
Separate exceptional parameter values
- For the system below, subtract row 1 from rows 2 and 3. The determinant is $(a-1)(a+1)$, so only $a=1,-1$ need a separate consistency check.
- If $a\ne\pm1$, then $y=1/(a-1)$, $z=0$ and $x=3-1/(a-1)$. Never divide by $a-1$ or $a+1$ before separating the zero cases.
At $a=1$, $0=1$ is impossible. At $a=-1$, $y=-1/2$ but $z=t$ is free, giving the common line $(x,y,z)=(7/2-t,-1/2,t)$. Both coefficient matrices are singular; only the second system is consistent.
对x+y+z=5、x+ay+z=7、x+y+(a+2)z=5中的每一个实数a进行分类。当解存在时,给出所有解。
写出方法并在与模型比较前检查所给条件。
A special vector stays on its line
- An eigenvector 特征向量 is a non-zero vector $\mathbf e$ with $A\mathbf e=\lambda\mathbf e$. Its eigenvalue 特征值 is the scalar 标量 $\lambda$. Every non-zero multiple of $\mathbf e$ is another eigenvector for the same value.
- A positive eigenvalue can stretch 拉伸 or shorten a vector. A negative value also reverses it; zero sends it to the origin, where direction is undefined. The zero vector is never an eigenvector, although it solves the equation.


将特征向量乘以 A 总是使其旋转 90°。
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
错误。特征向量保持其所在直线:Av = λv,因此 A 仅按特征值 λ 对其进行缩放(若 λ < 0 则反向)。
如果 v 是 A 的一个特征向量,那么 2v 也是 A 的一个特征向量。
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
特征向量不唯一——一个特征向量的任何非零标量倍数也是一个特征向量。
对于 T=diag(−2,0),描述 e₁=(1,0)ᵀ 和 e₂=(0,1)ᵀ 的像。零向量是否为特征向量?
写出方法并在与模型比较前检查所给条件。
Find two eigenvalues and their vectors
- A non-zero solution of $(A-\lambda I)\mathbf e=\mathbf0$ exists when $\det(A-\lambda I)=0$. This is the characteristic equation 特征方程; using $\det(\lambda I-A)=0$ gives the same roots.
- For the matrix below, $\lambda=1$ gives $u+v=0$, so choose $(1,-1)^T$. For $\lambda=3$, $u-v=0$, so choose $(1,1)^T$. Check each by multiplying by $A$.
矩阵(Further Pure 2)
(x', y') = M(x, y)
比较 (1,1) 与 (1, −1) 的像:特征值分别为 3 和 1。一般向量不一定保持在原直线上。
矩阵 [[2,1],[1,2]] 有特征方程 (2−λ)² − 1 = 0,给出 λ = 1 或 λ = 3。较大的特征值是多少?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
(2−λ)² = 1 → 2−λ = ±1 → λ = 1 或 3;较大的是 3。
一个矩阵 A 的特征值通过求解以下哪个找到:
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
特征方程 det(A − λI) = 0 给出特征值。
求 R(行分别为 (3,1)、(1,3))的特征值及每个对应的一个特征向量。展示特征方程。
写出方法并在与模型比较前检查所给条件。
Extend the method to three dimensions
- A triangular matrix has the diagonal entries as eigenvalues: its characteristic determinant is the product of the diagonal factors. Do not row-reduce the original matrix to find its eigenvalues; ordinary row operations need not preserve them.
- For each root below, solve $(B-\lambda I)\mathbf e=0$. At $\lambda=3$, the first row gives $-u+v=0$ and the third gives $w=0$, hence $(1,1,0)^T$.
对于 T(行分别为 (1,2,0)、(0,3,0)、(0,0, −2)),求出所有特征值及其每个对应的一个非零向量。
写出方法并在与模型比较前检查所给条件。
Prove what happens under powers
- Start with $A\mathbf e=\lambda\mathbf e$, not with an inverse of the vector. Then $A^2\mathbf e=A(\lambda\mathbf e)=\lambda^2\mathbf e$; repeating gives $A^n\mathbf e=\lambda^n\mathbf e$ for positive integers $n$.
- Also $(A+cI)\mathbf e=(\lambda+c)\mathbf e$. If $A$ is invertible, $\lambda\ne0$ and multiplication by $A^{-1}$ gives $A^{-1}\mathbf e=\lambda^{-1}\mathbf e$. Positive powers do not require invertibility.
For $B$, the vector $(0,0,1)^T$ has eigenvalue $-1$. Under $B^2$ its eigenvalue is $1$, under $B^3$ it is $-1$, and under $B^{-1}$ it is $-1$. The vector remains non-zero in all these cases.
已知 Ae=λe 且 e≠0,证明 A³e=λ³e。若 A 可逆,亦证明其逆命题结果。哪个论证需要可逆性?
写出方法并在与模型比较前检查所给条件。
Match each column to its eigenvalue
- Diagonalisation 对角化 writes $B=QDQ^{-1}$, where $D$ is a diagonal matrix 对角矩阵. Put eigenvectors in the columns of $Q$, and put their eigenvalues in the same order down $D$.
- $BQ=QD$ checks all three eigenvector equations at once. The columns must be linearly independent 线性无关 so that $Q^{-1}$ exists. Real, distinct eigenvalues guarantee this in the syllabus cases; do not assume every matrix is diagonalisable.

在对角化 A = QDQ⁻¹ 中,矩阵 D 包含:
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
D 是一个对角矩阵,它的主对角线上是 A 的特征值。
对于课程矩阵 B,学生取 Q 列 (1,1,0)ᵀ、(1,0,0)ᵀ、(0,0,1)ᵀ,但 D=diag(2,3, −1)。修正声称 B=QDQ⁻¹。
写出方法并在与模型比较前检查所给条件。
Compute powers without repeated multiplication
- In $(QDQ^{-1})(QDQ^{-1})$, the middle $Q^{-1}Q$ cancels. Thus $B^n=QD^nQ^{-1}$: raise only the diagonal entries of $D$ to the power.
- For $n=0$ this gives $I$; because $B$ is invertible, the same formula holds for negative integers too. Its upper-right block shows why powers of individual entries of $B$ would be wrong.
For the earlier $2\times2$ matrix $A$, choose $Q_A=\begin{pmatrix}1&1\\-1&1\end{pmatrix}$ and $D_A=\operatorname{diag}(1,3)$. Then
如果 A = QDQ⁻¹,那么 A³ = QD³Q⁻¹。如果 D 有对角线条目 1 和 3,D³ 有对角线条目 1 和 ?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
D³ 有对角线条目 1³ = 1 和 3³ = 27。
对于行分别为 (2,1), (1,2) 的矩阵 A,利用对角化计算 A⁴。不要将每个元素分别四次方。
写出方法并在与模型比较前检查所给条件。
对于课程 B,利用其对角形式求 B⁵ 和 B⁻¹。解释为何允许逆幂运算。
写出方法并在与模型比较前检查所给条件。
Reuse the vectors for a changed matrix
- A polynomial $f(B)$ has the same eigenvectors with eigenvalues $f(\lambda)$. Therefore $f(B)=Qf(D)Q^{-1}$; do not change $Q$ merely because the question asks about a shifted or squared matrix.
- For $(B+I)^2$, use $D'=\operatorname{diag}(9,16,0)$ with the same $Q$. It is singular but still diagonalisable. Repeated transformed eigenvalues also do not invalidate an already invertible $Q$.
For $(B-2I)^3$, the diagonal becomes $\operatorname{diag}(0,1,-27)$. For $B^{-1}$ it becomes $\operatorname{diag}(1/2,1/3,-1)$. In every case, keep the order $2,3,-1$ used to build $Q$.
利用课程 B 及其 Q 对 (B−I)² 进行对角化。变换后矩阵有两个特征值重合:这是否阻碍你的方法?
写出方法并在与模型比较前检查所给条件。
Reconstruct a matrix from its eigenvectors
- Given the eigenvectors first, form $Q$ and $D$, then calculate $QDQ^{-1}$. The columns may be scaled separately by non-zero numbers without changing the resulting matrix.
- If $(1,1)^T$ has eigenvalue $4$ and $(1,-1)^T$ has eigenvalue $2$, the calculation below gives $R$. Check $R(1,1)^T=4(1,1)^T$ and $R(1,-1)^T=2(1,-1)^T$.
该矩阵的行向量为 (4, 1) 和 (1, 4)。求其较大的特征值,并解释为何特征向量不是单个向量?
特征值满足方程 (4 减去 lambda) 的平方减 1 等于 0。缩放特征向量不会改变特征值方程。
矩阵 T 具有特征值 1,4, −2,对应的特征向量分别为 (1,0,0)ᵀ, (1,1,0)ᵀ, (0,0,1)ᵀ。重构 T 并验证三个方程。
写出方法并在与模型比较前检查所给条件。
对于 a≠0,取 Q 的列为 (a, 0,0)ᵀ, (1, a, 0)ᵀ, (0,0,1)ᵀ,且 D=diag(1,3, −2)。求 T=QDQ⁻¹ 关于 a 的表达式。
写出方法并在与模型比较前检查所给条件。
A matrix satisfies its own equation
- The Cayley–Hamilton theorem 凯莱–哈密顿定理 states that a square matrix satisfies its characteristic equation. Replace the variable by the matrix and each scalar constant by that constant times $I$.
- For $B$, expanding the three factors gives $\lambda^3-4\lambda^2+\lambda+6=0$. Therefore $B^3-4B^2+B+6I=0$, or $B^3=4B^2-B-6I$.
Use the characteristic equation of the matrix named in the question. Writing $B^3-4B^2+B+6=0$ omits the identity matrix and adds a scalar to a matrix. The theorem does not say that the whole matrix is an eigenvalue.
对于行向量为(3,1),(1,3)的矩阵R,求其特征方程并写出包含所有单位矩阵项的Cayley–Hamilton定理。
写出方法并在与模型比较前检查所给条件。
Reduce higher powers to lower ones
- Multiply the identity for $B^3$ by $B$, then replace $B^3$ again. The answer becomes a combination of $B^2,B,I$, without diagonalising again.
- A shifted cube can be expanded because $B$ and $I$ commute. After expanding, reduce every power of degree three or more using Cayley–Hamilton.
利用R²−6R+8I=0(其中R的行向量为(3,1),(1,3)),将R³表示为R和I的线性组合,并给出其元素。
写出方法并在与模型比较前检查所给条件。
利用B³−4B²+B+6I=0将(B+I)³化简为pB²+qB+rI的形式。求p,q,r的值。
写出方法并在与模型比较前检查所给条件。
Obtain an inverse from Cayley–Hamilton
- $\det B=-6\ne0$, so multiply the characteristic identity by $B^{-1}$ and collect it. This gives an inverse as a polynomial in $B$; do not multiply by an inverse before checking it exists.
- For the $2\times2$ matrix $A$, $A^2-4A+3I=0$ gives $A^{-1}=(4I-A)/3$. Cayley–Hamilton works for both matrix sizes.
An inverse square can simplify further. Multiply the identity for $B^3$ by $B^{-2}$: $B-4I+B^{-1}+6B^{-2}=0$. Substitute the expression for $B^{-1}$ to obtain $B^{-2}=(B^2-10B+25I)/36$.
利用R²−6R+8I=0(其中R的行向量为(3,1),(1,3))求R⁻¹。验证结果。
写出方法并在与模型比较前检查所给条件。
对于课程B,使用凯莱-哈密顿定理将B^⁻²表示为关于B的次数不超过2的多项式。
写出方法并在与模型比较前检查所给条件。
Choose and justify the method
- For three equations: form the coefficient matrix, separate singular parameter values, then solve or prove inconsistency and describe the geometry. For eigenvectors: state non-zero, solve the characteristic equation and match each vector to its root.
- For powers or inverses: choose diagonalisation or Cayley–Hamilton, show the intermediate identity, and check the result. A determinant, a list of roots or a final matrix alone may leave most of the method unexplained.
$C\mathbf x=\mathbf b$ describes simultaneous equations. $A\mathbf e=\lambda\mathbf e$, $\mathbf e\ne0$, describes a special direction. $A=QDQ^{-1}$ requires an invertible eigenvector matrix. Cayley–Hamilton reduces matrix powers and, when the matrix is non-singular, gives its inverse.
较大的特征值是什么?
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
特征值为3和5,因此较大的是5。其他选项——3(较小的特征值,也是课程中较大的特征值);125(较大特征值的立方)。
对于行向量为(1,2,0),(0,3,0),(0,0,−2)的矩阵T,求Q,D,计算T⁴,并利用其特征方程导出T⁻¹。验证至少一个非对角线元素。
写出方法并在与模型比较前检查所给条件。