Pointwise convergence of a sequence of polynomials












4












$begingroup$


Consider the identity function $f(x) = x$ and let ${h_n;n in mathbb{N}}$ be a sequence of polynomials, which are defined on $[0,a]$ with some fixed $a<1$, and are of the form $h_n(x) = sum_{i=1}^n c_{i,n} x^i$ where $c_{i,n}$ is the $i$th coefficient in the $n$th polynomial $h_n$. Further assume that:



(1) $0 leq h_n(x) leq x$ and $h_n(0) = 0$ for every $n$;



(2) each $h_n$ is monotonically increasing;



(3) $lim_{n to infty} h_n(x) = x$ uniformly for all $x in [0,a]$.



From (1) we know that $c_{1,n} = h_n'(0) leq x'|_{x=0} = 1$ for every $n$. My question is: from conditions (1), (2) and (3), is it necessarily true that $lim_{n to infty} c_{1,n} = 1$? If I impose the extra condition $sup_{n in mathbb{N}} {sum_{i=2}^n |c_{i,n}|} < M$ for some absolute constant $M > 0$, then the claim holds. But this is a too stringent condition. But I am not sure if the claim is unconditionally true. If not, what could be a minimal set of conditions that I need to impose? Thanks very much.










share|cite|improve this question











$endgroup$












  • $begingroup$
    You forgot to mention what's the purpose of this, since $x$ is a polynomial. So why don't you just set $h_n(x)=x$?
    $endgroup$
    – Professor Vector
    Jul 28 '17 at 9:36










  • $begingroup$
    @Professor Vector The purpose is that given a sequence of functions ${f_n}$ on some $[a,b]$ that converge uniformly to a function $f$, in general we cannot say anything about how the sequence of derivatives ${f_n '}$ behave. So I am considering an example where we can get some result on the sequence of derivatives.
    $endgroup$
    – Richie
    Jul 28 '17 at 10:15










  • $begingroup$
    Well, you've just added more confusion, because in your question, there was no "uniform convergence". Of course, there are examples where the derivatives converge (I gave a trivial one), but you evaded the question of the purpose. It's pointless, imho.
    $endgroup$
    – Professor Vector
    Jul 28 '17 at 10:21










  • $begingroup$
    Ok, fine. The title is misleading. It is not a question on approximation, but a question on convergence. As you said, there are examples where the derivatives converge, and I am constructing this particular one, because the polynomials are "well-behaved", so that I think it should be true that the derivatives converge. But maybe we need certain condition on how the coefficients behave, for example, an upper bound on $c_{i,n}$ in terms of $n$. But I am not sure about this.
    $endgroup$
    – Richie
    Jul 28 '17 at 10:35










  • $begingroup$
    Is there even a non-trivial sequence $h_n$ with the desired properties? It seems to me that (1) will never be satisfied by any polynomial other than $x$. Am I missing something?
    $endgroup$
    – Jose27
    Jul 28 '17 at 13:14
















4












$begingroup$


Consider the identity function $f(x) = x$ and let ${h_n;n in mathbb{N}}$ be a sequence of polynomials, which are defined on $[0,a]$ with some fixed $a<1$, and are of the form $h_n(x) = sum_{i=1}^n c_{i,n} x^i$ where $c_{i,n}$ is the $i$th coefficient in the $n$th polynomial $h_n$. Further assume that:



(1) $0 leq h_n(x) leq x$ and $h_n(0) = 0$ for every $n$;



(2) each $h_n$ is monotonically increasing;



(3) $lim_{n to infty} h_n(x) = x$ uniformly for all $x in [0,a]$.



From (1) we know that $c_{1,n} = h_n'(0) leq x'|_{x=0} = 1$ for every $n$. My question is: from conditions (1), (2) and (3), is it necessarily true that $lim_{n to infty} c_{1,n} = 1$? If I impose the extra condition $sup_{n in mathbb{N}} {sum_{i=2}^n |c_{i,n}|} < M$ for some absolute constant $M > 0$, then the claim holds. But this is a too stringent condition. But I am not sure if the claim is unconditionally true. If not, what could be a minimal set of conditions that I need to impose? Thanks very much.










share|cite|improve this question











$endgroup$












  • $begingroup$
    You forgot to mention what's the purpose of this, since $x$ is a polynomial. So why don't you just set $h_n(x)=x$?
    $endgroup$
    – Professor Vector
    Jul 28 '17 at 9:36










  • $begingroup$
    @Professor Vector The purpose is that given a sequence of functions ${f_n}$ on some $[a,b]$ that converge uniformly to a function $f$, in general we cannot say anything about how the sequence of derivatives ${f_n '}$ behave. So I am considering an example where we can get some result on the sequence of derivatives.
    $endgroup$
    – Richie
    Jul 28 '17 at 10:15










  • $begingroup$
    Well, you've just added more confusion, because in your question, there was no "uniform convergence". Of course, there are examples where the derivatives converge (I gave a trivial one), but you evaded the question of the purpose. It's pointless, imho.
    $endgroup$
    – Professor Vector
    Jul 28 '17 at 10:21










  • $begingroup$
    Ok, fine. The title is misleading. It is not a question on approximation, but a question on convergence. As you said, there are examples where the derivatives converge, and I am constructing this particular one, because the polynomials are "well-behaved", so that I think it should be true that the derivatives converge. But maybe we need certain condition on how the coefficients behave, for example, an upper bound on $c_{i,n}$ in terms of $n$. But I am not sure about this.
    $endgroup$
    – Richie
    Jul 28 '17 at 10:35










  • $begingroup$
    Is there even a non-trivial sequence $h_n$ with the desired properties? It seems to me that (1) will never be satisfied by any polynomial other than $x$. Am I missing something?
    $endgroup$
    – Jose27
    Jul 28 '17 at 13:14














4












4








4





$begingroup$


Consider the identity function $f(x) = x$ and let ${h_n;n in mathbb{N}}$ be a sequence of polynomials, which are defined on $[0,a]$ with some fixed $a<1$, and are of the form $h_n(x) = sum_{i=1}^n c_{i,n} x^i$ where $c_{i,n}$ is the $i$th coefficient in the $n$th polynomial $h_n$. Further assume that:



(1) $0 leq h_n(x) leq x$ and $h_n(0) = 0$ for every $n$;



(2) each $h_n$ is monotonically increasing;



(3) $lim_{n to infty} h_n(x) = x$ uniformly for all $x in [0,a]$.



From (1) we know that $c_{1,n} = h_n'(0) leq x'|_{x=0} = 1$ for every $n$. My question is: from conditions (1), (2) and (3), is it necessarily true that $lim_{n to infty} c_{1,n} = 1$? If I impose the extra condition $sup_{n in mathbb{N}} {sum_{i=2}^n |c_{i,n}|} < M$ for some absolute constant $M > 0$, then the claim holds. But this is a too stringent condition. But I am not sure if the claim is unconditionally true. If not, what could be a minimal set of conditions that I need to impose? Thanks very much.










share|cite|improve this question











$endgroup$




Consider the identity function $f(x) = x$ and let ${h_n;n in mathbb{N}}$ be a sequence of polynomials, which are defined on $[0,a]$ with some fixed $a<1$, and are of the form $h_n(x) = sum_{i=1}^n c_{i,n} x^i$ where $c_{i,n}$ is the $i$th coefficient in the $n$th polynomial $h_n$. Further assume that:



(1) $0 leq h_n(x) leq x$ and $h_n(0) = 0$ for every $n$;



(2) each $h_n$ is monotonically increasing;



(3) $lim_{n to infty} h_n(x) = x$ uniformly for all $x in [0,a]$.



From (1) we know that $c_{1,n} = h_n'(0) leq x'|_{x=0} = 1$ for every $n$. My question is: from conditions (1), (2) and (3), is it necessarily true that $lim_{n to infty} c_{1,n} = 1$? If I impose the extra condition $sup_{n in mathbb{N}} {sum_{i=2}^n |c_{i,n}|} < M$ for some absolute constant $M > 0$, then the claim holds. But this is a too stringent condition. But I am not sure if the claim is unconditionally true. If not, what could be a minimal set of conditions that I need to impose? Thanks very much.







calculus real-analysis measure-theory polynomials convergence






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jul 29 '17 at 7:04







Richie

















asked Jul 28 '17 at 8:50









RichieRichie

394210




394210












  • $begingroup$
    You forgot to mention what's the purpose of this, since $x$ is a polynomial. So why don't you just set $h_n(x)=x$?
    $endgroup$
    – Professor Vector
    Jul 28 '17 at 9:36










  • $begingroup$
    @Professor Vector The purpose is that given a sequence of functions ${f_n}$ on some $[a,b]$ that converge uniformly to a function $f$, in general we cannot say anything about how the sequence of derivatives ${f_n '}$ behave. So I am considering an example where we can get some result on the sequence of derivatives.
    $endgroup$
    – Richie
    Jul 28 '17 at 10:15










  • $begingroup$
    Well, you've just added more confusion, because in your question, there was no "uniform convergence". Of course, there are examples where the derivatives converge (I gave a trivial one), but you evaded the question of the purpose. It's pointless, imho.
    $endgroup$
    – Professor Vector
    Jul 28 '17 at 10:21










  • $begingroup$
    Ok, fine. The title is misleading. It is not a question on approximation, but a question on convergence. As you said, there are examples where the derivatives converge, and I am constructing this particular one, because the polynomials are "well-behaved", so that I think it should be true that the derivatives converge. But maybe we need certain condition on how the coefficients behave, for example, an upper bound on $c_{i,n}$ in terms of $n$. But I am not sure about this.
    $endgroup$
    – Richie
    Jul 28 '17 at 10:35










  • $begingroup$
    Is there even a non-trivial sequence $h_n$ with the desired properties? It seems to me that (1) will never be satisfied by any polynomial other than $x$. Am I missing something?
    $endgroup$
    – Jose27
    Jul 28 '17 at 13:14


















  • $begingroup$
    You forgot to mention what's the purpose of this, since $x$ is a polynomial. So why don't you just set $h_n(x)=x$?
    $endgroup$
    – Professor Vector
    Jul 28 '17 at 9:36










  • $begingroup$
    @Professor Vector The purpose is that given a sequence of functions ${f_n}$ on some $[a,b]$ that converge uniformly to a function $f$, in general we cannot say anything about how the sequence of derivatives ${f_n '}$ behave. So I am considering an example where we can get some result on the sequence of derivatives.
    $endgroup$
    – Richie
    Jul 28 '17 at 10:15










  • $begingroup$
    Well, you've just added more confusion, because in your question, there was no "uniform convergence". Of course, there are examples where the derivatives converge (I gave a trivial one), but you evaded the question of the purpose. It's pointless, imho.
    $endgroup$
    – Professor Vector
    Jul 28 '17 at 10:21










  • $begingroup$
    Ok, fine. The title is misleading. It is not a question on approximation, but a question on convergence. As you said, there are examples where the derivatives converge, and I am constructing this particular one, because the polynomials are "well-behaved", so that I think it should be true that the derivatives converge. But maybe we need certain condition on how the coefficients behave, for example, an upper bound on $c_{i,n}$ in terms of $n$. But I am not sure about this.
    $endgroup$
    – Richie
    Jul 28 '17 at 10:35










  • $begingroup$
    Is there even a non-trivial sequence $h_n$ with the desired properties? It seems to me that (1) will never be satisfied by any polynomial other than $x$. Am I missing something?
    $endgroup$
    – Jose27
    Jul 28 '17 at 13:14
















$begingroup$
You forgot to mention what's the purpose of this, since $x$ is a polynomial. So why don't you just set $h_n(x)=x$?
$endgroup$
– Professor Vector
Jul 28 '17 at 9:36




$begingroup$
You forgot to mention what's the purpose of this, since $x$ is a polynomial. So why don't you just set $h_n(x)=x$?
$endgroup$
– Professor Vector
Jul 28 '17 at 9:36












$begingroup$
@Professor Vector The purpose is that given a sequence of functions ${f_n}$ on some $[a,b]$ that converge uniformly to a function $f$, in general we cannot say anything about how the sequence of derivatives ${f_n '}$ behave. So I am considering an example where we can get some result on the sequence of derivatives.
$endgroup$
– Richie
Jul 28 '17 at 10:15




$begingroup$
@Professor Vector The purpose is that given a sequence of functions ${f_n}$ on some $[a,b]$ that converge uniformly to a function $f$, in general we cannot say anything about how the sequence of derivatives ${f_n '}$ behave. So I am considering an example where we can get some result on the sequence of derivatives.
$endgroup$
– Richie
Jul 28 '17 at 10:15












$begingroup$
Well, you've just added more confusion, because in your question, there was no "uniform convergence". Of course, there are examples where the derivatives converge (I gave a trivial one), but you evaded the question of the purpose. It's pointless, imho.
$endgroup$
– Professor Vector
Jul 28 '17 at 10:21




$begingroup$
Well, you've just added more confusion, because in your question, there was no "uniform convergence". Of course, there are examples where the derivatives converge (I gave a trivial one), but you evaded the question of the purpose. It's pointless, imho.
$endgroup$
– Professor Vector
Jul 28 '17 at 10:21












$begingroup$
Ok, fine. The title is misleading. It is not a question on approximation, but a question on convergence. As you said, there are examples where the derivatives converge, and I am constructing this particular one, because the polynomials are "well-behaved", so that I think it should be true that the derivatives converge. But maybe we need certain condition on how the coefficients behave, for example, an upper bound on $c_{i,n}$ in terms of $n$. But I am not sure about this.
$endgroup$
– Richie
Jul 28 '17 at 10:35




$begingroup$
Ok, fine. The title is misleading. It is not a question on approximation, but a question on convergence. As you said, there are examples where the derivatives converge, and I am constructing this particular one, because the polynomials are "well-behaved", so that I think it should be true that the derivatives converge. But maybe we need certain condition on how the coefficients behave, for example, an upper bound on $c_{i,n}$ in terms of $n$. But I am not sure about this.
$endgroup$
– Richie
Jul 28 '17 at 10:35












$begingroup$
Is there even a non-trivial sequence $h_n$ with the desired properties? It seems to me that (1) will never be satisfied by any polynomial other than $x$. Am I missing something?
$endgroup$
– Jose27
Jul 28 '17 at 13:14




$begingroup$
Is there even a non-trivial sequence $h_n$ with the desired properties? It seems to me that (1) will never be satisfied by any polynomial other than $x$. Am I missing something?
$endgroup$
– Jose27
Jul 28 '17 at 13:14










1 Answer
1






active

oldest

votes


















1












$begingroup$

No. For $epsilon>0$, let $d_epsilon(x)=epsilon$ for $xleqepsilon$, $d_epsilon(x)=1-epsilon$ for $xgeq 2epsilon$, and interpolate linearly on $[epsilon,2epsilon]$. By the Weierstrass approximation theorem, let $p_epsilon$ be a polynomial that uniformly approximates $d_epsilon$ within $epsilon/2$ on $[0,a]$, and let $q_epsilon$ be the antiderivative of $p_epsilon$ with $q_epsilon(0)=0$. Note that $q_epsilon$ satisfies your conditions (1) and (2) (since $p_epsilon$ is always between $epsilon/2$ and $1-epsilon/2$), and $q_epsilon(x)to x$ uniformly on $[0,a]$ as $epsilonto 0$. However, $q_epsilon'(0)=p_epsilon(0)to 0$ as $epsilonto 0$.



In particular, then, we can pick a sequence $epsilon_kto 0$ for which the polynomials $q_{epsilon_k}$ have increasing degree, and take them to be a subsequence of your sequence $(h_n)$. Then $c_{1,n}$ will not converge to $1$ since it converges to $0$ on a subsequence.






share|cite|improve this answer









$endgroup$














    Your Answer








    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%2f2374536%2fpointwise-convergence-of-a-sequence-of-polynomials%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









    1












    $begingroup$

    No. For $epsilon>0$, let $d_epsilon(x)=epsilon$ for $xleqepsilon$, $d_epsilon(x)=1-epsilon$ for $xgeq 2epsilon$, and interpolate linearly on $[epsilon,2epsilon]$. By the Weierstrass approximation theorem, let $p_epsilon$ be a polynomial that uniformly approximates $d_epsilon$ within $epsilon/2$ on $[0,a]$, and let $q_epsilon$ be the antiderivative of $p_epsilon$ with $q_epsilon(0)=0$. Note that $q_epsilon$ satisfies your conditions (1) and (2) (since $p_epsilon$ is always between $epsilon/2$ and $1-epsilon/2$), and $q_epsilon(x)to x$ uniformly on $[0,a]$ as $epsilonto 0$. However, $q_epsilon'(0)=p_epsilon(0)to 0$ as $epsilonto 0$.



    In particular, then, we can pick a sequence $epsilon_kto 0$ for which the polynomials $q_{epsilon_k}$ have increasing degree, and take them to be a subsequence of your sequence $(h_n)$. Then $c_{1,n}$ will not converge to $1$ since it converges to $0$ on a subsequence.






    share|cite|improve this answer









    $endgroup$


















      1












      $begingroup$

      No. For $epsilon>0$, let $d_epsilon(x)=epsilon$ for $xleqepsilon$, $d_epsilon(x)=1-epsilon$ for $xgeq 2epsilon$, and interpolate linearly on $[epsilon,2epsilon]$. By the Weierstrass approximation theorem, let $p_epsilon$ be a polynomial that uniformly approximates $d_epsilon$ within $epsilon/2$ on $[0,a]$, and let $q_epsilon$ be the antiderivative of $p_epsilon$ with $q_epsilon(0)=0$. Note that $q_epsilon$ satisfies your conditions (1) and (2) (since $p_epsilon$ is always between $epsilon/2$ and $1-epsilon/2$), and $q_epsilon(x)to x$ uniformly on $[0,a]$ as $epsilonto 0$. However, $q_epsilon'(0)=p_epsilon(0)to 0$ as $epsilonto 0$.



      In particular, then, we can pick a sequence $epsilon_kto 0$ for which the polynomials $q_{epsilon_k}$ have increasing degree, and take them to be a subsequence of your sequence $(h_n)$. Then $c_{1,n}$ will not converge to $1$ since it converges to $0$ on a subsequence.






      share|cite|improve this answer









      $endgroup$
















        1












        1








        1





        $begingroup$

        No. For $epsilon>0$, let $d_epsilon(x)=epsilon$ for $xleqepsilon$, $d_epsilon(x)=1-epsilon$ for $xgeq 2epsilon$, and interpolate linearly on $[epsilon,2epsilon]$. By the Weierstrass approximation theorem, let $p_epsilon$ be a polynomial that uniformly approximates $d_epsilon$ within $epsilon/2$ on $[0,a]$, and let $q_epsilon$ be the antiderivative of $p_epsilon$ with $q_epsilon(0)=0$. Note that $q_epsilon$ satisfies your conditions (1) and (2) (since $p_epsilon$ is always between $epsilon/2$ and $1-epsilon/2$), and $q_epsilon(x)to x$ uniformly on $[0,a]$ as $epsilonto 0$. However, $q_epsilon'(0)=p_epsilon(0)to 0$ as $epsilonto 0$.



        In particular, then, we can pick a sequence $epsilon_kto 0$ for which the polynomials $q_{epsilon_k}$ have increasing degree, and take them to be a subsequence of your sequence $(h_n)$. Then $c_{1,n}$ will not converge to $1$ since it converges to $0$ on a subsequence.






        share|cite|improve this answer









        $endgroup$



        No. For $epsilon>0$, let $d_epsilon(x)=epsilon$ for $xleqepsilon$, $d_epsilon(x)=1-epsilon$ for $xgeq 2epsilon$, and interpolate linearly on $[epsilon,2epsilon]$. By the Weierstrass approximation theorem, let $p_epsilon$ be a polynomial that uniformly approximates $d_epsilon$ within $epsilon/2$ on $[0,a]$, and let $q_epsilon$ be the antiderivative of $p_epsilon$ with $q_epsilon(0)=0$. Note that $q_epsilon$ satisfies your conditions (1) and (2) (since $p_epsilon$ is always between $epsilon/2$ and $1-epsilon/2$), and $q_epsilon(x)to x$ uniformly on $[0,a]$ as $epsilonto 0$. However, $q_epsilon'(0)=p_epsilon(0)to 0$ as $epsilonto 0$.



        In particular, then, we can pick a sequence $epsilon_kto 0$ for which the polynomials $q_{epsilon_k}$ have increasing degree, and take them to be a subsequence of your sequence $(h_n)$. Then $c_{1,n}$ will not converge to $1$ since it converges to $0$ on a subsequence.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Jan 9 at 5:22









        Eric WofseyEric Wofsey

        193k14221352




        193k14221352






























            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%2f2374536%2fpointwise-convergence-of-a-sequence-of-polynomials%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

            How do I know what Microsoft account the skydrive app is syncing to?

            When does type information flow backwards in C++?

            Grease: Live!