Approximation of arbitrary convex function












3














I am currently studying Jürgen Moser's "A New Proof of de Giorgi's Theorem Concerning the Regularity Problem for Elliptic Differential Equations". During the proof of the first lemma, he claims that an arbitrary convex function $f$ can be approximated by a sequence of twice continously differentiable convex functions $f_m$, such that $f_m''(u)=0$ for large $|u|$, $f_m rightarrow f$ and $f_m'(u) rightarrow f'(u)$, where $f'(u)$ exists.



Having looked in several books about convex analysis (Rockafellar), I found out that a convex function should be twice differentiable almost everywhere. I further found in one of Rockafellar's books (convex analysis, thm. 25.7) a Theorem that shows the claim, except for the restriction on $f''$.
Now the question is how can we come up with that restriction on $f''$ and maybe someone has a reference for a book as well, since I would be interested in seeing the proof.










share|cite|improve this question




















  • 1




    Is this about pointwise convergence? Then you could just cut off at say $|u|>m$ and replace that bit by a linear function.
    – Michal Adamaszek
    Dec 5 '18 at 11:52










  • I then need to apply Fatou's Lemma so I think pointwise convergence almost everywhere should be enough. Then interpolation would actually do the job..
    – Max
    Dec 5 '18 at 15:28










  • I thought about it again and I am not certain that Interpolation would do the job. The function's derivate could only be defined on $mathbb{R}$ $ mathbb{Q}$. Then interpolation on the rational numbers wouldn't necessarily do the job, I guess. Any thoughts on that?
    – Max
    Dec 5 '18 at 15:41


















3














I am currently studying Jürgen Moser's "A New Proof of de Giorgi's Theorem Concerning the Regularity Problem for Elliptic Differential Equations". During the proof of the first lemma, he claims that an arbitrary convex function $f$ can be approximated by a sequence of twice continously differentiable convex functions $f_m$, such that $f_m''(u)=0$ for large $|u|$, $f_m rightarrow f$ and $f_m'(u) rightarrow f'(u)$, where $f'(u)$ exists.



Having looked in several books about convex analysis (Rockafellar), I found out that a convex function should be twice differentiable almost everywhere. I further found in one of Rockafellar's books (convex analysis, thm. 25.7) a Theorem that shows the claim, except for the restriction on $f''$.
Now the question is how can we come up with that restriction on $f''$ and maybe someone has a reference for a book as well, since I would be interested in seeing the proof.










share|cite|improve this question




















  • 1




    Is this about pointwise convergence? Then you could just cut off at say $|u|>m$ and replace that bit by a linear function.
    – Michal Adamaszek
    Dec 5 '18 at 11:52










  • I then need to apply Fatou's Lemma so I think pointwise convergence almost everywhere should be enough. Then interpolation would actually do the job..
    – Max
    Dec 5 '18 at 15:28










  • I thought about it again and I am not certain that Interpolation would do the job. The function's derivate could only be defined on $mathbb{R}$ $ mathbb{Q}$. Then interpolation on the rational numbers wouldn't necessarily do the job, I guess. Any thoughts on that?
    – Max
    Dec 5 '18 at 15:41
















3












3








3







I am currently studying Jürgen Moser's "A New Proof of de Giorgi's Theorem Concerning the Regularity Problem for Elliptic Differential Equations". During the proof of the first lemma, he claims that an arbitrary convex function $f$ can be approximated by a sequence of twice continously differentiable convex functions $f_m$, such that $f_m''(u)=0$ for large $|u|$, $f_m rightarrow f$ and $f_m'(u) rightarrow f'(u)$, where $f'(u)$ exists.



Having looked in several books about convex analysis (Rockafellar), I found out that a convex function should be twice differentiable almost everywhere. I further found in one of Rockafellar's books (convex analysis, thm. 25.7) a Theorem that shows the claim, except for the restriction on $f''$.
Now the question is how can we come up with that restriction on $f''$ and maybe someone has a reference for a book as well, since I would be interested in seeing the proof.










