Closed set proof

  • Thread starter STEMucator
  • Start date
  • #1
STEMucator
Homework Helper
2,076
140

Homework Statement



This question has two parts :

(a) Let F be a finite collection of closed sets in ℝn. Prove that UF ( The union of the sets in F ) is always a closed set in ℝn.

(b) Let F be a finite collection of closed intervals An = [[itex]\frac{1}{n}, 1- \frac{1}{n}[/itex]] in ℝ for n = 1,2,3... What do you notice about UF? Is it closed, open, both or niether?

Homework Equations



I know a set S is open ⇔ it is equal to its own interior, that is S = S0.
I know a set S is closed if its compliment ℝn-S is open.
I also know a set S is closed ⇔ B(S) [itex]\subseteq[/itex] S.
I know that the only open and closed sets are ℝn and ∅.
I know a set S is neither open or closed if there is at least one point which has a neighborhood containing points from both S and its compliment.

The Attempt at a Solution



(a) Suppose that F = {[itex] S_1, S_2, ..., S_p | S_i\in ℝ^n, 1 ≤ i ≤ p [/itex]}

Suppose further that :

[tex]Q = \bigcup_{i=1}^{p} S_i[/tex]

We want to show Q is always a closed set in ℝn, so let us show that the compliment of Q, ℝn - Q is open.

We know from F that : [itex]S_i \subseteq B(S_i), \space 1≤ i ≤ p[/itex]. That is, each individual set contains its own boundary.

This implicates to us that : [itex]ℝ^n - S_i[/itex] is open since Si is closed for 1 ≤ i ≤ p now suppose that :

[tex]Q_o = \bigcup_{i=1}^{p} (ℝ^n - S_i)[/tex]

So that Qo is composed of a finite collection of the compliments of F.

Am I on the right track here or have I missed something? Ill attempt (b) after I figure this one out.
 

Answers and Replies

  • #2
HallsofIvy
Science Advisor
Homework Helper
43,021
971
It's impossible to answer this without knowing what definition of "closed set" you are using and what prior theorems you have. If your definition of "closed set" is "its complement is an open set" and you know that the finite union of open sets are open then it is easy.
 
  • #3
STEMucator
Homework Helper
2,076
140
It's impossible to answer this without knowing what definition of "closed set" you are using and what prior theorems you have. If your definition of "closed set" is "its complement is an open set" and you know that the finite union of open sets are open then it is easy.

Sadly all I have are these theorems and propositions. Is what I'm doing wrong? Would I use neighborhoods somehow?
 
  • #4
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
You don't need to use boundaries at all.

I think you were heading in this direction: proving that the union of a finite number of closed sets is closed is equivalent to proving that the intersection of a finite number of open sets is open. This is correct and a useful observation. Thinking in terms of neighborhoods is also a good idea. What fact about neighborhoods characterizes an open set?
 
  • #5
STEMucator
Homework Helper
2,076
140
You don't need to use boundaries at all.

I think you were heading in this direction: proving that the union of a finite number of closed sets is closed is equivalent to proving that the intersection of a finite number of open sets is open. This is correct and a useful observation. Thinking in terms of neighborhoods is also a good idea. What fact about neighborhoods characterizes an open set?

Uhm, if all the points of a set are interior points, then the set is open.

So : [itex]\forall x \in S, \exists δ>0 | N_δ(x) \subseteq S[/itex]
 
Last edited:
  • #6
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
Uhm, if all the points of a set are interior points, then the set is open.

Correct. So what's an interior point? How would you define it in terms of neighborhoods?
 
  • #7
STEMucator
Homework Helper
2,076
140
Correct. So what's an interior point? How would you define it in terms of neighborhoods?

I re - edited my last post, is that what you meant?
 
  • #8
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
I re - edited my last post, is that what you meant?

Yes, good. So here are a few steps toward a proof:

Suppose you have a finite collection of open sets, let's call them [itex]U_1, \ldots, U_M[/itex], and form their intersection:

