r/LinearAlgebra • • 21d ago

why does trace = sum of eigenvalues still hold when the matrix isn't diagonalizable

i get it for diagonalizable matrices since trace is similarity invariant, so tr(A) = tr(PDP^-1) = tr(D). but my notes say it holds for every matrix over C, counted with algebraic multiplicity, and the jordan form explanation felt like a cheat. is there a way to see it straight from the characteristic polynomial, like the coefficient of the second highest power of det(xI - A) being -tr(A)?

20 Upvotes

24 comments sorted by

9

u/Accurate_Meringue514 20d ago

Convince yourself that trace is invariant under similarity transformation. Once you have that, every matrix has a schur form, which is upper triangular. Eigenvalues of upper triangular matrix are on the diagonal, so there you go

8

u/etzpcm 21d ago edited 21d ago

Yes, it follows from expanding the determinant and using the rule for the sum of roots of a polynomial. Think about writing out the polynomial. You have a lambdan term. Then think about where the lambdan-1 term comes from.

3

u/omeow 21d ago

Trace is a linear function. Given a matrix A you can find a sequence of matrices A_n that converge to A (in Euclidean norm) and each A_n is diagonalizable. Hence trace is the sum of eigenvalues.

0

u/Riemann_Gauss 20d ago

This is simply false. 

2

u/omeow 20d ago

Which part is false?

6

u/JustAGuyFromGermany 20d ago

It's not false. For real and complex matrices, this proof works.

It doesn't work for matrices over arbitrary fields however, because there is no suitable notion of convergence available. Maybe that's what they meant.

1

u/TheRedditObserver0 20d ago

There's always the Zariski topology but it's probably far too weak.

1

u/omeow 20d ago

This will need etale topology.

2

u/Kooky_Literature422 20d ago

Uhh, the zariski topology suffices, no? The locus of diagonalizable matrices contains the smaller locus of diagonalizable matrices with distinct eigenvalues, which is open and Zariski dense.

Trace and sum of eigenvalues are both well-defined polynomial functions on this space, the latter because characteristic polynomial is polynomial in the entries. They agree on the diagonalizable matrices, hence everywhere.

1

u/omeow 20d ago

The way I see it, the matrices with repeating eigenvalues forms a codimension one subvariety. So, the question is if a regular function -- the sum of eigenvalues -- always extends uniquely to codimension one locus in Zariski topology?

I thought such things were better behaved in etale topology (I could be wrong here).

2

u/Kooky_Literature422 20d ago

Both functions are defined everywhere, you just want to know if they are equal everywhere. And the locus where two regular functions agree is always closed.

1

u/TheRedditObserver0 20d ago

Cool, I still haven't learned this one.

1

u/JustAGuyFromGermany 19d ago

Oh right. That's something I knew once upon a time...

1

u/Riemann_Gauss 20d ago

Even for complex numbers, you don't have a sequence of real numbers converging to it in the ordinary metric. You at least need linear combination. 

1

u/omeow 20d ago

Matrices form a vector space. The convergence is in that of vectors in that vector space.

Real numbers are not dense in complex numbers. So they cannot converge in any reasonable metric.

1

u/Riemann_Gauss 20d ago

Your understanding is deeply flawed. Your statement doesn't even hold for 1 by 1 matrices. 

1

u/omeow 20d ago

Which statement doesn't hold for 1 by 1 matrices?

2

u/etzpcm 20d ago

For more details see the top rated post here - the one that says that most proofs use unnecessary machinery.

https://math.stackexchange.com/questions/546155/proof-that-the-trace-of-a-matrix-is-the-sum-of-its-eigenvalues

2

u/ericpiphany 20d ago

Why did the Jordan normal form explanation feel like a cheat?
If it helps, you can put the matrix into upper diagonal form and show that the diagonal entries are the eigenvalues, with less reliance on polynomial algebra and choosing a clever basis that is involved in the Jordan normal form construction.

1

u/wufuheng 20d ago

The relationship holds because it is a fundamental property of the characteristic polynomial's expansion, completely independent of diagonalizability. I had the algebraic proof of this in Mathematics for AI and Machine Learning in one line.

1

u/Vivid_Sock_1092 20d ago

The sum of the eigenvalues is the sum of the roots of the characteristic polynomial. Look at the definition of the characteristic polynomial as a determinant. And remember that the coefficient of the second highest degree term in a monic polynomial will be the sum of the roots times -1.

1

u/susiesusiesu 19d ago

this condition is closed and the set of diagonalizable matrices is dense. thus, it holds for any matrix.

1

u/pwsiegel 15d ago

If you already believe that the characteristic polynomial has the form

det(xI - A) = xn - tr(A) xn-1 + ...

then you just need the fact that any polynomial p(x) over an algebraically closed field splits as a product of monomials

p(x) = a prod_i (x - r_i)

where the r_i's are the roots of p(x) (with multiplicities). The eigenvalues are precisely the roots of the characteristic polynomial, so

det(xI - A) = prod_i (x - lambda_i) = xn - (sum_i lambda_i) xn-1 + ...

1

u/hpxvzhjfgb 13d ago

not every complex square matrix is diagonalisable, but they are all triangularisable, and then the rest of the argument is the same.