Proofs of dimensions and subspaces check

Click For Summary

Homework Help Overview

The discussion revolves around proofs related to dimensions and subspaces in vector spaces, specifically focusing on the existence of subspaces of varying dimensions within an n-dimensional vector space over the reals.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants explore the proof of the existence of subspaces of dimension r for each r between 0 and n, discussing the implications of basis vectors and linear independence.
  • Questions arise regarding the structure of subspaces and the conditions under which certain properties hold, particularly in the context of defining new subspaces.
  • Some participants suggest clarifying claims and restructuring proofs to avoid circular reasoning.

Discussion Status

The discussion is ongoing, with participants providing feedback on each other's proofs and suggesting ways to clarify and strengthen their arguments. There is recognition of the need to define certain terms and conditions clearly, particularly regarding the existence of subspaces.

Contextual Notes

Participants are working within the constraints of homework guidelines, which may limit the extent to which complete solutions can be provided. There is an emphasis on understanding the foundational concepts of vector spaces and subspaces.

harvesl
Messages
9
Reaction score
0
Hi, I'd be grateful if someone could tell me whether these proofs I've done are correct or not. Thanks in advanced.

Let V be an n-dimensional vector space over \mathbb{R}

Prove that V contains a subspace of dimension r for each r such that 0 \leq r \leq n



Since V is n-dimensional, there exists v_1, v_2,...,v_n \in V such that \left\{v_1,v_2,...,v_n\right\} is a basis for V.

For an element x \in V, we can write x as

x = \lambda_1 v_1 + \lambda_2 v_2 + ... + \lambda_n v_n for \lambda_i \in \mathbb{R}

Since Sp\left\{v_1,v_2,...,v_n\right\} = V

Therefore we can also say that

V = \left\{\lambda_1 v_1 + \lambda_2 v_2 + ... + \lambda_n v_n\right\}

Since V is a vector space \left\{(0)\right\} \in V and \left\{(0)\right\} is clearly a 0-dimension subspace of V as it is closed under both addition and multiplication.

Since any non-empty subset of a linearly independent set of vectors is also linearly independent we have that for q, where 1 \leq q \leq n

\left\{v_1, v_2,..., v_q\right\} = \left\{\mu_1 v_1 + \mu_2 v_2 + ... + \mu_q v_q : \mu_i \in \mathbb{R}\right\}<br /> <br /> \subseteq \left\{\lambda_1 v_1 + \lambda_2 v_2 + ... + \lambda_n v_n\right\} = V




---
Second question
---

Let U,W be subspaces of V with U \subseteq W. Show that there is some subspace W&#039; of V such that W \cap W&#039; = U and W +W&#039; = V


Firstly, since W \cap W&#039; = U,\ \ \ U \subseteq W&#039; because if x \in U then x \in W&#039;

Therefore we can write that

W&#039; = U \cup \left\{v_1, v_2, ... , v_m\right\}

For some vectors (v_1, v_2, ... , v_m) \in V \backslash U but (v_1, v_2, ... , v_m) \notin W because if any v_i \in W then v_i \in W \cap W&#039; and we would have that W \cap W&#039; \neq U

Since dim(V) = n, if we set dim(W) = x we get that

dim(\left\{v_1, v_2, ... , v_m\right\}) = m = n-x

Hence we can find m linearly independent \left\{v_1, v_2, ... , v_m\right\} \notin Sp(W) to give

W \cap W&#039; = W \cap (U \cup \left\{v_1, v_2, ... , v_m\right\}) = U

and

W + W&#039; = \left\{w + w&#039; : w \in W, w&#039; \in W&#039;\right\} = Sp(W \cup W&#039;) = V

