
#1
Feb211, 08:09 AM

P: 59

I'm pretty inexperienced in proof writing. So not sure if this was valid.
If a matrix is skew symmetric then A^T =  A, that is the transpose of A is equal to negative A. This implies that if A = a(i,j), then a(j,i) = a(i,j). If we're referring to diagonal entries, we can say a(j,j) = a(j,j). The only way for this to be true is if a(j,j) = 0. So therefore all the diagonal entries of a skew symmetric matrix are 0. Is this good enough? Thanks. 



#2
Feb211, 09:42 AM

HW Helper
P: 6,214

I think it would work as a valid proof.




#3
Nov2012, 06:53 PM

P: 3





#4
Nov2012, 07:29 PM

Math
Emeritus
Sci Advisor
Thanks
PF Gold
P: 38,904

Show that diagonal entries of a skew symmetric matrix are zero. 


Register to reply 
Related Discussions  
SkewSymmetric Matrix  Calculus & Beyond Homework  0  
skew symmetric matrix question  Linear & Abstract Algebra  5  
SkewSymmetric Matrix  General Math  0  
Eigenvalues for a matrix with equal and opposite diagonal entries?  Linear & Abstract Algebra  3  
SkewSymmetric Matrix proof  Calculus & Beyond Homework  3 