Proof of Eigenvector Existence for Linear Maps on Finite-Dimensional Spaces

  • Context: MHB 
  • Thread starter Thread starter Poirot1
  • Start date Start date
  • Tags Tags
    Invariant Subspace
Click For Summary
SUMMARY

Every linear map T: V -> V, where V is a finite-dimensional vector space with dimension greater than one, has an eigenvector if V is over an algebraically closed field, such as the complex numbers. The proof hinges on the determinant condition, where the equation (T - λI)x = 0 must have a nonzero solution x, which occurs when det(T - λI) = 0. Since this is a polynomial equation of degree n, it guarantees at least one root in the complex field, confirming the existence of an eigenvector.

PREREQUISITES
  • Understanding of linear maps and vector spaces
  • Familiarity with eigenvalues and eigenvectors
  • Knowledge of determinants and polynomial equations
  • Concept of algebraically closed fields, specifically complex numbers
NEXT STEPS
  • Study the properties of eigenvalues and eigenvectors in linear algebra
  • Explore the implications of algebraically closed fields in vector spaces
  • Learn about the characteristic polynomial and its role in determining eigenvalues
  • Investigate examples of linear transformations in real and complex vector spaces
USEFUL FOR

Mathematicians, students of linear algebra, and anyone interested in the theoretical foundations of eigenvalues and eigenvectors in finite-dimensional spaces.

Poirot1
Messages
243
Reaction score
0
From wikipedia I read that every linear map from T:V->V, where V is finite dimensional and dim(V) > 1 has an eigenvector. What is the proof ?
 
Physics news on Phys.org
Poirot said:
From wikipedia I read that every linear map from T:V->V, where V is finite dimensional and dim(V) > 1 has an eigenvector. What is the proof ?
This result is only true if V is a vector space over an algebraically closed field, such as the complex numbers. For example, the map $T:\mathbb{R}^2 \to \mathbb{R}^2$ with matrix $\begin{bmatrix}0&1 \\-1&0\end{bmatrix}$ represents the operation of rotation through a right angle, and it is fairly obvious that there are no nonzero vectors in $\mathbb{R}^2$ whose direction is left unchanged by this map. However, if you allow complex scalars then $(1,i)$ is an eigenvector, with eigenvalue $i$, because $T(1,i) = (i,-1) = i(1,i)$.

So assume that V is a complex vector space. The definition of an eigenvector $x$, with eigenvalue $\lambda$, is that $x\ne0$ and $Tx = \lambda x$. Then the equation $(T-\lambda I)x = 0$ has the nonzero solution $x$, the condition for which is that $\det(T-\lambda I) = 0$. But that is a polynomial equation of degree $n$, and therefore has a root (because $\mathbb{C}$ is algebraically closed).
 
Last edited:

Similar threads

  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K