Convergence of functions in different topologies.











up vote
0
down vote

favorite












Consider the sequence of continuous functions $f_n(x) : mathbb{R} to mathbb{R}$
defined by $f_n(x) = frac{x}{n}$. In which of the following topologies: pointwise convergence, compact convergence, and uniform does $f_n(x)=frac{x}{n}$ converge. What about when $f_n(x) = frac{1}{n^3[x-(1/n)]^2 + 1}$?



We define the uniform topology on $Y^X$={functions from X to Y} as the topology with subbasis ${B(f,ϵ):fin Y^X,epsilon>0}$, where
$B(f,ϵ)={g∈Y^X:text{sup }_{x∈X} d(f(x),g(x))<ϵ}$



and the compact convergence topology is generated by the collection of sets
$B_C(f,ϵ)={g∈Y^X:text{sup}_{x∈C} d(f(x),g(x))<ϵ}$,
with compact $C⊂X$



and the pointwise convergence topology is generated by the subbasis $S(X,U) = {f|f in Y^X text{ and } f(x) in U }$ for $U$ open in $Y$.










share|cite|improve this question






















  • Have you tried this problem? Where are you stuck? What could be a candidate for the function that $f$ converges to pointwise, for example?
    – астон вілла олоф мэллбэрг
    2 days ago












  • I'm stuck with how to go about showing convergence in these different topologies. I would choose 0 for a candidate for the functions to converge to.
    – frostyfeet
    18 hours ago










  • Ok. So pointwise convergence should not be difficult? All you have to show is that for each $x$ we have $f_n(x) to 0$?
    – астон вілла олоф мэллбэрг
    14 hours ago










  • For each $x$ are we choosing a different $N$? Since $x in mathbb{R}$ we couldn't find a $N$ such that for any $n ge N, f_n(x) to 0$ for all $x in mathbb{R}$
    – frostyfeet
    14 hours ago

















up vote
0
down vote

favorite












Consider the sequence of continuous functions $f_n(x) : mathbb{R} to mathbb{R}$
defined by $f_n(x) = frac{x}{n}$. In which of the following topologies: pointwise convergence, compact convergence, and uniform does $f_n(x)=frac{x}{n}$ converge. What about when $f_n(x) = frac{1}{n^3[x-(1/n)]^2 + 1}$?



We define the uniform topology on $Y^X$={functions from X to Y} as the topology with subbasis ${B(f,ϵ):fin Y^X,epsilon>0}$, where
$B(f,ϵ)={g∈Y^X:text{sup }_{x∈X} d(f(x),g(x))<ϵ}$



and the compact convergence topology is generated by the collection of sets
$B_C(f,ϵ)={g∈Y^X:text{sup}_{x∈C} d(f(x),g(x))<ϵ}$,
with compact $C⊂X$



and the pointwise convergence topology is generated by the subbasis $S(X,U) = {f|f in Y^X text{ and } f(x) in U }$ for $U$ open in $Y$.










share|cite|improve this question






















  • Have you tried this problem? Where are you stuck? What could be a candidate for the function that $f$ converges to pointwise, for example?
    – астон вілла олоф мэллбэрг
    2 days ago












  • I'm stuck with how to go about showing convergence in these different topologies. I would choose 0 for a candidate for the functions to converge to.
    – frostyfeet
    18 hours ago










  • Ok. So pointwise convergence should not be difficult? All you have to show is that for each $x$ we have $f_n(x) to 0$?
    – астон вілла олоф мэллбэрг
    14 hours ago










  • For each $x$ are we choosing a different $N$? Since $x in mathbb{R}$ we couldn't find a $N$ such that for any $n ge N, f_n(x) to 0$ for all $x in mathbb{R}$
    – frostyfeet
    14 hours ago















up vote
0
down vote

favorite









up vote
0
down vote

favorite