[tex]I = \bigcap_{m=1}^{M} U_m[/tex].
If [itex]I[/itex] is empty then you're done. (Why?) If [itex]I[/itex] is not empty, then choose any [itex]x \in I[/itex]. The goal is to prove that [itex]x[/itex] is an interior point of [itex]I[/itex]. Thus you need to find a neighborhood [itex]N_\delta(x)[/itex] such that [itex]x \in N_\delta(x) \subset I[/itex].
 
  • #9
STEMucator
Homework Helper
2,076
140
Yes, good. So here are a few steps toward a proof:

Suppose you have a finite collection of open sets, let's call them [itex]U_1, \ldots, U_M[/itex], and form their intersection:

[tex]I = \bigcap_{m=1}^{M} U_m[/tex].
If [itex]I[/itex] is empty then you're done. (Why?) If [itex]I[/itex] is not empty, then choose any [itex]x \in I[/itex]. The goal is to prove that [itex]x[/itex] is an interior point of [itex]I[/itex]. Thus you need to find a neighborhood [itex]N_\delta(x)[/itex] such that [itex]x \in N_\delta(x) \subset I[/itex].

So my proof should look more like :

(a) Suppose that Fc = {[itex] S_1, S_2, ..., S_p | S_i\in ℝ^n, 1 ≤ i ≤ p [/itex]}

Suppose further that :
[tex]Q_c = \bigcup_{i=1}^{p} S_i[/tex]

We want to show Qc which is composed of the union of finitely many closed sets is always a closed set in ℝn. This is equivalent to showing the intersection of finitely many open sets is open.

So suppose Fo = {[itex] U_1, U_2, ..., U_p | U_i\in ℝ^n, 1 ≤ i ≤ p [/itex]} is such a set of finitely many open sets.

We want to show that :

[tex]Q_o = \bigcap_{i=1}^{p} U_i[/tex]

Is an open set?

Sorry about not being to continue this, but I have a shift at work today. Perhaps you'll be on later.

Thanks for the help so far anyway :)
 
  • #10
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
Yes, it looks fine so far. I'm sure if I'm not around when you continue, someone else will jump in and help.
 
  • #11
STEMucator
Homework Helper
2,076
140
Okay now continuing from before.

To prove Qo is an open set. Take x[itex]\in[/itex]Qo. Since Qo is the intersection of finitely many open sets, we know that x is contained within some particular Ui. Since this particular Ui is open, [itex]\exists δ>0 | N_δ(x) \subseteq U_i \Rightarrow N_δ(x) \subseteq Q_o[/itex]. So obviously, any x[itex]\in[/itex]Qo has a neighborhood that is also in Qo, which means Qo is open.

So since I've shown that the intersection of finitely many open sets is open, we can simply say P implies Q in this scenario and we know that the union of finitely many closed sets is closed.

Is this good?
 
Last edited:
  • #12
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
Okay now continuing from before.

To prove Qo is an open set. Take x[itex]\in[/itex]Qo. Since Qo is the intersection of finitely many open sets, we know that x is contained within some particular Ui. Since this particular Ui is open, [itex]\exists δ>0 | N_δ(x) \subseteq U_i \Rightarrow N_δ(x) \subseteq Q_o[/itex]. So obviously, any x[itex]\in[/itex]Qo has a neighborhood that is also in Qo, which means Qo is open.
No, this doesn't work. It's true that [itex]N_\delta(x) \subseteq U_i[/itex], but it does not follow that [itex]N_\delta(x) \subseteq Q_o[/itex]. This is because [itex]Q_o[/itex] is the intersection of [itex]U_i[/itex] with other sets, so in general [itex]Q_o[/itex] is smaller than [itex]U_i[/itex]. You have to take advantage that [itex]x[/itex] is in all of the [itex]U_i[/itex]'s, not just one of them.
 
  • #13
