Prove the supporting hyperplane theorem for convex sets in Euclidean spaces
$begingroup$
Let $Asubset Bbb R^n$ be convex and $pinpartial Ane varnothing$, prove that $exists vinBbb R^n$ such that
$$v^T(x-p)ge 0,quad forall xin A.$$
Note that the separation may not be strict (say, if $A$ is itself a hyperplane etc).
Since $text{int}, A$ and $p$ are disjoint and convex, there exists $vinBbb R^n$ such that $v^T(x-p)>0,,forall xintext{int}, A$. Now the major task is to pass this result to $A$ and $p$.
Indeed I only need to show that each point in $A$ can be approximated by points in its interior. However this may not be true, since $A$ may have empty interior. Even if $A$ has nonempty interior, it's not immediately clear why points $A$ can be approximated by its interior points, though geometrically it seems obvious.
So now there are two major problems:
1). When $A$ has empty interior, then $A$ must lie in a hyperplane. In other words, $A$ has affiné dimension less than $n$. (This would be clearly false in infinite dimensional spaces, say $A$ is the range of an injective compact operator. So I guess the finite dimensionality has a key role to play here.)
2). If $A$ has nonempty interior, then any point in $A$ can be approximated by points in its interior.
Looking forward to any help. Cheers.
EDIT
Just a little caveat: you might be very tempted to use, perhaps implicitly, some "advanced" properties of convex sets like "any convex set in $Bbb R^n$ is the intersection of affine sets". But this may lead to circular reasoning, because, for instance, the proof of the property mentioned just above is, AFAIK, based exactly on the supporting hyperplane theorem which we want to prove here.
functional-analysis convex-analysis convex-optimization convex-geometry
$endgroup$
add a comment |
$begingroup$
Let $Asubset Bbb R^n$ be convex and $pinpartial Ane varnothing$, prove that $exists vinBbb R^n$ such that
$$v^T(x-p)ge 0,quad forall xin A.$$
Note that the separation may not be strict (say, if $A$ is itself a hyperplane etc).
Since $text{int}, A$ and $p$ are disjoint and convex, there exists $vinBbb R^n$ such that $v^T(x-p)>0,,forall xintext{int}, A$. Now the major task is to pass this result to $A$ and $p$.
Indeed I only need to show that each point in $A$ can be approximated by points in its interior. However this may not be true, since $A$ may have empty interior. Even if $A$ has nonempty interior, it's not immediately clear why points $A$ can be approximated by its interior points, though geometrically it seems obvious.
So now there are two major problems:
1). When $A$ has empty interior, then $A$ must lie in a hyperplane. In other words, $A$ has affiné dimension less than $n$. (This would be clearly false in infinite dimensional spaces, say $A$ is the range of an injective compact operator. So I guess the finite dimensionality has a key role to play here.)
2). If $A$ has nonempty interior, then any point in $A$ can be approximated by points in its interior.
Looking forward to any help. Cheers.
EDIT
Just a little caveat: you might be very tempted to use, perhaps implicitly, some "advanced" properties of convex sets like "any convex set in $Bbb R^n$ is the intersection of affine sets". But this may lead to circular reasoning, because, for instance, the proof of the property mentioned just above is, AFAIK, based exactly on the supporting hyperplane theorem which we want to prove here.
functional-analysis convex-analysis convex-optimization convex-geometry
$endgroup$
add a comment |
$begingroup$
Let $Asubset Bbb R^n$ be convex and $pinpartial Ane varnothing$, prove that $exists vinBbb R^n$ such that
$$v^T(x-p)ge 0,quad forall xin A.$$
Note that the separation may not be strict (say, if $A$ is itself a hyperplane etc).
Since $text{int}, A$ and $p$ are disjoint and convex, there exists $vinBbb R^n$ such that $v^T(x-p)>0,,forall xintext{int}, A$. Now the major task is to pass this result to $A$ and $p$.
Indeed I only need to show that each point in $A$ can be approximated by points in its interior. However this may not be true, since $A$ may have empty interior. Even if $A$ has nonempty interior, it's not immediately clear why points $A$ can be approximated by its interior points, though geometrically it seems obvious.
So now there are two major problems:
1). When $A$ has empty interior, then $A$ must lie in a hyperplane. In other words, $A$ has affiné dimension less than $n$. (This would be clearly false in infinite dimensional spaces, say $A$ is the range of an injective compact operator. So I guess the finite dimensionality has a key role to play here.)
2). If $A$ has nonempty interior, then any point in $A$ can be approximated by points in its interior.
Looking forward to any help. Cheers.
EDIT
Just a little caveat: you might be very tempted to use, perhaps implicitly, some "advanced" properties of convex sets like "any convex set in $Bbb R^n$ is the intersection of affine sets". But this may lead to circular reasoning, because, for instance, the proof of the property mentioned just above is, AFAIK, based exactly on the supporting hyperplane theorem which we want to prove here.
functional-analysis convex-analysis convex-optimization convex-geometry
$endgroup$
Let $Asubset Bbb R^n$ be convex and $pinpartial Ane varnothing$, prove that $exists vinBbb R^n$ such that
$$v^T(x-p)ge 0,quad forall xin A.$$
Note that the separation may not be strict (say, if $A$ is itself a hyperplane etc).
Since $text{int}, A$ and $p$ are disjoint and convex, there exists $vinBbb R^n$ such that $v^T(x-p)>0,,forall xintext{int}, A$. Now the major task is to pass this result to $A$ and $p$.
Indeed I only need to show that each point in $A$ can be approximated by points in its interior. However this may not be true, since $A$ may have empty interior. Even if $A$ has nonempty interior, it's not immediately clear why points $A$ can be approximated by its interior points, though geometrically it seems obvious.
So now there are two major problems:
1). When $A$ has empty interior, then $A$ must lie in a hyperplane. In other words, $A$ has affiné dimension less than $n$. (This would be clearly false in infinite dimensional spaces, say $A$ is the range of an injective compact operator. So I guess the finite dimensionality has a key role to play here.)
2). If $A$ has nonempty interior, then any point in $A$ can be approximated by points in its interior.
Looking forward to any help. Cheers.
EDIT
Just a little caveat: you might be very tempted to use, perhaps implicitly, some "advanced" properties of convex sets like "any convex set in $Bbb R^n$ is the intersection of affine sets". But this may lead to circular reasoning, because, for instance, the proof of the property mentioned just above is, AFAIK, based exactly on the supporting hyperplane theorem which we want to prove here.
functional-analysis convex-analysis convex-optimization convex-geometry
functional-analysis convex-analysis convex-optimization convex-geometry
edited Jan 14 '17 at 10:47
Vim
asked Jan 14 '17 at 6:23
VimVim
8,07731348
8,07731348
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
First, since the set $A$ is convex, the point $pinpartial A$ also belongs to $partialoverline A$.
Next, take a sequence of $p_nto p$ where $p_nnotinoverline A$, and consider the following minimization problem:
$$
Vert x-p_nVert^2equiv(x-p_n)^T(x-p_n)tomin_{xinoverline A}.
$$
Since $overline A$ is a closed convex set, and the objective function tends to infinity when $x$ goes to infinity, there exists a solution $x_n$. And since $p_nnotinoverline A$, we have $Vert x_n-p_nVert>0$
Next, consider the $v_n=x_n-p_n$. One can show that $v_n^T(x-p_n)>0$ for any $xinoverline A$. Indeed, if there existed $xinoverline A$ such that $v_n^T(x-p_n)le0$ then we could consider vectors $x_lambda=(1-lambda)x_n+lambda x)inoverline A$ for a small positive $lambda$, and for it
$$
Vert x_lambda-p_nVert^2=Vert (1-lambda)(x_n-p_n)+lambda(x-p_n)Vert^2
=(1-lambda)^2Vert x_n-p_nVert^2+2lambda(1-lambda)(x_n-p_n)^T(x-p_n)+lambda^2Vert x-p_nVert^2<Vert x_n-p_nVert^2
$$
which contradicts the fact than $x_n$ is a minimum point for the problem above.
Next, consider the sequence of $v_n'=dfrac{v_n}{Vert v_nVert}$. They all belong to the unit sphere which is a compact in $mathbb R^n$, so there exists a converging subsequence $v_{n_k}'$ of them. Since for all $v_n'$ we also have $v_n'^T(x-p_n)>0$ for any $xinoverline A$ then for the limits $v=lim_{ktoinfty}v_{n_k}'$ and $p=lim_{ktoinfty}p_{n_k}$ the inequality also holds (possibly as an equality): $v^T(x-p)ge0$for all $xinoverline A$ (and so for all $xin A$).
$endgroup$
$begingroup$
Could you elaborate on why $partial Asubset partial bar A$, given $A$ convex?
$endgroup$
– Vim
Jan 14 '17 at 9:16
$begingroup$
Also, how do you know you can always take $p_nto p$ with $p_nnotin bar A$? For generic sets this is not always possible, say $A=Bbb Q^n$. Of course I know convexity is too good a property to allow for such irregularities, but I still do not have any idea how to prove, with mathematical rigour, that such a sequence always exists. (I have some intuition about the geometry of convex sets, but admittedly very little rigorous formalism of it.)
$endgroup$
– Vim
Jan 14 '17 at 9:27
$begingroup$
@Vim: I'll edit the answer a bit later regarding the first statement. As for the existence of $p_n$, it follows from the closeness of $overline A$.
$endgroup$
– Sergei Golovan
Jan 14 '17 at 9:41
$begingroup$
thanks. I just searched the site a little and found the following property (not easy to prove, though): if $A$ is convex then $text{int}, A=text{int},bar A$, which can answer both my first and my second questions.
$endgroup$
– Vim
Jan 14 '17 at 9:53
$begingroup$
You're right, it's easier to prove that $int A=intoverline A$ (for convex $Ainmathbb R^n$) then do that for the boundaries directly. And there was a few question on this asked before. This one's answer is which I'd like the most.
$endgroup$
– Sergei Golovan
Jan 15 '17 at 6:47
add a comment |
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
});
}
});
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
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2097088%2fprove-the-supporting-hyperplane-theorem-for-convex-sets-in-euclidean-spaces%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
First, since the set $A$ is convex, the point $pinpartial A$ also belongs to $partialoverline A$.
Next, take a sequence of $p_nto p$ where $p_nnotinoverline A$, and consider the following minimization problem:
$$
Vert x-p_nVert^2equiv(x-p_n)^T(x-p_n)tomin_{xinoverline A}.
$$
Since $overline A$ is a closed convex set, and the objective function tends to infinity when $x$ goes to infinity, there exists a solution $x_n$. And since $p_nnotinoverline A$, we have $Vert x_n-p_nVert>0$
Next, consider the $v_n=x_n-p_n$. One can show that $v_n^T(x-p_n)>0$ for any $xinoverline A$. Indeed, if there existed $xinoverline A$ such that $v_n^T(x-p_n)le0$ then we could consider vectors $x_lambda=(1-lambda)x_n+lambda x)inoverline A$ for a small positive $lambda$, and for it
$$
Vert x_lambda-p_nVert^2=Vert (1-lambda)(x_n-p_n)+lambda(x-p_n)Vert^2
=(1-lambda)^2Vert x_n-p_nVert^2+2lambda(1-lambda)(x_n-p_n)^T(x-p_n)+lambda^2Vert x-p_nVert^2<Vert x_n-p_nVert^2
$$
which contradicts the fact than $x_n$ is a minimum point for the problem above.
Next, consider the sequence of $v_n'=dfrac{v_n}{Vert v_nVert}$. They all belong to the unit sphere which is a compact in $mathbb R^n$, so there exists a converging subsequence $v_{n_k}'$ of them. Since for all $v_n'$ we also have $v_n'^T(x-p_n)>0$ for any $xinoverline A$ then for the limits $v=lim_{ktoinfty}v_{n_k}'$ and $p=lim_{ktoinfty}p_{n_k}$ the inequality also holds (possibly as an equality): $v^T(x-p)ge0$for all $xinoverline A$ (and so for all $xin A$).
$endgroup$
$begingroup$
Could you elaborate on why $partial Asubset partial bar A$, given $A$ convex?
$endgroup$
– Vim
Jan 14 '17 at 9:16
$begingroup$
Also, how do you know you can always take $p_nto p$ with $p_nnotin bar A$? For generic sets this is not always possible, say $A=Bbb Q^n$. Of course I know convexity is too good a property to allow for such irregularities, but I still do not have any idea how to prove, with mathematical rigour, that such a sequence always exists. (I have some intuition about the geometry of convex sets, but admittedly very little rigorous formalism of it.)
$endgroup$
– Vim
Jan 14 '17 at 9:27
$begingroup$
@Vim: I'll edit the answer a bit later regarding the first statement. As for the existence of $p_n$, it follows from the closeness of $overline A$.
$endgroup$
– Sergei Golovan
Jan 14 '17 at 9:41
$begingroup$
thanks. I just searched the site a little and found the following property (not easy to prove, though): if $A$ is convex then $text{int}, A=text{int},bar A$, which can answer both my first and my second questions.
$endgroup$
– Vim
Jan 14 '17 at 9:53
$begingroup$
You're right, it's easier to prove that $int A=intoverline A$ (for convex $Ainmathbb R^n$) then do that for the boundaries directly. And there was a few question on this asked before. This one's answer is which I'd like the most.
$endgroup$
– Sergei Golovan
Jan 15 '17 at 6:47
add a comment |
$begingroup$
First, since the set $A$ is convex, the point $pinpartial A$ also belongs to $partialoverline A$.
Next, take a sequence of $p_nto p$ where $p_nnotinoverline A$, and consider the following minimization problem:
$$
Vert x-p_nVert^2equiv(x-p_n)^T(x-p_n)tomin_{xinoverline A}.
$$
Since $overline A$ is a closed convex set, and the objective function tends to infinity when $x$ goes to infinity, there exists a solution $x_n$. And since $p_nnotinoverline A$, we have $Vert x_n-p_nVert>0$
Next, consider the $v_n=x_n-p_n$. One can show that $v_n^T(x-p_n)>0$ for any $xinoverline A$. Indeed, if there existed $xinoverline A$ such that $v_n^T(x-p_n)le0$ then we could consider vectors $x_lambda=(1-lambda)x_n+lambda x)inoverline A$ for a small positive $lambda$, and for it
$$
Vert x_lambda-p_nVert^2=Vert (1-lambda)(x_n-p_n)+lambda(x-p_n)Vert^2
=(1-lambda)^2Vert x_n-p_nVert^2+2lambda(1-lambda)(x_n-p_n)^T(x-p_n)+lambda^2Vert x-p_nVert^2<Vert x_n-p_nVert^2
$$
which contradicts the fact than $x_n$ is a minimum point for the problem above.
Next, consider the sequence of $v_n'=dfrac{v_n}{Vert v_nVert}$. They all belong to the unit sphere which is a compact in $mathbb R^n$, so there exists a converging subsequence $v_{n_k}'$ of them. Since for all $v_n'$ we also have $v_n'^T(x-p_n)>0$ for any $xinoverline A$ then for the limits $v=lim_{ktoinfty}v_{n_k}'$ and $p=lim_{ktoinfty}p_{n_k}$ the inequality also holds (possibly as an equality): $v^T(x-p)ge0$for all $xinoverline A$ (and so for all $xin A$).
$endgroup$
$begingroup$
Could you elaborate on why $partial Asubset partial bar A$, given $A$ convex?
$endgroup$
– Vim
Jan 14 '17 at 9:16
$begingroup$
Also, how do you know you can always take $p_nto p$ with $p_nnotin bar A$? For generic sets this is not always possible, say $A=Bbb Q^n$. Of course I know convexity is too good a property to allow for such irregularities, but I still do not have any idea how to prove, with mathematical rigour, that such a sequence always exists. (I have some intuition about the geometry of convex sets, but admittedly very little rigorous formalism of it.)
$endgroup$
– Vim
Jan 14 '17 at 9:27
$begingroup$
@Vim: I'll edit the answer a bit later regarding the first statement. As for the existence of $p_n$, it follows from the closeness of $overline A$.
$endgroup$
– Sergei Golovan
Jan 14 '17 at 9:41
$begingroup$
thanks. I just searched the site a little and found the following property (not easy to prove, though): if $A$ is convex then $text{int}, A=text{int},bar A$, which can answer both my first and my second questions.
$endgroup$
– Vim
Jan 14 '17 at 9:53
$begingroup$
You're right, it's easier to prove that $int A=intoverline A$ (for convex $Ainmathbb R^n$) then do that for the boundaries directly. And there was a few question on this asked before. This one's answer is which I'd like the most.
$endgroup$
– Sergei Golovan
Jan 15 '17 at 6:47
add a comment |
$begingroup$
First, since the set $A$ is convex, the point $pinpartial A$ also belongs to $partialoverline A$.
Next, take a sequence of $p_nto p$ where $p_nnotinoverline A$, and consider the following minimization problem:
$$
Vert x-p_nVert^2equiv(x-p_n)^T(x-p_n)tomin_{xinoverline A}.
$$
Since $overline A$ is a closed convex set, and the objective function tends to infinity when $x$ goes to infinity, there exists a solution $x_n$. And since $p_nnotinoverline A$, we have $Vert x_n-p_nVert>0$
Next, consider the $v_n=x_n-p_n$. One can show that $v_n^T(x-p_n)>0$ for any $xinoverline A$. Indeed, if there existed $xinoverline A$ such that $v_n^T(x-p_n)le0$ then we could consider vectors $x_lambda=(1-lambda)x_n+lambda x)inoverline A$ for a small positive $lambda$, and for it
$$
Vert x_lambda-p_nVert^2=Vert (1-lambda)(x_n-p_n)+lambda(x-p_n)Vert^2
=(1-lambda)^2Vert x_n-p_nVert^2+2lambda(1-lambda)(x_n-p_n)^T(x-p_n)+lambda^2Vert x-p_nVert^2<Vert x_n-p_nVert^2
$$
which contradicts the fact than $x_n$ is a minimum point for the problem above.
Next, consider the sequence of $v_n'=dfrac{v_n}{Vert v_nVert}$. They all belong to the unit sphere which is a compact in $mathbb R^n$, so there exists a converging subsequence $v_{n_k}'$ of them. Since for all $v_n'$ we also have $v_n'^T(x-p_n)>0$ for any $xinoverline A$ then for the limits $v=lim_{ktoinfty}v_{n_k}'$ and $p=lim_{ktoinfty}p_{n_k}$ the inequality also holds (possibly as an equality): $v^T(x-p)ge0$for all $xinoverline A$ (and so for all $xin A$).
$endgroup$
First, since the set $A$ is convex, the point $pinpartial A$ also belongs to $partialoverline A$.
Next, take a sequence of $p_nto p$ where $p_nnotinoverline A$, and consider the following minimization problem:
$$
Vert x-p_nVert^2equiv(x-p_n)^T(x-p_n)tomin_{xinoverline A}.
$$
Since $overline A$ is a closed convex set, and the objective function tends to infinity when $x$ goes to infinity, there exists a solution $x_n$. And since $p_nnotinoverline A$, we have $Vert x_n-p_nVert>0$
Next, consider the $v_n=x_n-p_n$. One can show that $v_n^T(x-p_n)>0$ for any $xinoverline A$. Indeed, if there existed $xinoverline A$ such that $v_n^T(x-p_n)le0$ then we could consider vectors $x_lambda=(1-lambda)x_n+lambda x)inoverline A$ for a small positive $lambda$, and for it
$$
Vert x_lambda-p_nVert^2=Vert (1-lambda)(x_n-p_n)+lambda(x-p_n)Vert^2
=(1-lambda)^2Vert x_n-p_nVert^2+2lambda(1-lambda)(x_n-p_n)^T(x-p_n)+lambda^2Vert x-p_nVert^2<Vert x_n-p_nVert^2
$$
which contradicts the fact than $x_n$ is a minimum point for the problem above.
Next, consider the sequence of $v_n'=dfrac{v_n}{Vert v_nVert}$. They all belong to the unit sphere which is a compact in $mathbb R^n$, so there exists a converging subsequence $v_{n_k}'$ of them. Since for all $v_n'$ we also have $v_n'^T(x-p_n)>0$ for any $xinoverline A$ then for the limits $v=lim_{ktoinfty}v_{n_k}'$ and $p=lim_{ktoinfty}p_{n_k}$ the inequality also holds (possibly as an equality): $v^T(x-p)ge0$for all $xinoverline A$ (and so for all $xin A$).
edited Dec 19 '18 at 22:56
Dhruv Kohli - expiTTp1z0
4,682921
4,682921
answered Jan 14 '17 at 9:10
Sergei GolovanSergei Golovan
1,338147
1,338147
$begingroup$
Could you elaborate on why $partial Asubset partial bar A$, given $A$ convex?
$endgroup$
– Vim
Jan 14 '17 at 9:16
$begingroup$
Also, how do you know you can always take $p_nto p$ with $p_nnotin bar A$? For generic sets this is not always possible, say $A=Bbb Q^n$. Of course I know convexity is too good a property to allow for such irregularities, but I still do not have any idea how to prove, with mathematical rigour, that such a sequence always exists. (I have some intuition about the geometry of convex sets, but admittedly very little rigorous formalism of it.)
$endgroup$
– Vim
Jan 14 '17 at 9:27
$begingroup$
@Vim: I'll edit the answer a bit later regarding the first statement. As for the existence of $p_n$, it follows from the closeness of $overline A$.
$endgroup$
– Sergei Golovan
Jan 14 '17 at 9:41
$begingroup$
thanks. I just searched the site a little and found the following property (not easy to prove, though): if $A$ is convex then $text{int}, A=text{int},bar A$, which can answer both my first and my second questions.
$endgroup$
– Vim
Jan 14 '17 at 9:53
$begingroup$
You're right, it's easier to prove that $int A=intoverline A$ (for convex $Ainmathbb R^n$) then do that for the boundaries directly. And there was a few question on this asked before. This one's answer is which I'd like the most.
$endgroup$
– Sergei Golovan
Jan 15 '17 at 6:47
add a comment |
$begingroup$
Could you elaborate on why $partial Asubset partial bar A$, given $A$ convex?
$endgroup$
– Vim
Jan 14 '17 at 9:16
$begingroup$
Also, how do you know you can always take $p_nto p$ with $p_nnotin bar A$? For generic sets this is not always possible, say $A=Bbb Q^n$. Of course I know convexity is too good a property to allow for such irregularities, but I still do not have any idea how to prove, with mathematical rigour, that such a sequence always exists. (I have some intuition about the geometry of convex sets, but admittedly very little rigorous formalism of it.)
$endgroup$
– Vim
Jan 14 '17 at 9:27
$begingroup$
@Vim: I'll edit the answer a bit later regarding the first statement. As for the existence of $p_n$, it follows from the closeness of $overline A$.
$endgroup$
– Sergei Golovan
Jan 14 '17 at 9:41
$begingroup$
thanks. I just searched the site a little and found the following property (not easy to prove, though): if $A$ is convex then $text{int}, A=text{int},bar A$, which can answer both my first and my second questions.
$endgroup$
– Vim
Jan 14 '17 at 9:53
$begingroup$
You're right, it's easier to prove that $int A=intoverline A$ (for convex $Ainmathbb R^n$) then do that for the boundaries directly. And there was a few question on this asked before. This one's answer is which I'd like the most.
$endgroup$
– Sergei Golovan
Jan 15 '17 at 6:47
$begingroup$
Could you elaborate on why $partial Asubset partial bar A$, given $A$ convex?
$endgroup$
– Vim
Jan 14 '17 at 9:16
$begingroup$
Could you elaborate on why $partial Asubset partial bar A$, given $A$ convex?
$endgroup$
– Vim
Jan 14 '17 at 9:16
$begingroup$
Also, how do you know you can always take $p_nto p$ with $p_nnotin bar A$? For generic sets this is not always possible, say $A=Bbb Q^n$. Of course I know convexity is too good a property to allow for such irregularities, but I still do not have any idea how to prove, with mathematical rigour, that such a sequence always exists. (I have some intuition about the geometry of convex sets, but admittedly very little rigorous formalism of it.)
$endgroup$
– Vim
Jan 14 '17 at 9:27
$begingroup$
Also, how do you know you can always take $p_nto p$ with $p_nnotin bar A$? For generic sets this is not always possible, say $A=Bbb Q^n$. Of course I know convexity is too good a property to allow for such irregularities, but I still do not have any idea how to prove, with mathematical rigour, that such a sequence always exists. (I have some intuition about the geometry of convex sets, but admittedly very little rigorous formalism of it.)
$endgroup$
– Vim
Jan 14 '17 at 9:27
$begingroup$
@Vim: I'll edit the answer a bit later regarding the first statement. As for the existence of $p_n$, it follows from the closeness of $overline A$.
$endgroup$
– Sergei Golovan
Jan 14 '17 at 9:41
$begingroup$
@Vim: I'll edit the answer a bit later regarding the first statement. As for the existence of $p_n$, it follows from the closeness of $overline A$.
$endgroup$
– Sergei Golovan
Jan 14 '17 at 9:41
$begingroup$
thanks. I just searched the site a little and found the following property (not easy to prove, though): if $A$ is convex then $text{int}, A=text{int},bar A$, which can answer both my first and my second questions.
$endgroup$
– Vim
Jan 14 '17 at 9:53
$begingroup$
thanks. I just searched the site a little and found the following property (not easy to prove, though): if $A$ is convex then $text{int}, A=text{int},bar A$, which can answer both my first and my second questions.
$endgroup$
– Vim
Jan 14 '17 at 9:53
$begingroup$
You're right, it's easier to prove that $int A=intoverline A$ (for convex $Ainmathbb R^n$) then do that for the boundaries directly. And there was a few question on this asked before. This one's answer is which I'd like the most.
$endgroup$
– Sergei Golovan
Jan 15 '17 at 6:47
$begingroup$
You're right, it's easier to prove that $int A=intoverline A$ (for convex $Ainmathbb R^n$) then do that for the boundaries directly. And there was a few question on this asked before. This one's answer is which I'd like the most.
$endgroup$
– Sergei Golovan
Jan 15 '17 at 6:47
add a comment |
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.
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
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2097088%2fprove-the-supporting-hyperplane-theorem-for-convex-sets-in-euclidean-spaces%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
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
Required, but never shown
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
Required, but never shown
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
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