Is Row Reduction Enough to Prove a Subset of Vectors?

  • Thread starter transgalactic
  • Start date
  • Tags
    Subspace
In summary, the conversation discusses the process of proving that one group of vectors is a subspace of another. The speaker mentions using row reduction and extracting a vector, as well as using orthogonality to show linear independence. The conversation also touches on the concept of subsets and the need to show that every element in one set is also an element in another set.
  • #1
transgalactic
1,395
0
i know that in order to prove that one group of vectors are a part of another
i need to stack them up

i did row reduction and i don't know how to extract a vector for the group

http://img384.imageshack.us/img384/2546/55339538nk4.gif

this came from this question part 2

http://img116.imageshack.us/img116/1152/25587465vv2.gif

in the U group i have equations with "k"
i don't know what vectors to take?
 
Last edited by a moderator:
Physics news on Phys.org
  • #2
Have you tried using orthogonality? If the vectors span R^(3), then they must be linearly independent; how can you show that two vectors are perpendicular?
 
  • #3
http://img408.imageshack.us/img408/2364/89390838kq8.gif
 
Last edited by a moderator:
  • #4
this last part is row reduction question..

i don't know how to build the build matrix
 
  • #5
What set is it that you are trying to prove is a subspace?
 
  • #6
i am trying to prove that u(k1) is a subset of v(k2)
 
  • #7
how to solve the second part?
 
  • #8
What does it mean for one set (call it A) to be a subset of another (call it B)? Every element in A must be an element in B. You must show that every element satisfies this requirement, or else it isn't a subset.
 

FAQ: Is Row Reduction Enough to Prove a Subset of Vectors?

What is a subspace?

A subspace is a subset of a vector space that satisfies the same properties as the vector space. This means that it is closed under addition and scalar multiplication, and contains the zero vector.

How can I prove that a set is a subspace?

To prove that a set is a subspace, you must show that it satisfies the three properties of a subspace: closure under addition, closure under scalar multiplication, and containing the zero vector. This can be done by using mathematical proofs and providing examples.

Can a subspace be empty?

No, a subspace cannot be empty because it must contain at least the zero vector. If a set does not contain the zero vector, it cannot be a subspace.

Is the zero vector always part of a subspace?

Yes, the zero vector must always be part of a subspace. This is because it is necessary for a subspace to have closure under addition and scalar multiplication.

Can a subspace be a line or a plane?

Yes, a subspace can be a line or a plane. As long as the set satisfies the properties of a subspace, it can exist in any dimension. For example, a line in a 2-dimensional vector space can be a subspace if it contains the zero vector and is closed under addition and scalar multiplication.

Similar threads

Back
Top