Do 3x3 Symmetric Matrices Form a Subspace of 3x3 Matrices?

  • Thread starter Thread starter hahatyshka
  • Start date Start date
  • Tags Tags
    Matrices Symmetric
hahatyshka
Messages
5
Reaction score
0
symmetric matrices... help please!

hi can someone tell me...how to correctly use the 10 axioms..
for example: does the set of all 3x3 symmetric matrices form a subspace of a 3x3 matrices under the normal operations of matrix addition and multiplication?
I don't really get how to prove this..
 
Physics news on Phys.org


hahatyshka said:
hi can someone tell me...how to correctly use the 10 axioms..
for example: does the set of all 3x3 symmetric matrices form a subspace of a 3x3 matrices under the normal operations of matrix addition and multiplication?
I don't really get how to prove this..
The only things you need to prove are that the set is closed under addition and scalar multiplication. Suppose
A= \begin{bmatrix}a & b & c \\b & d & e \\c & e & f\end{bmatrix}
and
B= \begin{bmatrix} u & v & w \\ v & x & y \\w & y & z\end{bmatrix}
two symmetric matrices. Is A+ B symmetric? Is \alpha A symmetric for any number \alpha?
 


HallsofIvy said:
The only things you need to prove are that the set is closed under addition and scalar multiplication.

I thought a subspace had to also contain the zero vector (not empty), or am I remembering that wrong?
 


Well, yes. Thanks for the correction. I should have included that- but the 0 matrix is rather trivially symmetric isn't it?

My point is that you do NOT have to prove all "10 axioms". Given a subset of a vector space, things such as "u+ v= v+ u" follow from the fact that they are true of the entire vector space and so true for any subset.

To prove that "U is a subspace of vector space V" you need to prove:
1) U is closed under vector addition.
2) U is closed under scalar multiplication.
and the one I forgot:
3) U is non-empty.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top