Proving the set of polynomials is dense in $C^{1}[0,1]$












1












$begingroup$


Let $C^{1}[0,1]$ denote the set of once-continuously differentiable functions $f:[0,1]rightarrowmathbb R$. For every $fin C^1[0,1]$, find a polynomial $p$ such that $sup_{xin[0,1] }|f(x)-p(x)|<epsilon$ and $sup_{xin[0,1] }|f'(x)-p'(x)|<epsilon$.



So, I can find different polynomials for both, by the Stone-Weirstrass theorem. What I am missing is how to connect them: how can I make sure that the polynomial $p$ I find, or a polynomial $p'$ that I find for the second condition, satisfy the other condition? It really feels like there should be a simple trick to create a third function from some other information.






real-analysis harmonic-analysis







share|cite|improve this question











$endgroup$












  • $begingroup$
    This is essentialy the proof of Stone-Weierstrass theorem using Bernstein Polynoms. Since you are woring on $C^1$ instead of $C^0$, there may be a simpler way.
    $endgroup$
    – nicomezi
    Dec 20 '18 at 12:10












  • $begingroup$
    The thing is, we didn't constructively prove the theorem, meaning we haven't even defined Bernstein polynomials.
    $endgroup$
    – Uri George Peterzil
    Dec 20 '18 at 12:15










  • $begingroup$
    Not sure I understand your remark. Bernstein Polynoms are used to prove the theorem constructively so you do not need the theorem to define them.
    $endgroup$
    – nicomezi
    Dec 20 '18 at 12:16
















1












$begingroup$


Let $C^{1}[0,1]$ denote the set of once-continuously differentiable functions $f:[0,1]rightarrowmathbb R$. For every $fin C^1[0,1]$, find a polynomial $p$ such that $sup_{xin[0,1] }|f(x)-p(x)|<epsilon$ and $sup_{xin[0,1] }|f'(x)-p'(x)|<epsilon$.



So, I can find different polynomials for both, by the Stone-Weirstrass theorem. What I am missing is how to connect them: how can I make sure that the polynomial $p$ I find, or a polynomial $p'$ that I find for the second condition, satisfy the other condition? It really feels like there should be a simple trick to create a third function from some other information.






real-analysis harmonic-analysis







share|cite|improve this question











$endgroup$












  • $begingroup$
    This is essentialy the proof of Stone-Weierstrass theorem using Bernstein Polynoms. Since you are woring on $C^1$ instead of $C^0$, there may be a simpler way.
    $endgroup$
    – nicomezi
    Dec 20 '18 at 12:10












  • $begingroup$
    The thing is, we didn't constructively prove the theorem, meaning we haven't even defined Bernstein polynomials.
    $endgroup$
    – Uri George Peterzil
    Dec 20 '18 at 12:15










  • $begingroup$
    Not sure I understand your remark. Bernstein Polynoms are used to prove the theorem constructively so you do not need the theorem to define them.
    $endgroup$
    – nicomezi
    Dec 20 '18 at 12:16














1












1








1





$begingroup$


Let $C^{1}[0,1]$ denote the set of once-continuously differentiable functions $f:[0,1]rightarrowmathbb R$. For every $fin C^1[0,1]$, find a polynomial $p$ such that $sup_{xin[0,1] }|f(x)-p(x)|<epsilon$ and $sup_{xin[0,1] }|f'(x)-p'(x)|<epsilon$.



So, I can find different polynomials for both, by the Stone-Weirstrass theorem. What I am missing is how to connect them: how can I make sure that the polynomial $p$ I find, or a polynomial $p'$ that I find for the second condition, satisfy the other condition? It really feels like there should be a simple trick to create a third function from some other information.






real-analysis harmonic-analysis







share|cite|improve this question











$endgroup$




Let $C^{1}[0,1]$ denote the set of once-continuously differentiable functions $f:[0,1]rightarrowmathbb R$. For every $fin C^1[0,1]$, find a polynomial $p$ such that $sup_{xin[0,1] }|f(x)-p(x)|<epsilon$ and $sup_{xin[0,1] }|f'(x)-p'(x)|<epsilon$.



