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 nilpotent matrix

Put content here.**Definition.** A square matrix $A$ is *nilpotent* if there exists a positive integer $k$ such that $A^k = 0$.
⏎
The smallest such $k$ is called the *index of nilpotency*.
⏎
**Example.** $A = \begin{pmatrix} 0 & 1 \\ 0 & 0 \end{pmatrix}$ is nilpotent with index 2, since $A^2 = 0$ but $A \neq 0$.
⏎
**Example.** $A = \begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \end{pmatrix}$ is nilpotent with index 3.
⏎
**Properties:**
- The only eigenvalue of a nilpotent matrix is 0
- $\det(A) = 0$ and $\text{tr}(A) = 0$
- The product of commuting nilpotent matrices is nilpotent
- A nilpotent matrix is never invertible (except the $0 \times 0$ case)

# Parents

* Nilpotent matrices
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026