Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26
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 {0}∪[1,2] with the metric of R, the closure of B(0,1)={0} is {0} while the closed ball is {0,1}

Statement refuted

Refuted claim: in every metric space, the closure of the open ball B(x,r) is the closed ball Bˉ(x,r) (FALSE: in every metric space the closure of B(x,r) is the closed ball of radius r).

The witness is the metric subspace

X:={0}∪[1,2]⊆R

of the real line with its usual metric (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, Intervals of R: the nine order-convex forms, nondegeneracy, and length), with x=0 and r=1. In it

BX(0,1)={0},BX(0,1)‾={0},BˉX(0,1)={0,1},

so the closure of the open ball is a proper subset of the closed ball of the same centre and radius. The inclusion B(x,r)‾⊆Bˉ(x,r) that does hold in general is proved in FALSE: in every metric space the closure of B(x,r) is the closed ball of radius r and is not repeated.

Facts & Assumptions

Given: The real line with dR(u,v)=∣u−v∣, and X:={0}∪[1,2] with the subspace metric d:=dR↾(X×X).

[L2]

Balls: BX(a,s)={y∈X:d(a,y)<s} and BˉX(a,s)={y∈X:d(a,y)≤s} (Open ball, closed ball and sphere in a metric space).

[L4]
[L5]

Absolute value and order: ∣t∣=t for t≥0, ∣−t∣=∣t∣, and 0<1; by trichotomy t≥1 excludes t<1 (Absolute value in an ordered field, Basic properties of the absolute value, The multiplicative identity is positive, Ordered field, Complete ordered field (least-upper-bound property)).

[L6]

Intervals: [1,2]={t∈R:1≤t≤2} (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Counterexample

technique · direct
1.1

Every y∈[1,2] has y≥1, so d(0,y)=∣0−y∣=∣−y∣=y≥1; and d(0,0)=0<1.

L1L5L6
2.1

Hence BX(0,1)={ y∈X:d(0,y)<1 }={0}, since no y∈[1,2] satisfies d(0,y)<1; and BˉX(0,1)={ y∈X:d(0,y)≤1 }={0,1}, since among the points of [1,2] exactly y=1 satisfies y≤1.

step 1.1L2L5L6
2.2

The set [1,2]=X∖{0} is open in X: for y∈[1,2] the ball BX(y,1) cannot contain 0, because d(0,y)≥1 by step 1.1, so BX(y,1)⊆[1,2]. Therefore {0} is closed in X.

step 1.1L2L3
3.1

Since {0} is closed it equals its own closure, so BX(0,1)‾={0}‾={0}, whereas BˉX(0,1)={0,1} contains the point 1≠0.

step 2.1step 2.2L4L5
4.1

The two sets are therefore different, and (X,d) with x=0, r=1 refutes the claim: the closure of an open ball can be a proper subset of the closed ball of the same centre and radius.

step 3.1∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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