Greatest lower bound of Vector Space

Click For Summary
SUMMARY

The discussion centers on proving that the set S(V) of all subspaces of a vector space V forms a complete lattice under set inclusion, with the smallest element being {0} and the largest element being V. The least upper bound (lub) of two subspaces S and T is established as S + T, demonstrating that this sum is also a subspace of V. The participants emphasize the need to generalize this proof for infinitely many subspaces, while also addressing the clarity of the argument regarding the least upper bound.

PREREQUISITES
  • Understanding of vector spaces and their properties
  • Familiarity with the concepts of least upper bound (lub) and greatest lower bound (glb)
  • Knowledge of set theory and subspace definitions
  • Basic proof-writing skills in mathematics
NEXT STEPS
  • Study the properties of complete lattices in vector spaces
  • Learn how to generalize proofs for infinite collections of subspaces
  • Explore the concept of direct sums in vector spaces
  • Investigate the implications of glb and lub in functional analysis
USEFUL FOR

Students and educators in linear algebra, mathematicians focusing on abstract algebra, and anyone interested in the foundational aspects of vector space theory.

iamalexalright
Messages
157
Reaction score
0

Homework Statement


Prove:
The set S(V) of all subspaces of a vector space V is a complete lattice under set inclusion, with smallest element {0}, largest element V, meet
glb(S_{i} | i \in K) = \cap_{i \in K} S_{i}
and join
lub(S_{i} | i \in K) = \sum_{i \in K} S_{i}

(Btw, how can I write underneath a symbol instead of at the subscript position?)Solution:
I know there exists a glb and a lub since this is a complete lattice.

I'll start with the lub (least upper bound) and I'll try to show first that if S,T are subspaces of V then:
S + T = lub(S,T)

Let S,T be subspaces of V. Then there exist vectors s \in S and t \in T.

Since s,t \in V(since S and T are subspaces of V) then s + t \in V.
Since all vectors in S,T are in V (I think I'm being repetitive) then all vectors from S summed with all vectors from T is in V hence: S + T is a subspace of V.

Should be obvious that S + T is least upper bound of S and T (is this obvious)?

Since S + T is a subspace of V call it U. Let W be a subspace of V then:
W + U = (S + T) + U = lub{U,V}
You can repeat this to finally show that:
lub{S_{i} | i \in K} = \sum_{i \in K} S_{i}

I think I can show the GLB in the same way.

I know this isn't very robust and probably longer than what is needed (I'm only starting out writing proofs).
 
Physics news on Phys.org
All correct, but there are two remarks I'd like to make:

iamalexalright said:
Should be obvious that S + T is least upper bound of S and T (is this obvious)?

No, I'm sorry, this is not obvious to me.

Since S + T is a subspace of V call it U. Let W be a subspace of V then:
W + U = (S + T) + U = lub{U,V}
You can repeat this to finally show that:
lub{S_{i} | i \in K} = \sum_{i \in K} S_{i}

You say that you repeat this argument, but if you do so, you will only obtain the result for finitely many subspaces. I.e. you will obtain that

lub\{U_1,...,U_n\}=U_1+...+U_n

But I is infinite here. So this case must still be dealt with...
In fact, if you find the result for two factors S and T, then the argument will generalize to infinitely many factors. So focus on the result for two factors for now...

I think I can show the GLB in the same way.

I know this isn't very robust and probably longer than what is needed (I'm only starting out writing proofs).[/QUOTE]
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
3K
Replies
8
Views
2K
  • · Replies 43 ·
2
Replies
43
Views
5K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 5 ·
Replies
5
Views
7K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 0 ·
Replies
0
Views
3K
Replies
34
Views
4K