Function which is convex in a variable cannot achieve maximum?
$begingroup$
This question arose out of studying "nice" conditions on Lagrangians. Let $L : mathbb{R}^n times mathbb{R}^n times mathbb{R} to mathbb{R}$ (let us write $L(x, v, t)$) be convex in $v$ (for any $x, t$). Is it true that any extrema of $L$ must be either global minima, or a saddle point? In particular, $L$ cannot achieve a maximum?
I ask this because the Euler-Lagrange equations are equivalent to being a critical point of the action functional, but generally we want to minimize (at least, as far as I know) the action, and so I'm wondering under what conditions we get critical point $implies$ minimum. I've seen convexity in the $v$-variable as an assumption before. Why in this variable? What about $x$, or $t$?
Many thanks for any help!
analysis dynamical-systems euler-lagrange-equation
$endgroup$
add a comment |
$begingroup$
This question arose out of studying "nice" conditions on Lagrangians. Let $L : mathbb{R}^n times mathbb{R}^n times mathbb{R} to mathbb{R}$ (let us write $L(x, v, t)$) be convex in $v$ (for any $x, t$). Is it true that any extrema of $L$ must be either global minima, or a saddle point? In particular, $L$ cannot achieve a maximum?
I ask this because the Euler-Lagrange equations are equivalent to being a critical point of the action functional, but generally we want to minimize (at least, as far as I know) the action, and so I'm wondering under what conditions we get critical point $implies$ minimum. I've seen convexity in the $v$-variable as an assumption before. Why in this variable? What about $x$, or $t$?
Many thanks for any help!
analysis dynamical-systems euler-lagrange-equation
$endgroup$
$begingroup$
I slightly updated my answer to account for trivial cases.
$endgroup$
– LinAlg
Dec 21 '18 at 19:35
add a comment |
$begingroup$
This question arose out of studying "nice" conditions on Lagrangians. Let $L : mathbb{R}^n times mathbb{R}^n times mathbb{R} to mathbb{R}$ (let us write $L(x, v, t)$) be convex in $v$ (for any $x, t$). Is it true that any extrema of $L$ must be either global minima, or a saddle point? In particular, $L$ cannot achieve a maximum?
I ask this because the Euler-Lagrange equations are equivalent to being a critical point of the action functional, but generally we want to minimize (at least, as far as I know) the action, and so I'm wondering under what conditions we get critical point $implies$ minimum. I've seen convexity in the $v$-variable as an assumption before. Why in this variable? What about $x$, or $t$?
Many thanks for any help!
analysis dynamical-systems euler-lagrange-equation
$endgroup$
This question arose out of studying "nice" conditions on Lagrangians. Let $L : mathbb{R}^n times mathbb{R}^n times mathbb{R} to mathbb{R}$ (let us write $L(x, v, t)$) be convex in $v$ (for any $x, t$). Is it true that any extrema of $L$ must be either global minima, or a saddle point? In particular, $L$ cannot achieve a maximum?
I ask this because the Euler-Lagrange equations are equivalent to being a critical point of the action functional, but generally we want to minimize (at least, as far as I know) the action, and so I'm wondering under what conditions we get critical point $implies$ minimum. I've seen convexity in the $v$-variable as an assumption before. Why in this variable? What about $x$, or $t$?
Many thanks for any help!
analysis dynamical-systems euler-lagrange-equation
analysis dynamical-systems euler-lagrange-equation
asked Dec 21 '18 at 19:04
ChrisChris
1,590413
1,590413
$begingroup$
I slightly updated my answer to account for trivial cases.
$endgroup$
– LinAlg
Dec 21 '18 at 19:35
add a comment |
$begingroup$
I slightly updated my answer to account for trivial cases.
$endgroup$
– LinAlg
Dec 21 '18 at 19:35
$begingroup$
I slightly updated my answer to account for trivial cases.
$endgroup$
– LinAlg
Dec 21 '18 at 19:35
$begingroup$
I slightly updated my answer to account for trivial cases.
$endgroup$
– LinAlg
Dec 21 '18 at 19:35
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The answer to your question is negative. If $L(x,v,t)$ has a maximum at $(x^*,v^*,t^*)$, then the convex function $f(t) = (x^*,v^*,t)$ has a maximum at $t^*$, which a convex function with domain $mathbb{R}$ cannot have (unless the function is constant).
$endgroup$
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%2f3048799%2ffunction-which-is-convex-in-a-variable-cannot-achieve-maximum%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$
The answer to your question is negative. If $L(x,v,t)$ has a maximum at $(x^*,v^*,t^*)$, then the convex function $f(t) = (x^*,v^*,t)$ has a maximum at $t^*$, which a convex function with domain $mathbb{R}$ cannot have (unless the function is constant).
$endgroup$
add a comment |
$begingroup$
The answer to your question is negative. If $L(x,v,t)$ has a maximum at $(x^*,v^*,t^*)$, then the convex function $f(t) = (x^*,v^*,t)$ has a maximum at $t^*$, which a convex function with domain $mathbb{R}$ cannot have (unless the function is constant).
$endgroup$
add a comment |
$begingroup$
The answer to your question is negative. If $L(x,v,t)$ has a maximum at $(x^*,v^*,t^*)$, then the convex function $f(t) = (x^*,v^*,t)$ has a maximum at $t^*$, which a convex function with domain $mathbb{R}$ cannot have (unless the function is constant).
$endgroup$
The answer to your question is negative. If $L(x,v,t)$ has a maximum at $(x^*,v^*,t^*)$, then the convex function $f(t) = (x^*,v^*,t)$ has a maximum at $t^*$, which a convex function with domain $mathbb{R}$ cannot have (unless the function is constant).
edited Dec 21 '18 at 19:34
answered Dec 21 '18 at 19:14
LinAlgLinAlg
10.1k1521
10.1k1521
add a comment |
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%2f3048799%2ffunction-which-is-convex-in-a-variable-cannot-achieve-maximum%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
$begingroup$
I slightly updated my answer to account for trivial cases.
$endgroup$
– LinAlg
Dec 21 '18 at 19:35