Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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 a complete metric space nested nonempty closed sets whose diameters tend to 0 meet in exactly one point, and this property characterises completeness

Statement

Assume the Axiom of Countable Choice for assertion 1. Let (X,d) be a metric space (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric). Call a sequence (Fk)k∈N of subsets of X a Cantor chain if every Fk is nonempty, closed (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, Fk+1⊆Fk for every k, and diam⁡(Fk)→0 in R (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Limits and Cauchy sequences of reals). Then:

  1. If (X,d) is complete (Complete metric space: every Cauchy sequence converges in the space), every Cantor chain in X has an intersection ⋂k∈NFk with exactly one element.
  2. Conversely, if every Cantor chain in X has nonempty intersection, then (X,d) is complete.

Boundedness of each Fk is part of the definition of a Cantor chain because diam⁡ is defined for nonempty bounded sets only in this library (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space); it is not an extra hypothesis but the precondition for writing the diameter condition down.

Facts & Assumptions

Given: For assertion 1, the Axiom of Countable Choice; a metric space (X,d); a Cantor chain (Fk) in X; a real ε>0.

[A1]

Completeness of (X,d): every Cauchy sequence in X converges to a point of X (Complete metric space: every Cauchy sequence converges in the space, Cauchy sequence in a metric space).

[A2]

The converse hypothesis: every Cantor chain in X has nonempty intersection.

[L1]

For nonempty bounded A⊆X, diam⁡(A)=sup⁡{d(a,b):a,b∈A}, so d(a,b)≤diam⁡(A) for all a,b∈A, and diam⁡(A)≥0; a set of reals bounded above has a least upper bound, and any upper bound of that set dominates it (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Complete ordered field (least-upper-bound property)).

[L2]

Closure by adherent points: x∈A‾ means B(x,r)∩A≠∅ for every real r>0; A⊆A‾; A‾ is closed and is the smallest closed superset of A, and A is closed exactly when A=A‾ (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, The closure of a nonempty A is {x:d(x,A)=0}, equals A together with its limit points, and is the smallest closed superset, Open ball, closed ball and sphere in a metric space).

[L3]

A closed set is sequentially closed: a sequence in it that converges in X has its limit in it (A point lies in the closure of A iff some sequence in A converges to it, and a set is closed iff it is sequentially closed).

[L4]

Countable choice: a family (Ak)k∈N of nonempty sets admits k↦ak with ak∈Ak (The Axiom of Countable Choice (ACω)).

[L6]

Limits of reals preserve non-strict inequalities, and a constant sequence converges to that constant (Limits preserve non-strict inequalities, Limits and Cauchy sequences of reals).

Proof

technique · direct
1.1L9

Nestedness propagates: for k≤l one has Fl⊆Fk, by induction on l from Fl+1⊆Fl and transitivity of inclusion.

1.2A1L4choose

Assume [A1] and let (Fk) be a Cantor chain. Every Fk is nonempty, so [L4] supplies a sequence (xk) with xk∈Fk for every k.

1.3L1L2L5

A preliminary about closures, used in claim 2: let A⊆X be nonempty and bounded, let u,v∈A‾ and let η>0 be real; then B(u,η) and B(v,η) meet A, so there are a,b∈A with d(u,a)<η and d(v,b)<η, whence d(u,v)≤d(u,a)+d(a,b)+d(b,v)<diam⁡(A)+2η.

1.4L1L5L6

If x,y∈⋂kFk then d(x,y)≤diam⁡(Fk) for every k by [L1]; the constant sequence with value d(x,y) converges to d(x,y) and diam⁡(Fk)→0, so d(x,y)≤0, and d(x,y)≥0 forces d(x,y)=0 and x=y.

1.5A2construct

For claim 2 assume [A2] and let (xk) be a Cauchy sequence in X; put Ak:={ xj:j≥k } and Fk:=Ak‾.

2.1step 1.3algebra

Since d(u,v)<diam⁡(A)+2η for every real η>0, we get d(u,v)≤diam⁡(A): were d(u,v)>diam⁡(A), the value η:=(d(u,v)−diam⁡(A))/3 would be positive and would give d(u,v)<diam⁡(A)/3+2d(u,v)/3<d(u,v).

2.2step 1.1step 1.2L1

Back to claim 1: for any K∈N and all m,n≥K we have xm∈Fm⊆FK and xn∈Fn⊆FK, so d(xm,xn)≤diam⁡(FK).

2.3step 1.5L2

Ak+1⊆Ak, and Ak‾ is a closed superset of Ak+1, so Fk+1⊆Fk by minimality of the closure.

3.1step 2.1L1L2

Hence diam⁡(A) is an upper bound of {d(u,v):u,v∈A‾}; fixing u∈A‾, which exists since A≠∅ and A⊆A‾, gives A‾⊆B(u,diam⁡(A)+1), so A‾ is nonempty and bounded and diam⁡(A‾)≤diam⁡(A). And {d(a,b):a,b∈A}⊆{d(u,v):u,v∈A‾} gives diam⁡(A)≤diam⁡(A‾), so the two diameters are equal.

3.2step 2.2A1L6L7

Given a real ε>0, the convergence diam⁡(Fk)→0 supplies K with diam⁡(FK)<ε, so d(xm,xn)<ε for all m,n≥K; hence (xk) is Cauchy, and by [A1] it converges to some x∈X.

4.1step 1.1step 3.2L3L7

Fix K∈N. For every k≥K we have xk∈Fk⊆FK, and the tail (xK+j)j∈N converges to x because (xk) does; since FK is closed it is sequentially closed, so x∈FK. As K was arbitrary, x∈⋂kFk.

4.2step 3.1step 1.5L2L8

Each Ak is nonempty and is contained in the bounded range of (xk), hence bounded; so each Fk is nonempty, closed and, by step 3.1, bounded with diam⁡(Fk)=diam⁡(Ak).

5.1step 4.1step 1.4

Claim 1 is established: the intersection contains x by step 4.1 and no second point by step 1.4.

5.2step 4.2step 2.3L1L5L7

Given a real ε>0, Cauchyness supplies K with d(xm,xn)<ε/2 for all m,n≥K; then ε/2 is an upper bound of {d(a,b):a,b∈Ak} for every k≥K, so 0≤diam⁡(Ak)≤ε/2<ε for k≥K. Hence diam⁡(Fk)→0 and (Fk) is a Cantor chain.

6.1step 5.2A2L2L5

By [A2] there is x∈⋂kFk. Given a real ε>0, take K as in step 5.2 for ε; since x∈FK=AK‾, the ball B(x,ε/2) meets AK, so there is j≥K with d(x,xj)<ε/2, and then for every k≥K we get d(x,xk)≤d(x,xj)+d(xj,xk)<ε/2+ε/2=ε.

7.1step 5.1step 6.1L7∎

So xk→x with x∈X, every Cauchy sequence in X converges, and (X,d) is complete; this is claim 2, and claim 1 is step 5.1.

Remarks

  • The diameter hypothesis cannot be dropped, and neither can it be weakened to "the diameters are bounded". On N with a metric taking values just above 1 the tails {n,n+1,… } are nested, closed, bounded and complete with empty intersection (On N with d(m,n)=1+1/(m+n) for m≠n the sets {n,n+1,… } are nested, closed, bounded and complete with empty intersection ↗); what fails there is exactly diam⁡(Fk)→0.
  • Why the equality diam⁡(A‾)=diam⁡(A) is proved and not assumed. Claim 2 builds its Cantor chain out of the tails of a Cauchy sequence, which are almost never closed, so it must close them; and closing a set could in principle enlarge its diameter. Steps 1.3, 2.1 and 3.1 are the proof that it cannot, and they are the only place in this item where the definition of the closure by adherent points is used at full strength.
  • Where choice enters. Only at step 1.2, which picks one point from each Fk; that is ACω (The Axiom of Countable Choice (ACω)). Claim 2 is choice free apart from what A point lies in the closure of A iff some sequence in A converges to it, and a set is closed iff it is sequentially closed is not asked to supply here: step 6.1 uses the definition of the closure directly rather than a sequence extracted from it.
  • Relation to the nested interval property. For X=R and Fk=[ak,bk] this is the nested interval property with the extra hypothesis that the lengths tend to 0, which is what buys uniqueness of the common point. The general statement replaces "interval" by "closed set" and "length" by "diameter", and completeness is what replaces the least-upper-bound property.

Depends on

Dependency tree · 2 levels

Sources