Construct a 2x2 nilpotent matrix

  • Thread starter Thread starter Aleoa
  • Start date Start date
  • Tags Tags
    Matrix
Click For Summary

Homework Help Overview

The discussion revolves around constructing a 2x2 nilpotent matrix, focusing on the necessary conditions and equations that define such matrices. Participants explore the implications of nilpotency in the context of linear algebra.

Discussion Character

  • Conceptual clarification, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants present equations derived from the definition of nilpotent matrices and the kernel conditions. There is a discussion about the sufficiency of the equations found and the need for additional conditions.

Discussion Status

The conversation is ongoing, with participants questioning the completeness of the equations and exploring the implications of the trace and determinant conditions for nilpotent matrices. Some guidance has been offered regarding the relationship between the equations and the properties of nilpotent matrices.

Contextual Notes

There is a mention of a potential missing equation related to the condition \(M^2 = 0\), and participants are considering the implications of the trace and determinant being zero in relation to the kernel equations.

Aleoa
Messages
128
Reaction score
5

Homework Statement


Costruct a:

Schermata 2018-04-17 14:21:36.png

The Attempt at a Solution



I found 3 equations but i miss another one :(

<br /> M=\begin{bmatrix}<br /> a &amp; b\\<br /> c &amp; d<br /> \end{bmatrix}

(1) a+d = 0 from the definition of nilpotent matrix
(2) a+3b = 0 from kernel
(3) c +3d= 0 from kernel
 

Attachments

  • Schermata 2018-04-17 14:21:36.png
    Schermata 2018-04-17 14:21:36.png
    3.7 KB · Views: 890
Physics news on Phys.org
Aleoa said:

Homework Statement


Costruct a:

View attachment 224200

The Attempt at a Solution



I found 3 equations but i miss another one :(

<br /> M=\begin{bmatrix}<br /> a &amp; b\\<br /> c &amp; d<br /> \end{bmatrix}

(1) a+d = 0 from the definition of nilpotent matrix
(2) a+3b = 0 from kernel
(3) c +3d= 0 from kernel
You're missing an equation that results from ##M^2 = 0##.
 
Mark44 said:
You're missing an equation that results from ##M^2 = 0##.

I know that the equations of the nilpotent matrix are:

a+d=0
and
ad=bc.

However, the first it's already present, the second it's implicitely represented by the 2 kernel equations
 
Aleoa said:
I know that the equations of the nilpotent matrix are:

a+d=0
and
ad=bc.
Yes, you already said that in post #1, but you're not using the fact that the matrix is nilpotent.
Aleoa said:
However, the first it's already present, the second it's implicitely represented by the 2 kernel equations
Using the fact that tr(M) = 0, you have a + d = 0.
So M could be written as ##M = \begin{bmatrix} a & b \\ c & -a \end{bmatrix}##. Then ##M^2## = what?
 
Mark44 said:
Yes, you already said that in post #1, but you're not using the fact that the matrix is nilpotent.

Using the fact that tr(M) = 0, you have a + d = 0.
So M could be written as ##M = \begin{bmatrix} a & b \\ c & -a \end{bmatrix}##. Then ##M^2## = what?

The fact that the matrix is nilpotent is totally determined by the 2 equations:
tr = 0
det = 0

Maybe I am wrong, but the book I am studying argues this.

So, i miss another equation...
 
Last edited:
Aleoa said:
The fact that the matrix is nilpotent is totally determined by the 2 equations:
tr = 0
det = 0

Maybe I am wrong, but the book I am studying argues this.

So, i miss another equation...

You have enough equations now.
 
PeroK said:
You have enough equations now.

Unfortunately no. The tr=0 equation was already present and the det is implied by the 2 kernel equations
 
Aleoa said:
Unfortunately no. The tr equation was already present and the other it's implied by the 2 kernel equations

How many equations do you need for two variables?
 
The question does not imply that there is only one possible answer.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
Replies
2
Views
2K
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K