(0,1)-category

(0,1)-topos

# Boolean algebras

## Idea

A Boolean algebra or Boolean lattice is an algebraic structure which models classical propositional calculus, roughly the fragment of the logical calculus which deals with the basic logical connectives “and”, “or”, “implies”, and “not”.

## Definitions

### General

There are many known ways of defining a Boolean algebra or Boolean lattice. Here are just a few:

• A Boolean algebra is a complemented distributive lattice.

• A Boolean algebra is a Heyting algebra $H$ satisfying the law of excluded middle, which means either

$\neg \neg = id: H \to H$

or (equivalently)

$\forall_{x \in H} x \vee \neg x = \top$
• A Boolean algebra is a lattice $L$ equipped with a function $\neg: L \to L$ satisfying

$a \wedge b \leq c \qquad iff \qquad a \leq \neg b \vee c$

### Explicitly

There are even two explicit definitions: order-theoretic and algebraic.

A Boolean lattice is a poset such that:

• there is an element $\top$ (a top element) such that $x \leq \top$ always holds;
• there is an element $\bot$ (a bottom element) such that $\bot \leq x$ always holds;
• given elements $a$ and $b$, there is an element $a \wedge b$ (a meet of $a$ and $b$) such that $x \leq a \wedge b$ holds iff $x \leq a$ and $x \leq b$;
• given elements $a$ and $b$, there is an element $a \vee b$ (a join of $a$ and $b$) such that $a \vee b \leq x$ holds iff $a \leq x$ and $b \leq x$;
• given an element $a$, there is an element $\neg{a}$ (a complement of $a$) such that $a \wedge \neg{a} \leq \bot$ and $\top \leq a \vee \neg{a}$;
• given elements $a$, $b$, and $c$, we have $a \wedge (b \vee c) \leq (a \wedge b) \vee (a \wedge c)$.

Although we don't say so, we can prove that $\top$, $\bot$, $a \wedge b$, $a \vee b$, and $\neg{a}$ are unique; this makes it more clear what the last two axioms actually mean.

Notice that a poset carries at most one Boolean algebra structure, making it property-like structure. (The same is true of Heyting algebra structure.)

Alternatively, a Boolean algebra is a set equipped with elements $\top$ and $\bot$, binary operations $\wedge$ and $\vee$, and a unary operation $\neg$, satisfying these identities:

1. $a \wedge \top = a$,
2. $a \vee \bot = a$,
3. $a \wedge (b \wedge c) = (a \wedge b) \wedge c$,
4. $a \vee (b \vee c) = (a \vee b) \vee c$,
5. $a \wedge b = b \wedge a$,
6. $a \vee b = b \vee a$,
7. $a \wedge (a \vee b) = a$,
8. $a \vee (a \wedge b) = a$,
9. $a \wedge (b \vee c) = (a \wedge b) \vee (a \wedge c)$,
10. $a \vee (b \wedge c) = (a \vee b) \wedge (a \vee c)$,
11. $a \wedge \neg{a} = \bot$,
12. $a \vee \neg{a} = \top$.

We can recover the poset structure: $a \leq b$ iff $a \wedge b = a$. There is a certain amount of redundancy or overkill in this axiom list; for example, it suffices to give just axioms 1, 2, 5, 6, 9, 10, 11, 12.

#### Principle of duality

However it is defined, the theory of Boolean algebras is self-dual in the sense that for any sentence stated in the language $(\leq, \wedge, \vee, 0, 1, \neg)$, the sentence is a theorem in the theory of Boolean algebras iff the dual sentence, obtained by interchanging $\wedge$ and $\vee$, $0$ and $1$, and replacing $\leq$ by the opposite relation $\leq^{op}$, is also a theorem.

This incredibly useful result can be rephrased in several ways; for example, if a poset $B$ is a Boolean algebra, then so is its opposite $B^{op}$.

#### Boolean rings

A Boolean ring is a ring (with identity) for which every element is idempotent: $x^2 = x$. Notice that from

$x^2 + 1 = x + 1 = (x + 1)^2 = x^2 + 2 x + 1$

the equation $2 x = 0$ follows. Also notice that commutativity comes for free, since

$x^2 + y^2 = x + y = (x + y)^2 = x^2 + x y + y x + y^2$

whence $x y + y x = 0 = x y + x y$.

Parallel to the way free commutative rings are polynomial rings, which are free $\mathbb{Z}$-modules generated from free commutative monoids, the free Boolean ring on $n$ generators may be constructed, à la Beck distributive laws, as the free $\mathbb{Z}_2$-vector space $\mathbb{Z}_2[M_n]$ generated from the commutative idempotent monoid $M_n$ on $n$ generators. The latter can be identified with the power set on an $n$-element set with multiplication given by intersection, and $\mathbb{Z}_2[M_n]$ therefore has $2^{2^n}$ elements.

