Supremum of oscillations from Gibbs phenomenon












2












$begingroup$


The Fourier series $sum_{n=1}^infty frac{sin(nx)}{n}$ converges to $f(x) =(pi-x)/2$ for $0 < x < 2pi$ and to $0$ for $x=0$. I'm interested to understand the Gibbs phenomena of overshooting partial sums near $x = 0.$



I would like to find in closed form:



$$sup_{x in [0,pi], n in mathbb{N}},,left|sum_{k=1}^n frac{sin(kx)}{k}right|.$$



I know how to find uniform bounds that are not sharp by working with partial sums. So to get the supremum I think I should use the representation of partial sums in terms of Dirichlet kernel.



Defining $S_n(x) = sum_{k=1}^n frac{sin(kx)}{k}$, and taking the derivative and integrating I get



$$S_n'(x) = sum_{k=1}^n cos(kx) = -frac{1}{2}+ frac{sin[(n+1/2)x]}{2 sin(x/2)}$$



$$S_n(x) = -frac{x}{2} + int_0^x frac{sin[(n+1/2)t]}{2 sin(t/2)} dt$$



How can I find the supremum for $x in [0,pi]$ and $n in mathbb{N}$?










share|cite|improve this question









$endgroup$

















    2












    $begingroup$


    The Fourier series $sum_{n=1}^infty frac{sin(nx)}{n}$ converges to $f(x) =(pi-x)/2$ for $0 < x < 2pi$ and to $0$ for $x=0$. I'm interested to understand the Gibbs phenomena of overshooting partial sums near $x = 0.$



    I would like to find in closed form:



    $$sup_{x in [0,pi], n in mathbb{N}},,left|sum_{k=1}^n frac{sin(kx)}{k}right|.$$



    I know how to find uniform bounds that are not sharp by working with partial sums. So to get the supremum I think I should use the representation of partial sums in terms of Dirichlet kernel.



    Defining $S_n(x) = sum_{k=1}^n frac{sin(kx)}{k}$, and taking the derivative and integrating I get



    $$S_n'(x) = sum_{k=1}^n cos(kx) = -frac{1}{2}+ frac{sin[(n+1/2)x]}{2 sin(x/2)}$$



    $$S_n(x) = -frac{x}{2} + int_0^x frac{sin[(n+1/2)t]}{2 sin(t/2)} dt$$



    How can I find the supremum for $x in [0,pi]$ and $n in mathbb{N}$?










    share|cite|improve this question









    $endgroup$















      2












      2








      2


      1



      $begingroup$


      The Fourier series $sum_{n=1}^infty frac{sin(nx)}{n}$ converges to $f(x) =(pi-x)/2$ for $0 < x < 2pi$ and to $0$ for $x=0$. I'm interested to understand the Gibbs phenomena of overshooting partial sums near $x = 0.$



      I would like to find in closed form:



      $$sup_{x in [0,pi], n in mathbb{N}},,left|sum_{k=1}^n frac{sin(kx)}{k}right|.$$



      I know how to find uniform bounds that are not sharp by working with partial sums. So to get the supremum I think I should use the representation of partial sums in terms of Dirichlet kernel.



      Defining $S_n(x) = sum_{k=1}^n frac{sin(kx)}{k}$, and taking the derivative and integrating I get



      $$S_n'(x) = sum_{k=1}^n cos(kx) = -frac{1}{2}+ frac{sin[(n+1/2)x]}{2 sin(x/2)}$$



      $$S_n(x) = -frac{x}{2} + int_0^x frac{sin[(n+1/2)t]}{2 sin(t/2)} dt$$



      How can I find the supremum for $x in [0,pi]$ and $n in mathbb{N}$?










      share|cite|improve this question









      $endgroup$




      The Fourier series $sum_{n=1}^infty frac{sin(nx)}{n}$ converges to $f(x) =(pi-x)/2$ for $0 < x < 2pi$ and to $0$ for $x=0$. I'm interested to understand the Gibbs phenomena of overshooting partial sums near $x = 0.$



      I would like to find in closed form:



      $$sup_{x in [0,pi], n in mathbb{N}},,left|sum_{k=1}^n frac{sin(kx)}{k}right|.$$



      I know how to find uniform bounds that are not sharp by working with partial sums. So to get the supremum I think I should use the representation of partial sums in terms of Dirichlet kernel.



      Defining $S_n(x) = sum_{k=1}^n frac{sin(kx)}{k}$, and taking the derivative and integrating I get



      $$S_n'(x) = sum_{k=1}^n cos(kx) = -frac{1}{2}+ frac{sin[(n+1/2)x]}{2 sin(x/2)}$$



      $$S_n(x) = -frac{x}{2} + int_0^x frac{sin[(n+1/2)t]}{2 sin(t/2)} dt$$



      How can I find the supremum for $x in [0,pi]$ and $n in mathbb{N}$?







      fourier-series






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Dec 31 '18 at 18:56









      SASSAS

      404310




      404310






















          1 Answer
          1






          active

          oldest

          votes


















          1












          $begingroup$

          This is a Fourier series of a sawtoooth wave. I'm not sure that you can precisely specify that supremum in closed form. However, the essential aspect of Gibbs phenomenon to "understand" here is that the partial sums will oscillate and overshoot the crest of the wave $pi/2$ near the discontinuity at $x = 0$. We can show that



          $$limsup_{n to infty} sup_{x in [0,pi]}S_n(x) > frac{pi}{2}$$



          First note that since $sin t$ alternates sign on intervals $[(k-1)pi, kpi],$



          $$F(x) = int_0^x frac{sin t}{t} , dt $$



          has relative maxima and minima at $pi,2pi, dots$ and an absolute maximum value of $F(pi)approx 1.85 > pi/2.$



          Expressing the partial sum in terms of this integral will prove to be easier for analyzing the overshooting oscillations.



          Starting with your last equation we have for $x in[0,pi],$



          $$tag{*}begin{align}S_n(x) &= -frac{x}{2} + int_0^x frac{sin left(n + frac{1}{2}right)t}{2 sin frac{t}{2}}, dt \ &= -frac{x}{2} + int_0^x frac{sin nt}{t} , dt + int_0^x left( frac{sin left(n + frac{1}{2} right)t}{2 sin frac{t}{2}} - frac{sin nt}{t}, right), dt \ &=-frac{x}{2} + int_0^{nx} frac{sin t}{t} , dt + R_n(x) end{align}$$



          where a variable change $nt to t$ has been applied and the remainder can be manipulated as



          $$begin{align} R_n(x) &= int_0^x left( frac{sin left(n + frac{1}{2} right)t}{2 sin frac{t}{2}} - frac{sin nt}{t}, right), dt \ &= int_0^x left( frac{sin ntcos frac{t}{2} + sinfrac{t}{2} cos nt}{2 sin frac{t}{2}} - frac{sin nt}{t}, right), dt \&= int_0^x left(frac{1}{2tan frac{t}{2}} - frac{1}{t} right)sin nt + frac{1}{2}int_0^x cos nt , dt \ &= int_0^x left(frac{1}{2tan frac{t}{2}} - frac{1}{t} right)sin nt + frac{sin nx}{2n}end{align}$$



          Using the Riemann-Lebesgue lemma we see that $R_n(x) to 0$ as $n to infty$ and it can be shown (with some effort) that the convergence is uniform for $x in [0,pi]$. For any $epsilon > 0$ we have $|R_n(x)| < epsilon$ for all sufficiently large $n$ and all $x in [0,pi]$ and taking $x = pi/n$ we have



          $$sup_{x in [0,pi]} S_n(x) > -frac{pi}{2n} + int_0^pi frac{sin t}{t} , dt - epsilon$$



          Since $epsilon$ can be arbitrarily close to $0$ we get



          $$limsup_{n to infty}sup_{x in [0,pi]} S_n(x) > int_0^pi frac{sin t}{t} , dt approx 1.85 > frac{pi}{2}$$






          share|cite|improve this answer









          $endgroup$













            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%2f3057958%2fsupremum-of-oscillations-from-gibbs-phenomenon%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$

            This is a Fourier series of a sawtoooth wave. I'm not sure that you can precisely specify that supremum in closed form. However, the essential aspect of Gibbs phenomenon to "understand" here is that the partial sums will oscillate and overshoot the crest of the wave $pi/2$ near the discontinuity at $x = 0$. We can show that



            $$limsup_{n to infty} sup_{x in [0,pi]}S_n(x) > frac{pi}{2}$$



            First note that since $sin t$ alternates sign on intervals $[(k-1)pi, kpi],$



            $$F(x) = int_0^x frac{sin t}{t} , dt $$



            has relative maxima and minima at $pi,2pi, dots$ and an absolute maximum value of $F(pi)approx 1.85 > pi/2.$



            Expressing the partial sum in terms of this integral will prove to be easier for analyzing the overshooting oscillations.



            Starting with your last equation we have for $x in[0,pi],$



            $$tag{*}begin{align}S_n(x) &= -frac{x}{2} + int_0^x frac{sin left(n + frac{1}{2}right)t}{2 sin frac{t}{2}}, dt \ &= -frac{x}{2} + int_0^x frac{sin nt}{t} , dt + int_0^x left( frac{sin left(n + frac{1}{2} right)t}{2 sin frac{t}{2}} - frac{sin nt}{t}, right), dt \ &=-frac{x}{2} + int_0^{nx} frac{sin t}{t} , dt + R_n(x) end{align}$$



            where a variable change $nt to t$ has been applied and the remainder can be manipulated as



            $$begin{align} R_n(x) &= int_0^x left( frac{sin left(n + frac{1}{2} right)t}{2 sin frac{t}{2}} - frac{sin nt}{t}, right), dt \ &= int_0^x left( frac{sin ntcos frac{t}{2} + sinfrac{t}{2} cos nt}{2 sin frac{t}{2}} - frac{sin nt}{t}, right), dt \&= int_0^x left(frac{1}{2tan frac{t}{2}} - frac{1}{t} right)sin nt + frac{1}{2}int_0^x cos nt , dt \ &= int_0^x left(frac{1}{2tan frac{t}{2}} - frac{1}{t} right)sin nt + frac{sin nx}{2n}end{align}$$



            Using the Riemann-Lebesgue lemma we see that $R_n(x) to 0$ as $n to infty$ and it can be shown (with some effort) that the convergence is uniform for $x in [0,pi]$. For any $epsilon > 0$ we have $|R_n(x)| < epsilon$ for all sufficiently large $n$ and all $x in [0,pi]$ and taking $x = pi/n$ we have



            $$sup_{x in [0,pi]} S_n(x) > -frac{pi}{2n} + int_0^pi frac{sin t}{t} , dt - epsilon$$



            Since $epsilon$ can be arbitrarily close to $0$ we get



            $$limsup_{n to infty}sup_{x in [0,pi]} S_n(x) > int_0^pi frac{sin t}{t} , dt approx 1.85 > frac{pi}{2}$$






            share|cite|improve this answer









            $endgroup$


















              1












              $begingroup$

              This is a Fourier series of a sawtoooth wave. I'm not sure that you can precisely specify that supremum in closed form. However, the essential aspect of Gibbs phenomenon to "understand" here is that the partial sums will oscillate and overshoot the crest of the wave $pi/2$ near the discontinuity at $x = 0$. We can show that



              $$limsup_{n to infty} sup_{x in [0,pi]}S_n(x) > frac{pi}{2}$$



              First note that since $sin t$ alternates sign on intervals $[(k-1)pi, kpi],$



              $$F(x) = int_0^x frac{sin t}{t} , dt $$



              has relative maxima and minima at $pi,2pi, dots$ and an absolute maximum value of $F(pi)approx 1.85 > pi/2.$



              Expressing the partial sum in terms of this integral will prove to be easier for analyzing the overshooting oscillations.



              Starting with your last equation we have for $x in[0,pi],$



              $$tag{*}begin{align}S_n(x) &= -frac{x}{2} + int_0^x frac{sin left(n + frac{1}{2}right)t}{2 sin frac{t}{2}}, dt \ &= -frac{x}{2} + int_0^x frac{sin nt}{t} , dt + int_0^x left( frac{sin left(n + frac{1}{2} right)t}{2 sin frac{t}{2}} - frac{sin nt}{t}, right), dt \ &=-frac{x}{2} + int_0^{nx} frac{sin t}{t} , dt + R_n(x) end{align}$$



              where a variable change $nt to t$ has been applied and the remainder can be manipulated as



              $$begin{align} R_n(x) &= int_0^x left( frac{sin left(n + frac{1}{2} right)t}{2 sin frac{t}{2}} - frac{sin nt}{t}, right), dt \ &= int_0^x left( frac{sin ntcos frac{t}{2} + sinfrac{t}{2} cos nt}{2 sin frac{t}{2}} - frac{sin nt}{t}, right), dt \&= int_0^x left(frac{1}{2tan frac{t}{2}} - frac{1}{t} right)sin nt + frac{1}{2}int_0^x cos nt , dt \ &= int_0^x left(frac{1}{2tan frac{t}{2}} - frac{1}{t} right)sin nt + frac{sin nx}{2n}end{align}$$



              Using the Riemann-Lebesgue lemma we see that $R_n(x) to 0$ as $n to infty$ and it can be shown (with some effort) that the convergence is uniform for $x in [0,pi]$. For any $epsilon > 0$ we have $|R_n(x)| < epsilon$ for all sufficiently large $n$ and all $x in [0,pi]$ and taking $x = pi/n$ we have



              $$sup_{x in [0,pi]} S_n(x) > -frac{pi}{2n} + int_0^pi frac{sin t}{t} , dt - epsilon$$



              Since $epsilon$ can be arbitrarily close to $0$ we get



              $$limsup_{n to infty}sup_{x in [0,pi]} S_n(x) > int_0^pi frac{sin t}{t} , dt approx 1.85 > frac{pi}{2}$$






              share|cite|improve this answer









              $endgroup$
















                1












                1








                1





                $begingroup$

                This is a Fourier series of a sawtoooth wave. I'm not sure that you can precisely specify that supremum in closed form. However, the essential aspect of Gibbs phenomenon to "understand" here is that the partial sums will oscillate and overshoot the crest of the wave $pi/2$ near the discontinuity at $x = 0$. We can show that



                $$limsup_{n to infty} sup_{x in [0,pi]}S_n(x) > frac{pi}{2}$$



                First note that since $sin t$ alternates sign on intervals $[(k-1)pi, kpi],$



                $$F(x) = int_0^x frac{sin t}{t} , dt $$



                has relative maxima and minima at $pi,2pi, dots$ and an absolute maximum value of $F(pi)approx 1.85 > pi/2.$



                Expressing the partial sum in terms of this integral will prove to be easier for analyzing the overshooting oscillations.



                Starting with your last equation we have for $x in[0,pi],$



                $$tag{*}begin{align}S_n(x) &= -frac{x}{2} + int_0^x frac{sin left(n + frac{1}{2}right)t}{2 sin frac{t}{2}}, dt \ &= -frac{x}{2} + int_0^x frac{sin nt}{t} , dt + int_0^x left( frac{sin left(n + frac{1}{2} right)t}{2 sin frac{t}{2}} - frac{sin nt}{t}, right), dt \ &=-frac{x}{2} + int_0^{nx} frac{sin t}{t} , dt + R_n(x) end{align}$$



                where a variable change $nt to t$ has been applied and the remainder can be manipulated as



                $$begin{align} R_n(x) &= int_0^x left( frac{sin left(n + frac{1}{2} right)t}{2 sin frac{t}{2}} - frac{sin nt}{t}, right), dt \ &= int_0^x left( frac{sin ntcos frac{t}{2} + sinfrac{t}{2} cos nt}{2 sin frac{t}{2}} - frac{sin nt}{t}, right), dt \&= int_0^x left(frac{1}{2tan frac{t}{2}} - frac{1}{t} right)sin nt + frac{1}{2}int_0^x cos nt , dt \ &= int_0^x left(frac{1}{2tan frac{t}{2}} - frac{1}{t} right)sin nt + frac{sin nx}{2n}end{align}$$



                Using the Riemann-Lebesgue lemma we see that $R_n(x) to 0$ as $n to infty$ and it can be shown (with some effort) that the convergence is uniform for $x in [0,pi]$. For any $epsilon > 0$ we have $|R_n(x)| < epsilon$ for all sufficiently large $n$ and all $x in [0,pi]$ and taking $x = pi/n$ we have



                $$sup_{x in [0,pi]} S_n(x) > -frac{pi}{2n} + int_0^pi frac{sin t}{t} , dt - epsilon$$



                Since $epsilon$ can be arbitrarily close to $0$ we get



                $$limsup_{n to infty}sup_{x in [0,pi]} S_n(x) > int_0^pi frac{sin t}{t} , dt approx 1.85 > frac{pi}{2}$$






                share|cite|improve this answer









                $endgroup$



                This is a Fourier series of a sawtoooth wave. I'm not sure that you can precisely specify that supremum in closed form. However, the essential aspect of Gibbs phenomenon to "understand" here is that the partial sums will oscillate and overshoot the crest of the wave $pi/2$ near the discontinuity at $x = 0$. We can show that



                $$limsup_{n to infty} sup_{x in [0,pi]}S_n(x) > frac{pi}{2}$$



                First note that since $sin t$ alternates sign on intervals $[(k-1)pi, kpi],$



                $$F(x) = int_0^x frac{sin t}{t} , dt $$



                has relative maxima and minima at $pi,2pi, dots$ and an absolute maximum value of $F(pi)approx 1.85 > pi/2.$



                Expressing the partial sum in terms of this integral will prove to be easier for analyzing the overshooting oscillations.



                Starting with your last equation we have for $x in[0,pi],$



                $$tag{*}begin{align}S_n(x) &= -frac{x}{2} + int_0^x frac{sin left(n + frac{1}{2}right)t}{2 sin frac{t}{2}}, dt \ &= -frac{x}{2} + int_0^x frac{sin nt}{t} , dt + int_0^x left( frac{sin left(n + frac{1}{2} right)t}{2 sin frac{t}{2}} - frac{sin nt}{t}, right), dt \ &=-frac{x}{2} + int_0^{nx} frac{sin t}{t} , dt + R_n(x) end{align}$$



                where a variable change $nt to t$ has been applied and the remainder can be manipulated as



                $$begin{align} R_n(x) &= int_0^x left( frac{sin left(n + frac{1}{2} right)t}{2 sin frac{t}{2}} - frac{sin nt}{t}, right), dt \ &= int_0^x left( frac{sin ntcos frac{t}{2} + sinfrac{t}{2} cos nt}{2 sin frac{t}{2}} - frac{sin nt}{t}, right), dt \&= int_0^x left(frac{1}{2tan frac{t}{2}} - frac{1}{t} right)sin nt + frac{1}{2}int_0^x cos nt , dt \ &= int_0^x left(frac{1}{2tan frac{t}{2}} - frac{1}{t} right)sin nt + frac{sin nx}{2n}end{align}$$



                Using the Riemann-Lebesgue lemma we see that $R_n(x) to 0$ as $n to infty$ and it can be shown (with some effort) that the convergence is uniform for $x in [0,pi]$. For any $epsilon > 0$ we have $|R_n(x)| < epsilon$ for all sufficiently large $n$ and all $x in [0,pi]$ and taking $x = pi/n$ we have



                $$sup_{x in [0,pi]} S_n(x) > -frac{pi}{2n} + int_0^pi frac{sin t}{t} , dt - epsilon$$



                Since $epsilon$ can be arbitrarily close to $0$ we get



                $$limsup_{n to infty}sup_{x in [0,pi]} S_n(x) > int_0^pi frac{sin t}{t} , dt approx 1.85 > frac{pi}{2}$$







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Feb 2 at 0:36









                RRLRRL

                52k42573




                52k42573






























                    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%2f3057958%2fsupremum-of-oscillations-from-gibbs-phenomenon%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