STEMucator
Homework Helper
2,076
140
No, this doesn't work. It's true that [itex]N_\delta(x) \subseteq U_i[/itex], but it does not follow that [itex]N_\delta(x) \subseteq Q_o[/itex]. This is because [itex]Q_o[/itex] is the intersection of [itex]U_i[/itex] with other sets, so in general [itex]Q_o[/itex] is smaller than [itex]U_i[/itex]. You have to take advantage that [itex]x[/itex] is in all of the [itex]U_i[/itex]'s, not just one of them.

I really don't understand what you said there. The reason being is my concluding statement here : 'So obviously, any x∈Qo has a neighborhood that is also in Qo, which means Qo is open'.

Presuming what you're saying to me is correct though, would I simply just change this statement : 'we know that x is contained within some particular Ui. Since this particular Ui is open...'

To : Suppose that [itex]x \in U_i, 1 ≤ i ≤ p[/itex], since every individual Ui is open... blah blah. Then I would finish it off with a P implies Q?
 
  • #14
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
I really don't understand what you said there. The reason being is my concluding statement here : 'So obviously, any x∈Qo has a neighborhood that is also in Qo, which means Qo is open'.
The problem is that this is not "obvious" and in fact it does not follow from what you have written so far.

Presuming what you're saying to me is correct though, would I simply just change this statement : 'we know that x is contained within some particular Ui. Since this particular Ui is open...'

To : Suppose that [itex]x \in U_i, 1 ≤ i ≤ p[/itex], since every individual Ui is open... blah blah. Then I would finish it off with a P implies Q?
Well, you need to carefully spell out the details. You are arguing that there is a neighborhood of x which is entirely contained in [itex]Q_o[/itex]. What is the radius of that neighborhood? It may seem like I'm being pedantic here, but you need to be careful here. If there were infinitely many [itex]U_i[/itex]'s, the theorem is actually false. So your proof needs to use the fact that there are only finitely many.
 
  • #15
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
Here's the main thing wrong with your argument. If x is in [itex]Q_o[/itex], then given [itex]i[/itex], we have [itex]x \in U_i[/itex], and there is a neighborhood of [itex]x[/itex] contained in [itex]U_i[/itex]. OK so far. However: it's not necessarily true that this neighborhood is contained in [itex]Q_o[/itex]. Generally this will not be true. This is because all you know is that the neighborhood is contained in [itex]U_i[/itex]. This same neighborhood is not necessarily contained in any [itex]U_j[/itex] with [itex]j \neq i[/itex].
 
  • #16
STEMucator
Homework Helper
2,076
140
Here's the main thing wrong with your argument. If x is in [itex]Q_o[/itex], then given [itex]i[/itex], we have [itex]x \in U_i[/itex], and there is a neighborhood of [itex]x[/itex] contained in [itex]U_i[/itex]. OK so far. However: it's not necessarily true that this neighborhood is contained in [itex]Q_o[/itex]. Generally this will not be true. This is because all you know is that the neighborhood is contained in [itex]U_i[/itex]. This same neighborhood is not necessarily contained in any [itex]U_j[/itex] with [itex]j \neq i[/itex].
I appreciate you being pedantic, otherwise what would I actually be learning right? My ultimatum is to understand so by all means show me what for.

Okay I understand your argument clearly now. So what struck me the most :

'You have to take advantage that x is in all of the Ui's, not just one of them'

As well as :

'What is the radius of that neighborhood?' ( δ ).

Finally :

'This is because all you know is that the neighborhood is contained in Ui. This same neighborhood is not necessarily contained in any Uj with j≠i'.

So I have to show some circular neighborhood of x with radius δ is contained within ALL of the Ui so that the intersection of these Ui will also contain this neighborhood?
 
  • #17
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
So I have to show some circular neighborhood of x with radius δ is contained within ALL of the Ui so that the intersection of these Ui will also contain this neighborhood?
Yes, that's exactly what you need to show. This will show that [itex]x[/itex] is an interior point of [itex]Q_o[/itex]. Since x was an arbitrary point of [itex]Q_o[/itex], this implies that [itex]Q_o[/itex] is open.
 
  • #18
