Alphabeta Math
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

✓ 38 results · all verified · 21 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 17 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Uniform Spaces: the Three Definitions

1 · Prerequisites

2 · Summary

Filter convergence and ultrafilter compactness from nets-and-filters describe convergence without numerical distance, and the diagonal characterization from hausdorff-via-the-diagonal supplies the separation condition used here. The group laws and inverse laws of monoids-groups-and-subgroups underlie the translation-invariant examples. These prerequisites let a relation of nearness between pairs govern topology, continuity, Cauchy behaviour, and completion.

The development defines uniformities by entourages, uniform covers, and gauges, proving the entourage-cover dictionary in ZF and stating dependent choice precisely for the gauge construction. It then develops induced topology, separatedness, uniform continuity, Cauchy filters, Hausdorff completion, and compactness through total boundedness. Countable bases and continuous pseudometrics lead to uniformizability results, while left, right, upper, Roelcke, pointwise, and uniform-convergence structures provide further uniformities.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Uniform space in the entourage formulation

Definition

Let X be a set and write ΔX={(x,x):x∈X} for its diagonal (The diagonal ΔX⊆X×X, the diagonal map δX, and the pairing ⟨f,g⟩ of two maps). For E⊆X×X, put E[x]:={y∈X:(x,y)∈E}, E−1:={(y,x):(x,y)∈E}, and E∘F:={(x,z):some y has (x,y)∈E,(y,z)∈F}.

A uniformity on X is a filter U on X×X (Filter on a set) such that:

  • every E∈U contains ΔX;
  • E∈U implies E−1∈U;
  • for every E∈U there is D∈U with D∘D⊆E.

Its members are entourages. A uniform space is a set equipped with a uniformity. The induced topology and its neighbourhoods are constructed in The sets containing an entourage ball about each of their points form a topology.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

Every uniformity has a base of symmetric entourages

Statement

If U is a uniformity on X, then its symmetric entourages form a filter base: for every E∈U there is a symmetric D∈U with D⊆E. More generally, for every entourage E and every integer n≥1, there is a symmetric entourage D whose n-fold composite satisfies D∘n⊆E.

Facts & Assumptions

Given: A uniformity U on X, an entourage E∈U, and an integer n≥1.

[A1]

A uniformity is a filter whose members are closed under inverse and admit square roots (Uniform space in the entourage formulation).

[L1]

A nonempty, proper family that refines every pair of its members is a filter base (Filter base and the filter it generates).

Proof

technique · direct
1.1

Choose R∈U with R∘R⊆E, and put S:=R∩R−1.

A1choose
1.2

Put E0:=E. By finitely iterating the square-root axiom, choose entourages E1,…,En such that Ek+1∘Ek+1⊆Ek for 0≤k<n, and put D:=En∩En−1.

A1choose
2.1

The set S is an entourage, since R,R−1∈U and a filter is closed under intersections; also S=S−1 and S⊆R∘R⊆E, because every entourage contains the diagonal.

step 1.1A1
2.2

The entourage D is symmetric and D⊆En. Induction on k gives D∘2k⊆En−k for 0≤k≤n, hence D∘2n⊆E. Since every entourage contains the diagonal and n≤2n, one may insert diagonal factors to obtain D∘n⊆D∘2n⊆E.

step 1.2A1algebra
3.1

Thus symmetric entourages refine every entourage; their intersections are symmetric entourages and none is empty because each contains the diagonal, so they form a filter base by [L1].

step 2.1L1
4.1

Therefore symmetric entourages form a base and admit the asserted finite-composite control.

step 3.1step 2.2∎
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

The sets containing an entourage ball about each of their points form a topology

Statement

For a uniformity U on X, call O⊆X open when every x∈O has an entourage E with E[x]⊆O. These open sets form a topology on X. Its neighbourhood filter at x has {E[x]:E∈U} as a base.

Facts & Assumptions

Given: A uniform space (X,U).

[A1]

Entourages contain the diagonal, are closed under finite intersection, and have symmetric square roots (Uniform space in the entourage formulation, Every uniformity has a base of symmetric entourages).

[L1]