Consider the sequence of continuous functions $f_n(x) : mathbb{R} to mathbb{R}$
defined by $f_n(x) = frac{x}{n}$. In which of the following topologies: pointwise convergence, compact convergence, and uniform does $f_n(x)=frac{x}{n}$ converge. What about when $f_n(x) = frac{1}{n^3[x-(1/n)]^2 + 1}$?



We define the uniform topology on $Y^X$={functions from X to Y} as the topology with subbasis ${B(f,ϵ):fin Y^X,epsilon>0}$, where
$B(f,ϵ)={g∈Y^X:text{sup }_{x∈X} d(f(x),g(x))<ϵ}$



and the compact convergence topology is generated by the collection of sets
$B_C(f,ϵ)={g∈Y^X:text{sup}_{x∈C} d(f(x),g(x))<ϵ}$,
with compact $C⊂X$



and the pointwise convergence topology is generated by the subbasis $S(X,U) = {f|f in Y^X text{ and } f(x) in U }$ for $U$ open in $Y$.










share|cite|improve this question













Consider the sequence of continuous functions $f_n(x) : mathbb{R} to mathbb{R}$
defined by $f_n(x) = frac{x}{n}$. In which of the following topologies: pointwise convergence, compact convergence, and uniform does $f_n(x)=frac{x}{n}$ converge. What about when $f_n(x) = frac{1}{n^3[x-(1/n)]^2 + 1}$?



We define the uniform topology on $Y^X$={functions from X to Y} as the topology with subbasis ${B(f,ϵ):fin Y^X,epsilon>0}$, where
$B(f,ϵ)={g∈Y^X:text{sup }_{x∈X} d(f(x),g(x))<ϵ}$



and the compact convergence topology is generated by the collection of sets
$B_C(f,ϵ)={g∈Y^X:text{sup}_{x∈C} d(f(x),g(x))<ϵ}$,
with compact $C⊂X$



and the pointwise convergence topology is generated by the subbasis $S(X,U) = {f|f in Y^X text{ and } f(x) in U }$ for $U$ open in $Y$.







general-topology






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 2 days ago









frostyfeet

1558




1558












  • Have you tried this problem? Where are you stuck? What could be a candidate for the function that $f$ converges to pointwise, for example?
    – астон вілла олоф мэллбэрг
    2 days ago












  • I'm stuck with how to go about showing convergence in these different topologies. I would choose 0 for a candidate for the functions to converge to.
    – frostyfeet
    18 hours ago










  • Ok. So pointwise convergence should not be difficult? All you have to show is that for each $x$ we have $f_n(x) to 0$?
    – астон вілла олоф мэллбэрг
    14 hours ago










  • For each $x$ are we choosing a different $N$? Since $x in mathbb{R}$ we couldn't find a $N$ such that for any $n ge N, f_n(x) to 0$ for all $x in mathbb{R}$
    – frostyfeet
    14 hours ago




















  • Have you tried this problem? Where are you stuck? What could be a candidate for the function that $f$ converges to pointwise, for example?
    – астон вілла олоф мэллбэрг
    2 days ago












  • I'm stuck with how to go about showing convergence in these different topologies. I would choose 0 for a candidate for the functions to converge to.
    – frostyfeet
    18 hours ago










  • Ok. So pointwise convergence should not be difficult? All you have to show is that for each $x$ we have $f_n(x) to 0$?
    – астон вілла олоф мэллбэрг
    14 hours ago










  • For each $x$ are we choosing a different $N$? Since $x in mathbb{R}$ we couldn't find a $N$ such that for any $n ge N, f_n(x) to 0$ for all $x in mathbb{R}$
    – frostyfeet
    14 hours ago


















Have you tried this problem? Where are you stuck? What could be a candidate for the function that $f$ converges to pointwise, for example?
– астон вілла олоф мэллбэрг
2 days ago






Have you tried this problem? Where are you stuck? What could be a candidate for the function that $f$ converges to pointwise, for example?
– астон вілла олоф мэллбэрг
2 days ago














