Abstract Linear Algebra: Eigenvalues & Eigenvectors

Click For Summary
Any linear transformation T: V → V in a finite-dimensional vector space over the complex numbers has at least one eigenvalue and an associated eigenvector. This is established through the characteristic polynomial q(λ) = det(λI - T), where the roots of this polynomial correspond to the eigenvalues. The fundamental theorem of algebra guarantees that every polynomial has at least one root in the complex plane, ensuring the existence of eigenvalues for complex vector spaces. In contrast, for real vector spaces, eigenvalues may not be real, as demonstrated by the example of the matrix [0, -1; 1, 0]. Thus, while complex spaces always yield eigenvalues, real spaces can present limitations.
teme92
Messages
185
Reaction score
2

Homework Statement


Let V be a finite dimensional vector space over ℂ . Show that any linear transformation T:V→V has at least one eigenvalue λ and an associated eigenvector v.

Homework Equations

The Attempt at a Solution


Hey everyone I've been doing sample questions in the build up to an exam and I came across this. Any help would be greatly appreciated as I'm struggling a bit.

Here is what I know:
  • λ is an eigenvalue if there exists a non-zero vector v∈V such that Tv = λv.
  • I also read this for complex: q(λ) = det (λI - T), where the zeros of q(λ) in ℂ are the eigenvalues of T.

What does the second point mean or how would I answer this properly. Thanks in advance.
 
Physics news on Phys.org
teme92 said:
q(λ) = det (λI - T), where the zeros of q(λ) in ℂ are the eigenvalues of T.
That's also true for a vector space over R, every eigenvalue of A is a root of det (λI - A) = 0. (Can you see why?) But in R there might not be any real roots. Of course, you need to show the converse: that a root of the equation is necessarily an eigenvalue.
 
In the complex plane, you are always guaranteed that there will be at least one eigenvalue for your transformation. This is assured by the fundamental theorem of algebra, which states that every polynomial has at least one root in ##\mathbb{C}##.

This is not true in ##\mathbb{R}## though, because the root of the characteristic polynomial might turn out to be complex.

Think about the matrix:

[0, -1
1, 0]

in the real numbers.
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

Replies
5
Views
2K
Replies
2
Views
1K
  • · Replies 24 ·
Replies
24
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 12 ·
Replies
12
Views
2K
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 5 ·
Replies
5
Views
14K