0
$\begingroup$

Assume we have square matrix $A_{N \times N}$.

Can we say that the maximum number of independent eigen vectors, with nonzero eigenvalues, equals $\text{Rank}(A)$?

We can say that such number must be smaller equal than $\text{Rank}(A)$, because an eigenvector with nonzero eigenvalue means that it must belongs to $\text{Range}(A)$, so the independent set of such vectors must be a basis of some subspace of $\text{Range}(A)$, thus not exceeding $\text{dim} \{ \text{Range}(A) \} = \text{Rank} (A)$.

But my question is, does the equality holds?

$\endgroup$

1 Answer 1

0
$\begingroup$

No. Let $A=\begin{bmatrix}1&1\\0&1\end{bmatrix}$. $1$ is the only eigenvalue of $A$ and $ \dim ker(A-I)=1$. But $rank(A)=2$

$\endgroup$
1
  • $\begingroup$ Oh thnaks, that solve the problem $\endgroup$ Feb 3, 2017 at 12:49

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .