The Stone Representation theorem states that every Boolean algebra is isomorphic to a field of sets. That is, a Boolean algebra whose elements are sets, and sums, products, negation are union, intersection and complements respectively.
But the theorem doesn't say that we preserve any more than the basic Boolean structure. One of my undergrad teachers does in fact work a lot around Boolean algebras. So once I asked him,
If we have a $\sigma$-algebra (or a complete Boolean algebra) is the field of sets from Stone's theorem closed under countable unions (or arbitrary unions)?
His answer was no. But he never gave me an example.
Question. Was my professor right (probably yes), and if so, what is an example of a $\sigma$-algebra (or even a complete Boolean algebra) which is not isomorphic to any $\sigma$-field of sets (or a field of set closed under arbitrary unions)?
You probably already know examples of this without realising it!
Let $\kappa$ be an uncountable cardinal and let $P$ be the poset of finite partial injections $\kappa \to \omega$, ordered by $\supseteq$. For each $i < \kappa$ and each $n < \omega$, let $p_{i,n} : \kappa \rightharpoonup \omega$ be the partial map defined only on $i$ with value $n$. Here, an ideal of $P$ is a downward-closed subset $I \subseteq P$ with the following property:
Let $\Omega$ be the poset of ideals of $P$. Clearly, $\Omega$ is closed under arbitrary intersections, so $\Omega$ is a complete lattice. (In fact, $\Omega$ is a complete Heyting algebra, but we will not need this fact.) It is easy to see that the set $${\downarrow} (f) = \{ p \in P : p \supseteq f \}$$ is an ideal of $P$, so we get an order-embedding ${\downarrow} : P \to \Omega$. Note that it preserves all meets that exist in $P$.
I claim that there do not exist $\sigma$-prime filters of $\Omega$, i.e. upward-closed subsets $F \subset \Omega$ such that:
Indeed, suppose $F$ is a $\sigma$-prime filter of $\Omega$. Then $\bigvee_{n < \omega} {\downarrow} (p_{i,n})$ is the top element of $\Omega$; hence, for some $f (i) < \omega$, ${\downarrow} (p_{i, f(i)}) \in F$. (In fact, $f (i)$ is uniquely determined by $F$.) Moreover, ${\downarrow} (p_{i, f(i)}) \cap {\downarrow} (p_{j, f(j)}) = {\downarrow} (p_{i, f(i)} \land p_{j, f(j)}) \in F$, so $i \ne j$ implies $f (i) \ne f (j)$. So we have an injective total map $f : \kappa \to \omega$ – a contradiction!
It follows from the claim that every monotone map $\Omega \to 2$ that preserves countable joins must be a constant map. In particular, there cannot exist an order-embedding $\Omega \to 2^X$ that preserves countable joins. Although $\Omega$ is not a boolean algebra, there does exist a non-trivial complete boolean algebra $B$ and an order-embedding $\Omega \to B$ which preserves arbitrary joins and finite meets. (This is a theorem of Barr, and it uses the fact that $\Omega$ is a complete Heyting algebra.) Then $B$ will be a $\sigma$-algebra not isomorphic to any $\sigma$-algebra of sets.