given a set closed under finite complementation and union; disprove closeness under countable union and...
The collection $mathscr{A}$ of subsets of $Omega={0,1}^{infty}$ is given by
$$mathscr{A}={StimesOmega:Ssubseteq{0,1}^{l},lge1}$$
Then, $mathscr{A}$ is closed under complementation, finite union and hence, finite intersection.
If $A_1,A_2...inmathscr{A}$, is
$(i)$ ${underset{n=1}{stackrel{infty}{bigcup}}}A_ninmathscr{A}$ ?
$(ii)$ ${underset{n=1}{stackrel{infty}{bigcap}}}A_ninmathscr{A}$ ?
Somehow, intuitively the answer is no because here, we consider countable union and intersection rather than finite union and intersection. But, I can't think of a theorem supporting this claim.
probability-theory elementary-set-theory random-walk
add a comment |
The collection $mathscr{A}$ of subsets of $Omega={0,1}^{infty}$ is given by
$$mathscr{A}={StimesOmega:Ssubseteq{0,1}^{l},lge1}$$
Then, $mathscr{A}$ is closed under complementation, finite union and hence, finite intersection.
If $A_1,A_2...inmathscr{A}$, is
$(i)$ ${underset{n=1}{stackrel{infty}{bigcup}}}A_ninmathscr{A}$ ?
$(ii)$ ${underset{n=1}{stackrel{infty}{bigcap}}}A_ninmathscr{A}$ ?
Somehow, intuitively the answer is no because here, we consider countable union and intersection rather than finite union and intersection. But, I can't think of a theorem supporting this claim.
probability-theory elementary-set-theory random-walk
add a comment |
The collection $mathscr{A}$ of subsets of $Omega={0,1}^{infty}$ is given by
$$mathscr{A}={StimesOmega:Ssubseteq{0,1}^{l},lge1}$$
Then, $mathscr{A}$ is closed under complementation, finite union and hence, finite intersection.
If $A_1,A_2...inmathscr{A}$, is
$(i)$ ${underset{n=1}{stackrel{infty}{bigcup}}}A_ninmathscr{A}$ ?
$(ii)$ ${underset{n=1}{stackrel{infty}{bigcap}}}A_ninmathscr{A}$ ?
Somehow, intuitively the answer is no because here, we consider countable union and intersection rather than finite union and intersection. But, I can't think of a theorem supporting this claim.
probability-theory elementary-set-theory random-walk
The collection $mathscr{A}$ of subsets of $Omega={0,1}^{infty}$ is given by
$$mathscr{A}={StimesOmega:Ssubseteq{0,1}^{l},lge1}$$
Then, $mathscr{A}$ is closed under complementation, finite union and hence, finite intersection.
If $A_1,A_2...inmathscr{A}$, is
$(i)$ ${underset{n=1}{stackrel{infty}{bigcup}}}A_ninmathscr{A}$ ?
$(ii)$ ${underset{n=1}{stackrel{infty}{bigcap}}}A_ninmathscr{A}$ ?
Somehow, intuitively the answer is no because here, we consider countable union and intersection rather than finite union and intersection. But, I can't think of a theorem supporting this claim.
probability-theory elementary-set-theory random-walk
probability-theory elementary-set-theory random-walk
edited 12 hours ago
asked yesterday
Za Ira
147113
147113
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
${0,0,cdots,0} times Omega$ (where there are $n$ zeros) is in $mathcal A$ for each $n$ but the intersection of these is not in$mathcal A$. For unions just take complements of these sets.
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%2f3062404%2fgiven-a-set-closed-under-finite-complementation-and-union-disprove-closeness-un%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
${0,0,cdots,0} times Omega$ (where there are $n$ zeros) is in $mathcal A$ for each $n$ but the intersection of these is not in$mathcal A$. For unions just take complements of these sets.
add a comment |
${0,0,cdots,0} times Omega$ (where there are $n$ zeros) is in $mathcal A$ for each $n$ but the intersection of these is not in$mathcal A$. For unions just take complements of these sets.
add a comment |
${0,0,cdots,0} times Omega$ (where there are $n$ zeros) is in $mathcal A$ for each $n$ but the intersection of these is not in$mathcal A$. For unions just take complements of these sets.
${0,0,cdots,0} times Omega$ (where there are $n$ zeros) is in $mathcal A$ for each $n$ but the intersection of these is not in$mathcal A$. For unions just take complements of these sets.
answered yesterday
Kavi Rama Murthy
51.2k31855
51.2k31855
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3062404%2fgiven-a-set-closed-under-finite-complementation-and-union-disprove-closeness-un%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