Characteristic polynomial has degree n and leading coefficent (-1)^n

Click For Summary
SUMMARY

The characteristic polynomial of an n by n matrix has a degree of n and a leading coefficient of (-1)^{n}. This fact can be proven using the cofactor expansion of the determinant, which is a straightforward approach. Alternative methods exist that do not rely on induction. For a detailed proof, refer to Theorem 5.3 in the provided resource: Notes on Determinants.

PREREQUISITES
  • Understanding of matrix theory and determinants
  • Familiarity with characteristic polynomials
  • Knowledge of cofactor expansion techniques
  • Basic principles of mathematical induction
NEXT STEPS
  • Study the cofactor expansion method for determinants
  • Explore alternative proofs of the characteristic polynomial's properties
  • Learn about the implications of the characteristic polynomial in linear algebra
  • Investigate the differences in defining the characteristic polynomial as det(λI - A) vs. det(A - λI)
USEFUL FOR

Mathematicians, students studying linear algebra, and educators seeking to deepen their understanding of characteristic polynomials and determinants.

Bipolarity
Messages
773
Reaction score
2
I've been looking for proof of the fact that the characteristic polynomial of an n by n matrix has degree n with leading coefficient ## (-1)^{n} ##.

I first tried proving it myself but my method is a bit strange (it does use induction though) and I am doubting the rigor, so could perhaps someone please post a link to the proof? I've been looking around without much success. Thanks!

BiP
 
Physics news on Phys.org
If you want to do this by induction, then my suggestion would be to use the cofactor expansion of the determinant. There are other ways of doing this though that avoid induction.
 
Bipolarity said:
could perhaps someone please post a link to the proof? I've been looking around without much success. Thanks!

http://www.math.uri.edu/~eaton/NotesCh5.pdf , see Theorem 5.3.
 
Bipolarity said:
I've been looking for proof of the fact that the characteristic polynomial of an n by n matrix has degree n with leading coefficient ## (-1)^{n} ##.

I first tried proving it myself but my method is a bit strange (it does use induction though) and I am doubting the rigor, so could perhaps someone please post a link to the proof? I've been looking around without much success. Thanks!

BiP
Well, it seems fairly straightforward. You have a matrix ##\mathbf{A}=\begin{bmatrix} a_{1,1} & a_{1,2} & \cdots & a_{1,n} \\ a_{2,1} & a_{2,2} & \cdots & a_{2,n} \\ \vdots & \vdots & \ddots & \vdots \\ a_{n,1} & a_{n,2} & \cdots & a_{n,n}\end{bmatrix}##.

To find the characteristic polynomial, we consider ##\det(\mathbf{A}-\lambda\mathbf{I})=\det\begin{bmatrix} a_{1,1}-\lambda & a_{1,2} & \cdots & a_{1,n} \\ a_{2,1} & a_{2,2}-\lambda & \cdots & a_{2,n} \\ \vdots & \vdots & \ddots & \vdots \\ a_{n,1} & a_{n,2} & \cdots & a_{n,n}-\lambda\end{bmatrix}=0##. The proof should then become fairly evident when considering the definition of the determinant. I'm tired and lazy right now, though, so I'm going to leave it at that.

As an aside, some authors choose to define the characteristic polynomial as ##\det(\lambda\mathbf{I}-\mathbf{A})=0##, in which case the factor of ##(-1)^n## is unnecessary.

I'd like to see your proof by induction, though. That might be a fun read. :wink:
 

Similar threads

  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
12
Views
3K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
7K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 10 ·
Replies
10
Views
3K