Sequence of Functions and Total Variation Announcing the arrival of Valued Associate #679:...

Was credit for the black hole image misattributed?

New Order #5: where Fibonacci and Beatty meet at Wythoff

Blender game recording at the wrong time

Did the new image of black hole confirm the general theory of relativity?

Simulating Exploding Dice

Is there a service that would inform me whenever a new direct route is scheduled from a given airport?

Geometric mean and geometric standard deviation

How do I automatically answer y in bash script?

Statistical model of ligand substitution

Direct Experience of Meditation

Limit for e and 1/e

What do you call the holes in a flute?

Single author papers against my advisor's will?

Can smartphones with the same camera sensor have different image quality?

Fishing simulator

If I can make up priors, why can't I make up posteriors?

Why is there no army of Iron-Mans in the MCU?

What's the difference between (size_t)-1 and ~0?

What was the last x86 CPU that did not have the x87 floating-point unit built in?

Need a suitable toxic chemical for a murder plot in my novel

Stars Make Stars

What can I do if my MacBook isn’t charging but already ran out?

Classification of bundles, Postnikov towers, obstruction theory, local coefficients

Unable to start mainnet node docker container



Sequence of Functions and Total Variation



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)liminf and limsup of a sequence (II)Proving the limit of the supremum equals the limit of the infimumTotal Variation and indefinite integralsHelp with understanding a proof involving limsup and liminfQuestion on Bounded Variation involving partitionsTotal variation of a sequence of functionsTotal variation measure vs. total variation functionBounded sequence implies existence of $limsup$ and $liminf$Question about computing variation of some functions$|f|^p$ is a function of bounded variation…












1












$begingroup$


Let $(f_{n})$ be a sequence of functions such that $f(x)=lim f_{n}(x)$ for every $xin[a,b]$. Show that
$$V_{f}(a,b)leq liminf V_{f_{n}}(a,b).
$$

I'll try to write what I have done so far...



As $V_{f}(a,b)=sup{sum(f,P): Pinmathscr{P}([a,b])}$, then for all $epsilon>0$, there is a partition $P={x_{0}, x_{1},...,x_{m}}inmathscr{P}([a,b])$ such that $V_{f}(a,b)-epsilon/2<sum(f,P)$.



As $(f_{n})$ be a sequence of functions such that $f(x)=lim f_{n}(x)$ for every $xin[a,b]$, then there is $Ninmathbb{N}$ such that if $Nleq n$, then $|f_{n}(x)-f(x)|<epsilon/4m$ for every $xin [a,b]$.



Thus if $N=max{ N_{0}, N_{1},...,N_{m}}leq n$ we have
$$
begin{split}
V_{f}(a,b)-epsilon/2&<sum(f,P)=sum_{k=1}^{m}|f(x_{k})-f(x_{k-1})|\
&leq sum_{k=1}^{m}|f_{n}(x_{k})-f(x_{k})|+sum_{k=1}^{m}|f_{n}(x_{k-1})-f(x_{k-1})|+sum_{k=1}^{m}|f_{n}(x_{k})-f_{n}(x_{k-1})|\
&leq sum_{k=1}^{m}epsilon/4m + sum_{k=1}^{m}epsilon/4m + sum_{k=1}^{m}|f_{n}(x_{k})-f_{n}(x_{k-1})|\
&= mepsilon/4m + mepsilon/4m + sum_{k=1}^{m}|f_{n}(x_{k})-f_{n}(x_{k-1})|\
&= epsilon/2 +sum_{k=1}^{m}|f_{n}(x_{k})-f_{n}(x_{k-1})|\
&leq epsilon/2 + V_{f_{n}}(a,b).
end{split}
$$



Hence if $Nleq n$, we have $V_{f}(a,b)<epsilon + V_{f_{n}}(a,b)$



I don't know what else to do ...










share|cite|improve this question











