Math 2.0

statement theorem

Simultaneous diagonalisation

Statement

Let FF be a field and let AA and BB be diagonalisable n×nn \times n matrices over FF. Then there is one invertible n×nn \times n matrix PP such that both P−1APP^{-1} A P and P−1BPP^{-1} B P are diagonal if and only if AB=BAAB = BA.

Remarks

Diagonal matrices commute, so the condition AB=BAAB = BA is necessary. For sufficiency, BB maps each eigenspace of AA to itself, and it is diagonalisable on each of them. The same holds for each family of pairwise commuting diagonalisable matrices.

Explanations

L1 human

Two diagonalisable matrices can be diagonalised by the same change of basis exactly when they commute. Then they share a basis of eigenvectors. This fact is important in quantum mechanics, where commuting observables can be measured together.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (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 9 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. Matrix multiplication definition
  4. Square matrix definition
  5. Invertible matrix definition
  6. Diagonal matrix definition
  7. Similar matrices definition
  8. Diagonalisable matrix definition
  9. Simultaneous diagonalisation statement

Sources

  1. Web https://en.wikipedia.org/wiki/Diagonalizable_matrix, Simultaneous diagonalization