Dashboard

Featured nodes

Roots

  • Public root

Templates

  • Test template
  • iCorps template
  • Guanyu's Latex template
  • Ivar's latex template
  • Family Tree template
  • Latex template
  • Router template

Trees

  • Public trees

Orphans

  • Browse orphan nodes
Related nodes

Parents1

  • Nilpotent matrices

Siblings5
  • Sort by title
  • Sort by date

  • Definition of nilpotent matrix
  • Every nilpotent matrix is similar to one with 1 on subdiagonal blocks and all other entries 0.
  • A matrix is nilpotent if and only if its only eigenvalue is 0.
  • Definition of index of nilpotency
  • Every square matrix is similar the sum of a diagonal and a nilpotent matrix.
Knowenβ
  • Help
    • Welcome to Knowen!
    • Edit test node (no login required)
    • Create new test node (no login required)
  • Not logged in
    • Sign in
    • Sign up

History & Comments

Back

Fill content

Description:Added mathematical content
# Definition of index of nilpotency

Put content here**Definition.** The *index of nilpotency* of a nilpotent matrix $A$ is the smallest positive integer $k$ such that $A^k = 0$ but $A^{k-1} \neq 0$.
⏎
**Properties:**
- For an $n \times n$ nilpotent matrix, the index of nilpotency is at most $n$
- The index equals the size of the largest Jordan block in the Jordan canonical form of $A$
- The index equals the degree of the minimal polynomial of $A$
⏎
**Example.** $A = \begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{pmatrix}$ has index 2 since $A^2 = 0$ but $A \neq 0$.
⏎
**Example.** The $n \times n$ shift matrix with 1 on the superdiagonal has index $n$.

# Parents

* Nilpotent matrices
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026