STEMucator
Homework Helper
2,076
140
Yes, that's exactly what you need to show. This will show that [itex]x[/itex] is an interior point of [itex]Q_o[/itex]. Since x was an arbitrary point of [itex]Q_o[/itex], this implies that [itex]Q_o[/itex] is open.

So we must show : [itex]\forall x \in Q_o, \exists δ > 0| N_δ(x) \subseteq Q_o[/itex]

Suppose [itex]x \in U_i, \forall i≤p.[/itex] Since every Ui is open, we can find a Nδ(x) [itex]\subseteq[/itex] Ui.

Would this be the direction I would be taking then?
 
  • #19
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
So we must show : [itex]\forall x \in Q_o, \exists δ > 0| N_δ(x) \subseteq Q_o[/itex]

Suppose [itex]x \in U_i, \forall i≤p.[/itex] Since every Ui is open, we can find a Nδ(x) [itex]\subseteq[/itex] Ui.

Would this be the direction I would be taking then?
Yes, it's the right direction. However, there's something important to note: the radius [itex]\delta[/itex] of the neighborhood for one of the [itex]U_i[/itex]'s might not work for another (it might be too large). So I suggest making the following small but important change:

Suppose [itex]x \in U_i, \forall i \leq p[/itex]. Since every [itex]U_i[/itex] is open, we can find a [itex]N_{\delta_i}(x) \subseteq U_i[/itex], where the radius [itex]\delta_i[/itex] depends on [itex]i[/itex].

It might be helpful to keep in mind a concrete example. Suppose [itex]U_i = (-1/i, 1/i)[/itex], in other words, the open interval from [itex]-1/i[/itex] to [itex]1/i[/itex]. Now, [itex]x = 0[/itex] is contained in [itex]U_i[/itex] for every [itex]i[/itex]. However, for larger values of [itex]i[/itex], the length of [itex]U_i[/itex] shrinks. So a neighborhood that works for a smaller [itex]i[/itex] might not work for a larger one.

Another important thing to note about this concrete example is that if [itex]i[/itex] is allowed to be arbitrarily large, then [itex]x = 0[/itex] is the ONLY point contained in all of the [itex]U_i[/itex]'s, and therefore there is no neighborhood which will be contained in all of them. This is why the theorem fails if you don't include the restriction that there are only finitely many sets.
 
Last edited:
  • #20
STEMucator
Homework Helper
2,076
140
Yes, it's the right direction. However, there's something important to note: the radius [itex]\delta[/itex] of the neighborhood for one of the [itex]U_i[/itex]'s might not work for another (it might be too large). So I suggest making the following small but important change:

Suppose [itex]x \in U_i, \forall i \leq p[/itex]. Since every [itex]U_i[/itex] is open, we can find a [itex]N_{\delta_i}(x) \subseteq U_i[/itex], where the radius [itex]\delta_i[/itex] depends on [itex]i[/itex].

Yes yes, duly noted makes sense obviously. So knowing that, I shall try to continue here.

Since every neighborhood of x is contained within some Ui, would it follow that every neighborhood of x is also contained within Qo? That would tell us that Qo is equal to its own interior and is therefore open.
 
  • #21
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
Since every neighborhood of x is contained within some Ui...
No, this isn't true. All you know is that each [itex]U_i[/itex] contains SOME neighborhood of x, with some radius [itex]\delta_i[/itex]. Of course, [itex]U_i[/itex] will also contain all neighborhoods of [itex]x[/itex] with radius smaller than [itex]\delta_i[/itex], but not necessarily those with larger radius.

And there may be neighborhoods of [itex]x[/itex] which are not contained in any of the [itex]U_i[/itex]. In the concrete example I gave above, none of the [itex]U_i[/itex]'s will contain a neighborhood of 0 with radius 5. That's larger than any of the sets.
 
  • #22
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
Let's continue for a moment with the concrete example above. Suppose I just have 3 sets: [itex]U_1 = (-1, 1)[/itex], [itex]U_2 = (-1/2, 1/2)[/itex], [itex]U_3 = (-1/3, 1/3)[/itex]. And let's consider just [itex]x = 0[/itex].