share|cite|improve this question















I am currently studying Jürgen Moser's "A New Proof of de Giorgi's Theorem Concerning the Regularity Problem for Elliptic Differential Equations". During the proof of the first lemma, he claims that an arbitrary convex function $f$ can be approximated by a sequence of twice continously differentiable convex functions $f_m$, such that $f_m''(u)=0$ for large $|u|$, $f_m rightarrow f$ and $f_m'(u) rightarrow f'(u)$, where $f'(u)$ exists.



Having looked in several books about convex analysis (Rockafellar), I found out that a convex function should be twice differentiable almost everywhere. I further found in one of Rockafellar's books (convex analysis, thm. 25.7) a Theorem that shows the claim, except for the restriction on $f''$.
Now the question is how can we come up with that restriction on $f''$ and maybe someone has a reference for a book as well, since I would be interested in seeing the proof.







differential-equations pde convex-analysis






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 5 '18 at 11:29







Max

















asked Dec 5 '18 at 11:21









MaxMax

234




234








  • 1




    Is this about pointwise convergence? Then you could just cut off at say $|u|>m$ and replace that bit by a linear function.
    – Michal Adamaszek
    Dec 5 '18 at 11:52










  • I then need to apply Fatou's Lemma so I think pointwise convergence almost everywhere should be enough. Then interpolation would actually do the job..
    – Max
    Dec 5 '18 at 15:28










  • I thought about it again and I am not certain that Interpolation would do the job. The function's derivate could only be defined on $mathbb{R}$ $ mathbb{Q}$. Then interpolation on the rational numbers wouldn't necessarily do the job, I guess. Any thoughts on that?
    – Max
    Dec 5 '18 at 15:41
















  • 1




    Is this about pointwise convergence? Then you could just cut off at say $|u|>m$ and replace that bit by a linear function.
    – Michal Adamaszek
    Dec 5 '18 at 11:52










  • I then need to apply Fatou's Lemma so I think pointwise convergence almost everywhere should be enough. Then interpolation would actually do the job..
    – Max
    Dec 5 '18 at 15:28










  • I thought about it again and I am not certain that Interpolation would do the job. The function's derivate could only be defined on $mathbb{R}$ $ mathbb{Q}$. Then interpolation on the rational numbers wouldn't necessarily do the job, I guess. Any thoughts on that?
    – Max
    Dec 5 '18 at 15:41










1




1




Is this about pointwise convergence? Then you could just cut off at say $|u|>m$ and replace that bit by a linear function.
– Michal Adamaszek
Dec 5 '18 at 11:52




Is this about pointwise convergence? Then you could just cut off at say $|u|>m$ and replace that bit by a linear function.
– Michal Adamaszek
Dec 5 '18 at 11:52












I then need to apply Fatou's Lemma so I think pointwise convergence almost everywhere should be enough. Then interpolation would actually do the job..
– Max
Dec 5 '18 at 15:28




I then need to apply Fatou's Lemma so I think pointwise convergence almost everywhere should be enough. Then interpolation would actually do the job..
– Max
Dec 5 '18 at 15:28












I thought about it again and I am not certain that Interpolation would do the job. The function's derivate could only be defined on $mathbb{R}$ $ mathbb{Q}$. Then interpolation on the rational numbers wouldn't necessarily do the job, I guess. Any thoughts on that?
– Max
Dec 5 '18 at 15:41






I thought about it again and I am not certain that Interpolation would do the job. The function's derivate could only be defined on $mathbb{R}$ $ mathbb{Q}$. Then interpolation on the rational numbers wouldn't necessarily do the job, I guess. Any thoughts on that?
– Max
Dec 5 '18 at 15:41












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%2f3026957%2fapproximation-of-arbitrary-convex-function%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.





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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3026957%2fapproximation-of-arbitrary-convex-function%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

Berounka

Sphinx de Gizeh

Different font size/position of beamer's navigation symbols template's content depending on regular/plain...