Eigenspace and lin dependency proof

  • Context: Graduate 
  • Thread starter Thread starter EvLer
  • Start date Start date
  • Tags Tags
    Proof
Click For Summary

Discussion Overview

The discussion revolves around the linear independence of eigenvectors and the concept of eigenspaces in linear algebra. Participants explore the conditions under which eigenvectors are considered linearly independent, the implications of linear dependence for matrices, and the proofs related to these concepts.

Discussion Character

  • Technical explanation
  • Debate/contested

Main Points Raised

  • Some participants question how it is proven that eigenvectors of a matrix form a linearly independent set within its eigenspace.
  • One participant suggests that the technique of finding eigenvectors may eliminate linearly dependent vectors, but this is not universally accepted.
  • Another participant provides a proof from a textbook that argues distinct eigenvectors corresponding to distinct eigenvalues are linearly independent, but this proof is challenged by others.
  • Some participants point out that eigenvectors can be linearly dependent, using examples such as scalar multiples of the same vector.
  • There is confusion regarding the implications of linear dependence on the deficiency of a matrix, with some participants suggesting that if eigenvectors are dependent, the matrix is deficient.
  • One participant expresses confusion about finding eigenvectors for a specific case involving the identity matrix and its eigenvalues.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the linear independence of eigenvectors. There are competing views on whether eigenvectors can be linearly dependent, particularly in the context of distinct eigenvalues and the implications for matrix deficiency.

Contextual Notes

Limitations in the discussion include assumptions about the definitions of eigenvectors and eigenspaces, as well as the conditions under which linear independence is established. Some mathematical steps and definitions remain unresolved.

Who May Find This Useful

This discussion may be useful for students and practitioners of linear algebra, particularly those interested in the properties of eigenvectors and their applications in various mathematical contexts.

EvLer
Messages
454
Reaction score
0
I have these questions and cannot find a proof in the textbook:

when one finds eigenvectors of a matrix they form its eigenspace, i.e. they are lin indep, how is it proved?

And also a matrix is deficient, when one does not get "enough" eigenvectors to span R^n, so maybe I am wrong, but it seems that the technique of finding eigenvectors eliminates lin dependent eigenvectors if there were such. How so?

Thanks as usual!
 
Physics news on Phys.org
[tex] u_1 X_1+u_2 X_2+u_3 X_3+...=<br /> u_1\begin{array}{| c |} <br /> x_{1,1}\\<br /> x_{1,2}\\<br /> x_{1,3}\\<br /> .\\<br /> .\\<br /> .\\<br /> \end{array} +<br /> u_2\begin{array}{| c |} <br /> x_{2,1}\\<br /> x_{2,2}\\<br /> x_{2,3}\\<br /> .\\<br /> .\\<br /> .\\<br /> \end{array} +<br /> u_3\begin{array}{| c |} <br /> x_{3,1}\\<br /> x_{3,2}\\<br /> x_{3,3}\\<br /> .\\<br /> .\\<br /> .\\<br /> \end{array}...=<br /> \begin{array}{| c c c c |} <br /> x_{1,1}&x_{2,1}&x_{3,1}&...\\<br /> x_{1,2}&x_{2,2}&x_{3,2}&...\\<br /> x_{1,3}&x_{2,3}&x_{3,3}&...\\<br /> .&.&.&.\\<br /> .&.&.&.\\<br /> .&.&.&.\\<br /> \end{array}<br /> \ <br /> \begin{array}{| c |} <br /> u_1\\<br /> u_2\\<br /> u_3\\<br /> .\\<br /> .\\<br /> .\\<br /> \end{array}=<br /> \begin{array}{| c |} <br /> 0\\<br /> 0\\<br /> 0\\<br /> .\\<br /> .\\<br /> .\\<br /> \end{array}[/tex]
If this is only true when [itex]u_1 =u_2=u_3=...=0[/itex] then the vectors
[itex]X_1,X_2,X_3...[/itex] are linearly independent.
 
when one finds eigenvectors of a matrix they form its eigenspace, i.e. they are lin indep, how is it proved?

Why do you think the eigenvectors are linearly independent?

I think you're thinking of an eigenbasis.
 
It is not inherent in the derivation at all. Note that although it is obvious in R^2 that two distinct eigenvectors are independent, is it immediately obvious in 3 dimensions that a third eigenvector is not a linear combination of the first two eigenvectors (and in higher dimensions) ?
Here is a proof from "Linear Algebra Done Right", a highly recommended text:
Let T be a linear transformation from V into U such that T has n distinct eigenvalues L1,...,Ln. Let v1,...,vn be eigenvectors corresponding to each respective eigenvalue. Assume that some vi in our list is the smallest vector that is a linear combination of the previous vectors. Then [itex]v_i = \sum_{j=1}^{i-1} a_jv_j[/itex], and [itex]Tv_i = \sum_{j=1}^{i-1} a_jL_jv_j = L_iv_i[/itex].
But [itex]L_iv_i = \sum_{j=1}^{i-1} a_jL_iv_j[/itex], which implies that [itex](\sum_{j=1}^{i-1} a_jL_jv_j) - \sum_{j=1}^{i-1} a_jL_iv_j = 0[/itex] or [itex]\sum_{j=1}^{i-1} a_j(L_j - L_i)v_j = 0[/itex]
Since the aj's are the only coefficients that can be zero, this implies vi is zero, which is a contradiction.
 
Hurkyl said:
Why do you think the eigenvectors are linearly independent?

I think you're thinking of an eigenbasis.

Yeah, you're right. It makes more sense now since Davorak pointed out dependency equation.
If they are lin dependent, then matrix is deficient, I guess?
 
It is not inherent in the derivation at all. Note that although it is obvious in R^2 that two distinct eigenvectors are independent

Not true.

For example, [1, 0] and [2, 0] are both eigenvectors of the identity matrix, and are clearly linearly dependent.

In general, if v is an eigenvector of A, then so is 2v, and {v, 2v} is clearly a linearly dependent set.
 
Hurkyl said:
Not true.

For example, [1, 0] and [2, 0] are both eigenvectors of the identity matrix, and are clearly linearly dependent.

In general, if v is an eigenvector of A, then so is 2v, and {v, 2v} is clearly a linearly dependent set.
Ok, now I am confused...
Taking 2x2 identity matrix:
1 0
0 1
subtracting lambda and getting its determinant to be (1 - lambda)^2 = 0, lambda = 1. So then the modified matrix turns out to be 0 2x2, and how do you find eigenvectors? they cannot be zero, right?
[edit] Oh, I think I got it [/edit]
 
Last edited:
Hurkyl said:
Not true.

For example, [1, 0] and [2, 0] are both eigenvectors of the identity matrix, and are clearly linearly dependent.
By distinct eigenvectors, I was shortening "eigenvectors for distinct eigenvalues", as I thought was the intent of the original poster. :smile:
 
this result is proved from a slightly more sophisticated point of view on page 66 of sharipov's text and page 10 of mine, both free, cited in posts 25,26 of the thread "sharipov's linear algebra textbook", from 2/21/2005
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 14 ·
Replies
14
Views
5K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 4 ·
Replies
4
Views
6K
  • · Replies 18 ·
Replies
18
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K