$endgroup$

















    1












    $begingroup$


    Let $(f_{n})$ be a sequence of functions such that $f(x)=lim f_{n}(x)$ for every $xin[a,b]$. Show that
    $$V_{f}(a,b)leq liminf V_{f_{n}}(a,b).
    $$

    I'll try to write what I have done so far...



    As $V_{f}(a,b)=sup{sum(f,P): Pinmathscr{P}([a,b])}$, then for all $epsilon>0$, there is a partition $P={x_{0}, x_{1},...,x_{m}}inmathscr{P}([a,b])$ such that $V_{f}(a,b)-epsilon/2<sum(f,P)$.



    As $(f_{n})$ be a sequence of functions such that $f(x)=lim f_{n}(x)$ for every $xin[a,b]$, then there is $Ninmathbb{N}$ such that if $Nleq n$, then $|f_{n}(x)-f(x)|<epsilon/4m$ for every $xin [a,b]$.



    Thus if $N=max{ N_{0}, N_{1},...,N_{m}}leq n$ we have
    $$
    begin{split}
    V_{f}(a,b)-epsilon/2&<sum(f,P)=sum_{k=1}^{m}|f(x_{k})-f(x_{k-1})|\
    &leq sum_{k=1}^{m}|f_{n}(x_{k})-f(x_{k})|+sum_{k=1}^{m}|f_{n}(x_{k-1})-f(x_{k-1})|+sum_{k=1}^{m}|f_{n}(x_{k})-f_{n}(x_{k-1})|\
    &leq sum_{k=1}^{m}epsilon/4m + sum_{k=1}^{m}epsilon/4m + sum_{k=1}^{m}|f_{n}(x_{k})-f_{n}(x_{k-1})|\
    &= mepsilon/4m + mepsilon/4m + sum_{k=1}^{m}|f_{n}(x_{k})-f_{n}(x_{k-1})|\
    &= epsilon/2 +sum_{k=1}^{m}|f_{n}(x_{k})-f_{n}(x_{k-1})|\
    &leq epsilon/2 + V_{f_{n}}(a,b).
    end{split}
    $$



    Hence if $Nleq n$, we have $V_{f}(a,b)<epsilon + V_{f_{n}}(a,b)$



    I don't know what else to do ...










    share|cite|improve this question











    $endgroup$















      1












      1








      1





      $begingroup$


      Let $(f_{n})$ be a sequence of functions such that $f(x)=lim f_{n}(x)$ for every $xin[a,b]$. Show that
      $$V_{f}(a,b)leq liminf V_{f_{n}}(a,b).
      $$

      I'll try to write what I have done so far...



      As $V_{f}(a,b)=sup{sum(f,P): Pinmathscr{P}([a,b])}$, then for all $epsilon>0$, there is a partition $P={x_{0}, x_{1},...,x_{m}}inmathscr{P}([a,b])$ such that $V_{f}(a,b)-epsilon/2<sum(f,P)$.



      As $(f_{n})$ be a sequence of functions such that $f(x)=lim f_{n}(x)$ for every $xin[a,b]$, then there is $Ninmathbb{N}$ such that if $Nleq n$, then $|f_{n}(x)-f(x)|<epsilon/4m$ for every $xin [a,b]$.



      Thus if $N=max{ N_{0}, N_{1},...,N_{m}}leq n$ we have
      $$
      begin{split}
      V_{f}(a,b)-epsilon/2&<sum(f,P)=sum_{k=1}^{m}|f(x_{k})-f(x_{k-1})|\
      &leq sum_{k=1}^{m}|f_{n}(x_{k})-f(x_{k})|+sum_{k=1}^{m}|f_{n}(x_{k-1})-f(x_{k-1})|+sum_{k=1}^{m}|f_{n}(x_{k})-f_{n}(x_{k-1})|\
      &leq sum_{k=1}^{m}epsilon/4m + sum_{k=1}^{m}epsilon/4m + sum_{k=1}^{m}|f_{n}(x_{k})-f_{n}(x_{k-1})|\
      &= mepsilon/4m + mepsilon/4m + sum_{k=1}^{m}|f_{n}(x_{k})-f_{n}(x_{k-1})|\
      &= epsilon/2 +sum_{k=1}^{m}|f_{n}(x_{k})-f_{n}(x_{k-1})|\
      &leq epsilon/2 + V_{f_{n}}(a,b).
      end{split}
      $$



      Hence if $Nleq n$, we have $V_{f}(a,b)<epsilon + V_{f_{n}}(a,b)$



      I don't know what else to do ...










      share|cite|improve this question











      $endgroup$




      Let $(f_{n})$ be a sequence of functions such that $f(x)=lim f_{n}(x)$ for every $xin[a,b]$. Show that
      $$V_{f}(a,b)leq liminf V_{f_{n}}(a,b).
      $$

      I'll try to write what I have done so far...



      As $V_{f}(a,b)=sup{sum(f,P): Pinmathscr{P}([a,b])}$, then for all $epsilon>0$, there is a partition $P={x_{0}, x_{1},...,x_{m}}inmathscr{P}([a,b])$ such that $V_{f}(a,b)-epsilon/2<sum(f,P)$.



      As $(f_{n})$ be a sequence of functions such that $f(x)=lim f_{n}(x)$ for every $xin[a,b]$, then there is $Ninmathbb{N}$ such that if $Nleq n$, then $|f_{n}(x)-f(x)|<epsilon/4m$ for every $xin [a,b]$.



      Thus if $N=max{ N_{0}, N_{1},...,N_{m}}leq n$ we have
      $$
      begin{split}
      V_{f}(a,b)-epsilon/2&<sum(f,P)=sum_{k=1}^{m}|f(x_{k})-f(x_{k-1})|\
      &leq sum_{k=1}^{m}|f_{n}(x_{k})-f(x_{k})|+sum_{k=1}^{m}|f_{n}(x_{k-1})-f(x_{k-1})|+sum_{k=1}^{m}|f_{n}(x_{k})-f_{n}(x_{k-1})|\
      &leq sum_{k=1}^{m}epsilon/4m + sum_{k=1}^{m}epsilon/4m + sum_{k=1}^{m}|f_{n}(x_{k})-f_{n}(x_{k-1})|\
      &= mepsilon/4m + mepsilon/4m + sum_{k=1}^{m}|f_{n}(x_{k})-f_{n}(x_{k-1})|\
      &= epsilon/2 +sum_{k=1}^{m}|f_{n}(x_{k})-f_{n}(x_{k-1})|\
      &leq epsilon/2 + V_{f_{n}}(a,b).
      end{split}
      $$



      Hence if $Nleq n$, we have $V_{f}(a,b)<epsilon + V_{f_{n}}(a,b)$



      I don't know what else to do ...







      real-analysis bounded-variation






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Mar 23 at 11:43









      Daniele Tampieri

      2,74721022




      2,74721022










      asked Oct 8 '18 at 3:23









      DarkmasterDarkmaster

      868




      868






















          1 Answer
          1






          active

          oldest

          votes


















          0












          $begingroup$

          You have shown that for any $epsilon > 0$, there exists $N$ (depending on $epsilon$ and some fixed partition $P$) such that for all $n geqslant N$ we have $V_f(a,b) - epsilon < V_{f_n}(a,b)$.



          Hence,



          $$V_f(a,b) - epsilon < inf_{k geqslant n} V_{f_k}(a,b) leqslant sup_{n geqslant N}inf_{k geqslant n} V_{f_k}(a,b) leqslant sup_{n in mathbb{N}}inf_{k geqslant n} V_{f_k}(a,b) = liminf_{n to infty}, V_{f_n}(a,b)$$



          Since $epsilon > 0$ can be arbitrarily close to $0$ it follows that



          $$V_f(a,b) leqslant liminf_{n to infty}, V_{f_n}(a,b)$$



          For a somewhat shorter proof note that if $liminf_{n to infty}, V_{f_n}(a,b) = alpha < infty$ then for any $epsilon > 0$ there must be a subsequence $n_j$ such that $V_{f_{n_j}}(a,b) < alpha + epsilon$. For any partition we have



          $$sum_{k=1}^n|f_{n_j}(x_k)- f_{n_j}(x_{k-1})| leqslant V_{f_{n_j}}(a,b) + epsilon< alpha + epsilon$$



          Taking the limit of the LHS as $j to infty$ we have



          $$sum_{k=1}^n|f_{n_j}(x_k)- f_{n_j}(x_{k-1})| leqslant alpha + epsilon,$$



          and again, since $epsilon$ is arbitrary, the desired conclusion follows.



          The case where $liminf_{n to infty}, V_{f_n}(a,b) = +infty$ is trivial.






          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%2f2946607%2fsequence-of-functions-and-total-variation%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









            0












            $begingroup$

            You have shown that for any $epsilon > 0$, there exists $N$ (depending on $epsilon$ and some fixed partition $P$) such that for all $n geqslant N$ we have $V_f(a,b) - epsilon < V_{f_n}(a,b)$.



            Hence,



            $$V_f(a,b) - epsilon < inf_{k geqslant n} V_{f_k}(a,b) leqslant sup_{n geqslant N}inf_{k geqslant n} V_{f_k}(a,b) leqslant sup_{n in mathbb{N}}inf_{k geqslant n} V_{f_k}(a,b) = liminf_{n to infty}, V_{f_n}(a,b)$$



            Since $epsilon > 0$ can be arbitrarily close to $0$ it follows that



            $$V_f(a,b) leqslant liminf_{n to infty}, V_{f_n}(a,b)$$



            For a somewhat shorter proof note that if $liminf_{n to infty}, V_{f_n}(a,b) = alpha < infty$ then for any $epsilon > 0$ there must be a subsequence $n_j$ such that $V_{f_{n_j}}(a,b) < alpha + epsilon$. For any partition we have



            $$sum_{k=1}^n|f_{n_j}(x_k)- f_{n_j}(x_{k-1})| leqslant V_{f_{n_j}}(a,b) + epsilon< alpha + epsilon$$



            Taking the limit of the LHS as $j to infty$ we have



            $$sum_{k=1}^n|f_{n_j}(x_k)- f_{n_j}(x_{k-1})| leqslant alpha + epsilon,$$



            and again, since $epsilon$ is arbitrary, the desired conclusion follows.



            The case where $liminf_{n to infty}, V_{f_n}(a,b) = +infty$ is trivial.






            share|cite|improve this answer











            $endgroup$


















              0












              $begingroup$

              You have shown that for any $epsilon > 0$, there exists $N$ (depending on $epsilon$ and some fixed partition $P$) such that for all $n geqslant N$ we have $V_f(a,b) - epsilon < V_{f_n}(a,b)$.



              Hence,



              $$V_f(a,b) - epsilon < inf_{k geqslant n} V_{f_k}(a,b) leqslant sup_{n geqslant N}inf_{k geqslant n} V_{f_k}(a,b) leqslant sup_{n in mathbb{N}}inf_{k geqslant n} V_{f_k}(a,b) = liminf_{n to infty}, V_{f_n}(a,b)$$



              Since $epsilon > 0$ can be arbitrarily close to $0$ it follows that



              $$V_f(a,b) leqslant liminf_{n to infty}, V_{f_n}(a,b)$$



              For a somewhat shorter proof note that if $liminf_{n to infty}, V_{f_n}(a,b) = alpha < infty$ then for any $epsilon > 0$ there must be a subsequence $n_j$ such that $V_{f_{n_j}}(a,b) < alpha + epsilon$. For any partition we have



              $$sum_{k=1}^n|f_{n_j}(x_k)- f_{n_j}(x_{k-1})| leqslant V_{f_{n_j}}(a,b) + epsilon< alpha + epsilon$$



              Taking the limit of the LHS as $j to infty$ we have



              $$sum_{k=1}^n|f_{n_j}(x_k)- f_{n_j}(x_{k-1})| leqslant alpha + epsilon,$$



              and again, since $epsilon$ is arbitrary, the desired conclusion follows.



              The case where $liminf_{n to infty}, V_{f_n}(a,b) = +infty$ is trivial.






              share|cite|improve this answer











              $endgroup$
















                0












                0








                0





                $begingroup$

                You have shown that for any $epsilon > 0$, there exists $N$ (depending on $epsilon$ and some fixed partition $P$) such that for all $n geqslant N$ we have $V_f(a,b) - epsilon < V_{f_n}(a,b)$.



                Hence,



                $$V_f(a,b) - epsilon < inf_{k geqslant n} V_{f_k}(a,b) leqslant sup_{n geqslant N}inf_{k geqslant n} V_{f_k}(a,b) leqslant sup_{n in mathbb{N}}inf_{k geqslant n} V_{f_k}(a,b) = liminf_{n to infty}, V_{f_n}(a,b)$$



                Since $epsilon > 0$ can be arbitrarily close to $0$ it follows that



                $$V_f(a,b) leqslant liminf_{n to infty}, V_{f_n}(a,b)$$



                For a somewhat shorter proof note that if $liminf_{n to infty}, V_{f_n}(a,b) = alpha < infty$ then for any $epsilon > 0$ there must be a subsequence $n_j$ such that $V_{f_{n_j}}(a,b) < alpha + epsilon$. For any partition we have



                $$sum_{k=1}^n|f_{n_j}(x_k)- f_{n_j}(x_{k-1})| leqslant V_{f_{n_j}}(a,b) + epsilon< alpha + epsilon$$



                Taking the limit of the LHS as $j to infty$ we have



                $$sum_{k=1}^n|f_{n_j}(x_k)- f_{n_j}(x_{k-1})| leqslant alpha + epsilon,$$



                and again, since $epsilon$ is arbitrary, the desired conclusion follows.



                The case where $liminf_{n to infty}, V_{f_n}(a,b) = +infty$ is trivial.






                share|cite|improve this answer











                $endgroup$



                You have shown that for any $epsilon > 0$, there exists $N$ (depending on $epsilon$ and some fixed partition $P$) such that for all $n geqslant N$ we have $V_f(a,b) - epsilon < V_{f_n}(a,b)$.



                Hence,



                $$V_f(a,b) - epsilon < inf_{k geqslant n} V_{f_k}(a,b) leqslant sup_{n geqslant N}inf_{k geqslant n} V_{f_k}(a,b) leqslant sup_{n in mathbb{N}}inf_{k geqslant n} V_{f_k}(a,b) = liminf_{n to infty}, V_{f_n}(a,b)$$



                Since $epsilon > 0$ can be arbitrarily close to $0$ it follows that



                $$V_f(a,b) leqslant liminf_{n to infty}, V_{f_n}(a,b)$$



                For a somewhat shorter proof note that if $liminf_{n to infty}, V_{f_n}(a,b) = alpha < infty$ then for any $epsilon > 0$ there must be a subsequence $n_j$ such that $V_{f_{n_j}}(a,b) < alpha + epsilon$. For any partition we have



                $$sum_{k=1}^n|f_{n_j}(x_k)- f_{n_j}(x_{k-1})| leqslant V_{f_{n_j}}(a,b) + epsilon< alpha + epsilon$$



                Taking the limit of the LHS as $j to infty$ we have



                $$sum_{k=1}^n|f_{n_j}(x_k)- f_{n_j}(x_{k-1})| leqslant alpha + epsilon,$$



                and again, since $epsilon$ is arbitrary, the desired conclusion follows.



                The case where $liminf_{n to infty}, V_{f_n}(a,b) = +infty$ is trivial.







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited Oct 21 '18 at 5:49

























                answered Oct 21 '18 at 5:38









                RRLRRL

                53.7k52574




                53.7k52574






























                    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%2f2946607%2fsequence-of-functions-and-total-variation%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

                    六本木駅

                    Integral that is continuous and looks like it converges to a geometric seriesTesting if a geometric series converges by taking limit to infinitySummation of arithmetic-geometric series of higher orderGeometric series with polynomial exponentHow to Recognize a Geometric SeriesShowing an integral equality with series over the integersDiscontinuity of a series of continuous functionsReasons why a Series ConvergesSum of infinite geometric series with two terms in summationUsing geometric series for computing IntegralsLimit of geometric series sum when $r = 1$

                    Joseph Lister