Math 2.0

statement theorem

Cayley–Hamilton theorem

Statement

Let KK be a commutative ring, let n≥1n \ge 1, and let AA be an n×nn \times n matrix over KK with characteristic polynomial pA(t)=det⁡(tIn−A)p_A(t) = \det(t I_n - A). Then pA(A)=0,p_A(A) = 0, where pA(A)p_A(A) is the value of pAp_A at AA.

Remarks

For n=2n = 2, it says A2−(tr⁡A)A+(det⁡A)I2=0A^2 - (\tr A) A + (\det A) I_2 = 0. Substituting t=At = A into det⁡(tIn−A)\det(t I_n - A) is not a valid proof, because pA(A)p_A(A) is a matrix and det⁡(A−A)\det(A - A) is a scalar. One proof uses the adjugate identity (tIn−A)adj⁡(tIn−A)=pA(t)In(t I_n - A) \operatorname{adj}(t I_n - A) = p_A(t) I_n. If AA is invertible, then the theorem expresses A−1A^{-1} as a polynomial in AA.

Explanations

L1 human

Every square matrix satisfies its own characteristic polynomial. For A=(1234)A = \begin{pmatrix} 1 & 2 \\ 3 & 4 \end{pmatrix}, the polynomial is t2−5t−2t^2 - 5t - 2, so A2=5A+2IA^2 = 5A + 2I. So every power of AA is a combination of II and AA.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 12 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Identity matrix object
  2. Matrix definition
  3. Vector space definition
  4. Square matrix definition
  5. Linear map definition
  6. Endomorphism definition
  7. Multilinear map definition
  8. Polynomial of an endomorphism definition
  9. Alternating multilinear map definition
  10. Determinant definition
  11. Characteristic polynomial definition
  12. Cayley–Hamilton theorem statement

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Cayley–Hamilton_theorem, lead section