In this lecture we describe the lattice of subalgebras of Our main tool will be a discrete version of the Stone-Weierstrass theorem. Let
be a subalgebra of
. We say that
separates
if, for any distinct points
in
, there is a function
such that
. It turns out that there is only one separating subalgebra in
Theorem 4.1. A subalgebra of
separates
if and only if
.
Proof: One direction is clear: if , then it contains all the elementary functions. If
are distinct, then
Now suppose we are given a separating subalgebra of
. Let
be an arbitrary point. By hypothesis, for each
there is a function
such that
, and by centering and scaling we can assume without loss in generality that
Now observe that
Since each of the factors in this product belongs to
and
is closed under products, we obtain
. Since
was arbitrary,
contains all the elementary functions, and since
is closed under linear combinations it is equal to
.
-QED
We are now ready to classify the subalgebras of . This is done by explicitly describing a family of subalgebras, and then using Theorem 2.3 to prove that there are no others apart from these.
Definition 4.1. A partition of is a set
of disjoint nonempty subsets of
whose union is
Each
is called a block of
The set of all partitions of
has a natural partial order called refinement order: we declare
if every block of
is a union of blocks of
. When
we say that
is coarser than
, or equivalently that
is finer than
In fact,
is a lattice, and you way wish to think about its greatest lower bound and least upper bound operations, though we do not need these for our purposes. Below is the Hasse diagram of
for
a set of four points.

Now observe that associated to every partition of
is a subalgebra
of
, namely the set of functions on
which are constant on the blocks of
Problem 4.1. Prove that is a subalgebra of
. Furthermore, show that
is isomorphic to
.
We are now ready for the classification of subalgebras of the function algebra .
Theorem 4.2. If is a subalgebra of
then
for some partition
of
. In particular, every subalgebra of a function algebra is isomorphic to a function algebra.
Proof: The proof is by induction on the cardinality of . In the base case,
is a singleton set, and
is a one-dimensional algebra. The unique partition of
is
and
is the set of functions in
which are constant on
, which is all of
For the induction step, let be a proper subalgebra of
. Then, by the Stone-Weierstrass theorem, there are distinct points
such that
for all
. This means that every function in
is constant on the the two-element set
. Thus,
is a subalgebra of
where
is the partition of
with one block
of size two and the remaining blocks of size one. By Problem 3.2, the algebra
is isomorphic
, and
Thus, by the induction hypothesis,
for
a partition of
-QED
Problem 4.2. Prove that the number of non-isomorphic subalgebras of is
.