If $x$ is not in the closure of a convex set $A$, is there a point in $A$ that is closer than $x$ is to each point in $A$?Why does a convex set have the same interior points as its closure?Show that the set of points that are nearer $a$ than $b$ with respect to $lVert cdot rVert_2$ is convexOptimality conditions in convex programmingClosed convex set as the intersection of (tangent) half spacesFor any two disjoint convex open sets there is a hyperplane that strictly separates themQuestion about definition of separating hyperplanes (theorem)Approximating disjoint convex sets by subsets with positive separationFinding a convex set that approaches a boundary pointDistance of point, x from closed convex set C when x is not in C.Is the subspace of odd functions of $L^2(-1,1)$ convex?

Has the laser at Magurele, Romania reached the tenth of the Sun power?

When is the exact date for EOL of Ubuntu 14.04 LTS?

Travelling in US for more than 90 days

Connection Between Knot Theory and Number Theory

C++ lambda syntax

Recursively move files within sub directories

"Oh no!" in Latin

A seasonal riddle

Writing in a Christian voice

Would this string work as string?

Is this saw blade faulty?

Name this simple norm equality! (Real Analysis)

What (if any) is the reason to buy in small local stores?

I keep switching characters, how do I stop?

What is the tangent at a sharp point on a curve?

Why is "la Gestapo" feminine?

What do the positive and negative (+/-) transmit and receive pins mean on Ethernet cables?

How to detect sounds in IPA spelling

Why doesn't Gödel's incompleteness theorem apply to false statements?

Can creatures abilities target that creature itself?

Do people actually use the word "kaputt" in conversation?

Calculate Pi using Monte Carlo

Exposing a company lying about themselves in a tightly knit industry (videogames) : Is my career at risk on the long run?

Why does the frost depth increase when the surface temperature warms up?



If $x$ is not in the closure of a convex set $A$, is there a point in $A$ that is closer than $x$ is to each point in $A$?


Why does a convex set have the same interior points as its closure?Show that the set of points that are nearer $a$ than $b$ with respect to $lVert cdot rVert_2$ is convexOptimality conditions in convex programmingClosed convex set as the intersection of (tangent) half spacesFor any two disjoint convex open sets there is a hyperplane that strictly separates themQuestion about definition of separating hyperplanes (theorem)Approximating disjoint convex sets by subsets with positive separationFinding a convex set that approaches a boundary pointDistance of point, x from closed convex set C when x is not in C.Is the subspace of odd functions of $L^2(-1,1)$ convex?













4












$begingroup$


I'm trying to assess the following conjecture:



$textbfConjecture.$ Suppose that $A$ is a non-empty convex subset of $mathbbR^N$ and that $x$ is not in the closure of $A$. Then there is a point $a' in A$ such that $forall a in A, , ||x - a|| > || a' - a ||.$



I am familiar with results that yield this if we assume that $A$ is closed (closest point theorem, strongly separating hyperplane theorem), but I do not want to assume that $A$ is closed.



Edit: What I have in mind here is that if $A$ is closed, then there is some point $a'$ that is closest to $x$, and the perpendicular bisector of $a'x$ strongly separates $x$ and $A$, showing that $a'$ is closer to any point in $A$ than $x$ is. I'm trying to see if the conjecture holds without assuming $A$ is closed.










share|cite|improve this question









New contributor




supergeneric is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$







  • 1




    $begingroup$
    So the problem is that $a'$ might belong to $overline A setminus A$, right?
    $endgroup$
    – Giuseppe Negro
    Mar 13 at 18:02










  • $begingroup$
    @GiuseppeNegro Yes, that's exactly what I'm thinking.
    $endgroup$
    – supergeneric
    Mar 13 at 18:17










  • $begingroup$
    Is $a'$ unique if $A$ is closed? If $a'$ coincides with $P(x)$, the point of $A$ that is closest to $x$, then it is unique. Thus, it is easy to construct a counterexample; just fix $x$ and consider $AsetminusP(x)$. This set can still be convex (it is if $A$ is a circle, for example), but it is not closed, and no $a'$ can exist for the $x$ you fixed earlier.
    $endgroup$
    – Giuseppe Negro
    Mar 13 at 20:49










  • $begingroup$
    @GiuseppeNegro I am not sure if your example with $A$ a circle works. I believe I've come up with an argument that covers this case, so please have a look to see if I've made a mistake in my reasoning.
    $endgroup$
    – K.Power
    Mar 13 at 21:37










  • $begingroup$
    What about taking the closest point to $x$ in $overlineA$ (which always exists) and moving just an infinitesimal quantity away from $x$ on the line passing through $x$ and that point to obtain $a'$? Under the small assumption that $A$ has non-empty interior, this $a'$ can be taken in $A$ and it should do the job, intuitively (then again, there might be some pathological cases...)
    $endgroup$
    – Daniel Robert-Nicoud
    Mar 13 at 22:14