What's the largest neighborhood of [itex]x = 0[/itex] which will fit inside [itex]U_1[/itex]? How about [itex]U_2[/itex] and [itex]U_3[/itex]? What's the intersection [itex]U_1\cap U_2 \cap U_3[/itex]? What's the largest neighborhood that will fit inside [itex]U_1 \cap U_2 \cap U_3[/itex]?
 
  • #23
STEMucator
Homework Helper
2,076
140
No, this isn't true. All you know is that each [itex]U_i[/itex] contains SOME neighborhood of x, with some radius [itex]\delta_i[/itex]. Of course, [itex]U_i[/itex] will also contain all neighborhoods of [itex]x[/itex] with radius smaller than [itex]\delta_i[/itex], but not necessarily those with larger radius.

Ahh I didn't see your example before, but now I get what you were getting at.

So since each Ui contains SOME neighborhood of x, would the rest of what I stated follow?
 
  • #24
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
Ahh I didn't see your example before, but now I get what you were getting at.

So since each Ui contains SOME neighborhood of x, would the rest of what I stated follow?

Well, the rest of what you stated is "it follows that every neighborhood of [itex]x[/itex] is also contained in [itex]Q_o[/itex]". This is not true, but that's fine because you don't need that to be true. All you need is that SOME neighborhood of [itex]x[/itex] is contained in [itex]Q_o[/itex].
 
  • #25
STEMucator
Homework Helper
2,076
140
Well, the rest of what you stated is "it follows that every neighborhood of [itex]x[/itex] is also contained in [itex]Q_o[/itex]". This is not true, but that's fine because you don't need that to be true. All you need is that SOME neighborhood of [itex]x[/itex] is contained in [itex]Q_o[/itex].

'All you need is that SOME neighborhood of x is contained in Qo'

Does this not follow from the fact that we've found SOME Ui which contains SOME neighborhood of x? Since Qo is the intersection of these Ui, there will always be at least one neighborhood contained within Qo?
 
  • #26
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
'All you need is that SOME neighborhood of x is contained in Qo'

Does this not follow from the fact that we've found SOME Ui which contains SOME neighborhood of x? Since Qo is the intersection of these Ui, there will always be at least one neighborhood contained within Qo?

Each [itex]U_i[/itex] contains some neighborhood of [itex]x[/itex]. However, these neighborhoods potentially all have different radii (values of [itex]\delta[/itex]). How do you know that one of them will fit within [itex]Q_o[/itex]?

This is not a fatuous question. In my earlier example, [itex]U_i = (-1/i, 1/i)[/itex], every one of these sets contains a neighborhood of [itex]x = 0[/itex], but if [itex]Q_o = \cap_{i = 1}^\infty U_i[/itex], then [itex]Q_o = \{0\}[/itex], so [itex]Q_o[/itex] does not contain ANY neighborhood of [itex]x[/itex]. (And therefore [itex]Q_o[/itex] is not an open set.) Notice that I had to use an infinite number of sets to produce such an example. So the key is to explain why [itex]Q_o[/itex] DOES contain a neighborhood of [itex]x[/itex] if there are only finitely many sets in the intersection.
 
  • #27
STEMucator
Homework Helper
2,076
140
Each [itex]U_i[/itex] contains some neighborhood of [itex]x[/itex]. However, these neighborhoods potentially all have different radii (values of [itex]\delta[/itex]). How do you know that one of them will fit within [itex]Q_o[/itex]?

This is not a fatuous question. In my earlier example, [itex]U_i = (-1/i, 1/i)[/itex], every one of these sets contains a neighborhood of [itex]x = 0[/itex], but if [itex]Q_o = \cap_{i = 1}^\infty U_i[/itex], then [itex]Q_o = \{0\}[/itex], so [itex]Q_o[/itex] does not contain ANY neighborhood of [itex]x[/itex]. (And therefore [itex]Q_o[/itex] is not an open set.) Notice that I had to use an infinite number of sets to produce such an example. So the key is to explain why [itex]Q_o[/itex] DOES contain a neighborhood of [itex]x[/itex] if there are only finitely many sets in the intersection.

