# Nilpotent matrix

In linear algebra, a nilpotent matrix is a square matrix N such that

$N^{k}=0\,$ for some positive integer k. The smallest such k is sometimes called the degree of N.

More generally, a nilpotent transformation is a linear transformation L of a vector space such that Lk = 0 for some positive integer k (and thus, Lj = 0 for all jk). Both of these concepts are special cases of a more general concept of nilpotence that applies to elements of rings.

## Examples

The matrix

$M={\begin{bmatrix}0&1\\0&0\end{bmatrix}}$ is nilpotent, since M2 = 0. More generally, any triangular matrix with 0s along the main diagonal is nilpotent. For example, the matrix

$N={\begin{bmatrix}0&2&1&6\\0&0&1&2\\0&0&0&3\\0&0&0&0\end{bmatrix}}$ is nilpotent, with

$N^{2}={\begin{bmatrix}0&0&2&7\\0&0&0&3\\0&0&0&0\\0&0&0&0\end{bmatrix}};\ N^{3}={\begin{bmatrix}0&0&0&6\\0&0&0&0\\0&0&0&0\\0&0&0&0\end{bmatrix}};\ N^{4}={\begin{bmatrix}0&0&0&0\\0&0&0&0\\0&0&0&0\\0&0&0&0\end{bmatrix}}.$ Though the examples above have a large number of zero entries, a typical nilpotent matrix does not. For example, the matrix

$N={\begin{bmatrix}5&-3&2\\15&-9&6\\10&-6&4\end{bmatrix}}$ squares to zero, though the matrix has no zero entries.

## Characterization

For an n × n square matrix N with real (or complex) entries, the following are equivalent:

The last theorem holds true for matrices over any field of characteristic 0 or sufficiently large characteristic. (cf. Newton's identities)

This theorem has several consequences, including:

• The degree of an n × n nilpotent matrix is always less than or equal to n. For example, every 2 × 2 nilpotent matrix squares to zero.
• The determinant and trace of a nilpotent matrix are always zero.
• The only nilpotent diagonalizable matrix is the zero matrix.

## Classification

Consider the n × n shift matrix:

$S={\begin{bmatrix}0&1&0&\ldots &0\\0&0&1&\ldots &0\\\vdots &\vdots &\vdots &\ddots &\vdots \\0&0&0&\ldots &1\\0&0&0&\ldots &0\end{bmatrix}}.$ This matrix has 1s along the superdiagonal and 0s everywhere else. As a linear transformation, the shift matrix “shifts” the components of a vector one slot to the left:

$S(x_{1},x_{2},\ldots ,x_{n})=(x_{2},\ldots ,x_{n},0).$ This matrix is nilpotent with degree n, and is the “canonical” nilpotent matrix.

Specifically, if N is any nilpotent matrix, then N is similar to a block diagonal matrix of the form

${\begin{bmatrix}S_{1}&0&\ldots &0\\0&S_{2}&\ldots &0\\\vdots &\vdots &\ddots &\vdots \\0&0&\ldots &S_{r}\end{bmatrix}}$ where each of the blocks S1S2, ..., Sr is a shift matrix (possibly of different sizes). This theorem is a special case of the Jordan canonical form for matrices.

For example, any nonzero 2 × 2 nilpotent matrix is similar to the matrix

${\begin{bmatrix}0&1\\0&0\end{bmatrix}}.$ That is, if N is any nonzero 2 × 2 nilpotent matrix, then there exists a basis b1b2 such that Nb1 = 0 and Nb2 = b1.

This classification theorem holds for matrices over any field. (It is not necessary for the field to be algebraically closed.)

## Flag of subspaces

A nilpotent transformation L on Rn naturally determines a flag of subspaces

$\{0\}\subset \ker L\subset \ker L^{2}\subset \ldots \subset \ker L^{q-1}\subset \ker L^{q}=\mathbb {R} ^{n}$ and a signature

$0=n_{0} The signature characterizes L up to an invertible linear transformation. Furthermore, it satisfies the inequalities

$n_{j+1}-n_{j}\leq n_{j}-n_{j-1},\qquad {\mbox{for all }}j=1,\ldots ,q-1.$ Conversely, any sequence of natural numbers satisfying these inequalities is the signature of a nilpotent transformation.

$(I+N)^{-1}=I-N+N^{2}-N^{3}+\cdots ,$ where only finitely many terms of this sum are nonzero.
• If N is nilpotent, then
$\det(I+N)=1,\!\,$ where I denotes the n × n identity matrix. Conversely, if A is a matrix and
$\det(I+tA)=1\!\,$ for all values of t, then A is nilpotent.

## Generalizations

A linear operator T is locally nilpotent if for every vector v, there exists a k such that

$T^{k}(v)=0.\!\,$ For operators on a finite-dimensional vector space, local nilpotence is equivalent to nilpotence.
{"ft_lang_label":"__label__en","ft_lang_prob":0.8657848,"math_prob":0.998957,"size":3469,"snap":"2021-31-2021-39","text_gpt3_token_len":842,"char_repetition_ratio":0.16536796,"word_repetition_ratio":0.022875817,"special_character_ratio":0.22398385,"punctuation_ratio":0.120300755,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99923277,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-07-30T20:04:41Z\",\"WARC-Record-ID\":\"<urn:uuid:b796dd1a-5bff-4368-b23b-80f2f7c1cc68>\",\"Content-Length\":\"150013\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d55d5ddc-356b-4efa-88c7-9f2241b9a84a>\",\"WARC-Concurrent-To\":\"<urn:uuid:12d2177e-f214-4c0d-8222-84f81a8376e9>\",\"WARC-IP-Address\":\"132.195.228.228\",\"WARC-Target-URI\":\"https://formulasearchengine.com/wiki/Nilpotent_matrix\",\"WARC-Payload-Digest\":\"sha1:MNWLEK5RO5RLFOFSUPXEGTOXQNREQN7P\",\"WARC-Block-Digest\":\"sha1:LMUOBD2E5GGWW4QTL2HXZBMO5BRY7H4F\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-31/CC-MAIN-2021-31_segments_1627046153980.55_warc_CC-MAIN-20210730185206-20210730215206-00524.warc.gz\"}"}