Trigo system completeness..












0












$begingroup$


This argument is from Rudin's Real and Complex Analysis (section 4.24 Completeness of the Trigonometric System). It considers $C(-pi,pi)$ instead of $C(0,2pi)$, but this makes no difference of course.



Suppose we had trigonometric polynomials $Q_k geq 0$ such that




  • $$frac{1}{2pi}int_{-pi}^{pi} ! Q_k(t) , dt = 1$$


  • $Q_k to 0$ uniformly on $[-pi, -delta] cup [delta, pi]$ for every $delta >0$


(i.e. the $Q_k$ are a summation kernel). Associate to each continuous $f$ the function
$$P_k(t) = f ast Q_k(t) = frac{1}{2pi}int_{-pi}^pi ! f(t-s)Q_k(s) , ds.$$
Substitution shows that also
$$P_k(t) = frac{1}{2pi}int_{-pi}^pi ! f(s)Q_k(t-s) , ds$$
so that each $P_k$ is a trigonometric polynomial. Now let $epsilon > 0$. Since $f$ is uniformly continuous, there exists $delta > 0$ such that $|f(t) - f(s)| < epsilon$ whenever $|t-s| < delta$. Since each $Q_k$ has average equal to one, we see that
$$P_k(t) - f(t) = frac{1}{2pi}int_{-pi}^pi ! (f(t-s) - f(s)) Q_k(s) , ds$$ and the positivity of $Q_k$ implies
$$|P_k(t) - f(t)| le frac{1}{2pi}int_{-pi}^pi ! |f(t-s) - f(s)|Q_k(s) , ds$$
$$= frac{1}{2pi}int_{|s| le delta} ! |f(t-s) - f(s)|Q_k(s) , ds + frac{1}{2pi}int_{|s|geq delta} ! |f(t-s) - f(s)|Q_k(s) , ds$$
In the first term, the uniform continuity of $f$ shows that the integrand is smaller than $epsilon Q_k(s)$ and the assumption on the average of $Q_k$ makes this term small. For the second the integrand converges uniformly to $0$ as $k to infty$ (since $f$ is bounded). Since the estimates are independent of $t$ we have shown that
$$|P_k - f|_infty < epsilon$$
for $k$ large enough and thus the trigonometric polynomials are dense. We need to now construct the $Q_k$ with the desired properties. To do this we let
$$Q_k(t) = c_k left(frac{1 + cos t}{2}right)^k$$
where the $c_k$ is chosen in such a way as to satisfy the assumption on the averages. Since the $Q_k$ are clearly positive, we only need to show that $Q_k to 0$ uniformly away from $0$. But $Q_k$ is even (on $(-pi,pi)$) and decreasing on $[0,pi]$. Thus for any $delta > 0$ we have
$$|Q_k(t)| le Q_k(delta) le frac{pi(k+1)}{2}left(frac{1 + cos delta}{2} right)^k to 0$$
independently of $t$ as $k to infty$ since
$$frac{1 + cos delta}{2} < 1.$$



My questions are as follows:



Substitution shows that also
$$P_k(t) = frac{1}{2pi}int_{-pi}^pi ! f(s)Q_k(t-s) , ds$$
so that each $P_k$ is a trigonometric polynomial.(?)



we see that
$$P_k(t) - f(t) = frac{1}{2pi}int_{-pi}^pi ! (f(t-s) - f(s)) Q_k(s) , ds$$ and the positivity of $Q_k$ implies
$$|P_k(t) - f(t)| le frac{1}{2pi}int_{-pi}^pi ! |f(t-s) - f(s)|Q_k(s) , ds$$
$$= frac{1}{2pi}int_{|s| le delta} ! |f(t-s) - f(s)|Q_k(s) , ds + frac{1}{2pi}int_{|s|geq delta} ! |f(t-s) - f(s)|Q_k(s) , ds$$.(?)
I think there are many details omitted in the proof. Thanks for the help in advance.










share|cite|improve this question









