Subdifferential of a lower semicontinuous, convex, and positively homogenous degree-$2$ functionContinuity relative to the domain of a convex function.convex closed and unclosed functions and (lower semi)continuityShow that a real-valued function with non-empty subdifferential is convexThe convex envelope of a lower semicontinuous function on a compact convex set is lower semicontinuousIs convex subdifferential always non-empty?subdifferential of indicator functionIntersection of open and lower semicontinuous correspondence is lower semicontinuousCan a lower-semicontinuous, convex function defined on a convex subset be extended to the entire space?Convergence of subgradientsA proper, lower semicontinuous, convex function with no subgradient?Does subdifferential function with non-convex dom exist?
Is there a reason to prefer HFS+ over APFS for disk images in High Sierra and/or Mojave?
Make a Bowl of Alphabet Soup
Language involving irrational number is not a CFL
Usage of an old photo with expired copyright
Showing mass murder in a kid's book
Echo with obfuscation
Has the laser at Magurele, Romania reached a tenth of the Sun's power?
Is there a distance limit for minecart tracks?
How to make money from a browser who sees 5 seconds into the future of any web page?
Check if object is null and return null
Alignment of six matrices
Limit max CPU usage SQL SERVER with WSRM
How would a solely written language work mechanically
How to make a list of partial sums using forEach
Why can't the Brexit deadlock in the UK parliament be solved with a plurality vote?
What is the meaning of "You've never met a graph you didn't like?"
Should I warn new/prospective PhD Student that supervisor is terrible?
How to preserve electronics (computers, iPads and phones) for hundreds of years
Why would five hundred and five be same as one?
Unable to disable Microsoft Store in domain environment
What's the name of the logical fallacy where a debater extends a statement far beyond the original statement to make it true?
Should I assume I have passed probation?
Difference between shutdown options
How were servants to the Kaiser of Imperial Germany treated and where may I find more information on them
Subdifferential of a lower semicontinuous, convex, and positively homogenous degree-$2$ function
Continuity relative to the domain of a convex function.convex closed and unclosed functions and (lower semi)continuityShow that a real-valued function with non-empty subdifferential is convexThe convex envelope of a lower semicontinuous function on a compact convex set is lower semicontinuousIs convex subdifferential always non-empty?subdifferential of indicator functionIntersection of open and lower semicontinuous correspondence is lower semicontinuousCan a lower-semicontinuous, convex function defined on a convex subset be extended to the entire space?Convergence of subgradientsA proper, lower semicontinuous, convex function with no subgradient?Does subdifferential function with non-convex dom exist?
$begingroup$
Let $f: mathbb R^n to [0 , +infty] $ be a lower semicontinuous, convex, and positively homogenous degree-$2$ function. Prove that for all $x in mboxdom f$, we have $$ partial f(x) neq emptyset $$
Note, that the latter is equivalent to saying that there exists a $kappa > 0$ and a neighborhood $U$ of $x$ such that, for all $y in U$ we have $$- kappa | y - x| leq f(y) - f(x)$$
I was able to prove that $partial f(0) neq emptyset$, but I couldn't prove that for nonzero vectors. Actually It may not be true for those.
P.S : Positively homogenous of degree 2 means for all $t geq 0 $ we have $f(tx)= t^2 f(x).$
real-analysis convex-analysis convex-optimization
$endgroup$
add a comment |
$begingroup$
Let $f: mathbb R^n to [0 , +infty] $ be a lower semicontinuous, convex, and positively homogenous degree-$2$ function. Prove that for all $x in mboxdom f$, we have $$ partial f(x) neq emptyset $$
Note, that the latter is equivalent to saying that there exists a $kappa > 0$ and a neighborhood $U$ of $x$ such that, for all $y in U$ we have $$- kappa | y - x| leq f(y) - f(x)$$
I was able to prove that $partial f(0) neq emptyset$, but I couldn't prove that for nonzero vectors. Actually It may not be true for those.
P.S : Positively homogenous of degree 2 means for all $t geq 0 $ we have $f(tx)= t^2 f(x).$
real-analysis convex-analysis convex-optimization
$endgroup$
1
$begingroup$
In finite dimensions, all convex functions have subgradients at points in the core (or algebraic interior, substitute with "interior" if you want) of the domain. Given the positively homogeneous of degree $2$ condition, it appears that the domain has to be a subspace, and so if you restrict $f$ to this subspace, you should be able to find a subgradient for the restriction of $f$. You can then extend this subgradient in any way you like to the full space to obtain an element of the subgradient in the full space. I'm writing a comment because I feel like I've missed something in your question...
$endgroup$
– Theo Bendit
Mar 14 at 2:36
$begingroup$
@TheoBendit Thanks for your comment . The domain is just cone not necessary subspace, otherwise problem would become trivial as any convex function $f$ has subgradient on the relative interior of it's domain . (in finite dimension)
$endgroup$
– Red shoes
Mar 14 at 2:49
$begingroup$
Ah yes, there it is: I've missed the condition that $t ge 0$. Still though, the standard argument will show that subgradients exist on the relative interior. You just need to worry about the relative boundary. Basically, this will fail when the subgradients are unbounded in the neighbourhood of the relative boundary point, which I'm fairly confident can happen. That is, I'm pretty sure that this is false, though I don't have time to write up a counterexample at the moment.
$endgroup$
– Theo Bendit
Mar 14 at 2:59
$begingroup$
@TheoBendit I doubt that. The restriction of function over half line (with starting point zero) is quadratic so it is nice.
$endgroup$
– Red shoes
Mar 14 at 3:49
$begingroup$
@TheoBendit I posted a similar question, in math.stackexchange.com/q/3151905/219176 I thought you might be interested to this one. I want to get a deep inside of those kind of function. Any help would be appreciated.
$endgroup$
– Red shoes
Mar 17 at 18:46
add a comment |
$begingroup$
Let $f: mathbb R^n to [0 , +infty] $ be a lower semicontinuous, convex, and positively homogenous degree-$2$ function. Prove that for all $x in mboxdom f$, we have $$ partial f(x) neq emptyset $$
Note, that the latter is equivalent to saying that there exists a $kappa > 0$ and a neighborhood $U$ of $x$ such that, for all $y in U$ we have $$- kappa | y - x| leq f(y) - f(x)$$
I was able to prove that $partial f(0) neq emptyset$, but I couldn't prove that for nonzero vectors. Actually It may not be true for those.
P.S : Positively homogenous of degree 2 means for all $t geq 0 $ we have $f(tx)= t^2 f(x).$
real-analysis convex-analysis convex-optimization
$endgroup$
Let $f: mathbb R^n to [0 , +infty] $ be a lower semicontinuous, convex, and positively homogenous degree-$2$ function. Prove that for all $x in mboxdom f$, we have $$ partial f(x) neq emptyset $$
Note, that the latter is equivalent to saying that there exists a $kappa > 0$ and a neighborhood $U$ of $x$ such that, for all $y in U$ we have $$- kappa | y - x| leq f(y) - f(x)$$
I was able to prove that $partial f(0) neq emptyset$, but I couldn't prove that for nonzero vectors. Actually It may not be true for those.
P.S : Positively homogenous of degree 2 means for all $t geq 0 $ we have $f(tx)= t^2 f(x).$
real-analysis convex-analysis convex-optimization
real-analysis convex-analysis convex-optimization
edited Mar 14 at 7:48
Rodrigo de Azevedo
13.2k41960
13.2k41960
asked Mar 14 at 1:36
Red shoesRed shoes
4,788721
4,788721
1
$begingroup$
In finite dimensions, all convex functions have subgradients at points in the core (or algebraic interior, substitute with "interior" if you want) of the domain. Given the positively homogeneous of degree $2$ condition, it appears that the domain has to be a subspace, and so if you restrict $f$ to this subspace, you should be able to find a subgradient for the restriction of $f$. You can then extend this subgradient in any way you like to the full space to obtain an element of the subgradient in the full space. I'm writing a comment because I feel like I've missed something in your question...
$endgroup$
– Theo Bendit
Mar 14 at 2:36
$begingroup$
@TheoBendit Thanks for your comment . The domain is just cone not necessary subspace, otherwise problem would become trivial as any convex function $f$ has subgradient on the relative interior of it's domain . (in finite dimension)
$endgroup$
– Red shoes
Mar 14 at 2:49
$begingroup$
Ah yes, there it is: I've missed the condition that $t ge 0$. Still though, the standard argument will show that subgradients exist on the relative interior. You just need to worry about the relative boundary. Basically, this will fail when the subgradients are unbounded in the neighbourhood of the relative boundary point, which I'm fairly confident can happen. That is, I'm pretty sure that this is false, though I don't have time to write up a counterexample at the moment.
$endgroup$
– Theo Bendit
Mar 14 at 2:59
$begingroup$
@TheoBendit I doubt that. The restriction of function over half line (with starting point zero) is quadratic so it is nice.
$endgroup$
– Red shoes
Mar 14 at 3:49
$begingroup$
@TheoBendit I posted a similar question, in math.stackexchange.com/q/3151905/219176 I thought you might be interested to this one. I want to get a deep inside of those kind of function. Any help would be appreciated.
$endgroup$
– Red shoes
Mar 17 at 18:46
add a comment |
1
$begingroup$
In finite dimensions, all convex functions have subgradients at points in the core (or algebraic interior, substitute with "interior" if you want) of the domain. Given the positively homogeneous of degree $2$ condition, it appears that the domain has to be a subspace, and so if you restrict $f$ to this subspace, you should be able to find a subgradient for the restriction of $f$. You can then extend this subgradient in any way you like to the full space to obtain an element of the subgradient in the full space. I'm writing a comment because I feel like I've missed something in your question...
$endgroup$
– Theo Bendit
Mar 14 at 2:36
$begingroup$
@TheoBendit Thanks for your comment . The domain is just cone not necessary subspace, otherwise problem would become trivial as any convex function $f$ has subgradient on the relative interior of it's domain . (in finite dimension)
$endgroup$
– Red shoes
Mar 14 at 2:49
$begingroup$
Ah yes, there it is: I've missed the condition that $t ge 0$. Still though, the standard argument will show that subgradients exist on the relative interior. You just need to worry about the relative boundary. Basically, this will fail when the subgradients are unbounded in the neighbourhood of the relative boundary point, which I'm fairly confident can happen. That is, I'm pretty sure that this is false, though I don't have time to write up a counterexample at the moment.
$endgroup$
– Theo Bendit
Mar 14 at 2:59
$begingroup$
@TheoBendit I doubt that. The restriction of function over half line (with starting point zero) is quadratic so it is nice.
$endgroup$
– Red shoes
Mar 14 at 3:49
$begingroup$
@TheoBendit I posted a similar question, in math.stackexchange.com/q/3151905/219176 I thought you might be interested to this one. I want to get a deep inside of those kind of function. Any help would be appreciated.
$endgroup$
– Red shoes
Mar 17 at 18:46
1
1
$begingroup$
In finite dimensions, all convex functions have subgradients at points in the core (or algebraic interior, substitute with "interior" if you want) of the domain. Given the positively homogeneous of degree $2$ condition, it appears that the domain has to be a subspace, and so if you restrict $f$ to this subspace, you should be able to find a subgradient for the restriction of $f$. You can then extend this subgradient in any way you like to the full space to obtain an element of the subgradient in the full space. I'm writing a comment because I feel like I've missed something in your question...
$endgroup$
– Theo Bendit
Mar 14 at 2:36
$begingroup$
In finite dimensions, all convex functions have subgradients at points in the core (or algebraic interior, substitute with "interior" if you want) of the domain. Given the positively homogeneous of degree $2$ condition, it appears that the domain has to be a subspace, and so if you restrict $f$ to this subspace, you should be able to find a subgradient for the restriction of $f$. You can then extend this subgradient in any way you like to the full space to obtain an element of the subgradient in the full space. I'm writing a comment because I feel like I've missed something in your question...
$endgroup$
– Theo Bendit
Mar 14 at 2:36
$begingroup$
@TheoBendit Thanks for your comment . The domain is just cone not necessary subspace, otherwise problem would become trivial as any convex function $f$ has subgradient on the relative interior of it's domain . (in finite dimension)
$endgroup$
– Red shoes
Mar 14 at 2:49
$begingroup$
@TheoBendit Thanks for your comment . The domain is just cone not necessary subspace, otherwise problem would become trivial as any convex function $f$ has subgradient on the relative interior of it's domain . (in finite dimension)
$endgroup$
– Red shoes
Mar 14 at 2:49
$begingroup$
Ah yes, there it is: I've missed the condition that $t ge 0$. Still though, the standard argument will show that subgradients exist on the relative interior. You just need to worry about the relative boundary. Basically, this will fail when the subgradients are unbounded in the neighbourhood of the relative boundary point, which I'm fairly confident can happen. That is, I'm pretty sure that this is false, though I don't have time to write up a counterexample at the moment.
$endgroup$
– Theo Bendit
Mar 14 at 2:59
$begingroup$
Ah yes, there it is: I've missed the condition that $t ge 0$. Still though, the standard argument will show that subgradients exist on the relative interior. You just need to worry about the relative boundary. Basically, this will fail when the subgradients are unbounded in the neighbourhood of the relative boundary point, which I'm fairly confident can happen. That is, I'm pretty sure that this is false, though I don't have time to write up a counterexample at the moment.
$endgroup$
– Theo Bendit
Mar 14 at 2:59
$begingroup$
@TheoBendit I doubt that. The restriction of function over half line (with starting point zero) is quadratic so it is nice.
$endgroup$
– Red shoes
Mar 14 at 3:49
$begingroup$
@TheoBendit I doubt that. The restriction of function over half line (with starting point zero) is quadratic so it is nice.
$endgroup$
– Red shoes
Mar 14 at 3:49
$begingroup$
@TheoBendit I posted a similar question, in math.stackexchange.com/q/3151905/219176 I thought you might be interested to this one. I want to get a deep inside of those kind of function. Any help would be appreciated.
$endgroup$
– Red shoes
Mar 17 at 18:46
$begingroup$
@TheoBendit I posted a similar question, in math.stackexchange.com/q/3151905/219176 I thought you might be interested to this one. I want to get a deep inside of those kind of function. Any help would be appreciated.
$endgroup$
– Red shoes
Mar 17 at 18:46
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Ok, let's construct a counterexample, since I can't express my thoughts via comments.
Start by considering the semicircle function over $BbbR$, defined by
$$x mapsto begincases1-sqrt1 - x^2 & textif |x| le 1 \ infty & textif |x| > 1 endcases.$$
This is an example of an lsc which fails to admit subgradients at each point in the domain, as there is no subgradient at $x = pm 1$. We can see this visually by observing that the points $(pm 1, 1)$ are supported only by vertical lines.
Now, we embed this function in $BbbR^2$, then extend it to a cone. Let $C$ be the cone generated by $[-1, 1] times 1$, which is defined by the inequality $y ge |x|$. We form a function $g$ over $C$ by defining its graph to be the (non-convex) cone generated by the graph of the semicircle function over the domain $[-1, 1] times 1$. More explicitly,
$$g(x, y) = begincasesy -sqrty^2 - x^2 & textif (x, y) in C \ infty & textotherwise endcases.$$
This function is scalar positive-homogeneous (only degree $1$; we shall square it soon enough!).
I also claim that $g$ is lsc and convex. I think the most intuitive way to see this is to express $operatornameepi g$ as the closure of the cone generated by our semicircle defined over $[-1, 1]$. In particular,
$$operatornameepi g = overlineoperatornamecone S$$
where
$$S = leftx.$$
So, suppose $(a, b, c) in operatornamecone S$. We may therefore find $x, z, lambda$, the latter non-negative, such that $(a, b, c) = lambda(x, 1, z)$, $|x| le 1$, and $z ge 1 - sqrt1 - x^2$. Clearly, $lambda = b$. If $b = 0$, then $(a, b, c) = (0, 0, 0) in operatornameepi g$, so we may assume $b > 0$.
We also have $left|fracabright| = |x| le 1 implies |a| le |b| = b$, so $(a, b, c) in C$. Given the condition that $z ge 1 - sqrt1 - x^2$, we get
$$fraccb ge 1 - sqrt1 - left(fracabright)^2 implies c ge b - sqrtb^2 - a^2 = g(a, b) implies (a, b, c) in operatornameepi g.$$
On the other hand, if $(a, b, c) in operatornameepi g$, then $(a, b) in C$, hence $b ge |a|$. Suppose for the moment that $b > 0$, and consider the point
$$(x, 1, z) = left(fracab, 1, fraccbright).$$
We see that $b(x, 1, z) = (a, b, c)$, and by reverse engineering the above calculation, we get that $(x, 1, z) in S$. Hence $(a, b, c) in operatornamecone S$.
On the other hand, suppose $b = 0$. Note that this implies $a = 0$ too, by definition of $C$. We know that $c ge 0$.
Fix $varepsilon > 0$. Consider the point $(0, varepsilon, c)$. We have
$$c ge 0 = g(0, varepsilon),$$
hence this point lies in $operatornameepi g$, and by the above argument, $operatornamecone S$. Since this point is $varepsilon$-close to $(a, b, c)$, it follows $(a, b, c) in overlineoperatornamecone S$.
To finally complete the proof that $g$ is lsc and convex, note that $g$ is continuous when restricted to $C$, hence its epigraph is closed, and thus is equal to the closed convex set $overlineoperatornamecone S$.
Now, we may define $f : BbbR^2 to [0, infty]$ by $f(x) = g(x)^2$, where $infty^2 = infty$. As we are applying a monotone increasing real convex function over the positive reals to $g$, the resulting function is convex. The nice continuity properties of the squaring map also ensures that $f$ is lsc. We finally have
$$f(lambda (x, y)) = g(lambda (x, y))^2 = lambda^2 g(x, y)^2 = lambda^2 f(x, y),$$
as required. We have now completely constructed our counterexample!
The only thing left to do is prove it is a counterexample. None of the points of the form $(pm x, x)$ will have subgradients, but let's just pick on $(1, 1)$.
Suppose $(a, b) in partial f(1, 1)$. Consider points along the ray $(1, 1) + t(-1, 1)$ for $t ge 0$. Note that this ray is contained in $C$, and we have, by definition of the subgradient,
$$(a, b) cdot (-1, 1) le fracf(1 - t, 1 + t) - 1t.$$
Expanding,
beginalign*
f(1 - t, 1 + t) &= left(1 + t - sqrt(1 + t)^2 - (1 - t)^2right)^2 \
&= left(1 + t - 2sqrttright)^2 = (1 - sqrtt)^4.
endalign*
However,
$$lim_t to 0^+ frac(1 - sqrtt)^4 - 1t = -infty,$$
so for sufficiently small $t$, we have
$$fracf(1 - t, 1 + t) - 1t < (a, b) cdot (-1, 1)$$
against assumption. That is, $partial f(1, 1) = emptyset$ (finally).
$endgroup$
$begingroup$
(I have no doubt that I've left errors lying about the place. Please let me know if you find some.)
$endgroup$
– Theo Bendit
Mar 14 at 5:22
1
$begingroup$
Awesome . Thank you
$endgroup$
– Red shoes
Mar 14 at 7:15
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%2f3147444%2fsubdifferential-of-a-lower-semicontinuous-convex-and-positively-homogenous-deg%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$
Ok, let's construct a counterexample, since I can't express my thoughts via comments.
Start by considering the semicircle function over $BbbR$, defined by
$$x mapsto begincases1-sqrt1 - x^2 & textif |x| le 1 \ infty & textif |x| > 1 endcases.$$
This is an example of an lsc which fails to admit subgradients at each point in the domain, as there is no subgradient at $x = pm 1$. We can see this visually by observing that the points $(pm 1, 1)$ are supported only by vertical lines.
Now, we embed this function in $BbbR^2$, then extend it to a cone. Let $C$ be the cone generated by $[-1, 1] times 1$, which is defined by the inequality $y ge |x|$. We form a function $g$ over $C$ by defining its graph to be the (non-convex) cone generated by the graph of the semicircle function over the domain $[-1, 1] times 1$. More explicitly,
$$g(x, y) = begincasesy -sqrty^2 - x^2 & textif (x, y) in C \ infty & textotherwise endcases.$$
This function is scalar positive-homogeneous (only degree $1$; we shall square it soon enough!).
I also claim that $g$ is lsc and convex. I think the most intuitive way to see this is to express $operatornameepi g$ as the closure of the cone generated by our semicircle defined over $[-1, 1]$. In particular,
$$operatornameepi g = overlineoperatornamecone S$$
where
$$S = leftx.$$
So, suppose $(a, b, c) in operatornamecone S$. We may therefore find $x, z, lambda$, the latter non-negative, such that $(a, b, c) = lambda(x, 1, z)$, $|x| le 1$, and $z ge 1 - sqrt1 - x^2$. Clearly, $lambda = b$. If $b = 0$, then $(a, b, c) = (0, 0, 0) in operatornameepi g$, so we may assume $b > 0$.
We also have $left|fracabright| = |x| le 1 implies |a| le |b| = b$, so $(a, b, c) in C$. Given the condition that $z ge 1 - sqrt1 - x^2$, we get
$$fraccb ge 1 - sqrt1 - left(fracabright)^2 implies c ge b - sqrtb^2 - a^2 = g(a, b) implies (a, b, c) in operatornameepi g.$$
On the other hand, if $(a, b, c) in operatornameepi g$, then $(a, b) in C$, hence $b ge |a|$. Suppose for the moment that $b > 0$, and consider the point
$$(x, 1, z) = left(fracab, 1, fraccbright).$$
We see that $b(x, 1, z) = (a, b, c)$, and by reverse engineering the above calculation, we get that $(x, 1, z) in S$. Hence $(a, b, c) in operatornamecone S$.
On the other hand, suppose $b = 0$. Note that this implies $a = 0$ too, by definition of $C$. We know that $c ge 0$.
Fix $varepsilon > 0$. Consider the point $(0, varepsilon, c)$. We have
$$c ge 0 = g(0, varepsilon),$$
hence this point lies in $operatornameepi g$, and by the above argument, $operatornamecone S$. Since this point is $varepsilon$-close to $(a, b, c)$, it follows $(a, b, c) in overlineoperatornamecone S$.
To finally complete the proof that $g$ is lsc and convex, note that $g$ is continuous when restricted to $C$, hence its epigraph is closed, and thus is equal to the closed convex set $overlineoperatornamecone S$.
Now, we may define $f : BbbR^2 to [0, infty]$ by $f(x) = g(x)^2$, where $infty^2 = infty$. As we are applying a monotone increasing real convex function over the positive reals to $g$, the resulting function is convex. The nice continuity properties of the squaring map also ensures that $f$ is lsc. We finally have
$$f(lambda (x, y)) = g(lambda (x, y))^2 = lambda^2 g(x, y)^2 = lambda^2 f(x, y),$$
as required. We have now completely constructed our counterexample!
The only thing left to do is prove it is a counterexample. None of the points of the form $(pm x, x)$ will have subgradients, but let's just pick on $(1, 1)$.
Suppose $(a, b) in partial f(1, 1)$. Consider points along the ray $(1, 1) + t(-1, 1)$ for $t ge 0$. Note that this ray is contained in $C$, and we have, by definition of the subgradient,
$$(a, b) cdot (-1, 1) le fracf(1 - t, 1 + t) - 1t.$$
Expanding,
beginalign*
f(1 - t, 1 + t) &= left(1 + t - sqrt(1 + t)^2 - (1 - t)^2right)^2 \
&= left(1 + t - 2sqrttright)^2 = (1 - sqrtt)^4.
endalign*
However,
$$lim_t to 0^+ frac(1 - sqrtt)^4 - 1t = -infty,$$
so for sufficiently small $t$, we have
$$fracf(1 - t, 1 + t) - 1t < (a, b) cdot (-1, 1)$$
against assumption. That is, $partial f(1, 1) = emptyset$ (finally).
$endgroup$
$begingroup$
(I have no doubt that I've left errors lying about the place. Please let me know if you find some.)
$endgroup$
– Theo Bendit
Mar 14 at 5:22
1
$begingroup$
Awesome . Thank you
$endgroup$
– Red shoes
Mar 14 at 7:15
add a comment |
$begingroup$
Ok, let's construct a counterexample, since I can't express my thoughts via comments.
Start by considering the semicircle function over $BbbR$, defined by
$$x mapsto begincases1-sqrt1 - x^2 & textif |x| le 1 \ infty & textif |x| > 1 endcases.$$
This is an example of an lsc which fails to admit subgradients at each point in the domain, as there is no subgradient at $x = pm 1$. We can see this visually by observing that the points $(pm 1, 1)$ are supported only by vertical lines.
Now, we embed this function in $BbbR^2$, then extend it to a cone. Let $C$ be the cone generated by $[-1, 1] times 1$, which is defined by the inequality $y ge |x|$. We form a function $g$ over $C$ by defining its graph to be the (non-convex) cone generated by the graph of the semicircle function over the domain $[-1, 1] times 1$. More explicitly,
$$g(x, y) = begincasesy -sqrty^2 - x^2 & textif (x, y) in C \ infty & textotherwise endcases.$$
This function is scalar positive-homogeneous (only degree $1$; we shall square it soon enough!).
I also claim that $g$ is lsc and convex. I think the most intuitive way to see this is to express $operatornameepi g$ as the closure of the cone generated by our semicircle defined over $[-1, 1]$. In particular,
$$operatornameepi g = overlineoperatornamecone S$$
where
$$S = leftx.$$
So, suppose $(a, b, c) in operatornamecone S$. We may therefore find $x, z, lambda$, the latter non-negative, such that $(a, b, c) = lambda(x, 1, z)$, $|x| le 1$, and $z ge 1 - sqrt1 - x^2$. Clearly, $lambda = b$. If $b = 0$, then $(a, b, c) = (0, 0, 0) in operatornameepi g$, so we may assume $b > 0$.
We also have $left|fracabright| = |x| le 1 implies |a| le |b| = b$, so $(a, b, c) in C$. Given the condition that $z ge 1 - sqrt1 - x^2$, we get
$$fraccb ge 1 - sqrt1 - left(fracabright)^2 implies c ge b - sqrtb^2 - a^2 = g(a, b) implies (a, b, c) in operatornameepi g.$$
On the other hand, if $(a, b, c) in operatornameepi g$, then $(a, b) in C$, hence $b ge |a|$. Suppose for the moment that $b > 0$, and consider the point
$$(x, 1, z) = left(fracab, 1, fraccbright).$$
We see that $b(x, 1, z) = (a, b, c)$, and by reverse engineering the above calculation, we get that $(x, 1, z) in S$. Hence $(a, b, c) in operatornamecone S$.
On the other hand, suppose $b = 0$. Note that this implies $a = 0$ too, by definition of $C$. We know that $c ge 0$.
Fix $varepsilon > 0$. Consider the point $(0, varepsilon, c)$. We have
$$c ge 0 = g(0, varepsilon),$$
hence this point lies in $operatornameepi g$, and by the above argument, $operatornamecone S$. Since this point is $varepsilon$-close to $(a, b, c)$, it follows $(a, b, c) in overlineoperatornamecone S$.
To finally complete the proof that $g$ is lsc and convex, note that $g$ is continuous when restricted to $C$, hence its epigraph is closed, and thus is equal to the closed convex set $overlineoperatornamecone S$.
Now, we may define $f : BbbR^2 to [0, infty]$ by $f(x) = g(x)^2$, where $infty^2 = infty$. As we are applying a monotone increasing real convex function over the positive reals to $g$, the resulting function is convex. The nice continuity properties of the squaring map also ensures that $f$ is lsc. We finally have
$$f(lambda (x, y)) = g(lambda (x, y))^2 = lambda^2 g(x, y)^2 = lambda^2 f(x, y),$$
as required. We have now completely constructed our counterexample!
The only thing left to do is prove it is a counterexample. None of the points of the form $(pm x, x)$ will have subgradients, but let's just pick on $(1, 1)$.
Suppose $(a, b) in partial f(1, 1)$. Consider points along the ray $(1, 1) + t(-1, 1)$ for $t ge 0$. Note that this ray is contained in $C$, and we have, by definition of the subgradient,
$$(a, b) cdot (-1, 1) le fracf(1 - t, 1 + t) - 1t.$$
Expanding,
beginalign*
f(1 - t, 1 + t) &= left(1 + t - sqrt(1 + t)^2 - (1 - t)^2right)^2 \
&= left(1 + t - 2sqrttright)^2 = (1 - sqrtt)^4.
endalign*
However,
$$lim_t to 0^+ frac(1 - sqrtt)^4 - 1t = -infty,$$
so for sufficiently small $t$, we have
$$fracf(1 - t, 1 + t) - 1t < (a, b) cdot (-1, 1)$$
against assumption. That is, $partial f(1, 1) = emptyset$ (finally).
$endgroup$
$begingroup$
(I have no doubt that I've left errors lying about the place. Please let me know if you find some.)
$endgroup$
– Theo Bendit
Mar 14 at 5:22
1
$begingroup$
Awesome . Thank you
$endgroup$
– Red shoes
Mar 14 at 7:15
add a comment |
$begingroup$
Ok, let's construct a counterexample, since I can't express my thoughts via comments.
Start by considering the semicircle function over $BbbR$, defined by
$$x mapsto begincases1-sqrt1 - x^2 & textif |x| le 1 \ infty & textif |x| > 1 endcases.$$
This is an example of an lsc which fails to admit subgradients at each point in the domain, as there is no subgradient at $x = pm 1$. We can see this visually by observing that the points $(pm 1, 1)$ are supported only by vertical lines.
Now, we embed this function in $BbbR^2$, then extend it to a cone. Let $C$ be the cone generated by $[-1, 1] times 1$, which is defined by the inequality $y ge |x|$. We form a function $g$ over $C$ by defining its graph to be the (non-convex) cone generated by the graph of the semicircle function over the domain $[-1, 1] times 1$. More explicitly,
$$g(x, y) = begincasesy -sqrty^2 - x^2 & textif (x, y) in C \ infty & textotherwise endcases.$$
This function is scalar positive-homogeneous (only degree $1$; we shall square it soon enough!).
I also claim that $g$ is lsc and convex. I think the most intuitive way to see this is to express $operatornameepi g$ as the closure of the cone generated by our semicircle defined over $[-1, 1]$. In particular,
$$operatornameepi g = overlineoperatornamecone S$$
where
$$S = leftx.$$
So, suppose $(a, b, c) in operatornamecone S$. We may therefore find $x, z, lambda$, the latter non-negative, such that $(a, b, c) = lambda(x, 1, z)$, $|x| le 1$, and $z ge 1 - sqrt1 - x^2$. Clearly, $lambda = b$. If $b = 0$, then $(a, b, c) = (0, 0, 0) in operatornameepi g$, so we may assume $b > 0$.
We also have $left|fracabright| = |x| le 1 implies |a| le |b| = b$, so $(a, b, c) in C$. Given the condition that $z ge 1 - sqrt1 - x^2$, we get
$$fraccb ge 1 - sqrt1 - left(fracabright)^2 implies c ge b - sqrtb^2 - a^2 = g(a, b) implies (a, b, c) in operatornameepi g.$$
On the other hand, if $(a, b, c) in operatornameepi g$, then $(a, b) in C$, hence $b ge |a|$. Suppose for the moment that $b > 0$, and consider the point
$$(x, 1, z) = left(fracab, 1, fraccbright).$$
We see that $b(x, 1, z) = (a, b, c)$, and by reverse engineering the above calculation, we get that $(x, 1, z) in S$. Hence $(a, b, c) in operatornamecone S$.
On the other hand, suppose $b = 0$. Note that this implies $a = 0$ too, by definition of $C$. We know that $c ge 0$.
Fix $varepsilon > 0$. Consider the point $(0, varepsilon, c)$. We have
$$c ge 0 = g(0, varepsilon),$$
hence this point lies in $operatornameepi g$, and by the above argument, $operatornamecone S$. Since this point is $varepsilon$-close to $(a, b, c)$, it follows $(a, b, c) in overlineoperatornamecone S$.
To finally complete the proof that $g$ is lsc and convex, note that $g$ is continuous when restricted to $C$, hence its epigraph is closed, and thus is equal to the closed convex set $overlineoperatornamecone S$.
Now, we may define $f : BbbR^2 to [0, infty]$ by $f(x) = g(x)^2$, where $infty^2 = infty$. As we are applying a monotone increasing real convex function over the positive reals to $g$, the resulting function is convex. The nice continuity properties of the squaring map also ensures that $f$ is lsc. We finally have
$$f(lambda (x, y)) = g(lambda (x, y))^2 = lambda^2 g(x, y)^2 = lambda^2 f(x, y),$$
as required. We have now completely constructed our counterexample!
The only thing left to do is prove it is a counterexample. None of the points of the form $(pm x, x)$ will have subgradients, but let's just pick on $(1, 1)$.
Suppose $(a, b) in partial f(1, 1)$. Consider points along the ray $(1, 1) + t(-1, 1)$ for $t ge 0$. Note that this ray is contained in $C$, and we have, by definition of the subgradient,
$$(a, b) cdot (-1, 1) le fracf(1 - t, 1 + t) - 1t.$$
Expanding,
beginalign*
f(1 - t, 1 + t) &= left(1 + t - sqrt(1 + t)^2 - (1 - t)^2right)^2 \
&= left(1 + t - 2sqrttright)^2 = (1 - sqrtt)^4.
endalign*
However,
$$lim_t to 0^+ frac(1 - sqrtt)^4 - 1t = -infty,$$
so for sufficiently small $t$, we have
$$fracf(1 - t, 1 + t) - 1t < (a, b) cdot (-1, 1)$$
against assumption. That is, $partial f(1, 1) = emptyset$ (finally).
$endgroup$
Ok, let's construct a counterexample, since I can't express my thoughts via comments.
Start by considering the semicircle function over $BbbR$, defined by
$$x mapsto begincases1-sqrt1 - x^2 & textif |x| le 1 \ infty & textif |x| > 1 endcases.$$
This is an example of an lsc which fails to admit subgradients at each point in the domain, as there is no subgradient at $x = pm 1$. We can see this visually by observing that the points $(pm 1, 1)$ are supported only by vertical lines.
Now, we embed this function in $BbbR^2$, then extend it to a cone. Let $C$ be the cone generated by $[-1, 1] times 1$, which is defined by the inequality $y ge |x|$. We form a function $g$ over $C$ by defining its graph to be the (non-convex) cone generated by the graph of the semicircle function over the domain $[-1, 1] times 1$. More explicitly,
$$g(x, y) = begincasesy -sqrty^2 - x^2 & textif (x, y) in C \ infty & textotherwise endcases.$$
This function is scalar positive-homogeneous (only degree $1$; we shall square it soon enough!).
I also claim that $g$ is lsc and convex. I think the most intuitive way to see this is to express $operatornameepi g$ as the closure of the cone generated by our semicircle defined over $[-1, 1]$. In particular,
$$operatornameepi g = overlineoperatornamecone S$$
where
$$S = leftx.$$
So, suppose $(a, b, c) in operatornamecone S$. We may therefore find $x, z, lambda$, the latter non-negative, such that $(a, b, c) = lambda(x, 1, z)$, $|x| le 1$, and $z ge 1 - sqrt1 - x^2$. Clearly, $lambda = b$. If $b = 0$, then $(a, b, c) = (0, 0, 0) in operatornameepi g$, so we may assume $b > 0$.
We also have $left|fracabright| = |x| le 1 implies |a| le |b| = b$, so $(a, b, c) in C$. Given the condition that $z ge 1 - sqrt1 - x^2$, we get
$$fraccb ge 1 - sqrt1 - left(fracabright)^2 implies c ge b - sqrtb^2 - a^2 = g(a, b) implies (a, b, c) in operatornameepi g.$$
On the other hand, if $(a, b, c) in operatornameepi g$, then $(a, b) in C$, hence $b ge |a|$. Suppose for the moment that $b > 0$, and consider the point
$$(x, 1, z) = left(fracab, 1, fraccbright).$$
We see that $b(x, 1, z) = (a, b, c)$, and by reverse engineering the above calculation, we get that $(x, 1, z) in S$. Hence $(a, b, c) in operatornamecone S$.
On the other hand, suppose $b = 0$. Note that this implies $a = 0$ too, by definition of $C$. We know that $c ge 0$.
Fix $varepsilon > 0$. Consider the point $(0, varepsilon, c)$. We have
$$c ge 0 = g(0, varepsilon),$$
hence this point lies in $operatornameepi g$, and by the above argument, $operatornamecone S$. Since this point is $varepsilon$-close to $(a, b, c)$, it follows $(a, b, c) in overlineoperatornamecone S$.
To finally complete the proof that $g$ is lsc and convex, note that $g$ is continuous when restricted to $C$, hence its epigraph is closed, and thus is equal to the closed convex set $overlineoperatornamecone S$.
Now, we may define $f : BbbR^2 to [0, infty]$ by $f(x) = g(x)^2$, where $infty^2 = infty$. As we are applying a monotone increasing real convex function over the positive reals to $g$, the resulting function is convex. The nice continuity properties of the squaring map also ensures that $f$ is lsc. We finally have
$$f(lambda (x, y)) = g(lambda (x, y))^2 = lambda^2 g(x, y)^2 = lambda^2 f(x, y),$$
as required. We have now completely constructed our counterexample!
The only thing left to do is prove it is a counterexample. None of the points of the form $(pm x, x)$ will have subgradients, but let's just pick on $(1, 1)$.
Suppose $(a, b) in partial f(1, 1)$. Consider points along the ray $(1, 1) + t(-1, 1)$ for $t ge 0$. Note that this ray is contained in $C$, and we have, by definition of the subgradient,
$$(a, b) cdot (-1, 1) le fracf(1 - t, 1 + t) - 1t.$$
Expanding,
beginalign*
f(1 - t, 1 + t) &= left(1 + t - sqrt(1 + t)^2 - (1 - t)^2right)^2 \
&= left(1 + t - 2sqrttright)^2 = (1 - sqrtt)^4.
endalign*
However,
$$lim_t to 0^+ frac(1 - sqrtt)^4 - 1t = -infty,$$
so for sufficiently small $t$, we have
$$fracf(1 - t, 1 + t) - 1t < (a, b) cdot (-1, 1)$$
against assumption. That is, $partial f(1, 1) = emptyset$ (finally).
answered Mar 14 at 5:21
Theo BenditTheo Bendit
19.6k12354
19.6k12354
$begingroup$
(I have no doubt that I've left errors lying about the place. Please let me know if you find some.)
$endgroup$
– Theo Bendit
Mar 14 at 5:22
1
$begingroup$
Awesome . Thank you
$endgroup$
– Red shoes
Mar 14 at 7:15
add a comment |
$begingroup$
(I have no doubt that I've left errors lying about the place. Please let me know if you find some.)
$endgroup$
– Theo Bendit
Mar 14 at 5:22
1
$begingroup$
Awesome . Thank you
$endgroup$
– Red shoes
Mar 14 at 7:15
$begingroup$
(I have no doubt that I've left errors lying about the place. Please let me know if you find some.)
$endgroup$
– Theo Bendit
Mar 14 at 5:22
$begingroup$
(I have no doubt that I've left errors lying about the place. Please let me know if you find some.)
$endgroup$
– Theo Bendit
Mar 14 at 5:22
1
1
$begingroup$
Awesome . Thank you
$endgroup$
– Red shoes
Mar 14 at 7:15
$begingroup$
Awesome . Thank you
$endgroup$
– Red shoes
Mar 14 at 7:15
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%2f3147444%2fsubdifferential-of-a-lower-semicontinuous-convex-and-positively-homogenous-deg%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
1
$begingroup$
In finite dimensions, all convex functions have subgradients at points in the core (or algebraic interior, substitute with "interior" if you want) of the domain. Given the positively homogeneous of degree $2$ condition, it appears that the domain has to be a subspace, and so if you restrict $f$ to this subspace, you should be able to find a subgradient for the restriction of $f$. You can then extend this subgradient in any way you like to the full space to obtain an element of the subgradient in the full space. I'm writing a comment because I feel like I've missed something in your question...
$endgroup$
– Theo Bendit
Mar 14 at 2:36
$begingroup$
@TheoBendit Thanks for your comment . The domain is just cone not necessary subspace, otherwise problem would become trivial as any convex function $f$ has subgradient on the relative interior of it's domain . (in finite dimension)
$endgroup$
– Red shoes
Mar 14 at 2:49
$begingroup$
Ah yes, there it is: I've missed the condition that $t ge 0$. Still though, the standard argument will show that subgradients exist on the relative interior. You just need to worry about the relative boundary. Basically, this will fail when the subgradients are unbounded in the neighbourhood of the relative boundary point, which I'm fairly confident can happen. That is, I'm pretty sure that this is false, though I don't have time to write up a counterexample at the moment.
$endgroup$
– Theo Bendit
Mar 14 at 2:59
$begingroup$
@TheoBendit I doubt that. The restriction of function over half line (with starting point zero) is quadratic so it is nice.
$endgroup$
– Red shoes
Mar 14 at 3:49
$begingroup$
@TheoBendit I posted a similar question, in math.stackexchange.com/q/3151905/219176 I thought you might be interested to this one. I want to get a deep inside of those kind of function. Any help would be appreciated.
$endgroup$
– Red shoes
Mar 17 at 18:46