So, I can find different polynomials for both, by the Stone-Weirstrass theorem. What I am missing is how to connect them: how can I make sure that the polynomial $p$ I find, or a polynomial $p'$ that I find for the second condition, satisfy the other condition? It really feels like there should be a simple trick to create a third function from some other information.






real-analysis harmonic-analysis




real-analysis harmonic-analysis






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 20 '18 at 12:43









Song

13.8k633




13.8k633










asked Dec 20 '18 at 12:06









Uri George PeterzilUri George Peterzil

949




949












  • $begingroup$
    This is essentialy the proof of Stone-Weierstrass theorem using Bernstein Polynoms. Since you are woring on $C^1$ instead of $C^0$, there may be a simpler way.
    $endgroup$
    – nicomezi
    Dec 20 '18 at 12:10












  • $begingroup$
    The thing is, we didn't constructively prove the theorem, meaning we haven't even defined Bernstein polynomials.
    $endgroup$
    – Uri George Peterzil
    Dec 20 '18 at 12:15










  • $begingroup$
    Not sure I understand your remark. Bernstein Polynoms are used to prove the theorem constructively so you do not need the theorem to define them.
    $endgroup$
    – nicomezi
    Dec 20 '18 at 12:16


















  • $begingroup$
    This is essentialy the proof of Stone-Weierstrass theorem using Bernstein Polynoms. Since you are woring on $C^1$ instead of $C^0$, there may be a simpler way.
    $endgroup$
    – nicomezi
    Dec 20 '18 at 12:10












  • $begingroup$
    The thing is, we didn't constructively prove the theorem, meaning we haven't even defined Bernstein polynomials.
    $endgroup$
    – Uri George Peterzil
    Dec 20 '18 at 12:15










  • $begingroup$
    Not sure I understand your remark. Bernstein Polynoms are used to prove the theorem constructively so you do not need the theorem to define them.
    $endgroup$
    – nicomezi
    Dec 20 '18 at 12:16
















$begingroup$
This is essentialy the proof of Stone-Weierstrass theorem using Bernstein Polynoms. Since you are woring on $C^1$ instead of $C^0$, there may be a simpler way.
$endgroup$
– nicomezi
Dec 20 '18 at 12:10






$begingroup$
This is essentialy the proof of Stone-Weierstrass theorem using Bernstein Polynoms. Since you are woring on $C^1$ instead of $C^0$, there may be a simpler way.
$endgroup$
– nicomezi
Dec 20 '18 at 12:10














$begingroup$
The thing is, we didn't constructively prove the theorem, meaning we haven't even defined Bernstein polynomials.
$endgroup$
– Uri George Peterzil
Dec 20 '18 at 12:15




$begingroup$
The thing is, we didn't constructively prove the theorem, meaning we haven't even defined Bernstein polynomials.
$endgroup$
– Uri George Peterzil
Dec 20 '18 at 12:15












$begingroup$
Not sure I understand your remark. Bernstein Polynoms are used to prove the theorem constructively so you do not need the theorem to define them.
$endgroup$
– nicomezi
Dec 20 '18 at 12:16




$begingroup$
Not sure I understand your remark. Bernstein Polynoms are used to prove the theorem constructively so you do not need the theorem to define them.
$endgroup$
– nicomezi
Dec 20 '18 at 12:16










1 Answer
1






active

oldest

votes


















5












$begingroup$

Since we know that $fin C^1[0,1]$, if follows that $f'in C[0,1]$ and we can find a polynomial $tilde p$ such that $sup_{xin [0,1]} |f'(x)-tilde p(x)| le varepsilon$.



Let $p$ be the antiderivative of $tilde p$ such that $p(0)=f(0)$, i.e.
$$
p(x):=f(0) + int_0^xtilde p(t), dt.
$$
It is obvious that $p$ is a polynomial and that $sup_{xin [0,1]} |f'(x)-p'(x)| le varepsilon$.