I'm stuck with how to go about showing convergence in these different topologies. I would choose 0 for a candidate for the functions to converge to.
– frostyfeet
18 hours ago




I'm stuck with how to go about showing convergence in these different topologies. I would choose 0 for a candidate for the functions to converge to.
– frostyfeet
18 hours ago












Ok. So pointwise convergence should not be difficult? All you have to show is that for each $x$ we have $f_n(x) to 0$?
– астон вілла олоф мэллбэрг
14 hours ago




Ok. So pointwise convergence should not be difficult? All you have to show is that for each $x$ we have $f_n(x) to 0$?
– астон вілла олоф мэллбэрг
14 hours ago












For each $x$ are we choosing a different $N$? Since $x in mathbb{R}$ we couldn't find a $N$ such that for any $n ge N, f_n(x) to 0$ for all $x in mathbb{R}$
– frostyfeet
14 hours ago






For each $x$ are we choosing a different $N$? Since $x in mathbb{R}$ we couldn't find a $N$ such that for any $n ge N, f_n(x) to 0$ for all $x in mathbb{R}$
– frostyfeet
14 hours ago












1 Answer
1






active

oldest

votes

















up vote
0
down vote













Let us recall the definitions of pointwise, uniform and uniform on compact convergence.



Given functions $f_n : mathbb R to mathbb R$ and $f : mathbb R to mathbb R$, we say that :




  • $f_n to f$ pointwise if for each $x in mathbb R$ we have $f_n(x) to f(x)$.


  • $f_n to f$ uniformly, if for all $epsilon > 0$ there exists $N in mathbb N$ such that if $n > N$ then for all $x$ we have $|f_n(x) - f(x)| < epsilon$.


  • $f_n to f$ uniformly on compact sets, if for each compact set $K subset R$, the restricted functions $f_n|_K$ and $f|_K$ satisfy $f_n|_K to f|_K$ uniformly on $K$.





With this in mind, for $f_n = frac xn$, we need a candidate function for $f$, where $f_n$ would converge pointwise. But, for each fixed $x$, the sequence $frac xn$ clearly goes to zero. So, $f equiv 0$ should work.



To see this, fix $x in mathbb R$. The point is, for pointwise convergence we are supposed to show for each fixed $x$ that $f_n(x) to f(x)$, while in the uniform case we are supposed to specify $N$ before fixing $x$. That is the difference in the two forms of convergence.



But if $x$ is fixed, then the sequence $frac xn$ clearly converges to $0$. Since this is true for all $x$, we see that $f_n$ converges pointwise to $0$.



But not uniformly Why? The intuition behind uniform convergence, is that in some sense, the rate at which $f_n(x) to f(x)$ happens, should be the same for each $x$ (or at least uniform in some sense). Here, this is not the case, and we argue by contradiction. Suppose that $f_n to f$ uniformly. Then, $f_n to f$ pointwise(WHY?), so $f equiv 0$ must happen. We know that for all $epsilon > 0$ there exists $N$ such that $n > N$ implies $|f_n(x)| < epsilon$ for all $x$. But this is false : let $epsilon = 1$ . Then, if $N$ comes out from the definition of uniform continuity, take $x = N+2$ to see that $f_{N+1}(N+2) > 1 = epsilon$, so it is not true that if $n > N$ then $|f_n(x)| < epsilon$ for all $x$, as we showed by taking a specific $n$ and $x$.



In short, the rate of convergence to zero of $f_n(x)$ is not uniform : in fact, it gets slower as $x$ grows larger.



Uniformly on compacts? Let $K$ be compact. The candidate for uniform convergence on $K$ should again be the zero function. Let us fix $epsilon > 0$. We are supposed to find $N$ such that if $n > N$ then $|f_n(x)| < epsilon$ for all $x in K$. Expanding, this is saying that $|x| < nepsilon $ for all $x in K$.



