Linear Algebra: Proof involving basic properties

Click For Summary

Homework Help Overview

The problem involves proving that if a square matrix A is nilpotent, then the matrix I+A is invertible. The discussion centers around properties of nilpotent matrices and their implications for matrix operations.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants explore various approaches, including proof by induction, the use of the trace of nilpotent matrices, and considerations of eigenvalues. Questions arise about the validity of these approaches and the existence of non-zero vectors associated with eigenvalues.

Discussion Status

The discussion is active, with participants sharing different lines of reasoning and questioning the effectiveness of their proposed methods. Some suggest direct approaches while others express uncertainty about the implications of their findings.

Contextual Notes

Participants note the challenge of visualizing nilpotent matrices of larger sizes and the constraints of proving invertibility without constructing the inverse explicitly.

SNOOTCHIEBOOCHEE
Messages
141
Reaction score
0

Homework Statement



A square matrix A is called nilpotent if A^k =0 for some k>0. Prove that if A is nilpotent then I+A is invertible.


The Attempt at a Solution



My guess would be to do a proof by induction (on the size of the matrix)

So for the trivial cases:

Let A be a 2x2 Nilpotent matrix... thus it is of the form

[0 x] [0 0]
[0 0] Or [x 0]


Clearly when we add I to A in this case, we get get a matrix, whose det =/= 0


Im having trouble doing the more general cases, seeing as that i cannot mentally see what nilpotent matrices of a larges size look like.

Is this even the best way to approach this problem?

Any help is appreciated.
 
Physics news on Phys.org
Would using the fact that the trace of a nilpotent matrix is equal to 0 help in any way? perhaps coupled with the trace of I= n?
 
I can think of one way to do this. If I+A is invertible, then det(I-A) is non-zero, and that implies that 1 is not an eigenvalue of A. So we need to prove that last statement. Do it by contradiction:

Suppose 1 is an eigenvalue of A, that implies there is a nonzero vector v such that Av=v. Given that A is nilpotent, can such a non-zero vector v exist?

Unfortunately this method isn't constructive; while it does show that I+A is invertible, it cannot come up with the inverse of I+A itself. So does anyone else have a better idea?
 
Oh, I think it can be done directly.

Remember that [tex]1- x^k= (1+ x)(1- x+ x^2+ \cdot\cdot\cdot+ (-1)^k x^{k-1})[/tex]? If that still works for matrices, then taking x= A and k such that Ak= 0, you are done.
 
HallsofIvy said:
Oh, I think it can be done directly.

Remember that [tex]1- x^k= (1+ x)(1- x+ x^2+ \cdot\cdot\cdot+ (-1)^k x^{k-1})[/tex]? If that still works for matrices, then taking x= A and k such that Ak= 0, you are done.

How does this statement prove that it is invertible?
 
SNOOTCHIEBOOCHEE said:
How does this statement prove that it is invertible?

If [itex]I+A[/itex] is invertible then [itex]I=(I+A)(I+A)^{-1}[/itex] ...does that look anything like what Hallsofly posted?:wink:
 

Similar threads

Replies
4
Views
2K
  • · Replies 25 ·
Replies
25
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
9
Views
2K
Replies
1
Views
2K
  • · Replies 24 ·
Replies
24
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
8
Views
2K