Prove that if $A_n$, $ninmathbb{N}$, are mutually disjoint, then $P(cup_n A_n)=sum_n P(A_n)$
$begingroup$
I gave this problem a try and I feel like I am missing something and I wanted to get some help on what I might be missing.
Suppose $Omega$ is a countable space and $p:Omegato[0,1]$ is such that $sum_{omegainOmega}p(omega)=1$.
For $AsubsetOmega$ let $P(A)=sum_{omegain A}p(omega)$ with $P(varnothing)=0$. Prove that if $A_n$, $ninmathbb{N}$, are mutually disjoint, i.e. $A_ncap A_m=varnothing$ for $mne n$, then
$P(cup_n A_n)=sum_n P(A_n)$
My try:
To show this, notice that $P(cup_n A_n)=$ (sum of the measures of the $A_n$) - (sum of the measures of the intersections of the $A_n$). Since the $A_n$ are mutually disjoint, we know that the sum of the intersections is 0. So, it follows that $P(cup_n A_n)=sum_n P(A_n)$.
probability
$endgroup$
add a comment |
$begingroup$
I gave this problem a try and I feel like I am missing something and I wanted to get some help on what I might be missing.
Suppose $Omega$ is a countable space and $p:Omegato[0,1]$ is such that $sum_{omegainOmega}p(omega)=1$.
For $AsubsetOmega$ let $P(A)=sum_{omegain A}p(omega)$ with $P(varnothing)=0$. Prove that if $A_n$, $ninmathbb{N}$, are mutually disjoint, i.e. $A_ncap A_m=varnothing$ for $mne n$, then
$P(cup_n A_n)=sum_n P(A_n)$
My try:
To show this, notice that $P(cup_n A_n)=$ (sum of the measures of the $A_n$) - (sum of the measures of the intersections of the $A_n$). Since the $A_n$ are mutually disjoint, we know that the sum of the intersections is 0. So, it follows that $P(cup_n A_n)=sum_n P(A_n)$.
probability
$endgroup$
1
$begingroup$
Let $omega_1^{(n)},omega_2^{(n)},dots$ be the elements of $A_n$. Then $p(cup_n A_n) = sum_{omega in cup_n A_n} p(omega) = sum_n sum_j p(omega_j^{(n)}) = sum_n P(A_n)$, where we used that ${omega in cup_n A_n} = {omega_j^{(n)}}$, which is true by mutual disjointness.
$endgroup$
– mathworker21
Jan 10 at 3:56
$begingroup$
@mathworker21 I don't know how I hadn't think of such a simple proof and used the DCT instead...
$endgroup$
– BigbearZzz
Jan 10 at 4:13
$begingroup$
@BigbearZzz i mean, it's the definition of measure basically. but yea, nice proof lol
$endgroup$
– mathworker21
Jan 10 at 4:30
$begingroup$
My proof even rests on the assumption that $P$ is a measure so the proof is circular... In my defense I wasn't fully awake yet.
$endgroup$
– BigbearZzz
Jan 10 at 4:33
$begingroup$
Thank you very much everyone. I appreciate your time.
$endgroup$
– MathIsHard
Jan 10 at 16:42
add a comment |
$begingroup$
I gave this problem a try and I feel like I am missing something and I wanted to get some help on what I might be missing.
Suppose $Omega$ is a countable space and $p:Omegato[0,1]$ is such that $sum_{omegainOmega}p(omega)=1$.
For $AsubsetOmega$ let $P(A)=sum_{omegain A}p(omega)$ with $P(varnothing)=0$. Prove that if $A_n$, $ninmathbb{N}$, are mutually disjoint, i.e. $A_ncap A_m=varnothing$ for $mne n$, then
$P(cup_n A_n)=sum_n P(A_n)$
My try:
To show this, notice that $P(cup_n A_n)=$ (sum of the measures of the $A_n$) - (sum of the measures of the intersections of the $A_n$). Since the $A_n$ are mutually disjoint, we know that the sum of the intersections is 0. So, it follows that $P(cup_n A_n)=sum_n P(A_n)$.
probability
$endgroup$
I gave this problem a try and I feel like I am missing something and I wanted to get some help on what I might be missing.
Suppose $Omega$ is a countable space and $p:Omegato[0,1]$ is such that $sum_{omegainOmega}p(omega)=1$.
For $AsubsetOmega$ let $P(A)=sum_{omegain A}p(omega)$ with $P(varnothing)=0$. Prove that if $A_n$, $ninmathbb{N}$, are mutually disjoint, i.e. $A_ncap A_m=varnothing$ for $mne n$, then
$P(cup_n A_n)=sum_n P(A_n)$
My try:
To show this, notice that $P(cup_n A_n)=$ (sum of the measures of the $A_n$) - (sum of the measures of the intersections of the $A_n$). Since the $A_n$ are mutually disjoint, we know that the sum of the intersections is 0. So, it follows that $P(cup_n A_n)=sum_n P(A_n)$.
probability
probability
asked Jan 10 at 3:40
MathIsHardMathIsHard
1,318516
1,318516
1
$begingroup$
Let $omega_1^{(n)},omega_2^{(n)},dots$ be the elements of $A_n$. Then $p(cup_n A_n) = sum_{omega in cup_n A_n} p(omega) = sum_n sum_j p(omega_j^{(n)}) = sum_n P(A_n)$, where we used that ${omega in cup_n A_n} = {omega_j^{(n)}}$, which is true by mutual disjointness.
$endgroup$
– mathworker21
Jan 10 at 3:56
$begingroup$
@mathworker21 I don't know how I hadn't think of such a simple proof and used the DCT instead...
$endgroup$
– BigbearZzz
Jan 10 at 4:13
$begingroup$
@BigbearZzz i mean, it's the definition of measure basically. but yea, nice proof lol
$endgroup$
– mathworker21
Jan 10 at 4:30
$begingroup$
My proof even rests on the assumption that $P$ is a measure so the proof is circular... In my defense I wasn't fully awake yet.
$endgroup$
– BigbearZzz
Jan 10 at 4:33
$begingroup$
Thank you very much everyone. I appreciate your time.
$endgroup$
– MathIsHard
Jan 10 at 16:42
add a comment |
1
$begingroup$
Let $omega_1^{(n)},omega_2^{(n)},dots$ be the elements of $A_n$. Then $p(cup_n A_n) = sum_{omega in cup_n A_n} p(omega) = sum_n sum_j p(omega_j^{(n)}) = sum_n P(A_n)$, where we used that ${omega in cup_n A_n} = {omega_j^{(n)}}$, which is true by mutual disjointness.
$endgroup$
– mathworker21
Jan 10 at 3:56
$begingroup$
@mathworker21 I don't know how I hadn't think of such a simple proof and used the DCT instead...
$endgroup$
– BigbearZzz
Jan 10 at 4:13
$begingroup$
@BigbearZzz i mean, it's the definition of measure basically. but yea, nice proof lol
$endgroup$
– mathworker21
Jan 10 at 4:30
$begingroup$
My proof even rests on the assumption that $P$ is a measure so the proof is circular... In my defense I wasn't fully awake yet.
$endgroup$
– BigbearZzz
Jan 10 at 4:33
$begingroup$
Thank you very much everyone. I appreciate your time.
$endgroup$
– MathIsHard
Jan 10 at 16:42
1
1
$begingroup$
Let $omega_1^{(n)},omega_2^{(n)},dots$ be the elements of $A_n$. Then $p(cup_n A_n) = sum_{omega in cup_n A_n} p(omega) = sum_n sum_j p(omega_j^{(n)}) = sum_n P(A_n)$, where we used that ${omega in cup_n A_n} = {omega_j^{(n)}}$, which is true by mutual disjointness.
$endgroup$
– mathworker21
Jan 10 at 3:56
$begingroup$
Let $omega_1^{(n)},omega_2^{(n)},dots$ be the elements of $A_n$. Then $p(cup_n A_n) = sum_{omega in cup_n A_n} p(omega) = sum_n sum_j p(omega_j^{(n)}) = sum_n P(A_n)$, where we used that ${omega in cup_n A_n} = {omega_j^{(n)}}$, which is true by mutual disjointness.
$endgroup$
– mathworker21
Jan 10 at 3:56
$begingroup$
@mathworker21 I don't know how I hadn't think of such a simple proof and used the DCT instead...
$endgroup$
– BigbearZzz
Jan 10 at 4:13
$begingroup$
@mathworker21 I don't know how I hadn't think of such a simple proof and used the DCT instead...
$endgroup$
– BigbearZzz
Jan 10 at 4:13
$begingroup$
@BigbearZzz i mean, it's the definition of measure basically. but yea, nice proof lol
$endgroup$
– mathworker21
Jan 10 at 4:30
$begingroup$
@BigbearZzz i mean, it's the definition of measure basically. but yea, nice proof lol
$endgroup$
– mathworker21
Jan 10 at 4:30
$begingroup$
My proof even rests on the assumption that $P$ is a measure so the proof is circular... In my defense I wasn't fully awake yet.
$endgroup$
– BigbearZzz
Jan 10 at 4:33
$begingroup$
My proof even rests on the assumption that $P$ is a measure so the proof is circular... In my defense I wasn't fully awake yet.
$endgroup$
– BigbearZzz
Jan 10 at 4:33
$begingroup$
Thank you very much everyone. I appreciate your time.
$endgroup$
– MathIsHard
Jan 10 at 16:42
$begingroup$
Thank you very much everyone. I appreciate your time.
$endgroup$
– MathIsHard
Jan 10 at 16:42
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
This is more a question about summation rather than probability.
We need to show that $sum_{omega in A} p(omega) = sum_n sum_{omega in A_n} p(omega)$, where $A= cup_n A_n$ and the $A_n$ are pairwise disjoint.
Note that all the index sets are subsets of $Omega$ which is countable and $p$
is non negative.
It is not hard to show that
$sum_{omega in B} p(omega) = sup_{I subset B, text{ finite}} sum_{omega in I} p(omega)$, and hence if $B subset C$ then
$sum_{omega in B} p(omega) le sum_{omega in C} p(omega)$.
Suppose $I subset A$ is finite, then $I cap A_n$ is finite and we have
$sum_{omega in I} p(omega) le sum_n sum_{omega in I cap A_n} p(omega) le sum_n sum_{omega in A_n} p(omega)$ and hence
$sum_{omega in A} p(omega) le sum_n sum_{omega in A_n} p(omega)$.
Now let $epsilon>0$ and pick $N$ such that $sum_{n le N} sum_{omega in A_n} p(omega) > sum_n sum_{omega in A_n} p(omega) - {1 over 2} epsilon$
Now choose finite $I_n subset A_n$ such that
$sum_{omega in I_n} p(omega) > sum_{omega in A_n} p(omega) - {1 over 2^{n+1}} epsilon$.
Then
begin{eqnarray}
sum_{omega in A} p(omega) &ge& sum_{n le N} sum_{omega in I_n} p(omega) \
&ge& sum_{n le N} (sum_{omega in A_n} p(omega) -{1 over 2^{n+1}} epsilon) \
&ge& sum_{n le N} sum_{omega in A_n} p(omega) -{1 over 2} epsilon \
&ge& sum_n sum_{omega in A_n} p(omega) - epsilon
end{eqnarray}
from which we get the other direction.
$endgroup$
add a comment |
$begingroup$
EDIT I've realized that this proof is circular since I assumed at the beginning of the proof that $P$ is a measure. Nevertheless, I feel like leaving it here as an example of "math made difficult", in case anyone might find it amusing.
Let $A:=bigcup_n A_n$. We shall consider the characteristic functions
$chi_{A_n}$ and recall that $P$ is the measure whose density function is $p(omega)$.
Your question can be interpreted as proving that
$$begin{align}
P(A) &= sum_{n=1}^infty int_Omega chi_{A_n},dP \
&=lim_{ntoinfty} sum_{i=1}^n int_Omega chi_{A_i},dP \
&= lim_{ntoinfty} int_Omega f_{n},dP
end{align}$$
where $f_n :=sum_{i=1}^n chi_{A_i}$.
By mutual disjoint-ness of $A_i$, we can see that $f_n=chi_{cup_{i=1}^n A_i}$ so $f_nle 1$. It is also easy to verify that $f_ntochi_A$ pointwise, hence we can apply the Dominated Convergence Theorem to conclude that
$$
lim_{ntoinfty} int_Omega f_{n},dP = int_Omega chi_A dP = P(A)
$$
which proves the assertion.
Alternatively, if you want a more "elementary" method then I think you can fix an arbitrary enumeration of $A$ and try to invoke the Riemann rearrangement theorem. I haven't work out the full details but it should be doable.
$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%2f3068207%2fprove-that-if-a-n-n-in-mathbbn-are-mutually-disjoint-then-p-cup-n-a-n%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$
This is more a question about summation rather than probability.
We need to show that $sum_{omega in A} p(omega) = sum_n sum_{omega in A_n} p(omega)$, where $A= cup_n A_n$ and the $A_n$ are pairwise disjoint.
Note that all the index sets are subsets of $Omega$ which is countable and $p$
is non negative.
It is not hard to show that
$sum_{omega in B} p(omega) = sup_{I subset B, text{ finite}} sum_{omega in I} p(omega)$, and hence if $B subset C$ then
$sum_{omega in B} p(omega) le sum_{omega in C} p(omega)$.
Suppose $I subset A$ is finite, then $I cap A_n$ is finite and we have
$sum_{omega in I} p(omega) le sum_n sum_{omega in I cap A_n} p(omega) le sum_n sum_{omega in A_n} p(omega)$ and hence
$sum_{omega in A} p(omega) le sum_n sum_{omega in A_n} p(omega)$.
Now let $epsilon>0$ and pick $N$ such that $sum_{n le N} sum_{omega in A_n} p(omega) > sum_n sum_{omega in A_n} p(omega) - {1 over 2} epsilon$
Now choose finite $I_n subset A_n$ such that
$sum_{omega in I_n} p(omega) > sum_{omega in A_n} p(omega) - {1 over 2^{n+1}} epsilon$.
Then
begin{eqnarray}
sum_{omega in A} p(omega) &ge& sum_{n le N} sum_{omega in I_n} p(omega) \
&ge& sum_{n le N} (sum_{omega in A_n} p(omega) -{1 over 2^{n+1}} epsilon) \
&ge& sum_{n le N} sum_{omega in A_n} p(omega) -{1 over 2} epsilon \
&ge& sum_n sum_{omega in A_n} p(omega) - epsilon
end{eqnarray}
from which we get the other direction.
$endgroup$
add a comment |
$begingroup$
This is more a question about summation rather than probability.
We need to show that $sum_{omega in A} p(omega) = sum_n sum_{omega in A_n} p(omega)$, where $A= cup_n A_n$ and the $A_n$ are pairwise disjoint.
Note that all the index sets are subsets of $Omega$ which is countable and $p$
is non negative.
It is not hard to show that
$sum_{omega in B} p(omega) = sup_{I subset B, text{ finite}} sum_{omega in I} p(omega)$, and hence if $B subset C$ then
$sum_{omega in B} p(omega) le sum_{omega in C} p(omega)$.
Suppose $I subset A$ is finite, then $I cap A_n$ is finite and we have
$sum_{omega in I} p(omega) le sum_n sum_{omega in I cap A_n} p(omega) le sum_n sum_{omega in A_n} p(omega)$ and hence
$sum_{omega in A} p(omega) le sum_n sum_{omega in A_n} p(omega)$.
Now let $epsilon>0$ and pick $N$ such that $sum_{n le N} sum_{omega in A_n} p(omega) > sum_n sum_{omega in A_n} p(omega) - {1 over 2} epsilon$
Now choose finite $I_n subset A_n$ such that
$sum_{omega in I_n} p(omega) > sum_{omega in A_n} p(omega) - {1 over 2^{n+1}} epsilon$.
Then
begin{eqnarray}
sum_{omega in A} p(omega) &ge& sum_{n le N} sum_{omega in I_n} p(omega) \
&ge& sum_{n le N} (sum_{omega in A_n} p(omega) -{1 over 2^{n+1}} epsilon) \
&ge& sum_{n le N} sum_{omega in A_n} p(omega) -{1 over 2} epsilon \
&ge& sum_n sum_{omega in A_n} p(omega) - epsilon
end{eqnarray}
from which we get the other direction.
$endgroup$
add a comment |
$begingroup$
This is more a question about summation rather than probability.
We need to show that $sum_{omega in A} p(omega) = sum_n sum_{omega in A_n} p(omega)$, where $A= cup_n A_n$ and the $A_n$ are pairwise disjoint.
Note that all the index sets are subsets of $Omega$ which is countable and $p$
is non negative.
It is not hard to show that
$sum_{omega in B} p(omega) = sup_{I subset B, text{ finite}} sum_{omega in I} p(omega)$, and hence if $B subset C$ then
$sum_{omega in B} p(omega) le sum_{omega in C} p(omega)$.
Suppose $I subset A$ is finite, then $I cap A_n$ is finite and we have
$sum_{omega in I} p(omega) le sum_n sum_{omega in I cap A_n} p(omega) le sum_n sum_{omega in A_n} p(omega)$ and hence
$sum_{omega in A} p(omega) le sum_n sum_{omega in A_n} p(omega)$.
Now let $epsilon>0$ and pick $N$ such that $sum_{n le N} sum_{omega in A_n} p(omega) > sum_n sum_{omega in A_n} p(omega) - {1 over 2} epsilon$
Now choose finite $I_n subset A_n$ such that
$sum_{omega in I_n} p(omega) > sum_{omega in A_n} p(omega) - {1 over 2^{n+1}} epsilon$.
Then
begin{eqnarray}
sum_{omega in A} p(omega) &ge& sum_{n le N} sum_{omega in I_n} p(omega) \
&ge& sum_{n le N} (sum_{omega in A_n} p(omega) -{1 over 2^{n+1}} epsilon) \
&ge& sum_{n le N} sum_{omega in A_n} p(omega) -{1 over 2} epsilon \
&ge& sum_n sum_{omega in A_n} p(omega) - epsilon
end{eqnarray}
from which we get the other direction.
$endgroup$
This is more a question about summation rather than probability.
We need to show that $sum_{omega in A} p(omega) = sum_n sum_{omega in A_n} p(omega)$, where $A= cup_n A_n$ and the $A_n$ are pairwise disjoint.
Note that all the index sets are subsets of $Omega$ which is countable and $p$
is non negative.
It is not hard to show that
$sum_{omega in B} p(omega) = sup_{I subset B, text{ finite}} sum_{omega in I} p(omega)$, and hence if $B subset C$ then
$sum_{omega in B} p(omega) le sum_{omega in C} p(omega)$.
Suppose $I subset A$ is finite, then $I cap A_n$ is finite and we have
$sum_{omega in I} p(omega) le sum_n sum_{omega in I cap A_n} p(omega) le sum_n sum_{omega in A_n} p(omega)$ and hence
$sum_{omega in A} p(omega) le sum_n sum_{omega in A_n} p(omega)$.
Now let $epsilon>0$ and pick $N$ such that $sum_{n le N} sum_{omega in A_n} p(omega) > sum_n sum_{omega in A_n} p(omega) - {1 over 2} epsilon$
Now choose finite $I_n subset A_n$ such that
$sum_{omega in I_n} p(omega) > sum_{omega in A_n} p(omega) - {1 over 2^{n+1}} epsilon$.
Then
begin{eqnarray}
sum_{omega in A} p(omega) &ge& sum_{n le N} sum_{omega in I_n} p(omega) \
&ge& sum_{n le N} (sum_{omega in A_n} p(omega) -{1 over 2^{n+1}} epsilon) \
&ge& sum_{n le N} sum_{omega in A_n} p(omega) -{1 over 2} epsilon \
&ge& sum_n sum_{omega in A_n} p(omega) - epsilon
end{eqnarray}
from which we get the other direction.
answered Jan 15 at 14:34
copper.hatcopper.hat
128k561161
128k561161
add a comment |
add a comment |
$begingroup$
EDIT I've realized that this proof is circular since I assumed at the beginning of the proof that $P$ is a measure. Nevertheless, I feel like leaving it here as an example of "math made difficult", in case anyone might find it amusing.
Let $A:=bigcup_n A_n$. We shall consider the characteristic functions
$chi_{A_n}$ and recall that $P$ is the measure whose density function is $p(omega)$.
Your question can be interpreted as proving that
$$begin{align}
P(A) &= sum_{n=1}^infty int_Omega chi_{A_n},dP \
&=lim_{ntoinfty} sum_{i=1}^n int_Omega chi_{A_i},dP \
&= lim_{ntoinfty} int_Omega f_{n},dP
end{align}$$
where $f_n :=sum_{i=1}^n chi_{A_i}$.
By mutual disjoint-ness of $A_i$, we can see that $f_n=chi_{cup_{i=1}^n A_i}$ so $f_nle 1$. It is also easy to verify that $f_ntochi_A$ pointwise, hence we can apply the Dominated Convergence Theorem to conclude that
$$
lim_{ntoinfty} int_Omega f_{n},dP = int_Omega chi_A dP = P(A)
$$
which proves the assertion.
Alternatively, if you want a more "elementary" method then I think you can fix an arbitrary enumeration of $A$ and try to invoke the Riemann rearrangement theorem. I haven't work out the full details but it should be doable.
$endgroup$
add a comment |
$begingroup$
EDIT I've realized that this proof is circular since I assumed at the beginning of the proof that $P$ is a measure. Nevertheless, I feel like leaving it here as an example of "math made difficult", in case anyone might find it amusing.
Let $A:=bigcup_n A_n$. We shall consider the characteristic functions
$chi_{A_n}$ and recall that $P$ is the measure whose density function is $p(omega)$.
Your question can be interpreted as proving that
$$begin{align}
P(A) &= sum_{n=1}^infty int_Omega chi_{A_n},dP \
&=lim_{ntoinfty} sum_{i=1}^n int_Omega chi_{A_i},dP \
&= lim_{ntoinfty} int_Omega f_{n},dP
end{align}$$
where $f_n :=sum_{i=1}^n chi_{A_i}$.
By mutual disjoint-ness of $A_i$, we can see that $f_n=chi_{cup_{i=1}^n A_i}$ so $f_nle 1$. It is also easy to verify that $f_ntochi_A$ pointwise, hence we can apply the Dominated Convergence Theorem to conclude that
$$
lim_{ntoinfty} int_Omega f_{n},dP = int_Omega chi_A dP = P(A)
$$
which proves the assertion.
Alternatively, if you want a more "elementary" method then I think you can fix an arbitrary enumeration of $A$ and try to invoke the Riemann rearrangement theorem. I haven't work out the full details but it should be doable.
$endgroup$
add a comment |
$begingroup$
EDIT I've realized that this proof is circular since I assumed at the beginning of the proof that $P$ is a measure. Nevertheless, I feel like leaving it here as an example of "math made difficult", in case anyone might find it amusing.
Let $A:=bigcup_n A_n$. We shall consider the characteristic functions
$chi_{A_n}$ and recall that $P$ is the measure whose density function is $p(omega)$.
Your question can be interpreted as proving that
$$begin{align}
P(A) &= sum_{n=1}^infty int_Omega chi_{A_n},dP \
&=lim_{ntoinfty} sum_{i=1}^n int_Omega chi_{A_i},dP \
&= lim_{ntoinfty} int_Omega f_{n},dP
end{align}$$
where $f_n :=sum_{i=1}^n chi_{A_i}$.
By mutual disjoint-ness of $A_i$, we can see that $f_n=chi_{cup_{i=1}^n A_i}$ so $f_nle 1$. It is also easy to verify that $f_ntochi_A$ pointwise, hence we can apply the Dominated Convergence Theorem to conclude that
$$
lim_{ntoinfty} int_Omega f_{n},dP = int_Omega chi_A dP = P(A)
$$
which proves the assertion.
Alternatively, if you want a more "elementary" method then I think you can fix an arbitrary enumeration of $A$ and try to invoke the Riemann rearrangement theorem. I haven't work out the full details but it should be doable.
$endgroup$
EDIT I've realized that this proof is circular since I assumed at the beginning of the proof that $P$ is a measure. Nevertheless, I feel like leaving it here as an example of "math made difficult", in case anyone might find it amusing.
Let $A:=bigcup_n A_n$. We shall consider the characteristic functions
$chi_{A_n}$ and recall that $P$ is the measure whose density function is $p(omega)$.
Your question can be interpreted as proving that
$$begin{align}
P(A) &= sum_{n=1}^infty int_Omega chi_{A_n},dP \
&=lim_{ntoinfty} sum_{i=1}^n int_Omega chi_{A_i},dP \
&= lim_{ntoinfty} int_Omega f_{n},dP
end{align}$$
where $f_n :=sum_{i=1}^n chi_{A_i}$.
By mutual disjoint-ness of $A_i$, we can see that $f_n=chi_{cup_{i=1}^n A_i}$ so $f_nle 1$. It is also easy to verify that $f_ntochi_A$ pointwise, hence we can apply the Dominated Convergence Theorem to conclude that
$$
lim_{ntoinfty} int_Omega f_{n},dP = int_Omega chi_A dP = P(A)
$$
which proves the assertion.
Alternatively, if you want a more "elementary" method then I think you can fix an arbitrary enumeration of $A$ and try to invoke the Riemann rearrangement theorem. I haven't work out the full details but it should be doable.
edited Jan 10 at 4:36
answered Jan 10 at 4:01
BigbearZzzBigbearZzz
9,01021652
9,01021652
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%2f3068207%2fprove-that-if-a-n-n-in-mathbbn-are-mutually-disjoint-then-p-cup-n-a-n%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
1
$begingroup$
Let $omega_1^{(n)},omega_2^{(n)},dots$ be the elements of $A_n$. Then $p(cup_n A_n) = sum_{omega in cup_n A_n} p(omega) = sum_n sum_j p(omega_j^{(n)}) = sum_n P(A_n)$, where we used that ${omega in cup_n A_n} = {omega_j^{(n)}}$, which is true by mutual disjointness.
$endgroup$
– mathworker21
Jan 10 at 3:56
$begingroup$
@mathworker21 I don't know how I hadn't think of such a simple proof and used the DCT instead...
$endgroup$
– BigbearZzz
Jan 10 at 4:13
$begingroup$
@BigbearZzz i mean, it's the definition of measure basically. but yea, nice proof lol
$endgroup$
– mathworker21
Jan 10 at 4:30
$begingroup$
My proof even rests on the assumption that $P$ is a measure so the proof is circular... In my defense I wasn't fully awake yet.
$endgroup$
– BigbearZzz
Jan 10 at 4:33
$begingroup$
Thank you very much everyone. I appreciate your time.
$endgroup$
– MathIsHard
Jan 10 at 16:42