Why are these sets equal? From Morris H. DeGroot and Mark J. Schervish: Probability and Statistics, theorem...
"Proof. Consider the infinite sequence of events $A_1, A_2, dots,$ in which $A_1, dots, A_n$ are the $n$ given disjoint events and $A_i$ = $emptyset$ for $i > n$. Then the events in this infinite sequence are disjoint and $bigcuplimits_{i=1}^{infty} A_i$ = $bigcuplimits_{i=1}^{n} A_i$."
My question is why are the sets $bigcuplimits_{i=1}^{infty} A_i$ and $bigcuplimits_{i=1}^{n} A_i$ equal here?
I'm confused because, suppose $A_1$ = {$a_1$}, $A_2$ = {$a_2$}, and $A_3$ = {$a_3$}. Then...
$bigcuplimits_{i=1}^{infty} A_i$ = {$a_1$, $a_2$, $emptyset$}
$bigcuplimits_{i=1}^{n} A_i$ = {$a_1$, $a_2$}
So it doesn't make sense to me that these sets are equal...
elementary-set-theory elementary-probability
add a comment |
"Proof. Consider the infinite sequence of events $A_1, A_2, dots,$ in which $A_1, dots, A_n$ are the $n$ given disjoint events and $A_i$ = $emptyset$ for $i > n$. Then the events in this infinite sequence are disjoint and $bigcuplimits_{i=1}^{infty} A_i$ = $bigcuplimits_{i=1}^{n} A_i$."
My question is why are the sets $bigcuplimits_{i=1}^{infty} A_i$ and $bigcuplimits_{i=1}^{n} A_i$ equal here?
I'm confused because, suppose $A_1$ = {$a_1$}, $A_2$ = {$a_2$}, and $A_3$ = {$a_3$}. Then...
$bigcuplimits_{i=1}^{infty} A_i$ = {$a_1$, $a_2$, $emptyset$}
$bigcuplimits_{i=1}^{n} A_i$ = {$a_1$, $a_2$}
So it doesn't make sense to me that these sets are equal...
elementary-set-theory elementary-probability
1
The assumption is that $A_i=emptyset$, not that $A_i={emptyset}$.
– Lord Shark the Unknown
Dec 29 '18 at 11:00
If all the $A_i$ are empty, for $i > n$, then "adding" them to $bigcup_{i=1}^n A_i$ does not add new elements.
– Mauro ALLEGRANZA
Dec 29 '18 at 11:00
Oh that makes sense @LordSharktheUnknown, thank you!
– Andres Kiani
Dec 29 '18 at 11:01
add a comment |
"Proof. Consider the infinite sequence of events $A_1, A_2, dots,$ in which $A_1, dots, A_n$ are the $n$ given disjoint events and $A_i$ = $emptyset$ for $i > n$. Then the events in this infinite sequence are disjoint and $bigcuplimits_{i=1}^{infty} A_i$ = $bigcuplimits_{i=1}^{n} A_i$."
My question is why are the sets $bigcuplimits_{i=1}^{infty} A_i$ and $bigcuplimits_{i=1}^{n} A_i$ equal here?
I'm confused because, suppose $A_1$ = {$a_1$}, $A_2$ = {$a_2$}, and $A_3$ = {$a_3$}. Then...
$bigcuplimits_{i=1}^{infty} A_i$ = {$a_1$, $a_2$, $emptyset$}
$bigcuplimits_{i=1}^{n} A_i$ = {$a_1$, $a_2$}
So it doesn't make sense to me that these sets are equal...
elementary-set-theory elementary-probability
"Proof. Consider the infinite sequence of events $A_1, A_2, dots,$ in which $A_1, dots, A_n$ are the $n$ given disjoint events and $A_i$ = $emptyset$ for $i > n$. Then the events in this infinite sequence are disjoint and $bigcuplimits_{i=1}^{infty} A_i$ = $bigcuplimits_{i=1}^{n} A_i$."
My question is why are the sets $bigcuplimits_{i=1}^{infty} A_i$ and $bigcuplimits_{i=1}^{n} A_i$ equal here?
I'm confused because, suppose $A_1$ = {$a_1$}, $A_2$ = {$a_2$}, and $A_3$ = {$a_3$}. Then...
$bigcuplimits_{i=1}^{infty} A_i$ = {$a_1$, $a_2$, $emptyset$}
$bigcuplimits_{i=1}^{n} A_i$ = {$a_1$, $a_2$}
So it doesn't make sense to me that these sets are equal...
elementary-set-theory elementary-probability
elementary-set-theory elementary-probability
asked Dec 29 '18 at 10:56
Andres KianiAndres Kiani
52
52
1
The assumption is that $A_i=emptyset$, not that $A_i={emptyset}$.
– Lord Shark the Unknown
Dec 29 '18 at 11:00
If all the $A_i$ are empty, for $i > n$, then "adding" them to $bigcup_{i=1}^n A_i$ does not add new elements.
– Mauro ALLEGRANZA
Dec 29 '18 at 11:00
Oh that makes sense @LordSharktheUnknown, thank you!
– Andres Kiani
Dec 29 '18 at 11:01
add a comment |
1
The assumption is that $A_i=emptyset$, not that $A_i={emptyset}$.
– Lord Shark the Unknown
Dec 29 '18 at 11:00
If all the $A_i$ are empty, for $i > n$, then "adding" them to $bigcup_{i=1}^n A_i$ does not add new elements.
– Mauro ALLEGRANZA
Dec 29 '18 at 11:00
Oh that makes sense @LordSharktheUnknown, thank you!
– Andres Kiani
Dec 29 '18 at 11:01
1
1
The assumption is that $A_i=emptyset$, not that $A_i={emptyset}$.
– Lord Shark the Unknown
Dec 29 '18 at 11:00
The assumption is that $A_i=emptyset$, not that $A_i={emptyset}$.
– Lord Shark the Unknown
Dec 29 '18 at 11:00
If all the $A_i$ are empty, for $i > n$, then "adding" them to $bigcup_{i=1}^n A_i$ does not add new elements.
– Mauro ALLEGRANZA
Dec 29 '18 at 11:00
If all the $A_i$ are empty, for $i > n$, then "adding" them to $bigcup_{i=1}^n A_i$ does not add new elements.
– Mauro ALLEGRANZA
Dec 29 '18 at 11:00
Oh that makes sense @LordSharktheUnknown, thank you!
– Andres Kiani
Dec 29 '18 at 11:01
Oh that makes sense @LordSharktheUnknown, thank you!
– Andres Kiani
Dec 29 '18 at 11:01
add a comment |
1 Answer
1
active
oldest
votes
You can see it this way. Take any element $x$ from $bigcuplimits_{i = 1}^{infty} A_i$. Then, it is in one of the $A_i$ for some $i$. Since $A_i = emptyset$ for $i > n$, that $i$ has to be $leq n$. Hence, $x in bigcuplimits_{i = 1}^n A_i$. Therefore, $bigcuplimits_{i = 1}^{infty} A_i subseteq bigcuplimits_{i = 1}^n A_i$.
The reverse inclusion is trivial to prove. Hence, the two sets are equal.
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%2f3055736%2fwhy-are-these-sets-equal-from-morris-h-degroot-and-mark-j-schervish-probabil%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
You can see it this way. Take any element $x$ from $bigcuplimits_{i = 1}^{infty} A_i$. Then, it is in one of the $A_i$ for some $i$. Since $A_i = emptyset$ for $i > n$, that $i$ has to be $leq n$. Hence, $x in bigcuplimits_{i = 1}^n A_i$. Therefore, $bigcuplimits_{i = 1}^{infty} A_i subseteq bigcuplimits_{i = 1}^n A_i$.
The reverse inclusion is trivial to prove. Hence, the two sets are equal.
add a comment |
You can see it this way. Take any element $x$ from $bigcuplimits_{i = 1}^{infty} A_i$. Then, it is in one of the $A_i$ for some $i$. Since $A_i = emptyset$ for $i > n$, that $i$ has to be $leq n$. Hence, $x in bigcuplimits_{i = 1}^n A_i$. Therefore, $bigcuplimits_{i = 1}^{infty} A_i subseteq bigcuplimits_{i = 1}^n A_i$.
The reverse inclusion is trivial to prove. Hence, the two sets are equal.
add a comment |
You can see it this way. Take any element $x$ from $bigcuplimits_{i = 1}^{infty} A_i$. Then, it is in one of the $A_i$ for some $i$. Since $A_i = emptyset$ for $i > n$, that $i$ has to be $leq n$. Hence, $x in bigcuplimits_{i = 1}^n A_i$. Therefore, $bigcuplimits_{i = 1}^{infty} A_i subseteq bigcuplimits_{i = 1}^n A_i$.
The reverse inclusion is trivial to prove. Hence, the two sets are equal.
You can see it this way. Take any element $x$ from $bigcuplimits_{i = 1}^{infty} A_i$. Then, it is in one of the $A_i$ for some $i$. Since $A_i = emptyset$ for $i > n$, that $i$ has to be $leq n$. Hence, $x in bigcuplimits_{i = 1}^n A_i$. Therefore, $bigcuplimits_{i = 1}^{infty} A_i subseteq bigcuplimits_{i = 1}^n A_i$.
The reverse inclusion is trivial to prove. Hence, the two sets are equal.
answered Dec 29 '18 at 11:00
Aniruddha DeshmukhAniruddha Deshmukh
934418
934418
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%2f3055736%2fwhy-are-these-sets-equal-from-morris-h-degroot-and-mark-j-schervish-probabil%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
The assumption is that $A_i=emptyset$, not that $A_i={emptyset}$.
– Lord Shark the Unknown
Dec 29 '18 at 11:00
If all the $A_i$ are empty, for $i > n$, then "adding" them to $bigcup_{i=1}^n A_i$ does not add new elements.
– Mauro ALLEGRANZA
Dec 29 '18 at 11:00
Oh that makes sense @LordSharktheUnknown, thank you!
– Andres Kiani
Dec 29 '18 at 11:01