Math 2.0

definition

Nilpotent matrix

Definition

Let RR be a ring and let NN be an n×nn \times n square matrix over RR. The matrix NN is nilpotent when Nk=0N^k = 0 for some integer k≥1k \ge 1. The least such kk is the index of NN.

Remarks

The matrix (0100)\begin{pmatrix} 0 & 1 \\ 0 & 0 \end{pmatrix} is nilpotent of index 22. Each strictly upper triangular matrix is nilpotent. Over a field, an n×nn \times n matrix NN is nilpotent if and only if its characteristic polynomial is xnx^n; then Nn=0N^n = 0. The only eigenvalue of a nilpotent matrix over a field is 00, so its trace and determinant are 00.

Explanations

L1 human

A nilpotent matrix becomes the zero matrix after we multiply it by itself enough times. A shift that moves each coordinate one step down, and drops the last one, is an example. After nn shifts nothing is left.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (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 3 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. Matrix definition
  2. Square matrix definition
  3. Nilpotent matrix definition

Sources

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