Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passverified 2026-08-04 (gpt-5.6-sol-codex-subscription)
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.

The open interval (0,1) is totally bounded and not compact, the cover by the intervals (1/(k+2),1) having no finite subcover

Statement refuted

Refuted claim: every totally bounded metric space is compact (FALSE: a totally bounded metric space is compact).

The witness is the interval (0,1) (Intervals of R: the nine order-convex forms, nondegeneracy, and length) as a metric subspace of (R,dR), dR(x,y)=∣x−y∣ (The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded, Isometry, isometric embedding, and the subspace metric on a subset). It is totally bounded (Finite ε-net and totally bounded metric space), the points j/(m+1) for 1≤j≤m forming a finite net of mesh 1/(m+1); and it is not compact (Open cover, subcover, compact metric space, and compact subset of a metric space), the family

Uk  :=  (1k+2, 1),k∈N,

having union (0,1) and no finite subfamily with that union. The index is written k+2 because N contains 0, so that 1/(k+2)≤1/2<1 for every k and each Uk is a nonempty subinterval of (0,1).

The full verification is carried out in FALSE: a totally bounded metric space is compact; this item records the witness and says what makes it work.

Facts & Assumptions

Given: The interval (0,1) with the metric ∣x−y∣ restricted to it, and the sets Uk=(1/(k+2),1) for k∈N.

[A1]

The refuted claim: every totally bounded metric space is compact.

[L3]

A nonempty finite set of reals has a minimum, one of its members (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[L4]

For every real η>0 there is a natural m≥1 with 1/m<η, and reciprocals of positives are positive and reverse the order (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε, Every complete ordered field is Archimedean, Inverses of positives are positive, and reciprocation reverses order).

Counterexample

technique · direct
1.1

(0,1) with the restricted metric is a totally bounded metric space.

L1
2.1

The family (Uk)k∈N consists of open subsets of R and has union (0,1): given x∈(0,1), a natural m≥1 with 1/m<x gives 1/(m+2)<1/m<x<1, so x∈Um.

L1L4step 1.1
3.1

Given finitely many members Uk0,…,Ukp, put t:=min⁡{1/(ki+2):i≤p}, a positive real; each Uki is contained in (t,1) because 1/(ki+2)≥t, so the union of the finite subfamily lies in (t,1), while x:=min⁡{t,1/2}/2 satisfies 0<x<1 and x≤t, so x∈(0,1) lies in no Uki.

L3L4step 2.1
4.1

Hence no finitely many of the Uk have union containing (0,1), so (0,1) is not a compact subset of R, that is not a compact metric space, while being totally bounded by step 1.1; the claim [A1] is refuted.

A1L2step 1.1step 2.1step 3.1∎

Remarks

What the witness lacks is completeness. A compact metric space is complete (A compact metric space is complete and totally bounded, and neither implication uses any choice principle, Complete metric space: every Cauchy sequence converges in the space), and (0,1) is not: the terms 1/(k+2) form a Cauchy sequence in it whose only candidate limit in R is 0, a point the space omits. Adding completeness to total boundedness does restore compactness, at the cost of the Axiom of Countable Choice (A complete, totally bounded metric space is compact, proved from countable choice used exactly once).

The same cover fails to have a Lebesgue number, which is the other thing compactness would have supplied (The cover of (0,1) by the intervals (1/(k+2),1) has no Lebesgue number, so the Lebesgue number lemma needs compactness).

Depends on

Used by

Dependency tree · two levels

51 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources