Does convergence of polynomials imply that of its coefficients? The Next CEO of Stack OverflowDifferentiation continuous iff domain is finite dimensionalShow convergence of a sequence of continuous functions $f_n$ to a continuous function $f$ does not imply convergence of corresponding integrals.Convergence problem in different normsDominated convergence theorem and uniformly convergenceShowing that $displaystyleundersetnrightarrow inftylimint_0^1 f_n = int_0^1undersetnrightarrow inftylim f_n$Proof that uniform convergence implies convergence in norm of function spaceFor a piecewise function $g_n(t)$, find $g(t)=limlimits_nrightarrow inftyg_n(t)$.Uniform convergence of even polynomials in $(a,b)$Moving limit into sup normShowing that a linear map does not achieve its norm

How can I quit an app using Terminal?

Why do professional authors make "consistency" mistakes? And how to avoid them?

Can a caster that cast Polymorph on themselves stop concentrating at any point even if their Int is low?

Should I tutor a student who I know has cheated on their homework?

How to write the block matrix in LaTex?

Why did we only see the N-1 starfighters in one film?

What is the point of a new vote on May's deal when the indicative votes suggest she will not win?

Science fiction (dystopian) short story set after WWIII

How do I solve this limit?

Return of the Riley Riddles in Reverse

Only print output after finding pattern

Is it okay to store user locations?

What happens if you roll doubles 3 times then land on "Go to jail?"

Where to find order of arguments for default functions

Is the concept of a "numerable" fiber bundle really useful or an empty generalization?

How to Reset Passwords on Multiple Websites Easily?

Does it take more energy to get to Venus or to Mars?

Whats the best way to handle refactoring a big file?

Is it my responsibility to learn a new technology in my own time my employer wants to implement?

How to start emacs in "nothing" mode (`fundamental-mode`)

Would this house-rule that treats advantage as a +1 to the roll instead (and disadvantage as -1) and allows them to stack be balanced?

Rotate a column

How to safely derail a train during transit?

How to use tikz in fbox?



Does convergence of polynomials imply that of its coefficients?



The Next CEO of Stack OverflowDifferentiation continuous iff domain is finite dimensionalShow convergence of a sequence of continuous functions $f_n$ to a continuous function $f$ does not imply convergence of corresponding integrals.Convergence problem in different normsDominated convergence theorem and uniformly convergenceShowing that $displaystyleundersetnrightarrow inftylimint_0^1 f_n = int_0^1undersetnrightarrow inftylim f_n$Proof that uniform convergence implies convergence in norm of function spaceFor a piecewise function $g_n(t)$, find $g(t)=limlimits_nrightarrow inftyg_n(t)$.Uniform convergence of even polynomials in $(a,b)$Moving limit into sup normShowing that a linear map does not achieve its norm










26












$begingroup$


Let $p_n$ be a sequence of polynomials and $f$ a continuous function
on $[0,1]$ such that $intlimits_0^1|p_n(x)-f(x)|dxto 0$.
Let $c_n,k$ be the coefficient of $x^k$ in $p_n(x)$. Can we conclude
that $undersetnrightarrow infty lim c_n,k$ exists for each $k$?.



What I know so far: if the degrees of $p_n^prime s$ are bounded then
this is true. In fact, we can replace $L^1$ convergence by convergence in
any norm on $C[0,1]$; to see this we just have to note that for fixed $N$, $%
sum_k=0^Nc_ix^irightarrow (c_0,c_1,...,c_N)$
is a
linear map on a finite-dimensional subspace and hence it is continuous. My
guess is that the result fails when there is no restriction on the degrees.
But if $p_n(z)$ converges uniformly in some disk around $0$ in the complex
plane then the conclusion holds. To construct a counterexample we have to
avoid this situation. Maybe there is a very simple example but I haven't been
to find one. Thank you for investing your time on this.










share|cite|improve this question











