Prove det(A+I)=0 when Matrix A is Nilpotent

  • Context: Graduate 
  • Thread starter Thread starter lukaszh
  • Start date Start date
  • Tags Tags
    Determinant
Click For Summary

Discussion Overview

The discussion revolves around proving the determinant of the matrix \( A + I \) when \( A \) is a nilpotent matrix. Participants explore the implications of nilpotency on eigenvalues and determinants, with a focus on the relationship between the eigenvalues of \( A \) and \( A + I \).

Discussion Character

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

Main Points Raised

  • One participant states that if \( A \) is nilpotent, then \( A^k = 0 \) and asks to prove \( \text{det}(A + I) = 0 \).
  • Another participant counters that the claim is false by providing the example of \( A = 0 \), where \( \text{det}(0 + I) \neq 0 \).
  • A different participant argues that since \( \text{det}(A^k) = \text{det}(A)^k \), it follows that \( \text{det}(A) = 0 \) and concludes that 0 is an eigenvalue of \( A \), suggesting that \( \text{det}(A + I) = 1 \) instead.
  • Subsequent posts clarify that the original question was misstated, confirming the need to prove \( \text{det}(A + I) = 1 \).
  • One participant discusses the eigenvalues of \( A + I \) and how they relate to the eigenvalues of \( A \), asserting that if \( A^k = 0 \), then all eigenvalues of \( A \) must be zero.

Areas of Agreement / Disagreement

There is disagreement regarding the initial claim about \( \text{det}(A + I) \). Some participants propose that it should equal 1 instead of 0. The discussion remains unresolved on the exact proof and implications of nilpotency on the determinant.

Contextual Notes

Participants express uncertainty about how to utilize the fact that \( A^k = 0 \) in their arguments. There are also varying interpretations of the implications of nilpotency on eigenvalues and determinants.

lukaszh
Messages
32
Reaction score
0
Hello,
I don't want how to prove: Matrix A is nilpotent, so A^k=0. Prove that det(A+I)=0.
Thank you so much :-)
 
Physics news on Phys.org
What you state is trivially false - take A=0, that is nilpotent, and det(0+I) is not zero.
 
In fact, det(A^k) = det(A)^k, so det(A) must be zero. Alternatively, A^k = 0, so A cannot be injective, so det(A) = 0.

By the way, this shows that 0 is an eigenvalue of A. Something stronger is true: 0 is the ONLY eigenvalue of A.

I think lukaszh's problem statement should be: prove that det(A+I) = 1.
 
I'm so sorry, because I've made a mistake. Prove that det(A+I)=1. Thank you again for your reactions.
 
lukaszh said:
I'm so sorry, because I've made a mistake. Prove that det(A+I)=1. Thank you again for your reactions.

First, find all the eigenvalues of A+I. Then, use what you know about how to calculate the determinant of a linear map given its eigenvalues.
 
Hello,
so, I know that
[tex]A=S\Lambda S^{-1}[/tex]
Eigenvalues of A are [tex]\{\lambda_1,\lambda_2,\cdots,\lambda_n\}[/tex] for [tex]n\times n[/tex] matrix. If I add to both sides identity, then
[tex]A+I=S\Lambda S^{-1}+I=S\Lambda S^{-1}+SS^{-1}=S(\Lambda+I)S^{-1}[/tex]
Its determinant is
[tex]\mathrm{det}(A+I)=\mathrm{det}S(\Lambda+I)S^{-1}=\mathrm{det}(\Lambda+I)=\prod_{j=1}^{n}(\lambda_j+1)[/tex]
I don't know, how to utilize fact [tex]A^k=0[/tex] :-(
 
lukaszh said:
Hello,
so, I know that
[tex]A=S\Lambda S^{-1}[/tex]
Eigenvalues of A are [tex]\{\lambda_1,\lambda_2,\cdots,\lambda_n\}[/tex] for [tex]n\times n[/tex] matrix. If I add to both sides identity, then
[tex]A+I=S\Lambda S^{-1}+I=S\Lambda S^{-1}+SS^{-1}=S(\Lambda+I)S^{-1}[/tex]
Its determinant is
[tex]\mathrm{det}(A+I)=\mathrm{det}S(\Lambda+I)S^{-1}=\mathrm{det}(\Lambda+I)=\prod_{j=1}^{n}(\lambda_j+1)[/tex]
I don't know, how to utilize fact [tex]A^k=0[/tex] :-(


[tex]\lambda[/tex] is an eigenvalue of A + I if and only if

[tex](A + I)x = \lambda x[/tex]

for some nonzero vector x. This is true if and only if

[tex]Ax = (\lambda - 1)x[/tex]

which is true if and only if [tex]\lambda - 1[/tex] is an eigenvalue of A.

I claim that [tex]A^k = 0[/tex] implies that all of the eigenvalues of A are zero. If you can prove this claim then it implies the result you want.
 
Beautiful, thank you.
 

Similar threads

Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 20 ·
Replies
20
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 20 ·
Replies
20
Views
4K
  • · Replies 23 ·
Replies
23
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 20 ·
Replies
20
Views
4K
  • · Replies 34 ·
2
Replies
34
Views
3K
  • · Replies 14 ·
Replies
14
Views
4K