As dim(W \cup W&#039;) = x + n-x = n


Again, thanks to anyone who helps!
 
Physics news on Phys.org
Your first answer sounds a bit ... confused, if I may call it that. You correctly noticed that V is spanned by n basis vectors, and that taking the first r of these should give you a subspace of dimension r. So what I would do, is write that down as a claim, rather than a conclusion. Proving the claim should then be straightforward.

For the second exercise, you seem to be using the conclusion as the first step of the proof. You need to show that a W' satisfying those conditions exists. Until you've done that, you cannot assume it. However, just like I said before: you can make a claim ("define W' as ...") and then prove that it satisfies the conditions. That proof will be very similar to what you've already got (just make sure you don't use the conclusion, i.e. don't use that W cap W&#039; = U).
 
CompuChip said:
Your first answer sounds a bit ... confused, if I may call it that. You correctly noticed that V is spanned by n basis vectors, and that taking the first r of these should give you a subspace of dimension r. So what I would do, is write that down as a claim, rather than a conclusion. Proving the claim should then be straightforward.

For the second exercise, you seem to be using the conclusion as the first step of the proof. You need to show that a W' satisfying those conditions exists. Until you've done that, you cannot assume it. However, just like I said before: you can make a claim ("define W' as ...") and then prove that it satisfies the conditions. That proof will be very similar to what you've already got (just make sure you don't use the conclusion, i.e. don't use that W cap W&#039; = U).

Yeah, I've redone the second proof - currently working on the first.

U = Sp\left\{u_1, u_2, ... , u_k\right\}

Where \left\{u_1, u_2, ... , u_k\right\} is linearly independent

We can extend this to a basis of W as U \subseteq W

So for w_{k+1}, w_{k+2}, ... , w_l \in W \backslash U

We have that

W = Sp\left\{u_1, u_2, ... , u_k, w_{k+1}, w_{k+2}, ... , w_l\right\}

Which we can, again, extend to a basis of V as W \subseteq V.

So for v_{l+1}, v_{l+2}, ... , v_n \notin W

We have that

V = Sp\left\{u_1, u_2, ... , u_k, w_{k+1}, w_{k+2}, ... , w_l, v_{l+1}, v_{l+2}, ... , v_n\right\}

Since W&#039; \subseteq V is a subspace it can be written as the span of a subset of the vectors forming the basis of V

If we define

W&#039; = Sp\left\{u_1, u_2, ... , u_k, v_{l+1}, v_{l+2}, ... , v_n\right\}

W \cap W&#039; = Sp[\left\{u_1, u_2, ... , u_k, w_{k+1}, w_{k+2}, ... , w_l\right\} \cap \left\{u_1, u_2, ... , u_k, v_{l+1}, v_{l+2}, ... , v_n\right\}] = Sp\left\{u_1, u_2, ... , u_k\right\} = U

and

W + W&#039; = Sp[\left\{u_1, u_2, ... , u_k, w_{k+1}, w_{k+2}, ... , w_l\right\} \cup \left\{u_1, u_2, ... , u_k, v_{l+1}, v_{l+2}, ... , v_n\right\}]<br /> <br /> \<br /> <br /> = Sp\left\{u_1, u_2, ... , u_k, w_{k+1}, w_{k+2}, ... , w_l, v_{l+1}, v_{l+2}, ... , v_n\right\} = V
 
harvesl said:
Since W&#039; \subseteq V is a subspace it can be written as the span of a subset of the vectors forming the basis of V

If we define

W&#039; = Sp\left\{u_1, u_2, ... , u_k, v_{l+1}, v_{l+2}, ... , v_n\right\}

I would switch those statements:

Define
W&#039; = Sp\left\{u_1, u_2, ... , u_k, v_{l+1}, v_{l+2}, ... , v_n\right\}

Since W&#039; \subseteq V can be written as the span of a subset of the vectors forming the basis of V, it is a subspace of V.

This shows that W' is a subspace, which is one of the things that you are trying to prove.
 
CompuChip said:
I would switch those statements:



This shows that W' is a subspace, which is one of the things that you are trying to prove.

Ah yeah, that makes more sense - define W' and then state it clearly is a subspace. Also, for the first question regarding showing there is a subspace of dimension r for each r between 0 and n - can this also be best done by extending the basis n times from the 0-dimensional subspace S = Sp{0}?

So say we can add some vector in V giving S1 = Sp{0, v1} which is 1-dimensional and linearly independent.

Then add another vector v2 in V\S1 to give S2 = Sp{0, v1, v2} which is 2-dimensional and linearly independent

We can continue this all the way until Sn = Sp{0, v1, v2, ..., vn} which is an n-dimensional linearly independent subspace?
 
Yep. A common way of writing that down is starting with "Let 0 \le r \le n. Then define V_r := \cdots" and proceed to show that it is the required subspace. Just like before, really.
 
Thanks!
 

Similar threads

Replies
15
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
34
Views
4K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
8
Views
2K
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K