Waaaait wait wait. So the intersection of your Ui example will converge to the set {0}. I understand why this happens. I'm a bit confused as to how to prove that a finite intersection will be different though. What if we had taken your example to p instead of ∞. Then would we be able to find a neighborhood inside its intersection?
 
  • #28
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
Waaaait wait wait. So the intersection of your Ui example will converge to the set {0}. I understand why this happens. I'm a bit confused as to how to prove that a finite intersection will be different though. What if we had taken your example to p instead of ∞. Then would we be able to find a neighborhood inside its intersection?
Yes, that's right. If there are only finitely many sets, then the intersection can't collapse to a single point like that. That's the intuitive explanation. Now, how to make the argument formal?

Once again I suggest thinking about a concrete case.

Let's say I have three sets, [itex]U_1[/itex], [itex]U_2[/itex], and [itex]U_3[/itex]. Let's say there is a point [itex]x[/itex] contained in all three, and let's further assume that for each set, we have found a neighborhood that works:

[tex]x \in N_1(x) \subseteq U_1[/tex]
[tex]x \in N_{1/2}(x) \subseteq U_2[/tex]
[tex]x \in N_{1/10}(x) \subseteq U_3[/tex]

In other words, a neighborhood of [itex]x[/itex] with radius 1 fits inside [itex]U_1[/itex], whereas I had to make the neighborhood smaller, radius 1/2, to fit inside [itex]U_2[/itex], and even smaller, radius 1/10, to fit inside [itex]U_3[/itex].

Without knowing anything else about the sets except the above, what radius [itex]\delta[/itex] is guaranteed to give us [itex]x \in N_\delta(x) \subseteq U_1 \cap U_2 \cap U_3[/itex]?
 
  • #29
STEMucator
Homework Helper
2,076
140
Yes, that's right. If there are only finitely many sets, then the intersection can't collapse to a single point like that. That's the intuitive explanation. Now, how to make the argument formal?

Once again I suggest thinking about a concrete case.

Let's say I have three sets, [itex]U_1[/itex], [itex]U_2[/itex], and [itex]U_3[/itex]. Let's say there is a point [itex]x[/itex] contained in all three, and let's further assume that for each set, we have found a neighborhood that works:

[tex]x \in N_1(x) \subseteq U_1[/tex]
[tex]x \in N_{1/2}(x) \subseteq U_2[/tex]
[tex]x \in N_{1/10}(x) \subseteq U_3[/tex]

In other words, a neighborhood of [itex]x[/itex] with radius 1 fits inside [itex]U_1[/itex], whereas I had to make the neighborhood smaller, radius 1/2, to fit inside [itex]U_2[/itex], and even smaller, radius 1/10, to fit inside [itex]U_3[/itex].

Without knowing anything else about the sets except the above, what radius [itex]\delta[/itex] is guaranteed to give us [itex]x \in N_\delta(x) \subseteq U_1 \cap U_2 \cap U_3[/itex]?


Obviously your smallest radius of 1/10 will ensure this I would presume.
 
  • #30
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
Obviously your smallest radius of 1/10 will ensure this I would presume.

Correct. So generalize this. If I have [itex]U_1[/itex], [itex]U_2[/itex], ..., [itex]U_p[/itex] and corresponding neighborhoods such that

[tex]x \in N_{\delta_1}(x) \subseteq U_1[/tex]
[tex]x \in N_{\delta_2}(x) \subseteq U_2[/tex]
...
[tex]x \in N_{\delta_p}(x) \subseteq U_p[/tex]

then what radius [itex]\delta[/itex] will ensure [itex]x \in N_\delta \in \cap_{i=1}^p U_i[/itex]?
 
  • #31
STEMucator
Homework Helper
2,076
140
Correct. So generalize this. If I have [itex]U_1[/itex], [itex]U_2[/itex], ..., [itex]U_p[/itex] and corresponding neighborhoods such that

