“Fat” Cantor Set











up vote
8
down vote

favorite
2












So the standard Cantor set has an outer measure equal to 0, but how can you construct a "fat" Cantor set with a positive outer measure? I was told that it is even possible to produce one with an outer measure of 1! I don't see how changing the size of the "chuck" taken out will change the value of the outer measure. Regardless of the size, I feel like it will inevitably reach a value of 0 as well...



Are there other constraints that need to be made in order to accomplish this?










share|cite|improve this question




















  • 10




    The very first Google hit for "fat Cantor set" has the answer. (If I could, I would vote to close as general-reference.)
    – Rahul
    Jan 27 '13 at 4:06












  • If the bits you remove at each stage have total length less than $1$, then what's left has positive measure.
    – Gerry Myerson
    Jan 27 '13 at 4:06










  • You can't have outer measure 1. Otherwise the set would be dense in [0,1], contradicting its compactness.
    – user53153
    Jan 27 '13 at 4:09










  • You can, however, have outer measure arbitrarily close to one.
    – Brian M. Scott
    Jan 27 '13 at 4:10






  • 1




    Here are some details of what's contained on the Wikipedia page.
    – Martin
    Jan 27 '13 at 4:13

















up vote
8
down vote

favorite
2












So the standard Cantor set has an outer measure equal to 0, but how can you construct a "fat" Cantor set with a positive outer measure? I was told that it is even possible to produce one with an outer measure of 1! I don't see how changing the size of the "chuck" taken out will change the value of the outer measure. Regardless of the size, I feel like it will inevitably reach a value of 0 as well...



Are there other constraints that need to be made in order to accomplish this?










share|cite|improve this question




















  • 10




    The very first Google hit for "fat Cantor set" has the answer. (If I could, I would vote to close as general-reference.)
    – Rahul
    Jan 27 '13 at 4:06












  • If the bits you remove at each stage have total length less than $1$, then what's left has positive measure.
    – Gerry Myerson
    Jan 27 '13 at 4:06










  • You can't have outer measure 1. Otherwise the set would be dense in [0,1], contradicting its compactness.
    – user53153
    Jan 27 '13 at 4:09










  • You can, however, have outer measure arbitrarily close to one.
    – Brian M. Scott
    Jan 27 '13 at 4:10






  • 1




    Here are some details of what's contained on the Wikipedia page.
    – Martin
    Jan 27 '13 at 4:13















up vote
8
down vote

favorite
2









up vote
8
down vote

favorite
2






2





So the standard Cantor set has an outer measure equal to 0, but how can you construct a "fat" Cantor set with a positive outer measure? I was told that it is even possible to produce one with an outer measure of 1! I don't see how changing the size of the "chuck" taken out will change the value of the outer measure. Regardless of the size, I feel like it will inevitably reach a value of 0 as well...



Are there other constraints that need to be made in order to accomplish this?










share|cite|improve this question















So the standard Cantor set has an outer measure equal to 0, but how can you construct a "fat" Cantor set with a positive outer measure? I was told that it is even possible to produce one with an outer measure of 1! I don't see how changing the size of the "chuck" taken out will change the value of the outer measure. Regardless of the size, I feel like it will inevitably reach a value of 0 as well...



Are there other constraints that need to be made in order to accomplish this?







real-analysis cantor-set






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jul 5 '15 at 8:56









Martin Sleziak

44.5k7115268




44.5k7115268










asked Jan 27 '13 at 4:03









Frank

4112




4112








  • 10




    The very first Google hit for "fat Cantor set" has the answer. (If I could, I would vote to close as general-reference.)
    – Rahul
    Jan 27 '13 at 4:06












  • If the bits you remove at each stage have total length less than $1$, then what's left has positive measure.
    – Gerry Myerson
    Jan 27 '13 at 4:06










  • You can't have outer measure 1. Otherwise the set would be dense in [0,1], contradicting its compactness.
    – user53153
    Jan 27 '13 at 4:09










  • You can, however, have outer measure arbitrarily close to one.
    – Brian M. Scott
    Jan 27 '13 at 4:10






  • 1




    Here are some details of what's contained on the Wikipedia page.
    – Martin
    Jan 27 '13 at 4:13
















  • 10




    The very first Google hit for "fat Cantor set" has the answer. (If I could, I would vote to close as general-reference.)
    – Rahul
    Jan 27 '13 at 4:06












  • If the bits you remove at each stage have total length less than $1$, then what's left has positive measure.
    – Gerry Myerson
    Jan 27 '13 at 4:06










  • You can't have outer measure 1. Otherwise the set would be dense in [0,1], contradicting its compactness.
    – user53153
    Jan 27 '13 at 4:09










  • You can, however, have outer measure arbitrarily close to one.
    – Brian M. Scott
    Jan 27 '13 at 4:10






  • 1




    Here are some details of what's contained on the Wikipedia page.
    – Martin
    Jan 27 '13 at 4:13










