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
# A matrix is nilpotent if and only if its only eigenvalue is 0.

Put content here**Theorem.** A square matrix $A$ is nilpotent if and only if its only eigenvalue is 0.
⏎
**Proof ($\Rightarrow$):** If $A^k = 0$ and $Av = \lambda v$ with $v \neq 0$, then $A^k v = \lambda^k v = 0$, so $\lambda = 0$.
⏎
**Proof ($\Leftarrow$):** If 0 is the only eigenvalue, the characteristic polynomial is $\det(\lambda I - A) = \lambda^n$. By the Cayley-Hamilton theorem, $A^n = 0$, so $A$ is nilpotent.
⏎
**Example.** $A = \begin{pmatrix} 0 & 1 & 2 \\ 0 & 0 & 3 \\ 0 & 0 & 0 \end{pmatrix}$ has only eigenvalue 0 (upper triangular with zeros on diagonal), so $A^3 = 0$.

# Parents

* Nilpotent matrices
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026