Proving that A=0 When tr(A^2)=0

  • Thread starter Thread starter nhrock3
  • Start date Start date
  • Tags Tags
    Trace
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
5 replies · 3K views
nhrock3
Messages
403
Reaction score
0
i need to prove that if tr(A^2)=0

then A=0



we have a multiplication of 2 the same simmetrical matrices

why there multiplication is this sum formula

[itex] <br /> A*A=\sum_{k=1}^{n}a_{ik}a_{kj}<br /> [/itex]



i know that wjen we multiply two matrices then in our result matrix

each aij member is dot product of i row and j column.

dont understand the above formula.





and i don't understand how they got the following formula:

then when we calculate the trace (the sum of the diagonal members)

we get

[tex] <br /> tr(A^{2})=\sum_{i=1}^{n}A_{ii}^{2}=\sum_{i=1}^{n}(\sum_{i=1}^{n}a_{ik}a_{ki})<br /> [/tex]

and because the matrix is simmetric then the trace is zero

why?


i need to prove that if tr(A^2)=0



then A=0



can you explain the sigma work in order to prove it?
 
Physics news on Phys.org
Hi nhrock3! :smile:

nhrock3 said:
i need to prove that if tr(A^2)=0

then A=0

This is false. Consider

[tex]A=\left(\begin{array}{cc} 0 & 1\\ 0 & 0\\ \end{array}\right)[/tex]

then tr(A2)=0, but A is not zero.

What does the exercise say precisely?
 
if A is a simetric matrix and if tr(A^2)=0 then A=0
 
Ah, you should have said they were symmetric! :smile:

If

[tex]A=\left(\begin{array}{ccccc}<br /> a_{11} & a_{12} & a_{13} & ... & a_{1n}\\<br /> a_{12} & a {22} & a_{23} & ... & a_{2n}\\<br /> a_{13} & a_{23} & a_{33} & ... & a_{3n}\\<br /> \vdots & \vdots & \vdots & \ddots & \vdots\\<br /> a_{1n} & a_{2n} & a_{3n} & ... & a_{nn}\\<br /> \end{array}\right)[/tex]

then what will be the diagonal of A2?? In particular, can you show that the diagonal contains only positive values?
 
micromass said:
Ah, you should have said they were symmetric! :smile:

If

[tex]A=\left(\begin{array}{ccccc}<br /> a_{11} & a_{12} & a_{13} & ... & a_{1n}\\<br /> a_{12} & a {22} & a_{23} & ... & a_{2n}\\<br /> a_{13} & a_{23} & a_{33} & ... & a_{3n}\\<br /> \vdots & \vdots & \vdots & \ddots & \vdots\\<br /> a_{1n} & a_{2n} & a_{3n} & ... & a_{nn}\\<br /> \end{array}\right)[/tex]

then what will be the diagonal of A2?? In particular, can you show that the diagonal contains only positive values?

each member of the diagonal on the A^2 matrix its number of row equals the column number

so the second member in the diagonal is the dot product of the second row with the second column
etc..
so i get this expression
[tex]tr(A^{2})=\sum_{k=1}^{n}\sum_{i=1}^{n}a_{ki}a_{ik}[/tex]
so because its simetric and equlas zero
[tex]tr(A^{2})=\sum_{k=1}^{n}\sum_{i=1}^{n}(a_{ki})^2=0[/tex]
so we get a sum of squeres and in order for them to be zero
then each one of them has to be zero
thannkkks :)
 
Last edited:
nhrock3 said:
each member of the diagonal on the A^2 matrix its number of row equals the column number

so the second member in the diagonal is the dot product of the second row with the second column

Indeed, so the k'th member in the diagonal is

[tex]\|(a_{1k},...,a_{nk})\|^2[/tex]

Do you see that?