Proving Unique Decomposition of a Square Matrix

mlarson9000
Messages
46
Reaction score
0

Homework Statement



An nxn matrix C is skew symmetric if C^t = -C. Prove that every square matrix A can be written uniquely as A = B + C where B is symmetric and C is skew symmetric.


Homework Equations





The Attempt at a Solution



No clue.
 
Physics news on Phys.org
You aren't trying very hard, now are you? Tell me about (A+A^T) and (A-A^T). Are they symmetric, skew-symmetric or neither? You have to help here.
 
(A+A^T)is symmetric, (A-A^T)is skew symmetric, but adding them together produces 2A, not A. I'm not sure what to do with this information.
 
mlarson9000 said:
(A+A^T)is symmetric, (A-A^T)is skew symmetric, but adding them together produces 2A, not A. I'm not sure what to do with this information.

That's not such a big problem. Divide each one by two.
 
Dick said:
That's not such a big problem. Divide each one by two.

How embarrassing.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top