$endgroup$

















    0












    $begingroup$


    This argument is from Rudin's Real and Complex Analysis (section 4.24 Completeness of the Trigonometric System). It considers $C(-pi,pi)$ instead of $C(0,2pi)$, but this makes no difference of course.



    Suppose we had trigonometric polynomials $Q_k geq 0$ such that




    • $$frac{1}{2pi}int_{-pi}^{pi} ! Q_k(t) , dt = 1$$


    • $Q_k to 0$ uniformly on $[-pi, -delta] cup [delta, pi]$ for every $delta >0$


    (i.e. the $Q_k$ are a summation kernel). Associate to each continuous $f$ the function
    $$P_k(t) = f ast Q_k(t) = frac{1}{2pi}int_{-pi}^pi ! f(t-s)Q_k(s) , ds.$$
    Substitution shows that also
    $$P_k(t) = frac{1}{2pi}int_{-pi}^pi ! f(s)Q_k(t-s) , ds$$
    so that each $P_k$ is a trigonometric polynomial. Now let $epsilon > 0$. Since $f$ is uniformly continuous, there exists $delta > 0$ such that $|f(t) - f(s)| < epsilon$ whenever $|t-s| < delta$. Since each $Q_k$ has average equal to one, we see that
    $$P_k(t) - f(t) = frac{1}{2pi}int_{-pi}^pi ! (f(t-s) - f(s)) Q_k(s) , ds$$ and the positivity of $Q_k$ implies
    $$|P_k(t) - f(t)| le frac{1}{2pi}int_{-pi}^pi ! |f(t-s) - f(s)|Q_k(s) , ds$$
    $$= frac{1}{2pi}int_{|s| le delta} ! |f(t-s) - f(s)|Q_k(s) , ds + frac{1}{2pi}int_{|s|geq delta} ! |f(t-s) - f(s)|Q_k(s) , ds$$
    In the first term, the uniform continuity of $f$ shows that the integrand is smaller than $epsilon Q_k(s)$ and the assumption on the average of $Q_k$ makes this term small. For the second the integrand converges uniformly to $0$ as $k to infty$ (since $f$ is bounded). Since the estimates are independent of $t$ we have shown that
    $$|P_k - f|_infty < epsilon$$
    for $k$ large enough and thus the trigonometric polynomials are dense. We need to now construct the $Q_k$ with the desired properties. To do this we let
    $$Q_k(t) = c_k left(frac{1 + cos t}{2}right)^k$$
    where the $c_k$ is chosen in such a way as to satisfy the assumption on the averages. Since the $Q_k$ are clearly positive, we only need to show that $Q_k to 0$ uniformly away from $0$. But $Q_k$ is even (on $(-pi,pi)$) and decreasing on $[0,pi]$. Thus for any $delta > 0$ we have
    $$|Q_k(t)| le Q_k(delta) le frac{pi(k+1)}{2}left(frac{1 + cos delta}{2} right)^k to 0$$
    independently of $t$ as $k to infty$ since
    $$frac{1 + cos delta}{2} < 1.$$



    My questions are as follows:



    Substitution shows that also
    $$P_k(t) = frac{1}{2pi}int_{-pi}^pi ! f(s)Q_k(t-s) , ds$$
    so that each $P_k$ is a trigonometric polynomial.(?)



    we see that
    $$P_k(t) - f(t) = frac{1}{2pi}int_{-pi}^pi ! (f(t-s) - f(s)) Q_k(s) , ds$$ and the positivity of $Q_k$ implies
    $$|P_k(t) - f(t)| le frac{1}{2pi}int_{-pi}^pi ! |f(t-s) - f(s)|Q_k(s) , ds$$
    $$= frac{1}{2pi}int_{|s| le delta} ! |f(t-s) - f(s)|Q_k(s) , ds + frac{1}{2pi}int_{|s|geq delta} ! |f(t-s) - f(s)|Q_k(s) , ds$$.(?)
    I think there are many details omitted in the proof. Thanks for the help in advance.










    share|cite|improve this question









    $endgroup$















      0












      0








      0





      $begingroup$


      This argument is from Rudin's Real and Complex Analysis (section 4.24 Completeness of the Trigonometric System). It considers $C(-pi,pi)$ instead of $C(0,2pi)$, but this makes no difference of course.



      Suppose we had trigonometric polynomials $Q_k geq 0$ such that




      • $$frac{1}{2pi}int_{-pi}^{pi} ! Q_k(t) , dt = 1$$


      • $Q_k to 0$ uniformly on $[-pi, -delta] cup [delta, pi]$ for every $delta >0$


      (i.e. the $Q_k$ are a summation kernel). Associate to each continuous $f$ the function
      $$P_k(t) = f ast Q_k(t) = frac{1}{2pi}int_{-pi}^pi ! f(t-s)Q_k(s) , ds.$$
      Substitution shows that also
      $$P_k(t) = frac{1}{2pi}int_{-pi}^pi ! f(s)Q_k(t-s) , ds$$
      so that each $P_k$ is a trigonometric polynomial. Now let $epsilon > 0$. Since $f$ is uniformly continuous, there exists $delta > 0$ such that $|f(t) - f(s)| < epsilon$ whenever $|t-s| < delta$. Since each $Q_k$ has average equal to one, we see that
      $$P_k(t) - f(t) = frac{1}{2pi}int_{-pi}^pi ! (f(t-s) - f(s)) Q_k(s) , ds$$ and the positivity of $Q_k$ implies
      $$|P_k(t) - f(t)| le frac{1}{2pi}int_{-pi}^pi ! |f(t-s) - f(s)|Q_k(s) , ds$$
      $$= frac{1}{2pi}int_{|s| le delta} ! |f(t-s) - f(s)|Q_k(s) , ds + frac{1}{2pi}int_{|s|geq delta} ! |f(t-s) - f(s)|Q_k(s) , ds$$
      In the first term, the uniform continuity of $f$ shows that the integrand is smaller than $epsilon Q_k(s)$ and the assumption on the average of $Q_k$ makes this term small. For the second the integrand converges uniformly to $0$ as $k to infty$ (since $f$ is bounded). Since the estimates are independent of $t$ we have shown that
      $$|P_k - f|_infty < epsilon$$
      for $k$ large enough and thus the trigonometric polynomials are dense. We need to now construct the $Q_k$ with the desired properties. To do this we let
      $$Q_k(t) = c_k left(frac{1 + cos t}{2}right)^k$$
      where the $c_k$ is chosen in such a way as to satisfy the assumption on the averages. Since the $Q_k$ are clearly positive, we only need to show that $Q_k to 0$ uniformly away from $0$. But $Q_k$ is even (on $(-pi,pi)$) and decreasing on $[0,pi]$. Thus for any $delta > 0$ we have
      $$|Q_k(t)| le Q_k(delta) le frac{pi(k+1)}{2}left(frac{1 + cos delta}{2} right)^k to 0$$
      independently of $t$ as $k to infty$ since
      $$frac{1 + cos delta}{2} < 1.$$



      My questions are as follows:



      Substitution shows that also
      $$P_k(t) = frac{1}{2pi}int_{-pi}^pi ! f(s)Q_k(t-s) , ds$$
      so that each $P_k$ is a trigonometric polynomial.(?)



      we see that
      $$P_k(t) - f(t) = frac{1}{2pi}int_{-pi}^pi ! (f(t-s) - f(s)) Q_k(s) , ds$$ and the positivity of $Q_k$ implies
      $$|P_k(t) - f(t)| le frac{1}{2pi}int_{-pi}^pi ! |f(t-s) - f(s)|Q_k(s) , ds$$
      $$= frac{1}{2pi}int_{|s| le delta} ! |f(t-s) - f(s)|Q_k(s) , ds + frac{1}{2pi}int_{|s|geq delta} ! |f(t-s) - f(s)|Q_k(s) , ds$$.(?)
      I think there are many details omitted in the proof. Thanks for the help in advance.










      share|cite|improve this question









      $endgroup$




      This argument is from Rudin's Real and Complex Analysis (section 4.24 Completeness of the Trigonometric System). It considers $C(-pi,pi)$ instead of $C(0,2pi)$, but this makes no difference of course.



      Suppose we had trigonometric polynomials $Q_k geq 0$ such that




      • $$frac{1}{2pi}int_{-pi}^{pi} ! Q_k(t) , dt = 1$$


      • $Q_k to 0$ uniformly on $[-pi, -delta] cup [delta, pi]$ for every $delta >0$


      (i.e. the $Q_k$ are a summation kernel). Associate to each continuous $f$ the function
      $$P_k(t) = f ast Q_k(t) = frac{1}{2pi}int_{-pi}^pi ! f(t-s)Q_k(s) , ds.$$
      Substitution shows that also
      $$P_k(t) = frac{1}{2pi}int_{-pi}^pi ! f(s)Q_k(t-s) , ds$$
      so that each $P_k$ is a trigonometric polynomial. Now let $epsilon > 0$. Since $f$ is uniformly continuous, there exists $delta > 0$ such that $|f(t) - f(s)| < epsilon$ whenever $|t-s| < delta$. Since each $Q_k$ has average equal to one, we see that
      $$P_k(t) - f(t) = frac{1}{2pi}int_{-pi}^pi ! (f(t-s) - f(s)) Q_k(s) , ds$$ and the positivity of $Q_k$ implies
      $$|P_k(t) - f(t)| le frac{1}{2pi}int_{-pi}^pi ! |f(t-s) - f(s)|Q_k(s) , ds$$
      $$= frac{1}{2pi}int_{|s| le delta} ! |f(t-s) - f(s)|Q_k(s) , ds + frac{1}{2pi}int_{|s|geq delta} ! |f(t-s) - f(s)|Q_k(s) , ds$$
      In the first term, the uniform continuity of $f$ shows that the integrand is smaller than $epsilon Q_k(s)$ and the assumption on the average of $Q_k$ makes this term small. For the second the integrand converges uniformly to $0$ as $k to infty$ (since $f$ is bounded). Since the estimates are independent of $t$ we have shown that
      $$|P_k - f|_infty < epsilon$$
      for $k$ large enough and thus the trigonometric polynomials are dense. We need to now construct the $Q_k$ with the desired properties. To do this we let
      $$Q_k(t) = c_k left(frac{1 + cos t}{2}right)^k$$
      where the $c_k$ is chosen in such a way as to satisfy the assumption on the averages. Since the $Q_k$ are clearly positive, we only need to show that $Q_k to 0$ uniformly away from $0$. But $Q_k$ is even (on $(-pi,pi)$) and decreasing on $[0,pi]$. Thus for any $delta > 0$ we have
      $$|Q_k(t)| le Q_k(delta) le frac{pi(k+1)}{2}left(frac{1 + cos delta}{2} right)^k to 0$$
      independently of $t$ as $k to infty$ since
      $$frac{1 + cos delta}{2} < 1.$$



      My questions are as follows:



      Substitution shows that also
      $$P_k(t) = frac{1}{2pi}int_{-pi}^pi ! f(s)Q_k(t-s) , ds$$
      so that each $P_k$ is a trigonometric polynomial.(?)



      we see that
      $$P_k(t) - f(t) = frac{1}{2pi}int_{-pi}^pi ! (f(t-s) - f(s)) Q_k(s) , ds$$ and the positivity of $Q_k$ implies
      $$|P_k(t) - f(t)| le frac{1}{2pi}int_{-pi}^pi ! |f(t-s) - f(s)|Q_k(s) , ds$$
      $$= frac{1}{2pi}int_{|s| le delta} ! |f(t-s) - f(s)|Q_k(s) , ds + frac{1}{2pi}int_{|s|geq delta} ! |f(t-s) - f(s)|Q_k(s) , ds$$.(?)
      I think there are many details omitted in the proof. Thanks for the help in advance.







      real-analysis






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Dec 7 '18 at 1:53









      beginnerbeginner

      246




      246






















          0






          active

          oldest

          votes











          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%2f3029363%2ftrigo-system-completeness%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















          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%2f3029363%2ftrigo-system-completeness%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          Quarter-circle Tiles

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

          Mont Emei