How can you determine if a set of given vectors can span a subspace in R^n?

  • Thread starter Thread starter mckallin
  • Start date Start date
  • Tags Tags
    Set
mckallin
Messages
15
Reaction score
0
support that p is in M and M=span{v,w},that means p=av+bw, right?
then, could either a or b be zero?

regarded to this following problem:
Is is possible that {[1 2 0]^T,[2 0 3]^T} can span the subspace U={[r s 0]^T / r and s in R}?


I thought if s=2r and the scalar for [2 0 3]^T could be zero, it might be possible?
 
Physics news on Phys.org
U is a two dimensional vector space so [r 2r 0]^T is only a one dimemsional subspace of it. [1 2 0]^T spans that subspace of U but not U.

The question is, "suppose [r s 0]^T is a general vector in U. Do there exist numbers x, y such that [r s 0]^T= x[1 2 0]^T+ y[2 0 3]^T?" If so then we would have [r s 0]^T= [x 2x 0]^T+ [2y 0 3y]= [x+ 2y 2x 3y]. The means we must have r= x+ 2y, s= 2x, 0= 3y. From the last equation, obviously y= 0. But then we r= x, s= 2x. Since r and s can be any two real numbers, there does not exist a number x satifying both equations.
 
I see, thx.
how about my first question, I would still like to know the answer to that:
support that p is in M and M=span{v,w},that means p=av+bw, right?
then, could either a or b be zero?Also, I have just seen a problem that asks for a spanning set for the zero subspace {0} of R^n.
Then, I let [0 0 0 0]^T be the zero subspace of R^4, so is this a spanning set for that zero subspace:
span{[0 0 0 0] [0 0 0 0] [0 0 0 0] [0 0 0 0]}
 
Last edited:
mckallin said:
I see, thx.
how about my first question, I would still like to know the answer to that:
support that p is in M and M=span{v,w},that means p=av+bw, right?
Yes.

then, could either a or b be zero?
Yes.


Also, I have just seen a problem that asks for a spanning set for the zero subspace {0} of R^n.
Then, I let [0 0 0 0]^T be the zero subspace of R^4, so is this a spanning set for that zero subspace:
span{[0 0 0 0] [0 0 0 0] [0 0 0 0] [0 0 0 0]}
Why do you have the same thing four times in a set? This set is exactly the same thing as {[0 0 0 0]}, which is a spanning set {0}= {[0 0 0 0]}
 
thx.
I am sorry that I have got a more problem right away. Could you help again?

Do you know how to determine if a set of some given vectors in R^n can span R^n?
regarded to this question:

Determine if the following given vectors span R^4.
{[1 3 -5 0] [-2 1 0 0] [0 2 1 -1] [1 -4 5 0]}.


I thought they could because I seem to be able to reduce the matrix with these vectors as columns into an identity matrix. But the answer in the book says they can't. I was getting confused.
 
##\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