4












$begingroup$


I'm trying to assess the following conjecture:



$textbfConjecture.$ Suppose that $A$ is a non-empty convex subset of $mathbbR^N$ and that $x$ is not in the closure of $A$. Then there is a point $a' in A$ such that $forall a in A, , ||x - a|| > || a' - a ||.$



I am familiar with results that yield this if we assume that $A$ is closed (closest point theorem, strongly separating hyperplane theorem), but I do not want to assume that $A$ is closed.



Edit: What I have in mind here is that if $A$ is closed, then there is some point $a'$ that is closest to $x$, and the perpendicular bisector of $a'x$ strongly separates $x$ and $A$, showing that $a'$ is closer to any point in $A$ than $x$ is. I'm trying to see if the conjecture holds without assuming $A$ is closed.










share|cite|improve this question









New contributor




supergeneric is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$







  • 1




    $begingroup$
    So the problem is that $a'$ might belong to $overline A setminus A$, right?
    $endgroup$
    – Giuseppe Negro
    Mar 13 at 18:02










  • $begingroup$
    @GiuseppeNegro Yes, that's exactly what I'm thinking.
    $endgroup$
    – supergeneric
    Mar 13 at 18:17










  • $begingroup$
    Is $a'$ unique if $A$ is closed? If $a'$ coincides with $P(x)$, the point of $A$ that is closest to $x$, then it is unique. Thus, it is easy to construct a counterexample; just fix $x$ and consider $AsetminusP(x)$. This set can still be convex (it is if $A$ is a circle, for example), but it is not closed, and no $a'$ can exist for the $x$ you fixed earlier.
    $endgroup$
    – Giuseppe Negro
    Mar 13 at 20:49










  • $begingroup$
    @GiuseppeNegro I am not sure if your example with $A$ a circle works. I believe I've come up with an argument that covers this case, so please have a look to see if I've made a mistake in my reasoning.
    $endgroup$
    – K.Power
    Mar 13 at 21:37










  • $begingroup$
    What about taking the closest point to $x$ in $overlineA$ (which always exists) and moving just an infinitesimal quantity away from $x$ on the line passing through $x$ and that point to obtain $a'$? Under the small assumption that $A$ has non-empty interior, this $a'$ can be taken in $A$ and it should do the job, intuitively (then again, there might be some pathological cases...)
    $endgroup$
    – Daniel Robert-Nicoud
    Mar 13 at 22:14













4












4








4


1



$begingroup$


I'm trying to assess the following conjecture:



$textbfConjecture.$ Suppose that $A$ is a non-empty convex subset of $mathbbR^N$ and that $x$ is not in the closure of $A$. Then there is a point $a' in A$ such that $forall a in A, , ||x - a|| > || a' - a ||.$



I am familiar with results that yield this if we assume that $A$ is closed (closest point theorem, strongly separating hyperplane theorem), but I do not want to assume that $A$ is closed.



Edit: What I have in mind here is that if $A$ is closed, then there is some point $a'$ that is closest to $x$, and the perpendicular bisector of $a'x$ strongly separates $x$ and $A$, showing that $a'$ is closer to any point in $A$ than $x$ is. I'm trying to see if the conjecture holds without assuming $A$ is closed.










share|cite|improve this question









New contributor




supergeneric is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$




I'm trying to assess the following conjecture:



$textbfConjecture.$ Suppose that $A$ is a non-empty convex subset of $mathbbR^N$ and that $x$ is not in the closure of $A$. Then there is a point $a' in A$ such that $forall a in A, , ||x - a|| > || a' - a ||.$



I am familiar with results that yield this if we assume that $A$ is closed (closest point theorem, strongly separating hyperplane theorem), but I do not want to assume that $A$ is closed.



