Can we approximate continuous functions arbitrarily well with polynomials? (beyond Weierstrass )way to characterize continuity (uniform continuity?) interms of supremum (Weierstrass approxomation Theorem)Weierstrass Approximation Theorem for continuous functions on open intervalWeierstrass Approximation Theorem for $Bbb C$Prove any continuous function on a 3-dim ellipsoid can be approximated by a polynomialHaving trouble combining Weierstrass approximation theorem and the infinite sequence of holomorphic functionsProving uniform approximation by polynomials when sets are not compactDoes an explicit formula for each member of a dense sequence of polynomials exist?Let $f$ is a uniformly continuous function on $(0,1).$ Is it possible to approximate $f$ by polynomials.How well can continuous functions on $[0,1]$ be approximated by polynomials up to a given degree?Proving Peano's Existence Theorem by approximating with $C^infty$ functions using Weierstrass' Theorem.

In the UK, is it possible to get a referendum by a court decision?

Car headlights in a world without electricity

Why is it a bad idea to hire a hitman to eliminate most corrupt politicians?

How do conventional missiles fly?

What exactly is ineptocracy?

Do Iron Man suits sport waste management systems?

Blending or harmonizing

Forgetting the musical notes while performing in concert

Finding the reason behind the value of the integral.

Unlock My Phone! February 2018

Getting extremely large arrows with tikzcd

How seriously should I take size and weight limits of hand luggage?

How to travel to Japan while expressing milk?

Do creatures with a speed 0ft., fly 30ft. (hover) ever touch the ground?

What is the fastest integer factorization to break RSA?

What are the G forces leaving Earth orbit?

Obtaining database information and values in extended properties

How to compactly explain secondary and tertiary characters without resorting to stereotypes?

Why are UK visa biometrics appointments suspended at USCIS Application Support Centers?

How can saying a song's name be a copyright violation?

Rotate ASCII Art by 45 Degrees

Knowledge-based authentication using Domain-driven Design in C#

Can I hook these wires up to find the connection to a dead outlet?

Are British MPs missing the point, with these 'Indicative Votes'?



Can we approximate continuous functions arbitrarily well with polynomials? (beyond Weierstrass )


way to characterize continuity (uniform continuity?) interms of supremum (Weierstrass approxomation Theorem)Weierstrass Approximation Theorem for continuous functions on open intervalWeierstrass Approximation Theorem for $Bbb C$Prove any continuous function on a 3-dim ellipsoid can be approximated by a polynomialHaving trouble combining Weierstrass approximation theorem and the infinite sequence of holomorphic functionsProving uniform approximation by polynomials when sets are not compactDoes an explicit formula for each member of a dense sequence of polynomials exist?Let $f$ is a uniformly continuous function on $(0,1).$ Is it possible to approximate $f$ by polynomials.How well can continuous functions on $[0,1]$ be approximated by polynomials up to a given degree?Proving Peano's Existence Theorem by approximating with $C^infty$ functions using Weierstrass' Theorem.













0












$begingroup$


Let $f:(0,1) to mathbbR$ be continuous, and let $delta:(0,1) to mathbbR$ be continuous and positive.




Does there always exist a polynomial $p(x)$ satisfying $|f(x)-p(x)| < delta(x)$ for every $x in (0,1)$?




Edit: I should have written $[0,1]$ (the closed interval) as the domain instead of $(0,1)$. (to rule out problems which come from the fact $f$ is not bounded, or uniformly continuous; if $f$ is not bounded, then it cannot be approximated by polynomials).




I guess that the answer is negative, but I don't see how to build a "sufficiently bad" $delta$.



When $delta$ is constant, this is just the Weierstrass approximation theorem.



Moreover, if we allow $p(x)$ to be an arbitrary smooth function, then we can always achieve a $delta$-approximation, via a partition of unity argument.










share|cite|improve this question











