Dimension of intersection of U and V

Click For Summary

Homework Help Overview

The discussion revolves around proving the dimension of the intersection of two subspaces U and V in R^n, specifically that dim(U ∩ V) ≤ min(dim(U), dim(V)).

Discussion Character

  • Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants explore the relationship between the dimensions of the subspaces and their intersection, discussing the implications of basis vectors and linear combinations. Some participants question the clarity of statements made, while others suggest considering the containment of the intersection within the subspaces.

Discussion Status

The discussion is ongoing, with various approaches being suggested, including the use of properties of subspaces and references to group theory. There is recognition of the need for clarity in communication, and some participants are exploring different perspectives on the proof.

Contextual Notes

Some participants note potential typos and unclear statements in the initial posts, which may affect understanding. The discussion also reflects on the assumptions regarding the dimensions of the subspaces involved.

simmonj7
Messages
65
Reaction score
0

Homework Statement


Prove true:
For any subspaces U,V of R^n dim(U intersect V) <= min(dim(U), dim(V))


Homework Equations


Min(a,b) = the minimum value of A and B



The Attempt at a Solution


I know this statement is true however I can't quite figure out where to start on how to prove this...Help please.
 
Physics news on Phys.org
The best way to approach this is to think about the subspace generated by intersection(U,V)... call it W for short. The dimension refers to the size of the basis, so any vector on W will also be found on U and found on V. If you think about V being the bigger one (say size m for dim|V| and size k for dim|U|), a vector w on W will have an expression as a linear combination in the basis of V and in the basis of U. So w can be written as a combination of of m vectors on V , and k vectors on U (k<m). Since they are subspace of the same vector space, they get their basis from the same vector space. Since W is also a subspace of the larger vector space, it gets its basis from that too.

Think of it in the sense that , in order for a vector to be on the basis of W, it has to be on the basis of V and U, since U has less vectors in its basis, there is going to be at least (m-k) vectors on the basis of V that will not be on the basis of W.
 
Ok you have quite a few typos in your statement so what you are trying to say at some points isn't quite clear.
 
(U intersect V) is contained in U and V. Try that.
 
Well I'd say use lagrange's formula from group theory, but I'm not sure how to delineate that.
OK say you have the original vector space X, where X has the basis {e1,e2,e3...en}
for a subspace V of X, the basis of V is a subcollection of the basis of X , ie V has a basis {e1,e5,e7,..e(n-1)} say for a grand total of M vectors in the basis.

now consider another subspace U of X, but this one has {e1,e3,e8,...en} , we'll say K vectors, where K<M.

Now consider the basis of the intersection of U and V =W.
If every vector in the basis of U is in W, then W has dimension k. V will have extra basis vectors that U will not have, so Dim(u,v) would be k. where k is the min (dim(U),dim(V))
but that's assuming that every vector on the basis of U is found on the basis of V.
So that means the dim(u,v) would be less than the min(dim(u),dim(v))
like say X has basis {e1,e2,e3,e4,e5,e6}Dim(X)=6 and U has {e1,e4,e5} (dim U=3) and V has {e1,e3,e4,e6} dim(v)=4
then the only vectors on the basis of W would be e1 and e3 , so it'd have dim(2)
 
Thank you for editing your statement.
I proved it using the properties of a p dimensional subspace which actually works a lot better and is simpler than what you are trying to say.
 

Similar threads

Replies
15
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 16 ·
Replies
16
Views
1K
  • · Replies 5 ·
Replies
5
Views
7K
  • · Replies 4 ·
Replies
4
Views
2K