Edit: What I have in mind here is that if $A$ is closed, then there is some point $a'$ that is closest to $x$, and the perpendicular bisector of $a'x$ strongly separates $x$ and $A$, showing that $a'$ is closer to any point in $A$ than $x$ is. I'm trying to see if the conjecture holds without assuming $A$ is closed.







convex-analysis convex-optimization






share|cite|improve this question









New contributor




supergeneric is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|cite|improve this question









New contributor




supergeneric is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this question




share|cite|improve this question








edited Mar 14 at 4:29







supergeneric













New contributor




supergeneric is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked Mar 13 at 17:31









supergenericsupergeneric

394




394




New contributor




supergeneric is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





supergeneric is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






supergeneric is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







  • 1




    $begingroup$
    So the problem is that $a'$ might belong to $overline A setminus A$, right?
    $endgroup$
    – Giuseppe Negro
    Mar 13 at 18:02










  • $begingroup$
    @GiuseppeNegro Yes, that's exactly what I'm thinking.
    $endgroup$
    – supergeneric
    Mar 13 at 18:17










  • $begingroup$
    Is $a'$ unique if $A$ is closed? If $a'$ coincides with $P(x)$, the point of $A$ that is closest to $x$, then it is unique. Thus, it is easy to construct a counterexample; just fix $x$ and consider $AsetminusP(x)$. This set can still be convex (it is if $A$ is a circle, for example), but it is not closed, and no $a'$ can exist for the $x$ you fixed earlier.
    $endgroup$
    – Giuseppe Negro
    Mar 13 at 20:49










  • $begingroup$
    @GiuseppeNegro I am not sure if your example with $A$ a circle works. I believe I've come up with an argument that covers this case, so please have a look to see if I've made a mistake in my reasoning.
    $endgroup$
    – K.Power
    Mar 13 at 21:37










  • $begingroup$
    What about taking the closest point to $x$ in $overlineA$ (which always exists) and moving just an infinitesimal quantity away from $x$ on the line passing through $x$ and that point to obtain $a'$? Under the small assumption that $A$ has non-empty interior, this $a'$ can be taken in $A$ and it should do the job, intuitively (then again, there might be some pathological cases...)
    $endgroup$
    – Daniel Robert-Nicoud
    Mar 13 at 22:14












  • 1




    $begingroup$
    So the problem is that $a'$ might belong to $overline A setminus A$, right?
    $endgroup$
    – Giuseppe Negro
    Mar 13 at 18:02










  • $begingroup$
    @GiuseppeNegro Yes, that's exactly what I'm thinking.
    $endgroup$
    – supergeneric
    Mar 13 at 18:17










  • $begingroup$
    Is $a'$ unique if $A$ is closed? If $a'$ coincides with $P(x)$, the point of $A$ that is closest to $x$, then it is unique. Thus, it is easy to construct a counterexample; just fix $x$ and consider $AsetminusP(x)$. This set can still be convex (it is if $A$ is a circle, for example), but it is not closed, and no $a'$ can exist for the $x$ you fixed earlier.
    $endgroup$
    – Giuseppe Negro
    Mar 13 at 20:49










  • $begingroup$
    @GiuseppeNegro I am not sure if your example with $A$ a circle works. I believe I've come up with an argument that covers this case, so please have a look to see if I've made a mistake in my reasoning.
    $endgroup$
    – K.Power
    Mar 13 at 21:37










  • $begingroup$
    What about taking the closest point to $x$ in $overlineA$ (which always exists) and moving just an infinitesimal quantity away from $x$ on the line passing through $x$ and that point to obtain $a'$? Under the small assumption that $A$ has non-empty interior, this $a'$ can be taken in $A$ and it should do the job, intuitively (then again, there might be some pathological cases...)
    $endgroup$
    – Daniel Robert-Nicoud
    Mar 13 at 22:14







1




1




$begingroup$
So the problem is that $a'$ might belong to $overline A setminus A$, right?
$endgroup$
– Giuseppe Negro
Mar 13 at 18:02




$begingroup$
So the problem is that $a'$ might belong to $overline A setminus A$, right?
$endgroup$
– Giuseppe Negro
Mar 13 at 18:02












$begingroup$
@GiuseppeNegro Yes, that's exactly what I'm thinking.
$endgroup$
– supergeneric
Mar 13 at 18:17




$begingroup$
@GiuseppeNegro Yes, that's exactly what I'm thinking.
$endgroup$
– supergeneric
Mar 13 at 18:17












