Proving Properties of Open Sets in $\mathbb{R}^d$

  • Thread starter Thread starter nateHI
  • Start date Start date
  • Tags Tags
    Properties Sets
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
5 replies · 2K views
nateHI
Messages
145
Reaction score
4

Homework Statement


Let ##O## be a proper open subset of ##\mathbb{R}^d## (i.e.## O## is open, nonempty, and is not equal to ##\mathbb{R}^d##). For each ##n\in \mathbb{N}## let
##O_n=\big\{x\in O : d(x,O^c)>1/n\big\}##
Prove that:
(a) ##O_n## is open and ##O_n\subset O## for all ##n\in \mathbb{N}##,
(b) ##O_1\subset O_2 \subset \dots ##, and ##\cup_n O_n=O##
(c) If ##O_n\neq 0## then ##d(O_n, O^c)\ge \frac{1}{n}##
(d) If ##O_n\neq 0## then ##d(O_n, O^c_{n+1})\ge \frac{1}{n(n+1)}##

Homework Equations

The Attempt at a Solution


(a) solved
(b) solved
(c) I'm not sure what the instructor is looking for here since there is no ##n## and no ##x\in O_n## such that ##d(x,O^c)=\frac{1}{n}## since that would contradict the construction of ##O_n##. It seems like the problem statement should be
If ##O_n\neq 0## then ##d(O_n, O^c)> \frac{1}{n}##.
(d) ##d(O_n,O^c_{n+1})=d(O_n,O^c)-d(O_{n+1},O^c)\ge \frac{1}{n}-\frac{1}{n+1}=\frac{1}{n(n+1)}##
 
Physics news on Phys.org
nateHI said:
(c) I'm not sure what the instructor is looking for here since there is no ##n## and no ##x\in O_n## such that ##d(x,O^c)=\frac{1}{n}## since that would contradict the construction of ##O_n##.

The following just a suggestion, not necessarily a useful "hint":

How do your course materials define the distance between two sets? Perhaps to find [itex]d(O_n, O^c)[/itex] you might have to do something like take a limit of distances [itex]d(x_i,O^c)[/itex] with each [itex]d(x_i,O^c) \gt \frac{1}{n}[/itex] but with the sequence of distances converging to [itex]\frac{1}{n}[/itex].
 
Last edited:
Stephen Tashi said:
The following just a suggestion, not necessarily a useful "hint":

How do your course materials define the distance between two sets? Perhaps to find [itex]d(O_n, O^c)[/itex] you might have to do something like take a limit of distances [itex]d(x_i,O^c)[/itex] with each [itex]d(x_i,O^c) \gt \frac{1}{n}[/itex] but with the sequence of distances converging to [itex]\frac{1}{n}[/itex].

The distance between the two sets is ##inf d(x_i, y_i)## where ##x_i\in O_n##, ##y_i\in O^c##. But the problem I see is that by part (a) ##O_n## is open (but bounded) hence the lower bound of ##d(O_n, O^c)## is not attainable even though ##O^c## is closed. Also, the limits don't coincide since
##lim_{n\to\infty} d(O_n,O^c)\to 1/n## but ##lim_{n\to\infty}1/n\to 0##
 
nateHI said:
hence the lower bound of ##d(O_n, O^c)## is not attainable even though ##O^c## is closed.

One need not attain an infimum for it to be an infimum. Let [itex]O[/itex] be the open interval [itex](0,1)[/itex]. and let [itex]N = 4[/itex]. I think [itex]O_n[/itex] is the open interval [itex]( \frac{1}{4}, \frac{3}{4})[/itex]. What is distance between [itex]O^C[/itex] and [itex]( \frac{1}{4}, \frac{3}{4})[/itex] ?.
 
Stephen Tashi said:
One need not attain an infimum for it to be an infimum. Let [itex]O[/itex] be the open interval [itex](0,1)[/itex]. and let [itex]N = 4[/itex]. I think [itex]O_n[/itex] is the open interval [itex]( \frac{1}{4}, \frac{3}{4})[/itex]. What is distance between [itex]O^C[/itex] and [itex]( \frac{1}{4}, \frac{3}{4})[/itex] ?.

OK thanks, I guess saying ##d(O_n, O^c)\ge 1/4## is just another way of writing what the lower bound is. I was probably overthinking ( possibly under-thinking) things.

Does part (d) seem correct?