10




10




The very first Google hit for "fat Cantor set" has the answer. (If I could, I would vote to close as general-reference.)
– Rahul
Jan 27 '13 at 4:06






The very first Google hit for "fat Cantor set" has the answer. (If I could, I would vote to close as general-reference.)
– Rahul
Jan 27 '13 at 4:06














If the bits you remove at each stage have total length less than $1$, then what's left has positive measure.
– Gerry Myerson
Jan 27 '13 at 4:06




If the bits you remove at each stage have total length less than $1$, then what's left has positive measure.
– Gerry Myerson
Jan 27 '13 at 4:06












You can't have outer measure 1. Otherwise the set would be dense in [0,1], contradicting its compactness.
– user53153
Jan 27 '13 at 4:09




You can't have outer measure 1. Otherwise the set would be dense in [0,1], contradicting its compactness.
– user53153
Jan 27 '13 at 4:09












You can, however, have outer measure arbitrarily close to one.
– Brian M. Scott
Jan 27 '13 at 4:10




You can, however, have outer measure arbitrarily close to one.
– Brian M. Scott
Jan 27 '13 at 4:10




1




1




Here are some details of what's contained on the Wikipedia page.
– Martin
Jan 27 '13 at 4:13






Here are some details of what's contained on the Wikipedia page.
– Martin
Jan 27 '13 at 4:13












1 Answer
1






active

oldest

votes

















up vote
11
down vote













Say you delete the middle third.



Then delete two intervals the sum of whose lengths is $1/6$ from the two remaining intervals.



Then delete intervals the sum of whose lengths is $1/12$, one from each of the four remaining intervals.



And so on. The amount you delete is $displaystylefrac13+frac16+frac{1}{12}+cdots= frac23.$ That is less than the whole measure of the interval $[0,1]$ from which you're deleting things.






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%2f287866%2ffat-cantor-set%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
    11
    down vote













    Say you delete the middle third.



    Then delete two intervals the sum of whose lengths is $1/6$ from the two remaining intervals.



    Then delete intervals the sum of whose lengths is $1/12$, one from each of the four remaining intervals.



    And so on. The amount you delete is $displaystylefrac13+frac16+frac{1}{12}+cdots= frac23.$ That is less than the whole measure of the interval $[0,1]$ from which you're deleting things.






    share|cite|improve this answer



























      up vote
      11
      down vote













      Say you delete the middle third.



      Then delete two intervals the sum of whose lengths is $1/6$ from the two remaining intervals.



      Then delete intervals the sum of whose lengths is $1/12$, one from each of the four remaining intervals.



      And so on. The amount you delete is $displaystylefrac13+frac16+frac{1}{12}+cdots= frac23.$ That is less than the whole measure of the interval $[0,1]$ from which you're deleting things.






      share|cite|improve this answer

























        up vote
        11
        down vote










        up vote
        11
        down vote









        Say you delete the middle third.



        Then delete two intervals the sum of whose lengths is $1/6$ from the two remaining intervals.



        Then delete intervals the sum of whose lengths is $1/12$, one from each of the four remaining intervals.



        And so on. The amount you delete is $displaystylefrac13+frac16+frac{1}{12}+cdots= frac23.$ That is less than the whole measure of the interval $[0,1]$ from which you're deleting things.






        share|cite|improve this answer














        Say you delete the middle third.



        Then delete two intervals the sum of whose lengths is $1/6$ from the two remaining intervals.



        Then delete intervals the sum of whose lengths is $1/12$, one from each of the four remaining intervals.



        And so on. The amount you delete is $displaystylefrac13+frac16+frac{1}{12}+cdots= frac23.$ That is less than the whole measure of the interval $[0,1]$ from which you're deleting things.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Jan 9 '14 at 3:56

























        answered Jan 27 '13 at 4:23









        Michael Hardy

        1




        1






























            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%2f287866%2ffat-cantor-set%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

            Bressuire

            Cabo Verde

            Gyllenstierna