# The Unapologetic Mathematician

## Transformations with All Eigenvalues Distinct

When will a linear transformation $T$ have a diagonal matrix? We know that this happens exactly when we can find a basis $\{e_i\}_{i=1}^d$ of our vector space $V$ so that each basis vector is an eigenvector $T(e_i)=\lambda_ie_i$. But when does this happen? The full answer can be complicated, but one sufficient condition we can describe right away.

First, remember that we can always calculate the characteristic polynomial of $T$. This will be a polynomial of degree $d$ — the dimension of $V$. Further, we know that a field element $\lambda$ is an eigenvalue of $T$ if and only if $\lambda$ is a root of the characteristic polynomial. Since the degree of the polynomial is $d$, we can expect to find no more than $d$ distinct roots of the polynomial — no more than $d$ distinct eigenvalues of $T$. I want to consider what happens in this generic case.

Now we have $d$ field elements $\lambda_i$, and for each one we can pick a vector $e_i$ so that $T(e_i)=\lambda_ie_i$. I say that they form a basis of $V$. If we can show that they are linearly independent, then they span some subspace of $V$. But since there are $d$ distinct vectors here, they span a subspace of dimension $d$, which must be all of $V$. And we know, by an earlier lemma that a collection of eigenvectors corresponding to distinct eigenvalues must be linearly independent! Thus, the $e_i$ form a basis for $V$ consisting of eigenvectors of $T$. With respect to this basis, the matrix of $T$ is diagonal.

This is good, but notice that there are still plenty of things that can go wrong. It’s entirely possible that two (or more!) of the eigenvalues are not distinct. Worse, we could be working over a field that isn’t algebraically closed, so there may not be $d$ roots at all, even counting duplicates. But still, in the generic case we’ve got a diagonal matrix with respect to a well-chosen basis.

### Like this:

Posted by John Armstrong | Algebra, Linear Algebra

## 2 Comments	»

1. [...] space of finite dimension . We take its characteristic polynomial to find the eigenvalues. If all of its roots are distinct (and there are of them, as there must be if we’re working over an algebraically closed [...]

Pingback by | February 11, 2009 | Reply

2. [...] we’ve established that distinct eigenvalues allow us to diagonalize a matrix, but repeated eigenvalues cause us problems. We need to generalize [...]

Pingback by | February 16, 2009 | Reply

« Previous | Next »

## About this weblog

This is mainly an expository blath, with occasional high-level excursions, humorous observations, rants, and musings. The main-line exposition should be accessible to the “Generally Interested Lay Audience”, as long as you trace the links back towards the basics. Check the sidebar for specific topics (under “Categories”).

I’m in the process of tweaking some aspects of the site to make it easier to refer back to older topics, so try to make the best of it for now.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 28, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9152717590332031, "perplexity_flag": "head"}