Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-02
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.

Total boundedness passes to a uniform space with a dense uniformly continuous image

Statement

Let i:XYi:X\to Y be uniformly continuous with dense image. If XX is totally bounded, then YY is totally bounded.

Facts & Assumptions

Given: A target entourage EE of YY, a uniformly continuous map i:XYi:X\to Y with dense image, and a totally bounded source XX.

[L1]

The uniformity square-root axiom gives DD with DDED\circ D\subseteq E; a symmetric-entourage base then gives symmetric VDV\subseteq D, hence VVEV\circ V\subseteq E (Uniform space in the entourage formulation, Every uniformity has a base of symmetric entourages).

[L2]

Uniform continuity supplies a source entourage UU whose UU-related pairs have VV-related images (Uniformly continuous map between uniform spaces).

[L3]

Total boundedness supplies a finite FXF\subseteq X with X=aFU[a]X=\bigcup_{a\in F}U[a] (Totally bounded uniform space).

[L4]

Entourage balls are neighbourhoods, so density makes every nonempty target entourage ball meet i[X]i[X] (The sets containing an entourage ball about each of their points form a topology).

Proof

technique · direct
1.1

Choose VV and UU as in [L1] and [L2], and choose the finite UU-net FF from [L3].

L1L2L3
1.2

For yYy\in Y, density gives xXx\in X with i(x)V[y]i(x)\in V[y]; choose aFa\in F with xU[a]x\in U[a].

L3L4
2.1

Step 1.2 gives (i(a),i(x))V(i(a),i(x))\in V and, by symmetry, (i(x),y)V(i(x),y)\in V, hence (i(a),y)VVE(i(a),y)\in V\circ V\subseteq E.

step 1.1step 1.2
3.1

The finite set i[F]i[F] has EE-balls covering YY, proving total boundedness; if Y=Y=\varnothing, the empty set is the required finite net.

L3step 2.1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 28 results over 12 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