Added to Favorites

Related Searches

- This article is about a type of mathematical structure. For the notion from computer science, see complete Boolean algebra (computer science).

In mathematics, a complete Boolean algebra is a Boolean algebra in which every subset has a supremum. Complete Boolean algebras are used to construct boolean valued models of set theory in the theory of forcing. Every Boolean algebra A has an essentially unique completion, which is a complete Boolean algebra containing A such that every element is the supremum of some subset of A. As a partially ordered set, this completion of A is the Dedekind-MacNeille completion.

More generally, if κ is a cardinal then a Boolean algebra is called κ-complete if every subset of cardinality less than κ has a supremum.

- Every finite Boolean algebra is complete.
- The algebra of subsets of a given set is a complete Boolean algebra.
- The regular open sets of any topological space form a complete Boolean algebra. This example is of particular importance because every forcing poset can be considered as a topological space (a base for the topology consisting of sets that are the set of all elements less than or equal to a given element). The corresponding regular open algebra can be used to form Boolean-valued models which are then equivalent to generic extensions by the given forcing poset.
- The algebra of all measurable subsets of a σ-finite measure space, modulo null sets, is a complete Boolean algebra.
- The algebra of all measurable subsets of a measure space is a ℵ
_{1}-complete Boolean algebra, but is not usually complete. - The algebra of all subsets of an infinite set that are finite or have finite complement is a Boolean algebra but is not complete.
- The Boolean algebra of all Baire sets modulo meager sets in a topological space with a countable base is complete.
- Another example of a Boolean algebra that is not complete is the Boolean algebra P(ω) of all sets of natural numbers, quotiented out by the ideal Fin of finite subsets. The resulting object, denoted P(ω)/Fin, consists of all equivalence classes of sets of naturals, where the relevant equivalence relation is that two sets of naturals are equivalent if their symmetric difference is finite. The Boolean operations are defined analogously, for example, if A and B are two equivalence classes in P(ω)/Fin, we define $Aland\; B$ to be the equivalence class of $acap\; b$, where a and b are some (any) elements of A and B respectively.

- Now let a
_{0}, a_{1},... be pairwise disjoint infinite sets of naturals, and let A_{0}, A_{1},... be their corresponding equivalence classes in P(ω)/Fin . Then given any upper bound X of A_{0}, A_{1},... in P(ω)/Fin, we can find a lesser upper bound, by removing from a representative for X one element of each a_{n}. Therefore the A_{n}have no supremum.

- A Boolean algebra is complete if and only if its Stone space of prime ideals is extremely disconnected.

- The completion of A is (up to isomorphism) the unique complete Boolean algebra B containing A such that A is dense in B; this means that for every nonzero element of B there is a smaller non-zero element of A.
- The completion of A is (up to isomorphism) the unique complete Boolean algebra B containing A such that every element of B is the supremum of some subset of A.

The completion of a Boolean algebra A can be constructed in several ways:

- The completion is the Boolean algebra of regular open sets in the Stone space of prime ideals of A. Each element x of A corresponds to the open set of prime ideals not containing x (which open and closed, and therefore regular).
- The completion is the Boolean algebra of regular cuts of A. Here a cut is a subset U of A
^{+}(the non-zero elements of A) such that if q is in U and p≤q then p is in U, and is called regular if whenever p is not in U there is some r ≤ p such that U has no elements ≤r. Each element p of A corresponds to the cut of elements ≤p.

If A is a metric space and B its completion then any isometry from A to a complete metric space C can be extended to a unique isometry from B to C. The analogous statement for complete Boolean algebras is not true: a homomorphism from a Boolean algebra A to a complete Boolean algebra C cannot necessarily be extended to a (supremum preserving) homomorphism of complete Boolean algebras from the completion B of A to C. (By Sikorski's extension theorem it can be extended to a homomorphism of Boolean algebras from B to C, but this will not in general be a homomorphism of complete Boolean algebras; in other words, it need not preserve suprema.)

Free complete boolean algebras generated by a set do not exist (unless the set is finite). More precisely, for any cardinal κ, there is a complete Boolean algebra of cardinality 2^{κ} greater than κ that is generated as a complete Boolean algebra by a countable subset; for example the Boolean algebra of regular open sets in the product space κ^{ω}, where κ has the discrete topology. A countable generating set consists of all sets a_{m,n} for m, n integers, consisting of the elements x∈κ^{ω} such that x(m)<x(n). (This boolean algebra is called a collapsing algebra, because forcing with it collapses the cardinal κ onto ω.)

In particular the forgetful functor from complete Boolean algebras to sets has no left adjoint, even though it is continuous and the category of Boolean algebras is small-complete. This shows that the "solution set condition" in Freyd's adjoint functor theorem is necessary.

Given a set X, one can form the free Boolean algebra A generated by this set and then take its completion B. However B is not a "free" complete Boolean algebra generated by X (unless X is finite), because a function from X to a free Boolean algebra C cannot in general be extended to a (supremum-preserving) morphism of Boolean algebras from B to C.

On the other hand, for any fixed cardinal κ, there is a free (or universal) κ-complete Boolean algebra generated by any given set.

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Tuesday February 05, 2008 at 07:18:18 PST (GMT -0800)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Tuesday February 05, 2008 at 07:18:18 PST (GMT -0800)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2015 Dictionary.com, LLC. All rights reserved.