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

Click For Summary

Discussion Overview

The discussion revolves around the characteristic polynomial of an n by n matrix, specifically its degree and leading coefficient. Participants explore methods of proof, including induction and cofactor expansion, while seeking references and clarifications on the topic.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • One participant expresses doubt about their proof method involving induction and requests a link to a rigorous proof.
  • Another participant suggests using cofactor expansion of the determinant as a method for proof, noting that there are alternative approaches that do not require induction.
  • A third participant provides a link to a resource that includes a theorem related to the characteristic polynomial.
  • One participant describes the process of finding the characteristic polynomial through the determinant of the matrix minus a scalar multiple of the identity matrix, indicating that the proof becomes evident from this definition.
  • There is a mention that some authors define the characteristic polynomial differently, which may affect the necessity of the leading coefficient factor of ##(-1)^n##.
  • A participant expresses interest in seeing the proof by induction mentioned earlier, suggesting a willingness to engage with different proof techniques.

Areas of Agreement / Disagreement

Participants do not reach a consensus on a single proof method, and multiple approaches are discussed. There is also a divergence in definitions regarding the characteristic polynomial.

Contextual Notes

Some participants express uncertainty about the rigor of their methods and the definitions used, indicating potential limitations in their arguments.

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
4K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
Replies
12
Views
4K
  • · Replies 0 ·
Replies
0
Views
3K
  • · 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