We take . An ultrafilter on is a proper filter on a set which decides every subset: it contains but not , is closed under finite intersections and passage to supersets, and contains exactly one of and for every . A principal ultrafilter has the form ; all other ultrafilters are nonprincipal ultrafilters.
To prove existence, start with the cofinite filter and order its proper filter extensions by inclusion. The union of a chain is again a proper filter on a set: the finitely many sets involved in an intersection all belong to one member of the chain, and no member contains the empty set. Thus Zorn's lemma supplies a maximal proper filter . If , adjoining must make the generated filter improper; equivalently, some has . Then , so . This proves that is an ultrafilter. It contains the complement of every finite set and hence no finite set. In particular, it contains no singleton and is nonprincipal.
The Stone-Čech compactification of the natural numbers is the set of all ultrafilters with basic open sets
We have and , so these basic sets define a topology and are clopen sets. If , choose . The disjoint basic neighbourhoods and separate them. Thus the space is Hausdorff.
For compactness, it suffices to show every basic open cover has a finite subcover, since an arbitrary open cover can be refined by basic open sets. Suppose has no finite subcover. The complements have the finite intersection property: if a finite intersection were empty, the corresponding finite family of would cover every ultrafilter. Their generated proper filter on a set extends to an ultrafilter, by the same Zorn's lemma argument. This ultrafilter contains every , and therefore belongs to none of the alleged cover members, a contradiction. We have proved that is a compact Hausdorff space. The map embeds the discrete natural numbers densely: any nonempty contains for some .
For addition on the Stone-Čech compactification of the natural numbers, define
and put
The map preserves intersections and complements, because translation does and is an ultrafilter. It also sends to and the empty set to itself. Consequently the displayed rule defines an ultrafilter . On principal points it satisfies , so it extends ordinary addition.
Write to mean that . The ultrafilter addition rule is then an iterated quantifier, with its order fixed. Expansion gives
Ordinary addition is an associative operation, and the quantifiers are in the same order on both lines. Thus . This argument does not interchange ultrafilter quantifiers and does not assert that this extended addition is commutative.
For fixed , the translation has
a basic clopen set. Therefore addition is continuous in its left variable. This is the left-continuity convention used here: right translations are continuous, giving a left-topological semigroup. Continuity in both variables jointly is not part of the assertion.
Hindman's theorem says that every finite colouring of the positive integers has an increasing sequence whose finite-sums set
is monochromatic. Assume, as permitted, that the addition just defined has an idempotent ultrafilter , so . This ultrafilter is nonprincipal: a principal would satisfy for positive . Hence every member of is infinite and every cofinite set belongs to .
Exactly one cell of the finite colour partition belongs to . Define its star set by
Since , we have and therefore . Moreover, for each , the set belongs to . Idempotence gives , and translation of the defining formula shows
This proves the idempotent-ultrafilter star-set lemma rather than merely invoking it.
Choose . Suppose have been chosen with every nonempty finite sum in . Choose from
This is a finite intersection of members of the ultrafilter , and so it is nonempty. The new sums are and ; all lie in by the choice. Mathematical induction yields an increasing infinite sequence with
Thus the assumed idempotent gives the full Hindman theorem, with distinct increasing generators and all their nonempty finite sums of one colour.
The ultrafilter space. An ultrafilter on is a proper filter on a set: it is upward closed, closed under finite intersections, excludes , and contains exactly one of for each . The Stone-Čech compactification of the natural numbers is the set of these ultrafilters, with basic sets
They form a basis since and . Moreover , so each is a clopen set. The principal ultrafilter at embeds in this space; every nonempty contains such a point, so the embedded copy is dense.
Distinct ultrafilters have some with . Then , and are disjoint open sets separating them. Thus the space is Hausdorff.
For compactness, any open set cover can be refined to a cover by basic sets. If has no finite subcover, the sets have the finite intersection property: otherwise finitely many cover , and their basic sets cover every ultrafilter. Extend the proper filter on a set generated by these complements to an ultrafilter . This extension follows from Zorn lemma: unions of chains of proper filters remain proper, and a maximal proper filter decides every versus . Indeed, if adding made the filter improper, some existing filter member would be disjoint from , forcing into the filter. This contains every and misses every , a contradiction. Hence
This proves the compact Hausdorff topology on ultrafilters directly.
An idempotent. The addition on the Stone-Čech compactification of the natural numbers can be defined by
Associativity is supplied. For fixed , the inverse image of under is , so this translation is continuous directly from the definition. This makes a left-topological semigroup in the convention used here.
We prove the Ellis–Numakura lemma in this case. Among nonempty compact subsemigroups choose one, , minimal by inclusion. It exists by Zorn lemma: a descending chain has nonempty intersection by compactness, and that intersection is again a compact subsemigroup. For , the set is a nonempty compact subsemigroup contained in . Compactness follows from continuity; closure under addition follows from
Minimality gives . Hence there is with . The set
is nonempty, compact, and a subsemigroup: if , then . Thus minimality gives , and in particular . Therefore
This is an idempotent ultrafilter on the natural numbers.
Isolating the sequence terms. Now use the hypothetical convergent sequence of distinct ultrafilters. For each , choose with , possible since . Convergence implies for all sufficiently large . Thus only finitely many indices have . Call this finite set .
For each , choose with , using distinctness. Set
Finite-intersection closure puts in . For , either or one of the chosen is absent from ; upward closure then prevents from belonging to . Hence
Subsemigroup Created 2026-10-05 Updated 2026-10-06
A subsemigroup is a nonempty subset of a semigroup closed under its associative operation. In a compact Hausdorff space carrying a left-topological semigroup, descending chains of nonempty compact subsemigroups have a nonempty compact subsemigroup as their intersection. This supplies the minimal object used in the Ellis–Numakura lemma.