The theory of Boolean algebras is equivalent to the theory of Boolean rings in the sense that their categories of models are equivalent. Given a Boolean ring, we define the operation $\wedge$ to be multiplication, and the operation $\vee$ by $x \vee y = x + y + x y$, and the operation $\neg$ by $\neg x = 1 + x$. The relation $x \leq y$ may be defined by the condition $x y = x$. In the other direction, given a Boolean algebra, we may define addition by symmetric difference: $x + y = (x \vee y) \wedge \neg(x \wedge y)$. According to this equivalence, the free Boolean ring on $n$ generators may be identified with the Boolean algebra $P(2^n)$, the power set on a set with $2^n$ elements.

The equivalence of Boolean rings and Boolean algebras was exploited by Marshall Stone to give his theory of Stone duality, in which every Boolean algebra $B$ is a Boolean algebra of sets; more particularly the Boolean algebra of clopen (closed and open) sets of a topological space $Spec(B)$, the Stone space of $B$. The notation intentionally suggests that the Stone space is the underlying space of the spectrum of $B$ as Boolean ring, taking “spectrum” in the sense of algebraic geometry.

A Stone space may be characterized abstractly as a topological space that is compact, Hausdorff, and totally disconnected. Stone duality asserts among other things that every such space is the spectrum of the Boolean algebra of its clopen subsets.

## Homomorphisms

Any lattice homomorphism automatically preserves $\neg$ and is therefore a Boolean algebra homomorphism.

Boolean algebras and Boolean algebra homomorphisms form a concrete category BoolAlg.

## Definition via Lawvere theories

The concrete category $U: BoolAlg \to Set$ is monadic: the category of Boolean algebras is the category of algebras for a finitary monad, or equivalently it is the category of algebras for a Lawvere theory. In this case the Lawvere theory is very easily described.

Ihe Lawvere theory is equivalent to the category opposite to the category of finitely generated free Boolean algebras, or of finitely generated free Boolean rings. As we observed earlier, the free Boolean algebra on $n$ elements is therefore isomorphic to $P(2^n)$, the power set of a $2^n$-element set. Applying a “toy” form of Stone duality, the opposite of the category of finitely generated free Boolean algebras is equivalent to the category of finite sets of cardinality $2^n$.

Hence the Lawvere theory is identified with the category $Fin_{2^n}$ of finite sets of cardinality $2^n$, and the category of Boolean algebras is equivalent to the category of product-preserving functors

$Fin_{2^n} \to Set.$

## Unbiased Boolean algebras

Observe that the Cauchy completion of $Fin_{2^n}$ is $Fin_+$, the category of nonempty finite sets. (Indeed, every nonempty finite set is the retract of some set with $2^n$ elements.)

###### Proposition

Let $C$ be a category with finite products, and let $i: C \hookrightarrow \widebar{C}$ be its Cauchy completion. Then $\widebar{C}$ has finite products, and the category of product-preserving functors $\widebar{C} \to Set$ is equivalent to the category of product-preserving functors $C \to Set$, via restriction along $i$.

By this proposition, the category of Boolean algebras is equivalent to the category of product-preserving functors

$Fin_+ \to Set$

We call a product-preserving functor $Fin_+ \to Set$ an unbiased Boolean algebra. The idea here is that the usual concrete way of viewing Boolean algebras is inherently biased towards sets of cardinality $2^n$. Passing to the Cauchy completion removes that bias.

## $k$-valued Post algebras

Alternatively, we could apply the previous proposition in reverse and view Boolean algebras as a concrete category in an entirely different way. For example, the Lawvere theory given by the category of finite sets of cardinality $3^n$ has the same Cauchy completion $Fin_+$. Therefore, the category of product-preserving functors

$X: Fin_{3^n} \to Set$

is also equivalent to the category of Boolean algebras. Only here, the appropriate underlying set functor sends $X$ to $X(3)$, the value at the generator $3$.

Similarly, for each fixed cardinality $k \gt 1$, there is a Lawvere theory $Fin_{k^n}$, and they all lead to Boolean algebras as the category of algebras for the theory. The difference is in the associated monadic functor, $U_k \colon Prod(Fin_{k^n}, Set) \to Set$. This concrete category is perhaps better known as the category of $k$-valued Post algebras (and is better known still when the letter $k$ is replaced by $n$).

A curious phenomenon that holds for each $k \geq 3$ (but not for $k = 2$) is as follows. Let $Un_k$ be the Lawvere subtheory of $Fin_{k^n}$ generated by just the unary operations, so that the algebras of $Un_k$ are identified with sets equipped with actions of the monoid $M_k = \hom(k, k)$ (endofunctions of the $k$-element set under composition), aka $M_k$-sets. By restriction of operations, there is an evident forgetful functor

$BoolAlg \simeq PostAlg_k \to M_k\text{-}Set$
###### Proposition

For each $k \geq 3$, the forgetful functor from $BoolAlg \to$ $M_k$-$Set$ realizes $BoolAlg$ as a full subcategory of $M_k$-Set.

Revised on November 27, 2013 05:34:39 by David Corfield (46.208.59.13)