$endgroup$
















    26












    $begingroup$


    Let $p_n$ be a sequence of polynomials and $f$ a continuous function
    on $[0,1]$ such that $intlimits_0^1|p_n(x)-f(x)|dxto 0$.
    Let $c_n,k$ be the coefficient of $x^k$ in $p_n(x)$. Can we conclude
    that $undersetnrightarrow infty lim c_n,k$ exists for each $k$?.



    What I know so far: if the degrees of $p_n^prime s$ are bounded then
    this is true. In fact, we can replace $L^1$ convergence by convergence in
    any norm on $C[0,1]$; to see this we just have to note that for fixed $N$, $%
    sum_k=0^Nc_ix^irightarrow (c_0,c_1,...,c_N)$
    is a
    linear map on a finite-dimensional subspace and hence it is continuous. My
    guess is that the result fails when there is no restriction on the degrees.
    But if $p_n(z)$ converges uniformly in some disk around $0$ in the complex
    plane then the conclusion holds. To construct a counterexample we have to
    avoid this situation. Maybe there is a very simple example but I haven't been
    to find one. Thank you for investing your time on this.










    share|cite|improve this question











    $endgroup$














      26












      26








      26


      2



      $begingroup$


      Let $p_n$ be a sequence of polynomials and $f$ a continuous function
      on $[0,1]$ such that $intlimits_0^1|p_n(x)-f(x)|dxto 0$.
      Let $c_n,k$ be the coefficient of $x^k$ in $p_n(x)$. Can we conclude
      that $undersetnrightarrow infty lim c_n,k$ exists for each $k$?.



      What I know so far: if the degrees of $p_n^prime s$ are bounded then
      this is true. In fact, we can replace $L^1$ convergence by convergence in
      any norm on $C[0,1]$; to see this we just have to note that for fixed $N$, $%
      sum_k=0^Nc_ix^irightarrow (c_0,c_1,...,c_N)$
      is a
      linear map on a finite-dimensional subspace and hence it is continuous. My
      guess is that the result fails when there is no restriction on the degrees.
      But if $p_n(z)$ converges uniformly in some disk around $0$ in the complex
      plane then the conclusion holds. To construct a counterexample we have to
      avoid this situation. Maybe there is a very simple example but I haven't been
      to find one. Thank you for investing your time on this.










      share|cite|improve this question











      $endgroup$




      Let $p_n$ be a sequence of polynomials and $f$ a continuous function
      on $[0,1]$ such that $intlimits_0^1|p_n(x)-f(x)|dxto 0$.
      Let $c_n,k$ be the coefficient of $x^k$ in $p_n(x)$. Can we conclude
      that $undersetnrightarrow infty lim c_n,k$ exists for each $k$?.



      What I know so far: if the degrees of $p_n^prime s$ are bounded then
      this is true. In fact, we can replace $L^1$ convergence by convergence in
      any norm on $C[0,1]$; to see this we just have to note that for fixed $N$, $%
      sum_k=0^Nc_ix^irightarrow (c_0,c_1,...,c_N)$
      is a
      linear map on a finite-dimensional subspace and hence it is continuous. My
      guess is that the result fails when there is no restriction on the degrees.
      But if $p_n(z)$ converges uniformly in some disk around $0$ in the complex
      plane then the conclusion holds. To construct a counterexample we have to
      avoid this situation. Maybe there is a very simple example but I haven't been
      to find one. Thank you for investing your time on this.







      functional-analysis polynomials convergence






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Mar 19 at 17:56









      Rodrigo de Azevedo

      13.2k41960




      13.2k41960










      asked Mar 18 at 8:13









      Kavi Rama MurthyKavi Rama Murthy

      70.8k53170




      70.8k53170




















          1 Answer
          1






          active

          oldest

          votes


















          33












          $begingroup$

          Consider the sequence of polynomials



          $$
          p_n(x)=left{
          beginarray@ll@
          (1-x)^n, & textif nequiv 0 mod 2 \
          x^n, & textif nequiv 1 mod 2
          endarrayright.
          $$



          Then $p_n(x)$ converges to $0$ but the constant term is oscillating.






          share|cite|improve this answer









          $endgroup$








          • 7




            $begingroup$
            Thanks. I just noticed that teh conclusion fails even with uniform convergence. Consider $x(1-x)p_n(x)$ with the $p_n$' you have defined and look at the coefficient of $x$.
            $endgroup$
            – Kavi Rama Murthy
            Mar 18 at 8:41






          • 3




            $begingroup$
            @KaviRamaMurthy: Or, use Ethan's sequence with the interval $[1/4, 3/4]$, on which it converges uniformly.
            $endgroup$
            – Nate Eldredge
            Mar 19 at 0:36











          • $begingroup$
            What if the polynomial converges to something other than $0$ though?
            $endgroup$
            – Jam
            Mar 23 at 16:07










          • $begingroup$
            @Jam You can make it work if $f$ is any function that can be approximated by polynomials. Indeed, if $g_n$ is a sequence of polynomials converging to $f$, then we can assume $g_n(0)$ converges to $f(0)$ since otherwise we're done. But then $p_n+g_n$ still converges to $f$ while $p_n(0)+g_n(0)$ has two subsequences which converge to $f(0)$ and $f(0)+1$ respectively.
            $endgroup$
            – Ethan MacBrough
            Mar 23 at 20:47











          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%2f3152512%2fdoes-convergence-of-polynomials-imply-that-of-its-coefficients%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









          33












          $begingroup$

          Consider the sequence of polynomials



          $$
          p_n(x)=left{
          beginarray@ll@
          (1-x)^n, & textif nequiv 0 mod 2 \
          x^n, & textif nequiv 1 mod 2
          endarrayright.
          $$



          Then $p_n(x)$ converges to $0$ but the constant term is oscillating.






          share|cite|improve this answer









          $endgroup$








          • 7




            $begingroup$
            Thanks. I just noticed that teh conclusion fails even with uniform convergence. Consider $x(1-x)p_n(x)$ with the $p_n$' you have defined and look at the coefficient of $x$.
            $endgroup$
            – Kavi Rama Murthy
            Mar 18 at 8:41






          • 3




            $begingroup$
            @KaviRamaMurthy: Or, use Ethan's sequence with the interval $[1/4, 3/4]$, on which it converges uniformly.
            $endgroup$
            – Nate Eldredge
            Mar 19 at 0:36











          • $begingroup$
            What if the polynomial converges to something other than $0$ though?
            $endgroup$
            – Jam
            Mar 23 at 16:07










          • $begingroup$
            @Jam You can make it work if $f$ is any function that can be approximated by polynomials. Indeed, if $g_n$ is a sequence of polynomials converging to $f$, then we can assume $g_n(0)$ converges to $f(0)$ since otherwise we're done. But then $p_n+g_n$ still converges to $f$ while $p_n(0)+g_n(0)$ has two subsequences which converge to $f(0)$ and $f(0)+1$ respectively.
            $endgroup$
            – Ethan MacBrough
            Mar 23 at 20:47















          33












          $begingroup$

          Consider the sequence of polynomials



          $$
          p_n(x)=left{
          beginarray@ll@
          (1-x)^n, & textif nequiv 0 mod 2 \
          x^n, & textif nequiv 1 mod 2
          endarrayright.
          $$



          Then $p_n(x)$ converges to $0$ but the constant term is oscillating.






          share|cite|improve this answer









          $endgroup$








          • 7




            $begingroup$
            Thanks. I just noticed that teh conclusion fails even with uniform convergence. Consider $x(1-x)p_n(x)$ with the $p_n$' you have defined and look at the coefficient of $x$.
            $endgroup$
            – Kavi Rama Murthy
            Mar 18 at 8:41






          • 3




            $begingroup$
            @KaviRamaMurthy: Or, use Ethan's sequence with the interval $[1/4, 3/4]$, on which it converges uniformly.
            $endgroup$
            – Nate Eldredge
            Mar 19 at 0:36











          • $begingroup$
            What if the polynomial converges to something other than $0$ though?
            $endgroup$
            – Jam
            Mar 23 at 16:07










          • $begingroup$
            @Jam You can make it work if $f$ is any function that can be approximated by polynomials. Indeed, if $g_n$ is a sequence of polynomials converging to $f$, then we can assume $g_n(0)$ converges to $f(0)$ since otherwise we're done. But then $p_n+g_n$ still converges to $f$ while $p_n(0)+g_n(0)$ has two subsequences which converge to $f(0)$ and $f(0)+1$ respectively.
            $endgroup$
            – Ethan MacBrough
            Mar 23 at 20:47













          33












          33








          33





          $begingroup$

          Consider the sequence of polynomials



          $$
          p_n(x)=left{
          beginarray@ll@
          (1-x)^n, & textif nequiv 0 mod 2 \
          x^n, & textif nequiv 1 mod 2
          endarrayright.
          $$



          Then $p_n(x)$ converges to $0$ but the constant term is oscillating.






          share|cite|improve this answer









          $endgroup$



          Consider the sequence of polynomials



          $$
          p_n(x)=left{
          beginarray@ll@
          (1-x)^n, & textif nequiv 0 mod 2 \
          x^n, & textif nequiv 1 mod 2
          endarrayright.
          $$



          Then $p_n(x)$ converges to $0$ but the constant term is oscillating.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Mar 18 at 8:32









          Ethan MacBroughEthan MacBrough

          1,241617




          1,241617







          • 7




            $begingroup$
            Thanks. I just noticed that teh conclusion fails even with uniform convergence. Consider $x(1-x)p_n(x)$ with the $p_n$' you have defined and look at the coefficient of $x$.
            $endgroup$
            – Kavi Rama Murthy
            Mar 18 at 8:41






          • 3




            $begingroup$
            @KaviRamaMurthy: Or, use Ethan's sequence with the interval $[1/4, 3/4]$, on which it converges uniformly.
            $endgroup$
            – Nate Eldredge
            Mar 19 at 0:36











          • $begingroup$
            What if the polynomial converges to something other than $0$ though?
            $endgroup$
            – Jam
            Mar 23 at 16:07










          • $begingroup$
            @Jam You can make it work if $f$ is any function that can be approximated by polynomials. Indeed, if $g_n$ is a sequence of polynomials converging to $f$, then we can assume $g_n(0)$ converges to $f(0)$ since otherwise we're done. But then $p_n+g_n$ still converges to $f$ while $p_n(0)+g_n(0)$ has two subsequences which converge to $f(0)$ and $f(0)+1$ respectively.
            $endgroup$
            – Ethan MacBrough
            Mar 23 at 20:47












          • 7




            $begingroup$
            Thanks. I just noticed that teh conclusion fails even with uniform convergence. Consider $x(1-x)p_n(x)$ with the $p_n$' you have defined and look at the coefficient of $x$.
            $endgroup$
            – Kavi Rama Murthy
            Mar 18 at 8:41






          • 3




            $begingroup$
            @KaviRamaMurthy: Or, use Ethan's sequence with the interval $[1/4, 3/4]$, on which it converges uniformly.
            $endgroup$
            – Nate Eldredge
            Mar 19 at 0:36











          • $begingroup$
            What if the polynomial converges to something other than $0$ though?
            $endgroup$
            – Jam
            Mar 23 at 16:07










          • $begingroup$
            @Jam You can make it work if $f$ is any function that can be approximated by polynomials. Indeed, if $g_n$ is a sequence of polynomials converging to $f$, then we can assume $g_n(0)$ converges to $f(0)$ since otherwise we're done. But then $p_n+g_n$ still converges to $f$ while $p_n(0)+g_n(0)$ has two subsequences which converge to $f(0)$ and $f(0)+1$ respectively.
            $endgroup$
            – Ethan MacBrough
            Mar 23 at 20:47







          7




          7




          $begingroup$
          Thanks. I just noticed that teh conclusion fails even with uniform convergence. Consider $x(1-x)p_n(x)$ with the $p_n$' you have defined and look at the coefficient of $x$.
          $endgroup$
          – Kavi Rama Murthy
          Mar 18 at 8:41




          $begingroup$
          Thanks. I just noticed that teh conclusion fails even with uniform convergence. Consider $x(1-x)p_n(x)$ with the $p_n$' you have defined and look at the coefficient of $x$.
          $endgroup$
          – Kavi Rama Murthy
          Mar 18 at 8:41




          3




          3




          $begingroup$
          @KaviRamaMurthy: Or, use Ethan's sequence with the interval $[1/4, 3/4]$, on which it converges uniformly.
          $endgroup$
          – Nate Eldredge
          Mar 19 at 0:36





          $begingroup$
          @KaviRamaMurthy: Or, use Ethan's sequence with the interval $[1/4, 3/4]$, on which it converges uniformly.
          $endgroup$
          – Nate Eldredge
          Mar 19 at 0:36













          $begingroup$
          What if the polynomial converges to something other than $0$ though?
          $endgroup$
          – Jam
          Mar 23 at 16:07




          $begingroup$
          What if the polynomial converges to something other than $0$ though?
          $endgroup$
          – Jam
          Mar 23 at 16:07












          $begingroup$
          @Jam You can make it work if $f$ is any function that can be approximated by polynomials. Indeed, if $g_n$ is a sequence of polynomials converging to $f$, then we can assume $g_n(0)$ converges to $f(0)$ since otherwise we're done. But then $p_n+g_n$ still converges to $f$ while $p_n(0)+g_n(0)$ has two subsequences which converge to $f(0)$ and $f(0)+1$ respectively.
          $endgroup$
          – Ethan MacBrough
          Mar 23 at 20:47




          $begingroup$
          @Jam You can make it work if $f$ is any function that can be approximated by polynomials. Indeed, if $g_n$ is a sequence of polynomials converging to $f$, then we can assume $g_n(0)$ converges to $f(0)$ since otherwise we're done. But then $p_n+g_n$ still converges to $f$ while $p_n(0)+g_n(0)$ has two subsequences which converge to $f(0)$ and $f(0)+1$ respectively.
          $endgroup$
          – Ethan MacBrough
          Mar 23 at 20:47

















          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%2f3152512%2fdoes-convergence-of-polynomials-imply-that-of-its-coefficients%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 should I support this large drywall patch? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How do I cover large gaps in drywall?How do I keep drywall around a patch from crumbling?Can I glue a second layer of drywall?How to patch long strip on drywall?Large drywall patch: how to avoid bulging seams?Drywall Mesh Patch vs. Bulge? To remove or not to remove?How to fix this drywall job?Prep drywall before backsplashWhat's the best way to fix this horrible drywall patch job?Drywall patching using 3M Patch Plus Primer

          random experiment with two different functions on unit interval Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Random variable and probability space notionsRandom Walk with EdgesFinding functions where the increase over a random interval is Poisson distributedNumber of days until dayCan an observed event in fact be of zero probability?Unit random processmodels of coins and uniform distributionHow to get the number of successes given $n$ trials , probability $P$ and a random variable $X$Absorbing Markov chain in a computer. Is “almost every” turned into always convergence in computer executions?Stopped random walk is not uniformly integrable

          Lowndes Grove History Architecture References Navigation menu32°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661132°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661178002500"National Register Information System"Historic houses of South Carolina"Lowndes Grove""+32° 48' 6.00", −79° 57' 58.00""Lowndes Grove, Charleston County (260 St. Margaret St., Charleston)""Lowndes Grove"The Charleston ExpositionIt Happened in South Carolina"Lowndes Grove (House), Saint Margaret Street & Sixth Avenue, Charleston, Charleston County, SC(Photographs)"Plantations of the Carolina Low Countrye