finite fields of sets
If is a finite set then any field of subsets of (see “field ofsets” in the entry on rings of sets) can be described as the set of unionsof subsets of a partition
of .
Note that, if is a partition of and , wehave
so is a field of sets.
Now assume that is a field of subsets of a finite set. Let us define the set of “prime elements” of asfollows:
The choice of terminology “prime element” is meant to be a suggestivemnemonic of how the only divisors of a prime number are 1 and thenumber itself.
We claim that is a partition. To justify this claim, we need toshow that elements of are pairwise disjoint and that .
Suppose that and are prime elements. Since, by definition, and and is a fieldof sets, . Since , wemust either have or . In theformer case, and are disjoint, whilst in the latter case .
Suppose that is any element of . Then we claim that the set defined as
is a prime element of . To begin, note that, since is finite, a forteriori any subset of isfinite and, since fields of sets are assumed to be closed underintersection, it follows that the intersection of a susbet of is an element of , in particular .
Suppose that and . If ,then . Since is a field of sets,. Hence, by the construction of , itis the case that , hence . Together with , this implies . If , then, by construction, ,which implies .
Thus, we see that is a prime set. Since was arbitrarilychosen, this means that every element of is contained in a primeelement of , so the union of all prime elements is itself. Together with the previously shown fact that prime elementsare pairwise disjoint, this shows that the prime elements for apartition of .
Let be an arbitrary element of . Since , it is the case that . Since is a partition of ,
so every element of can be expressed as a union ofelements of .