Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck pendingjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

A locally finite shrinking-edge ray is not complete

Statement refuted

"Every connected locally finite isometric polyhedral gluing whose cells are compact and convex, with no hypothesis on the number of isometry classes of cells, is complete for its chain metric."

The claim is false: the shrinking-edge ray constructed below has compact convex 1-cells, is connected and locally finite, yet its chain metric makes it isometric to the half-open interval [0,2) with the Euclidean metric, which is not complete. The dropped hypothesis is exactly the finite-shapes condition (H3) of The chain metric is a metric, its topology is the weak topology, and the space is proper and complete.

Facts & Assumptions

Given: The real line with its usual metric dR(x,y)=∣x−y∣; for each n∈N (with N containing 0, The natural numbers N (von Neumann)) a copy Cen of a closed interval of length 2−n and a one-point cell Cvn; the gluing data, weak topology and chain metric candidate d of Abstract isometric polyhedral gluings and the chain metric.

[F1]

An isometric polyhedral gluing of shape P consists of nonempty compact convex polyhedral cells Cp (p∈P∖{∅}), affine face isometries satisfying the cocycle and intersection conditions, the quotient X of the disjoint union of the cells, the weak topology, and the chain metric candidate: a chain is a finite sequence x=x0,…,xm=y with each consecutive pair in a common cell, its length is the sum of the Euclidean distances of its steps computed in any common cells, and d is the infimum of the chain lengths; the standing hypotheses are (H1) connectedness, (H2) local finiteness and (H3) finitely many isometry classes of cells. (Abstract isometric polyhedral gluings and the chain metric)

[F2]

Under (H1)-(H3) the chain metric candidate is a metric inducing the weak topology, and every closed bounded subset of X is compact; in particular (X,d) is complete (Open cover, subcover, compact metric space, and compact subset of a metric space, Complete metric space: every Cauchy sequence converges in the space). (The chain metric is a metric, its topology is the weak topology, and the space is proper and complete)

[F3]

A metric on a set satisfies d(x,y)=0 if and only if x=y, symmetry and the triangle inequality (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric); dR(x,y)=∣x−y∣ is a metric on R (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); the closed ball about x of radius r is the set of y with d(x,y)≤r (Open ball, closed ball and sphere in a metric space).

[F4]

A sequence (yk) in a metric space is Cauchy when for every real ε>0 there is N with d(ym,yk)<ε for all m,k≥N; it converges to y when for every real ε>0 there is N with d(yk,y)<ε for all k≥N; the space is complete when every Cauchy sequence converges. (Cauchy sequence in a metric space, Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R, Complete metric space: every Cauchy sequence converges in the space)

[F5]

A function f ⁣:X→Y between metric spaces is an isometry when it is bijective and dY(f(x),f(x′))=dX(x,x′) for all x,x′; two metric spaces are isometric when such an f exists (Isometry, isometric embedding, and the subspace metric on a subset).

[F6]

2−k→0: for every real ε>0 there is N with 2−k<ε for all k≥N (For ∣r∣<1 the sequence rk is null, and for ∣r∣>1 the sequence ∣r∣k diverges to +∞).

Counterexample

Put a0:=0 and an+1:=an+2−n for n∈N, so that Cen:=[an,an+1] is a closed interval of length 2−n and ak=2−21−k for k≥1; also put Cvn:={an}. Let P be the poset with elements ∅, the vn and the en and relations vn<en, vn+1<en; let all face isometries be the identity inclusions between these subsets of R; let X be the quotient of ⨆p≠∅Cp by the equivalence relation generated by them, with the weak topology; and let d be the chain metric candidate. This is the shrinking-edge ray.

1.1F1F6

The gluing axioms hold. Every principal down-set is finite, P≤vn={∅,vn} being the face poset of a point and P≤en={∅,vn,vn+1,en} that of the interval [an,an+1]; every two elements of P have a meet, namely vn∧vm=∅ for n≠m, vn∧em=vn when n∈{m,m+1} and ∅ otherwise, and en∧em=vn+1 when m=n+1, vn when m=n−1, and ∅ when ∣n−m∣≥2; also p∧p=p and p∧∅=∅. The face isometries are the identity inclusions, the cocycle condition is vacuous (among nonempty elements there are no strictly increasing chains of three, since every element strictly above a vertex is an edge and every edge is maximal), and p↦Fp,q is a poset isomorphism onto the nonempty faces of Cq for q=vn,en. Since ak=2−21−k for k≥1 by induction, the ak increase to 2 [F6], so ⋃nCen=[0,2); the map t↦[t] from [0,2) to X is therefore a bijection onto X, injective because the only identifications are the identifications of the vertex copy of ak with its incident edge endpoints (two edge copies for k≥1, one for k=0) and surjective because every point of a cell is such a real number t. Denote by φ ⁣:X→[0,2) the inverse and note φ(ιen(t))=t for t∈Cen and φ(ιvn(an))=an, where ιp is the quotient map. Each ιp is injective, and the images of Cp and Cq in X meet exactly in the image of Cp∧q: distinct cells of the family have disjoint interiors, and correspond under φ to intervals that meet only in the shared endpoints ak, which are the images of the cells Cvk, while for ∣n−m∣≥2 the images are disjoint and en∧em=∅. Hence X is an isometric polyhedral gluing of shape P, with 1-dimensional cells Cen and 0-dimensional cells Cvn.

