An integral scheme is nonempty, reduced and irreducible. For an affine scheme , reducedness is equivalent to : nilpotent elements vanish in every stalk, and conversely a nonzero element has nonzero localization somewhere. Irreducibility is equivalent to the nilradical being prime. Indeed, if lies in every prime, then ; irreducibility makes one of these closed subsets all of , so or lies in the nilradical. Conversely, if the nilradical is prime, its point is a generic point of the whole spectrum. Thus reducedness and irreducibility together say that zero is a prime ideal, with . Therefore
For a global idempotent , its germ in any local ring is either zero or one. To see this, , and at least one of is a unit. Multiplication by that unit forces the other to vanish. On each affine chart,
These equalities also hold globally. Hence is a clopen set. Conversely, on a clopen subset and its complement, glue the sections one and zero. They define a global idempotent , and the two constructions are inverse. This proves the idempotent–clopen correspondence.
Assume each connected component is open. Every clopen subset is a union of connected components, since its intersection with a connected component is clopen in that component. Each individual component is also closed, so it defines a nonzero idempotent. A decomposition into two nonempty disjoint clopen subsets corresponds exactly to a sum of two nonzero orthogonal idempotents. A union containing at least two components admits such a decomposition by separating one component from the rest. A single component admits none. Consequently the precise conclusion is
The printed definition needs both nonzero and orthogonal. Literally forbidding every sum of two nonzero idempotents gives a false statement in characteristic two. For , the component idempotent decomposes as ; both summands are nonzero idempotents but are not orthogonal. In fact each of the three nonzero idempotents in this ring decomposes into the other two, although has two open connected components. Excluding zero is also necessary: zero corresponds to the empty subset, not to a component. With the standard primitive idempotent definition the preceding proof establishes the intended bijection in every characteristic.
The two cosets of are clopen sets in the 2-adic integers. The function is constant on each, so it is a locally constant function and therefore continuous. Its values on the nonnegative integers are .
The Mahler coefficient at index is the nth forward difference operator applied at zero. Here
Thus the Mahler expansion of the parity function is
To verify the expansion directly, each binomial polynomial takes values in : it does so at nonnegative integers, which form a dense subset, and polynomial evaluation is continuous into . Hence the nth summand has 2-adic absolute value at most throughout the domain. The ultrametric inequality proves uniform convergence, and the sum is continuous. At each nonnegative integer , the series becomes the finite binomial theorem identity . Equality on a dense subset and continuity prove equality everywhere. Finally, the coefficients in any such expansion are determined successively by its values at , since for and . This also verifies uniqueness without needing the general Mahler theorem.
A topological group is a group equipped with a topology for which multiplication and inversion are continuous maps. The product uses the product topology. Translation and inversion are therefore homeomorphisms. Hausdorffness is sometimes included in the definition; the two open-subgroup arguments below do not require it.
For the inverse system, take a directed set , topological spaces , and continuous maps for , with and . An inverse limit is a space with compatible continuous maps such that every compatible family factors uniquely as through a continuous map . Existence follows from the concrete construction
with the subspace topology of the product topology. The only possible map is . Compatibility puts its image in , and coordinatewise continuity makes it continuous. This proves the universal property of an inverse limit, even when is empty. Given two inverse limits, their universal properties supply maps each way; the composites have the same coordinates as the identity, so uniqueness makes them identities. The inverse limit exists and is unique up to the unique homeomorphism respecting its projections.
A profinite group can be defined as an inverse limit of finite discrete groups, or as a compact Hausdorff space that is a totally disconnected space, equipped with continuous group operations. For the first implication, use the Tychonoff theorem. The compatibility equalities define a closed subgroup of the compact Hausdorff product. Two distinct points are distinguished by a finite discrete coordinate, so no connected subset contains both. Consequently the inverse limit is a compact Hausdorff totally disconnected topological group.
For the converse, use the topological result that a compact Hausdorff totally disconnected space has a basis of clopen sets. Choose a clopen set containing inside any specified identity neighbourhood. For each , continuity gives an identity neighbourhood and an open neighbourhood of with . Finitely many cover the compact set . Intersect their and its inverse to obtain a symmetric identity neighbourhood with . Symmetry also gives , and hence for every . The set
is a subgroup containing , so it is open. It is contained in , since and . By part (ii), has finite index. Its normal core of a subgroup is a finite intersection of conjugates of , hence an open normal subgroup contained in . This proves the open normal subgroup basis of a profinite group.
The natural group homomorphism
is injective because the intersection of these is . For a compatible family of cosets, any finitely many have nonempty intersection: their intersection subgroup is another indexing subgroup, and its prescribed coset lies in each. The finite intersection property and compactness give a point belonging to all the cosets, proving surjectivity. Finally a continuous bijection from a compact space to a Hausdorff space is a homeomorphism. The two definitions of profinite group are equivalent.
Choose a separation into two nonempty clopen sets. Both are closed in the Zariski topology, so write and for ideals . Their disjointness gives . A proper ideal lies in a maximal ideal, so this forces .
Their union is all of the spectrum of a commutative ring, and . Thus every prime ideal contains , so
The last equality uses that is a reduced ring. For comaximal ideals, : if and , then . Therefore the Chinese remainder theorem gives
The isomorphism sends to its two residue classes. Its kernel is ; for surjectivity, and are obtained from , where , and . The two factors are nonzero because are nonempty, so are proper.
This is a disconnected reduced spectrum product decomposition. The elements also satisfy , , , exhibiting the ring product decomposition by an idempotent. No Noetherian hypothesis is required.
Write a finite binary word as and denote its prefix cylinder set by
More generally, a cylinder set fixes finitely many coordinates, or prescribes a subset of their finite coordinate product, leaving all other coordinates free. Each coordinate factor is discrete, so finite-coordinate inverse images are both open and closed. Thus cylinders are clopen. The basic open sets of the product topology restrict only finitely many coordinates, so cylinders form a base. Any finite-coordinate cylinder is a finite union of prefix cylinders of one sufficiently long common length; the prefix cylinders therefore also form a base.
The Bernoulli space here is Cantor space, with compatible metric
It is a compact metric space: from any sequence, choose successively subsequences constant in the first, second and subsequent coordinates, and take the diagonal subsequence. Agreement on the first coordinates bounds the distance by , proving convergence. Compactness also follows from Tychonoff theorem.
Every cylinder indicator function is continuous because the cylinder is clopen. Hence is a vector subspace of the space of continuous functions on a compact space. To prove density, fix and . By uniform continuity, choose so that implies . Choose a point in each length- prefix cylinder and put
Then and . This proves cylinder-function density in Cantor space:
Positivity of implies monotonicity. The pointwise bounds therefore give
Evaluation on attains equality, so is continuous and has norm one. This is the norm of a positive functional on C(K).
The object extended to open sets is the set function , rather than the functional itself. Positivity gives , and linearity gives finite additivity on disjoint cylinders. To construct its extension directly, use the disjoint cylinder decomposition of open subsets of Cantor space. For an open , take the shortest prefixes for which . They are prefix-free, their cylinders are disjoint, and their union is . Define
For , use the empty prefix; for , use the empty sum.
This value is independent of the chosen disjoint prefix-cylinder decomposition. Indeed, compare two such decompositions and . For each fixed , its intersections with the give a disjoint open cover of the compact cylinder . Compactness reduces this to finitely many nonempty intersections. Each intersection is a prefix cylinder or is empty, so finite additivity gives . Sum over and rearrange the nonnegative double sum. Doing the same with each proves equality of the two totals.
For disjoint open sets , combine their disjoint cylinder decompositions to obtain one for . Rearrangement of nonnegative sums proves countable additivity on this family of open sets. The extension is unique because any countably additive extension must have the prescribed sum on every disjoint cylinder decomposition. Open sets are not themselves a sigma-algebra; countable additivity here concerns disjoint open families and their open union.
For the Borel probability measure, let be the algebra of finite unions of prefix cylinders. It is also the algebra of clopen sets, because every clopen set is compact and has a finite cylinder cover. Define on . If with all sets in , compactness of gives a finite subcover by the . Disjointness makes all remaining members empty. Thus finite additivity already establishes the premeasure condition.
The Caratheodory extension theorem gives a unique measure on . This is the Borel sigma-algebra, since the cylinders are a countable base; . Its values on open sets agree with the extension above. For cylinder simple functions,
Both sides are continuous in the supremum norm, so cylinder-function density in Cantor space gives
Any other Borel probability measure with this property agrees on every cylinder indicator function, hence on , and uniqueness in the Caratheodory extension theorem makes it equal to . This proves the Cantor-space representation of positive functionals without assuming the general representation theorem.
Now let be the supplied continuous surjection. The pullback
is a unital isometric embedding: surjectivity gives . On the vector subspace , define . This is well-defined, has norm one and satisfies .
The real Hahn-Banach theorem extends to on all of with the same norm. Norm preservation alone does not automatically mean positivity, so verify it. If , then and
Scaling proves positivity for every nonnegative . This is the unital contraction positivity criterion, giving a positive extension from a unital subspace of C(K).
Represent by the already constructed Borel probability measure on and take the pushforward measure . Continuity of makes its Borel inverse images measurable, and . The pushforward integral identity gives
This is compact-metric representation by Cantor-space pullback. The hypothesis already excludes an empty . The measure is on the Borel sets; no uniqueness claim on an unspecified larger collection of subsets is needed.
The Stone topology on a type space has basic open sets
where ranges over formulas with parameters in and free variables. Here points are complete types consistent with . Arbitrary open sets are unions of these basic sets.
The identities
show that the basic sets are clopen sets and form a basis. Distinct complete types contain opposite choices for some formula, so this topology is Hausdorff. The compactness theorem gives compactness: a family of basic closed sets with the finite intersection property determines a consistent set of formulas, which extends to a complete type. Thus logical formulas provide a basis of clopen tests for distinguishing points of the type space.
For write , where and neither integer nor integer is divisible by . Define the P-adic valuation and the p-adic absolute value , with . The p-adic metric is
Factoring out the smaller power of from two rational numbers shows , with the usual convention . Consequently the ultrametric inequality gives
Together with symmetry, positivity and separation of points, this verifies that is a metric.
For the given geometric partial sums, use the finite geometric series identity. Since does not divide ,
Thus the limit is the rational number , even though the partial sums diverge in the ordinary real metric.
If , the ultrametric inequality gives . Applying it to gives . Since , this forces . Interchanging handles the other unequal case, proving
Finally, let be outside the open ball , so . If , the preceding unequal-norm identity gives . Therefore also lies outside . Its complement is open, so every p-adic open ball is also closed, that is, a clopen set.
The Szemerédi theorem says that for every integer and every , there is such that, for , every with contains a nonconstant arithmetic progression
Equivalently, every subset of the positive integers with positive upper asymptotic density contains arithmetic progressions of every finite length. Length one is immediate.
The Furstenberg multiple recurrence theorem states that for every probability measure-preserving system, every measurable with , and every integer , there is with
Here means a preimage, so invertibility is unnecessary. The Furstenberg multiple recurrence theorem also does not assume an ergodic transformation.
We prove the implication to the finite Szemerédi theorem by constructing the Furstenberg correspondence principle explicitly. Suppose, to the contrary, that for fixed and there are and with , but with no length- arithmetic progression of positive common difference. In the binary full shift , encode as , taking all coordinates outside to be zero. Let be the left shift, , and set
The cylinder set is a clopen set, and . The binary full shift is a compact metric space, so compactness of probability measures on a compact metric space gives a subsequence of these empirical measures with weak convergence of probability measures to a Borel probability measure .
For every continuous on the full shift,
Passing to the weak limit shows that is an invariant measure for the continuous left shift. Thus is a probability measure-preserving system. Since the indicator function of is continuous, .
Apply the Furstenberg multiple recurrence theorem to . For some , the clopen set
has . Its continuous indicator function gives . For large , at least one in the defining empirical measure therefore belongs to . The choice of left shift implies
so lies in . This contradicts the assumed absence of arithmetic progressions and proves the finite Szemerédi theorem. Applying the finite Szemerédi theorem on intervals where an infinite set has density bounded below proves the stated upper asymptotic density formulation.
For multiple recurrence for circle rotations, write and , with normalized Lebesgue measure , which is the Haar measure of the circle group. Fix a measurable with and . If is rational, there is with the identity, and gives an intersection of measure .
For irrational , the pigeonhole principle applied to in equal arcs gives with . In particular there are arbitrarily small nonzero returns to zero for the irrational rotation of the circle.
We also need translation continuity in L1 on the circle. Given a measurable , approximate its indicator function in the L1 norm by a continuous on the circle group. Such approximation follows from regularity of Lebesgue measure, or approximation by finite unions of intervals. Translation invariance and uniform continuity give
where the approximation error is first made arbitrarily small. Equivalently, .
Choose a return time so small modulo one that for each ,
This is possible because multiplication by each fixed is continuous on the circle group and translation continuity in L1 on the circle applies to the finitely many translates. The union bound now gives
This proves the Furstenberg multiple recurrence theorem for every circle rotation with its normalized Lebesgue measure, including both rational and irrational angles.
Use the product topology on , with discrete, and the left shift . A basic cylinder set specifies finitely many coordinates. This is a compact metric space, and is a homeomorphism. Write for the forward orbit closure. A minimal point means that is a minimal dynamical system, equivalently that every point of has a dense forward orbit in ; it need not be a fixed point.
There is a convention needed in the source: the bounded-gaps property concerns every finite integer interval , hence every finite word over an alphabet. Literally allowing would make the displayed condition impossible for finite , although a constant coloring is a minimal point. Under the standard finite-word interpretation, the property is precisely uniform recurrence.
Suppose first that is a minimal dynamical system. Its nonempty compact forward-invariant subset must equal . As the ambient left shift is invertible, all integer translates of belong to . Let have length , and let . This is a nonempty clopen set. Each forward orbit in meets , so covers . By compactness, finitely many suffice; let be the largest index in this finite cover. For any integer , the point lies in , so some satisfies . The prescribed word therefore occurs at positions , entirely inside . Taking proves the bounded-gaps property for every interval of length at least .
Conversely suppose is uniformly recurrent. Every finite word from any integer translate of occurs arbitrarily far to the right, so every such translate belongs to . Moreover, the property that every length- block contains a specified word of passes to every : a finite block of is a limit of blocks of forward translates of , and the finite discrete alphabet forces eventual exact agreement on that block. Given , look for its word inside . An occurrence starts at for some , so agrees with on . Taking for arbitrarily large proves that belongs to the forward orbit closure of every . That closure is a closed forward-invariant subset of , so it also contains every forward translate of and hence all of . Every forward orbit is therefore dense in , proving
The same conclusion holds if orbit closure is defined using all integer iterates: the bounded-gaps condition makes the forward and two-sided closures equal.
Let . For every even index , and imply . For every odd index , disjointness gives , so and . Consequently
The limit ultrafilter contains either or . Whichever it contains, the corresponding basic clopen set or is a neighbourhood of , but infinitely many sequence terms lie outside it. This contradicts convergence. Therefore pairwise distinct ultrafilters cannot form a convergent sequence in , the key step in no nontrivial convergent sequences in the Stone-Čech compactification.
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
The answer is no. Let , regarded as one point of the space of infinite subsets of the natural numbers, and put
The displayed union makes an open set in the Ellentuck topology. On the other hand, every basic neighbourhood of contains a different infinite set: keep and remove one element from its infinite remaining tail. This other point belongs to . Therefore is in the closure of but not in , so
The fact that basic neighbourhoods are clopen sets does not make arbitrary unions of them closed.
A filter on a set is a nonempty family that excludes the empty set, is upward closed, and is closed under finite intersections. An ultrafilter is a proper filter that contains exactly one of and for every subset .
To prove the ultrafilter lemma, order the proper filters containing by inclusion. The union of any chain is again a proper filter, so Zorn lemma gives a maximal extension . If neither nor belonged to , adjoining either one would generate an improper filter. There would then be with and . But , contradicting propriety. Hence is an ultrafilter.
The Stone-Čech compactification of the natural numbers is the set of all ultrafilters on , with basic sets
The identities
show that these sets form a basis of clopen sets. Distinct ultrafilters disagree on some ; one lies in and the other in the disjoint set . Thus is a Hausdorff space.
If a family of basic closed sets has the finite intersection property, then the sets have the same property. They generate a proper filter, which extends to an ultrafilter lying in every . The Alexander subbase theorem now implies that is a compact space.
Ultrametric space Created 2026-09-24 Updated 2026-10-14
An ultrametric space is a metric space whose metric satisfies the ultrametric inequality. The rational numbers with , and their P-adic number completion, are examples. Their geometry organizes points into nested clusters rather than measuring separation along a number line.
For integers and , the definition of the P-adic valuation gives
Thus a closed ball of radius in the integers is a congruence class modulo . In the p-adic integers the same closed ball is . More shared low-order digits mean a smaller p-adic absolute value of the difference.
Figure 1.
The integers from zero to fifteen form nested congruence classes modulo powers of two in the 2-adic absolute value
. Details.
The binary tree first splits the sixteen integers into even and odd congruence classes, then refines modulo , , and . Each node fixes one more low-order digit. The leaves and share the class modulo , then separate modulo , so their distance is exactly . The leaves are deliberately ordered by their low-order digits; horizontal spacing and edge lengths are layout choices, not the metric. The singleton leaves describe this finite sample; a congruence class modulo in all p-adic integers remains infinite.
The ultrametric inequality also explains the unusual behavior of balls. Every point of an open ball can serve as its center: if , then if and only if . Two open balls that intersect are nested, since a point of their intersection serves as a common center and their radii can be compared. The same nesting rule holds for closed balls and for a pair consisting of one open ball and one closed ball.
Every open ball is a clopen set. For a point outside , the open ball stays outside : if , the ultrametric inequality forces . Hence the complement is an open set. Also every closed ball of positive radius is an open set, because lies in the closed ball of radius around whenever . A radius-zero closed ball is a singleton and need not be an open set. Distinct points can therefore be separated by a clopen set, proving that an ultrametric space is totally disconnected. These ball properties turn distance thresholds into a hierarchy of compatible clusters. [ref]