A topology contains ∅,X, is closed under arbitrary unions, and under binary intersections (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

Proof

technique · direct
1.1

The sets ∅ and X are open: the first has no points to test, and for x∈X every entourage ball is contained in X.

A1
1.2

An arbitrary union of open sets is open, because a point in the union lies in one member and retains that member's entourage ball.

A1
1.3

If x∈O∩P, choose entourage balls E[x]⊆O and F[x]⊆P; then (E∩F)[x]⊆O∩P, so binary intersections are open.

A1
2.1

By steps 1.1 to 1.3, the open sets form a topology by [L1].

step 1.1step 1.2step 1.3L1
3.1

Let E be an entourage and define OE={y∈E[x]:F[y]⊆E[x] for some F∈U}. This set is open. Indeed, given y∈OE, choose F as displayed and then a symmetric G with G∘G⊆F. If z∈G[y], symmetry gives G[z]⊆(G∘G)[y]⊆F[y]⊆E[x], so z∈OE; hence G[y]⊆OE. Now choose a symmetric D with D∘D⊆E. If y∈D[x], then D[y]⊆E[x], so y∈OE. Thus x∈D[x]⊆OE⊆E[x], proving that E[x] is a neighbourhood of x.

A1step 2.1
4.1

Conversely, if N is a neighbourhood of x, it contains an open set O with x∈O; the definition of the topology supplies an entourage E with E[x]⊆O⊆N. Thus the entourage balls refine every neighbourhood, and by step 3.1 they are themselves neighbourhoods. They form a neighbourhood base by [L2].

step 2.1step 3.1L2∎
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Separated uniformity: the intersection of all entourages is the diagonal

Definition

A uniformity U on X is separated when ⋂E∈UE=ΔX (The diagonal ΔX⊆X×X, the diagonal map δX, and the pairing ⟨f,g⟩ of two maps). Equivalently, whenever x≠y, some entourage E satisfies (x,y)∉E. Separation is a property of the uniformity, not an additional convention in the meaning of uniform space.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

A uniformity is separated if and only if its induced topology is Hausdorff

Statement

The topology induced by a uniformity U is Hausdorff if and only if U is separated.

Facts & Assumptions

Given: A uniform space (X,U) with its induced topology.

[A1]

A uniformity is separated exactly when each distinct pair is excluded by an entourage (Separated uniformity: the intersection of all entourages is the diagonal).

Proof

technique · direct
1.1

Suppose U is separated and x≠y. Choose E with (x,y)∉E, then a symmetric D with D∘D⊆E.

A1L1choose
1.2

Conversely, if the induced topology is Hausdorff and x≠y, choose disjoint neighbourhoods of x,y and refine the first by an entourage ball E[x]; then y∉E[x], so (x,y)∉E.

L1L2choose
2.1

The neighbourhoods D[x] and D[y] are disjoint: if z belonged to both, symmetry would give (x,z),(z,y)∈D and hence (x,y)∈D∘D⊆E.

step 1.1L1
3.1

Thus the induced topology is Hausdorff by [L2].

step 2.1L2
4.1

Every distinct pair is excluded by an entourage, so U is separated by [A1].

step 1.2A1∎
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Uniformly continuous map between uniform spaces

Definition

For uniform spaces (X,UX) and (Y,UY), a map f:X→Y is uniformly continuous if for every V∈UY there is U∈UX such that (x,x′)∈U implies (f(x),f(x′))∈V. The controlling entourage U is independent of the point x.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Every uniformly continuous map is continuous for the induced topologies

Statement

Every uniformly continuous map between uniform spaces is continuous for their induced topologies.

Facts & Assumptions

Given: A uniformly continuous map f:X→Y and a point x∈X.

[A1]

Uniform continuity sends one source entourage into each prescribed target entourage (Uniformly continuous map between uniform spaces).

[L1]

Entourage balls are neighbourhood bases for the induced topologies (The sets containing an entourage ball about each of their points form a topology).

[L2]

A map is continuous at x when every neighbourhood of f(x) has a neighbourhood of x mapped into it (Continuity of a map of topological spaces at a point and globally).

Proof

technique · direct
1.1

Let N be a neighbourhood of f(x) and choose a target entourage V with V[f(x)]⊆N.

L1choose
2.1

Uniform continuity supplies a source entourage U whose pairs map into V, so f[U[x]]⊆V[f(x)]⊆N.

A1step 1.1
3.1

Since U[x] is a neighbourhood of x, [L2] gives continuity at x; as x was arbitrary, f is continuous.

step 2.1L1L2∎
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

A metric on a nonempty set generates an entourage uniformity whose induced topology and uniformly continuous maps are the usual metric notions, and this uniformity is separated

Statement

For a metric space (X,d) with X≠∅, the sets Eε={(x,y):d(x,y)<ε}, ε>0, generate a separated uniformity. Its induced topology is the metric topology, and uniform continuity to another metric uniformity is exactly metric uniform continuity.

Facts & Assumptions

Given: Metric spaces (X,d) and (Y,ρ) with X≠∅ and Y≠∅.

[L1]

A metric has symmetry and the triangle inequality, and a pseudometric is a metric exactly when zero distance separates points (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[L3]

Metric uniform continuity means: for every ε>0 there is δ>0 such that d(x,x′)<δ implies ρ(f(x),f(x′))<ε (Uniform continuity of a map of metric spaces: one δ serving every point).

[L4]

A nonempty proper downward-directed family is a filter base, whose upward closure is the least filter containing it (Filter base and the filter it generates, The upward closure of a filter base is the smallest filter containing it).

[L5]

In an entourage uniformity, entourage balls form a neighbourhood base for the induced topology (The sets containing an entourage ball about each of their points form a topology).

Proof

technique · direct
1.1

The diagonal lies in every Eε, inverses agree with Eε by symmetry, intersections contain Emin⁡(ε,δ), and Eε/2∘Eε/2⊆Eε by the triangle inequality.

L1
2.1

The family (Eε)ε>0 is nonempty, none of its members is empty because X≠∅, and it is downward directed by step 1.1, so [L4] makes its upward closure a filter. The diagonal, inverse, and square-root properties in step 1.1 then make it a uniformity. Its Eε[x] are precisely metric balls, so its induced topology is the metric topology by [L2] and [L5].

step 1.1L2L4L5
2.2

The intersection of all Eε is the diagonal, since d(x,y)>0 for x≠y and Ed(x,y)/2 excludes (x,y); hence the uniformity is separated.

L1step 1.1
3.1

The defining entourage implication for Eδ and Eε is exactly the quantified condition of [L3], which proves the final equivalence.

L3∎
DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

Uniform space in the uniform-cover formulation

Definition

For a cover V of X and A⊆X, write St⁡(A,V) for the union of the members of V meeting A. A cover V star-refines W if for every V∈V, St⁡(V,V) is contained in some member of W.

A uniform-cover structure is a nonempty family C of covers of X such that a cover refined by a member of C belongs to C, any two members have a common refinement in C, and every member has a star-refinement in C. Its members are uniform covers. When X≠∅, the topology it induces and its equivalence with entourages are proved in On a nonempty set, entourage uniformities and uniform-cover structures determine one another.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

On a nonempty set, entourage uniformities and uniform-cover structures determine one another

Statement

In ZF, on a nonempty set X, an entourage uniformity determines a uniform-cover structure by the covers {E[x]:x∈X}, and a uniform-cover structure determines an entourage uniformity by the sets ⋃V∈VV×V. These constructions recover the same uniform structure.

Facts & Assumptions

Given: A nonempty set X carrying either an entourage uniformity or a uniform-cover structure.

[L1]

Symmetric entourages form a base and have symmetric square roots (Every uniformity has a base of symmetric entourages, Uniform space in the entourage formulation).

[L2]

Uniform covers are upward closed under coarsening, have common refinements, and have star-refinements (Uniform space in the uniform-cover formulation).

Proof

technique · constructive
1.1

From an entourage E, form CE={E[x]:x∈X}. Choose a symmetric entourage D with D∘3⊆E. If D[y]∩D[x]≠∅ and z∈D[y], symmetry and a point in the intersection give (x,z)∈D∘3⊆E. Hence the star of D[x] in CD lies in E[x], so CD star-refines CE.

L1construct
1.2

From a uniform cover V, form EV=⋃V∈VV×V. It contains the nonempty diagonal, so it is nonempty. A star-refinement W has EW∘EW⊆EV, while common refinements and coarsenings give the remaining filter axioms.

L2construct
2.1

Declare a cover uniform when it is coarser than some CE. Intersections of entourages give common refinements, enlargement of an entourage gives coarsening, and step 1.1 gives star-refinements. Hence these covers satisfy the uniform-cover axioms.

step 1.1L1L2
2.2

Start with an entourage uniformity. For symmetric D, D⊆ECD⊆D−1∘D=D∘2. The first inclusion uses the diagonal, and the second follows because two points in one D-ball are D−1∘D-related. Taking a symmetric square root inside any prescribed entourage shows that the recovered entourage filter is exactly the original one.

L1step 1.1step 1.2
2.3

Start instead with a uniform-cover structure. The EV-ball at x is EV[x]=St⁡(x,V), the union of the members of V containing x. Thus V refines CEV, so the latter is uniform by coarsening. Conversely, if W star-refines V, then for any x and any W0∈W containing x, St⁡(x,W)⊆St⁡(W0,W), which lies in some member of V. Therefore CEW refines V. The recovered cover structure is exactly the original one.

L2step 1.2
3.1

Steps 2.2 and 2.3 prove that the two constructions are mutually inverse at the level of generated structures.

step 2.2step 2.3discharge-construct∎
DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

A gauge of pseudometrics and, on a nonempty set, the uniformity it generates

Definition

A gauge of pseudometrics on X is a family P of pseudometrics (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric). For finite F⊆P and ε>0, put E(F,ε)={(x,y):p(x,y)<ε for every p∈F}. If X≠∅, these sets form a filter base and generate a uniformity (Filter base and the filter it generates, The upward closure of a filter base is the smallest filter containing it), called the uniformity generated by P.

For an already given uniformity U on X, a pseudometric p is uniformly continuous for U when {(x,y):p(x,y)<ε}∈U for every ε>0. With this terminology, each member of a gauge is uniformly continuous for the uniformity generated by that gauge.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Assuming dependent choice, every entourage admits a normal symmetric sequence subordinate to it

Statement

Assuming dependent choice, for every entourage U there are symmetric entourages (En)n∈N such that E0=X×X, E1⊆U, the sequence is decreasing, and En+1∘3⊆En for every n∈N.

Facts & Assumptions

Given: A uniformity U, an entourage U, and dependent choice.

[L1]

Every entourage has a symmetric square root (Every uniformity has a base of symmetric entourages).

Proof

technique · constructive
1.1

Given a symmetric entourage E, choose a symmetric R with R∘2⊆E, and then a symmetric D with D∘2⊆R. Since every entourage contains the diagonal, D⊆R, and hence D∘3⊆R∘2⊆E. Thus there exists a symmetric D⊆E with D∘3⊆E.

L1construct
2.1

The relation ERD meaning that D is symmetric, D⊆E, and D∘D∘D⊆E is serial by step 1.1.

step 1.1
3.1

Choose a symmetric entourage E1⊆U using [L1]. Dependent choice applied to the serial relation of step 2.1 starting at E1 gives E1,E2,…. Adjoin E0=X×X; then E1∘3⊆X×X=E0, and all the required properties hold.

step 2.1L1L2discharge-construct∎
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

A normal sequence of entourages yields a uniformly continuous pseudometric with controlled dyadic balls

Statement

Given a decreasing symmetric sequence (En) with E0=X×X and En+1∘3⊆En, there is a pseudometric p on X such that En⊆{p≤2−n}⊆En−1 for every n≥1. In particular, each set {p<ε} is an entourage, so p is uniformly continuous for the original uniformity in the sense of A gauge of pseudometrics and, on a nonempty set, the uniformity it generates.

Facts & Assumptions

Given: A normal sequence (En) of symmetric entourages on X.

[A1]

The given sequence satisfies E0=X×X, is decreasing, and has En+1∘3⊆En.

[A2]

Every entourage contains the diagonal, and every superset of an entourage is again an entourage because a uniformity is an upward-closed filter (Uniform space in the entourage formulation, Filter on a set).

[L1]

A pseudometric satisfies symmetry, the triangle inequality, and p(x,x)=0 (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[L2]

Every nonempty set of reals bounded below has an infimum, which is a lower bound and is approached from above within every positive epsilon (Every nonempty set bounded below has an infimum, Epsilon characterisation of the infimum, Greatest lower bound (infimum)).

[L3]

Finite sums split under concatenation and are nonnegative when their terms are nonnegative; a nonempty finite sum of positive terms is positive (Finite sums and finite products, by recursion, Laws of finite sums and finite products, claims 3 and 4).

[L4]

The dyadic weights 2−n=(1/2)n are positive, satisfy the rational power laws, strictly decrease with n, and tend to 0 (Laws of rational exponents, claims 1 and 2, Monotonicity of r↦ar and of a↦ar, claim 1, and For ∣r∣<1 the sequence rk is null, and for ∣r∣>1 the sequence ∣r∣k diverges to +∞, claim 1).

[L5]

Strong induction may assume a claim for every smaller natural number (Strong (complete) induction).

Proof

technique · constructive
1.1

For x,y∈X, let W(x,y) be the set of sums ∑i<k2−ni over all finite chains x=x0,…,xk=y with (xi−1,xi)∈Eni. This set is nonempty because the one-edge E0=X×X chain has weight 1. Every dyadic term is positive by [L4], so every such finite sum is nonnegative by [L3]; hence 0 is a lower bound. By [L2], the infimum exists; define p(x,y):=inf⁡W(x,y).

A1L2L3L4construct
1.2

We prove by strong induction on the number k of edges, simultaneously for every n, that a k-edge chain of total weight less than 2−n has En-related endpoints. For k=0 the endpoints coincide and hence are En-related by [A2]. Now let k≥1 and assume the claim for every shorter chain. Its total weight w is positive by [L3] and [L4]. Take the first edge for which the cumulative weight through that edge exceeds w/2. The subchain before it has weight at most w/2, and the subchain after it has weight less than w/2; because w<2−n, both are less than 2−(n+1). They have fewer than k edges, so the induction hypothesis makes both endpoint pairs En+1-related. The middle edge has weight 2−m≤w<2−n; strict decrease of the dyadic weights gives m≥n+1, and decreasingness of (Ej) puts that edge in En+1. Thus the endpoints lie in En+1∘3⊆En. Strong induction proves the claim for every finite chain.

A1A2L3L4L5
2.1

The empty chain has weight 0, while all weights are nonnegative, so p(x,x)=0. Reversing a chain preserves its weight because each En is symmetric, so p(x,y)=p(y,x). For the triangle inequality, suppose instead that p(x,z)>p(x,y)+p(y,z) and put δ=(p(x,z)−p(x,y)−p(y,z))/3>0. By [L2], choose an x-to-y chain of weight a<p(x,y)+δ and a y-to-z chain of weight b<p(y,z)+δ. Their concatenation has weight a+b<p(x,y)+p(y,z)+2δ<p(x,z) by [L3], contradicting that p(x,z) is a lower bound of W(x,z). Thus the triangle inequality holds, and p is a pseudometric by [L1].

step 1.1L1L2L3
2.2

A one-edge En-chain has weight 2−n, so En⊆{p≤2−n}.

step 1.1
2.3

If p(x,y)≤2−n with n≥1, then [L4] gives p(x,y)≤2−n<2−(n−1). Apply the epsilon property in [L2] with ε=2−(n−1)−p(x,y)>0 to obtain a chain of weight less than 2−(n−1). Step 1.2 gives (x,y)∈En−1. Thus {p≤2−n}⊆En−1.

step 1.1step 1.2L2L4
3.1

Given ε>0, choose n with 2−n<ε by [L4]. Then En⊆{p≤2−n}⊆{p<ε}, so the latter set is an entourage by upward closure. By A gauge of pseudometrics and, on a nonempty set, the uniformity it generates, p is uniformly continuous for the original uniformity.

A2step 2.2L4discharge-construct∎
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Assuming dependent choice, every entourage uniformity is generated by a gauge of uniformly continuous pseudometrics

Statement

Assuming dependent choice, every entourage uniformity is generated by a gauge of uniformly continuous pseudometrics.

Facts & Assumptions

Given: An entourage uniformity U and dependent choice.

[L1]

For every entourage, dependent choice supplies a normal sequence whose first nontrivial member is contained in that entourage (Assuming dependent choice, every entourage admits a normal symmetric sequence subordinate to it).

[L2]

Such a sequence yields a uniformly continuous pseudometric whose dyadic balls lie between consecutive entourages (A normal sequence of entourages yields a uniformly continuous pseudometric with controlled dyadic balls).

[L3]

A gauge generates the filter based on finite simultaneous pseudometric balls (A gauge of pseudometrics and, on a nonempty set, the uniformity it generates).

Proof

technique · constructive
1.1

Let P be the set of all pseudometrics obtained by applying [L2] to normal sequences of [L1] subordinate to some entourage. This definition makes no simultaneous choice. Every p∈P is uniformly continuous for U, and for each entourage E, [L1] and [L2] ensure that at least one p∈P has a positive-radius p-ball contained in E.

L1L2construct
2.1

For each p∈P and each positive radius, its ball is an original entourage by step 1.1. Hence every finite intersection defining a basic entourage of the gauge belongs to U.

step 1.1L3
2.2

Conversely every original entourage E contains a positive-radius ball for at least one p∈P by step 1.1, so it belongs to the gauge uniformity.

step 1.1L3
3.1

The two uniformities contain one another and are equal.

step 2.1step 2.2discharge-construct∎
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

On a nonempty set, entourages and uniform covers give equivalent definitions of a uniform space in ZF, and under dependent choice they are also equivalent to gauges of pseudometrics

Statement

In ZF, on a nonempty set, the entourage and uniform-cover formulations determine each other. Assuming dependent choice, they are also equivalent to the formulation by gauges of pseudometrics.

Facts & Assumptions

Given: A uniform structure on a nonempty set X in any one of the named formulations.

[L1]

Entourage uniformities and uniform-cover structures determine each other in ZF (On a nonempty set, entourage uniformities and uniform-cover structures determine one another).

[L2]

Under dependent choice every entourage uniformity is generated by a gauge of uniformly continuous pseudometrics (Assuming dependent choice, every entourage uniformity is generated by a gauge of uniformly continuous pseudometrics).

[L3]

A gauge itself generates an entourage uniformity (A gauge of pseudometrics and, on a nonempty set, the uniformity it generates).

Proof

technique · direct
1.1

The equivalence between entourages and covers is exactly [L1] and uses no choice principle.

L1
1.2

Assuming dependent choice, [L2] sends an entourage uniformity to a gauge and [L3] sends every gauge back to an entourage uniformity.

L2L3
2.1

Thus the first two formulations are equivalent in ZF and all three are equivalent under the displayed assumption.

step 1.1step 1.2∎
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Cauchy filter in a uniform space

Definition

A filter F on a uniform space (X,U) is Cauchy if for every entourage E∈U some A∈F satisfies A×A⊆E. Such an A is an E-small member of F.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

Every convergent filter on a uniform space is Cauchy

Statement

Every filter converging in the induced topology of a uniform space is Cauchy.

Facts & Assumptions

Given: A filter F converging to x in a uniform space.

[L1]

Filter convergence means that every neighbourhood of the limit belongs to the filter (Convergence and cluster points of a filter on a topological space).

[L3]

A Cauchy filter has an E-small member for every entourage E (Cauchy filter in a uniform space).

Proof

technique · direct
1.1

Let E be an entourage and choose a symmetric entourage D with D∘D⊆E.

L2choose
1.2

The neighbourhood D[x] belongs to F by convergence.

L1L2
2.1

Since D is symmetric, D[x]×D[x]⊆D−1∘D=D∘D⊆E, so D[x] is E-small.

step 1.1step 1.2
3.1

As E was arbitrary, F is Cauchy by [L3].

step 2.1L3∎
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

A Cauchy filter with a cluster point converges to that point

Statement

A Cauchy filter on a uniform space with a cluster point x converges to x.

Facts & Assumptions

Given: A Cauchy filter F and one of its cluster points x.

[L1]

A cluster point meets every filter member in every neighbourhood, while convergence means containment of every neighbourhood (Convergence and cluster points of a filter on a topological space).

[L2]

Cauchy filters have small members, and symmetric entourages have symmetric square roots (Cauchy filter in a uniform space, Every uniformity has a base of symmetric entourages).

[L3]

For the topology induced by a uniformity, every entourage ball D[x] is a neighbourhood of x (The sets containing an entourage ball about each of their points form a topology).

Proof

technique · direct
1.1

Let E be an entourage and choose symmetric D with D∘D⊆E; choose A∈F with A×A⊆D.

L2choose
1.2

The ball D[x] is a neighbourhood of x, so it meets A because x is a cluster point; fix a∈A∩D[x].

L1L3choose
2.1

For every b∈A, symmetry gives (x,a)∈D and smallness gives (a,b)∈D, hence (x,b)∈E; so A⊆E[x].

step 1.1step 1.2
3.1

Every entourage ball about x belongs to F by upward closure, and such balls form a neighbourhood base at x, so F converges to x.

step 2.1L1L3∎
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Complete uniform space: every Cauchy filter converges

Definition

A uniform space is complete when every Cauchy filter (Cauchy filter in a uniform space) converges to at least one point of its induced topology (Convergence and cluster points of a filter on a topological space). No separatedness is built into this definition.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Uniform embedding and uniform isomorphism

Definition

A map f:X→Y of uniform spaces is a uniform embedding if it is injective and its corestriction X→f[X], with the subspace uniformity, is a uniform isomorphism. A uniform isomorphism is a bijection whose map and inverse are uniformly continuous. Bijection and corestriction are understood in the sense of Injection, surjection, bijection.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

A Hausdorff completion of a uniform space and its canonical dense map

Definition

A Hausdorff completion of a uniform space (X,U) is a complete separated uniform space (X^,U^) together with a map η:X→X^ satisfying both of the following conditions.

The first half of the second condition is uniform continuity (Uniformly continuous map between uniform spaces); the second half prevents the completion map from discarding any of the original uniform structure. The map is not required to be injective. It is a uniform embedding (Uniform embedding and uniform isomorphism) exactly when it is injective, and this is the usual completion of a separated uniform space.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

Every Cauchy filter canonically determines a unique minimal Cauchy filter coarser than it

Statement

Every Cauchy filter F canonically determines a unique Cauchy filter m(F)⊆F that has no strictly coarser Cauchy filter. For every x∈X, the principal filter Px:={A⊆X:x∈A} is Cauchy and therefore has an associated minimal Cauchy filter m(Px).

Facts & Assumptions

Given: A Cauchy filter F on a uniform space.

[L1]

Cauchyness supplies arbitrarily small members of F (Cauchy filter in a uniform space).

[L3]

Symmetric entourages form a base and may be chosen with prescribed finite-composite control (Every uniformity has a base of symmetric entourages).

Proof

technique · constructive
1.1

Let B consist of all E[A] with A∈F and symmetric entourage E. Every such set contains the nonempty set A. Given E[A],D[B]∈B, the symmetric entourage E∩D and the member A∩B∈F give (E∩D)[A∩B]⊆E[A]∩D[B]. Thus B is a proper downward-directed filter base. Let m(F) be the filter it generates.

L2L3construct
2.1

Since A⊆E[A], every member of B belongs to F, so m(F)⊆F. To prove it Cauchy, let U be an entourage and choose a symmetric E with E∘3⊆U. Choose A∈F with A×A⊆E. If y,z∈E[A], take a,b∈A with aEy and bEz; symmetry gives yEaEbEz, so (y,z)∈E∘3⊆U. Hence E[A]∈m(F) is U-small.

L1L3step 1.1
2.2

Let G⊆F be Cauchy, and fix E[A]∈B. Choose a symmetric D with D⊆E, and a D-small B∈G. Since A,B∈F, choose c∈A∩B. Then B⊆D[c]⊆E[A], so E[A]∈G. Thus every Cauchy filter coarser than F contains m(F).

L1L3step 1.1choose
3.1

If a Cauchy filter is coarser than m(F), step 2.2 places m(F) inside it, so equality holds; hence m(F) is minimal. Any minimal Cauchy filter coarser than F contains m(F) by step 2.2 and must equal it by minimality. This proves uniqueness.

step 2.1step 2.2
4.1

For x∈X, the set {x} belongs to Px, and {x}×{x}⊆ΔX⊆E for every entourage E. Thus Px is Cauchy by [L1], and step 3.1 supplies its associated minimal Cauchy filter.

L1step 3.1discharge-construct∎
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

The standard entourages on minimal Cauchy filters form a separated uniformity

Statement

On the set X^ of minimal Cauchy filters, the relations E^ declaring that two filters have E-close members form a separated uniformity.

Facts & Assumptions

Given: Minimal Cauchy filters F,G on X.

[L1]

Every Cauchy filter has a unique associated minimal Cauchy filter, and every principal filter is Cauchy and therefore has an associated minimal Cauchy filter (Every Cauchy filter canonically determines a unique minimal Cauchy filter coarser than it).

[L2]

Symmetric entourages form a base and admit square roots (Every uniformity has a base of symmetric entourages).

Proof

technique · constructive
1.1

Because a uniformity is a proper filter on X×X, its carrier X is nonempty. Choose x∈X; then [L1] gives a minimal Cauchy filter associated to the principal filter at x, so X^ is nonempty. For symmetric E, put (F,G)∈E^ when some A∈F and B∈G satisfy A×B⊆E.

L1L3constructchoose
2.1

Every F is E^-close to itself: choose an E-small member of the Cauchy filter and use it on both sides. Thus each E^ contains the nonempty diagonal of X^. The relation E^ is symmetric. If E^ and D^ have respective witnesses A×B and C×K, then (A∩C)×(B∩K)⊆E∩D, so finite intersections are refined by the corresponding hatted intersection.

step 1.1
2.2

Choose a symmetric entourage D with D∘2⊆E. If F D^ G via A×B⊆D and G D^ H via C×K⊆D, choose b∈B∩C. Then aDbDk for every a∈A,k∈K, so A×K⊆D∘2⊆E. Hence D^∘D^⊆E^.

step 1.1L2choose
2.3

Steps 2.1 and 2.2 show that the upward closure of the relations E^ is a uniformity. To prove separation, suppose F E^ G for every entourage E. Given A∈F, minimality gives F=m(F) by [L1], so some D[C]⊆A with C∈F and symmetric D. Choose an entourage E⊆D and witnesses P∈F,Q∈G with P×Q⊆E. Pick c∈C∩P. Then Q⊆E[c]⊆D[C]⊆A, so A∈G. Thus F⊆G; symmetry gives equality.

step 1.1L1L2choose
3.1

Therefore the standard relations form the asserted separated uniformity.

step 2.3L3discharge-construct∎
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

The uniform space of minimal Cauchy filters is complete

Statement

The separated uniform space X^ of minimal Cauchy filters is complete.

Facts & Assumptions

Given: A Cauchy filter Φ on X^.

[L1]

The standard relations form a uniformity on minimal Cauchy filters (The standard entourages on minimal Cauchy filters form a separated uniformity).

[L2]

Every Cauchy filter on X has its associated minimal Cauchy filter (Every Cauchy filter canonically determines a unique minimal Cauchy filter coarser than it).

[L3]

Completeness means convergence of every Cauchy filter (Complete uniform space: every Cauchy filter converges).

[L4]

A filter contains the whole set, omits the empty set, and is closed under finite intersections and supersets (Filter on a set); symmetric entourages with prescribed finite-composite control may be chosen inside any entourage (Every uniformity has a base of symmetric entourages).

Proof

technique · constructive
1.1

For A⊆X, put A#:={ M∈X^:A∈M }, and define F:={A⊆X:A#∈Φ}. Since X#=X^, ∅#=∅, (A∩B)#=A#∩B#, and A#⊆B# whenever A⊆B, [L4] shows that F is a filter on X.

L4construct
1.2

The filter F is Cauchy. Given an entourage U, choose a symmetric D with D∘3⊆U. Choose a D^-small S∈Φ, a filter M0∈S, and a D-small C∈M0. For every N∈S, the relation M0 D^ N has witnesses P∈M0 and Q∈N with P×Q⊆D. A point of C∩P shows Q⊆D[C], hence D[C]∈N. Thus S⊆(D[C])#, so D[C]∈F. Moreover D[C]×D[C]⊆D∘3⊆U, making this a U-small member of F.

L1L4choose
2.1

Let M=m(F). Given an entourage E, choose a symmetric D with D∘2⊆E, and choose a D-small A∈F. Then A#∈Φ. If N∈A#, the sets D[A]∈M and A∈N satisfy D[A]×A⊆D∘2⊆E, so N∈E^[M]. Hence A#⊆E^[M], and the ball E^[M] belongs to Φ. Therefore Φ→M.

step 1.1step 1.2L1L2L4
3.1

Since every Cauchy filter Φ converges, X^ is complete by [L3].

step 2.1L3discharge-construct∎
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

The minimal Cauchy filters associated to points define a uniformly continuous dense canonical map

Statement

The map η:X→X^ sending x to the minimal Cauchy filter associated to its principal filter is uniformly continuous and has dense image. For every x∈X, every member of η(x) contains x.

Facts & Assumptions

Given: A uniform space X and its minimal-Cauchy-filter space X^.

[L1]

Principal filters are Cauchy and have associated minimal Cauchy filters (Every Cauchy filter canonically determines a unique minimal Cauchy filter coarser than it).

[L2]
[L4]

Symmetric entourages with prescribed finite-composite control may be chosen inside any entourage (Every uniformity has a base of symmetric entourages).

Proof

technique · constructive
1.1

Define η(x) to be the minimal filter associated to the principal filter Px at x. Since η(x)=m(Px)⊆Px, every member of η(x) contains x.

L1construct
1.2

Let E^[F] be a basic neighbourhood. Choose a symmetric D with D∘2⊆E, a D-small A∈F, and a∈A. The point filter η(a) contains D[a], and D[a]×A⊆D∘2⊆E, so η(a)∈E^[F]. Thus every basic neighbourhood meets η[X].

L1L2L3L4choose
2.1

Given a target basic entourage E^, choose a symmetric D with D∘3⊆E. If (x,y)∈D, then D[x]∈η(x) and D[y]∈η(y), while D[x]×D[y]⊆D∘3⊆E. Hence (η(x),η(y))∈E^, which proves uniform continuity.

step 1.1L2L4
3.1

Thus every neighbourhood meets η[X], so its closure is all of X^ and the image is dense.

step 1.2L3discharge-construct∎
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

Every uniform space has a Hausdorff completion with dense canonical image, and the canonical map is a uniform embedding exactly when the original uniformity is separated

Statement

Every uniform space X has a Hausdorff completion η:X→X^. The map has dense image, and it is a uniform embedding if and only if the original uniformity is separated.

Facts & Assumptions

Given: A uniform space X.

[L1]
[L2]

Point filters define a uniformly continuous dense map η:X→X^, and every member of η(x) contains x (The minimal Cauchy filters associated to points define a uniformly continuous dense canonical map).

[L3]

A Hausdorff completion and a uniform embedding have the stated definitions (A Hausdorff completion of a uniform space and its canonical dense map, Uniform embedding and uniform isomorphism).

[L4]

Separatedness is equivalent to Hausdorffness of the induced topology (A uniformity is separated if and only if its induced topology is Hausdorff).

[L5]

Symmetric entourages form a base and may be chosen inside any prescribed entourage (Every uniformity has a base of symmetric entourages).

Proof

technique · constructive
1.1

Take X^ to be the uniform space of minimal Cauchy filters and take η from [L2].

L1L2construct
2.1

It is complete and separated by [L1], and η is uniformly continuous with dense image by [L2]. It remains to verify that the pullback uniformity is not strictly coarser than the original one. Given an entourage E of X, choose a symmetric D⊆E. If (η(x),η(y))∈D^, witnesses A∈η(x) and B∈η(y) satisfy A×B⊆D. Every member of the minimal point filter η(x) contains x, and every member of η(y) contains y; therefore (x,y)∈D⊆E. Thus (η×η)−1[D^]⊆E. Together with uniform continuity, this is exactly the pullback condition in [L3], so η is a Hausdorff completion.

step 1.1L1L2L3L5
3.1

If η(x)=η(y), step 2.1 puts (x,y) in every entourage of X. Conversely, if (x,y) belongs to every entourage of X, uniform continuity puts (η(x),η(y)) in every entourage of X^; separatedness of X^ gives η(x)=η(y).

step 2.1L1L2
4.1

Step 3.1 says that η is injective exactly when U is separated. When injective, the two directions of the pullback condition in step 2.1 say precisely that the corestriction X→η[X] and its inverse are uniformly continuous, so η is a uniform embedding. Conversely every uniform embedding is injective.

step 2.1step 3.1L3L4
5.1

This proves the completion assertion and the exact embedding criterion.

step 2.1step 4.1discharge-construct∎
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Every uniformly continuous map into a complete Hausdorff uniform space extends uniquely across the Hausdorff completion; consequently completions are unique up to a unique uniform isomorphism

Statement

For a Hausdorff completion η:X→X^ and a uniformly continuous f:X→Y into a complete separated uniform space Y, there is a unique uniformly continuous f^:X^→Y with f^η=f. Consequently Hausdorff completions are unique up to a unique uniform isomorphism commuting with their canonical maps.

Facts & Assumptions

Given: A Hausdorff completion η:X→X^ and a uniformly continuous f:X→Y with Y complete and separated.

[L1]

The minimal-Cauchy-filter construction gives a Hausdorff completion ηc:X→Xc (Every uniform space has a Hausdorff completion with dense canonical image, and the canonical map is a uniform embedding exactly when the original uniformity is separated), and every Cauchy filter has a canonical associated minimal Cauchy filter (Every Cauchy filter canonically determines a unique minimal Cauchy filter coarser than it).

[L3]

The basic entourages of Xc declare two minimal Cauchy filters close when they have cross-close members (The standard entourages on minimal Cauchy filters form a separated uniformity), and symmetric entourages with prescribed finite-composite control exist (Every uniformity has a base of symmetric entourages).

[L4]

Uniformly continuous maps are continuous, and two continuous maps into a Hausdorff space that agree on a dense subset agree everywhere (Every uniformly continuous map is continuous for the induced topologies, Two continuous maps into a Hausdorff space that agree on a dense subset are equal).

[A1]

A Hausdorff completion has dense image and its source uniformity is exactly the pullback of the target uniformity (A Hausdorff completion of a uniform space and its canonical dense map).

Proof

technique · constructive
1.1

First use the canonical completion Xc. For a minimal Cauchy filter M∈Xc, its image filter f∗M:={B⊆Y:f−1[B]∈M} is Cauchy: for a target entourage V, uniform continuity supplies a source entourage E whose E-related pairs have V-related images, and an E-small member of M has V-small image. Completeness gives a limit, which is unique by separatedness. Define f^c(M) to be that limit.

L1L2construct
2.1

For x∈X, the image under f of the minimal point filter ηc(x) converges to f(x): for a neighbourhood ball V[f(x)], uniform continuity supplies a source ball at x whose image lies in it. Therefore f^cηc=f.

step 1.1L1L2
2.2

The map f^c is uniformly continuous. Given a target entourage V, choose a symmetric W with W∘3⊆V, and a source entourage E whose E-related pairs have W-related images. If M E^ N, take witnesses A∈M and B∈N with A×B⊆E. Since the image filters converge to f^c(M) and f^c(N), respectively, their members f[A] and f[B] meet the corresponding W-balls. Thus the two limits are related by W∘W∘W⊆V.

step 1.1L2L3
3.1

Any two uniformly continuous extensions across ηc agree on the dense set ηc[X], hence agree everywhere by [L4]. Thus the canonical completion has the asserted extension property.

step 2.1step 2.2L1L4
4.1

Now let η:X→X^ be an arbitrary Hausdorff completion. Step 3.1 applied to η gives a uniformly continuous T:Xc→X^ with Tηc=η. For z∈X^, let Fz be the filter on X generated by the sets AV(z):={x∈X:(η(x),z)∈V}, where V ranges over symmetric entourages of X^. Density makes these sets nonempty; intersections are refined by intersecting entourages. The pullback condition in [A1], together with a symmetric square root in X^, shows that Fz is Cauchy. Define S(z):=m(Fz)∈Xc.

step 3.1L1L3A1construct
5.1

The same pullback calculation gives Sη=ηc. It also proves that S is uniformly continuous: for a basic E^ of Xc, choose a symmetric source entourage D with D∘3⊆E, then a symmetric target entourage V whose pullback lies in D and a symmetric W with W∘3⊆V. If (z,z′)∈W, then AW(z)×AW(z′) is D-small across the two filters; enlarging these sets by D gives members of their associated minimal filters whose cross product lies in D∘3⊆E. Hence (S(z),S(z′))∈E^.

step 4.1L1L3A1
6.1

The maps ST:Xc→Xc and TS:X^→X^ agree with the respective identity maps on the dense images of X. By [L4] they are the identity maps. Thus T and S are inverse uniform isomorphisms, uniquely so because any competing map agrees with T on the dense image.

step 4.1step 5.1L1L2L4
7.1

For the original map f:X→Y, the composite f^:=f^c∘S:X^→Y is uniformly continuous and satisfies f^η=f. Uniqueness follows from density and [L4]. Consequently every Hausdorff completion has the extension property, and step 6.1 proves uniqueness of completions up to the unique stated uniform isomorphism.

step 2.1step 2.2step 5.1step 6.1L4discharge-construct∎
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Totally bounded uniform space

Definition

A uniform space X is totally bounded if, for every entourage E, there is a finite set F⊆X such that X=⋃x∈FE[x]. Finiteness has the library meaning of The cardinality ∣A∣ of a finite set.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Every ultrafilter on a totally bounded uniform space is Cauchy

Statement

Every ultrafilter on a totally bounded uniform space is Cauchy.

Facts & Assumptions

Given: A totally bounded uniform space X and an ultrafilter V on it.

[L1]

Total boundedness gives a finite cover by entourage balls (Totally bounded uniform space).

[L2]

An ultrafilter containing a finite union contains one member of the union (Ultrafilters are prime: a union in U has a member in U).

[L3]

Cauchyness asks for an E-small filter member for each entourage (Cauchy filter in a uniform space).

[L4]

Every entourage contains a symmetric entourage whose square lies in it (Every uniformity has a base of symmetric entourages).

Proof

technique · direct
1.1

Let E be an entourage and choose a symmetric D with D−1∘D=D∘2⊆E.

L4choose
1.2

Total boundedness gives finite F with X=⋃x∈FD[x]; since X∈V, [L2] gives D[x]∈V for some x∈F.

L1L2
2.1

Any two points of D[x] are E-related, so D[x]×D[x]⊆E.

step 1.1step 1.2
3.1

This supplies an E-small member for every E, so V is Cauchy by [L3].

step 2.1L3∎
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Every compact uniform space is complete

Statement

Every compact uniform space is complete.

Facts & Assumptions

Given: A compact uniform space X and a Cauchy filter F on it.

[L2]

A Cauchy filter with a cluster point converges to that point (A Cauchy filter with a cluster point converges to that point).

[L3]

Completeness means convergence of every Cauchy filter (Complete uniform space: every Cauchy filter converges).

Proof

technique · direct
1.1

The closures of the members of F have the finite-intersection property, because finite intersections of filter members are nonempty and lie in the corresponding intersections of closures.

L1
2.1

Compactness gives x∈⋂A∈FA‾; every neighbourhood of x therefore meets every A∈F, so x is a cluster point of F.

step 1.1L1
3.1

By [L2] the filter converges, and since it was arbitrary X is complete by [L3].

step 2.1L2L3∎
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Every compact uniform space is totally bounded

Statement

Every compact uniform space is totally bounded.

Facts & Assumptions

Given: A compact uniform space X and an entourage E.

[L1]

Symmetric entourages form a base (Every uniformity has a base of symmetric entourages).

[L3]

Total boundedness asks for a finite family of entourage balls (Totally bounded uniform space).

[L4]

Every entourage ball is a neighbourhood and hence contains an open neighbourhood of its centre (The sets containing an entourage ball about each of their points form a topology).

Proof

technique · direct
1.1

Choose a symmetric D⊆E. For each x∈X, let Ox be the union of all open subsets of D[x] that contain x. By [L4], Ox is an open neighbourhood of x contained in D[x], and the family (Ox)x∈X covers X.

L1L4
2.1

Compactness gives finite F⊆X with X=⋃x∈FOx⊆⋃x∈FD[x].

step 1.1L2
3.1

Since D[x]⊆E[x], the same finite set covers X by E-balls, proving total boundedness by [L3].

step 2.1L3∎
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

Assuming the ultrafilter lemma, every complete and totally bounded uniform space is compact

Statement

Assume the ultrafilter lemma. Every complete and totally bounded uniform space is compact.

Facts & Assumptions

Given: A complete, totally bounded uniform space X and the ultrafilter lemma.

[L1]

Every ultrafilter on a totally bounded uniform space is Cauchy (Every ultrafilter on a totally bounded uniform space is Cauchy).

[L2]

Completeness makes every Cauchy filter converge (Complete uniform space: every Cauchy filter converges).

Proof

technique · direct
1.1

Let V be an ultrafilter on X. It is Cauchy by [L1].

L1
2.1

Completeness makes V converge by [L2].

step 1.1L2
3.1

Every ultrafilter converges, so X is compact by [L3], under the stated ultrafilter-lemma assumption.

step 2.1L3∎
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Assuming the ultrafilter lemma, a uniform space is compact if and only if it is complete and totally bounded

Statement

Assume the ultrafilter lemma. A uniform space is compact if and only if it is complete and totally bounded.

Facts & Assumptions

Given: A uniform space and the ultrafilter lemma.

[L1]

Compact uniform spaces are complete (Every compact uniform space is complete).

[L2]

Compact uniform spaces are totally bounded (Every compact uniform space is totally bounded).

[L3]

Under the ultrafilter lemma, complete totally bounded uniform spaces are compact (Assuming the ultrafilter lemma, every complete and totally bounded uniform space is compact).

Proof

technique · direct
1.1

Compactness implies completeness and total boundedness by [L1] and [L2].

L1L2
1.2

Completeness together with total boundedness implies compactness by [L3].

L3
2.1

The two implications prove the equivalence under the stated assumption.

step 1.1step 1.2∎
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Every open cover of a compact Hausdorff space has a finite open star-refinement

Statement

Every open cover of a compact Hausdorff space has a finite open star-refinement.

Facts & Assumptions

Given: A compact Hausdorff space X and an open cover U.

[L1]

A compact Hausdorff space is regular and normal (A compact Hausdorff space is regular and normal, hence T3 and T4).

[L3]

A finite family is indexed by a natural number (The cardinality ∣A∣ of a finite set).

Proof

technique · constructive
1.1

Let V be the family of all open sets V such that V‾⊆U for some U∈U. This family covers X. Indeed, for x∈U∈U, normality separates the closed sets {x} and X∖U by disjoint open sets; the open set containing x has closure contained in U. This definition uses no choices indexed by X.

L1L4construct
1.2

We record a finite shrinking construction. Given a finite open cover A0,…,Am−1, recursively put Fi=X∖(⋃j<iBj∪⋃j>iAj). The earlier covering clauses imply Fi⊆Ai. Normality separates Fi from X∖Ai, giving an open Bi with Fi⊆Bi⊆Bi‾⊆Ai. At the last stage the Bi cover X. Thus every finite open cover has an open shrinking whose closures remain in the original members.

L1L3L4construct
2.1

Compactness gives a finite subcover V0,…,Vn−1 of V. Finite choice supplies Ui∈U with Vi‾⊆Ui for each i<n.

step 1.1L2L4
2.2

From a finite cover Ai and an open shrinking Bi as in step 1.2, form, for each nonempty S⊆{0,…,m−1}, WS=(⋂i∈SAi)∖(⋃j∉SBj‾), discarding empty members. These finitely many sets are open and cover X: at x, take S={i:x∈Ai}. Moreover, choose k with x∈Bk. Every WS containing x has k∈S, so WS⊆Ak. Hence the point-star St⁡(x,W) lies in Ak. Call this a barycentric refinement of (Ai).

step 1.2L3construct
3.1

Apply step 2.2 to the finite cover (Ui) and its shrinking (Vi) from step 2.1, obtaining a finite open barycentric refinement W of U. Apply steps 1.2 and 2.2 again to W, obtaining a finite open barycentric refinement Z of W.

step 2.1step 1.2step 2.2
4.1

The cover Z star-refines U. Fix Z0∈Z and x∈Z0. Barycentricity of W gives U∈U with St⁡(x,W)⊆U. If Z∈Z meets Z0 at y, barycentricity of Z gives Wy∈W containing St⁡(y,Z). Both Z0 and Z lie in Wy, and x∈Wy, so Z⊆Wy⊆St⁡(x,W)⊆U. Thus St⁡(Z0,Z)⊆U.

step 3.1
5.1

The finite open cover Z is therefore a star-refinement of the original cover.

step 4.1discharge-construct∎
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

The covers admitting an open refinement form a compatible uniform-cover structure on a nonempty compact Hausdorff space; in particular every open cover is uniform

Statement

For a nonempty compact Hausdorff space, the covers that admit an open refinement form a compatible uniform-cover structure. In particular every open cover is uniform.

Facts & Assumptions

Given: A nonempty compact Hausdorff space X.

[L1]

Every open cover has a finite open star-refinement (Every open cover of a compact Hausdorff space has a finite open star-refinement).

[L2]

A uniform-cover structure is closed under coarsening and common refinement and has star-refinements (Uniform space in the uniform-cover formulation).

[L3]

A uniform-cover structure determines an entourage uniformity with basic relations EV=⋃V∈VV×V, and entourage balls form neighbourhood bases for the induced topology (On a nonempty set, entourage uniformities and uniform-cover structures determine one another, The sets containing an entourage ball about each of their points form a topology).

Proof

technique · direct
1.1

Let C be the covers admitting an open refinement. It is nonempty, since {X} is open.

construct
2.1

Coarsening preserves membership in C, and two open refinements have their intersection cover as a common open refinement.

step 1.1
2.2

For V∈C, take an open refinement and then its finite open star-refinement from [L1]; this is a star-refinement still witnessing membership in C.

L1step 1.1
3.1

Thus C satisfies [L2]. Since every open cover refines itself, every open cover belongs to C.

step 2.1step 2.2L2
4.1

The entourage uniformity recovered from C by [L3] induces the original topology. If V∈C, choose an open refinement W; then EW[x]=St⁡(x,W) contains an open member through x, so the recovered entourage balls are neighbourhoods in the original topology. Conversely, if x∈O with O open, the open cover {O,X∖{x}} belongs to C, since Hausdorffness makes {x} closed. By [L1] choose a finite open star-refinement W, which belongs to C, and choose W0∈W containing x. The star of W0 lies in O, rather than in X∖{x}, and therefore EW[x]=St⁡(x,W)⊆St⁡(W0,W)⊆O.

step 3.1L1L3
5.1

Hence the structure is compatible with the given topology, and every open cover is uniform.

step 3.1step 4.1∎
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

A nonempty compact Hausdorff space carries exactly one compatible uniformity

Statement

A nonempty compact Hausdorff topology carries exactly one compatible uniformity.

Facts & Assumptions

Given: A nonempty compact Hausdorff topology on X.

[L2]

Uniform-cover and entourage structures determine each other (On a nonempty set, entourage uniformities and uniform-cover structures determine one another).

[L3]

A compatible uniformity is one whose induced topology is the given topology (Uniformizable and separated-uniformizable topological spaces).

[L5]

Every open cover of a compact Hausdorff space has a finite open star-refinement (Every open cover of a compact Hausdorff space has a finite open star-refinement).

Proof

technique · direct
1.1

Apply [L2] to the cover structure of [L1] to obtain one compatible entourage uniformity.

L1L2
1.2

Let U be any compatible uniformity. Each entourage-ball cover admits an open refinement because every ball is a neighbourhood in the induced topology, so every cover uniform for U admits an open refinement.

L2L3L4
1.3

Conversely, let O be an open cover and take a finite open star-refinement W by [L5]. Form the family of all open sets N for which there are x∈N, W∈W, and a symmetric entourage D satisfying N⊆D[x] and D∘2[x]⊆W. This family covers X: given x, first take W∈W containing it, then use compatibility and a symmetric square root to obtain such D and an open neighbourhood N⊆D[x]. Compactness gives finitely many witnesses (Ni,xi,Wi,Di) covering X. Put D=⋂iDi. If y∈Ni and z∈D[y], then symmetry gives xiDiyDiz, so z∈Di∘2[xi]⊆Wi. Hence the D-ball cover refines W, and therefore refines O. Thus every open cover is uniform for U.

L3L4L5choose
2.1

By steps 1.2 and 1.3, the cover structure associated to U consists exactly of the covers admitting an open refinement, which is the structure in [L1].

L1step 1.2step 1.3
3.1

The dictionary [L2] then recovers the same entourage uniformity from either structure, proving uniqueness.

step 1.1step 2.1L2∎
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

Every continuous map from a nonempty compact Hausdorff space to a uniform space is uniformly continuous

Statement

Every continuous map from a nonempty compact Hausdorff space to a uniform space is uniformly continuous.

Facts & Assumptions

Given: A continuous map f:X→Y with X nonempty compact Hausdorff and Y uniform.

[L1]

A compact Hausdorff space has one compatible uniformity (A nonempty compact Hausdorff space carries exactly one compatible uniformity).

[L2]

Continuity means that every neighbourhood of f(x) contains the image of some neighbourhood of x, while uniform continuity is the entourage condition (Continuity of a map of topological spaces at a point and globally, Uniformly continuous map between uniform spaces).

[L3]

Every entourage ball is a neighbourhood in the induced topology (The sets containing an entourage ball about each of their points form a topology). Every open cover of a nonempty compact Hausdorff space is uniform (The covers admitting an open refinement form a compatible uniform-cover structure on a nonempty compact Hausdorff space; in particular every open cover is uniform), and every uniform cover has an entourage-ball cover refining it (On a nonempty set, entourage uniformities and uniform-cover structures determine one another); every target entourage has a symmetric square root (Every uniformity has a base of symmetric entourages).

Proof

technique · direct
1.1

Let V be a target entourage and choose a symmetric W with W−1∘W=W∘2⊆V. For each x∈X, let Ox be the union of all open sets O such that x∈O and f[O]⊆W[f(x)]. Continuity makes this family nonempty, and its union is an open neighbourhood of x satisfying f[Ox]⊆W[f(x)].

L2L3construct
2.1

The open cover (Ox)x∈X is uniform by [L3]. Hence there is a source entourage E whose ball cover refines it: for each a∈X, some Ox contains E[a].

step 1.1L1L3
3.1

If (a,b)∈E, then a,b∈E[a]⊆Ox for some x. Thus f(a),f(b)∈W[f(x)], so (f(a),f(b))∈W−1∘W⊆V. This is uniform continuity.

step 1.1step 2.1L2∎
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

A uniformity with a countable entourage base

Definition

A uniformity is countably based if it has an at most countable filter base of entourages (Filter base and the filter it generates, Finite, countably infinite, countable, uncountable): every entourage contains a member of that base.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

A countable entourage base can be replaced in ZF by a decreasing symmetric base whose next triple composite lies in the preceding member

Statement

In ZF, every countably based uniformity has a decreasing symmetric base (En) with En+1∘3⊆En.

Facts & Assumptions

Given: A countable entourage base B.

[L1]

Symmetric entourages form a base and have square roots (Every uniformity has a base of symmetric entourages).

[L2]

A nonempty subset of N has a least element (The well-ordering principle).

[L3]

Recursion constructs a sequence from a specified starting value and successor map (The recursion theorem).

Proof

technique · constructive
1.1

Use the finite listing or bijection supplied by countability to write the given base as (Cn), repeating its last member in the finite case. Put Bn=⋂i≤n(Ci∩Ci−1). Then (Bn) is a canonically defined decreasing symmetric cofinal base.

L1construct
1.2

Define indices recursively. Put r0=0, and let rn+1 be the least k>rn such that Bk∘3⊆Brn; then put En=Brn.

L1L2L3construct
2.1

Each required set of indices is nonempty: choose a symmetric entourage D with D∘3⊆Brn, then use cofinality and decreasingness to find k>rn with Bk⊆D. Thus the recursion is defined. The inequalities rn+1>rn give decreasingness and cofinality, while the defining clause gives triple control.

step 1.1step 1.2L1L2
3.1

Therefore (En) is the asserted normal base in ZF.

step 2.1discharge-construct∎
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

Every countably based uniformity is generated by one pseudometric, which is a metric exactly when the uniformity is separated

Statement

Every countably based uniformity is generated by one pseudometric. That pseudometric is a metric exactly when the uniformity is separated.

Facts & Assumptions

Proof

technique · constructive
1.1

Apply [L1] and [L2] to obtain a pseudometric p whose dyadic balls are cofinal in U.

L1L2construct
2.1

Cofinality means that the uniformity generated by p is exactly U.

step 1.1
3.1

The zero pairs of p are the intersection of its dyadic entourages, so they are diagonal exactly when U is separated; by [L3] this is exactly when p is a metric.

step 2.1L3
4.1

This proves both assertions.

step 2.1step 3.1discharge-construct∎
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Uniformizable and separated-uniformizable topological spaces

Definition

A topological space is uniformizable if its topology is induced by some uniformity (The sets containing an entourage ball about each of their points form a topology). It is separated-uniformizable if it is induced by a separated uniformity (Separated uniformity: the intersection of all entourages is the diagonal).

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Every uniformizable space is regular

Statement

Every uniformizable topological space is regular, in ZF.

Facts & Assumptions

Given: A topology induced by a uniformity, a closed C, and x∉C.

[L1]

Entourage balls form neighbourhood bases and entourages have iterated square roots (The sets containing an entourage ball about each of their points form a topology, Uniform space in the entourage formulation).

[L3]

Symmetric entourages have square roots, and a point is outside the closure of a set when it has a neighbourhood disjoint from that set (Every uniformity has a base of symmetric entourages, Interior, closure, boundary, exterior, derived set and isolated point in a topological space).

Proof

technique · direct
1.1

Since X∖C is an open neighbourhood of x, choose an entourage E with E[x]⊆X∖C, then choose a symmetric D with D∘2⊆E.

L1L3choose
1.2

Let O be the union of all open subsets of D[x] containing x. Then O is open and x∈O⊆D[x] because D[x] is a neighbourhood.

L1construct
2.1

One has O‾⊆E[x]. Indeed, if y∉E[x], then the neighbourhood D[y] is disjoint from O: a point z∈D[y]∩O⊆D[y]∩D[x] would give (x,y)∈D∘2⊆E by symmetry. Hence y∉O‾ by [L3].

step 1.1step 1.2L1L3
3.1

Since E[x]∩C=∅, step 2.1 gives C⊆X∖O‾. The two open sets O and X∖O‾ are disjoint neighbourhoods of x and C, so the space is regular by [L2].

step 1.1step 2.1L2∎
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Assuming dependent choice, every uniformizable space is completely regular

Statement

Assuming dependent choice, every uniformizable topological space is completely regular.

Facts & Assumptions

Given: A topology induced by a uniformity, a closed C, a point x∉C, and dependent choice.

[L1]

A normal entourage sequence yields a uniformly continuous pseudometric with controlled balls (A normal sequence of entourages yields a uniformly continuous pseudometric with controlled dyadic balls).

[L2]

Complete regularity requires a continuous [0,1]-valued function equal to 1 at x and 0 on C (Completely regular spaces and Tychonoff (T312) spaces).

[L4]

Dependent choice produces the normal sequences used in the pseudometric construction (Assuming dependent choice, every entourage admits a normal symmetric sequence subordinate to it).

[L5]

Entourage balls form neighbourhood bases for the induced topology (The sets containing an entourage ball about each of their points form a topology).

Proof

technique · constructive
1.1

Choose an entourage U with U[x]∩C=∅ by [L5]. Using dependent choice, take a normal sequence with E0=X×X and E1⊆U.

L4L5chooseconstruct
2.1

Let p be the controlled pseudometric from [L1]. Since {p≤1/4}⊆E1⊆U, every y∈C satisfies p(x,y)>1/4.

step 1.1L1
3.1

Put g(y)=min⁡{1,4p(x,y)}. The reverse triangle inequality for a pseudometric gives ∣p(x,y)−p(x,z)∣≤p(y,z), and truncation at 1 does not increase absolute differences. Hence, for every ε>0, the entourage {(y,z):p(y,z)<ε/4} forces ∣g(y)−g(z)∣<ε; g is uniformly continuous. Also g(x)=0 and g[C]={1} by step 2.1, so 1−g has the orientation required in [L2].

step 2.1L1construct
4.1

By [L3], 1−g is continuous, so [L2] proves complete regularity.

step 3.1L2L3discharge-construct∎
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

The topology of a nonempty completely regular space is induced by the gauge of its continuous [0,1]-valued pseudometrics

Statement

The topology of a nonempty completely regular space is induced by the gauge of pseudometrics pf(x,y)=∣f(x)−f(y)∣, where f:X→[0,1] ranges over continuous maps.

Facts & Assumptions

Given: A nonempty completely regular space X.

[L1]

Complete regularity separates a point from a closed set by a continuous [0,1]-valued function (Completely regular spaces and Tychonoff (T312) spaces, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L2]

Such functions are continuous in the neighbourhood sense (Continuity of a map of topological spaces at a point and globally).

[L3]

A gauge generates a uniformity from finite simultaneous pseudometric balls (A gauge of pseudometrics and, on a nonempty set, the uniformity it generates).

[L4]

Absolute value is nonnegative, vanishes only at zero and is even (Basic properties of the absolute value), and it satisfies ∣u+v∣≤∣u∣+∣v∣ (The triangle inequality).

Proof

technique · constructive
1.1

For each continuous f:X→[0,1], direct substitution in [L4] shows that pf(x,y)=∣f(x)−f(y)∣ is nonnegative, symmetric, zero on the diagonal and satisfies the triangle inequality, so it is a pseudometric; its balls about x are original-open by [L2].

L2L4construct
1.2

Conversely, if x∈U is original-open, apply [L1] to the closed set X∖U to obtain f with f(x)=1 and f[X∖U]={0}; then the pf-ball of radius 1/2 about x lies in U.

L1L3choose
2.1

Hence every gauge-open set is original-open.

step 1.1L3
3.1

Thus original-open and gauge-open sets contain one another, so the two topologies agree.

step 2.1step 1.2discharge-construct∎
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

Assuming dependent choice, a nonempty topological space is uniformizable if and only if it is completely regular

Statement

Assuming dependent choice, a nonempty topological space is uniformizable if and only if it is completely regular.

Facts & Assumptions

Given: A nonempty topological space and dependent choice.

[L1]

Under dependent choice, uniformizable spaces are completely regular (Assuming dependent choice, every uniformizable space is completely regular).

[L2]

A completely regular topology is induced by its gauge of continuous pseudometrics (The topology of a nonempty completely regular space is induced by the gauge of its continuous [0,1]-valued pseudometrics).

[L3]

Uniformizable means induced by some uniformity (Uniformizable and separated-uniformizable topological spaces).

Proof

technique · direct
1.1

The forward implication is [L1].

L1
1.2

The gauge supplied by [L2] is a uniformity inducing the given topology, so the reverse implication is [L2] and [L3].

L2L3
2.1

The two implications prove the equivalence under dependent choice.

step 1.1step 1.2∎
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

Assuming dependent choice, a nonempty topological space is separated-uniformizable if and only if it is Tychonoff

Statement

Assuming dependent choice, a nonempty topological space is separated-uniformizable if and only if it is Tychonoff.

Facts & Assumptions

Given: A nonempty topological space and dependent choice.

[L1]

Uniformizable is equivalent to completely regular under dependent choice (Assuming dependent choice, a nonempty topological space is uniformizable if and only if it is completely regular).

[L2]

A separated compatible uniformity induces a Hausdorff topology (A uniformity is separated if and only if its induced topology is Hausdorff).

[L4]

A completely regular topology is induced by the gauge pf(x,y)=∣f(x)−f(y)∣ over all continuous f:X→[0,1] (The topology of a nonempty completely regular space is induced by the gauge of its continuous [0,1]-valued pseudometrics, A gauge of pseudometrics and, on a nonempty set, the uniformity it generates).

Proof

technique · direct
1.1

A separated-uniformizable space is completely regular by [L1] and Hausdorff by [L2], hence T1 by [L5] and therefore Tychonoff by [L3].

L1L2L3L5
1.2

Conversely, let X be Tychonoff. For x≠y, the singleton {y} is closed by [L6], and complete regularity gives a continuous f:X→[0,1] with f(x)=1 and f(y)=0. Thus the gauge in [L4] has an entourage excluding (x,y), so its intersection is the diagonal and it is separated. It induces the original topology by [L4].

L3L4L6
2.1

Thus it is separated-uniformizable, proving the converse and the equivalence.

step 1.2∎
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Topological group: multiplication and inversion are continuous

Definition

A topological group is a group G (Group and abelian group) with a topology such that multiplication m:G×G→G, m(x,y)=xy, and inversion ι:G→G, ι(x)=x−1, are continuous (Continuity of a map of topological spaces at a point and globally) for the product topology (The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space).

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Left and right translations and inversion in a topological group are homeomorphisms

Statement

For g in a topological group, Lg(x)=gx, Rg(x)=xg, and ι(x)=x−1 are homeomorphisms.

Facts & Assumptions

Given: A topological group G and g∈G.

[L1]

Multiplication and inversion are continuous (Topological group: multiplication and inversion are continuous).

[L3]

A homeomorphism is a continuous bijection with continuous inverse (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).

Proof

technique · direct
1.1

The maps Lg and Rg are continuous as composites of multiplication with constant maps, and their inverses are Lg−1 and Rg−1, also continuous.

L1L2
1.2

Inversion is continuous and its own continuous inverse by [L1] and [L2].

L1L2
2.1

Thus all three maps are homeomorphisms by [L3].

step 1.1step 1.2L3∎
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

The left and right uniformities of a topological group

Definition

Let G be a topological group with identity e. For every neighbourhood U of e (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open), put

LU={(x,y):x−1y∈U},RU={(x,y):yx−1∈U}.

The filters generated by the LU and by the RU are respectively the left uniformity and the right uniformity of G. These are uniformities. Indeed, finite intersections of identity neighbourhoods refine finite intersections of the corresponding relations; the diagonal lies in every relation; LU−1=LU−1 and RU−1=RU−1; and continuity of multiplication at (e,e) gives a neighbourhood V with V⋅V⊆U, whence LV∘LV⊆LU and RV∘RV⊆RU. Thus all axioms of Uniform space in the entourage formulation hold.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

The left and right uniformities of a topological group induce its topology, and inversion interchanges them

Statement

The left and right uniformities of a topological group induce its given topology. Inversion is a uniform isomorphism from the left uniformity to the right uniformity.

Facts & Assumptions

Given: A topological group G.

[L1]

The left and right balls are LU[x]=xU and RU[x]=Ux (The left and right uniformities of a topological group).

[L3]

Entourage balls form bases for the induced topologies (The sets containing an entourage ball about each of their points form a topology).

Proof

technique · direct
1.1

As U ranges over neighbourhoods of e, xU ranges over neighbourhoods of x by the left translation homeomorphism, so left balls induce the given topology.

L1L2L3
1.2

Similarly Ux ranges over neighbourhoods of x by right translation, so right balls induce the given topology.

L1L2L3
1.3

The identity (x−1)−1y−1=(yx−1)−1 sends a left entourage to the inverse of the corresponding right entourage; shrinking neighbourhoods proves uniform continuity in both directions.

L1L2
2.1

Thus inversion interchanges the two uniformities as a uniform isomorphism.

step 1.3∎
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

The upper and Roelcke uniformities generated from the left and right uniformities of a topological group

Definition

For the left and right uniformities UL,UR of a topological group:

  • the upper uniformity is their join UL∨UR, with basic entourages LU∩RV;
  • the Roelcke uniformity is their meet UL∧UR, with a base of composites LU∘RV.

For the upper structure, intersections are the usual base for the least filter containing both input uniformities; inverse and square-root axioms follow by shrinking the left and right factors separately.

For the Roelcke structure, left and right relations commute: LU∘RV=RV∘LU, both saying that y∈VxU. Their inverses are again such composites, and if U0 2⊆U and V0 2⊆V, then (LU0∘RV0)∘2⊆LU∘RV. Finite intersections are refined by intersecting the identity neighbourhoods. Hence both displayed bases satisfy Uniform space in the entourage formulation. The names and formulas are kept separate.

CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

Every topological group is uniformizable, and assuming dependent choice it is completely regular

Statement

Every topological group is uniformizable. Assuming dependent choice, every topological group is completely regular.

Proof

technique · direct
1.1

The left uniformity of [L1] makes the group uniformizable.

L1
2.1

Under dependent choice, [L2] applied to step 1.1 makes it completely regular.

step 1.1L2∎
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

The pointwise and uniform-convergence uniformities on a function set YX

Definition

Let Y be uniform and let YX be the set of maps X→Y. For an entourage V of Y and finite F⊆X (The cardinality ∣A∣ of a finite set), define

P(F,V)={(f,g):(f(x),g(x))∈V for every x∈F},Q(V)={(f,g):(f(x),g(x))∈V for every x∈X}.

The relations P(F,V) form an entourage base: finite intersections are refined by replacing F with a finite union and V with a common refinement; inverses replace V by V−1; and a square root of V gives a square root of P(F,V). The same verification with the fixed coordinate set X proves the axioms for the Q(V). The uniformities they generate are respectively the pointwise-convergence and uniform-convergence uniformities on YX.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31Open item page →

The uniform-convergence uniformity is finer than the pointwise uniformity, and they agree when the domain is finite

Statement

The uniform-convergence uniformity on YX is finer than the pointwise-convergence uniformity. If X is finite, they are equal.

Facts & Assumptions

Given: A uniform space Y, a set X, an entourage V, and finite F⊆X.

[L1]

Pointwise basic entourages require V-closeness on F, while uniform basic entourages require it on all of X (The pointwise and uniform-convergence uniformities on a function set YX).

[L2]

Finiteness allows X itself as an allowed finite coordinate set (The cardinality ∣A∣ of a finite set).

Proof

technique · direct
1.1

Q(V)⊆P(F,V), so every pointwise basic entourage contains a uniform basic entourage.

L1
1.2

If X is finite, P(X,V)=Q(V) by [L1] and [L2], so each uniform basic entourage is pointwise basic as well.

L1L2
2.1

Hence uniform convergence is finer than pointwise convergence.

step 1.1
3.1

The two uniformities are equal in the finite-domain case.

step 2.1step 1.2∎

5 · Examples, counterexamples and false statements

None yet.

Sources