$begingroup$
Is $a'$ unique if $A$ is closed? If $a'$ coincides with $P(x)$, the point of $A$ that is closest to $x$, then it is unique. Thus, it is easy to construct a counterexample; just fix $x$ and consider $AsetminusP(x)$. This set can still be convex (it is if $A$ is a circle, for example), but it is not closed, and no $a'$ can exist for the $x$ you fixed earlier.
$endgroup$
– Giuseppe Negro
Mar 13 at 20:49




$begingroup$
Is $a'$ unique if $A$ is closed? If $a'$ coincides with $P(x)$, the point of $A$ that is closest to $x$, then it is unique. Thus, it is easy to construct a counterexample; just fix $x$ and consider $AsetminusP(x)$. This set can still be convex (it is if $A$ is a circle, for example), but it is not closed, and no $a'$ can exist for the $x$ you fixed earlier.
$endgroup$
– Giuseppe Negro
Mar 13 at 20:49












$begingroup$
@GiuseppeNegro I am not sure if your example with $A$ a circle works. I believe I've come up with an argument that covers this case, so please have a look to see if I've made a mistake in my reasoning.
$endgroup$
– K.Power
Mar 13 at 21:37




$begingroup$
@GiuseppeNegro I am not sure if your example with $A$ a circle works. I believe I've come up with an argument that covers this case, so please have a look to see if I've made a mistake in my reasoning.
$endgroup$
– K.Power
Mar 13 at 21:37












$begingroup$
What about taking the closest point to $x$ in $overlineA$ (which always exists) and moving just an infinitesimal quantity away from $x$ on the line passing through $x$ and that point to obtain $a'$? Under the small assumption that $A$ has non-empty interior, this $a'$ can be taken in $A$ and it should do the job, intuitively (then again, there might be some pathological cases...)
$endgroup$
– Daniel Robert-Nicoud
Mar 13 at 22:14




$begingroup$
What about taking the closest point to $x$ in $overlineA$ (which always exists) and moving just an infinitesimal quantity away from $x$ on the line passing through $x$ and that point to obtain $a'$? Under the small assumption that $A$ has non-empty interior, this $a'$ can be taken in $A$ and it should do the job, intuitively (then again, there might be some pathological cases...)
$endgroup$
– Daniel Robert-Nicoud
Mar 13 at 22:14










2 Answers
2






active

oldest

votes


















1












$begingroup$

This is a slightly heuristic argument, which I think may work. As you say there exists some $bin bar A$ such that $|x-a|>|b-a|$ for all $ain A$ (where $b=P_A(x)$), to avoid triviality we assume $bin bar Abackslash A$. Let us first assume that $overrightarrowxb$ intercepts $A$. So for all $varepsilon>0$ there exists an $a_varepsilonin Acapoverrightarrowxb$ such that $|b-a_varepsilon|<varepsilon$. Set $delta=|x-b|/2$. Convexity implies, for all $ain A$, that angle $overlineabangleoverlinebx$ cannot be acute. This in combination with the fact $x,b,a_delta$ all lie on the same line, and $|b-a_delta|<|b-x|$ implies that $|a-a_delta|<|a-x|$.



enter image description here



As is illustrated above we are using the fact that in a triangle $ABC$, if there exists a point $D$ on $AB$ such that $|AD|<|DB|$ and $angle ADC<pi/2$ we must have $|CA|<|CB|$.



If $overrightarrowxbcap A =emptyset$, I believe we can use a similar argument, but we will have to control the value of $delta$ more tightly (remembering that $a_delta$ is no longer on $overrightarrowxb$) depending on the angle made. If there was to be a counterexample I think it would have to be in this situation.






share|cite|improve this answer











$endgroup$












  • $begingroup$
    Much thanks! I think that this strategy should work. I also think that any counterexamples would have to be in the second case. I’m still thinking about that case; I’ll post if I get somewhere.
    $endgroup$
    – supergeneric
    Mar 14 at 3:07











  • $begingroup$
    @supergeneric I hope you do. If I have time later I will try think about it again.
    $endgroup$
    – K.Power
    Mar 14 at 10:28


















0












$begingroup$

EDIT: I just realized that I misread the question, but I'll leave this here - maybe it helps anyway.



Since you referenced the closest point theorem, I thought you actually wanted to prove the following:



