Distance between closed and open balls in a normed vector space

Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
Problem: Let $bin E$(normed vector space), show that $d(b,B(a,r))=d(b,overlineB(a,r))$.
Notation: $d(a,C)=infd(a,x):xin C$
My attempt: Well, since $B(a,r)subset overline(B)(a,r)$, then $d(b,overlineB(a,r)) leq d(b,B(a,r))$. So, I suppose $d(b,overlineB(a,r)) < d(b,B(a,r))$ to find a contradiction.
The real problem is that I have no idea how to continue nor even if im in the right path.
PD: Please do not use convergence :)
Thanks for the help!
real-analysis general-topology metric-spaces
add a comment |Â
up vote
0
down vote
favorite
Problem: Let $bin E$(normed vector space), show that $d(b,B(a,r))=d(b,overlineB(a,r))$.
Notation: $d(a,C)=infd(a,x):xin C$
My attempt: Well, since $B(a,r)subset overline(B)(a,r)$, then $d(b,overlineB(a,r)) leq d(b,B(a,r))$. So, I suppose $d(b,overlineB(a,r)) < d(b,B(a,r))$ to find a contradiction.
The real problem is that I have no idea how to continue nor even if im in the right path.
PD: Please do not use convergence :)
Thanks for the help!
real-analysis general-topology metric-spaces
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Problem: Let $bin E$(normed vector space), show that $d(b,B(a,r))=d(b,overlineB(a,r))$.
Notation: $d(a,C)=infd(a,x):xin C$
My attempt: Well, since $B(a,r)subset overline(B)(a,r)$, then $d(b,overlineB(a,r)) leq d(b,B(a,r))$. So, I suppose $d(b,overlineB(a,r)) < d(b,B(a,r))$ to find a contradiction.
The real problem is that I have no idea how to continue nor even if im in the right path.
PD: Please do not use convergence :)
Thanks for the help!
real-analysis general-topology metric-spaces
Problem: Let $bin E$(normed vector space), show that $d(b,B(a,r))=d(b,overlineB(a,r))$.
Notation: $d(a,C)=infd(a,x):xin C$
My attempt: Well, since $B(a,r)subset overline(B)(a,r)$, then $d(b,overlineB(a,r)) leq d(b,B(a,r))$. So, I suppose $d(b,overlineB(a,r)) < d(b,B(a,r))$ to find a contradiction.
The real problem is that I have no idea how to continue nor even if im in the right path.
PD: Please do not use convergence :)
Thanks for the help!
real-analysis general-topology metric-spaces
real-analysis general-topology metric-spaces
edited Sep 6 at 14:57
asked Sep 6 at 4:54
duhdave
486
486
add a comment |Â
add a comment |Â
2 Answers
2
active
oldest
votes
up vote
1
down vote
accepted
Let $x in overset - B (a,r)$. Then there exists $x_n subset B (a,r)$ such that $x_n to x$. We have $d(b,B (a,r)) leq d(b,x_n)$ for all $n$. If you let $n to infty$ you get $d(b,B (a,r)) leq d(b,x)$. Taking inf over all $x$ we get $d(b,B (a,r)) leq d(overset - B (a,r))$. For a different proof not involving sequences let $x in overset - B (a,r)$ and $epsilon >0$. There exists $y in B(b,r)$ such that $d(x,y) <epsilon$. We have $d(b,B(a,r))leq d(b,y)<d(b,x)+epsilon$. Take infimum over $x$ to get $d(b,B(a,r))leq d(b,overset - B (a,r))+epsilon$. Since $epsilon$ is arbitrary this gives $d(b,B(a,r))leq d(b,overset - B (a,r))$
Thanks sir, but the proof im aiming at is without convergence nor sequences. Could you elaborate one without that?
â duhdave
Sep 6 at 14:53
1
@dshernandez I have now included another proof.
â Kavi Rama Murthy
Sep 7 at 0:15
add a comment |Â
up vote
1
down vote
A normed vector space $E$ is also a metric space with metric $d(x,y)=|x-y|.$ In a metric space $(E,d)$ let $emptyset ne Csubset E$ and $bin E.$ We define $d(b,C)=inf d(b,c):cin C.$ We have $d(b,c'):c'in bar Csupset d(b,c):cin C$ so $d(b, bar C)leq d(b,C).$
We show that $d(b,bar C)<d(b,C)$ is untenable, and conclude that $d(b,bar C)=d(b,C).$
For brevity of notation let $U=d(b,C)$ and $V=d(b,bar C).$ Suppose $ U-V>0.$ Take $c'in bar C$ such that $d(b,c')leq V+frac U-V2.$ Now $forall cin C;(d(c,b)geq U).$ So for every $cin C$ we have $$d(c,c')geq d(c,b)-d(b,c')geq$$ $$geq U-(V+frac U-V2)=frac U-V2. $$ So the open ball of positive radius $frac U-V2,$ centered at $c',$ is disjoint from $C.$ This contradicts $c'in bar C. $
add a comment |Â
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
accepted
Let $x in overset - B (a,r)$. Then there exists $x_n subset B (a,r)$ such that $x_n to x$. We have $d(b,B (a,r)) leq d(b,x_n)$ for all $n$. If you let $n to infty$ you get $d(b,B (a,r)) leq d(b,x)$. Taking inf over all $x$ we get $d(b,B (a,r)) leq d(overset - B (a,r))$. For a different proof not involving sequences let $x in overset - B (a,r)$ and $epsilon >0$. There exists $y in B(b,r)$ such that $d(x,y) <epsilon$. We have $d(b,B(a,r))leq d(b,y)<d(b,x)+epsilon$. Take infimum over $x$ to get $d(b,B(a,r))leq d(b,overset - B (a,r))+epsilon$. Since $epsilon$ is arbitrary this gives $d(b,B(a,r))leq d(b,overset - B (a,r))$
Thanks sir, but the proof im aiming at is without convergence nor sequences. Could you elaborate one without that?
â duhdave
Sep 6 at 14:53
1
@dshernandez I have now included another proof.
â Kavi Rama Murthy
Sep 7 at 0:15
add a comment |Â
up vote
1
down vote
accepted
Let $x in overset - B (a,r)$. Then there exists $x_n subset B (a,r)$ such that $x_n to x$. We have $d(b,B (a,r)) leq d(b,x_n)$ for all $n$. If you let $n to infty$ you get $d(b,B (a,r)) leq d(b,x)$. Taking inf over all $x$ we get $d(b,B (a,r)) leq d(overset - B (a,r))$. For a different proof not involving sequences let $x in overset - B (a,r)$ and $epsilon >0$. There exists $y in B(b,r)$ such that $d(x,y) <epsilon$. We have $d(b,B(a,r))leq d(b,y)<d(b,x)+epsilon$. Take infimum over $x$ to get $d(b,B(a,r))leq d(b,overset - B (a,r))+epsilon$. Since $epsilon$ is arbitrary this gives $d(b,B(a,r))leq d(b,overset - B (a,r))$
Thanks sir, but the proof im aiming at is without convergence nor sequences. Could you elaborate one without that?
â duhdave
Sep 6 at 14:53
1
@dshernandez I have now included another proof.
â Kavi Rama Murthy
Sep 7 at 0:15
add a comment |Â
up vote
1
down vote
accepted
up vote
1
down vote
accepted
Let $x in overset - B (a,r)$. Then there exists $x_n subset B (a,r)$ such that $x_n to x$. We have $d(b,B (a,r)) leq d(b,x_n)$ for all $n$. If you let $n to infty$ you get $d(b,B (a,r)) leq d(b,x)$. Taking inf over all $x$ we get $d(b,B (a,r)) leq d(overset - B (a,r))$. For a different proof not involving sequences let $x in overset - B (a,r)$ and $epsilon >0$. There exists $y in B(b,r)$ such that $d(x,y) <epsilon$. We have $d(b,B(a,r))leq d(b,y)<d(b,x)+epsilon$. Take infimum over $x$ to get $d(b,B(a,r))leq d(b,overset - B (a,r))+epsilon$. Since $epsilon$ is arbitrary this gives $d(b,B(a,r))leq d(b,overset - B (a,r))$
Let $x in overset - B (a,r)$. Then there exists $x_n subset B (a,r)$ such that $x_n to x$. We have $d(b,B (a,r)) leq d(b,x_n)$ for all $n$. If you let $n to infty$ you get $d(b,B (a,r)) leq d(b,x)$. Taking inf over all $x$ we get $d(b,B (a,r)) leq d(overset - B (a,r))$. For a different proof not involving sequences let $x in overset - B (a,r)$ and $epsilon >0$. There exists $y in B(b,r)$ such that $d(x,y) <epsilon$. We have $d(b,B(a,r))leq d(b,y)<d(b,x)+epsilon$. Take infimum over $x$ to get $d(b,B(a,r))leq d(b,overset - B (a,r))+epsilon$. Since $epsilon$ is arbitrary this gives $d(b,B(a,r))leq d(b,overset - B (a,r))$
edited Sep 6 at 23:49
answered Sep 6 at 5:28
Kavi Rama Murthy
26.5k31438
26.5k31438
Thanks sir, but the proof im aiming at is without convergence nor sequences. Could you elaborate one without that?
â duhdave
Sep 6 at 14:53
1
@dshernandez I have now included another proof.
â Kavi Rama Murthy
Sep 7 at 0:15
add a comment |Â
Thanks sir, but the proof im aiming at is without convergence nor sequences. Could you elaborate one without that?
â duhdave
Sep 6 at 14:53
1
@dshernandez I have now included another proof.
â Kavi Rama Murthy
Sep 7 at 0:15
Thanks sir, but the proof im aiming at is without convergence nor sequences. Could you elaborate one without that?
â duhdave
Sep 6 at 14:53
Thanks sir, but the proof im aiming at is without convergence nor sequences. Could you elaborate one without that?
â duhdave
Sep 6 at 14:53
1
1
@dshernandez I have now included another proof.
â Kavi Rama Murthy
Sep 7 at 0:15
@dshernandez I have now included another proof.
â Kavi Rama Murthy
Sep 7 at 0:15
add a comment |Â
up vote
1
down vote
A normed vector space $E$ is also a metric space with metric $d(x,y)=|x-y|.$ In a metric space $(E,d)$ let $emptyset ne Csubset E$ and $bin E.$ We define $d(b,C)=inf d(b,c):cin C.$ We have $d(b,c'):c'in bar Csupset d(b,c):cin C$ so $d(b, bar C)leq d(b,C).$
We show that $d(b,bar C)<d(b,C)$ is untenable, and conclude that $d(b,bar C)=d(b,C).$
For brevity of notation let $U=d(b,C)$ and $V=d(b,bar C).$ Suppose $ U-V>0.$ Take $c'in bar C$ such that $d(b,c')leq V+frac U-V2.$ Now $forall cin C;(d(c,b)geq U).$ So for every $cin C$ we have $$d(c,c')geq d(c,b)-d(b,c')geq$$ $$geq U-(V+frac U-V2)=frac U-V2. $$ So the open ball of positive radius $frac U-V2,$ centered at $c',$ is disjoint from $C.$ This contradicts $c'in bar C. $
add a comment |Â
up vote
1
down vote
A normed vector space $E$ is also a metric space with metric $d(x,y)=|x-y|.$ In a metric space $(E,d)$ let $emptyset ne Csubset E$ and $bin E.$ We define $d(b,C)=inf d(b,c):cin C.$ We have $d(b,c'):c'in bar Csupset d(b,c):cin C$ so $d(b, bar C)leq d(b,C).$
We show that $d(b,bar C)<d(b,C)$ is untenable, and conclude that $d(b,bar C)=d(b,C).$
For brevity of notation let $U=d(b,C)$ and $V=d(b,bar C).$ Suppose $ U-V>0.$ Take $c'in bar C$ such that $d(b,c')leq V+frac U-V2.$ Now $forall cin C;(d(c,b)geq U).$ So for every $cin C$ we have $$d(c,c')geq d(c,b)-d(b,c')geq$$ $$geq U-(V+frac U-V2)=frac U-V2. $$ So the open ball of positive radius $frac U-V2,$ centered at $c',$ is disjoint from $C.$ This contradicts $c'in bar C. $
add a comment |Â
up vote
1
down vote
up vote
1
down vote
A normed vector space $E$ is also a metric space with metric $d(x,y)=|x-y|.$ In a metric space $(E,d)$ let $emptyset ne Csubset E$ and $bin E.$ We define $d(b,C)=inf d(b,c):cin C.$ We have $d(b,c'):c'in bar Csupset d(b,c):cin C$ so $d(b, bar C)leq d(b,C).$
We show that $d(b,bar C)<d(b,C)$ is untenable, and conclude that $d(b,bar C)=d(b,C).$
For brevity of notation let $U=d(b,C)$ and $V=d(b,bar C).$ Suppose $ U-V>0.$ Take $c'in bar C$ such that $d(b,c')leq V+frac U-V2.$ Now $forall cin C;(d(c,b)geq U).$ So for every $cin C$ we have $$d(c,c')geq d(c,b)-d(b,c')geq$$ $$geq U-(V+frac U-V2)=frac U-V2. $$ So the open ball of positive radius $frac U-V2,$ centered at $c',$ is disjoint from $C.$ This contradicts $c'in bar C. $
A normed vector space $E$ is also a metric space with metric $d(x,y)=|x-y|.$ In a metric space $(E,d)$ let $emptyset ne Csubset E$ and $bin E.$ We define $d(b,C)=inf d(b,c):cin C.$ We have $d(b,c'):c'in bar Csupset d(b,c):cin C$ so $d(b, bar C)leq d(b,C).$
We show that $d(b,bar C)<d(b,C)$ is untenable, and conclude that $d(b,bar C)=d(b,C).$
For brevity of notation let $U=d(b,C)$ and $V=d(b,bar C).$ Suppose $ U-V>0.$ Take $c'in bar C$ such that $d(b,c')leq V+frac U-V2.$ Now $forall cin C;(d(c,b)geq U).$ So for every $cin C$ we have $$d(c,c')geq d(c,b)-d(b,c')geq$$ $$geq U-(V+frac U-V2)=frac U-V2. $$ So the open ball of positive radius $frac U-V2,$ centered at $c',$ is disjoint from $C.$ This contradicts $c'in bar C. $
answered Sep 7 at 5:31
DanielWainfleet
32.2k31644
32.2k31644
add a comment |Â
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2907106%2fdistance-between-closed-and-open-balls-in-a-normed-vector-space%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password