Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31
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.

Every compact uniform space is totally bounded

Statement

Every compact uniform space is totally bounded.

Facts & Assumptions

Given: A compact uniform space XX and an entourage EE.

[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 DED\subseteq E. For each xXx\in X, let OxO_x be the union of all open subsets of D[x]D[x] that contain xx. By [L4], OxO_x is an open neighbourhood of xx contained in D[x]D[x], and the family (Ox)xX(O_x)_{x\in X} covers XX.

L1L4
2.1

Compactness gives finite FXF\subseteq X with X=xFOxxFD[x]X=\bigcup_{x\in F}O_x\subseteq\bigcup_{x\in F}D[x].

step 1.1L2
3.1

Since D[x]E[x]D[x]\subseteq E[x], the same finite set covers XX by EE-balls, proving total boundedness by [L3].

step 2.1L3

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 33 results over 11 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources