Proving vectors are in the column space

Taylorw369
Messages
1
Reaction score
0
How would you prove that adding two vectors in the column space would result in another vector in the column space?

I know this is maybe the most basic property of vectors and subspaces, and that the very definition of the column space says it's spanned by vectors in the column space. Is there any way to prove this, though?
 
Physics news on Phys.org
Taylorw369 said:
How would you prove that adding two vectors in the column space would result in another vector in the column space?

I know this is maybe the most basic property of vectors and subspaces, and that the very definition of the column space says it's spanned by vectors in the column space. Is there any way to prove this, though?
What, exactly, are you asking? You say that you know "very definition of the column space says it's spanned by vectors in the column space." You understand that you don't "prove" definitions don't you?
 
The column space is a subspace, so that it is closed under addition of vectors.

EDIT: Sorry, I guess you were trying to show that the column space is a subspace. Let me
think it through.

EDIT: by definition, see , e.g.:http://en.wikipedia.org/wiki/Column_space , the column space

is the set of all linear combinations of the row vectors. Take then a combination of row

vectors and add another combination to it to show the sum is itself a combination.

Does that help?

EDIT 2: By definition, a linear transformation takes vector spaces (subspaces) to subspaces.
The column space is the linear image of a vector space is a vector space; linear maps take
vector spaces to vector spaces.
 
Last edited:
If X is a vector space over ℝ and S is a subset of X, the set of linear combinations of elements of S is a subspace of X. The proof is trivial: Let's denote the set of linear combinations of elements of S by W. We obviously have ##0\in W##. Let ##a,b\in\mathbb R## and ##x,y\in S## be arbitrary. We have ##ax+by\in W##. (That's the entire proof).

The subspace W can be equivalently defined as the intersection of all subspaces of X that contain S. If you show that these definitions are equivalent, you can easily prove that W is the "smallest" subspace of X that contains S, in the sense that if V is another such subspace, we have ##W\subseteq V##. You can also easily prove that there's only one "smallest" subspace of X that contains S.

So W is the unique smallest subspace of X that contains S. This space is called the subspace generated by S, or the subspace spanned by S.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
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