Suppose that $A$ is a non-empty convex subset of $mathbbR^N$ and that $x$ is not in the closure of $A$. Then there is a point $a' in A$ such that $|x - a'| le | x - a |$ for all $a in A$.



This statement is wrong. Take $A=(x,y)in Bbb R^2 : x^2+y^2le 1setminus (0,1)$ and $x=(0,2)$.






share|cite|improve this answer











$endgroup$












  • $begingroup$
    I assume the counterexample is for your version of the conjecture? Because it does not work for the one in the OP. Also, apologies for the lack of clarity in the OP. I am trying to prove the original conjecture, but the reference to the closest point theorem made that confusing! I tried to clarify with an edit.
    $endgroup$
    – supergeneric
    Mar 13 at 18:12











  • $begingroup$
    Never mind - I apologize for not reading carefully enough. Yes, my example shows that the statement at the end of my answer is false, but it does not work for what you are actually interested in.
    $endgroup$
    – Mars Plastic
    Mar 13 at 18:14











  • $begingroup$
    No problem, thanks for looking!
    $endgroup$
    – supergeneric
    Mar 13 at 18:17










Your Answer





StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);






supergeneric is a new contributor. Be nice, and check out our Code of Conduct.









draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3146896%2fif-x-is-not-in-the-closure-of-a-convex-set-a-is-there-a-point-in-a-that-i%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























2 Answers
2






active

oldest

votes








2 Answers
2






active

oldest

votes









active

oldest

votes






active

oldest

votes









1












$begingroup$

This is a slightly heuristic argument, which I think may work. As you say there exists some $bin bar A$ such that $|x-a|>|b-a|$ for all $ain A$ (where $b=P_A(x)$), to avoid triviality we assume $bin bar Abackslash A$. Let us first assume that $overrightarrowxb$ intercepts $A$. So for all $varepsilon>0$ there exists an $a_varepsilonin Acapoverrightarrowxb$ such that $|b-a_varepsilon|<varepsilon$. Set $delta=|x-b|/2$. Convexity implies, for all $ain A$, that angle $overlineabangleoverlinebx$ cannot be acute. This in combination with the fact $x,b,a_delta$ all lie on the same line, and $|b-a_delta|<|b-x|$ implies that $|a-a_delta|<|a-x|$.



enter image description here



As is illustrated above we are using the fact that in a triangle $ABC$, if there exists a point $D$ on $AB$ such that $|AD|<|DB|$ and $angle ADC<pi/2$ we must have $|CA|<|CB|$.



If $overrightarrowxbcap A =emptyset$, I believe we can use a similar argument, but we will have to control the value of $delta$ more tightly (remembering that $a_delta$ is no longer on $overrightarrowxb$) depending on the angle made. If there was to be a counterexample I think it would have to be in this situation.






share|cite|improve this answer











$endgroup$












  • $begingroup$
    Much thanks! I think that this strategy should work. I also think that any counterexamples would have to be in the second case. I’m still thinking about that case; I’ll post if I get somewhere.
    $endgroup$
    – supergeneric
    Mar 14 at 3:07











  • $begingroup$
    @supergeneric I hope you do. If I have time later I will try think about it again.
    $endgroup$
    – K.Power
    Mar 14 at 10:28















1












$begingroup$

This is a slightly heuristic argument, which I think may work. As you say there exists some $bin bar A$ such that $|x-a|>|b-a|$ for all $ain A$ (where $b=P_A(x)$), to avoid triviality we assume $bin bar Abackslash A$. Let us first assume that $overrightarrowxb$ intercepts $A$. So for all $varepsilon>0$ there exists an $a_varepsilonin Acapoverrightarrowxb$ such that $|b-a_varepsilon|<varepsilon$. Set $delta=|x-b|/2$. Convexity implies, for all $ain A$, that angle $overlineabangleoverlinebx$ cannot be acute. This in combination with the fact $x,b,a_delta$ all lie on the same line, and $|b-a_delta|<|b-x|$ implies that $|a-a_delta|<|a-x|$.



enter image description here



As is illustrated above we are using the fact that in a triangle $ABC$, if there exists a point $D$ on $AB$ such that $|AD|<|DB|$ and $angle ADC<pi/2$ we must have $|CA|<|CB|$.



