Diagonalization 2: Explaining Theorem 2.5

  • Context: Graduate 
  • Thread starter Thread starter jeff1evesque
  • Start date Start date
  • Tags Tags
    Diagonalization
Click For Summary
SUMMARY

The discussion centers on Theorem 5.2, which states that a scalar λ is an eigenvalue of matrix A in M_n_x_n(F) if and only if det(A - λI_n) = 0. The proof hinges on the existence of a nonzero vector v such that Av = λv, leading to the conclusion that A - λI_n is not invertible. This is directly linked to Theorem 2.5, which establishes the equivalence of linear transformations being one-to-one, onto, and having full rank.

PREREQUISITES
  • Understanding of linear algebra concepts, specifically eigenvalues and eigenvectors.
  • Familiarity with determinants and their properties in matrix theory.
  • Knowledge of linear transformations and their implications on vector spaces.
  • Basic comprehension of the rank-nullity theorem.
NEXT STEPS
  • Study the implications of Theorem 2.5 in various linear algebra contexts.
  • Explore the relationship between eigenvalues and the characteristic polynomial of a matrix.
  • Learn about the invertibility of matrices and its connection to linear transformations.
  • Investigate applications of eigenvalues in systems of differential equations.
USEFUL FOR

Students of linear algebra, mathematicians, and educators seeking to deepen their understanding of eigenvalues and linear transformations.

jeff1evesque
Messages
312
Reaction score
0
I am reading yet another theorem and was wondering If I could get more clarification on it.

Theorem 5.2: Let A be in [tex]M_n_x_n(F)[/tex]. Then a scalar [tex]\lambda[/tex] is an eigenvalue of A if and only if det(A - [tex]\lambda[/tex][tex]I_n[/tex]) = 0.

Proof: A scalar [tex]\lambda[/tex] is an eigenvalue of A if and only if there exists a nonzero vector v in [tex]F^n[/tex] such that Av= [tex]\lambda[/tex]v, that is, (A - [tex]\lambda[/tex][tex]I_n[/tex])(v) = 0. By theorem 2.5, this is true if and only if A - [tex]\lambda[/tex][tex]I_n[/tex] is not invertible. However, this result is equivalent to the statement that det(A - [tex]\lambda[/tex][tex]I_n[/tex]) = 0.

Theorem 2.5: Let V and W be vector spaces of equal (finite) dimension, and let T: V --> W be linear. Then the following are equivalent:
(a.) T is one-to-one.
(b.) T is onto.
(c.) rank(T) = dim(V).

Question: Could someone explain how the following sentence is true: "By theorem 2.5, this is true if and only if A - [tex]\lambda[/tex][tex]I_n[/tex] is not invertible."

Thanks a lot,


JL
 
Physics news on Phys.org
If it were invertible/nonsingular, then the only solution would be the zero vector. But by definition v is a nonzero vector.
 
jeff1evesque said:
I am reading yet another theorem and was wondering If I could get more clarification on it.

Theorem 5.2: Let A be in [tex]M_n_x_n(F)[/tex]. Then a scalar [tex]\lambda[/tex] is an eigenvalue of A if and only if det(A - [tex]\lambda[/tex][tex]I_n[/tex]) = 0.

Proof: A scalar [tex]\lambda[/tex] is an eigenvalue of A if and only if there exists a nonzero vector v in [tex]F^n[/tex] such that Av= [tex]\lambda[/tex]v, that is, (A - [tex]\lambda[/tex][tex]I_n[/tex])(v) = 0. By theorem 2.5, this is true if and only if A - [tex]\lambda[/tex][tex]I_n[/tex] is not invertible. However, this result is equivalent to the statement that det(A - [tex]\lambda[/tex][tex]I_n[/tex]) = 0.

Theorem 2.5: Let V and W be vector spaces of equal (finite) dimension, and let T: V --> W be linear. Then the following are equivalent:
(a.) T is one-to-one.
(b.) T is onto.
(c.) rank(T) = dim(V).

Question: Could someone explain how the following sentence is true: "By theorem 2.5, this is true if and only if A - [tex]\lambda[/tex][tex]I_n[/tex] is not invertible."

Thanks a lot,


JL
I'm not sure why "theorem 2.5" is appended, this is a question about the sentence in theorem 5.2 only isn't it?

In any case, the equation [itex]Av= \lambda v[/itex] is equivalent to [itex]Av- \lambda v= 0[/itex] which is equivalent to [itex](A- \lambda I_n)v= 0[/itex]. If [itex]A- \lambda I_n[/itex] were invertible, we could solve the the equation by multiplying both sides by that inverse: [itex]v= (A- \lambda I_n)^{-1})0[/itex] and, since any linear transformation of the 0 vector is the 0 vector, we must have v= 0, contradicting the fact that there was a non-zero vector satisfying [itex]Av= \lambda v[/itex].
 

Similar threads

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