Cut-off functions in Caccioppoli's inequality
$begingroup$
Caccioppoli's inequality states that the solution $u$ of the equation $-nablacdot(Anabla u)=0$ in some bounded domain $Omega$ satisfies
$$int_{B(0,rho)}|nabla u|^2dyleq frac{C}{(R-rho)^2}int_{B(0,R)}|u|^2~dy,$$ for $0<rho<R$, $2R$ should be smaller than diameter of $Omega$, etc. In the proof of Caccioppoli's inequality, a cut-off function $phi$ is constructed on $B(0,R)$ satisfying $|nabla phi|<frac{C}{R-rho}$.
Is it possible to construct a cut-off function satisfying $|nabla phi|<frac{C}{(R-rho)^2}$ or with higher powers of $R-rho$? What is the limit on this?
regularity-theory-of-pdes
$endgroup$
add a comment |
$begingroup$
Caccioppoli's inequality states that the solution $u$ of the equation $-nablacdot(Anabla u)=0$ in some bounded domain $Omega$ satisfies
$$int_{B(0,rho)}|nabla u|^2dyleq frac{C}{(R-rho)^2}int_{B(0,R)}|u|^2~dy,$$ for $0<rho<R$, $2R$ should be smaller than diameter of $Omega$, etc. In the proof of Caccioppoli's inequality, a cut-off function $phi$ is constructed on $B(0,R)$ satisfying $|nabla phi|<frac{C}{R-rho}$.
Is it possible to construct a cut-off function satisfying $|nabla phi|<frac{C}{(R-rho)^2}$ or with higher powers of $R-rho$? What is the limit on this?
regularity-theory-of-pdes
$endgroup$
add a comment |
$begingroup$
Caccioppoli's inequality states that the solution $u$ of the equation $-nablacdot(Anabla u)=0$ in some bounded domain $Omega$ satisfies
$$int_{B(0,rho)}|nabla u|^2dyleq frac{C}{(R-rho)^2}int_{B(0,R)}|u|^2~dy,$$ for $0<rho<R$, $2R$ should be smaller than diameter of $Omega$, etc. In the proof of Caccioppoli's inequality, a cut-off function $phi$ is constructed on $B(0,R)$ satisfying $|nabla phi|<frac{C}{R-rho}$.
Is it possible to construct a cut-off function satisfying $|nabla phi|<frac{C}{(R-rho)^2}$ or with higher powers of $R-rho$? What is the limit on this?
regularity-theory-of-pdes
$endgroup$
Caccioppoli's inequality states that the solution $u$ of the equation $-nablacdot(Anabla u)=0$ in some bounded domain $Omega$ satisfies
$$int_{B(0,rho)}|nabla u|^2dyleq frac{C}{(R-rho)^2}int_{B(0,R)}|u|^2~dy,$$ for $0<rho<R$, $2R$ should be smaller than diameter of $Omega$, etc. In the proof of Caccioppoli's inequality, a cut-off function $phi$ is constructed on $B(0,R)$ satisfying $|nabla phi|<frac{C}{R-rho}$.
Is it possible to construct a cut-off function satisfying $|nabla phi|<frac{C}{(R-rho)^2}$ or with higher powers of $R-rho$? What is the limit on this?
regularity-theory-of-pdes
regularity-theory-of-pdes
asked Nov 11 '18 at 0:01
Tanuj DipshikhaTanuj Dipshikha
197210
197210
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
In general no, you can't expect to improve the exponent. Given such a $phi,$ we have $phi(rho e_1) = 1$ and $phi(R e_1) = 0,$ where $e_1 = (1,0,dots,0)$ is the first of the standard basis vectors. Thus applying the mean value theorem to $t mapsto phi(te_1)$ we obtain $xi in (rho, R)$ such that,
$$ frac{partial phi}{partial x_1}(xi e_1) = frac1{R-rho}. $$
In particular, we see that,
$$ sup_{B_R} |nabla phi| geq frac1{R-rho}. $$
$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%2f2993282%2fcut-off-functions-in-caccioppolis-inequality%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$
In general no, you can't expect to improve the exponent. Given such a $phi,$ we have $phi(rho e_1) = 1$ and $phi(R e_1) = 0,$ where $e_1 = (1,0,dots,0)$ is the first of the standard basis vectors. Thus applying the mean value theorem to $t mapsto phi(te_1)$ we obtain $xi in (rho, R)$ such that,
$$ frac{partial phi}{partial x_1}(xi e_1) = frac1{R-rho}. $$
In particular, we see that,
$$ sup_{B_R} |nabla phi| geq frac1{R-rho}. $$
$endgroup$
add a comment |
$begingroup$
In general no, you can't expect to improve the exponent. Given such a $phi,$ we have $phi(rho e_1) = 1$ and $phi(R e_1) = 0,$ where $e_1 = (1,0,dots,0)$ is the first of the standard basis vectors. Thus applying the mean value theorem to $t mapsto phi(te_1)$ we obtain $xi in (rho, R)$ such that,
$$ frac{partial phi}{partial x_1}(xi e_1) = frac1{R-rho}. $$
In particular, we see that,
$$ sup_{B_R} |nabla phi| geq frac1{R-rho}. $$
$endgroup$
add a comment |
$begingroup$
In general no, you can't expect to improve the exponent. Given such a $phi,$ we have $phi(rho e_1) = 1$ and $phi(R e_1) = 0,$ where $e_1 = (1,0,dots,0)$ is the first of the standard basis vectors. Thus applying the mean value theorem to $t mapsto phi(te_1)$ we obtain $xi in (rho, R)$ such that,
$$ frac{partial phi}{partial x_1}(xi e_1) = frac1{R-rho}. $$
In particular, we see that,
$$ sup_{B_R} |nabla phi| geq frac1{R-rho}. $$
$endgroup$
In general no, you can't expect to improve the exponent. Given such a $phi,$ we have $phi(rho e_1) = 1$ and $phi(R e_1) = 0,$ where $e_1 = (1,0,dots,0)$ is the first of the standard basis vectors. Thus applying the mean value theorem to $t mapsto phi(te_1)$ we obtain $xi in (rho, R)$ such that,
$$ frac{partial phi}{partial x_1}(xi e_1) = frac1{R-rho}. $$
In particular, we see that,
$$ sup_{B_R} |nabla phi| geq frac1{R-rho}. $$
answered Dec 22 '18 at 11:54
ktoiktoi
2,4061618
2,4061618
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%2f2993282%2fcut-off-functions-in-caccioppolis-inequality%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