“Fat” Cantor Set
$begingroup$
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
$endgroup$
|
show 1 more comment
$begingroup$
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
$endgroup$
11
$begingroup$
The very first Google hit for "fat Cantor set" has the answer. (If I could, I would vote to close as general-reference.)
$endgroup$
– Rahul
Jan 27 '13 at 4:06
$begingroup$
If the bits you remove at each stage have total length less than $1$, then what's left has positive measure.
$endgroup$
– Gerry Myerson
Jan 27 '13 at 4:06
$begingroup$
You can't have outer measure 1. Otherwise the set would be dense in [0,1], contradicting its compactness.
$endgroup$
– user53153
Jan 27 '13 at 4:09
$begingroup$
You can, however, have outer measure arbitrarily close to one.
$endgroup$
– Brian M. Scott
Jan 27 '13 at 4:10
1
$begingroup$
Here are some details of what's contained on the Wikipedia page.
$endgroup$
– Martin
Jan 27 '13 at 4:13
|
show 1 more comment
$begingroup$
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
$endgroup$
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
real-analysis cantor-set
edited Jul 5 '15 at 8:56
Martin Sleziak
44.7k9117272
44.7k9117272
asked Jan 27 '13 at 4:03
FrankFrank
4612
4612
11
$begingroup$
The very first Google hit for "fat Cantor set" has the answer. (If I could, I would vote to close as general-reference.)
$endgroup$
– Rahul
Jan 27 '13 at 4:06
$begingroup$
If the bits you remove at each stage have total length less than $1$, then what's left has positive measure.
$endgroup$
– Gerry Myerson
Jan 27 '13 at 4:06
$begingroup$
You can't have outer measure 1. Otherwise the set would be dense in [0,1], contradicting its compactness.
$endgroup$
– user53153
Jan 27 '13 at 4:09
$begingroup$
You can, however, have outer measure arbitrarily close to one.
$endgroup$
– Brian M. Scott
Jan 27 '13 at 4:10
1
$begingroup$
Here are some details of what's contained on the Wikipedia page.
$endgroup$
– Martin
Jan 27 '13 at 4:13
|
show 1 more comment
11
$begingroup$
The very first Google hit for "fat Cantor set" has the answer. (If I could, I would vote to close as general-reference.)
$endgroup$
– Rahul
Jan 27 '13 at 4:06
$begingroup$
If the bits you remove at each stage have total length less than $1$, then what's left has positive measure.
$endgroup$
– Gerry Myerson
Jan 27 '13 at 4:06
$begingroup$
You can't have outer measure 1. Otherwise the set would be dense in [0,1], contradicting its compactness.
$endgroup$
– user53153
Jan 27 '13 at 4:09
$begingroup$
You can, however, have outer measure arbitrarily close to one.
$endgroup$
– Brian M. Scott
Jan 27 '13 at 4:10
1
$begingroup$
Here are some details of what's contained on the Wikipedia page.
$endgroup$
– Martin
Jan 27 '13 at 4:13
11
11
$begingroup$
The very first Google hit for "fat Cantor set" has the answer. (If I could, I would vote to close as general-reference.)
$endgroup$
– Rahul
Jan 27 '13 at 4:06
$begingroup$
The very first Google hit for "fat Cantor set" has the answer. (If I could, I would vote to close as general-reference.)
$endgroup$
– Rahul
Jan 27 '13 at 4:06
$begingroup$
If the bits you remove at each stage have total length less than $1$, then what's left has positive measure.
$endgroup$
– Gerry Myerson
Jan 27 '13 at 4:06
$begingroup$
If the bits you remove at each stage have total length less than $1$, then what's left has positive measure.
$endgroup$
– Gerry Myerson
Jan 27 '13 at 4:06
$begingroup$
You can't have outer measure 1. Otherwise the set would be dense in [0,1], contradicting its compactness.
$endgroup$
– user53153
Jan 27 '13 at 4:09
$begingroup$
You can't have outer measure 1. Otherwise the set would be dense in [0,1], contradicting its compactness.
$endgroup$
– user53153
Jan 27 '13 at 4:09
$begingroup$
You can, however, have outer measure arbitrarily close to one.
$endgroup$
– Brian M. Scott
Jan 27 '13 at 4:10
$begingroup$
You can, however, have outer measure arbitrarily close to one.
$endgroup$
– Brian M. Scott
Jan 27 '13 at 4:10
1
1
$begingroup$
Here are some details of what's contained on the Wikipedia page.
$endgroup$
– Martin
Jan 27 '13 at 4:13
$begingroup$
Here are some details of what's contained on the Wikipedia page.
$endgroup$
– Martin
Jan 27 '13 at 4:13
|
show 1 more comment
1 Answer
1
active
oldest
votes
$begingroup$
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.
$endgroup$
add a comment |
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
$begingroup$
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.
$endgroup$
add a comment |
$begingroup$
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.
$endgroup$
add a comment |
$begingroup$
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.
$endgroup$
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.
edited Jan 9 '14 at 3:56
answered Jan 27 '13 at 4:23
Michael HardyMichael Hardy
1
1
add a comment |
add a comment |
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
11
$begingroup$
The very first Google hit for "fat Cantor set" has the answer. (If I could, I would vote to close as general-reference.)
$endgroup$
– Rahul
Jan 27 '13 at 4:06
$begingroup$
If the bits you remove at each stage have total length less than $1$, then what's left has positive measure.
$endgroup$
– Gerry Myerson
Jan 27 '13 at 4:06
$begingroup$
You can't have outer measure 1. Otherwise the set would be dense in [0,1], contradicting its compactness.
$endgroup$
– user53153
Jan 27 '13 at 4:09
$begingroup$
You can, however, have outer measure arbitrarily close to one.
$endgroup$
– Brian M. Scott
Jan 27 '13 at 4:10
1
$begingroup$
Here are some details of what's contained on the Wikipedia page.
$endgroup$
– Martin
Jan 27 '13 at 4:13