Poirot1
- 243
- 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 ?
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.
PREREQUISITESMathematicians, students of linear algebra, and anyone interested in the theoretical foundations of eigenvalues and eigenvectors in finite-dimensional spaces.
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)$.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 ?