71
$\begingroup$

I'm having a difficult time understanding this statement. Can someone please explain with a concrete example?

  • 0
    (Let's try again, hopefully this time without typos) A nice proof of a more general result (for fields of characteristic 0): http://mathoverflow.net/questions/43538/wonderful-applications-of-the-vandermonde-determinant2013-05-08

6 Answers 6

85

The reason why this can happen is that all vector spaces, and hence subspaces too, must be closed under addition (and scalar multiplication). The union of two subspaces takes all the elements already in those spaces, and nothing more. In the union of subspaces $W_1$ and $W_2$, there are new combinations of vectors we can add together that we couldn't before, like $v_1 + w_2$ where $v_1 \in W_1$ and $w_2 \in W_2$.

For example, take $W_1$ to be the $x$-axis and $W_2$ the $y$-axis, both subspaces of $\mathbb{R}^2$.
Their union includes both $(3,0)$ and $(0,5)$, whose sum, $(3,5)$, is not in the union. Hence, the union is not a vector space.

  • 12
    thanks, I wish you were my math teacher2011-10-12
  • 0
    This is a nice explanation, but I would like to add an important pointer too. One you are satisfied with the answer to the question about Union of two spaces not being a space, the next logical question would be "How do I then define the joining of two spaces?". The answer lies in what is called the direct sum: https://en.wikipedia.org/wiki/Direct_sum. The idea is to fill the gap. Put elements which stop the union of spaces to be a space by putting elements required into the collection.2018-06-01
60

The union of two subspaces is a subspace if and only if one of the subspaces is contained in the other.

The "if" part should be clear: if one of the subspaces is contained in the other, then their union is just the one doing the containing, so it's a subspace.

Now suppose neither subspace is contained in the other subspace. Then there are vectors $x$ and $y$ such that $x$ is in the first subspace but not the second, and $y$ is in the second subspace but not the first. Then I claim the $x+y$ can't be in either subspace, hence, can't be in their union; hence, the union is not closed under addition, so it's not a subspace.

So, let's prove the claim. If $x+y$ is in the first subspace, well, so is $x$, so $-x$ is also there, so $(x+y)+(-x)$ is there, but that's just $y$, which we know is not there. We've reached a contradiction on the assumption that $x+y$ was in the first subspace, so it can't be. Very similar reasoning shows it can't be in the second subspace, either, and we're done.

  • 0
    But didn't a union creates a new subspace? E.g. suppose we have beforehand the three subspaces: *V₁ = (x,0)*, *V₂ = (0,y)*, and *V₃ = (x,y)*. Now it seems to me that *V₁ ∪ V₂ ≅ V₃*, doesn't it?2015-11-12
  • 0
    Do you know what a subspace is? It's not the same thing as a subset. And union isn't the same thing as addition.2015-11-12
  • 0
    [Wiki says](https://en.wikipedia.org/wiki/Linear_subspace), subspace is a subset of a higher dimension space. Then we could just consider my example to be subspace of three-dimension vector space. And sorry, I didn't get the point of "union vs addition" — don't the question asks about the union?2015-11-12
  • 1
    Wiki says a subspace is a vector space. Yes, the question asks about union, but you seem to be doing addition to get $V_3$ from $V_1$ and $V_2$. $(x,0)+(0,y)=(x,y)$. I don't see how to make any sense out of $(x,0)\cup(0,y)=(x,y)$.2015-11-12
22

If $W_1$ and $W_2$ are subspaces then $W_1 \cup W_2$ is a subspace if and only if $W_1 \subset W_2$ or $W_2 \subset W_1$.

Proof:

($\Leftarrow$) This is the easy direction.

If $W_1 \subset W_2$ or $W_2 \subset W_1$ then we have $W_1 \cup W_2 = W_2$ or $W_1 \cup W_2 = W_1$, respectively. So $W_1 \cup W_2$ is a subspace as $W_1$ and $W_2$ are subspaces.

($\Rightarrow$) This is the harder direction and I give a direct proof.

Assuming $W_2 \not\subset W_1$, I'll show $W_1 \subset W_2$. Let $x \in W_1$ and $y \in W_2 - W_1$. So, by the definition of the union, we have $x \in W_1\cup W_2$ and $y \in W_1\cup W_2$. Therefore, as $W_1 \cup W_2$ is a subspace, $x + y \in W_1 \cup W_2$ which, again by the definition of the union, means that $x + y\in W_1$ or $x+y\in W_2$. If $x + y \in W_1$ then, as $W_1$ is a subspace, $y = (x + y) + (-x) \in W_1$ which is impossible as $y \in W_2-W_1$. So it must be that $x + y \in W_2$ in which case, as $W_2$ is a subspace, $x = (x + y) + (-y) \in W_2$. Therefore, as $x$ was arbitrary, $W_1 \subset W_2$ as desired. $_\Box$

  • 0
    You assumed that $x+y \in W_2$. For any fixed $x$, fine, $x+y$ must lie in $W_1$ or $W_2$. But to show $W_1 \subset W_2$ you need to get the same conclusion for all $x \in W_1$. It seems to me that you have not argued for this.2013-05-08
  • 1
    By the way, I don't view the other answers as giving a true proof by contradiction. They are proving the contrapositive: if neither of $W_1$ and $W_2$ contains the other, then $W_1 \cup W_2$ is not a subspace.2013-05-08
  • 0
    About your first comment: I don't understand. I've chosen $x \in W_1$, but it's a completely arbitrary choice so why isn't that enough? I always get the same conclusion don't I? About your second comment: Yes, I suppose you're right. I'd been searching online for a direct proof and all of the ones I came across were proofs by contradiction (well, with hindsight, maybe they weren't). Re-reading Gerry's proof I definitely see he's proving the contrapositive.2013-05-08
  • 1
    @BryanUrízar You just proved that *if $x+y\in W_2$, then $x\in W_2$*. But it could be that $x+y\in W_1$, in which case the conclusion is that $y\in W_1$. So, you have shown: Given any $x\in W_1$ and any $y\in W_2$, either $x\in W_2$, or $y\in W_1$. This is not quite yet what you need in order to conclude $W_1\subset W_2$ or $W_2\subset W_1$.2013-05-08
  • 0
    Why isn't that enough? I thought that by assuming $x + y \in W_2$ I'm not losing anything as it was $x + y \in W_1$ **or** $x + y \in W_2$ so one of these (or both) must hold. Not assuming either of them I would get like you write $x \in W_2$ or $y \in W_1$ which means $W_1 \subset W_2$ or $W_2 \subset W_1$, doesn't it?2013-05-08
  • 0
    I searched online and I've found a similar proof to mine. The only difference is they assume $x + y \in W_1$ and then they assume $x + y \in W_2$. Is this my mistake? That I only assumed one? Because I honestly don't see why what @AndresCaicedo wrote isn't enough. Here is a link to this solution (problem 5): http://www.math.ucla.edu/~blakehunter/math115a/Math115AHW1Soln.pdf2013-05-08
  • 0
    @BryanUrízar You have that given $x\in W_1$ and $y\in W_2$, either $x\in W_2$ or $y\in W_1$. If you know that *every time* you pick a pair $(x,y)$, the first case occurs, then you conclude $W_1\subset W_2$. In you know that every time, it is the second that occurs, then $W_2\subset W_1$. What do you do when you have a pair $x_1,y_1$ with $x_1\in W_2$, and a different pair $x_2,y_2$ with $y_2\in W_1$?2013-05-08
  • 0
    @AndresCaicedo Isn't it the same argument? I don't feel like I'm following what you mean. Care to explain more please?2013-05-09
  • 1
    @AndresCaicedo Okay, I finally understand what you've been trying to tell me. I've corrected the proof and it should be fine now.2013-05-10
  • 1
    @Bryan: yes, it's correct now. I'm glad you took the time to work out the problem and fix it.2013-05-10
  • 0
    There you go. Yes, that's the correct argument. +12013-05-10
  • 0
    Thanks for the help from both of you. Something that was meant to help others turned out helping me instead :) Thanks.2013-05-10
  • 0
    @LePressentiment Please don't edit my answer. I think it is completely unnecessary and I have received quite a few up votes on the original so I have reverted back to it. Thank-you.2013-10-14
  • 0
    @11E99F: No problem! You're welcome. Howbeit, I register that your reversion is not to the original, in view of your alteration of your 1st paragraph subsequent to my edit, which would question the "completely unnecessary" charge.2013-10-26
  • 0
    @LePressentiment If you look at the time stamps, I did revert back to the original. Nonetheless, even the change I made was unnecessary as it doesn't change the substance of my answer and I could remove the line altogether. My comment was mostly in regards to the (ugly) re-formatting of my answer which I believe was completely unnecessary as I don't feel it made the answer any easier to understand, but rather just cluttered it.2013-10-26
  • 0
    I find it rather funny how people are down voting my answer now :)2013-10-28
