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

  • Eigenvalues and eigenvectors

Siblings22
  • Sort by title
  • Sort by date

  • Particular types of matrices
  • Definition of eigenvalue of a matrix
  • Definition of eigenvector of a matrix
  • Eigenspaces
  • Every matrix has an eigenvalue over the complex numbers.
  • Eigenvalues and operations on matrices
  • Eigenvectors with distinct eigenvalues are linearly independent.
  • Multiplicity
  • Characteristic and minimal polynomials
  • The dimension of a eigenspace is less than or equal to the (algebraic) multiplicity of the eigenvalue.
  • Definition of eigenvalue/characteristic value of a linear transformation
  • Definition of eigenvector/characteristic vector of a linear transformation
  • Definition of characteristic polynomial of a linear transformation
  • Definition of minimal polynomial of a linear transformation
  • The Cayley-Hamilton theorem for a linear transformation
  • The minimal polynomial of a linear transformation exists and is unique.
  • Definition of applying a polynomial to a linear transformation
  • A linear transformation on a finite dimentional nontrivial vector space has at least one eigenvalue.
  • Definition of eigenspace of a linear transformation
  • The eigenspace of a linear transformation is a nontrivial subspace.
  • Definition of invariant subspace of a linear transformation.
  • If a space is the direct sum of invariant subspaces
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 eigenvalue existence theorem
# A linear transformation on a finite dimentional nontrivial vector space has at least one eigenvalue.

Put content here**Theorem:** Every linear transformation \(T: V 	o V\) on a finite-dimensional nontrivial vector space (\(\dim V \geq 1\)) over an algebraically closed field (such as \(\mathbb{C}\)) has at least one eigenvalue.
⏎
**Proof sketch:** The characteristic polynomial \(p_T(\lambda) = \det(A - \lambda I)\) is a polynomial of degree \(n = \dim V \geq 1\). By the Fundamental Theorem of Algebra, every non-constant polynomial over \(\mathbb{C}\) has at least one root. That root is an eigenvalue.
⏎
**Important caveat:** Over \(\mathbb{R}\), this may fail. For example, the rotation \(T(x,y) = (-y, x)\) in \(\mathbb{R}^2\) has characteristic polynomial \(\lambda^2 + 1\), which has no real roots. The same transformation over \(\mathbb{C}\) has eigenvalues \(i\) and \(-i\).
⏎
**Consequence:** This theorem guarantees that eigenvalue analysis is always possible when working over \(\mathbb{C}\).

# Parents

* Eigenvalues and eigenvectors
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026