Debunking a false proof
$begingroup$
Consider $E = mathbb{R} times {0}$ in $mathbb{R}^2$. Apparaently this set (the x-axis) has measure zero. However, consider the following set
$$O_n = big{mathbb{R} times big(-frac{1}{n}, frac{1}{n}big)big} $$
and $lim_{n to infty} m(O_n) = lim_{n to infty} frac{2}{n} times infty neq 0$, where $m(*)$ is the Lebesgue measure.
Therefore, we don't have $lim_{n to infty} m(O_n) = m(E)$.
Can you debunk my false proof of $lim_{n to infty} m(O_n) = m(E)$?
Since $E$ is Lebesgue measurable, there is an open set $F$ such that $m(Fsetminus E) < epsilon$. Find $n$ such that $O_n subset F$ and $m(O_n) leq m(E) + epsilon$, because $O_n$ can be made arbitrarily close to $E$. $epsilon$ being arbitrary implies $m(O_n) leq m(E)$ and $n to infty$ shows $lim_{n to infty} m(O_n) leq m(E)$.
The other direction $m(O_n) geq m(E)$ is obvious since $O_n supset E$ for all $n$.
What did I miss?
measure-theory lebesgue-measure
$endgroup$
add a comment |
$begingroup$
Consider $E = mathbb{R} times {0}$ in $mathbb{R}^2$. Apparaently this set (the x-axis) has measure zero. However, consider the following set
$$O_n = big{mathbb{R} times big(-frac{1}{n}, frac{1}{n}big)big} $$
and $lim_{n to infty} m(O_n) = lim_{n to infty} frac{2}{n} times infty neq 0$, where $m(*)$ is the Lebesgue measure.
Therefore, we don't have $lim_{n to infty} m(O_n) = m(E)$.
Can you debunk my false proof of $lim_{n to infty} m(O_n) = m(E)$?
Since $E$ is Lebesgue measurable, there is an open set $F$ such that $m(Fsetminus E) < epsilon$. Find $n$ such that $O_n subset F$ and $m(O_n) leq m(E) + epsilon$, because $O_n$ can be made arbitrarily close to $E$. $epsilon$ being arbitrary implies $m(O_n) leq m(E)$ and $n to infty$ shows $lim_{n to infty} m(O_n) leq m(E)$.
The other direction $m(O_n) geq m(E)$ is obvious since $O_n supset E$ for all $n$.
What did I miss?
measure-theory lebesgue-measure
$endgroup$
$begingroup$
If $O_n = big{mathbb{R} times big(-frac{1}{n}, frac{1}{n}big)big} $ then $O_n$ is not a subset of $Bbb R^2$. Probably you meant $O_n = mathbb{R} times big(-frac{1}{n}, frac{1}{n}big) $???
$endgroup$
– David C. Ullrich
Feb 1 at 13:27
add a comment |
$begingroup$
Consider $E = mathbb{R} times {0}$ in $mathbb{R}^2$. Apparaently this set (the x-axis) has measure zero. However, consider the following set
$$O_n = big{mathbb{R} times big(-frac{1}{n}, frac{1}{n}big)big} $$
and $lim_{n to infty} m(O_n) = lim_{n to infty} frac{2}{n} times infty neq 0$, where $m(*)$ is the Lebesgue measure.
Therefore, we don't have $lim_{n to infty} m(O_n) = m(E)$.
Can you debunk my false proof of $lim_{n to infty} m(O_n) = m(E)$?
Since $E$ is Lebesgue measurable, there is an open set $F$ such that $m(Fsetminus E) < epsilon$. Find $n$ such that $O_n subset F$ and $m(O_n) leq m(E) + epsilon$, because $O_n$ can be made arbitrarily close to $E$. $epsilon$ being arbitrary implies $m(O_n) leq m(E)$ and $n to infty$ shows $lim_{n to infty} m(O_n) leq m(E)$.
The other direction $m(O_n) geq m(E)$ is obvious since $O_n supset E$ for all $n$.
What did I miss?
measure-theory lebesgue-measure
$endgroup$
Consider $E = mathbb{R} times {0}$ in $mathbb{R}^2$. Apparaently this set (the x-axis) has measure zero. However, consider the following set
$$O_n = big{mathbb{R} times big(-frac{1}{n}, frac{1}{n}big)big} $$
and $lim_{n to infty} m(O_n) = lim_{n to infty} frac{2}{n} times infty neq 0$, where $m(*)$ is the Lebesgue measure.
Therefore, we don't have $lim_{n to infty} m(O_n) = m(E)$.
Can you debunk my false proof of $lim_{n to infty} m(O_n) = m(E)$?
Since $E$ is Lebesgue measurable, there is an open set $F$ such that $m(Fsetminus E) < epsilon$. Find $n$ such that $O_n subset F$ and $m(O_n) leq m(E) + epsilon$, because $O_n$ can be made arbitrarily close to $E$. $epsilon$ being arbitrary implies $m(O_n) leq m(E)$ and $n to infty$ shows $lim_{n to infty} m(O_n) leq m(E)$.
The other direction $m(O_n) geq m(E)$ is obvious since $O_n supset E$ for all $n$.
What did I miss?
measure-theory lebesgue-measure
measure-theory lebesgue-measure
edited Feb 1 at 7:21
user1691278
asked Feb 1 at 5:45
user1691278user1691278
49939
49939
$begingroup$
If $O_n = big{mathbb{R} times big(-frac{1}{n}, frac{1}{n}big)big} $ then $O_n$ is not a subset of $Bbb R^2$. Probably you meant $O_n = mathbb{R} times big(-frac{1}{n}, frac{1}{n}big) $???
$endgroup$
– David C. Ullrich
Feb 1 at 13:27
add a comment |
$begingroup$
If $O_n = big{mathbb{R} times big(-frac{1}{n}, frac{1}{n}big)big} $ then $O_n$ is not a subset of $Bbb R^2$. Probably you meant $O_n = mathbb{R} times big(-frac{1}{n}, frac{1}{n}big) $???
$endgroup$
– David C. Ullrich
Feb 1 at 13:27
$begingroup$
If $O_n = big{mathbb{R} times big(-frac{1}{n}, frac{1}{n}big)big} $ then $O_n$ is not a subset of $Bbb R^2$. Probably you meant $O_n = mathbb{R} times big(-frac{1}{n}, frac{1}{n}big) $???
$endgroup$
– David C. Ullrich
Feb 1 at 13:27
$begingroup$
If $O_n = big{mathbb{R} times big(-frac{1}{n}, frac{1}{n}big)big} $ then $O_n$ is not a subset of $Bbb R^2$. Probably you meant $O_n = mathbb{R} times big(-frac{1}{n}, frac{1}{n}big) $???
$endgroup$
– David C. Ullrich
Feb 1 at 13:27
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
There is not necessarily any $n$ such that $O_nsubset F$, since $F$ might shrink arbitrarily close to $E$ as $x$ grows. For instance, $F$ might be ${(x,y):|y|<1/(x^2+1)}$.
$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%2f3095866%2fdebunking-a-false-proof%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$
There is not necessarily any $n$ such that $O_nsubset F$, since $F$ might shrink arbitrarily close to $E$ as $x$ grows. For instance, $F$ might be ${(x,y):|y|<1/(x^2+1)}$.
$endgroup$
add a comment |
$begingroup$
There is not necessarily any $n$ such that $O_nsubset F$, since $F$ might shrink arbitrarily close to $E$ as $x$ grows. For instance, $F$ might be ${(x,y):|y|<1/(x^2+1)}$.
$endgroup$
add a comment |
$begingroup$
There is not necessarily any $n$ such that $O_nsubset F$, since $F$ might shrink arbitrarily close to $E$ as $x$ grows. For instance, $F$ might be ${(x,y):|y|<1/(x^2+1)}$.
$endgroup$
There is not necessarily any $n$ such that $O_nsubset F$, since $F$ might shrink arbitrarily close to $E$ as $x$ grows. For instance, $F$ might be ${(x,y):|y|<1/(x^2+1)}$.
answered Feb 1 at 6:36
Eric WofseyEric Wofsey
192k14220352
192k14220352
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%2f3095866%2fdebunking-a-false-proof%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
$begingroup$
If $O_n = big{mathbb{R} times big(-frac{1}{n}, frac{1}{n}big)big} $ then $O_n$ is not a subset of $Bbb R^2$. Probably you meant $O_n = mathbb{R} times big(-frac{1}{n}, frac{1}{n}big) $???
$endgroup$
– David C. Ullrich
Feb 1 at 13:27