11

This direct proof in both directions had been founded upon buri's (ie: user 70692) answer, whose comment induces me to post my edition separately for want of helping others.


If $W_1$ and $W_2$ are subspaces then $W_1 \cup W_2$ is a subspace if and only if $W_1 \subset W_2$ or $W_2 \subset W_1$.

Proof: ($\Leftarrow$) This is the easier direction.

If $W_1 \subset W_2$ or $W_2 \subset W_1$ then we have $W_1 \cup W_2 = W_2$ or $W_1 \cup W_2 = W_1$, respectively.
So $W_1 \cup W_2$ is a subspace as $W_1$ and $W_2$ are subspaces.

($\Rightarrow$) This is the harder direction. We are given that $W_1 \cup W_2$ is a subspace. Use the proof technique on P136 of Velleman's How to Prove It, 2nd Ed: break the proof into 2 cases. In each case, prove $W_2 \subset W_1$ or $W_1 \subset W_2$.

$\bbox[5px,border:2px solid green]{\text{ 1st case : } W_2 \subset W_1 \text{ is true }} \;$ Then the disjunction $W_2 \subset W_1$ OR $W_1 \subset W_2$ is trivially true.

$\bbox[5px,border:2px solid green]{\text{ 2nd case : } W_2 \not\subset W_1} \;$ Then the disjunction is true $\iff$ $W_1 \subset W_2$. Prove this directly.

