How to prove the best polynomial approximation operator is continuous?
For any function $fin C[0,1]$, it is well known that there exist an unique polynomial $p^{*}in P_n[0,1]$ such that $||p^{*}-f||_{infty}leq ||p-f||_{infty}$ for any $pin P_n[0,1]$. In this fashion, one can define an operator $A_n: C[0,1]mapsto P_n[0,1]$ as
$$
A_n(f):={rm argmin}_{pin P_n[0,1]}||f-p||_{infty}.
$$
For a fixed $fin C[0,1]$, how to prove that there exists a constant $C$ depending on $f$ and $n$ such that
$$
||A_n(f)-A_n(tilde{f})||_{infty}leq C||f-tilde{f}||_{infty},quad foralltilde{f}in C[0,1].
$$
functional-analysis approximation-theory nonlinear-analysis
asked Nov 18 at 15:45
Lin Xuelei
10810
add a comment |
For any function $fin C[0,1]$, it is well known that there exist an unique polynomial $p^{*}in P_n[0,1]$ such that $||p^{*}-f||_{infty}leq ||p-f||_{infty}$ for any $pin P_n[0,1]$. In this fashion, one can define an operator $A_n: C[0,1]mapsto P_n[0,1]$ as
$$
A_n(f):={rm argmin}_{pin P_n[0,1]}||f-p||_{infty}.
$$
For a fixed $fin C[0,1]$, how to prove that there exists a constant $C$ depending on $f$ and $n$ such that
$$
||A_n(f)-A_n(tilde{f})||_{infty}leq C||f-tilde{f}||_{infty},quad foralltilde{f}in C[0,1].
$$
functional-analysis approximation-theory nonlinear-analysis
asked Nov 18 at 15:45
Lin Xuelei
10810
Is $A_n$ linear?
– Paul Frost
Nov 18 at 16:18
No, it is not linear, since the underlying norm is supremum norm.
– Lin Xuelei
Nov 18 at 17:20
add a comment |
For any function $fin C[0,1]$, it is well known that there exist an unique polynomial $p^{*}in P_n[0,1]$ such that $||p^{*}-f||_{infty}leq ||p-f||_{infty}$ for any $pin P_n[0,1]$. In this fashion, one can define an operator $A_n: C[0,1]mapsto P_n[0,1]$ as
$$
A_n(f):={rm argmin}_{pin P_n[0,1]}||f-p||_{infty}.
$$
For a fixed $fin C[0,1]$, how to prove that there exists a constant $C$ depending on $f$ and $n$ such that
$$
||A_n(f)-A_n(tilde{f})||_{infty}leq C||f-tilde{f}||_{infty},quad foralltilde{f}in C[0,1].
$$
functional-analysis approximation-theory nonlinear-analysis
asked Nov 18 at 15:45
Lin Xuelei
10810
For any function $fin C[0,1]$, it is well known that there exist an unique polynomial $p^{*}in P_n[0,1]$ such that $||p^{*}-f||_{infty}leq ||p-f||_{infty}$ for any $pin P_n[0,1]$. In this fashion, one can define an operator $A_n: C[0,1]mapsto P_n[0,1]$ as
$$
A_n(f):={rm argmin}_{pin P_n[0,1]}||f-p||_{infty}.
$$
For a fixed $fin C[0,1]$, how to prove that there exists a constant $C$ depending on $f$ and $n$ such that
$$
||A_n(f)-A_n(tilde{f})||_{infty}leq C||f-tilde{f}||_{infty},quad foralltilde{f}in C[0,1].
$$
functional-analysis approximation-theory nonlinear-analysis
functional-analysis approximation-theory nonlinear-analysis
asked Nov 18 at 15:45
Lin Xuelei
10810
asked Nov 18 at 15:45
Lin Xuelei
10810
asked Nov 18 at 15:45
Lin Xuelei
10810
asked Nov 18 at 15:45
Lin Xuelei
10810
asked Nov 18 at 15:45
Lin Xuelei
10810
10810
Is $A_n$ linear?
– Paul Frost
Nov 18 at 16:18
No, it is not linear, since the underlying norm is supremum norm.
– Lin Xuelei
Nov 18 at 17:20
add a comment |
Is $A_n$ linear?
– Paul Frost
Nov 18 at 16:18
No, it is not linear, since the underlying norm is supremum norm.
– Lin Xuelei
Nov 18 at 17:20
Is $A_n$ linear?
– Paul Frost
Nov 18 at 16:18
Is $A_n$ linear?
– Paul Frost
Nov 18 at 16:18
No, it is not linear, since the underlying norm is supremum norm.
– Lin Xuelei
Nov 18 at 17:20
No, it is not linear, since the underlying norm is supremum norm.
– Lin Xuelei
Nov 18 at 17:20
add a comment |
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
});
}
});
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%2f3003699%2fhow-to-prove-the-best-polynomial-approximation-operator-is-continuous%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
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%2f3003699%2fhow-to-prove-the-best-polynomial-approximation-operator-is-continuous%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
Is $A_n$ linear?
– Paul Frost
Nov 18 at 16:18
No, it is not linear, since the underlying norm is supremum norm.
– Lin Xuelei
Nov 18 at 17:20