Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 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.

In the bounded real-valued functions on N with the supremum metric, the closed unit ball is closed and bounded and is not compact: the indicator functions of the singletons are pairwise at distance 1

Statement refuted

Refuted claim: in every metric space a closed and bounded subset is compact (FALSE: a closed and bounded subset of a metric space is compact).

The witness is the space B(N) of bounded functions N→R with the supremum metric d∞(f,g)=sup⁡{ ∣f(s)−g(s)∣:s∈N } (The supremum metric d∞(f,g)=sup⁡x∣f(x)−g(x)∣ is a metric on the bounded real-valued functions on a nonempty set), together with the closed unit ball

K  :=  { f∈B(N):d∞(f,0)≤1 }

about the zero function 0. The set K is closed in B(N) (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement) and bounded (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space), and it is not compact (Open cover, subcover, compact metric space, and compact subset of a metric space): the indicator functions en of the singletons {n} lie in K and satisfy d∞(em,en)=1 whenever m≠n, so no finite 1/2-net for K can exist.

This is the same failure as in FALSE: a closed and bounded subset of a metric space is compact, in the space where it matters analytically: closed bounded sets of a function space are routinely not compact.

Facts & Assumptions

Given: The set B(N) of bounded functions N→R with the supremum metric d∞, the zero function 0, the closed unit ball K, and for n∈N the function en with en(n)=1 and en(s)=0 for s≠n.

[L4]

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

Counterexample

technique · direct
1.1

Each en is a bounded function N→R, its range being contained in {0,1}, so en∈B(N); and d∞(en,0)=sup⁡{∣en(s)∣:s∈N}=1, so en∈K.

L1
2.1

For m≠n the set {∣em(s)−en(s)∣:s∈N} is {0,1}, since the value is 1 at s=m and at s=n and 0 elsewhere; hence d∞(em,en)=1.

L1step 1.1
2.2

K is the closed ball Bˉ(0,1), hence closed in B(N), and it is contained in B(0,2), hence bounded.

L2step 1.1
2.3

Suppose K had a finite 1/2-net F; then F is empty or listable as {y0,…,yp}, and it is not empty because K contains e0. Define φ:N→σ(p) by letting φ(n) be the least i≤p with d∞(en,yi)<1/2, which exists because the 1/2-balls about the yi cover K and en∈K.

L3L4step 1.1
3.1

φ is injective: if φ(m)=φ(n)=i with m≠n, then d∞(em,en)≤d∞(em,yi)+d∞(yi,en)<1/2+1/2=1, contradicting step 2.1.

L1step 2.1step 2.3
4.1

So N is in bijection with φ[N], a subset of N bounded above by p and therefore finite, making N equinumerous with a natural number, which is false.

L5step 3.1
5.1

Hence K has no finite 1/2-net, so K is not totally bounded and therefore not compact, while being closed and bounded by step 2.2; the claim of FALSE: a closed and bounded subset of a metric space is compact is refuted.

L3step 2.2step 4.1∎

Remarks

What goes wrong is room, not size. The ball K has diameter 2, so it is small in the metric sense; but it contains infinitely many points that are pairwise at distance 1, so no finite family of small balls reaches all of them. That is exactly the failure of total boundedness, and it is one of the two conditions that, by For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice, are together equivalent to compactness once the Axiom of Countable Choice and the Axiom of Dependent Choice are assumed.

What the argument does and does not settle. It shows that K fails total boundedness, and that alone rules out compactness by [L3]. Nothing above is claimed about whether K is complete; the point of the witness is that closedness and boundedness, the two conditions that suffice in Rn (Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line), do not suffice here.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

73 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