If $overrightarrowxbcap A =emptyset$, I believe we can use a similar argument, but we will have to control the value of $delta$ more tightly (remembering that $a_delta$ is no longer on $overrightarrowxb$) depending on the angle made. If there was to be a counterexample I think it would have to be in this situation.






share|cite|improve this answer











$endgroup$












  • $begingroup$
    Much thanks! I think that this strategy should work. I also think that any counterexamples would have to be in the second case. I’m still thinking about that case; I’ll post if I get somewhere.
    $endgroup$
    – supergeneric
    Mar 14 at 3:07











  • $begingroup$
    @supergeneric I hope you do. If I have time later I will try think about it again.
    $endgroup$
    – K.Power
    Mar 14 at 10:28













1












1








1





$begingroup$

This is a slightly heuristic argument, which I think may work. As you say there exists some $bin bar A$ such that $|x-a|>|b-a|$ for all $ain A$ (where $b=P_A(x)$), to avoid triviality we assume $bin bar Abackslash A$. Let us first assume that $overrightarrowxb$ intercepts $A$. So for all $varepsilon>0$ there exists an $a_varepsilonin Acapoverrightarrowxb$ such that $|b-a_varepsilon|<varepsilon$. Set $delta=|x-b|/2$. Convexity implies, for all $ain A$, that angle $overlineabangleoverlinebx$ cannot be acute. This in combination with the fact $x,b,a_delta$ all lie on the same line, and $|b-a_delta|<|b-x|$ implies that $|a-a_delta|<|a-x|$.



enter image description here



As is illustrated above we are using the fact that in a triangle $ABC$, if there exists a point $D$ on $AB$ such that $|AD|<|DB|$ and $angle ADC<pi/2$ we must have $|CA|<|CB|$.



If $overrightarrowxbcap A =emptyset$, I believe we can use a similar argument, but we will have to control the value of $delta$ more tightly (remembering that $a_delta$ is no longer on $overrightarrowxb$) depending on the angle made. If there was to be a counterexample I think it would have to be in this situation.






share|cite|improve this answer











$endgroup$



This is a slightly heuristic argument, which I think may work. As you say there exists some $bin bar A$ such that $|x-a|>|b-a|$ for all $ain A$ (where $b=P_A(x)$), to avoid triviality we assume $bin bar Abackslash A$. Let us first assume that $overrightarrowxb$ intercepts $A$. So for all $varepsilon>0$ there exists an $a_varepsilonin Acapoverrightarrowxb$ such that $|b-a_varepsilon|<varepsilon$. Set $delta=|x-b|/2$. Convexity implies, for all $ain A$, that angle $overlineabangleoverlinebx$ cannot be acute. This in combination with the fact $x,b,a_delta$ all lie on the same line, and $|b-a_delta|<|b-x|$ implies that $|a-a_delta|<|a-x|$.



enter image description here



As is illustrated above we are using the fact that in a triangle $ABC$, if there exists a point $D$ on $AB$ such that $|AD|<|DB|$ and $angle ADC<pi/2$ we must have $|CA|<|CB|$.



If $overrightarrowxbcap A =emptyset$, I believe we can use a similar argument, but we will have to control the value of $delta$ more tightly (remembering that $a_delta$ is no longer on $overrightarrowxb$) depending on the angle made. If there was to be a counterexample I think it would have to be in this situation.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Mar 14 at 10:27

























answered Mar 13 at 21:20









K.PowerK.Power

3,490926




3,490926











  • $begingroup$
    Much thanks! I think that this strategy should work. I also think that any counterexamples would have to be in the second case. I’m still thinking about that case; I’ll post if I get somewhere.
    $endgroup$
    – supergeneric
    Mar 14 at 3:07











  • $begingroup$
    @supergeneric I hope you do. If I have time later I will try think about it again.
    $endgroup$
    – K.Power
    Mar 14 at 10:28
















  • $begingroup$
    Much thanks! I think that this strategy should work. I also think that any counterexamples would have to be in the second case. I’m still thinking about that case; I’ll post if I get somewhere.
    $endgroup$
    – supergeneric
    Mar 14 at 3:07











  • $begingroup$
    @supergeneric I hope you do. If I have time later I will try think about it again.
    $endgroup$
    – K.Power
    Mar 14 at 10:28















$begingroup$
Much thanks! I think that this strategy should work. I also think that any counterexamples would have to be in the second case. I’m still thinking about that case; I’ll post if I get somewhere.
$endgroup$
– supergeneric
Mar 14 at 3:07