Now, we have
$$begin{align}
f(x)-p(x) &= left(f(0) + int_0^x f'(t), dt right)-left(f(0) + int_0^x p'(t), dt right) \
&=int_0^x f'(t)-p'(t), dt,
end{align}$$
hence we can take absolute value and get
$$begin{align}
|f(x)-p(x)| &leint_0^x |f'(t)-p'(t)|, dt \
&le varepsilon int_0^x 1 ,dt \
&le varepsilon
end{align}$$
for all $xin [0,1]$. This proves what you want.






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    It seems I misunderstood the problem. Good answer.
    $endgroup$
    – nicomezi
    Dec 20 '18 at 12:21











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%2f3047465%2fproving-the-set-of-polynomials-is-dense-in-c10-1%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









5












$begingroup$

Since we know that $fin C^1[0,1]$, if follows that $f'in C[0,1]$ and we can find a polynomial $tilde p$ such that $sup_{xin [0,1]} |f'(x)-tilde p(x)| le varepsilon$.



Let $p$ be the antiderivative of $tilde p$ such that $p(0)=f(0)$, i.e.
$$
p(x):=f(0) + int_0^xtilde p(t), dt.
$$
It is obvious that $p$ is a polynomial and that $sup_{xin [0,1]} |f'(x)-p'(x)| le varepsilon$.



Now, we have
$$begin{align}
f(x)-p(x) &= left(f(0) + int_0^x f'(t), dt right)-left(f(0) + int_0^x p'(t), dt right) \
&=int_0^x f'(t)-p'(t), dt,
end{align}$$
hence we can take absolute value and get
$$begin{align}
|f(x)-p(x)| &leint_0^x |f'(t)-p'(t)|, dt \
&le varepsilon int_0^x 1 ,dt \
&le varepsilon
end{align}$$
for all $xin [0,1]$. This proves what you want.






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    It seems I misunderstood the problem. Good answer.
    $endgroup$
    – nicomezi
    Dec 20 '18 at 12:21
















5












$begingroup$

Since we know that $fin C^1[0,1]$, if follows that $f'in C[0,1]$ and we can find a polynomial $tilde p$ such that $sup_{xin [0,1]} |f'(x)-tilde p(x)| le varepsilon$.



Let $p$ be the antiderivative of $tilde p$ such that $p(0)=f(0)$, i.e.
$$
p(x):=f(0) + int_0^xtilde p(t), dt.
$$
It is obvious that $p$ is a polynomial and that $sup_{xin [0,1]} |f'(x)-p'(x)| le varepsilon$.



Now, we have
$$begin{align}
f(x)-p(x) &= left(f(0) + int_0^x f'(t), dt right)-left(f(0) + int_0^x p'(t), dt right) \
&=int_0^x f'(t)-p'(t), dt,
end{align}$$
hence we can take absolute value and get
$$begin{align}
|f(x)-p(x)| &leint_0^x |f'(t)-p'(t)|, dt \
&le varepsilon int_0^x 1 ,dt \
&le varepsilon
end{align}$$
for all $xin [0,1]$. This proves what you want.






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    It seems I misunderstood the problem. Good answer.
    $endgroup$
    – nicomezi
    Dec 20 '18 at 12:21














5












5








5





$begingroup$

Since we know that $fin C^1[0,1]$, if follows that $f'in C[0,1]$ and we can find a polynomial $tilde p$ such that $sup_{xin [0,1]} |f'(x)-tilde p(x)| le varepsilon$.



Let $p$ be the antiderivative of $tilde p$ such that $p(0)=f(0)$, i.e.
$$
p(x):=f(0) + int_0^xtilde p(t), dt.
$$
It is obvious that $p$ is a polynomial and that $sup_{xin [0,1]} |f'(x)-p'(x)| le varepsilon$.



Now, we have
$$begin{align}
f(x)-p(x) &= left(f(0) + int_0^x f'(t), dt right)-left(f(0) + int_0^x p'(t), dt right) \
&=int_0^x f'(t)-p'(t), dt,
end{align}$$
hence we can take absolute value and get
$$begin{align}
|f(x)-p(x)| &leint_0^x |f'(t)-p'(t)|, dt \
&le varepsilon int_0^x 1 ,dt \
&le varepsilon
end{align}$$
for all $xin [0,1]$. This proves what you want.






