Definitions

# Stone's representation theorem for Boolean algebras

In mathematics, Stone's representation theorem for Boolean algebras states that every Boolean algebra is isomorphic to a field of sets. The theorem is fundamental to the deeper understanding of Boolean algebra that emerged in the first half of the 20th century. The theorem was first proved by Stone (1936), and thus named in his honor. Stone was led to it by his study of the spectral theory of operators on a Hilbert space.

## Stone spaces

Each Boolean algebra B has an associated topological space, denoted here S(B), called its Stone space. The points in S(B) are the ultrafilters on B, or equivalently the homomorphisms from B to the 2-element Boolean algebra. The topology on S(X) is generated by a basis consisting of all sets of the form

$\left\{ x in S\left(X\right) mid b in x\right\},$
where b is an element of B.

For any Boolean algebra B, S(B) is a compact totally disconnected Hausdorff space; such spaces are called Stone spaces. Conversely, given any topological space X, the collection of subsets of X that are clopen (both closed and open) is a Boolean algebra.

## Representation theorem

A simple version of Stone's representation theorem states that any Boolean algebra B is isomorphic to the algebra of clopen subsets of its Stone space S(B). The full statement of the theorem uses the language of category theory; it states that there is a duality between the category of Boolean algebras and the category of Stone spaces. This duality means that in addition to the isomorphisms between Boolean algebras and their Stone spaces, each homomorphism from a Boolean algebra A to a Boolean algebra B corresponds in a natural way to a continuous function from S(B) to S(A). In other words, there is a contravariant functor that gives an equivalence between the categories. This was the first example of a nontrivial duality of categories.

The theorem is a special case of Stone duality, a more general framework for dualities between topological spaces and partially ordered sets.

The proof requires either the axiom of choice or a weakened form of it. Specifically, the theorem is equivalent to the Boolean prime ideal theorem, a weakened choice principle which states that every Boolean algebra has a prime ideal.