Guarantee strict convexity at a point












1












$begingroup$


Suppose we have a univariate function $f(t), tin [0,1]$. We define
begin{align}
G(p) = sup_{tin [0,1]} p f(t) + (1-p) f(1-t), text{ for } pin [0,1].
end{align}

Clearly $G(p)$ is a convex function in $p$ since it is the supremum of a family of convex functions in $p$. However, we want a stronger requirement: we would like to make sure that $G(p)$ is strictly convex at point $p = 1/2$. In other words, we want to guarantee that for any $x,yin [0,1], x neq 1/2, yneq 1/2$, any $uin (0,1)$ such that $u x + (1-u) y = 1/2$, we have
begin{align}
G(1/2) < u G(x) + (1-u) G(y).
end{align}



The question is, what is the most general condition on $f$ such that this requirement is satisfied?



It is easy to verify that for special examples such that $f(t) = log t$ or $f(t) = t$, it is true.



Conjecture: it is true whenever $f$ is a concave function and $f'(1/2) neq 0$.










share|cite|improve this question











$endgroup$












  • $begingroup$
    what about $x=y=0.5$?
    $endgroup$
    – LinAlg
    Dec 24 '18 at 2:48
















1












$begingroup$


Suppose we have a univariate function $f(t), tin [0,1]$. We define
begin{align}
G(p) = sup_{tin [0,1]} p f(t) + (1-p) f(1-t), text{ for } pin [0,1].
end{align}

Clearly $G(p)$ is a convex function in $p$ since it is the supremum of a family of convex functions in $p$. However, we want a stronger requirement: we would like to make sure that $G(p)$ is strictly convex at point $p = 1/2$. In other words, we want to guarantee that for any $x,yin [0,1], x neq 1/2, yneq 1/2$, any $uin (0,1)$ such that $u x + (1-u) y = 1/2$, we have
begin{align}
G(1/2) < u G(x) + (1-u) G(y).
end{align}



The question is, what is the most general condition on $f$ such that this requirement is satisfied?



It is easy to verify that for special examples such that $f(t) = log t$ or $f(t) = t$, it is true.



Conjecture: it is true whenever $f$ is a concave function and $f'(1/2) neq 0$.










share|cite|improve this question











$endgroup$












  • $begingroup$
    what about $x=y=0.5$?
    $endgroup$
    – LinAlg
    Dec 24 '18 at 2:48














1












1








1





$begingroup$


Suppose we have a univariate function $f(t), tin [0,1]$. We define
begin{align}
G(p) = sup_{tin [0,1]} p f(t) + (1-p) f(1-t), text{ for } pin [0,1].
end{align}

Clearly $G(p)$ is a convex function in $p$ since it is the supremum of a family of convex functions in $p$. However, we want a stronger requirement: we would like to make sure that $G(p)$ is strictly convex at point $p = 1/2$. In other words, we want to guarantee that for any $x,yin [0,1], x neq 1/2, yneq 1/2$, any $uin (0,1)$ such that $u x + (1-u) y = 1/2$, we have
begin{align}
G(1/2) < u G(x) + (1-u) G(y).
end{align}



The question is, what is the most general condition on $f$ such that this requirement is satisfied?



It is easy to verify that for special examples such that $f(t) = log t$ or $f(t) = t$, it is true.



Conjecture: it is true whenever $f$ is a concave function and $f'(1/2) neq 0$.










share|cite|improve this question











$endgroup$




Suppose we have a univariate function $f(t), tin [0,1]$. We define
begin{align}
G(p) = sup_{tin [0,1]} p f(t) + (1-p) f(1-t), text{ for } pin [0,1].
end{align}

Clearly $G(p)$ is a convex function in $p$ since it is the supremum of a family of convex functions in $p$. However, we want a stronger requirement: we would like to make sure that $G(p)$ is strictly convex at point $p = 1/2$. In other words, we want to guarantee that for any $x,yin [0,1], x neq 1/2, yneq 1/2$, any $uin (0,1)$ such that $u x + (1-u) y = 1/2$, we have
begin{align}
G(1/2) < u G(x) + (1-u) G(y).
end{align}



The question is, what is the most general condition on $f$ such that this requirement is satisfied?



It is easy to verify that for special examples such that $f(t) = log t$ or $f(t) = t$, it is true.



Conjecture: it is true whenever $f$ is a concave function and $f'(1/2) neq 0$.







convex-analysis duality-theorems convex-geometry convex-hulls






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 1 at 19:22







user401582

















asked Dec 23 '18 at 21:09









user401582user401582

686




686












  • $begingroup$
    what about $x=y=0.5$?
    $endgroup$
    – LinAlg
    Dec 24 '18 at 2:48


















  • $begingroup$
    what about $x=y=0.5$?
    $endgroup$
    – LinAlg
    Dec 24 '18 at 2:48
















$begingroup$
what about $x=y=0.5$?
$endgroup$
– LinAlg
Dec 24 '18 at 2:48




$begingroup$
what about $x=y=0.5$?
$endgroup$
– LinAlg
Dec 24 '18 at 2:48










0






active

oldest

votes











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3050703%2fguarantee-strict-convexity-at-a-point%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


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

But avoid



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

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


Use MathJax to format equations. MathJax reference.


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




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3050703%2fguarantee-strict-convexity-at-a-point%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Quarter-circle Tiles

build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

Mont Emei