Show that support function of a set $S$ and support function of the closure of that set $bar{S}$ are equal.
up vote
1
down vote
favorite
Let $Ssubseteq mathbb{R}^n$.
The support function of set $S$ is defined as the following
$$
sigma_S(x)=sup_{y in S} x^Ty
$$
where $x in mathbb{R}^n$.
Show that $sigma_S(x)=sigma_{bar{S}}(x) ,,,,forall ,,,x in mathbb{R}^n$.
If the set $S$ were closed then $S=bar{S}$ so we are done. For the case that $S neqbar{S}$ we need to prove the statement. My approach is to say that the closure of a set is the set of all supporting hyperplains (which I do not know how to prove!), then show that $sigma_S(x)$ takes its value for every $x$ when $y$ is at the boundary of $S$.
convex-analysis convex-optimization supremum-and-infimum convex-geometry convex-hulls
asked Nov 19 at 4:56
Sepide
1377
add a comment |
up vote
1
down vote
favorite
Let $Ssubseteq mathbb{R}^n$.
The support function of set $S$ is defined as the following
$$
sigma_S(x)=sup_{y in S} x^Ty
$$
where $x in mathbb{R}^n$.
Show that $sigma_S(x)=sigma_{bar{S}}(x) ,,,,forall ,,,x in mathbb{R}^n$.
If the set $S$ were closed then $S=bar{S}$ so we are done. For the case that $S neqbar{S}$ we need to prove the statement. My approach is to say that the closure of a set is the set of all supporting hyperplains (which I do not know how to prove!), then show that $sigma_S(x)$ takes its value for every $x$ when $y$ is at the boundary of $S$.
convex-analysis convex-optimization supremum-and-infimum convex-geometry convex-hulls
asked Nov 19 at 4:56
Sepide
1377
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Let $Ssubseteq mathbb{R}^n$.
The support function of set $S$ is defined as the following
$$
sigma_S(x)=sup_{y in S} x^Ty
$$
where $x in mathbb{R}^n$.
Show that $sigma_S(x)=sigma_{bar{S}}(x) ,,,,forall ,,,x in mathbb{R}^n$.
If the set $S$ were closed then $S=bar{S}$ so we are done. For the case that $S neqbar{S}$ we need to prove the statement. My approach is to say that the closure of a set is the set of all supporting hyperplains (which I do not know how to prove!), then show that $sigma_S(x)$ takes its value for every $x$ when $y$ is at the boundary of $S$.
convex-analysis convex-optimization supremum-and-infimum convex-geometry convex-hulls
asked Nov 19 at 4:56
Sepide
1377
Let $Ssubseteq mathbb{R}^n$.
The support function of set $S$ is defined as the following
$$
sigma_S(x)=sup_{y in S} x^Ty
$$
where $x in mathbb{R}^n$.
Show that $sigma_S(x)=sigma_{bar{S}}(x) ,,,,forall ,,,x in mathbb{R}^n$.
If the set $S$ were closed then $S=bar{S}$ so we are done. For the case that $S neqbar{S}$ we need to prove the statement. My approach is to say that the closure of a set is the set of all supporting hyperplains (which I do not know how to prove!), then show that $sigma_S(x)$ takes its value for every $x$ when $y$ is at the boundary of $S$.
convex-analysis convex-optimization supremum-and-infimum convex-geometry convex-hulls
convex-analysis convex-optimization supremum-and-infimum convex-geometry convex-hulls
asked Nov 19 at 4:56
Sepide
1377
asked Nov 19 at 4:56
Sepide
1377
asked Nov 19 at 4:56
Sepide
1377
asked Nov 19 at 4:56
Sepide
1377
asked Nov 19 at 4:56
Sepide
1377
1377
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
up vote
1
down vote
It is obvious that $sigma_S(x) leq sigma_{ overline {S}} (x)$. For the other inequality take $y in overline {S}$ and choose a sequence ${y_n} subset S$ such that $y_n to y$. Since $x^{T}y_n leq sigma_S(x)$ for all $n$ and $x^{T}y_n to x^{T}y$ we get $x^{T}y leq sigma_S(x)$. Taking supremum over $y$ we get $sigma_{ overline {S}} (x) leq sigma_S(x)$.
answered Nov 19 at 5:20
Kavi Rama Murthy
45.9k31854
I need to show the first sentence. I understand that intuitively makes sense but how we can show it?
– Sepide
Nov 20 at 3:50
If $A subset B$ then $sup A leq sup B$ by definition of supremum.
– Kavi Rama Murthy
Nov 20 at 5:32
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
It is obvious that $sigma_S(x) leq sigma_{ overline {S}} (x)$. For the other inequality take $y in overline {S}$ and choose a sequence ${y_n} subset S$ such that $y_n to y$. Since $x^{T}y_n leq sigma_S(x)$ for all $n$ and $x^{T}y_n to x^{T}y$ we get $x^{T}y leq sigma_S(x)$. Taking supremum over $y$ we get $sigma_{ overline {S}} (x) leq sigma_S(x)$.
answered Nov 19 at 5:20
Kavi Rama Murthy
45.9k31854
I need to show the first sentence. I understand that intuitively makes sense but how we can show it?
– Sepide
Nov 20 at 3:50
If $A subset B$ then $sup A leq sup B$ by definition of supremum.
– Kavi Rama Murthy
Nov 20 at 5:32
add a comment |
up vote
1
down vote
It is obvious that $sigma_S(x) leq sigma_{ overline {S}} (x)$. For the other inequality take $y in overline {S}$ and choose a sequence ${y_n} subset S$ such that $y_n to y$. Since $x^{T}y_n leq sigma_S(x)$ for all $n$ and $x^{T}y_n to x^{T}y$ we get $x^{T}y leq sigma_S(x)$. Taking supremum over $y$ we get $sigma_{ overline {S}} (x) leq sigma_S(x)$.
answered Nov 19 at 5:20
Kavi Rama Murthy
45.9k31854
I need to show the first sentence. I understand that intuitively makes sense but how we can show it?
– Sepide
Nov 20 at 3:50
If $A subset B$ then $sup A leq sup B$ by definition of supremum.
– Kavi Rama Murthy
Nov 20 at 5:32
add a comment |
up vote
1
down vote
up vote
1
down vote
It is obvious that $sigma_S(x) leq sigma_{ overline {S}} (x)$. For the other inequality take $y in overline {S}$ and choose a sequence ${y_n} subset S$ such that $y_n to y$. Since $x^{T}y_n leq sigma_S(x)$ for all $n$ and $x^{T}y_n to x^{T}y$ we get $x^{T}y leq sigma_S(x)$. Taking supremum over $y$ we get $sigma_{ overline {S}} (x) leq sigma_S(x)$.
answered Nov 19 at 5:20
Kavi Rama Murthy
45.9k31854
It is obvious that $sigma_S(x) leq sigma_{ overline {S}} (x)$. For the other inequality take $y in overline {S}$ and choose a sequence ${y_n} subset S$ such that $y_n to y$. Since $x^{T}y_n leq sigma_S(x)$ for all $n$ and $x^{T}y_n to x^{T}y$ we get $x^{T}y leq sigma_S(x)$. Taking supremum over $y$ we get $sigma_{ overline {S}} (x) leq sigma_S(x)$.
answered Nov 19 at 5:20
Kavi Rama Murthy
45.9k31854
answered Nov 19 at 5:20
Kavi Rama Murthy
45.9k31854
answered Nov 19 at 5:20
Kavi Rama Murthy
45.9k31854
answered Nov 19 at 5:20
Kavi Rama Murthy
45.9k31854
45.9k31854
I need to show the first sentence. I understand that intuitively makes sense but how we can show it?
– Sepide
Nov 20 at 3:50
If $A subset B$ then $sup A leq sup B$ by definition of supremum.
– Kavi Rama Murthy
Nov 20 at 5:32
add a comment |
I need to show the first sentence. I understand that intuitively makes sense but how we can show it?
– Sepide
Nov 20 at 3:50
If $A subset B$ then $sup A leq sup B$ by definition of supremum.
– Kavi Rama Murthy
Nov 20 at 5:32
I need to show the first sentence. I understand that intuitively makes sense but how we can show it?
– Sepide
Nov 20 at 3:50
I need to show the first sentence. I understand that intuitively makes sense but how we can show it?
– Sepide
Nov 20 at 3:50
If $A subset B$ then $sup A leq sup B$ by definition of supremum.
– Kavi Rama Murthy
Nov 20 at 5:32
If $A subset B$ then $sup A leq sup B$ by definition of supremum.
– Kavi Rama Murthy
Nov 20 at 5:32
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3004540%2fshow-that-support-function-of-a-set-s-and-support-function-of-the-closure-of-t%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
