Find a sequence $a_f(k)$ so that $sum_k=1^infty a_f(k) operatornamesinc (pi k f) = 0$.

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite












I am having problems either finding such a sequence or showing that one does not exist. Here is the situation.



Take $f$ to be some positive real number which is not an integer.



Recall that $operatornamesinc(x)$ is $sin(x) / x$ if $x neq 0$, and $operatornamesinc(x) := 1$.



I would like to show that no non-zero series $a_f(k)_k=1^infty subset mathbbR$ exists which satisfies
$$sum_k=1^infty a_f(k) operatornamesinc (pi k f) = 0.$$
(I use non-zero to simply mean that there is at least one non-zero element of the sequence.)



If it is possible to do this, then I would perhaps like to say that for $N$ a large positive integer, there is no sequence of numbers $a_f(k)_k=1^N subset mathbbR$ which satisfies
$$sum_k=1^N a_f(k) operatornamesinc (pi k f) = 0.$$
If this is also possible, then I would maybe add some conditions like $f$ being irrational so that no such sequence would exist.







share|cite|improve this question
























    up vote
    1
    down vote

    favorite












    I am having problems either finding such a sequence or showing that one does not exist. Here is the situation.



    Take $f$ to be some positive real number which is not an integer.



    Recall that $operatornamesinc(x)$ is $sin(x) / x$ if $x neq 0$, and $operatornamesinc(x) := 1$.



    I would like to show that no non-zero series $a_f(k)_k=1^infty subset mathbbR$ exists which satisfies
    $$sum_k=1^infty a_f(k) operatornamesinc (pi k f) = 0.$$
    (I use non-zero to simply mean that there is at least one non-zero element of the sequence.)



    If it is possible to do this, then I would perhaps like to say that for $N$ a large positive integer, there is no sequence of numbers $a_f(k)_k=1^N subset mathbbR$ which satisfies
    $$sum_k=1^N a_f(k) operatornamesinc (pi k f) = 0.$$
    If this is also possible, then I would maybe add some conditions like $f$ being irrational so that no such sequence would exist.







    share|cite|improve this question






















      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      I am having problems either finding such a sequence or showing that one does not exist. Here is the situation.



      Take $f$ to be some positive real number which is not an integer.



      Recall that $operatornamesinc(x)$ is $sin(x) / x$ if $x neq 0$, and $operatornamesinc(x) := 1$.



      I would like to show that no non-zero series $a_f(k)_k=1^infty subset mathbbR$ exists which satisfies
      $$sum_k=1^infty a_f(k) operatornamesinc (pi k f) = 0.$$
      (I use non-zero to simply mean that there is at least one non-zero element of the sequence.)



      If it is possible to do this, then I would perhaps like to say that for $N$ a large positive integer, there is no sequence of numbers $a_f(k)_k=1^N subset mathbbR$ which satisfies
      $$sum_k=1^N a_f(k) operatornamesinc (pi k f) = 0.$$
      If this is also possible, then I would maybe add some conditions like $f$ being irrational so that no such sequence would exist.







      share|cite|improve this question












      I am having problems either finding such a sequence or showing that one does not exist. Here is the situation.



      Take $f$ to be some positive real number which is not an integer.



      Recall that $operatornamesinc(x)$ is $sin(x) / x$ if $x neq 0$, and $operatornamesinc(x) := 1$.



      I would like to show that no non-zero series $a_f(k)_k=1^infty subset mathbbR$ exists which satisfies
      $$sum_k=1^infty a_f(k) operatornamesinc (pi k f) = 0.$$
      (I use non-zero to simply mean that there is at least one non-zero element of the sequence.)



      If it is possible to do this, then I would perhaps like to say that for $N$ a large positive integer, there is no sequence of numbers $a_f(k)_k=1^N subset mathbbR$ which satisfies
      $$sum_k=1^N a_f(k) operatornamesinc (pi k f) = 0.$$
      If this is also possible, then I would maybe add some conditions like $f$ being irrational so that no such sequence would exist.









      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Aug 9 at 19:29









      Open Season

      770418




      770418




















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          2
          down vote



          accepted










          As a consequence of the Poisson summation formula, for any $alphainmathbbRsetminusmathbbZ$ we have
          $$ sum_kgeq 1textsinc(pi k alpha)=frac12left[-1+sum_kinmathbbZtextsinc(pi k alpha)right]=frac12left[-1+sum_sinmathbbZfractextsign(alpha-2s)+textsign(alpha+2s)2alpharight] $$
          such that for any $alphainmathbbR^+setminusmathbbZ$ we get
          $$ sum_kgeq 1textsinc(pi kalpha) = frac12left[-1+frac2lfloor alpha/2rfloor +1alpharight]neq 0. $$
          Similarly you may compute in explicit terms $sum_kgeq 1textsinc^2(pi k alpha)$. This disproves your claim for
          $$ a_f(k) = 1+ C_f,textsinc(pi k f).$$






          share|cite|improve this answer




















            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',
            convertImagesToLinks: true,
            noModals: false,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: 10,
            bindNavPrevention: true,
            postfix: "",
            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%2f2877612%2ffind-a-sequence-a-fk-so-that-sum-k-1-infty-a-fk-operatornamesinc%23new-answer', 'question_page');

            );

            Post as a guest






























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes








            up vote
            2
            down vote



            accepted










            As a consequence of the Poisson summation formula, for any $alphainmathbbRsetminusmathbbZ$ we have
            $$ sum_kgeq 1textsinc(pi k alpha)=frac12left[-1+sum_kinmathbbZtextsinc(pi k alpha)right]=frac12left[-1+sum_sinmathbbZfractextsign(alpha-2s)+textsign(alpha+2s)2alpharight] $$
            such that for any $alphainmathbbR^+setminusmathbbZ$ we get
            $$ sum_kgeq 1textsinc(pi kalpha) = frac12left[-1+frac2lfloor alpha/2rfloor +1alpharight]neq 0. $$
            Similarly you may compute in explicit terms $sum_kgeq 1textsinc^2(pi k alpha)$. This disproves your claim for
            $$ a_f(k) = 1+ C_f,textsinc(pi k f).$$






            share|cite|improve this answer
























              up vote
              2
              down vote



              accepted










              As a consequence of the Poisson summation formula, for any $alphainmathbbRsetminusmathbbZ$ we have
              $$ sum_kgeq 1textsinc(pi k alpha)=frac12left[-1+sum_kinmathbbZtextsinc(pi k alpha)right]=frac12left[-1+sum_sinmathbbZfractextsign(alpha-2s)+textsign(alpha+2s)2alpharight] $$
              such that for any $alphainmathbbR^+setminusmathbbZ$ we get
              $$ sum_kgeq 1textsinc(pi kalpha) = frac12left[-1+frac2lfloor alpha/2rfloor +1alpharight]neq 0. $$
              Similarly you may compute in explicit terms $sum_kgeq 1textsinc^2(pi k alpha)$. This disproves your claim for
              $$ a_f(k) = 1+ C_f,textsinc(pi k f).$$






              share|cite|improve this answer






















                up vote
                2
                down vote



                accepted







                up vote
                2
                down vote



                accepted






                As a consequence of the Poisson summation formula, for any $alphainmathbbRsetminusmathbbZ$ we have
                $$ sum_kgeq 1textsinc(pi k alpha)=frac12left[-1+sum_kinmathbbZtextsinc(pi k alpha)right]=frac12left[-1+sum_sinmathbbZfractextsign(alpha-2s)+textsign(alpha+2s)2alpharight] $$
                such that for any $alphainmathbbR^+setminusmathbbZ$ we get
                $$ sum_kgeq 1textsinc(pi kalpha) = frac12left[-1+frac2lfloor alpha/2rfloor +1alpharight]neq 0. $$
                Similarly you may compute in explicit terms $sum_kgeq 1textsinc^2(pi k alpha)$. This disproves your claim for
                $$ a_f(k) = 1+ C_f,textsinc(pi k f).$$






                share|cite|improve this answer












                As a consequence of the Poisson summation formula, for any $alphainmathbbRsetminusmathbbZ$ we have
                $$ sum_kgeq 1textsinc(pi k alpha)=frac12left[-1+sum_kinmathbbZtextsinc(pi k alpha)right]=frac12left[-1+sum_sinmathbbZfractextsign(alpha-2s)+textsign(alpha+2s)2alpharight] $$
                such that for any $alphainmathbbR^+setminusmathbbZ$ we get
                $$ sum_kgeq 1textsinc(pi kalpha) = frac12left[-1+frac2lfloor alpha/2rfloor +1alpharight]neq 0. $$
                Similarly you may compute in explicit terms $sum_kgeq 1textsinc^2(pi k alpha)$. This disproves your claim for
                $$ a_f(k) = 1+ C_f,textsinc(pi k f).$$







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Aug 9 at 20:28









                Jack D'Aurizio♦

                271k31266631




                271k31266631






















                     

                    draft saved


                    draft discarded


























                     


                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function ()
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2877612%2ffind-a-sequence-a-fk-so-that-sum-k-1-infty-a-fk-operatornamesinc%23new-answer', 'question_page');

                    );

                    Post as a guest













































































                    這個網誌中的熱門文章

                    How to combine Bézier curves to a surface?

                    Carbon dioxide

                    Why am i infinitely getting the same tweet with the Twitter Search API?