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

18.5k21651




18.5k21651










asked Dec 20 '18 at 12:06









Uri George PeterzilUri George Peterzil

10610




10610












  • $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,93521652




8,93521652








  • 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

Bundesstraße 106

Image
Dieser Artikel beschreibt die Bundesstraße 106 in Deutschland. Zur gleichnamigen Straße in Österreich siehe Mölltal Straße. Vorlage:Infobox hochrangige Straße/Wartung/DE-B Bundesstraße 106 in Deutschland Karte Basisdaten Betreiber: Deutschland  Bundesrepublik Deutschland Straßenbeginn: Wismar ( 53° 54′  N , 11° 24′  O 53.900536 11.396875 ) Straßenende: Schwerin ( 53° 36′  N , 11° 24′  O 53.592785 11.404892 ) Gesamtlänge: 40,7 km Bundesland: Mecklenburg-Vorpommern Ausbauzustand: zweistreifig [1] Bundesstraße 106 in Schwerin (Umgehungsstraße) Straßenverlauf Land Mecklenburg-Vorpommern Landkreis Nordwestmecklenburg Ortsumgehung Wismar Wallensteingraben über   Dorf Mecklenburg Wallensteingraben Groß Stieten Bad Kleinen OT Niendorf Bahnstrecke Lübeck–Bad Kleinen Zickhusen Lübstorf Klein Trebbow OT Kirch Stück ...
Read more

Verónica Boquete

Image
Verónica Boquete im Trikot der Nationalmannschaft (2013) Personalia Name Verónica Boquete Giadans Geburtstag 9. April 1987 Geburtsort Santiago de Compostela, Spanien Größe 159 cm Position Mittelfeld / Sturm Juniorinnen Jahre Station 2001–2005 Xuventú Aguiño Frauen Jahre Station Spiele (Tore) 1 2005–2008 Prainsa Zaragoza 83 (40) 2008–2010 Espanyol Barcelona 53 (30) 2010 Buffalo Flash 9 0 (9) 2010 Chicago Red Stars 3 0 (1) 2010–2011 Espanyol Barcelona 26 (41) 2011 Philadelphia Independence 13 0 (5) 2011 Energija Woronesch 5 0 (1) 2012–2014 Tyresö FF 39 (14) 2014 Portland Thorns FC 15 0 (4) 2014–2015 1. FFC Frankfurt 23 0 (7) 2015–2016 FC Bayern München 9 0 (0) 2016–2018 Paris Saint-Germain 31 0 (8) 2018 Peking BG Phoenix 2019– Utah Royals FC 0 0 (0) Nationalmannschaft Jahre Auswahl ...
Read more

Ida-Boy-Ed-Garten

Image
Die Lage des Ida-Boy-Ed-Gartens, rot markiert Der Ida-Boy-Ed-Garten Der Ida-Boy-Ed-Garten, Blick von der Wakenitzmauer durch das Tor in der Stadtmauer Der Ida-Boy-Ed-Garten ist eine Straße der Lübecker Altstadt. Inhaltsverzeichnis 1 Lage 2 Geschichte 3 Literatur 4 Weblinks Lage | Der etwa 90 Meter lange Ida-Boy-Ed-Garten befindet sich an der nördlichen Spitze der Altstadtinsel, vor dem Burgtor. Die in einem Bogen durch eine Grünanlage hangaufwärts führende Straße verbindet die Wakenitzmauer mit der Burgtorbrücke. Geschichte | Der heutige Ida-Boy-Ed-Garten wurde ursprünglich als Verlängerung der Wakenitzmauer angelegt. 1903 wurde in den erhaltenen Teil der mittelalterlichen Stadtmauer, an dem die Wakenitzmauer bei der Einmündung der Kaiserstraße begann, ein Tor mit einem großen Bogen für die Durchführung der Straße und zwei kleineren seitlichen Öffnungen für Fußgänger gebrochen, um für die neu errichteten Wohnhäuser in diesem Bereich ...
Read more