2.1F8step 1.1

(H1) X is connected. For every p the map ιp is continuous, since the preimage of a weakly open U⊆X is U∩ιp(Cp), relatively open in ιp(Cp) by definition of the weak topology; so ιen(Cen) is connected, being a continuous image of the interval Cen [F8]. Consecutive images meet: ιen(Cen)∩ιen+1(Cen+1)={ιvn+1(an+1)}≠∅. By induction each YN:=⋃n≤Nιen(Cen) is connected, using [F8] with A=YN−1 and AN=ιeN(CeN); and X=Y0∪⋃N≥1YN is connected by [F8] with A=Y0, since Y0∩YN=Y0≠∅ for every N and X=⋃nιen(Cen).

2.2F1F5step 1.1

(H2) X is locally finite, and (H3) fails. By step 1.1, if φ(x)∉{a0,a1,a2,… } then x lies in exactly one cell image, namely the interior of the cell whose interval contains φ(x); if φ(x)=a0 then x lies in ιv0(Cv0) and ιe0(Ce0); and if φ(x)=ak with k≥1 then x lies exactly in ιvk(Cvk), ιek−1(Cek−1) and ιek(Cek). So every point lies in at most three cells. For the number of shapes, let f ⁣:Cen→Cem be an isometry; then 2−n=∣an+1−an∣=∣f(an+1)−f(an)∣≤2−m, and symmetrically 2−m≤2−n, so n=m [F5]; the cells Cen therefore have pairwise distinct isometry classes and there are infinitely many of them, while the vertex cells are all isometric to each other. Hence the gluing satisfies (H1) and (H2) but not (H3), and its cells are compact convex polyhedral cells.

2.3F1F3F5step 1.1

The chain metric is the coordinate difference: d(x,y)=∣φ(x)−φ(y)∣ for all x,y∈X, and φ is an isometry of (X,d) onto the metric subspace [0,2) of R. Every chain step lies in a common cell Cp, and on Cen and on Cvn the Euclidean metric is the restriction of ∣x−y∣, so the length of a chain x0,…,xm is ∑i∣φ(xi−1)−φ(xi)∣≥∣φ(x)−φ(y)∣ by the triangle inequality for the metric ∣⋅∣ [F3]. For the reverse inequality assume φ(x)<φ(y) and list x=x0,x1,…,xm=y by inserting, between x and y, all the points φ−1(ak) with φ(x)<ak<φ(y) in increasing coordinate order; there are finitely many because ak→2>φ(y), and consecutive terms of this sequence lie in a common cell (a point of Cen with the next vertex, consecutive vertices ak,ak+1 in Cek, the last vertex before y with y), and its length telescopes to φ(y)−φ(x). Interchanging x and y handles the opposite order, and the case x=y is the one-term chain. Taking the infimum gives d(x,y)=∣φ(x)−φ(y)∣, so d is real-valued, symmetric, vanishes only for x=y and satisfies the triangle inequality; hence d is a metric on X and φ is an isometry onto [0,2) [F3, F5, step 1.1].

3.1F3F4F6F7step 2.3

(X,d) is not complete. Let pk:=ιek(ak+1) be the far endpoint of Cek, with φ(pk)=ak+1=2−2−k. For m>k one has d(pk,pm)=∣2−k−2−m∣=2−k−2−m<2−k by step 2.3, so (pk) is Cauchy: given a real ε>0, choose N with 2−k<ε for all k≥N [F6]; then d(pk,pm)<2−k<ε for all m>k≥N [F4]. Suppose pk→p for some p∈X. The point p lies in some cell CeN and φ(p)≤aN+1=2−2−N; for every k>N we get d(p,pk)=φ(pk)−φ(p)≥(2−2−k)−(2−2−N)=2−N−2−k≥2−(N+1)>0 by step 2.3, so the sequence does not converge to p [F4]. As p was arbitrary, the Cauchy sequence (pk) has no limit and (X,d) is not complete [F4]. In particular, the closed ball Bˉ(p0,2) of radius 2 about p0 is all of X, because d(p0,x)=∣1−φ(x)∣≤1<2 for every x∈X; and X is not compact, since a compact metric space is complete [F7] whereas X is not.

4.1F2step 2.2step 3.1∎

Conclusion. The gluing satisfies (H1) by step 2.1 and (H2) by step 2.2, so by [F2] completeness would follow from (H3); step 2.2 shows that (H3) fails, namely that the cells fall into infinitely many isometry classes, and step 3.1 shows that the space is nevertheless incomplete. Hence the refuted statement is false, and the exact dropped hypothesis is finiteness of the number of isometry classes of the cells; the counterexample is also not proper, since for a proper space the closed bounded subset Bˉ(p0,2)=X would be compact [F2] while X is not compact. This is the shrinking-interval phenomenon of the Bridson-Haefliger chapter on metric cell complexes, and it explains why The chain metric is a metric, its topology is the weak topology, and the space is proper and complete assumes (H3) rather than local finiteness alone.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

95 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