share|cite|improve this answer











$endgroup$



Since we know that $fin C^1[0,1]$, if follows that $f'in C[0,1]$ and we can find a polynomial $tilde p$ such that $sup_{xin [0,1]} |f'(x)-tilde p(x)| le varepsilon$.



Let $p$ be the antiderivative of $tilde p$ such that $p(0)=f(0)$, i.e.
$$
p(x):=f(0) + int_0^xtilde p(t), dt.
$$
It is obvious that $p$ is a polynomial and that $sup_{xin [0,1]} |f'(x)-p'(x)| le varepsilon$.



Now, we have
$$begin{align}
f(x)-p(x) &= left(f(0) + int_0^x f'(t), dt right)-left(f(0) + int_0^x p'(t), dt right) \
&=int_0^x f'(t)-p'(t), dt,
end{align}$$
hence we can take absolute value and get
$$begin{align}
|f(x)-p(x)| &leint_0^x |f'(t)-p'(t)|, dt \
&le varepsilon int_0^x 1 ,dt \
&le varepsilon
end{align}$$
for all $xin [0,1]$. This proves what you want.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Dec 20 '18 at 12:44

























answered Dec 20 '18 at 12:20









BigbearZzzBigbearZzz

8,74621652




8,74621652








  • 1




    $begingroup$
    It seems I misunderstood the problem. Good answer.
    $endgroup$
    – nicomezi
    Dec 20 '18 at 12:21














  • 1




    $begingroup$
    It seems I misunderstood the problem. Good answer.
    $endgroup$
    – nicomezi
    Dec 20 '18 at 12:21








1




1




$begingroup$
It seems I misunderstood the problem. Good answer.
$endgroup$
– nicomezi
Dec 20 '18 at 12:21




$begingroup$
It seems I misunderstood the problem. Good answer.
$endgroup$
– nicomezi
Dec 20 '18 at 12:21


















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%2f3047465%2fproving-the-set-of-polynomials-is-dense-in-c10-1%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

Image
up vote 0 down vote favorite I have $99$ identical square tiles, each with a quarter-circle drawn on it like this: [asy] size(1.5cm); draw(Arc((2,0),1,90,180),red+1); draw((0,0)--(2,0)--(2,2)--(0,2)--(0,0)); [/asy] When I arrange the tiles in a $9times 11$ rectangular grid, each with a random orientation, what is the expected value of the number of full circles I form? I think this problem has to do with finding the chance any given 2x2 square has a circle, but I can't find it. expected-value share | cite | improve this question asked Nov 20 at 15:03 6minecraftninja 1 2
Read more

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

Image
0 I think it's similiar to NFAs. I replace the finite states of the given automaton for start-states for my new automaton. I do it with $epsilon$ -transition from the start state to the actual finite states of the given automaton. The start state of the given automaton will be my accepting(finite) state of my new one. All transitions will be reversed of course to recognize the reversed word. But how do I have to change the stack of the pushdown automaton? That's tricky. formal-languages automata context-free-grammar share | cite | improve this question edited Nov 29 '18 at 14:20 joee
Read more

Mont Emei

Image
Mont Emei.mw-parser-output .entete.map{background-image:url("//upload.wikimedia.org/wikipedia/commons/7/7a/Picto_infobox_map.png")} Vue du sommet Wanfo du mont Emei Géographie Altitude 3 099  m , Wanfo Coordonnées 29° 31′ 11″ nord, 103° 19′ 57″ est Administration Pays   Chine Province Sichuan Ville-préfecture Leshan Géolocalisation sur la carte : Sichuan Mont Emei Géolocalisation sur la carte : Chine Mont Emei modifier   Paysage panoramique du mont Emei, incluant le paysage panoramique du grand Bouddha de Leshan *   Patrimoine mondial de l'UNESCO Passerelle en bois sur le versant ouest Pays   Chine Subdivision Sichuan Type Mixte Critères (iv) (vi) (x) Superficie 15 400 ha Numéro d’identification 779 Zone géographique Asie et Pacifique  ** Année d’inscription 1996 (20 e session) * Descriptif officiel UNESCO ** Classification géog
Read more