Writing the equation of hyperplane separates a point and a convex set
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
Consider a point, $v$ outside a closed convex set $C$ and $omega in C$. Let $v^*$ be the orthogonol projection of $v$ onto $C$. Can I write the equation of the hyperplane goes through the projection which separates convex set and the point $v$ as $$langleomega-v^*,v-v^*rangle = 0?$$
If this is correct, what is the intuition behind this? (writing the equation using the scalar product of two vectors?)
convex-optimization convex-geometry
add a comment |Â
up vote
0
down vote
favorite
Consider a point, $v$ outside a closed convex set $C$ and $omega in C$. Let $v^*$ be the orthogonol projection of $v$ onto $C$. Can I write the equation of the hyperplane goes through the projection which separates convex set and the point $v$ as $$langleomega-v^*,v-v^*rangle = 0?$$
If this is correct, what is the intuition behind this? (writing the equation using the scalar product of two vectors?)
convex-optimization convex-geometry
How are you defining the orthogonal projection onto the convex set. Do you mean the closest point?
â Michael Burr
Sep 1 at 10:06
@MichaelBurr yes, it is
â Malintha
Sep 1 at 10:07
2
There could be many hyperplanes separating a point from a general convex set, so it does not make sense to write "the equation of the hyperplane".
â uniquesolution
Sep 1 at 10:16
Are you asking whether your equation is a valid way to write the equation of a plane? Is $omega$ a variable in this equation?
â amd
Sep 1 at 21:32
@amd yes, I am asking it. yes $omega$ is a variable in C
â Malintha
Sep 3 at 9:23
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Consider a point, $v$ outside a closed convex set $C$ and $omega in C$. Let $v^*$ be the orthogonol projection of $v$ onto $C$. Can I write the equation of the hyperplane goes through the projection which separates convex set and the point $v$ as $$langleomega-v^*,v-v^*rangle = 0?$$
If this is correct, what is the intuition behind this? (writing the equation using the scalar product of two vectors?)
convex-optimization convex-geometry
Consider a point, $v$ outside a closed convex set $C$ and $omega in C$. Let $v^*$ be the orthogonol projection of $v$ onto $C$. Can I write the equation of the hyperplane goes through the projection which separates convex set and the point $v$ as $$langleomega-v^*,v-v^*rangle = 0?$$
If this is correct, what is the intuition behind this? (writing the equation using the scalar product of two vectors?)
convex-optimization convex-geometry
convex-optimization convex-geometry
edited Sep 1 at 14:11
David M.
1,401318
1,401318
asked Sep 1 at 9:58
Malintha
1527
1527
How are you defining the orthogonal projection onto the convex set. Do you mean the closest point?
â Michael Burr
Sep 1 at 10:06
@MichaelBurr yes, it is
â Malintha
Sep 1 at 10:07
2
There could be many hyperplanes separating a point from a general convex set, so it does not make sense to write "the equation of the hyperplane".
â uniquesolution
Sep 1 at 10:16
Are you asking whether your equation is a valid way to write the equation of a plane? Is $omega$ a variable in this equation?
â amd
Sep 1 at 21:32
@amd yes, I am asking it. yes $omega$ is a variable in C
â Malintha
Sep 3 at 9:23
add a comment |Â
How are you defining the orthogonal projection onto the convex set. Do you mean the closest point?
â Michael Burr
Sep 1 at 10:06
@MichaelBurr yes, it is
â Malintha
Sep 1 at 10:07
2
There could be many hyperplanes separating a point from a general convex set, so it does not make sense to write "the equation of the hyperplane".
â uniquesolution
Sep 1 at 10:16
Are you asking whether your equation is a valid way to write the equation of a plane? Is $omega$ a variable in this equation?
â amd
Sep 1 at 21:32
@amd yes, I am asking it. yes $omega$ is a variable in C
â Malintha
Sep 3 at 9:23
How are you defining the orthogonal projection onto the convex set. Do you mean the closest point?
â Michael Burr
Sep 1 at 10:06
How are you defining the orthogonal projection onto the convex set. Do you mean the closest point?
â Michael Burr
Sep 1 at 10:06
@MichaelBurr yes, it is
â Malintha
Sep 1 at 10:07
@MichaelBurr yes, it is
â Malintha
Sep 1 at 10:07
2
2
There could be many hyperplanes separating a point from a general convex set, so it does not make sense to write "the equation of the hyperplane".
â uniquesolution
Sep 1 at 10:16
There could be many hyperplanes separating a point from a general convex set, so it does not make sense to write "the equation of the hyperplane".
â uniquesolution
Sep 1 at 10:16
Are you asking whether your equation is a valid way to write the equation of a plane? Is $omega$ a variable in this equation?
â amd
Sep 1 at 21:32
Are you asking whether your equation is a valid way to write the equation of a plane? Is $omega$ a variable in this equation?
â amd
Sep 1 at 21:32
@amd yes, I am asking it. yes $omega$ is a variable in C
â Malintha
Sep 3 at 9:23
@amd yes, I am asking it. yes $omega$ is a variable in C
â Malintha
Sep 3 at 9:23
add a comment |Â
2 Answers
2
active
oldest
votes
up vote
1
down vote
accepted
This is just the point-normal form of implicit equation for a hyperplane, but expressed in a way that you might not have seen before. ItâÂÂs easily converted into a more familiar form: if $omega = (x_1,dots,x_n)$, then $$beginalign langleomega-v^*,v-v^*rangle &= langleomega,v-v^*rangle - langle v^*,v-v^*rangle \ &= a_1x_1+cdots+a_nx_n+dendalign$$ where the $a_i$ are some fixed set of constants and $d=-langle v^*,v-v^*rangle$, also a constant. This plane clearly passes through $v^*$, since $langle v^*-v^*,v-v^*rangle = langle0,v-v^*rangle = 0$.
Geometrically, this is the set of all points $omega$ such that $omega-v^*$ is orthogonal to the fixed vector $v-v^*$. Now, $omega-v^*$ is just the displacement vector that goes from the fixed point $v^*$ to $omega$, so this equation describes the set of all points that can be reached by moving purely in a direction orthogonal to $v-v^*$. This example in $mathbb R^2$ should give you the idea:
add a comment |Â
up vote
1
down vote
There could be many hyperplanes separating a point from a general convex set, so it does not make sense to write "the equation of the hyperplane", but yes, if you take a hyperplane passing through the closest point in a convex set to some point $p$ outside the set, which is orthogonal to the line connecting $p$ to its closest point, then that hyperplane will separate the convex set from the point $p$, as you can easily prove.
I edited my question to make it clear. So if we consider the hyperplane goes through the projection point, is the aforementioned equation correct?
â Malintha
Sep 1 at 10:23
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
This is just the point-normal form of implicit equation for a hyperplane, but expressed in a way that you might not have seen before. ItâÂÂs easily converted into a more familiar form: if $omega = (x_1,dots,x_n)$, then $$beginalign langleomega-v^*,v-v^*rangle &= langleomega,v-v^*rangle - langle v^*,v-v^*rangle \ &= a_1x_1+cdots+a_nx_n+dendalign$$ where the $a_i$ are some fixed set of constants and $d=-langle v^*,v-v^*rangle$, also a constant. This plane clearly passes through $v^*$, since $langle v^*-v^*,v-v^*rangle = langle0,v-v^*rangle = 0$.
Geometrically, this is the set of all points $omega$ such that $omega-v^*$ is orthogonal to the fixed vector $v-v^*$. Now, $omega-v^*$ is just the displacement vector that goes from the fixed point $v^*$ to $omega$, so this equation describes the set of all points that can be reached by moving purely in a direction orthogonal to $v-v^*$. This example in $mathbb R^2$ should give you the idea:
add a comment |Â
up vote
1
down vote
accepted
This is just the point-normal form of implicit equation for a hyperplane, but expressed in a way that you might not have seen before. ItâÂÂs easily converted into a more familiar form: if $omega = (x_1,dots,x_n)$, then $$beginalign langleomega-v^*,v-v^*rangle &= langleomega,v-v^*rangle - langle v^*,v-v^*rangle \ &= a_1x_1+cdots+a_nx_n+dendalign$$ where the $a_i$ are some fixed set of constants and $d=-langle v^*,v-v^*rangle$, also a constant. This plane clearly passes through $v^*$, since $langle v^*-v^*,v-v^*rangle = langle0,v-v^*rangle = 0$.
Geometrically, this is the set of all points $omega$ such that $omega-v^*$ is orthogonal to the fixed vector $v-v^*$. Now, $omega-v^*$ is just the displacement vector that goes from the fixed point $v^*$ to $omega$, so this equation describes the set of all points that can be reached by moving purely in a direction orthogonal to $v-v^*$. This example in $mathbb R^2$ should give you the idea:
add a comment |Â
up vote
1
down vote
accepted
up vote
1
down vote
accepted
This is just the point-normal form of implicit equation for a hyperplane, but expressed in a way that you might not have seen before. ItâÂÂs easily converted into a more familiar form: if $omega = (x_1,dots,x_n)$, then $$beginalign langleomega-v^*,v-v^*rangle &= langleomega,v-v^*rangle - langle v^*,v-v^*rangle \ &= a_1x_1+cdots+a_nx_n+dendalign$$ where the $a_i$ are some fixed set of constants and $d=-langle v^*,v-v^*rangle$, also a constant. This plane clearly passes through $v^*$, since $langle v^*-v^*,v-v^*rangle = langle0,v-v^*rangle = 0$.
Geometrically, this is the set of all points $omega$ such that $omega-v^*$ is orthogonal to the fixed vector $v-v^*$. Now, $omega-v^*$ is just the displacement vector that goes from the fixed point $v^*$ to $omega$, so this equation describes the set of all points that can be reached by moving purely in a direction orthogonal to $v-v^*$. This example in $mathbb R^2$ should give you the idea:
This is just the point-normal form of implicit equation for a hyperplane, but expressed in a way that you might not have seen before. ItâÂÂs easily converted into a more familiar form: if $omega = (x_1,dots,x_n)$, then $$beginalign langleomega-v^*,v-v^*rangle &= langleomega,v-v^*rangle - langle v^*,v-v^*rangle \ &= a_1x_1+cdots+a_nx_n+dendalign$$ where the $a_i$ are some fixed set of constants and $d=-langle v^*,v-v^*rangle$, also a constant. This plane clearly passes through $v^*$, since $langle v^*-v^*,v-v^*rangle = langle0,v-v^*rangle = 0$.
Geometrically, this is the set of all points $omega$ such that $omega-v^*$ is orthogonal to the fixed vector $v-v^*$. Now, $omega-v^*$ is just the displacement vector that goes from the fixed point $v^*$ to $omega$, so this equation describes the set of all points that can be reached by moving purely in a direction orthogonal to $v-v^*$. This example in $mathbb R^2$ should give you the idea:
edited Sep 4 at 17:23
answered Sep 3 at 19:52
amd
26.8k21046
26.8k21046
add a comment |Â
add a comment |Â
up vote
1
down vote
There could be many hyperplanes separating a point from a general convex set, so it does not make sense to write "the equation of the hyperplane", but yes, if you take a hyperplane passing through the closest point in a convex set to some point $p$ outside the set, which is orthogonal to the line connecting $p$ to its closest point, then that hyperplane will separate the convex set from the point $p$, as you can easily prove.
I edited my question to make it clear. So if we consider the hyperplane goes through the projection point, is the aforementioned equation correct?
â Malintha
Sep 1 at 10:23
add a comment |Â
up vote
1
down vote
There could be many hyperplanes separating a point from a general convex set, so it does not make sense to write "the equation of the hyperplane", but yes, if you take a hyperplane passing through the closest point in a convex set to some point $p$ outside the set, which is orthogonal to the line connecting $p$ to its closest point, then that hyperplane will separate the convex set from the point $p$, as you can easily prove.
I edited my question to make it clear. So if we consider the hyperplane goes through the projection point, is the aforementioned equation correct?
â Malintha
Sep 1 at 10:23
add a comment |Â
up vote
1
down vote
up vote
1
down vote
There could be many hyperplanes separating a point from a general convex set, so it does not make sense to write "the equation of the hyperplane", but yes, if you take a hyperplane passing through the closest point in a convex set to some point $p$ outside the set, which is orthogonal to the line connecting $p$ to its closest point, then that hyperplane will separate the convex set from the point $p$, as you can easily prove.
There could be many hyperplanes separating a point from a general convex set, so it does not make sense to write "the equation of the hyperplane", but yes, if you take a hyperplane passing through the closest point in a convex set to some point $p$ outside the set, which is orthogonal to the line connecting $p$ to its closest point, then that hyperplane will separate the convex set from the point $p$, as you can easily prove.
answered Sep 1 at 10:18
uniquesolution
8,316823
8,316823
I edited my question to make it clear. So if we consider the hyperplane goes through the projection point, is the aforementioned equation correct?
â Malintha
Sep 1 at 10:23
add a comment |Â
I edited my question to make it clear. So if we consider the hyperplane goes through the projection point, is the aforementioned equation correct?
â Malintha
Sep 1 at 10:23
I edited my question to make it clear. So if we consider the hyperplane goes through the projection point, is the aforementioned equation correct?
â Malintha
Sep 1 at 10:23
I edited my question to make it clear. So if we consider the hyperplane goes through the projection point, is the aforementioned equation correct?
â Malintha
Sep 1 at 10:23
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%2f2901537%2fwriting-the-equation-of-hyperplane-separates-a-point-and-a-convex-set%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
How are you defining the orthogonal projection onto the convex set. Do you mean the closest point?
â Michael Burr
Sep 1 at 10:06
@MichaelBurr yes, it is
â Malintha
Sep 1 at 10:07
2
There could be many hyperplanes separating a point from a general convex set, so it does not make sense to write "the equation of the hyperplane".
â uniquesolution
Sep 1 at 10:16
Are you asking whether your equation is a valid way to write the equation of a plane? Is $omega$ a variable in this equation?
â amd
Sep 1 at 21:32
@amd yes, I am asking it. yes $omega$ is a variable in C
â Malintha
Sep 3 at 9:23