13.4: Atoms of a Boolean Algebra

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; \lor , \land, \bar{}{\hspace{3 pt}}]\text{,}\) whose ordering diagram is depicted in Figure \(\PageIndex{1}\)

Figure \(\PageIndex{1}\): Illustration of the atom concept

We note that \(1 = a_1 \lor a_2 \lor a_3\text{,}\) \(b_1 = a_1 \lor a_2\text{,}\) \(b_2 = a_1 \lor a_3\text{,}\) and \(b_3 = a_2 \lor 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, \hspace{1 mm}^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.

Definition \(\PageIndex{1}\): Atom

A non-least element \(a\) in a Boolean algebra \([B; \lor , \land, \bar{}\hspace{3 pt}]\) is called an atom if for every \(x \in B\text{,}\) \(x \land a = a\) or \(x \land a = 0\text{.}\)

The condition that \(x \land a = a\) tells us that \(x\) is a successor of \(a\text{;}\) that is, \(a \preceq x\text{,}\) as depicted in Figure \(\PageIndex{2}\)(a)

The condition \(x \land 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 \(\PageIndex{2}\)(b).

Figure \(\PageIndex{2}\): Conditions for an atom

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

Definition \(\PageIndex{2}\): The Covering Relation

Given a Boolean algebra \([B; \lor , \land, \bar{}\hspace{3 pt}]\text{,}\) let \(x, z \in B\text{.}\) We say that \(z\) covers \(x\) iff \(x \prec z\) and there does not exist \(y \in B\) with \(x \prec y \prec z\text{.}\)

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 \(\left[D_{30}; \lor , \land, \bar{\hspace{5 mm}}\right]\) 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 \land 2 = 2\) or \(x \land 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 \(\land\) is greatest common divisor, and the poset relation is “divides.” So if \(x = 10\text{,}\) we have \(10 \land 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 \land 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 \lor 3 \lor 5 = 30\) and \(2 \lor 5 = 10\text{.}\) We state this concept formally in the following theorem, which we give without proof.

Theorem \(\PageIndex{1}\)

Let \(\mathcal{B}=[B; \lor, \land, \hspace{1 mm}^{\bar{}}] \) be any finite Boolean algebra. Let \(A = \left\{a_1, a_2, \dots ,a_n\right\}\) be the set of all atoms of \(\mathcal{B}\text{.}\) Then every element in \(B\) can be expressed uniquely as the join of a subset of \(A\text{.}\)

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 \(\left[D_{30}; \lor , \land, \land\bar{\hspace{5 mm}} \right]\) and \([\mathcal{P}(A); \cup , \cap, \hspace{1 mm}^c]\) have the same graph (that of Figure \(\PageIndex{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 \(\PageIndex{1}\), which is an arbitrary Boolean algebra of order \(8 = 2^3\text{.}\)

In these examples of a Boolean algebra of order 8, we note that each had 3 atoms and \(2^3 = 8\) number of elements, and all were isomorphic to \([\mathcal{P}(A ); \cup , \cap, \hspace{1 mm}^c]\text{,}\) where \(A = \{a, b, c\}\text{.}\) This leads us to the following questions:

• Are there any different (nonisomorphic) Boolean algebras of order 8?
• What is the relationship, if any, between finite Boolean algebras and their atoms?
• How many different (nonisomorphic) Boolean algebras are there of order 2? Order 3? Order 4? etc.

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

Theorem \(\PageIndex{2}\)

Let \(\mathcal{B}=[B; \lor, \land, -]\) be any finite Boolean algebra, and let A be the set of all atoms of \(\mathcal{B}\text{.}\) Then \([\mathcal{P}(A); \cup, \cap, {}^c]\) is isomorphic to \([B; \lor, \land, -]\)

Proof

An isomorphism that serves to prove this theorem is \(T:\mathcal{P}(A) \to B \) defined by \(T(S)= \bigvee_{a \in S}{a}\text{,}\) where \(T(\emptyset)\) is interpreted as the zero of \(\mathcal{B}\text{.}\) We leave it to the reader to prove that this is indeed an isomorphism.

Corollary \(\PageIndex{1}\)

Every finite Boolean algebra \(\mathcal{B}=[B; \lor, \land, \bar{\hspace{5 mm}}]\) has \(2^n\) elements for some positive integer \(n\text{.}\)

Proof

Let \(A\) be the set of all atoms of \(\mathcal{B}\) and let \(\left| A\right| = n\text{.}\) Then there are exactly \(2^n\) elements (subsets) in \(\mathcal{P}(A)\text{,}\)and by Theorem \(\PageIndex{2}\), \([B; \lor, \land, \bar{\hspace{5 mm}} ]\) is isomorphic to \([\mathcal{P}(A); \cup , \cap \hspace{1 mm}^c]\) and must also have \(2^n\) elements.

Corollary \(\PageIndex{2}\)

All Boolean algebras of order \(2^n\) are isomorphic to one another.

Proof

Figure \(\PageIndex{1}\): Isomorphisms to be combined

Every Boolean algebra of order \(2^n\) is isomorphic to \([\mathcal{P}(A); \cup , \cap, \hspace{1 mm}^c ]\) when \(\lvert A \rvert= n\text{.}\) Hence, if \(\mathcal{B}_1\) and \(\mathcal{B}_2\) each have \(2^n\) elements, they each have \(n\) atoms. Suppose their sets of atoms are \(A_1\) and \(A_2\text{,}\) respectively. We know there are isomorphisms \(T_1\) and \(T_2\text{,}\) where \(T_i:\mathcal{B}_i \to \mathcal{P}(A_i)\text{,}\) \(i=1,2\text{.}\) In addition we have an isomorphism, \(N\) from \(\mathcal{P}(A_1)\) into \(\mathcal{P}(A_2)\text{,}\) which we ask you to prove in Exercise \(\PageIndex{9}\). We can combine these isomorphisms to produce the isomorphism \(T_{2}^{-1}\circ N \circ T_1:\mathcal{B}_1 \to \mathcal{B}_2\text{,}\) which proves the corollary.

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.

Exercises

Exercise \(\PageIndex{1}\)

1. Show that \(a = 2\) is an atom of the Boolean algebra \(\left[D_{30}; \lor , \land, - \right]\text{.}\)
2. Repeat part a for the elements 3 and 5 of \(D_{30}\text{.}\)
3. Verify Theorem \(\PageIndex{1}\) for the Boolean algebra \(\left[D_{30}; \lor , \land, - \right]\text{.}\)

Answer

1. For \(a = 3\) we must show that for each \(x \in D_{30}\) one of the following is true: \(x\land 3=3\) or \(x\land 3=1\text{.}\) We do this through the following table:
   \begin{equation*} \begin{array}{cc} x & \textrm{ verification} \\ \hline \begin{array}{c} 1 \\ 2 \\ 3 \\ 5 \\ 6 \\ 10 \\ 15 \\ 30 \\ \end{array} & \begin{array}{c} 1\land 3=1 \\ 2\land 3=1 \\ 3\land 3=3 \\ 5\land 3=1 \\ 6\land 3=3 \\ 20\land 3=1 \\ 15\land 3=3 \\ 30\land 3=3 \\ \end{array} \\ \end{array} \end{equation*}
   For \(a=5\text{,}\) a similar verification can be performed.
2. \(6 = 2 \lor 3\text{,}\) \(10 = 2 \lor 5\text{,}\) \(15 = 3 \lor 5\text{,}\) and \(30 = 2 \lor 3 \lor 5\text{.}\)

Exercise \(\PageIndex{2}\)

Let \(A = \{a, b, c\}\text{.}\)

1. Rewrite the definition of atom for \([\mathcal{P}(A); \cup , \cap, c ]\text{.}\) What does \(a \leq x\) mean in this example?
2. Find all atoms of \([\mathcal{P}(A); \cup , \cap, c ]\text{.}\)
3. Verify Theorem \(\PageIndex{1}\) for \([\mathcal{P}(A); c, \cup , \cap ]\text{.}\)

Exercise \(\PageIndex{3}\)

Verify Theorem \(\PageIndex{2}\) and its corollaries for the Boolean algebras in Exercises \(\PageIndex{1}\) and \(\PageIndex{2}\) of this section.

Answer

If \(B = D_{30}\textrm{ }\) 30 then \(A = \{2, 3, 5\}\) and \(D_{30}\) is isomorphic to \(\mathcal{P}(A)\text{,}\) where
\(\begin{array}{cc} 1\leftrightarrow \emptyset \textrm{ } & 5\leftrightarrow \{5\} \\ 2\leftrightarrow \{2\}\textrm{ } & 10\leftrightarrow \{2,5\} \\ 3\leftrightarrow \{3\}\textrm{ } & 15\leftrightarrow \{3,5\} \\ 6\leftrightarrow \{2,3\}\textrm{ } & 30\leftrightarrow \{2,3,5\} \\ \end{array}\) and \(\begin{array}{c} \textrm{ Join} \leftrightarrow \textrm{ Union} \\ \textrm{ Meet}\leftrightarrow \textrm{ Intersection} \\ \textrm{ Complement}\leftrightarrow \textrm{ Set} \textrm{ Complement} \\ \end{array}\)

Exercise \(\PageIndex{4}\)

Give an example of a Boolean algebra of order 16 whose elements are certain subsets of the set \(\{1, 2, 3, 4, 5, 6, 7\}\)

Exercise \(\PageIndex{5}\)

Corollary \(\PageIndex{1}\) implies that there do not exist Boolean algebras of orders 3, 5, 6, 7, 9, etc. (orders different from \(2^n\)). Without this corollary, directly show that we cannot have a Boolean algebra of order 3.

Hint

Assume that \([B; \lor , \land, - ]\) is a Boolean algebra of order 3 where \(B = \{0, x, 1\}\) and show that this cannot happen by investigating the possibilities for its operation tables.

Answer

Assume that \(x \neq 0 \textrm{ or } 1\) is the third element of a Boolean algebra. Then there is only one possible set of tables for join and meet, all following from required properties of the Boolean algebra.

\begin{equation*} \begin{array}{lr} \begin{array}{c|c} \lor & \begin{array}{ccc} 0 & x & 1 \\ \end{array} \\ \hline \begin{array}{c} 0 \\ x \\ 1 \\ \end{array} & \begin{array}{ccc} 0 & x & 1 \\ x & x & 1 \\ 1 & 1 & 1 \\ \end{array} \\ \end{array} & \begin{array}{c|c} \land & \begin{array}{ccc} 0 & x & 1 \\ \end{array} \\ \hline \begin{array}{c} 0 \\ x \\ 1 \\ \end{array} & \begin{array}{ccc} 0 & 0 & 0 \\ 0 & x & x \\ 0 & x & 1 \\ \end{array} \\ \end{array} \end{array} \end{equation*}

Next, to find the complement of \(x\) we want \(y\) such that \(x \land y = 0\) and \(x \lor y = 1\text{.}\) No element satisfies both conditions; hence the lattice is not complemented and cannot be a Boolean algebra. The lack of a complement can also be seen from the ordering diagram from which \(\land\) and \(\lor\) must be derived.

Exercise \(\PageIndex{6}\)

1. There are many different, yet isomorphic, Boolean algebras with two elements. Describe one such Boolean algebra that is derived from a power set, \(\mathcal{P}(A)\text{,}\) under \(\subseteq\text{.}\) Describe a second that is described from \(D_n\text{,}\) for some \(n \in P\text{,}\) under “divides.”
2. Since the elements of a two-element Boolean algebra must be the greatest and least elements, 1 and 0, the tables for the operations on \(\{0, 1\}\) are determined by the Boolean algebra laws. Write out the operation tables for \([\{0, 1\}; \lor , \land, -]\text{.}\)

Exercise \(\PageIndex{7}\)

Find a Boolean algebra with a countably infinite number of elements.

Answer

Let \(X\) be any countably infinite set, such as the integers. A subset of \(X\) is cofinite if it is finite or its complement is finite. The set of all cofinite subsets of \(X\) is:

1. Countably infinite - this might not be obvious, but here is a hint. Assume \(X=\left\{x_0,x_1,x_2,\ldots \right\}\text{.}\) For each finite subset \(A\) of \(X\text{,}\) map that set to the integer \(\sum _{i=0}^{\infty } \chi _A \left(x_i\right)2^i\) You can do a similar thing to sets that have a finite complement, but map them to negative integers. Only one minor adjustment needs to be made to accommodate both the empty set and \(X\text{.}\)
2. Closed under union
3. Closed under intersection, and
4. Closed under complementation.

Therefore, if \(B =\{A \subseteq X : A \textrm{ is cofinite}\}\text{,}\) then \(B\) is a countable Boolean algebra under the usual set operations.

Exercise \(\PageIndex{8}\)

Prove that the direct product of two Boolean algebras is a Boolean algebra.

Hint

“Copy” the corresponding proof for groups in Section 11.6.

Exercise \(\PageIndex{9}\)

Prove if two finite sets \(A_1\) and \(A_2\) both have \(n\) elements then \([\mathcal{P}(A_1); \cup , \cap, \hspace{1 mm}^c]\) is isomorphic to \([\mathcal{P}(A_2); \cup , \cap, \hspace{1 mm}^c]\)

Exercise \(\PageIndex{10}\)

Prove an element of a Boolean algebra is an atom if and only if it covers the zero element.