But a compact set is bounded! So let $M$ be such that $|x| < M$ for all $x in K$. Simply pick $N > frac{M}{epsilon}$ an integer. Then, if $n > N$ we have $nepsilon > M > |x|$, or that $|f_n(x)| < epsilon$. Hence, uniform convergence on compacts is true here!





Use the ideas above to solve the second question.




  • First, find a candidate for pointwise convergence. If the convergence is uniform/uniform on compacts, then the candidate remains the same.


  • Study the values of $f_n(x)$ for various values of $x$ to check intuitively whether uniform convergence applies. Study $|f_n(x) - f(x)|$ for varying $n$ and $x$ : this gives you a good clue.


  • For compactness, you have to see if boundedness makes a difference to the rate of convergence.Usually, if $|f_n(x) - f(x)|$ has a bound related to an upper bound of the compact set, then this is helpful.







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: 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%2f2997803%2fconvergence-of-functions-in-different-topologies%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








    up vote
    0
    down vote













    Let us recall the definitions of pointwise, uniform and uniform on compact convergence.



    Given functions $f_n : mathbb R to mathbb R$ and $f : mathbb R to mathbb R$, we say that :




    • $f_n to f$ pointwise if for each $x in mathbb R$ we have $f_n(x) to f(x)$.


    • $f_n to f$ uniformly, if for all $epsilon > 0$ there exists $N in mathbb N$ such that if $n > N$ then for all $x$ we have $|f_n(x) - f(x)| < epsilon$.


    • $f_n to f$ uniformly on compact sets, if for each compact set $K subset R$, the restricted functions $f_n|_K$ and $f|_K$ satisfy $f_n|_K to f|_K$ uniformly on $K$.





    With this in mind, for $f_n = frac xn$, we need a candidate function for $f$, where $f_n$ would converge pointwise. But, for each fixed $x$, the sequence $frac xn$ clearly goes to zero. So, $f equiv 0$ should work.



    To see this, fix $x in mathbb R$. The point is, for pointwise convergence we are supposed to show for each fixed $x$ that $f_n(x) to f(x)$, while in the uniform case we are supposed to specify $N$ before fixing $x$. That is the difference in the two forms of convergence.



    But if $x$ is fixed, then the sequence $frac xn$ clearly converges to $0$. Since this is true for all $x$, we see that $f_n$ converges pointwise to $0$.



    But not uniformly Why? The intuition behind uniform convergence, is that in some sense, the rate at which $f_n(x) to f(x)$ happens, should be the same for each $x$ (or at least uniform in some sense). Here, this is not the case, and we argue by contradiction. Suppose that $f_n to f$ uniformly. Then, $f_n to f$ pointwise(WHY?), so $f equiv 0$ must happen. We know that for all $epsilon > 0$ there exists $N$ such that $n > N$ implies $|f_n(x)| < epsilon$ for all $x$. But this is false : let $epsilon = 1$ . Then, if $N$ comes out from the definition of uniform continuity, take $x = N+2$ to see that $f_{N+1}(N+2) > 1 = epsilon$, so it is not true that if $n > N$ then $|f_n(x)| < epsilon$ for all $x$, as we showed by taking a specific $n$ and $x$.



    In short, the rate of convergence to zero of $f_n(x)$ is not uniform : in fact, it gets slower as $x$ grows larger.



    Uniformly on compacts? Let $K$ be compact. The candidate for uniform convergence on $K$ should again be the zero function. Let us fix $epsilon > 0$. We are supposed to find $N$ such that if $n > N$ then $|f_n(x)| < epsilon$ for all $x in K$. Expanding, this is saying that $|x| < nepsilon $ for all $x in K$.



    But a compact set is bounded! So let $M$ be such that $|x| < M$ for all $x in K$. Simply pick $N > frac{M}{epsilon}$ an integer. Then, if $n > N$ we have $nepsilon > M > |x|$, or that $|f_n(x)| < epsilon$. Hence, uniform convergence on compacts is true here!





    Use the ideas above to solve the second question.




    • First, find a candidate for pointwise convergence. If the convergence is uniform/uniform on compacts, then the candidate remains the same.


    • Study the values of $f_n(x)$ for various values of $x$ to check intuitively whether uniform convergence applies. Study $|f_n(x) - f(x)|$ for varying $n$ and $x$ : this gives you a good clue.


    • For compactness, you have to see if boundedness makes a difference to the rate of convergence.Usually, if $|f_n(x) - f(x)|$ has a bound related to an upper bound of the compact set, then this is helpful.







    share|cite|improve this answer

























      up vote
      0
      down vote













      Let us recall the definitions of pointwise, uniform and uniform on compact convergence.



      Given functions $f_n : mathbb R to mathbb R$ and $f : mathbb R to mathbb R$, we say that :




      • $f_n to f$ pointwise if for each $x in mathbb R$ we have $f_n(x) to f(x)$.


      • $f_n to f$ uniformly, if for all $epsilon > 0$ there exists $N in mathbb N$ such that if $n > N$ then for all $x$ we have $|f_n(x) - f(x)| < epsilon$.


      • $f_n to f$ uniformly on compact sets, if for each compact set $K subset R$, the restricted functions $f_n|_K$ and $f|_K$ satisfy $f_n|_K to f|_K$ uniformly on $K$.





      With this in mind, for $f_n = frac xn$, we need a candidate function for $f$, where $f_n$ would converge pointwise. But, for each fixed $x$, the sequence $frac xn$ clearly goes to zero. So, $f equiv 0$ should work.



      To see this, fix $x in mathbb R$. The point is, for pointwise convergence we are supposed to show for each fixed $x$ that $f_n(x) to f(x)$, while in the uniform case we are supposed to specify $N$ before fixing $x$. That is the difference in the two forms of convergence.



      But if $x$ is fixed, then the sequence $frac xn$ clearly converges to $0$. Since this is true for all $x$, we see that $f_n$ converges pointwise to $0$.



      But not uniformly Why? The intuition behind uniform convergence, is that in some sense, the rate at which $f_n(x) to f(x)$ happens, should be the same for each $x$ (or at least uniform in some sense). Here, this is not the case, and we argue by contradiction. Suppose that $f_n to f$ uniformly. Then, $f_n to f$ pointwise(WHY?), so $f equiv 0$ must happen. We know that for all $epsilon > 0$ there exists $N$ such that $n > N$ implies $|f_n(x)| < epsilon$ for all $x$. But this is false : let $epsilon = 1$ . Then, if $N$ comes out from the definition of uniform continuity, take $x = N+2$ to see that $f_{N+1}(N+2) > 1 = epsilon$, so it is not true that if $n > N$ then $|f_n(x)| < epsilon$ for all $x$, as we showed by taking a specific $n$ and $x$.



      In short, the rate of convergence to zero of $f_n(x)$ is not uniform : in fact, it gets slower as $x$ grows larger.



      Uniformly on compacts? Let $K$ be compact. The candidate for uniform convergence on $K$ should again be the zero function. Let us fix $epsilon > 0$. We are supposed to find $N$ such that if $n > N$ then $|f_n(x)| < epsilon$ for all $x in K$. Expanding, this is saying that $|x| < nepsilon $ for all $x in K$.



      But a compact set is bounded! So let $M$ be such that $|x| < M$ for all $x in K$. Simply pick $N > frac{M}{epsilon}$ an integer. Then, if $n > N$ we have $nepsilon > M > |x|$, or that $|f_n(x)| < epsilon$. Hence, uniform convergence on compacts is true here!





      Use the ideas above to solve the second question.




      • First, find a candidate for pointwise convergence. If the convergence is uniform/uniform on compacts, then the candidate remains the same.


      • Study the values of $f_n(x)$ for various values of $x$ to check intuitively whether uniform convergence applies. Study $|f_n(x) - f(x)|$ for varying $n$ and $x$ : this gives you a good clue.


      • For compactness, you have to see if boundedness makes a difference to the rate of convergence.Usually, if $|f_n(x) - f(x)|$ has a bound related to an upper bound of the compact set, then this is helpful.







      share|cite|improve this answer























        up vote
        0
        down vote










        up vote
        0
        down vote









        Let us recall the definitions of pointwise, uniform and uniform on compact convergence.



        Given functions $f_n : mathbb R to mathbb R$ and $f : mathbb R to mathbb R$, we say that :




        • $f_n to f$ pointwise if for each $x in mathbb R$ we have $f_n(x) to f(x)$.


        • $f_n to f$ uniformly, if for all $epsilon > 0$ there exists $N in mathbb N$ such that if $n > N$ then for all $x$ we have $|f_n(x) - f(x)| < epsilon$.


        • $f_n to f$ uniformly on compact sets, if for each compact set $K subset R$, the restricted functions $f_n|_K$ and $f|_K$ satisfy $f_n|_K to f|_K$ uniformly on $K$.





        With this in mind, for $f_n = frac xn$, we need a candidate function for $f$, where $f_n$ would converge pointwise. But, for each fixed $x$, the sequence $frac xn$ clearly goes to zero. So, $f equiv 0$ should work.



        To see this, fix $x in mathbb R$. The point is, for pointwise convergence we are supposed to show for each fixed $x$ that $f_n(x) to f(x)$, while in the uniform case we are supposed to specify $N$ before fixing $x$. That is the difference in the two forms of convergence.



        But if $x$ is fixed, then the sequence $frac xn$ clearly converges to $0$. Since this is true for all $x$, we see that $f_n$ converges pointwise to $0$.



        But not uniformly Why? The intuition behind uniform convergence, is that in some sense, the rate at which $f_n(x) to f(x)$ happens, should be the same for each $x$ (or at least uniform in some sense). Here, this is not the case, and we argue by contradiction. Suppose that $f_n to f$ uniformly. Then, $f_n to f$ pointwise(WHY?), so $f equiv 0$ must happen. We know that for all $epsilon > 0$ there exists $N$ such that $n > N$ implies $|f_n(x)| < epsilon$ for all $x$. But this is false : let $epsilon = 1$ . Then, if $N$ comes out from the definition of uniform continuity, take $x = N+2$ to see that $f_{N+1}(N+2) > 1 = epsilon$, so it is not true that if $n > N$ then $|f_n(x)| < epsilon$ for all $x$, as we showed by taking a specific $n$ and $x$.



        In short, the rate of convergence to zero of $f_n(x)$ is not uniform : in fact, it gets slower as $x$ grows larger.



        Uniformly on compacts? Let $K$ be compact. The candidate for uniform convergence on $K$ should again be the zero function. Let us fix $epsilon > 0$. We are supposed to find $N$ such that if $n > N$ then $|f_n(x)| < epsilon$ for all $x in K$. Expanding, this is saying that $|x| < nepsilon $ for all $x in K$.



        But a compact set is bounded! So let $M$ be such that $|x| < M$ for all $x in K$. Simply pick $N > frac{M}{epsilon}$ an integer. Then, if $n > N$ we have $nepsilon > M > |x|$, or that $|f_n(x)| < epsilon$. Hence, uniform convergence on compacts is true here!





        Use the ideas above to solve the second question.




        • First, find a candidate for pointwise convergence. If the convergence is uniform/uniform on compacts, then the candidate remains the same.


        • Study the values of $f_n(x)$ for various values of $x$ to check intuitively whether uniform convergence applies. Study $|f_n(x) - f(x)|$ for varying $n$ and $x$ : this gives you a good clue.


        • For compactness, you have to see if boundedness makes a difference to the rate of convergence.Usually, if $|f_n(x) - f(x)|$ has a bound related to an upper bound of the compact set, then this is helpful.







        share|cite|improve this answer












        Let us recall the definitions of pointwise, uniform and uniform on compact convergence.



        Given functions $f_n : mathbb R to mathbb R$ and $f : mathbb R to mathbb R$, we say that :




        • $f_n to f$ pointwise if for each $x in mathbb R$ we have $f_n(x) to f(x)$.


        • $f_n to f$ uniformly, if for all $epsilon > 0$ there exists $N in mathbb N$ such that if $n > N$ then for all $x$ we have $|f_n(x) - f(x)| < epsilon$.


        • $f_n to f$ uniformly on compact sets, if for each compact set $K subset R$, the restricted functions $f_n|_K$ and $f|_K$ satisfy $f_n|_K to f|_K$ uniformly on $K$.





        With this in mind, for $f_n = frac xn$, we need a candidate function for $f$, where $f_n$ would converge pointwise. But, for each fixed $x$, the sequence $frac xn$ clearly goes to zero. So, $f equiv 0$ should work.



        To see this, fix $x in mathbb R$. The point is, for pointwise convergence we are supposed to show for each fixed $x$ that $f_n(x) to f(x)$, while in the uniform case we are supposed to specify $N$ before fixing $x$. That is the difference in the two forms of convergence.



        But if $x$ is fixed, then the sequence $frac xn$ clearly converges to $0$. Since this is true for all $x$, we see that $f_n$ converges pointwise to $0$.



        But not uniformly Why? The intuition behind uniform convergence, is that in some sense, the rate at which $f_n(x) to f(x)$ happens, should be the same for each $x$ (or at least uniform in some sense). Here, this is not the case, and we argue by contradiction. Suppose that $f_n to f$ uniformly. Then, $f_n to f$ pointwise(WHY?), so $f equiv 0$ must happen. We know that for all $epsilon > 0$ there exists $N$ such that $n > N$ implies $|f_n(x)| < epsilon$ for all $x$. But this is false : let $epsilon = 1$ . Then, if $N$ comes out from the definition of uniform continuity, take $x = N+2$ to see that $f_{N+1}(N+2) > 1 = epsilon$, so it is not true that if $n > N$ then $|f_n(x)| < epsilon$ for all $x$, as we showed by taking a specific $n$ and $x$.



        In short, the rate of convergence to zero of $f_n(x)$ is not uniform : in fact, it gets slower as $x$ grows larger.



        Uniformly on compacts? Let $K$ be compact. The candidate for uniform convergence on $K$ should again be the zero function. Let us fix $epsilon > 0$. We are supposed to find $N$ such that if $n > N$ then $|f_n(x)| < epsilon$ for all $x in K$. Expanding, this is saying that $|x| < nepsilon $ for all $x in K$.



        But a compact set is bounded! So let $M$ be such that $|x| < M$ for all $x in K$. Simply pick $N > frac{M}{epsilon}$ an integer. Then, if $n > N$ we have $nepsilon > M > |x|$, or that $|f_n(x)| < epsilon$. Hence, uniform convergence on compacts is true here!





        Use the ideas above to solve the second question.




        • First, find a candidate for pointwise convergence. If the convergence is uniform/uniform on compacts, then the candidate remains the same.


        • Study the values of $f_n(x)$ for various values of $x$ to check intuitively whether uniform convergence applies. Study $|f_n(x) - f(x)|$ for varying $n$ and $x$ : this gives you a good clue.


        • For compactness, you have to see if boundedness makes a difference to the rate of convergence.Usually, if $|f_n(x) - f(x)|$ has a bound related to an upper bound of the compact set, then this is helpful.








        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered 13 hours ago









        астон вілла олоф мэллбэрг

        36k33375




        36k33375






























             

            draft saved


            draft discarded



















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2997803%2fconvergence-of-functions-in-different-topologies%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

            Plaza Victoria

            In PowerPoint, is there a keyboard shortcut for bulleted / numbered list?

            How to put 3 figures in Latex with 2 figures side by side and 1 below these side by side images but in...