Applied Discrete Structures

In this section we will look more closely at something we’ve hinted at, which is that every finite Boolean algebra is isomorphic to an algebra of sets. We will show that every finite Boolean algebra has $2^n$ elements for some $n$ with precisely $n$ generators, called atoms.

Consider the Boolean algebra $[B;\vee ,\wedge ,\overline{}]\text{,}$ whose ordering diagram is depicted in Figure 13.4.1

We note that $1=a_1\vee a_2\vee a_3\text{,}$ $b_1=a_1\vee a_2\text{,}$ $b_2=a_1\vee a_3\text{,}$ and $b_3=a_2\vee a_3\text{;}$ that is, each of the elements above level one can be described completely and uniquely in terms of the elements on level one. The $a_i$’s have uniquely generated the non-least elements of $B$ much like a basis in linear algebra generates the elements in a vector space. We also note that the $a_i$’s are the immediate successors of the minimum element, 0. In any Boolean algebra, the immediate successors of the minimum element are called atoms. For example, let $A$ be any nonempty set. In the Boolean algebra $[\mathcal{P}(A);\cup ,\cap ,{}^c]$ (over $\subseteq$), the singleton sets are the generators, or atoms, of the algebraic structure since each element $\mathcal{P}(A)$ can be described completely and uniquely as the join, or union, of singleton sets.

The condition that $x\wedge a=a$ tells us that $x$ is a successor of $a\text{;}$ that is, $a⪯x\text{,}$ as depicted in Figure 13.4.3(a)

The condition $x\wedge a=0$ is true only when $x$ and $a$ are “not connected.” This occurs when $x$ is another atom or if $x$ is a successor of atoms different from $a\text{,}$ as depicted in Figure 13.4.3(b).

An alternate definition of an atom is based on the concept of “covering.”

It can be proven that the atoms of Boolean algebra are precisely those elements that cover the zero element.

The set of atoms of the Boolean algebra $[D_{30};\vee ,\wedge ,\overline{}]$ is $M=\{2,3,5\}\text{.}$ To see that $a=2$ is an atom, let $x$ be any non-least element of $D_{30}$ and note that one of the two conditions $x\wedge 2=2$ or $x\wedge 2=1$ holds. Of course, to apply the definition to this Boolean algebra, we must remind ourselves that in this case the 0-element is 1, the operation $\wedge$ is greatest common divisor, and the poset relation is “divides.” So if $x=10\text{,}$ we have $10\wedge 2=2$ (or $2\mid 10$), so Condition 1 holds. If $x=15\text{,}$ the first condition is not true. (Why?) However, Condition 2, $15\wedge 2=1\text{,}$ is true. The reader is encouraged to show that 3 and 5 also satisfy the definition of an atom. Next, if we should compute the join (the least common multiple in this case) of all possible combinations of the atoms 2, 3, and 5 to generate all nonzero (non-1 in this case) elements of $D_{30}\text{.}$ For example, $2\vee 3\vee 5=30$ and $2\vee 5=10\text{.}$ We state this concept formally in the following theorem, which we give without proof.

The least element in relation to this theorem bears noting. If we consider the empty set of atoms, we would consider the join of elements in the empty set to be the least element. This makes the statement of the theorem above a bit more tidy since we don’t need to qualify what elements can be generated from atoms.

We now ask ourselves if we can be more definitive about the structure of different Boolean algebras of a given order. Certainly, the Boolean algebras $[D_{30};\vee ,\wedge ,\wedge \overline{}]$ and $[\mathcal{P}(A);\cup ,\cap ,{}^c]$ have the same graph (that of Figure 13.4.1), the same number of atoms, and, in all respects, look the same except for the names of the elements and the operations. In fact, when we apply corresponding operations to corresponding elements, we obtain corresponding results. We know from Chapter 11 that this means that the two structures are isomorphic as Boolean algebras. Furthermore, the graphs of these examples are exactly the same as that of Figure 13.4.1, which is an arbitrary Boolean algebra of order $8=2^3\text{.}$

The answers to these questions are given in the following theorem and corollaries.

The above theorem and corollaries tell us that we can only have finite Boolean algebras of orders $2^1,2^2,2^3,..,2^n\text{,}$ and that all finite Boolean algebras of any given order are isomorphic. These are powerful tools in determining the structure of finite Boolean algebras. In the next section, we will discuss one of the easiest ways of describing a Boolean algebra of any given order.