Prove the theorem for the matrix

  • Thread starter Thread starter frostshoxx
  • Start date Start date
  • Tags Tags
    Matrix Theorem
frostshoxx
Messages
6
Reaction score
0

Homework Statement



Prove that every square real matrix X can be written in a unique way as the sum of a symmetric matrix A and a skew-symmetric matrix B.

Homework Equations



X = A + B
A = \frac{X+X^{T}}{2}
B = \frac{X-X^{T}}{2}
X = \frac{X+X^{T}}{2} + \frac{X-X^{T}}{2}


The Attempt at a Solution



So I tried to solve \frac{X+X^{T}}{2} + \frac{X-X^{T}}{2} and it gives out X as a solution. However, how can I know that A is a symmetric and B is a skew-symmetric? Any idea?
 
Physics news on Phys.org
Take the transpose of A and B. You also need to prove uniqueness which I would do by contradiction.
 
Can this be done symbolically? Also, what do you mean by contradiction? could you give some examples?

Thank you for your time.
 
Yes why not, if you take transpose of A, you will get A again. And B is skew because of the negative sign.

Example of uniqueness. Let e be a number (in reals) such thata \cdot a^{-1}=e and a\cdot e=a \quad \forall a \in \mathbb{R}. e is unique.

Proof:
Fix a in reals and assume e is not unique. You have a\cdot e=a and a\cdot e'=a for e\neq e' (same for inverses). Now you have
a\cdot e \cdot e'=a \cdot e'=a
taking inverses gives the result that e \cdot e'=e and e \cdot e'=e'
thus e=e' which contradicts the assumption, thus e must be unique.

Hope that helps
 
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