Matrix Spaces; Rank 1; Small World Graphs
May 29, 2019
Matrix Space
Last lecture we’ve talked briefly that a matrix is a vector space, because we can add, multiply by constant to “things” in the space. For “things” we used to use vectors. But right now we extend it to matrix, just because it can allow operations of adding and multiplying by constant. Or if you like, you can call the matrix vector. And the subspaces for this matrix are
- symmetric matrix
- upper triangular matrix
- diagonal matrix
What are the bases for these spaces?
There’re 9 numbers in , so we probably need 9 matrix to be the basis:
and . This space is similar to but written in a matrix instead of a column vector. For symmetric matrix ? The dimension for symmetric matrix is 6:
For upper triangular matrix it’s still 6, one 1 for each location in the upper triangular. What about diagonal matrix? Diagonal matrix is just infact , and , one 1 in each position on diagonal line. Remember we’ve talked about union is not a subspace(Lecture 6). So is not a subspace. But we can define a new opetaion that takes all possible sums of this two spacesI think it’s useful to imagine taking the sum of their bases, and
their sum is all the matrices.
Differential Equations
if you don’t want to look at this part just skip it, it’s about why we care about matrix as a vectorWhy we would like to take a matrix and call it a vector and think about its spaces? Let’s have a second order differential equations:
Some solutions include
the complete solution is
where and can be any real numbers. This complete solution is a vector space. Even though these don’t look like vectors, we can still add and multiply by a number to it. So they form a vector space. The basis for this space is and . The dimension is 2.
Rank 1 matrix
Let’s have a rank 1 matrix:
One interesting thing about rank 1 matrix is that where and are column vectors. That is:
rank 1 matrices are building blocks for more complex matrices.
Graph
This is the directed/undirected graph that CS-background students are familiar with
We use a set of nodes and edges to represent a graph.
This will be further discussed in the next notes.