Math 2.0

Linear and multilinear algebra; matrix theory Definition

Nilpotent matrix

Builds on Square 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.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Matrix definition
  2. Square matrix definition
  3. Nilpotent matrix definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Nilpotent_matrix, lead section
About this page
Tag0419GJC84P
URIm2://0419GJC84P
Kinddefinition
WritingW1 stated
MSC15A99
DefinesNilpotent matrix
UsesSquare matrix

Markdown · JSON · Edit on GitHub

What this page 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 page is. They do not measure its truth.

What links here

No page links to this page yet.