Matrix A s.t. A^3=0 but A^2 doesn't

  • Thread starter Thread starter NullSpace0
  • Start date Start date
  • Tags Tags
    Matrix
AI Thread Summary
A matrix A can be constructed such that A^3 = 0 while A^2 ≠ 0, typically by using a 3x3 upper triangular matrix with ones above the diagonal. The discussion highlights the challenge of finding such a matrix and the reasoning behind the structure of nilpotent matrices. Participants express uncertainty about how to approach the problem and suggest looking into relevant mathematical concepts or resources. The importance of understanding matrix multiplication and linear combinations is emphasized. Overall, the conversation revolves around the properties and construction of nilpotent matrices.
NullSpace0
Messages
25
Reaction score
0

Homework Statement


Find a matrix, A, such that A3=0, but A2≠0.


Homework Equations





The Attempt at a Solution


I don't actually think this is possible. My only other thought is to take A2*A where this product equals zero, and then decompose A. But I don't know how to do that such that it is the "square root" of A.
 
Physics news on Phys.org
NullSpace0 said:

Homework Statement


Find a matrix, A, such that A3=0, but A2≠0.


Homework Equations





The Attempt at a Solution


I don't actually think this is possible. My only other thought is to take A2*A where this product equals zero, and then decompose A. But I don't know how to do that such that it is the "square root" of A.

Try a 3x3 matrix with 1s above the diagonal.
 
How would I have known to look for that?

From what I know about matrix multiplication, I know that the zeroes below the diagonal help when I think of multiplying by taking linear combinations of the columns, but how would I reason this out in general?
 
NullSpace0 said:
How would I have known to look for that?

From what I know about matrix multiplication, I know that the zeroes below the diagonal help when I think of multiplying by taking linear combinations of the columns, but how would I reason this out in general?

Let A be an n xn matrix for which A^k = 0 for some k > n. Prove that A^n = 0.

This theorem tells me to work on nxn matrices since I know I know I can construct one that is A^n = 0. So your case we needed A^3. Hence I picked a 3x3
 
NullSpace0 said:
How would I have known to look for that?

From what I know about matrix multiplication, I know that the zeroes below the diagonal help when I think of multiplying by taking linear combinations of the columns, but how would I reason this out in general?

Re "How would I have known to look for that?" I'll bet your book or notes have some relevant material. Alternatively, you could Google 'nilpotent matrix', but I guess you would need to know that is what such A are called.

RGV
 
I picked up this problem from the Schaum's series book titled "College Mathematics" by Ayres/Schmidt. It is a solved problem in the book. But what surprised me was that the solution to this problem was given in one line without any explanation. I could, therefore, not understand how the given one-line solution was reached. The one-line solution in the book says: The equation is ##x \cos{\omega} +y \sin{\omega} - 5 = 0##, ##\omega## being the parameter. From my side, the only thing I could...
Essentially I just have this problem that I'm stuck on, on a sheet about complex numbers: Show that, for ##|r|<1,## $$1+r\cos(x)+r^2\cos(2x)+r^3\cos(3x)...=\frac{1-r\cos(x)}{1-2r\cos(x)+r^2}$$ My first thought was to express it as a geometric series, where the real part of the sum of the series would be the series you see above: $$1+re^{ix}+r^2e^{2ix}+r^3e^{3ix}...$$ The sum of this series is just: $$\frac{(re^{ix})^n-1}{re^{ix} - 1}$$ I'm having some trouble trying to figure out what to...

Similar threads

Back
Top