Constructing the generated $sigma$-algebraIncreasing limit of sets is in union of familiesField of sets and Sigma algebra of sets$sigma$ -algebra is the smallest collection of sets which…About generated $sigma$-algebras (proof verification).(Countable) partition generated $sigma$-algebraPartition generated $sigma$-algebraDefinition of measurable space - sigma algebraA $lambda$-system $mathcalL$ that is a $pi$-system is automatically a $sigma$-field.Condition on the cardinality of $Omega$ for a countably generated sigma-algebraExample of a $sigma$-algebra in $mathbbR^n$sigma algebra v.s. topology
Japan - Plan around max visa duration
What defenses are there against being summoned by the Gate spell?
Why has Russell's definition of numbers using equivalence classes been finally abandoned? ( If it has actually been abandoned).
Can I make popcorn with any corn?
Should I join office cleaning event for free?
How is this relation reflexive?
How can I fix this gap between bookcases I made?
What is the offset in a seaplane's hull?
How old can references or sources in a thesis be?
How do I create uniquely male characters?
If Manufacturer spice model and Datasheet give different values which should I use?
Why is an old chain unsafe?
Example of a relative pronoun
Is it tax fraud for an individual to declare non-taxable revenue as taxable income? (US tax laws)
"You are your self first supporter", a more proper way to say it
Can I interfere when another PC is about to be attacked?
Why are 150k or 200k jobs considered good when there are 300k+ births a month?
Schwarzchild Radius of the Universe
How to type dʒ symbol (IPA) on Mac?
Is it possible to do 50 km distance without any previous training?
declaring a variable twice in IIFE
Email Account under attack (really) - anything I can do?
Chess with symmetric move-square
I see my dog run
Constructing the generated $sigma$-algebra
Increasing limit of sets is in union of familiesField of sets and Sigma algebra of sets$sigma$ -algebra is the smallest collection of sets which…About generated $sigma$-algebras (proof verification).(Countable) partition generated $sigma$-algebraPartition generated $sigma$-algebraDefinition of measurable space - sigma algebraA $lambda$-system $mathcalL$ that is a $pi$-system is automatically a $sigma$-field.Condition on the cardinality of $Omega$ for a countably generated sigma-algebraExample of a $sigma$-algebra in $mathbbR^n$sigma algebra v.s. topology
$begingroup$
Consider a collection $mathcalA = A_i_i in I$ where $I$ is some indexing set. I want to construct $sigma(mathcalA)$.
Let $mathcalF_0 = mathcalA$. We now construct inductively: let $mathcalF_i+1$ be the collection of sets which are formed by countable union, intersection, complementation of sets in $mathcalF_i$. This is an increasing sequence of collections.
Let $mathcalF = bigcup_i geq 0 mathcalF_i$. Is $mathcalF = sigma(mathcalA)$?
Clearly $mathcalF$ contains $mathcalA$ and the aim is to show that $mathcalF$ is a $sigma$-algebra. If we show this, then we should be done as $sigma(mathcalA)$ must contain all the sets in our construction.
It is easy to show that $mathcalF$ is closed under complementation and finite intersection, but how can one show it is closed under countable union?
Let $B_1, B_2, dots in mathcalF$. Then $B_i in mathcalF_n_i$ for some $n_i$, Let $B^'_i = bigcup_j=1^i B_j$, $m_j = operatornamemax n_1,dots,n_j$, we see that $B^'_i in mathcalF_m_i$, and we would like to show that $B = bigcup_igeq 0 B^'_i in mathcalF$.
Can we proceed further? If not, what is missing?
measure-theory elementary-set-theory
$endgroup$
add a comment |
$begingroup$
Consider a collection $mathcalA = A_i_i in I$ where $I$ is some indexing set. I want to construct $sigma(mathcalA)$.
Let $mathcalF_0 = mathcalA$. We now construct inductively: let $mathcalF_i+1$ be the collection of sets which are formed by countable union, intersection, complementation of sets in $mathcalF_i$. This is an increasing sequence of collections.
Let $mathcalF = bigcup_i geq 0 mathcalF_i$. Is $mathcalF = sigma(mathcalA)$?
Clearly $mathcalF$ contains $mathcalA$ and the aim is to show that $mathcalF$ is a $sigma$-algebra. If we show this, then we should be done as $sigma(mathcalA)$ must contain all the sets in our construction.
It is easy to show that $mathcalF$ is closed under complementation and finite intersection, but how can one show it is closed under countable union?
Let $B_1, B_2, dots in mathcalF$. Then $B_i in mathcalF_n_i$ for some $n_i$, Let $B^'_i = bigcup_j=1^i B_j$, $m_j = operatornamemax n_1,dots,n_j$, we see that $B^'_i in mathcalF_m_i$, and we would like to show that $B = bigcup_igeq 0 B^'_i in mathcalF$.
Can we proceed further? If not, what is missing?
measure-theory elementary-set-theory
$endgroup$
$begingroup$
I'm not completely convinced that this is true, as per this. There seems to be some subtlety involved. Can anyone help me out?
$endgroup$
– ArchieR577
Mar 29 at 21:18
1
$begingroup$
Seems to be not so simple. There are many books concerning this issue, see e.g. Hewitt-Stromberg "Real and abstract analysis", page 133, the PROOF OF Theorem (10.23), there a construction of $sigma(mathcal A)$ is given using kind of transfinite induction.
$endgroup$
– Yu Ding
Mar 29 at 21:21
$begingroup$
Yeah, looks like there are many more operations that we need to do and this is not sufficient. Is there an easy example of a set in $sigma(mathcalA)$ that is not in $mathcalF$?
$endgroup$
– ArchieR577
Mar 29 at 21:39
add a comment |
$begingroup$
Consider a collection $mathcalA = A_i_i in I$ where $I$ is some indexing set. I want to construct $sigma(mathcalA)$.
Let $mathcalF_0 = mathcalA$. We now construct inductively: let $mathcalF_i+1$ be the collection of sets which are formed by countable union, intersection, complementation of sets in $mathcalF_i$. This is an increasing sequence of collections.
Let $mathcalF = bigcup_i geq 0 mathcalF_i$. Is $mathcalF = sigma(mathcalA)$?
Clearly $mathcalF$ contains $mathcalA$ and the aim is to show that $mathcalF$ is a $sigma$-algebra. If we show this, then we should be done as $sigma(mathcalA)$ must contain all the sets in our construction.
It is easy to show that $mathcalF$ is closed under complementation and finite intersection, but how can one show it is closed under countable union?
Let $B_1, B_2, dots in mathcalF$. Then $B_i in mathcalF_n_i$ for some $n_i$, Let $B^'_i = bigcup_j=1^i B_j$, $m_j = operatornamemax n_1,dots,n_j$, we see that $B^'_i in mathcalF_m_i$, and we would like to show that $B = bigcup_igeq 0 B^'_i in mathcalF$.
Can we proceed further? If not, what is missing?
measure-theory elementary-set-theory
$endgroup$
Consider a collection $mathcalA = A_i_i in I$ where $I$ is some indexing set. I want to construct $sigma(mathcalA)$.
Let $mathcalF_0 = mathcalA$. We now construct inductively: let $mathcalF_i+1$ be the collection of sets which are formed by countable union, intersection, complementation of sets in $mathcalF_i$. This is an increasing sequence of collections.
Let $mathcalF = bigcup_i geq 0 mathcalF_i$. Is $mathcalF = sigma(mathcalA)$?
Clearly $mathcalF$ contains $mathcalA$ and the aim is to show that $mathcalF$ is a $sigma$-algebra. If we show this, then we should be done as $sigma(mathcalA)$ must contain all the sets in our construction.
It is easy to show that $mathcalF$ is closed under complementation and finite intersection, but how can one show it is closed under countable union?
Let $B_1, B_2, dots in mathcalF$. Then $B_i in mathcalF_n_i$ for some $n_i$, Let $B^'_i = bigcup_j=1^i B_j$, $m_j = operatornamemax n_1,dots,n_j$, we see that $B^'_i in mathcalF_m_i$, and we would like to show that $B = bigcup_igeq 0 B^'_i in mathcalF$.
Can we proceed further? If not, what is missing?
measure-theory elementary-set-theory
measure-theory elementary-set-theory
asked Mar 29 at 21:12
ArchieR577ArchieR577
114
114
$begingroup$
I'm not completely convinced that this is true, as per this. There seems to be some subtlety involved. Can anyone help me out?
$endgroup$
– ArchieR577
Mar 29 at 21:18
1
$begingroup$
Seems to be not so simple. There are many books concerning this issue, see e.g. Hewitt-Stromberg "Real and abstract analysis", page 133, the PROOF OF Theorem (10.23), there a construction of $sigma(mathcal A)$ is given using kind of transfinite induction.
$endgroup$
– Yu Ding
Mar 29 at 21:21
$begingroup$
Yeah, looks like there are many more operations that we need to do and this is not sufficient. Is there an easy example of a set in $sigma(mathcalA)$ that is not in $mathcalF$?
$endgroup$
– ArchieR577
Mar 29 at 21:39
add a comment |
$begingroup$
I'm not completely convinced that this is true, as per this. There seems to be some subtlety involved. Can anyone help me out?
$endgroup$
– ArchieR577
Mar 29 at 21:18
1
$begingroup$
Seems to be not so simple. There are many books concerning this issue, see e.g. Hewitt-Stromberg "Real and abstract analysis", page 133, the PROOF OF Theorem (10.23), there a construction of $sigma(mathcal A)$ is given using kind of transfinite induction.
$endgroup$
– Yu Ding
Mar 29 at 21:21
$begingroup$
Yeah, looks like there are many more operations that we need to do and this is not sufficient. Is there an easy example of a set in $sigma(mathcalA)$ that is not in $mathcalF$?
$endgroup$
– ArchieR577
Mar 29 at 21:39
$begingroup$
I'm not completely convinced that this is true, as per this. There seems to be some subtlety involved. Can anyone help me out?
$endgroup$
– ArchieR577
Mar 29 at 21:18
$begingroup$
I'm not completely convinced that this is true, as per this. There seems to be some subtlety involved. Can anyone help me out?
$endgroup$
– ArchieR577
Mar 29 at 21:18
1
1
$begingroup$
Seems to be not so simple. There are many books concerning this issue, see e.g. Hewitt-Stromberg "Real and abstract analysis", page 133, the PROOF OF Theorem (10.23), there a construction of $sigma(mathcal A)$ is given using kind of transfinite induction.
$endgroup$
– Yu Ding
Mar 29 at 21:21
$begingroup$
Seems to be not so simple. There are many books concerning this issue, see e.g. Hewitt-Stromberg "Real and abstract analysis", page 133, the PROOF OF Theorem (10.23), there a construction of $sigma(mathcal A)$ is given using kind of transfinite induction.
$endgroup$
– Yu Ding
Mar 29 at 21:21
$begingroup$
Yeah, looks like there are many more operations that we need to do and this is not sufficient. Is there an easy example of a set in $sigma(mathcalA)$ that is not in $mathcalF$?
$endgroup$
– ArchieR577
Mar 29 at 21:39
$begingroup$
Yeah, looks like there are many more operations that we need to do and this is not sufficient. Is there an easy example of a set in $sigma(mathcalA)$ that is not in $mathcalF$?
$endgroup$
– ArchieR577
Mar 29 at 21:39
add a comment |
0
active
oldest
votes
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%2f3167624%2fconstructing-the-generated-sigma-algebra%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3167624%2fconstructing-the-generated-sigma-algebra%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
$begingroup$
I'm not completely convinced that this is true, as per this. There seems to be some subtlety involved. Can anyone help me out?
$endgroup$
– ArchieR577
Mar 29 at 21:18
1
$begingroup$
Seems to be not so simple. There are many books concerning this issue, see e.g. Hewitt-Stromberg "Real and abstract analysis", page 133, the PROOF OF Theorem (10.23), there a construction of $sigma(mathcal A)$ is given using kind of transfinite induction.
$endgroup$
– Yu Ding
Mar 29 at 21:21
$begingroup$
Yeah, looks like there are many more operations that we need to do and this is not sufficient. Is there an easy example of a set in $sigma(mathcalA)$ that is not in $mathcalF$?
$endgroup$
– ArchieR577
Mar 29 at 21:39