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

  • Triangular matrices

Siblings5
  • Sort by title
  • Sort by date

  • Definition of an upper triangular matrix
  • Definition of a lower triangular matrix
  • The product of upper/lower triangular matrices is upper/lower triangular.
  • The inverse of an invertible upper/lower triangular matrix is upper/lower triangular.
  • Every square matrix is conjugate
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 conjugate

Put content here**Theorem (Schur).,** Every square matrix over $\mathbb{C}$ is *similar* to an upper triangular matrix. That is, for any $A \in M_n(\mathbb{C})$, there exists an invertible matrix $P$ such that $P^{-1}AP = T$, where $T$ is upper triangular.
⏎
The diagonal entries of $T$ are the eigenvalues of $A$ (with algebraic multiplicity).
⏎
**Proof idea.** Proceed by induction on $n$. Choose an eigenvector $v_1$ of $A$, extend it to a basis, and work in that basis to produce a block form, then apply the inductive hypothesis.
⏎
**Corollary.** Every complex matrix has at least one eigenvalue (since the characteristic polynomial of $T$ factors as $\prod (\lambda - t_{ii})$).
⏎
**Example.** For $A = \begin{pmatrix} 0 & -1 \\ 1 & 0 \end{pmatrix}$, the eigenvalues are $\pm i$, and $A$ is similar to an upper triangular matrix with $i$ and $-i$ on the diagonal.

# Parents

* Triangular matrices
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026