$endgroup$











  • $begingroup$
    You can do Weierstrass again provided that $f$ is uniformly continuous and $delta$ is bounded below away from zero (because in this case you're really just applying Weierstrass to the extension of $f$ to $[0,1]$ and using $inf delta$ as your tolerance). If $delta$ is not bounded below away from zero (and $f$ is still uniformly continuous) then I think you can do it again, by splitting $p$ into an interpolant of $f$ at the endpoints plus a corrector, but I'd have to mess with the estimates to make sure things still work out in a neighborhood of the endpoints.
    $endgroup$
    – Ian
    Mar 28 at 14:59











  • $begingroup$
    If $f$ is not uniformly continuous then things can certainly break when $f$ is not bounded, and I suspect they can break when $f$ has an oscillatory singularity at one of the endpoints as well.
    $endgroup$
    – Ian
    Mar 28 at 14:59










  • $begingroup$
    It's easy to show that $sin(1/x)$ can't be approximated within $delta$ on $(0,1)$ by a polynomial if $delta < 1/2$.
    $endgroup$
    – Robert Israel
    Mar 28 at 15:02















0












$begingroup$


Let $f:(0,1) to mathbbR$ be continuous, and let $delta:(0,1) to mathbbR$ be continuous and positive.




Does there always exist a polynomial $p(x)$ satisfying $|f(x)-p(x)| < delta(x)$ for every $x in (0,1)$?




Edit: I should have written $[0,1]$ (the closed interval) as the domain instead of $(0,1)$. (to rule out problems which come from the fact $f$ is not bounded, or uniformly continuous; if $f$ is not bounded, then it cannot be approximated by polynomials).




I guess that the answer is negative, but I don't see how to build a "sufficiently bad" $delta$.



When $delta$ is constant, this is just the Weierstrass approximation theorem.



Moreover, if we allow $p(x)$ to be an arbitrary smooth function, then we can always achieve a $delta$-approximation, via a partition of unity argument.










share|cite|improve this question











$endgroup$











  • $begingroup$
    You can do Weierstrass again provided that $f$ is uniformly continuous and $delta$ is bounded below away from zero (because in this case you're really just applying Weierstrass to the extension of $f$ to $[0,1]$ and using $inf delta$ as your tolerance). If $delta$ is not bounded below away from zero (and $f$ is still uniformly continuous) then I think you can do it again, by splitting $p$ into an interpolant of $f$ at the endpoints plus a corrector, but I'd have to mess with the estimates to make sure things still work out in a neighborhood of the endpoints.
    $endgroup$
    – Ian
    Mar 28 at 14:59











  • $begingroup$
    If $f$ is not uniformly continuous then things can certainly break when $f$ is not bounded, and I suspect they can break when $f$ has an oscillatory singularity at one of the endpoints as well.
    $endgroup$
    – Ian
    Mar 28 at 14:59










  • $begingroup$
    It's easy to show that $sin(1/x)$ can't be approximated within $delta$ on $(0,1)$ by a polynomial if $delta < 1/2$.
    $endgroup$
    – Robert Israel
    Mar 28 at 15:02













0












0








0





$begingroup$


Let $f:(0,1) to mathbbR$ be continuous, and let $delta:(0,1) to mathbbR$ be continuous and positive.




Does there always exist a polynomial $p(x)$ satisfying $|f(x)-p(x)| < delta(x)$ for every $x in (0,1)$?




Edit: I should have written $[0,1]$ (the closed interval) as the domain instead of $(0,1)$. (to rule out problems which come from the fact $f$ is not bounded, or uniformly continuous; if $f$ is not bounded, then it cannot be approximated by polynomials).




I guess that the answer is negative, but I don't see how to build a "sufficiently bad" $delta$.



When $delta$ is constant, this is just the Weierstrass approximation theorem.



Moreover, if we allow $p(x)$ to be an arbitrary smooth function, then we can always achieve a $delta$-approximation, via a partition of unity argument.










share|cite|improve this question











$endgroup$




Let $f:(0,1) to mathbbR$ be continuous, and let $delta:(0,1) to mathbbR$ be continuous and positive.




Does there always exist a polynomial $p(x)$ satisfying $|f(x)-p(x)| < delta(x)$ for every $x in (0,1)$?




Edit: I should have written $[0,1]$ (the closed interval) as the domain instead of $(0,1)$. (to rule out problems which come from the fact $f$ is not bounded, or uniformly continuous; if $f$ is not bounded, then it cannot be approximated by polynomials).




I guess that the answer is negative, but I don't see how to build a "sufficiently bad" $delta$.



When $delta$ is constant, this is just the Weierstrass approximation theorem.



Moreover, if we allow $p(x)$ to be an arbitrary smooth function, then we can always achieve a $delta$-approximation, via a partition of unity argument.







real-analysis calculus polynomials approximation approximation-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 28 at 15:02







Asaf Shachar

















asked Mar 28 at 14:54









Asaf ShacharAsaf Shachar

5,79231145




5,79231145











  • $begingroup$
    You can do Weierstrass again provided that $f$ is uniformly continuous and $delta$ is bounded below away from zero (because in this case you're really just applying Weierstrass to the extension of $f$ to $[0,1]$ and using $inf delta$ as your tolerance). If $delta$ is not bounded below away from zero (and $f$ is still uniformly continuous) then I think you can do it again, by splitting $p$ into an interpolant of $f$ at the endpoints plus a corrector, but I'd have to mess with the estimates to make sure things still work out in a neighborhood of the endpoints.
    $endgroup$
    – Ian
    Mar 28 at 14:59











  • $begingroup$
    If $f$ is not uniformly continuous then things can certainly break when $f$ is not bounded, and I suspect they can break when $f$ has an oscillatory singularity at one of the endpoints as well.
    $endgroup$
    – Ian
    Mar 28 at 14:59










  • $begingroup$
    It's easy to show that $sin(1/x)$ can't be approximated within $delta$ on $(0,1)$ by a polynomial if $delta < 1/2$.
    $endgroup$
    – Robert Israel
    Mar 28 at 15:02
















  • $begingroup$
    You can do Weierstrass again provided that $f$ is uniformly continuous and $delta$ is bounded below away from zero (because in this case you're really just applying Weierstrass to the extension of $f$ to $[0,1]$ and using $inf delta$ as your tolerance). If $delta$ is not bounded below away from zero (and $f$ is still uniformly continuous) then I think you can do it again, by splitting $p$ into an interpolant of $f$ at the endpoints plus a corrector, but I'd have to mess with the estimates to make sure things still work out in a neighborhood of the endpoints.
    $endgroup$
    – Ian
    Mar 28 at 14:59











  • $begingroup$
    If $f$ is not uniformly continuous then things can certainly break when $f$ is not bounded, and I suspect they can break when $f$ has an oscillatory singularity at one of the endpoints as well.
    $endgroup$
    – Ian
    Mar 28 at 14:59










  • $begingroup$
    It's easy to show that $sin(1/x)$ can't be approximated within $delta$ on $(0,1)$ by a polynomial if $delta < 1/2$.
    $endgroup$
    – Robert Israel
    Mar 28 at 15:02















$begingroup$
You can do Weierstrass again provided that $f$ is uniformly continuous and $delta$ is bounded below away from zero (because in this case you're really just applying Weierstrass to the extension of $f$ to $[0,1]$ and using $inf delta$ as your tolerance). If $delta$ is not bounded below away from zero (and $f$ is still uniformly continuous) then I think you can do it again, by splitting $p$ into an interpolant of $f$ at the endpoints plus a corrector, but I'd have to mess with the estimates to make sure things still work out in a neighborhood of the endpoints.
$endgroup$
– Ian
Mar 28 at 14:59





$begingroup$
You can do Weierstrass again provided that $f$ is uniformly continuous and $delta$ is bounded below away from zero (because in this case you're really just applying Weierstrass to the extension of $f$ to $[0,1]$ and using $inf delta$ as your tolerance). If $delta$ is not bounded below away from zero (and $f$ is still uniformly continuous) then I think you can do it again, by splitting $p$ into an interpolant of $f$ at the endpoints plus a corrector, but I'd have to mess with the estimates to make sure things still work out in a neighborhood of the endpoints.
$endgroup$
– Ian
Mar 28 at 14:59













$begingroup$
If $f$ is not uniformly continuous then things can certainly break when $f$ is not bounded, and I suspect they can break when $f$ has an oscillatory singularity at one of the endpoints as well.
$endgroup$
– Ian
Mar 28 at 14:59




$begingroup$
If $f$ is not uniformly continuous then things can certainly break when $f$ is not bounded, and I suspect they can break when $f$ has an oscillatory singularity at one of the endpoints as well.
$endgroup$
– Ian
Mar 28 at 14:59












$begingroup$
It's easy to show that $sin(1/x)$ can't be approximated within $delta$ on $(0,1)$ by a polynomial if $delta < 1/2$.
$endgroup$
– Robert Israel
Mar 28 at 15:02




$begingroup$
It's easy to show that $sin(1/x)$ can't be approximated within $delta$ on $(0,1)$ by a polynomial if $delta < 1/2$.
$endgroup$
– Robert Israel
Mar 28 at 15:02










1 Answer
1






active

oldest

votes


















4












$begingroup$

On $(0,1)$, no, even if $delta$ is constant, because $f$ might not be bounded while polynomials are. Weierstrass requires a closed, bounded interval.



EDIT: With the interval as $[0,1]$, $min_x in [0,1] delta(x)$ exists and is positive, so we might as well replace $delta$ by that constant, and then we can use the Weierstrass theorem.






share|cite|improve this answer











$endgroup$












  • $begingroup$
    Thanks, you are right. I really should have written the closed interval as the domain, not the open one. (The point was not to see that Weierstrass theorem fails on non-compact domains, but to investigate how power polynomials have to approximate-better than uniformly, that is).
    $endgroup$
    – Asaf Shachar
    Mar 28 at 15:04










  • $begingroup$
    @AsafShachar Unless $delta$ on $[0,1]$ has zeros, it becomes sufficient to just do Weierstrass again, once you switch over to the compact case.
    $endgroup$
    – Ian
    Mar 28 at 15:06










  • $begingroup$
    But if "positive" means $> 0$, $delta$ can't have zeros.
    $endgroup$
    – Robert Israel
    Mar 28 at 15:07










  • $begingroup$
    @RobertIsrael Indeed; I'm just pointing out a possible generalization that is actually nontrivial. Still, I think given an interpolant $q$ at the zeros of $delta$ you can then take $p=q(1+r)$ where $r$ is a Weierstrass-type approximation of $fracf-qq$.
    $endgroup$
    – Ian
    Mar 28 at 15:08











  • $begingroup$
    @Ian Thanks, you are right. I should have thought more about a careful formulation of the question. I guess that we could try to make the question less trivial in one of two ways: (1) allow $delta$ to have finitely many zeros. (2) Keep the domain open, but assume that $f$ is bounded.
    $endgroup$
    – Asaf Shachar
    Mar 28 at 15:12












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%2f3165988%2fcan-we-approximate-continuous-functions-arbitrarily-well-with-polynomials-beyo%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









4












$begingroup$

On $(0,1)$, no, even if $delta$ is constant, because $f$ might not be bounded while polynomials are. Weierstrass requires a closed, bounded interval.



EDIT: With the interval as $[0,1]$, $min_x in [0,1] delta(x)$ exists and is positive, so we might as well replace $delta$ by that constant, and then we can use the Weierstrass theorem.






share|cite|improve this answer











$endgroup$












  • $begingroup$
    Thanks, you are right. I really should have written the closed interval as the domain, not the open one. (The point was not to see that Weierstrass theorem fails on non-compact domains, but to investigate how power polynomials have to approximate-better than uniformly, that is).
    $endgroup$
    – Asaf Shachar
    Mar 28 at 15:04










  • $begingroup$
    @AsafShachar Unless $delta$ on $[0,1]$ has zeros, it becomes sufficient to just do Weierstrass again, once you switch over to the compact case.
    $endgroup$
    – Ian
    Mar 28 at 15:06










  • $begingroup$
    But if "positive" means $> 0$, $delta$ can't have zeros.
    $endgroup$
    – Robert Israel
    Mar 28 at 15:07










  • $begingroup$
    @RobertIsrael Indeed; I'm just pointing out a possible generalization that is actually nontrivial. Still, I think given an interpolant $q$ at the zeros of $delta$ you can then take $p=q(1+r)$ where $r$ is a Weierstrass-type approximation of $fracf-qq$.
    $endgroup$
    – Ian
    Mar 28 at 15:08











  • $begingroup$
    @Ian Thanks, you are right. I should have thought more about a careful formulation of the question. I guess that we could try to make the question less trivial in one of two ways: (1) allow $delta$ to have finitely many zeros. (2) Keep the domain open, but assume that $f$ is bounded.
    $endgroup$
    – Asaf Shachar
    Mar 28 at 15:12
















4












$begingroup$

On $(0,1)$, no, even if $delta$ is constant, because $f$ might not be bounded while polynomials are. Weierstrass requires a closed, bounded interval.



EDIT: With the interval as $[0,1]$, $min_x in [0,1] delta(x)$ exists and is positive, so we might as well replace $delta$ by that constant, and then we can use the Weierstrass theorem.






share|cite|improve this answer











$endgroup$












  • $begingroup$
    Thanks, you are right. I really should have written the closed interval as the domain, not the open one. (The point was not to see that Weierstrass theorem fails on non-compact domains, but to investigate how power polynomials have to approximate-better than uniformly, that is).
    $endgroup$
    – Asaf Shachar
    Mar 28 at 15:04










  • $begingroup$
    @AsafShachar Unless $delta$ on $[0,1]$ has zeros, it becomes sufficient to just do Weierstrass again, once you switch over to the compact case.
    $endgroup$
    – Ian
    Mar 28 at 15:06










  • $begingroup$
    But if "positive" means $> 0$, $delta$ can't have zeros.
    $endgroup$
    – Robert Israel
    Mar 28 at 15:07










  • $begingroup$
    @RobertIsrael Indeed; I'm just pointing out a possible generalization that is actually nontrivial. Still, I think given an interpolant $q$ at the zeros of $delta$ you can then take $p=q(1+r)$ where $r$ is a Weierstrass-type approximation of $fracf-qq$.
    $endgroup$
    – Ian
    Mar 28 at 15:08











  • $begingroup$
    @Ian Thanks, you are right. I should have thought more about a careful formulation of the question. I guess that we could try to make the question less trivial in one of two ways: (1) allow $delta$ to have finitely many zeros. (2) Keep the domain open, but assume that $f$ is bounded.
    $endgroup$
    – Asaf Shachar
    Mar 28 at 15:12














4












4








4





$begingroup$

On $(0,1)$, no, even if $delta$ is constant, because $f$ might not be bounded while polynomials are. Weierstrass requires a closed, bounded interval.



EDIT: With the interval as $[0,1]$, $min_x in [0,1] delta(x)$ exists and is positive, so we might as well replace $delta$ by that constant, and then we can use the Weierstrass theorem.






share|cite|improve this answer











$endgroup$



On $(0,1)$, no, even if $delta$ is constant, because $f$ might not be bounded while polynomials are. Weierstrass requires a closed, bounded interval.



EDIT: With the interval as $[0,1]$, $min_x in [0,1] delta(x)$ exists and is positive, so we might as well replace $delta$ by that constant, and then we can use the Weierstrass theorem.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Mar 28 at 15:05

























answered Mar 28 at 14:59









Robert IsraelRobert Israel

330k23219473




330k23219473











  • $begingroup$
    Thanks, you are right. I really should have written the closed interval as the domain, not the open one. (The point was not to see that Weierstrass theorem fails on non-compact domains, but to investigate how power polynomials have to approximate-better than uniformly, that is).
    $endgroup$
    – Asaf Shachar
    Mar 28 at 15:04










  • $begingroup$
    @AsafShachar Unless $delta$ on $[0,1]$ has zeros, it becomes sufficient to just do Weierstrass again, once you switch over to the compact case.
    $endgroup$
    – Ian
    Mar 28 at 15:06










  • $begingroup$
    But if "positive" means $> 0$, $delta$ can't have zeros.
    $endgroup$
    – Robert Israel
    Mar 28 at 15:07










  • $begingroup$
    @RobertIsrael Indeed; I'm just pointing out a possible generalization that is actually nontrivial. Still, I think given an interpolant $q$ at the zeros of $delta$ you can then take $p=q(1+r)$ where $r$ is a Weierstrass-type approximation of $fracf-qq$.
    $endgroup$
    – Ian
    Mar 28 at 15:08











  • $begingroup$
    @Ian Thanks, you are right. I should have thought more about a careful formulation of the question. I guess that we could try to make the question less trivial in one of two ways: (1) allow $delta$ to have finitely many zeros. (2) Keep the domain open, but assume that $f$ is bounded.
    $endgroup$
    – Asaf Shachar
    Mar 28 at 15:12

















  • $begingroup$
    Thanks, you are right. I really should have written the closed interval as the domain, not the open one. (The point was not to see that Weierstrass theorem fails on non-compact domains, but to investigate how power polynomials have to approximate-better than uniformly, that is).
    $endgroup$
    – Asaf Shachar
    Mar 28 at 15:04










  • $begingroup$
    @AsafShachar Unless $delta$ on $[0,1]$ has zeros, it becomes sufficient to just do Weierstrass again, once you switch over to the compact case.
    $endgroup$
    – Ian
    Mar 28 at 15:06










  • $begingroup$
    But if "positive" means $> 0$, $delta$ can't have zeros.
    $endgroup$
    – Robert Israel
    Mar 28 at 15:07










  • $begingroup$
    @RobertIsrael Indeed; I'm just pointing out a possible generalization that is actually nontrivial. Still, I think given an interpolant $q$ at the zeros of $delta$ you can then take $p=q(1+r)$ where $r$ is a Weierstrass-type approximation of $fracf-qq$.
    $endgroup$
    – Ian
    Mar 28 at 15:08











  • $begingroup$
    @Ian Thanks, you are right. I should have thought more about a careful formulation of the question. I guess that we could try to make the question less trivial in one of two ways: (1) allow $delta$ to have finitely many zeros. (2) Keep the domain open, but assume that $f$ is bounded.
    $endgroup$
    – Asaf Shachar
    Mar 28 at 15:12
















$begingroup$
Thanks, you are right. I really should have written the closed interval as the domain, not the open one. (The point was not to see that Weierstrass theorem fails on non-compact domains, but to investigate how power polynomials have to approximate-better than uniformly, that is).
$endgroup$
– Asaf Shachar
Mar 28 at 15:04




$begingroup$
Thanks, you are right. I really should have written the closed interval as the domain, not the open one. (The point was not to see that Weierstrass theorem fails on non-compact domains, but to investigate how power polynomials have to approximate-better than uniformly, that is).
$endgroup$
– Asaf Shachar
Mar 28 at 15:04












$begingroup$
@AsafShachar Unless $delta$ on $[0,1]$ has zeros, it becomes sufficient to just do Weierstrass again, once you switch over to the compact case.
$endgroup$
– Ian
Mar 28 at 15:06




$begingroup$
@AsafShachar Unless $delta$ on $[0,1]$ has zeros, it becomes sufficient to just do Weierstrass again, once you switch over to the compact case.
$endgroup$
– Ian
Mar 28 at 15:06












$begingroup$
But if "positive" means $> 0$, $delta$ can't have zeros.
$endgroup$
– Robert Israel
Mar 28 at 15:07




$begingroup$
But if "positive" means $> 0$, $delta$ can't have zeros.
$endgroup$
– Robert Israel
Mar 28 at 15:07












$begingroup$
@RobertIsrael Indeed; I'm just pointing out a possible generalization that is actually nontrivial. Still, I think given an interpolant $q$ at the zeros of $delta$ you can then take $p=q(1+r)$ where $r$ is a Weierstrass-type approximation of $fracf-qq$.
$endgroup$
– Ian
Mar 28 at 15:08





$begingroup$
@RobertIsrael Indeed; I'm just pointing out a possible generalization that is actually nontrivial. Still, I think given an interpolant $q$ at the zeros of $delta$ you can then take $p=q(1+r)$ where $r$ is a Weierstrass-type approximation of $fracf-qq$.
$endgroup$
– Ian
Mar 28 at 15:08













$begingroup$
@Ian Thanks, you are right. I should have thought more about a careful formulation of the question. I guess that we could try to make the question less trivial in one of two ways: (1) allow $delta$ to have finitely many zeros. (2) Keep the domain open, but assume that $f$ is bounded.
$endgroup$
– Asaf Shachar
Mar 28 at 15:12





$begingroup$
@Ian Thanks, you are right. I should have thought more about a careful formulation of the question. I guess that we could try to make the question less trivial in one of two ways: (1) allow $delta$ to have finitely many zeros. (2) Keep the domain open, but assume that $f$ is bounded.
$endgroup$
– Asaf Shachar
Mar 28 at 15:12


















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%2f3165988%2fcan-we-approximate-continuous-functions-arbitrarily-well-with-polynomials-beyo%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

Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

Հադիս Բովանդակություն Անվանում և նշանակություն | Դասակարգում | Աղբյուրներ | Նավարկման ցանկ