Tightness of a finite measure on a complete and separable metric space












1















Let $(X, rho)$ be a metric spac and let $mu$ be a finite Borel measure on it. Assume thay $(X, rho)$ is complete and separable. Prove that for every $epsilon > 0$ there is a complact subset $K subset X$ such that $mu(K^c) < epsilon$.




I am not sure what to do here. We are to use that a subset of a complete metric space is compact iff it is closed and totally bounded. I managed to prove that for any $delta > 0$ there is a finite subset ${x_1,...,x_n}$ such that $mu((B(x_1,delta) cup... cup B(x_n,delta))^c) < epsilon$. It seems like I have to take something like closure, but I am not sure how.






real-analysis measure-theory compactness complete-spaces







share|cite|improve this question



























    1















    Let $(X, rho)$ be a metric spac and let $mu$ be a finite Borel measure on it. Assume thay $(X, rho)$ is complete and separable. Prove that for every $epsilon > 0$ there is a complact subset $K subset X$ such that $mu(K^c) < epsilon$.




    I am not sure what to do here. We are to use that a subset of a complete metric space is compact iff it is closed and totally bounded. I managed to prove that for any $delta > 0$ there is a finite subset ${x_1,...,x_n}$ such that $mu((B(x_1,delta) cup... cup B(x_n,delta))^c) < epsilon$. It seems like I have to take something like closure, but I am not sure how.






    real-analysis measure-theory compactness complete-spaces







    share|cite|improve this question

























      1












      1








      1








      Let $(X, rho)$ be a metric spac and let $mu$ be a finite Borel measure on it. Assume thay $(X, rho)$ is complete and separable. Prove that for every $epsilon > 0$ there is a complact subset $K subset X$ such that $mu(K^c) < epsilon$.




      I am not sure what to do here. We are to use that a subset of a complete metric space is compact iff it is closed and totally bounded. I managed to prove that for any $delta > 0$ there is a finite subset ${x_1,...,x_n}$ such that $mu((B(x_1,delta) cup... cup B(x_n,delta))^c) < epsilon$. It seems like I have to take something like closure, but I am not sure how.






      real-analysis measure-theory compactness complete-spaces







      share|cite|improve this question














      Let $(X, rho)$ be a metric spac and let $mu$ be a finite Borel measure on it. Assume thay $(X, rho)$ is complete and separable. Prove that for every $epsilon > 0$ there is a complact subset $K subset X$ such that $mu(K^c) < epsilon$.




      I am not sure what to do here. We are to use that a subset of a complete metric space is compact iff it is closed and totally bounded. I managed to prove that for any $delta > 0$ there is a finite subset ${x_1,...,x_n}$ such that $mu((B(x_1,delta) cup... cup B(x_n,delta))^c) < epsilon$. It seems like I have to take something like closure, but I am not sure how.






      real-analysis measure-theory compactness complete-spaces




      real-analysis measure-theory compactness complete-spaces






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 25 at 4:46









      Cute Brownie

      995416




      995416






















          1 Answer
          1






          active

          oldest

          votes


















          2














          For each $n$ take $delta =frac 1 n$ and replace $epsilon$ by $epsilon /2^{n}$ in your argument to get a finite set ${x_{n1},x_{n2},...,x_{nk_n}}$. Consider $H=cap_n [B(x_{n1},frac 1 n)cup B(x_{n2},frac 1 n),...,cup B(x_{nk_n},frac 1 n)]$ This set is totally bounded and hence its closure $K$ is compact. The measure of $H^{c}$ is less than $epsilon$. Hence $mu(K^{c}) <epsilon$.






          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',
            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%2f3012450%2ftightness-of-a-finite-measure-on-a-complete-and-separable-metric-space%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









            2














            For each $n$ take $delta =frac 1 n$ and replace $epsilon$ by $epsilon /2^{n}$ in your argument to get a finite set ${x_{n1},x_{n2},...,x_{nk_n}}$. Consider $H=cap_n [B(x_{n1},frac 1 n)cup B(x_{n2},frac 1 n),...,cup B(x_{nk_n},frac 1 n)]$ This set is totally bounded and hence its closure $K$ is compact. The measure of $H^{c}$ is less than $epsilon$. Hence $mu(K^{c}) <epsilon$.






            share|cite|improve this answer


























              2














              For each $n$ take $delta =frac 1 n$ and replace $epsilon$ by $epsilon /2^{n}$ in your argument to get a finite set ${x_{n1},x_{n2},...,x_{nk_n}}$. Consider $H=cap_n [B(x_{n1},frac 1 n)cup B(x_{n2},frac 1 n),...,cup B(x_{nk_n},frac 1 n)]$ This set is totally bounded and hence its closure $K$ is compact. The measure of $H^{c}$ is less than $epsilon$. Hence $mu(K^{c}) <epsilon$.






              share|cite|improve this answer
























                2












                2








                2






                For each $n$ take $delta =frac 1 n$ and replace $epsilon$ by $epsilon /2^{n}$ in your argument to get a finite set ${x_{n1},x_{n2},...,x_{nk_n}}$. Consider $H=cap_n [B(x_{n1},frac 1 n)cup B(x_{n2},frac 1 n),...,cup B(x_{nk_n},frac 1 n)]$ This set is totally bounded and hence its closure $K$ is compact. The measure of $H^{c}$ is less than $epsilon$. Hence $mu(K^{c}) <epsilon$.






                share|cite|improve this answer












                For each $n$ take $delta =frac 1 n$ and replace $epsilon$ by $epsilon /2^{n}$ in your argument to get a finite set ${x_{n1},x_{n2},...,x_{nk_n}}$. Consider $H=cap_n [B(x_{n1},frac 1 n)cup B(x_{n2},frac 1 n),...,cup B(x_{nk_n},frac 1 n)]$ This set is totally bounded and hence its closure $K$ is compact. The measure of $H^{c}$ is less than $epsilon$. Hence $mu(K^{c}) <epsilon$.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Nov 25 at 4:56









                Kavi Rama Murthy

                48.6k31854




                48.6k31854






























                    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.





                    Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                    Please pay close attention to the following guidance:


                    • 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.


                    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%2f3012450%2ftightness-of-a-finite-measure-on-a-complete-and-separable-metric-space%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

                    Image
                    up vote 0 down vote favorite I have $99$ identical square tiles, each with a quarter-circle drawn on it like this: [asy] size(1.5cm); draw(Arc((2,0),1,90,180),red+1); draw((0,0)--(2,0)--(2,2)--(0,2)--(0,0)); [/asy] When I arrange the tiles in a $9times 11$ rectangular grid, each with a random orientation, what is the expected value of the number of full circles I form? I think this problem has to do with finding the chance any given 2x2 square has a circle, but I can't find it. expected-value share | cite | improve this question asked Nov 20 at 15:03 6minecraftninja 1 2
                    Read more

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

                    Image
                    0 I think it's similiar to NFAs. I replace the finite states of the given automaton for start-states for my new automaton. I do it with $epsilon$ -transition from the start state to the actual finite states of the given automaton. The start state of the given automaton will be my accepting(finite) state of my new one. All transitions will be reversed of course to recognize the reversed word. But how do I have to change the stack of the pushdown automaton? That's tricky. formal-languages automata context-free-grammar share | cite | improve this question edited Nov 29 '18 at 14:20 joee
                    Read more

                    Mont Emei

                    Image
                    Mont Emei.mw-parser-output .entete.map{background-image:url("//upload.wikimedia.org/wikipedia/commons/7/7a/Picto_infobox_map.png")} Vue du sommet Wanfo du mont Emei Géographie Altitude 3 099  m , Wanfo Coordonnées 29° 31′ 11″ nord, 103° 19′ 57″ est Administration Pays   Chine Province Sichuan Ville-préfecture Leshan Géolocalisation sur la carte : Sichuan Mont Emei Géolocalisation sur la carte : Chine Mont Emei modifier   Paysage panoramique du mont Emei, incluant le paysage panoramique du grand Bouddha de Leshan *   Patrimoine mondial de l'UNESCO Passerelle en bois sur le versant ouest Pays   Chine Subdivision Sichuan Type Mixte Critères (iv) (vi) (x) Superficie 15 400 ha Numéro d’identification 779 Zone géographique Asie et Pacifique  ** Année d’inscription 1996 (20 e session) * Descriptif officiel UNESCO ** Classification géog
                    Read more