$begingroup$
Much thanks! I think that this strategy should work. I also think that any counterexamples would have to be in the second case. I’m still thinking about that case; I’ll post if I get somewhere.
$endgroup$
– supergeneric
Mar 14 at 3:07













$begingroup$
@supergeneric I hope you do. If I have time later I will try think about it again.
$endgroup$
– K.Power
Mar 14 at 10:28




$begingroup$
@supergeneric I hope you do. If I have time later I will try think about it again.
$endgroup$
– K.Power
Mar 14 at 10:28











0












$begingroup$

EDIT: I just realized that I misread the question, but I'll leave this here - maybe it helps anyway.



Since you referenced the closest point theorem, I thought you actually wanted to prove the following:



Suppose that $A$ is a non-empty convex subset of $mathbbR^N$ and that $x$ is not in the closure of $A$. Then there is a point $a' in A$ such that $|x - a'| le | x - a |$ for all $a in A$.



This statement is wrong. Take $A=(x,y)in Bbb R^2 : x^2+y^2le 1setminus (0,1)$ and $x=(0,2)$.






share|cite|improve this answer











$endgroup$












  • $begingroup$
    I assume the counterexample is for your version of the conjecture? Because it does not work for the one in the OP. Also, apologies for the lack of clarity in the OP. I am trying to prove the original conjecture, but the reference to the closest point theorem made that confusing! I tried to clarify with an edit.
    $endgroup$
    – supergeneric
    Mar 13 at 18:12











  • $begingroup$
    Never mind - I apologize for not reading carefully enough. Yes, my example shows that the statement at the end of my answer is false, but it does not work for what you are actually interested in.
    $endgroup$
    – Mars Plastic
    Mar 13 at 18:14











  • $begingroup$
    No problem, thanks for looking!
    $endgroup$
    – supergeneric
    Mar 13 at 18:17















0












$begingroup$

EDIT: I just realized that I misread the question, but I'll leave this here - maybe it helps anyway.



Since you referenced the closest point theorem, I thought you actually wanted to prove the following:



Suppose that $A$ is a non-empty convex subset of $mathbbR^N$ and that $x$ is not in the closure of $A$. Then there is a point $a' in A$ such that $|x - a'| le | x - a |$ for all $a in A$.



This statement is wrong. Take $A=(x,y)in Bbb R^2 : x^2+y^2le 1setminus (0,1)$ and $x=(0,2)$.






share|cite|improve this answer











$endgroup$












  • $begingroup$
    I assume the counterexample is for your version of the conjecture? Because it does not work for the one in the OP. Also, apologies for the lack of clarity in the OP. I am trying to prove the original conjecture, but the reference to the closest point theorem made that confusing! I tried to clarify with an edit.
    $endgroup$
    – supergeneric
    Mar 13 at 18:12











  • $begingroup$
    Never mind - I apologize for not reading carefully enough. Yes, my example shows that the statement at the end of my answer is false, but it does not work for what you are actually interested in.
    $endgroup$
    – Mars Plastic
    Mar 13 at 18:14











  • $begingroup$
    No problem, thanks for looking!
    $endgroup$
    – supergeneric
    Mar 13 at 18:17













0












0








0





$begingroup$

EDIT: I just realized that I misread the question, but I'll leave this here - maybe it helps anyway.



Since you referenced the closest point theorem, I thought you actually wanted to prove the following:



Suppose that $A$ is a non-empty convex subset of $mathbbR^N$ and that $x$ is not in the closure of $A$. Then there is a point $a' in A$ such that $|x - a'| le | x - a |$ for all $a in A$.



This statement is wrong. Take $A=(x,y)in Bbb R^2 : x^2+y^2le 1setminus (0,1)$ and $x=(0,2)$.






share|cite|improve this answer











$endgroup$



EDIT: I just realized that I misread the question, but I'll leave this here - maybe it helps anyway.



Since you referenced the closest point theorem, I thought you actually wanted to prove the following:



Suppose that $A$ is a non-empty convex subset of $mathbbR^N$ and that $x$ is not in the closure of $A$. Then there is a point $a' in A$ such that $|x - a'| le | x - a |$ for all $a in A$.



This statement is wrong. Take $A=(x,y)in Bbb R^2 : x^2+y^2le 1setminus (0,1)$ and $x=(0,2)$.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Mar 13 at 18:49

























