Proving the Borel-Cantelli LemmaHow to apply Borel-Cantelli Lemma here?Question about Royden's proof that...
What does "don't have a baby" imply or mean in this sentence?
Is it Safe to Plug an Extension Cord Into a Power Strip?
Can I do anything else with aspersions other than cast them?
What does it mean for south of due west?
Sed-Grep-Awk operations
How can I differentiate duration vs starting time
How does holding onto an active but un-used credit card affect your ability to get a loan?
Why is perturbation theory used in quantum mechanics?
Is the percentage symbol a constant?
How can changes in personality/values of a person who turned into a vampire be explained?
Can a planet be tidally unlocked?
How can I persuade an unwilling soul to become willing?
How do I make my single-minded character more interested in the main story?
Is there any danger of my neighbor having my wife's signature?
How many copper coins fit inside a cubic foot?
Is there a configuration of the 8-puzzle where locking a tile makes it harder?
What happens if both players misunderstand the game state until it's too late?
What could cause an entire planet of humans to become aphasic?
How to purchase a drop bar bike that will be converted to flat bar?
How to Build a List from Separate Lists
Why is quixotic not Quixotic (a proper adjective)?
Is there a name for this series?
Is Screenshot Time-tracking Common?
Is there a way to pause a running process on Linux systems and resume later?
Proving the Borel-Cantelli Lemma
How to apply Borel-Cantelli Lemma here?Question about Royden's proof that Lebesgue measure is countably additive.Borel-Cantelli Lemma “Corollary” in Royden and FitzpatrickBorel-Cantelli TheoremQuestion on proof of Borel-Cantelli LemmaBorel-Cantelli lemma and set-theoretic limitsApplication of Borel-Cantelli lemmaUnderstanding Borel-Cantelli lemma in measure theoryImplications of the Borel-Cantelli LemmaFirst Borel-Cantelli-Lemma - Two different proofs
$begingroup$
Let ${{E_k}}^{infty}_{k=1}$ be a countable family of measurable subsets of $mathbb{R}^d$ and that
begin{equation} % Equation (1)
sum^{infty}_{k=1}m(E_k)<infty
end{equation}
Let
begin{align*}
E&={xin mathbb{R}^d:xin E_k, text{ for infinitely many $k$ }} \
&= underset{krightarrow infty}{lim sup}(E_k).\
end{align*}
(a) Show that $E$ is measurable
(b) Prove $m(E)=0.$
My Proof Attempt:
Proof. Let the assumptions be as above. We will prove part (a) by showing that
begin{equation*}
E=cap^{infty}_{n=1}cup_{kgeq n}E_k.
end{equation*}
Hence, E would be measurable, since for every
fixed $n$, $cup_{kgeq n}E_k$ is measurable since it is a countable union of measurable sets.
Then $cap^{infty}_{n=1}cup_{kgeq n}E_k$ is the countable intersection of measurable sets.
From here, we shall denote $cup_{kgeq n}E_k$ as $S_n$.
Let $xin cap^{infty}_{n=1}S_n$. Then $xin S_n$ for every
$nin mathbb{N}$. Hence, $x$ must be in $E_k$ for infinitely many $k$, otherwise there would exist
an $Nin mathbb{N}$ such that $xnotin S_N$. Leaving $x$ out of the intersection.
Thus, $cap^{infty}_{n=1}S_nsubset E$.
Conversely, let $xin E.$
Then $xin E_k$ for infinitely many $k$. Therefore, $forall nin mathbb{N}$,
$xin S_n$. Otherwise, $exists Nin mathbb{N}$ such that $xnotin S_N$.
Which would imply that $xin E_k$ for only $k$ up to $N$, i.e. finitely many. A contradiction.
Therefore, $xin cap^{infty}_{n=1}S_n$. Hence, they contain one
another and equality holds. This proves part (1).
Now for part (b). Fix $epsilon>0$. We need to show that there exists $Nin mathbb{N}$ such that
begin{equation*}
m(S_N)leq epsilon
end{equation*}
Then since $Esubset S_N$, monotonicity of the measure would imply that $m(E)leq epsilon$.
Hence, proving our desired conclusion as we let $epsilon rightarrow 0$.
Since $sum^{infty}_{k=1}m(E_k)<infty$, there exists $Nin mathbb{N}$ such that
begin{equation*}
left| sum^{infty}_{k=N}m(E_k)right |leq epsilon
end{equation*}
By definition,
begin{equation*}
m(S_N)=m(cup_{kgeq N}E_k)=sum^{infty}_{k=N}m(E_k)
end{equation*}
Thus, $m(S_N)leq epsilon$. This completes our proof.
Any corrections of the proof, or comments on style of the proof are welcome and appreciated. Thank you all for your time.
real-analysis measure-theory proof-verification
$endgroup$
add a comment |
$begingroup$
Let ${{E_k}}^{infty}_{k=1}$ be a countable family of measurable subsets of $mathbb{R}^d$ and that
begin{equation} % Equation (1)
sum^{infty}_{k=1}m(E_k)<infty
end{equation}
Let
begin{align*}
E&={xin mathbb{R}^d:xin E_k, text{ for infinitely many $k$ }} \
&= underset{krightarrow infty}{lim sup}(E_k).\
end{align*}
(a) Show that $E$ is measurable
(b) Prove $m(E)=0.$
My Proof Attempt:
Proof. Let the assumptions be as above. We will prove part (a) by showing that
begin{equation*}
E=cap^{infty}_{n=1}cup_{kgeq n}E_k.
end{equation*}
Hence, E would be measurable, since for every
fixed $n$, $cup_{kgeq n}E_k$ is measurable since it is a countable union of measurable sets.
Then $cap^{infty}_{n=1}cup_{kgeq n}E_k$ is the countable intersection of measurable sets.
From here, we shall denote $cup_{kgeq n}E_k$ as $S_n$.
Let $xin cap^{infty}_{n=1}S_n$. Then $xin S_n$ for every
$nin mathbb{N}$. Hence, $x$ must be in $E_k$ for infinitely many $k$, otherwise there would exist
an $Nin mathbb{N}$ such that $xnotin S_N$. Leaving $x$ out of the intersection.
Thus, $cap^{infty}_{n=1}S_nsubset E$.
Conversely, let $xin E.$
Then $xin E_k$ for infinitely many $k$. Therefore, $forall nin mathbb{N}$,
$xin S_n$. Otherwise, $exists Nin mathbb{N}$ such that $xnotin S_N$.
Which would imply that $xin E_k$ for only $k$ up to $N$, i.e. finitely many. A contradiction.
Therefore, $xin cap^{infty}_{n=1}S_n$. Hence, they contain one
another and equality holds. This proves part (1).
Now for part (b). Fix $epsilon>0$. We need to show that there exists $Nin mathbb{N}$ such that
begin{equation*}
m(S_N)leq epsilon
end{equation*}
Then since $Esubset S_N$, monotonicity of the measure would imply that $m(E)leq epsilon$.
Hence, proving our desired conclusion as we let $epsilon rightarrow 0$.
Since $sum^{infty}_{k=1}m(E_k)<infty$, there exists $Nin mathbb{N}$ such that
begin{equation*}
left| sum^{infty}_{k=N}m(E_k)right |leq epsilon
end{equation*}
By definition,
begin{equation*}
m(S_N)=m(cup_{kgeq N}E_k)=sum^{infty}_{k=N}m(E_k)
end{equation*}
Thus, $m(S_N)leq epsilon$. This completes our proof.
Any corrections of the proof, or comments on style of the proof are welcome and appreciated. Thank you all for your time.
real-analysis measure-theory proof-verification
$endgroup$
add a comment |
$begingroup$
Let ${{E_k}}^{infty}_{k=1}$ be a countable family of measurable subsets of $mathbb{R}^d$ and that
begin{equation} % Equation (1)
sum^{infty}_{k=1}m(E_k)<infty
end{equation}
Let
begin{align*}
E&={xin mathbb{R}^d:xin E_k, text{ for infinitely many $k$ }} \
&= underset{krightarrow infty}{lim sup}(E_k).\
end{align*}
(a) Show that $E$ is measurable
(b) Prove $m(E)=0.$
My Proof Attempt:
Proof. Let the assumptions be as above. We will prove part (a) by showing that
begin{equation*}
E=cap^{infty}_{n=1}cup_{kgeq n}E_k.
end{equation*}
Hence, E would be measurable, since for every
fixed $n$, $cup_{kgeq n}E_k$ is measurable since it is a countable union of measurable sets.
Then $cap^{infty}_{n=1}cup_{kgeq n}E_k$ is the countable intersection of measurable sets.
From here, we shall denote $cup_{kgeq n}E_k$ as $S_n$.
Let $xin cap^{infty}_{n=1}S_n$. Then $xin S_n$ for every
$nin mathbb{N}$. Hence, $x$ must be in $E_k$ for infinitely many $k$, otherwise there would exist
an $Nin mathbb{N}$ such that $xnotin S_N$. Leaving $x$ out of the intersection.
Thus, $cap^{infty}_{n=1}S_nsubset E$.
Conversely, let $xin E.$
Then $xin E_k$ for infinitely many $k$. Therefore, $forall nin mathbb{N}$,
$xin S_n$. Otherwise, $exists Nin mathbb{N}$ such that $xnotin S_N$.
Which would imply that $xin E_k$ for only $k$ up to $N$, i.e. finitely many. A contradiction.
Therefore, $xin cap^{infty}_{n=1}S_n$. Hence, they contain one
another and equality holds. This proves part (1).
Now for part (b). Fix $epsilon>0$. We need to show that there exists $Nin mathbb{N}$ such that
begin{equation*}
m(S_N)leq epsilon
end{equation*}
Then since $Esubset S_N$, monotonicity of the measure would imply that $m(E)leq epsilon$.
Hence, proving our desired conclusion as we let $epsilon rightarrow 0$.
Since $sum^{infty}_{k=1}m(E_k)<infty$, there exists $Nin mathbb{N}$ such that
begin{equation*}
left| sum^{infty}_{k=N}m(E_k)right |leq epsilon
end{equation*}
By definition,
begin{equation*}
m(S_N)=m(cup_{kgeq N}E_k)=sum^{infty}_{k=N}m(E_k)
end{equation*}
Thus, $m(S_N)leq epsilon$. This completes our proof.
Any corrections of the proof, or comments on style of the proof are welcome and appreciated. Thank you all for your time.
real-analysis measure-theory proof-verification
$endgroup$
Let ${{E_k}}^{infty}_{k=1}$ be a countable family of measurable subsets of $mathbb{R}^d$ and that
begin{equation} % Equation (1)
sum^{infty}_{k=1}m(E_k)<infty
end{equation}
Let
begin{align*}
E&={xin mathbb{R}^d:xin E_k, text{ for infinitely many $k$ }} \
&= underset{krightarrow infty}{lim sup}(E_k).\
end{align*}
(a) Show that $E$ is measurable
(b) Prove $m(E)=0.$
My Proof Attempt:
Proof. Let the assumptions be as above. We will prove part (a) by showing that
begin{equation*}
E=cap^{infty}_{n=1}cup_{kgeq n}E_k.
end{equation*}
Hence, E would be measurable, since for every
fixed $n$, $cup_{kgeq n}E_k$ is measurable since it is a countable union of measurable sets.
Then $cap^{infty}_{n=1}cup_{kgeq n}E_k$ is the countable intersection of measurable sets.
From here, we shall denote $cup_{kgeq n}E_k$ as $S_n$.
Let $xin cap^{infty}_{n=1}S_n$. Then $xin S_n$ for every
$nin mathbb{N}$. Hence, $x$ must be in $E_k$ for infinitely many $k$, otherwise there would exist
an $Nin mathbb{N}$ such that $xnotin S_N$. Leaving $x$ out of the intersection.
Thus, $cap^{infty}_{n=1}S_nsubset E$.
Conversely, let $xin E.$
Then $xin E_k$ for infinitely many $k$. Therefore, $forall nin mathbb{N}$,
$xin S_n$. Otherwise, $exists Nin mathbb{N}$ such that $xnotin S_N$.
Which would imply that $xin E_k$ for only $k$ up to $N$, i.e. finitely many. A contradiction.
Therefore, $xin cap^{infty}_{n=1}S_n$. Hence, they contain one
another and equality holds. This proves part (1).
Now for part (b). Fix $epsilon>0$. We need to show that there exists $Nin mathbb{N}$ such that
begin{equation*}
m(S_N)leq epsilon
end{equation*}
Then since $Esubset S_N$, monotonicity of the measure would imply that $m(E)leq epsilon$.
Hence, proving our desired conclusion as we let $epsilon rightarrow 0$.
Since $sum^{infty}_{k=1}m(E_k)<infty$, there exists $Nin mathbb{N}$ such that
begin{equation*}
left| sum^{infty}_{k=N}m(E_k)right |leq epsilon
end{equation*}
By definition,
begin{equation*}
m(S_N)=m(cup_{kgeq N}E_k)=sum^{infty}_{k=N}m(E_k)
end{equation*}
Thus, $m(S_N)leq epsilon$. This completes our proof.
Any corrections of the proof, or comments on style of the proof are welcome and appreciated. Thank you all for your time.
real-analysis measure-theory proof-verification
real-analysis measure-theory proof-verification
asked 2 hours ago
Joe Man AnalysisJoe Man Analysis
45019
45019
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
The proof is almost perfect, only in the end it is not necessary true that $m(cup_{kgeq N}E_k)=sum_{k=N}^infty m(E_k)$ since the sets $E_k$ might not be pairwise disjoint. So the measure of the union is only at most the sum of measures. But in our case it doesn't change anything for the proof, since we anyway get $m(S_N)leqsum_{k=N}^infty m(E_k)leqepsilon$. Still it is important to remember the correct properties of measure.
$endgroup$
add a comment |
$begingroup$
Your proof is fine, modulo the comment in the other answer. For another approach, which I think is the way Rudin does it, note that $xin E$ if and only if the series $sum^{infty}_{k=1}1_{E_k}(x)$ diverges.
Set $s_n(x)=sum^{n}_{k=1}1_{E_k}(x).$ Then, $s_n(x)to s(x)=sum^{infty}_{k=1}1_{E_k}(x)$ and the monotone converge theorem gives $sum^{n}_{k=1}m(E_k)to sum^{infty}_{k=1}m(E_k)<infty.$ Thus, $sin L^1(m)$, so the series converges almost everywhere $m$. That is, the set on which it diverges, namely $E$, has Lebesgue measure zero and so $m(E)=0.$
Remark: since we proved that $m(E)=0,$ we get part $(a)$ for free.
$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%2f3122679%2fproving-the-borel-cantelli-lemma%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The proof is almost perfect, only in the end it is not necessary true that $m(cup_{kgeq N}E_k)=sum_{k=N}^infty m(E_k)$ since the sets $E_k$ might not be pairwise disjoint. So the measure of the union is only at most the sum of measures. But in our case it doesn't change anything for the proof, since we anyway get $m(S_N)leqsum_{k=N}^infty m(E_k)leqepsilon$. Still it is important to remember the correct properties of measure.
$endgroup$
add a comment |
$begingroup$
The proof is almost perfect, only in the end it is not necessary true that $m(cup_{kgeq N}E_k)=sum_{k=N}^infty m(E_k)$ since the sets $E_k$ might not be pairwise disjoint. So the measure of the union is only at most the sum of measures. But in our case it doesn't change anything for the proof, since we anyway get $m(S_N)leqsum_{k=N}^infty m(E_k)leqepsilon$. Still it is important to remember the correct properties of measure.
$endgroup$
add a comment |
$begingroup$
The proof is almost perfect, only in the end it is not necessary true that $m(cup_{kgeq N}E_k)=sum_{k=N}^infty m(E_k)$ since the sets $E_k$ might not be pairwise disjoint. So the measure of the union is only at most the sum of measures. But in our case it doesn't change anything for the proof, since we anyway get $m(S_N)leqsum_{k=N}^infty m(E_k)leqepsilon$. Still it is important to remember the correct properties of measure.
$endgroup$
The proof is almost perfect, only in the end it is not necessary true that $m(cup_{kgeq N}E_k)=sum_{k=N}^infty m(E_k)$ since the sets $E_k$ might not be pairwise disjoint. So the measure of the union is only at most the sum of measures. But in our case it doesn't change anything for the proof, since we anyway get $m(S_N)leqsum_{k=N}^infty m(E_k)leqepsilon$. Still it is important to remember the correct properties of measure.
answered 2 hours ago
MarkMark
9,162521
9,162521
add a comment |
add a comment |
$begingroup$
Your proof is fine, modulo the comment in the other answer. For another approach, which I think is the way Rudin does it, note that $xin E$ if and only if the series $sum^{infty}_{k=1}1_{E_k}(x)$ diverges.
Set $s_n(x)=sum^{n}_{k=1}1_{E_k}(x).$ Then, $s_n(x)to s(x)=sum^{infty}_{k=1}1_{E_k}(x)$ and the monotone converge theorem gives $sum^{n}_{k=1}m(E_k)to sum^{infty}_{k=1}m(E_k)<infty.$ Thus, $sin L^1(m)$, so the series converges almost everywhere $m$. That is, the set on which it diverges, namely $E$, has Lebesgue measure zero and so $m(E)=0.$
Remark: since we proved that $m(E)=0,$ we get part $(a)$ for free.
$endgroup$
add a comment |
$begingroup$
Your proof is fine, modulo the comment in the other answer. For another approach, which I think is the way Rudin does it, note that $xin E$ if and only if the series $sum^{infty}_{k=1}1_{E_k}(x)$ diverges.
Set $s_n(x)=sum^{n}_{k=1}1_{E_k}(x).$ Then, $s_n(x)to s(x)=sum^{infty}_{k=1}1_{E_k}(x)$ and the monotone converge theorem gives $sum^{n}_{k=1}m(E_k)to sum^{infty}_{k=1}m(E_k)<infty.$ Thus, $sin L^1(m)$, so the series converges almost everywhere $m$. That is, the set on which it diverges, namely $E$, has Lebesgue measure zero and so $m(E)=0.$
Remark: since we proved that $m(E)=0,$ we get part $(a)$ for free.
$endgroup$
add a comment |
$begingroup$
Your proof is fine, modulo the comment in the other answer. For another approach, which I think is the way Rudin does it, note that $xin E$ if and only if the series $sum^{infty}_{k=1}1_{E_k}(x)$ diverges.
Set $s_n(x)=sum^{n}_{k=1}1_{E_k}(x).$ Then, $s_n(x)to s(x)=sum^{infty}_{k=1}1_{E_k}(x)$ and the monotone converge theorem gives $sum^{n}_{k=1}m(E_k)to sum^{infty}_{k=1}m(E_k)<infty.$ Thus, $sin L^1(m)$, so the series converges almost everywhere $m$. That is, the set on which it diverges, namely $E$, has Lebesgue measure zero and so $m(E)=0.$
Remark: since we proved that $m(E)=0,$ we get part $(a)$ for free.
$endgroup$
Your proof is fine, modulo the comment in the other answer. For another approach, which I think is the way Rudin does it, note that $xin E$ if and only if the series $sum^{infty}_{k=1}1_{E_k}(x)$ diverges.
Set $s_n(x)=sum^{n}_{k=1}1_{E_k}(x).$ Then, $s_n(x)to s(x)=sum^{infty}_{k=1}1_{E_k}(x)$ and the monotone converge theorem gives $sum^{n}_{k=1}m(E_k)to sum^{infty}_{k=1}m(E_k)<infty.$ Thus, $sin L^1(m)$, so the series converges almost everywhere $m$. That is, the set on which it diverges, namely $E$, has Lebesgue measure zero and so $m(E)=0.$
Remark: since we proved that $m(E)=0,$ we get part $(a)$ for free.
answered 1 hour ago
MatematletaMatematleta
11.3k2918
11.3k2918
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%2f3122679%2fproving-the-borel-cantelli-lemma%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