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
# Every square matrix is similar the sum of a diagonal and a nilpotent matrix.

Put content here**Jordan-Chevalley Decomposition.** Over an algebraically closed field, every square matrix $A$ can be uniquely written as:
$$A = D + N$$
where $D$ is diagonalizable, $N$ is nilpotent, and $DN = ND$.
⏎
Furthermore, both $D$ and $N$ are polynomials in $A$.
⏎
**Example.** For $A = \begin{pmatrix} 3 & 1 \\ 0 & 3 \end{pmatrix}$:
$$A = \underbrace{\begin{pmatrix} 3 & 0 \\ 0 & 3 \end{pmatrix}}_{D} + \underbrace{\begin{pmatrix} 0 & 1 \\ 0 & 0 \end{pmatrix}}_{N}$$
⏎
This decomposition is fundamental in the structure theory of linear operators and Lie algebras.

# Parents

* Nilpotent matrices
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026