Hi everyone, I am stuck with the following for last couple of days.(adsbygoogle = window.adsbygoogle || []).push({});

Many books mention during the development in the idea of Eigenvalue problem: say, you have the equation

[tex] [\ A-\lambda\ I]\ X=\ 0[/tex] where A is an NxN matrix and X is an Nx1 vector.

The above consists of n equations.Say,all eigenvalues are non-degenerate.

If you specify one of the non-degenerate eigenvalues,the number of linearly independent equations will be (N-1).This is written in book.I am looking for the explanation.

The linear independence of the equations come from the vectors in the matrix [tex] [\ A-\lambda\ I][/tex].Since,the matrix [tex] [\ A-\lambda\ I][/tex] is singular,its rank can be at most (N-1).Means,the maximum number of the linearly independent vectors in the matrix A after specifying one of its eigenvalues is (N-1).At least one of the vectors can be expanded in terms of the (N-1) vectors.

I find it difficult to see how the specification of the eigenvalue results in this.It is clear that in specifying the eigenvalue,all the matrix elements become known to us.And we can readily calculate its deerminant=0.That way it is OK.But how do we know the rank is precisely (N-1) and not (N-2) or (N-3)...etc.?

-Please take part in the discussion so that the thing becomes clear.

Neel

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Why eigenvalue specification reduces the no. of LI equations?

Loading...

Similar Threads - eigenvalue specification reduces | Date |
---|---|

A Eigenvalue Problem and the Calculus of Variations | Jan 8, 2018 |

I Eigenvalues of Circulant matrices | Oct 1, 2017 |

I Eigenvalues of block matrices | Sep 10, 2017 |

A Numerically Calculating Eigenvalues | Aug 26, 2017 |

Finding elements in GL_2(R) with specific orders | Aug 28, 2015 |

**Physics Forums - The Fusion of Science and Community**