Let $x \in W_1$ and $y \in W_2 - W_1$.
By the definition of the union, we have $x \in W_1\cup W_2$ and $y \in W_1\cup W_2$.
As $W_1 \cup W_2$ is a subspace, $x + y \in W_1 \cup W_2$ which, again by the definition of the union, means that $x + y\in W_1$ or $x+y\in W_2$.

If $x + y \in W_1$, then as $W_1$ is a subspace, $y = (x + y) + (-x) \in W_1$.
This is impossible because $y$ was let $\in W_2-W_1$ in the beginning.

So it must be that $x + y \in W_2$, in which case, as $W_2$ is a subspace, $x = (x + y) + (-y) \in W_2$.
As $x$ was arbitrary, $W_1 \subset W_2$ as desired. $\quad \Box$

  • 1
    I don't understand why would you post a duplicate of 11E99F's answer.2013-10-26
  • 0
    This is not a proof by contraposition.2013-10-26
  • 5
    @PedroTamaroff: As this isn't identical but analogous, for example I essayed to detail more, and owing to buri's comments, I posted separately.2013-10-27
  • 1
    @buri: Thank you. Emended.2013-10-27
  • 0
    I prefer this answer more because of the more detailed explaination: I can see the motivation for the proof now when you said you break it into 2 cases. Thanks very much !2018-07-15
1

Take $V_1$ and $V_2$ to be the subspaces of the points on the x and y axis respectively. The union $W = V_1 \cup V_2$ is not a subspace since it is not closed under addition. Take $w_1 = (1,0)$ and $w_2 = (0,1)$. Then $w_1,w_2 \in W$, but $w_1 + w_2 \notin W$.

  • 0
    What does this add to the existing 3-5 year old answers? See especially the top-voted, and accepted, answer.2016-11-30
0

To prove that a vector(U) is a subspace of a vector space(V). we need to prove that a+$\alpha $b,(where $\alpha$ is any scalar belonging to the field of the vector space) belongs to U.

so we will make that the two vectors make a single vector. And that is possible only when one of the vector space is a subset of the other.

  • 1
    For some basic information about writing mathematics at this site see, *e.g.*, [here](/help/notation), [here](//math.meta.stackexchange.com/q/5020), [here](//meta.stackexchange.com/a/70559) and [here](//math.meta.stackexchange.com/q/1773).2018-06-27
  • 0
    thanks for helping2018-06-29