Closed subsemigroup of a compact group 2026-10-14
A nonempty closed subsemigroup of a compact group is a subgroup. For and a neighbourhood of the identity, choose with and cover the compact group by finitely many translates of . Two of sufficiently many powers lie in the same translate, so some positive power of belongs to . Hence the identity is a limit of positive powers and lies in . The preceding powers converge to , which also lies in . Applied to the closure of a positive-word monoid, this proves that it equals the closed subgroup generated by its generators, without assuming they already include their inverses.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 10 3 Solution 2026-10-07
Take . We first prove the Ellis–Numakura lemma in the one-sided continuity convention needed here. Let be a nonempty compact Hausdorff space with an associative multiplication for which each map is continuous. Among its nonempty closed subsemigroups, there is an inclusion-minimal one, : a decreasing chain has nonempty intersection by compactness, and that intersection is a closed subsemigroup, so Zorn's lemma applies.
Fix . The set is nonempty and compact, hence closed in the Hausdorff space, and is a subsemigroup becauseMinimality gives . Thus the set is nonempty. It is closed by the stated continuity, and it is a subsemigroup, since for . Minimality again gives , so and , giving a semigroup idempotent. If one instead uses the opposite one-sided continuity convention, the same proof uses and ; no joint continuity is required.
Apply this lemma to the Stone-Čech compactification of the natural numbers with its given addition. In the addition on the Stone-Čech compactification of the natural numbers convention,The continuous variable is when is fixed. The granted compactness, Hausdorff property and associativity therefore imply there exists an idempotent ultrafilter with .
On the positive integers such a is nonprincipal: a principal ultrafilter at adds to itself to give the one at , which is different. Hence every cofinite set belongs to . If zero is included in one's convention for , use the same compact semigroup argument on the closed space of nonprincipal ultrafilters: it is nonempty by compactness of the infinite discrete set's compactification, and the displayed addition sends two free ultrafilters to a free ultrafilter. This avoids the trivial principal idempotent at zero.
To deduce Hindman's theorem, let be the unique colour class belonging to . DefineIdempotence gives . The idempotent-ultrafilter star-set lemma also gives whenever . Here is its proof: , and applying idempotence to givesIntersecting this set with produces exactly .
Choose . Suppose have been chosen with every nonempty finite sum in . The finite intersectionbelongs to , and is therefore nonempty. Choose from it. The new sums are and , and they all lie in . Induction yieldsThis proves every finite colouring of the positive integers admits a monochromatic finite-sums set generated by a strictly increasing infinite sequence, the required Hindman theorem.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 130 3 i Solution Created 2026-10-03 Updated 2026-10-05
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 setsThey 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. HenceThis proves the compact Hausdorff topology on ultrafilters directly.
An idempotent. The addition on the Stone-Čech compactification of the natural numbers can be defined byAssociativity 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 fromMinimality gives . Hence there is with . The setis nonempty, compact, and a subsemigroup: if , then . Thus minimality gives , and in particular . ThereforeThis 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 .
Tail finite-sums semigroup 2026-10-07
For a sequence of positive integers, the nested closures of its tail finite-sums sets have nonempty compact intersection in the Stone-Čech compactification of the natural numbers. This intersection is a subsemigroup. For a sum from one tail, all sums supported beyond a chosen finite representation of lie in that tail translated by . The ultrafilter addition formula then establishes closure under addition. The Ellis–Numakura lemma supplies an idempotent ultrafilter containing every tail finite-sums set and hence any set containing the full finite-sums set.