answered Mar 13 at 17:37









Mars PlasticMars Plastic

1,480121




1,480121











  • $begingroup$
    I assume the counterexample is for your version of the conjecture? Because it does not work for the one in the OP. Also, apologies for the lack of clarity in the OP. I am trying to prove the original conjecture, but the reference to the closest point theorem made that confusing! I tried to clarify with an edit.
    $endgroup$
    – supergeneric
    Mar 13 at 18:12











  • $begingroup$
    Never mind - I apologize for not reading carefully enough. Yes, my example shows that the statement at the end of my answer is false, but it does not work for what you are actually interested in.
    $endgroup$
    – Mars Plastic
    Mar 13 at 18:14











  • $begingroup$
    No problem, thanks for looking!
    $endgroup$
    – supergeneric
    Mar 13 at 18:17
















  • $begingroup$
    I assume the counterexample is for your version of the conjecture? Because it does not work for the one in the OP. Also, apologies for the lack of clarity in the OP. I am trying to prove the original conjecture, but the reference to the closest point theorem made that confusing! I tried to clarify with an edit.
    $endgroup$
    – supergeneric
    Mar 13 at 18:12











  • $begingroup$
    Never mind - I apologize for not reading carefully enough. Yes, my example shows that the statement at the end of my answer is false, but it does not work for what you are actually interested in.
    $endgroup$
    – Mars Plastic
    Mar 13 at 18:14











  • $begingroup$
    No problem, thanks for looking!
    $endgroup$
    – supergeneric
    Mar 13 at 18:17















$begingroup$
I assume the counterexample is for your version of the conjecture? Because it does not work for the one in the OP. Also, apologies for the lack of clarity in the OP. I am trying to prove the original conjecture, but the reference to the closest point theorem made that confusing! I tried to clarify with an edit.
$endgroup$
– supergeneric
Mar 13 at 18:12





$begingroup$
I assume the counterexample is for your version of the conjecture? Because it does not work for the one in the OP. Also, apologies for the lack of clarity in the OP. I am trying to prove the original conjecture, but the reference to the closest point theorem made that confusing! I tried to clarify with an edit.
$endgroup$
– supergeneric
Mar 13 at 18:12













$begingroup$
Never mind - I apologize for not reading carefully enough. Yes, my example shows that the statement at the end of my answer is false, but it does not work for what you are actually interested in.
$endgroup$
– Mars Plastic
Mar 13 at 18:14





$begingroup$
Never mind - I apologize for not reading carefully enough. Yes, my example shows that the statement at the end of my answer is false, but it does not work for what you are actually interested in.
$endgroup$
– Mars Plastic
Mar 13 at 18:14













$begingroup$
No problem, thanks for looking!
$endgroup$
– supergeneric
Mar 13 at 18:17




$begingroup$
No problem, thanks for looking!
$endgroup$
– supergeneric
Mar 13 at 18:17










supergeneric is a new contributor. Be nice, and check out our Code of Conduct.









draft saved

draft discarded


















supergeneric is a new contributor. Be nice, and check out our Code of Conduct.












supergeneric is a new contributor. Be nice, and check out our Code of Conduct.











supergeneric is a new contributor. Be nice, and check out our Code of Conduct.














Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid


  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3146896%2fif-x-is-not-in-the-closure-of-a-convex-set-a-is-there-a-point-in-a-that-i%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Moe incest case Sentencing See also References Navigation menu"'Australian Josef Fritzl' fathered four children by daughter""Small town recoils in horror at 'Australian Fritzl' incest case""Victorian rape allegations echo Fritzl case - Just In (Australian Broadcasting Corporation)""Incest father jailed for 22 years""'Australian Fritzl' sentenced to 22 years in prison for abusing daughter for three decades""RSJ v The Queen"

Who is our nearest planetary neighbor, on average?Santa Claus flies to the South PoleSeven Spheres of Unequal Mass, a weighing problem with a twistDescribe a large integerFast Mental Calculation of $7.5^7$Math in Space (without the help of celebrities)Find the value of $bigstar$: Puzzle 8 - InequalityWho drinks beer while running anyway?A Crucial DeliveryRanking And AverageHow long will my money last at roulette?

Daza language Contents Vocabulary Phonology References External links Navigation menudaza1242Daza"Dazaga"eeee178086576