Math 2.0

definition

Semisimple endomorphism

Definition

Let FF be a field, let VV be a finite-dimensional vector space over FF, and let T ⁣:V→VT \colon V \to V be an endomorphism. The map TT is semisimple when, for each TT-invariant subspace WW of VV, there is a TT-invariant subspace W′W' with V=W⊕W′V = W \oplus W'.

Remarks

The map TT is semisimple if and only if its minimal polynomial has no repeated irreducible factor. Over an algebraically closed field, TT is semisimple if and only if it is diagonalisable. The rotation of R2\R^2 by 9090 degrees is semisimple, but it is not diagonalisable over R\R.

Explanations

L1 human

Semisimple maps generalise diagonalisable maps to fields where eigenvalues can be missing. They have no hidden nilpotent part. Over C\C, semisimple simply means diagonalisable.

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 6 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. Vector space definition
  2. Linear map definition
  3. Linear subspace definition
  4. Endomorphism definition
  5. Invariant subspace definition
  6. Semisimple endomorphism definition

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Semisimple_operator, lead section