Thursday, 6 March 2014

matrices - Proving a matrix is a subvector space



I am being asked this question:




Consider the vector space M(n × n, R) of n × n-matrices over R. Show that the subset of all diagonal matrices is a subvector space of M(n × n, R).



To my knowledge, a set is a subvector space if it satisfies 3 requirements.



1.) Zero exists in the set.



2.) The set is closed under addition



3.) The set is closed under scalar multiplication




I believe that zero exists in the set because all the elements in the matrix that aren't along the diagonal are zero. To my understanding, to prove that a set is closed under addition I must show that f(x+y) = f(x) + f(y) and to show that it is closed under scalar multiplication I must show that f(rx) = r f(x). I do not know how to prove the last two conditions in regards to a matrix.


Answer



As FriedrichPhilipp said, the conditions you've written are for showing a function is a linear map, not for showing closure under vector addition and scalar multiplication.



You're right in your argument that 0Mn×n(R).



For closure under vector addition, you need to show if x,yMn×n(R) (i.e. if x & y are n×n diagonal matrices) then x+y is also a diagonal matrix.



For closure under scalar multiplication, you need to show if kR and xMn×n(R) (i.e. if kR and x is an n×n diagonal matrix) then kx is also a diagonal matrix.




Now try writing out your arguments for these :-).


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...