Subspace matrix, dimension and basis

caljuice
Messages
70
Reaction score
0
So an example was the matrix:<br /> A = \left(\begin{array}{cccc}<br /> a&amp;a+b\\<br /> b&amp;0\\<br /> \end{array}<br /> \right)<br /> is a subspace of M2x2.


and is the linear combination <br /> a*\left(\begin{array}{cccc}<br /> 1&amp;1\\<br /> 0&amp;0<br /> \end{array}<br /> \right)<br /> + <br /> b*\left(\begin{array}{cccc}<br /> 0&amp;1\\<br /> 1&amp;0<br /> \end{array}<br /> \right)<br />

Meaning it has dimension 2. But I'm not sure how it comes to this conclusion.

Dimension means # of vectors in a basis. However, I don't know how to translate this matrix addition in terms of vectors. Is the dimension 2 because there are 2 matrices being added? Or because we can break it down into the linear combination of indepedent vectors v1 =(1,0) v2=(0,1)? Or is it completely something else? thanks.
 
Physics news on Phys.org
The "vector space" you are talking about here, has matrices as its elements, as opposed to the columns of numbers you were used to. (If you want, for this purpose, you can ignore the matrix structure and you can just view them as vectors with 4 entries written in a funny way).

The dimension being 2, just means that you need precisely two numbers to specify a unique element from the subspace. So if we agree on a way to interpret these numbers to create an element of the subspace, I can give you any two numbers and you will obtain a unique element. For example, we can agree to map (a, b) to
<br /> a\cdot\left(\begin{array}{cccc}<br /> 1&amp;1\\<br /> 0&amp;0<br /> \end{array}<br /> \right)<br /> +<br /> b\cdot\left(\begin{array}{cccc}<br /> 0&amp;1\\<br /> 1&amp;0<br /> \end{array}<br /> \right).<br />

This is the most obvious way to do it, however, we can devise different systems (for example, create a complicated expression when I give you a + b and a - b). Yet, it doesn't matter how you do it, you will always need two and exactly two numbers to specify the element. (This is the intuitive interpretation, which is made precise by introducing the concept of a basis).
 
What they're saying, is that the set B=\left\{\left(\begin{array}{cccc}<br /> 1&amp;1\\<br /> 0&amp;0<br /> \end{array}\right),\left(\begin{array}{cccc}<br /> 0&amp;1\\<br /> 1&amp;0<br /> \end{array}<br /> <br /> \right)\right\} is in fact a basis of A. Since B contains two elements, the dimension of A is 2. Of course, you still have to prove that B is indeed a basis. As demonstrated, every element of A kan be expressed as a linear combination of the asserted basis elements. This shows that B is generating ("complete"). Now you still have to prove that these linear combinations are unique. Equivalently, prove that the two elements of B are linearly independent.
 
##\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