4
$\begingroup$

My question is a bit vague, hopefully someone can still clarify. Let $(\Omega,\mathcal F,\mathbb P)$ be a probability space and assume that $\mathcal F$ is countably generated. My question is, does there exists a Theorem asserting that there exists a $\sigma$-algebra $\mathcal E\subseteq\mathcal F$ which is generated by a countable partition and such that $\mathbb P$ on $\mathcal F$ can be well approximated by elements in $\mathcal E$? Related references are here Countably generated versus being generated by a countable partition and here Approximating a $\sigma$-algebra by a generating algebra. What I have in mind is for example that for every $F\in\mathcal F$ and every $\varepsilon>0$ there exists $E\in\mathcal E$ with $\mathbb P(F\Delta E)<\varepsilon.$ I am generally looking for a strategy to prove some property, which holds for $\sigma$-algebras generated by countably partition, for countably generated $\sigma$-algebra...

After the answer of Michael Greinecker, I realized that what I am really looking for is a Theorem stating something similar to what follows: Let $(\Omega,\mathcal F,\mathbb P)$ be a probability space as above. Let $\varepsilon>0.$ Does there exists a $\sigma$-algebra $\mathcal E_\varepsilon$ which is generated by a countable partition and such that for every $F\in\mathcal F$ there exists $E\in\mathcal E$ with $$\mathbb P(F\Delta E)<\varepsilon?$$

$\endgroup$
  • $\begingroup$ Define "well approximated". $\endgroup$ – Did Mar 25 '14 at 21:09
  • $\begingroup$ Ok, I added two sentences. So in one link that a gave, there is a possible definition of what can be meant by "well approximated"...(sorry, it's vague, I know). but general comments are welcome $\endgroup$ – Andy Teich Mar 25 '14 at 21:22
  • 1
    $\begingroup$ In your last edit, one could take $\mathcal{E}_\epsilon=\mathcal{F}$. I doubt this is really what you are looking for. $\endgroup$ – Michael Greinecker Mar 26 '14 at 8:19
  • $\begingroup$ @MichaelGreinecker: thanks, I changed it now! $\endgroup$ – Andy Teich Mar 26 '14 at 16:05
  • $\begingroup$ Still, my answer shows that as long as $\epsilon<1/2$, a positive answer is not possible if the probability space has no atoms. $\endgroup$ – Michael Greinecker Mar 26 '14 at 18:09
2
$\begingroup$

Let $(\Omega,\mathcal{F},\mu)$ be an atomless probability space and let $\mathcal{P}=\{P_0,P_1,\ldots\}$ be a countable measurable partition of $\Omega$. Let $A_n$ be a measurable subset of $P_n$ with half the probability of $P_n$ for each $n$. Let $A=\bigcup_n A_n$. Let $B$ be in the $\sigma$-algebra generated by $\mathcal{P}$. There is $I\subseteq\mathbb{N}$ such that $B=\bigcup_{n\in I}P_n$. We have $$A\triangle B=A\backslash B\cup B\backslash A=A\Big\backslash \bigcup_{n\in I}P_n\cup \bigcup_{n\in I}P_n\Big\backslash A=\bigcup_{n\in\mathbb{N}}A_n\Big\backslash \bigcup_{n\in I}P_n\cup \bigcup_{n\in I}P_n\Big\backslash\bigcup_{n\in\mathbb{N}}A_n$$ $$=\bigcup_{n\in\mathbb{N}\backslash I}A_n\cup \bigcup_{n\in I}P_n\backslash A_n.$$ This allows us to write $A\triangle B$ as the countable union of disjoint sets. Now $$\mu(A\triangle B)=\mu\bigg( \bigcup_{n\in\mathbb{N}\backslash I}A_n\cup \bigcup_{n\in I}P_n\backslash A_n\bigg)=\sum_{n\in\mathbb{N}\backslash I}\mu(A_n)+\sum_{n\in I}\mu(P_n/A_n)$$ $$=\sum_{n\in\mathbb{N}\backslash I}\mu(P_n)/2+\sum_{n\in I}\mu(P_n)/2=1/2 \sum_{n\in\mathbb{N}}\mu(P_n)=1/2.$$ Since $B$ was arbitrary, we see that the conjecture does not hold.

$\endgroup$
  • $\begingroup$ Thanks for the very nice example...but in your example, one could use a finer partition so that your example wouldn't be a counter example. So an attempt to define what I mean by "approximate" could be to consider sequences of partitions $\mathcal E_n$ which in some sense converge to the separable $\sigma$-algebra $\mathcal F$. Comments are welcome $\endgroup$ – Andy Teich Mar 25 '14 at 23:25
  • $\begingroup$ Or formulated otherwise: For $(\Omega,\mathcal F,\mu)$ given, can we find a $\sigma$-algebra $\mathcal E\subseteq\mathcal F$ which is generated by a countable partition and such that all elements in $\mathcal F$ are approximable by elements in $\mathcal E$? $\endgroup$ – Andy Teich Mar 25 '14 at 23:30
  • $\begingroup$ @AndyTeich My construction shows that in an atomless probability space, even if the underlying $\sigma$-algebra is countably generated (like the Borel sets in $\mathbb{R}$), no countable partition approximates all measurable sets. One can even show that for each such partition, there exists a sub-$\sigma$-algebra that is stochastically independent of the partition and on which the probability measure is atomless. $\endgroup$ – Michael Greinecker Mar 26 '14 at 0:35
  • $\begingroup$ The problem is essentially that one wants to approximate all measurable sets uniformly. If one is willing to give up this uniformity, one can do a lot with the martingale convergence theorem. $\endgroup$ – Michael Greinecker Mar 26 '14 at 0:36

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.