Complete Boolean algebra

Uses your system voice; voice and rate in settings.

Snapshot

≈ 6 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, a complete Boolean algebra is a Boolean algebra in which every subset has a supremum (least upper bound). 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, for some cardinal κ, a Boolean algebra is called κ-complete if every subset of cardinality less than or equal to κ has a supremum.

In mathematics, a complete Boolean algebra is a Boolean algebra in which every subset has a supremum (least upper bound). 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, for some cardinal κ, a Boolean algebra is called κ-complete if every subset of cardinality less than or equal to κ has a supremum.

Examples

Properties of complete Boolean algebras

Every subset of a complete Boolean algebra has a supremum, by definition; it follows that every subset also has an infimum (greatest lower bound). For a complete Boolean algebra, both infinite distributive laws hold if and only if it is isomorphic to a complete field of sets (For example, the power set of some set). For a complete Boolean algebra infinite de-Morgan's laws hold. A Boolean algebra is complete if and only if its Stone space of prime ideals is extremally disconnected. Sikorski's extension theorem states that if A is a subalgebra of a Boolean algebra B, then any homomorphism from A to a complete Boolean algebra C can be extended to a morphism from B to C.

The completion of a Boolean algebra

The completion of a Boolean algebra can be defined in several equivalent ways: 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 is 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

Unless the Axiom of Choice is relaxed, 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&nbsp;∊&nbsp;κ ω such that x(m)&nbsp;<&nbsp;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 or AC is omitted), 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.

See also

Complete lattice Complete Heyting algebra Pointless topology

References

Literature

Text derived from https://en.wikipedia.org/w/index.php?oldid=1360632589 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

2 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.