Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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 00 meet in exactly one point, and this property characterises completeness

Statement

Let (X,d)(X,d) be a metric space (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric). Call a sequence (Fk)kN(F_k)_{k \in \mathbb{N}} of subsets of XX a Cantor chain if every FkF_k 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+1FkF_{k+1} \subseteq F_k for every kk, and diam(Fk)0\operatorname{diam}(F_k) \to 0 in R\mathbb{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)(X,d) is complete (Complete metric space: every Cauchy sequence converges in the space), every Cantor chain in XX has an intersection kNFk\bigcap_{k \in \mathbb{N}} F_k with exactly one element.
  2. Conversely, if every Cantor chain in XX has nonempty intersection, then (X,d)(X,d) is complete.

Boundedness of each FkF_k is part of the definition of a Cantor chain because diam\operatorname{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: A metric space (X,d)(X,d); a Cantor chain (Fk)(F_k) in XX; a real ε>0\varepsilon > 0.

[A1]

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

[A2]

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

[L1]

For nonempty bounded AXA \subseteq X, diam(A)=sup{d(a,b):a,bA}\operatorname{diam}(A) = \sup\{ d(a,b) : a,b \in A \}, so d(a,b)diam(A)d(a,b) \le \operatorname{diam}(A) for all a,bAa,b \in A, and diam(A)0\operatorname{diam}(A) \ge 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: xAx \in \overline{A} means B(x,r)AB(x,r) \cap A \ne \emptyset for every real r>0r > 0; AAA \subseteq \overline{A}; A\overline{A} is closed and is the smallest closed superset of AA, and AA is closed exactly when A=AA = \overline{A} (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, The closure of a nonempty AA is {x:d(x,A)=0}\{x : d(x,A) = 0\}, equals AA 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 XX has its limit in it (A point lies in the closure of AA iff some sequence in AA converges to it, and a set is closed iff it is sequentially closed).

[L4]

Countable choice: a family (Ak)kN(A_k)_{k \in \mathbb{N}} of nonempty sets admits kakk \mapsto a_k with akAka_k \in A_k (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)).

[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).

[L9]

Induction on N\mathbb{N} (The principle of mathematical induction).

Proof

technique · direct
1.1

Nestedness propagates: for klk \le l one has FlFkF_l \subseteq F_k, by induction on ll from Fl+1FlF_{l+1} \subseteq F_l and transitivity of inclusion.

L9
1.2

Assume [A1] and let (Fk)(F_k) be a Cantor chain. Every FkF_k is nonempty, so [L4] supplies a sequence (xk)(x_k) with xkFkx_k \in F_k for every kk.

A1L4choose
1.3

A preliminary about closures, used in claim 2: let AXA \subseteq X be nonempty and bounded, let u,vAu, v \in \overline{A} and let η>0\eta > 0 be real; then B(u,η)B(u,\eta) and B(v,η)B(v,\eta) meet AA, so there are a,bAa, b \in A with d(u,a)<ηd(u,a) < \eta and d(v,b)<ηd(v,b) < \eta, whence d(u,v)d(u,a)+d(a,b)+d(b,v)<diam(A)+2ηd(u,v) \le d(u,a) + d(a,b) + d(b,v) < \operatorname{diam}(A) + 2\eta.

L1L2L5
1.4

If x,ykFkx, y \in \bigcap_k F_k then d(x,y)diam(Fk)d(x,y) \le \operatorname{diam}(F_k) for every kk by [L1]; the constant sequence with value d(x,y)d(x,y) converges to d(x,y)d(x,y) and diam(Fk)0\operatorname{diam}(F_k) \to 0, so d(x,y)0d(x,y) \le 0, and d(x,y)0d(x,y) \ge 0 forces d(x,y)=0d(x,y) = 0 and x=yx = y.

L1L5L6
1.5

For claim 2 assume [A2] and let (xk)(x_k) be a Cauchy sequence in XX; put Ak:={xj:jk}A_k := \{\, x_j : j \ge k \,\} and Fk:=AkF_k := \overline{A_k}.

A2construct
2.1

Since d(u,v)<diam(A)+2ηd(u,v) < \operatorname{diam}(A) + 2\eta for every real η>0\eta > 0, we get d(u,v)diam(A)d(u,v) \le \operatorname{diam}(A): were d(u,v)>diam(A)d(u,v) > \operatorname{diam}(A), the value η:=(d(u,v)diam(A))/3\eta := (d(u,v) - \operatorname{diam}(A))/3 would be positive and would give d(u,v)<diam(A)/3+2d(u,v)/3<d(u,v)d(u,v) < \operatorname{diam}(A)/3 + 2d(u,v)/3 < d(u,v).

step 1.3algebra
2.2

Back to claim 1: for any KNK \in \mathbb{N} and all m,nKm, n \ge K we have xmFmFKx_m \in F_m \subseteq F_K and xnFnFKx_n \in F_n \subseteq F_K, so d(xm,xn)diam(FK)d(x_m,x_n) \le \operatorname{diam}(F_K).

step 1.1step 1.2L1
2.3

Ak+1AkA_{k+1} \subseteq A_k, and Ak\overline{A_k} is a closed superset of Ak+1A_{k+1}, so Fk+1FkF_{k+1} \subseteq F_k by minimality of the closure.

step 1.5L2
3.1

Hence diam(A)\operatorname{diam}(A) is an upper bound of {d(u,v):u,vA}\{ d(u,v) : u,v \in \overline{A} \}; fixing uAu \in \overline{A}, which exists since AA \ne \emptyset and AAA \subseteq \overline{A}, gives AB(u,diam(A)+1)\overline{A} \subseteq B(u, \operatorname{diam}(A) + 1), so A\overline{A} is nonempty and bounded and diam(A)diam(A)\operatorname{diam}(\overline{A}) \le \operatorname{diam}(A). And {d(a,b):a,bA}{d(u,v):u,vA}\{d(a,b) : a,b \in A\} \subseteq \{d(u,v) : u,v \in \overline{A}\} gives diam(A)diam(A)\operatorname{diam}(A) \le \operatorname{diam}(\overline{A}), so the two diameters are equal.

step 2.1L1L2
3.2

Given a real ε>0\varepsilon > 0, the convergence diam(Fk)0\operatorname{diam}(F_k) \to 0 supplies KK with diam(FK)<ε\operatorname{diam}(F_K) < \varepsilon, so d(xm,xn)<εd(x_m,x_n) < \varepsilon for all m,nKm,n \ge K; hence (xk)(x_k) is Cauchy, and by [A1] it converges to some xXx \in X.

step 2.2A1L6L7
4.1

Fix KNK \in \mathbb{N}. For every kKk \ge K we have xkFkFKx_k \in F_k \subseteq F_K, and the tail (xK+j)jN(x_{K+j})_{j \in \mathbb{N}} converges to xx because (xk)(x_k) does; since FKF_K is closed it is sequentially closed, so xFKx \in F_K. As KK was arbitrary, xkFkx \in \bigcap_k F_k.

step 1.1step 3.2L3L7
4.2

Each AkA_k is nonempty and is contained in the bounded range of (xk)(x_k), hence bounded; so each FkF_k is nonempty, closed and, by step 3.1, bounded with diam(Fk)=diam(Ak)\operatorname{diam}(F_k) = \operatorname{diam}(A_k).

step 3.1step 1.5L2L8
5.1

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

step 4.1step 1.4
5.2

Given a real ε>0\varepsilon > 0, Cauchyness supplies KK with d(xm,xn)<ε/2d(x_m,x_n) < \varepsilon/2 for all m,nKm,n \ge K; then ε/2\varepsilon/2 is an upper bound of {d(a,b):a,bAk}\{d(a,b) : a,b \in A_k\} for every kKk \ge K, so 0diam(Ak)ε/2<ε0 \le \operatorname{diam}(A_k) \le \varepsilon/2 < \varepsilon for kKk \ge K. Hence diam(Fk)0\operatorname{diam}(F_k) \to 0 and (Fk)(F_k) is a Cantor chain.

step 4.2step 2.3L1L5L7
6.1

By [A2] there is xkFkx \in \bigcap_k F_k. Given a real ε>0\varepsilon > 0, take KK as in step 5.2 for ε\varepsilon; since xFK=AKx \in F_K = \overline{A_K}, the ball B(x,ε/2)B(x,\varepsilon/2) meets AKA_K, so there is jKj \ge K with d(x,xj)<ε/2d(x,x_j) < \varepsilon/2, and then for every kKk \ge K we get d(x,xk)d(x,xj)+d(xj,xk)<ε/2+ε/2=εd(x,x_k) \le d(x,x_j) + d(x_j,x_k) < \varepsilon/2 + \varepsilon/2 = \varepsilon.

step 5.2A2L2L5
7.1

So xkxx_k \to x with xXx \in X, every Cauchy sequence in XX converges, and (X,d)(X,d) is complete; this is claim 2, and claim 1 is step 5.1.

step 5.1step 6.1L7

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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