[tex]x \in N_{\delta_1}(x) \subseteq U_1[/tex]
[tex]x \in N_{\delta_2}(x) \subseteq U_2[/tex]
...
[tex]x \in N_{\delta_p}(x) \subseteq U_p[/tex]

then what radius [itex]\delta[/itex] will ensure [itex]x \in N_\delta \in \cap_{i=1}^p U_i[/itex]?

Sorry for the late response, My differential eqs TA somehow didn't understand the fundamental theorem of calc and I was talking to her for a moment ( lol ).

So I believe that... 0 < δ < 1 would work?
 
  • #32
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
Sorry for the late response, My differential eqs TA somehow didn't understand the fundamental theorem of calc and I was talking to her for a moment ( lol ).

So I believe that... 0 < δ < 1 would work?

No, your answer should be a function of [itex]\delta_1[/itex], [itex]\delta_2[/itex], ..., [itex]\delta_p[/itex].

Recall the concrete example, where we had [itex]\delta_1 = 1[/itex], [itex]\delta_2 = 1/2[/itex], and [itex]\delta_3 = 1/10[/itex]. How did you choose [itex]\delta = 1/10[/itex]?
 
  • #33
STEMucator
Homework Helper
2,076
140
No, your answer should be a function of [itex]\delta_1[/itex], [itex]\delta_2[/itex], ..., [itex]\delta_p[/itex].

Recall the concrete example, where we had [itex]\delta_1 = 1[/itex], [itex]\delta_2 = 1/2[/itex], and [itex]\delta_3 = 1/10[/itex]. How did you choose [itex]\delta = 1/10[/itex]?

Sorry about that terrible answer, I was thinking about it and my laptop decided to die on me so I posted some random garbage.

What i figured was that all the δs over i form a set over the reals and what we want is the min(δ1,...,δp) = δq for some 1≤i≤q≤p.

So Nδq(x) will be contained in all of the other δ neighborhoods which implies that Nδq(x) [itex]\subseteq[/itex] Ui [itex]\forall[/itex]1≤i≤q≤p. So it follows that Nδq(x) [itex]\subseteq[/itex] Qo which tells us that Qo is indeed an open set.
 
  • #34
jbunniii
Science Advisor
Homework Helper
Insights Author
Gold Member
3,475
257
Sorry about that terrible answer, I was thinking about it and my laptop decided to die on me so I posted some random garbage.

What i figured was that all the δs over i form a set over the reals and what we want is the min(δ1,...,δp) = δq for some 1≤i≤q≤p.

So Nδq(x) will be contained in all of the other δ neighborhoods which implies that Nδq(x) [itex]\subseteq[/itex] Ui [itex]\forall[/itex]1≤i≤q≤p. So it follows that Nδq(x) [itex]\subseteq[/itex] Qo which tells us that Qo is indeed an open set.

Yes, that's right. You want to choose [itex]\delta = \min(\delta_1, \delta_2, \ldots, \delta_p)[/itex]. This works precisely because [itex]p[/itex] is finite. Can you see what could go wrong if there were infinitely many deltas?
 
  • #35
STEMucator
Homework Helper
2,076
140
Yes, that's right. You want to choose [itex]\delta = \min(\delta_1, \delta_2, \ldots, \delta_p)[/itex]. This works precisely because [itex]p[/itex] is finite. Can you see what could go wrong if there were infinitely many deltas?

We would wind up with a singleton set... and we both know what happens when we only have a single dot lol. More precisely though, if we had infinitely many deltas, there's no guarantee that we could find a delta to suit our needs?
 

Suggested for: Closed set proof

  • Last Post
Replies
10
Views
439
  • Last Post
Replies
2
Views
250
Replies
7
Views
1K
  • Last Post
Replies
20
Views
629
  • Last Post
Replies
4
Views
335
  • Last Post
Replies
18
Views
660
Replies
11
Views
2K
Replies
13
Views
2K
Replies
6
Views
335
Replies
3
Views
367
Top