$sigma(mathcalA) = $ the set of countable unions of countable intersections of elements or complements of elements of $mathcalA$$inf_kgeq n f_k$ is measurable.Identify the smallest sigma-algebra of subsets of $mathbbR$ that contains the set [0, 1]Show that the class of countable unions and intersections of the elements of an algebra is an algebra.(Countable) partition generated $sigma$-algebraShow that $mathcalO$ forms a $sigma$-algebraproduct $sigma$-algebra equals the set of all countable unions of disjoint measurable rectangles?If $Omega = [0,1]$ and $mathcalF$ is the set of subsets $A$ such that either $A$ or $A^c$ are countable, is $mathcalF$ an ($sigma$) algebra?Proof of all finite subsets on $mathbbR$ together with complements is not a $sigma$ algebraWhy isn't minimal sigma-algebra simply the set containing all countable unions and complementsIs a monotone class which is closed under complements and finite disjoint unions a sigma-algebra?
Is there any sparring that doesn't involve punches to the head?
A newer friend of my brother's gave him a load of baseball cards that are supposedly extremely valuable. Is this a scam?
How does one intimidate enemies without having the capacity for violence?
I probably found a bug with the sudo apt install function
Do Phineas and Ferb ever actually get busted in real time?
Do any Labour MPs support no-deal?
A Journey Through Space and Time
Shell script can be run only with sh command
"which" command doesn't work / path of Safari?
How is this relation reflexive?
XeLaTeX and pdfLaTeX ignore hyphenation
How old can references or sources in a thesis be?
Type 1 Error & Type 2 Error's pregnancy test analogy: is it legit?
What would happen to a modern skyscraper if it rains micro blackholes?
How to make payment on the internet without leaving a money trail?
The use of multiple foreign keys on same column in SQL Server
Email Account under attack (really) - anything I can do?
TGV timetables / schedules?
What defenses are there against being summoned by the Gate spell?
Infinite past with a beginning?
What is the offset in a seaplane's hull?
How do we improve the relationship with a client software team that performs poorly and is becoming less collaborative?
Is the month field really deprecated?
What do you call something that goes against the spirit of the law, but is legal when interpreting the law to the letter?
$sigma(mathcalA) = $ the set of countable unions of countable intersections of elements or complements of elements of $mathcalA$
$inf_kgeq n f_k$ is measurable.Identify the smallest sigma-algebra of subsets of $mathbbR$ that contains the set [0, 1]Show that the class of countable unions and intersections of the elements of an algebra is an algebra.(Countable) partition generated $sigma$-algebraShow that $mathcalO$ forms a $sigma$-algebraproduct $sigma$-algebra equals the set of all countable unions of disjoint measurable rectangles?If $Omega = [0,1]$ and $mathcalF$ is the set of subsets $A$ such that either $A$ or $A^c$ are countable, is $mathcalF$ an ($sigma$) algebra?Proof of all finite subsets on $mathbbR$ together with complements is not a $sigma$ algebraWhy isn't minimal sigma-algebra simply the set containing all countable unions and complementsIs a monotone class which is closed under complements and finite disjoint unions a sigma-algebra?
$begingroup$
Let $mathcalA subseteq mathcalP(Omega)$, $Omega$ a set. Then isn't the set of call countable unions of countable intersections of elements or complements of elements of $mathcalA$ equal to $sigma(mathcalA)$? More precisely, $sigma(mathcalA) = cup_i=1^infty cap_j=1^infty A_j^i : A = A_j^i$ or $A = A_j^i$ for some $A in mathcalA$, for all $i,j$. If that's not true, then I'm pretty sure that if you also contain the countable $cap$ of countable $cup$ 's, then it is true.
I found it difficult trying to prove that $cap_i=1^infty cup_j=1^infty A_j^i = cap_j=1^infty cup_i=1^infty A_j^k(i,j)$, where $k :mathbbNtimesmathbbNrightarrowmathbbN$ is some onto function. So that's why I've also said it might have to include the $capcup$'s.
What do you think, is it true?
measure-theory elementary-set-theory
$endgroup$
add a comment |
$begingroup$
Let $mathcalA subseteq mathcalP(Omega)$, $Omega$ a set. Then isn't the set of call countable unions of countable intersections of elements or complements of elements of $mathcalA$ equal to $sigma(mathcalA)$? More precisely, $sigma(mathcalA) = cup_i=1^infty cap_j=1^infty A_j^i : A = A_j^i$ or $A = A_j^i$ for some $A in mathcalA$, for all $i,j$. If that's not true, then I'm pretty sure that if you also contain the countable $cap$ of countable $cup$ 's, then it is true.
I found it difficult trying to prove that $cap_i=1^infty cup_j=1^infty A_j^i = cap_j=1^infty cup_i=1^infty A_j^k(i,j)$, where $k :mathbbNtimesmathbbNrightarrowmathbbN$ is some onto function. So that's why I've also said it might have to include the $capcup$'s.
What do you think, is it true?
measure-theory elementary-set-theory
$endgroup$
2
$begingroup$
Not in general.
$endgroup$
– Andrés E. Caicedo
Jul 19 '13 at 2:49
add a comment |
$begingroup$
Let $mathcalA subseteq mathcalP(Omega)$, $Omega$ a set. Then isn't the set of call countable unions of countable intersections of elements or complements of elements of $mathcalA$ equal to $sigma(mathcalA)$? More precisely, $sigma(mathcalA) = cup_i=1^infty cap_j=1^infty A_j^i : A = A_j^i$ or $A = A_j^i$ for some $A in mathcalA$, for all $i,j$. If that's not true, then I'm pretty sure that if you also contain the countable $cap$ of countable $cup$ 's, then it is true.
I found it difficult trying to prove that $cap_i=1^infty cup_j=1^infty A_j^i = cap_j=1^infty cup_i=1^infty A_j^k(i,j)$, where $k :mathbbNtimesmathbbNrightarrowmathbbN$ is some onto function. So that's why I've also said it might have to include the $capcup$'s.
What do you think, is it true?
measure-theory elementary-set-theory
$endgroup$
Let $mathcalA subseteq mathcalP(Omega)$, $Omega$ a set. Then isn't the set of call countable unions of countable intersections of elements or complements of elements of $mathcalA$ equal to $sigma(mathcalA)$? More precisely, $sigma(mathcalA) = cup_i=1^infty cap_j=1^infty A_j^i : A = A_j^i$ or $A = A_j^i$ for some $A in mathcalA$, for all $i,j$. If that's not true, then I'm pretty sure that if you also contain the countable $cap$ of countable $cup$ 's, then it is true.
I found it difficult trying to prove that $cap_i=1^infty cup_j=1^infty A_j^i = cap_j=1^infty cup_i=1^infty A_j^k(i,j)$, where $k :mathbbNtimesmathbbNrightarrowmathbbN$ is some onto function. So that's why I've also said it might have to include the $capcup$'s.
What do you think, is it true?
measure-theory elementary-set-theory
measure-theory elementary-set-theory
asked Jul 19 '13 at 2:45
BananaCatsBananaCats
9,35052659
9,35052659
2
$begingroup$
Not in general.
$endgroup$
– Andrés E. Caicedo
Jul 19 '13 at 2:49
add a comment |
2
$begingroup$
Not in general.
$endgroup$
– Andrés E. Caicedo
Jul 19 '13 at 2:49
2
2
$begingroup$
Not in general.
$endgroup$
– Andrés E. Caicedo
Jul 19 '13 at 2:49
$begingroup$
Not in general.
$endgroup$
– Andrés E. Caicedo
Jul 19 '13 at 2:49
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Let $Sigma$ be the described set. $Omega$ is in $Sigma$ since you can construct a trivial $cupcap$ consisting of any $AinmathcalA$ and its complement. If $AinSigma$, then $A = cupcap A_j^i$, then Demorgan's law gives $A = capcup (A_j^i)^c$, which equals a $cupcap$ possibly, or if it doesn't then say we're working with the second described set. Let $(A_n)_ngeq 1$ be a sequence in $Sigma$. Then each $A_n = cupcap A_n,j^i$. A countable union of a countable union is a countable union, so $cup_n=1^inftyA_n = $ Oops!
I see now where my mistake is, we can't let the $capcup$'s in or my last statement gets ruined. But I think $cupcap =$ some $capcup$. If that's true, then this proof will work.
$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%2f447067%2fsigma-mathcala-the-set-of-countable-unions-of-countable-intersections%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$
Let $Sigma$ be the described set. $Omega$ is in $Sigma$ since you can construct a trivial $cupcap$ consisting of any $AinmathcalA$ and its complement. If $AinSigma$, then $A = cupcap A_j^i$, then Demorgan's law gives $A = capcup (A_j^i)^c$, which equals a $cupcap$ possibly, or if it doesn't then say we're working with the second described set. Let $(A_n)_ngeq 1$ be a sequence in $Sigma$. Then each $A_n = cupcap A_n,j^i$. A countable union of a countable union is a countable union, so $cup_n=1^inftyA_n = $ Oops!
I see now where my mistake is, we can't let the $capcup$'s in or my last statement gets ruined. But I think $cupcap =$ some $capcup$. If that's true, then this proof will work.
$endgroup$
add a comment |
$begingroup$
Let $Sigma$ be the described set. $Omega$ is in $Sigma$ since you can construct a trivial $cupcap$ consisting of any $AinmathcalA$ and its complement. If $AinSigma$, then $A = cupcap A_j^i$, then Demorgan's law gives $A = capcup (A_j^i)^c$, which equals a $cupcap$ possibly, or if it doesn't then say we're working with the second described set. Let $(A_n)_ngeq 1$ be a sequence in $Sigma$. Then each $A_n = cupcap A_n,j^i$. A countable union of a countable union is a countable union, so $cup_n=1^inftyA_n = $ Oops!
I see now where my mistake is, we can't let the $capcup$'s in or my last statement gets ruined. But I think $cupcap =$ some $capcup$. If that's true, then this proof will work.
$endgroup$
add a comment |
$begingroup$
Let $Sigma$ be the described set. $Omega$ is in $Sigma$ since you can construct a trivial $cupcap$ consisting of any $AinmathcalA$ and its complement. If $AinSigma$, then $A = cupcap A_j^i$, then Demorgan's law gives $A = capcup (A_j^i)^c$, which equals a $cupcap$ possibly, or if it doesn't then say we're working with the second described set. Let $(A_n)_ngeq 1$ be a sequence in $Sigma$. Then each $A_n = cupcap A_n,j^i$. A countable union of a countable union is a countable union, so $cup_n=1^inftyA_n = $ Oops!
I see now where my mistake is, we can't let the $capcup$'s in or my last statement gets ruined. But I think $cupcap =$ some $capcup$. If that's true, then this proof will work.
$endgroup$
Let $Sigma$ be the described set. $Omega$ is in $Sigma$ since you can construct a trivial $cupcap$ consisting of any $AinmathcalA$ and its complement. If $AinSigma$, then $A = cupcap A_j^i$, then Demorgan's law gives $A = capcup (A_j^i)^c$, which equals a $cupcap$ possibly, or if it doesn't then say we're working with the second described set. Let $(A_n)_ngeq 1$ be a sequence in $Sigma$. Then each $A_n = cupcap A_n,j^i$. A countable union of a countable union is a countable union, so $cup_n=1^inftyA_n = $ Oops!
I see now where my mistake is, we can't let the $capcup$'s in or my last statement gets ruined. But I think $cupcap =$ some $capcup$. If that's true, then this proof will work.
answered Jul 19 '13 at 3:02
BananaCatsBananaCats
9,35052659
9,35052659
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%2f447067%2fsigma-mathcala-the-set-of-countable-unions-of-countable-intersections%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
2
$begingroup$
Not in general.
$endgroup$
– Andrés E. Caicedo
Jul 19 '13 at 2:49