Alphabeta Math
Pipeline-generated
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.

✓ 4 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Coxeter Polyhedral Gluings and Intrinsic Metrics

1 · Prerequisites

2 · Summary

This page builds the metric foundation of the Davis-complex tower: from an abstract gluing of compact convex polyhedral cells it produces a genuine intrinsic metric, compares that metric with the weak cell topology, and proves properness, completeness and the existence of minimizing geodesics. The companion coxeter-polyhedral-gluings-and-intrinsic-metrics-examples checks the construction on a hexagonal A2 cell, on an interval-realized tree and on a shrinking-edge ray.

The definition Abstract isometric polyhedral gluings and the chain metric fixes the data: a shape poset whose principal down-sets are face posets of compact convex polyhedral cells, cells with affine face isometries satisfying the cocycle and intersection conditions, the quotient space with its weak topology, chains that step inside single cells, and the chain metric candidate d as the infimum of chain lengths. The standing hypotheses are connectedness (H1), local finiteness (H2) and finitely many isometry classes of cells (H3), declared before any metric claim. The definition asserts only that d is symmetric and satisfies the triangle inequality, and it records explicitly that d need not restrict to the Euclidean metric of a single cell: a chain may leave a cell and return with smaller total length.

The star lemma Face coherence, global hat coordinates and a uniform star radius triangulates the finitely many model cells compatibly by barycentric subdivisions, reads the triangulation as the order complex of the face poset, and produces global hat coordinates λv with one uniform Lipschitz constant L computed from the finitely many model simplices. The barycentric coordinates of a point sum to 1 over at most D+1 carrier vertices, so some λv is at least 1/(D+1) there, and every ball of radius δ=1/(2L(D+1)) lies in the open star of a vertex; closed stars are finite compact cell unions. This is the uniform star-cover radius the later arguments consume, and it is derived from coordinates rather than from any point-to-face distance bound.

The theorem The chain metric is a metric, its topology is the weak topology, and the space is proper and complete then proves that under (H1)-(H3) the chain metric is a metric inducing the weak topology, that every closed bounded subset is compact, and that the space is complete; no bound on the number of cells at a vertex is needed beyond local finiteness. The example A locally finite shrinking-edge ray is not complete shows that the finite-shapes hypothesis cannot be dropped: intervals of lengths 2−n glued end to end form a connected locally finite gluing isometric to the half-open interval [0,2), which is incomplete. Two further results complete the page: the arbitrary-metric length lemma Length in a metric target: lower semicontinuity and arc-length reparametrization (lower semicontinuity under uniform convergence, arc-length reparametrization and equicontinuity of bounded arc-length families), and, under the Axiom of Choice, the geodesic theorem Under the Axiom of Choice, proper polyhedral spaces admit minimizing geodesics, which applies the proper-target Ascoli theorem to near-minimizing chain parametrizations and extracts a minimizing geodesic. The Axiom of Choice supplies the countable selection of near-minimizing chains and realizing paths, as well as the Ascoli subsequence theorem, and is declared in the geodesic statement.

The construction here is the metric half of the Davis cellulation: the cells are the Coxeter cells of the finite parabolics and the gluings are the face identifications of the Davis complex. Applying these results requires checking (H1)-(H3) for that cellulation; under those hypotheses they supply its intrinsic metric, topology and properness, and under the declared Choice assumption they also supply the geodesics used by the later CAT(0) and Moussong arguments. The companion page records the comparisons between the intrinsic metric and the discrete metrics on the 1-skeleton.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Abstract isometric polyhedral gluings and the chain metric

Definition

Shape and face posets. Let (P,≤) be a poset (Partial order and partially ordered set) with least element ∅ such that:

(a) for every p∈P the principal down-set P≤p:={r∈P:r≤p} is finite and, when p≠∅, is isomorphic as a poset to the face poset of a nonempty compact convex polyhedral cell (Finite convex cell complex and linear subdivision, Face poset and order complex);

(b) every two elements p,q∈P have a greatest lower bound p∧q in P, that is, an element of P that is a lower bound of both and is larger than every such lower bound.

The elements of P are called faces, p≤q is read "p is a face of q", and ∅ is the empty face.

Isometric polyhedral gluing. An isometric polyhedral gluing of shape P consists of the following data.

(i) Cells and face isometries. For every p∈P∖{∅} a nonempty compact convex polyhedral cell Cp in a finite-dimensional Euclidean affine space, and for every pair p≤q of nonempty faces a nonempty face Fp,q of Cq together with an affine isometry hp,q from the affine span of Cp onto the affine span of Fp,q (Isometry, isometric embedding, and the subspace metric on a subset) which carries Cp onto Fp,q, subject to:

  • hp,p=id⁡Cp for every p;
  • the cocycle condition hq,r∘hp,q=hp,r whenever p≤q≤r;
  • for every q the assignment p↦Fp,q=hp,q(Cp) is an isomorphism of posets from P≤q∖{∅} onto the set of nonempty faces of Cq, ordered by inclusion.

(ii) Quotient and intersection condition. Let X be the quotient of the disjoint union ⨆p∈P∖{∅}Cp by the equivalence relation generated by x∼hp,q(x) for x∈Cp and p≤q, and let ιp ⁣:Cp→X denote the quotient map. The intersection condition is:

  • each ιp is injective; and
  • for all nonempty faces p,q one has ιp(Cp)∩ιq(Cq)=ιp∧q(Cp∧q), where the right-hand side denotes the empty subset of X when p∧q=∅.

(iii) Weak topology. A subset U⊆X is declared open if and only if U∩ιp(Cp) is relatively open in ιp(Cp) for every nonempty face p (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).

Standing hypotheses. (H1) Connectedness: X≠∅ and X is connected. (H2) Local finiteness: every point of X lies in ιp(Cp) for only finitely many p. (H3) Finite shapes: the cells Cp fall into only finitely many isometry classes. By (H1) at least one cell exists, so by (H3) the maximum D:=max⁡{dim⁡Cp:p∈P∖{∅}} of the dimensions of the cells is a well-defined natural number.

Chains and the chain metric candidate. Write dp for the Euclidean metric on the affine span of Cp. Let x,y∈X. A chain from x to y is a finite sequence x=x0,x1,…,xm=y of points of X such that for each i∈{1,…,m} some cell contains both xi−1 and xi; for m=0 the chain is the one-term sequence x. Its length is ℓ(x0,…,xm):=∑i=1mdpi(xi−1,xi), where for each i the face pi is any nonempty face with xi−1,xi∈ιpi(Cpi); this number does not depend on these choices. The chain metric candidate of the gluing is d(x,y):=inf⁡{ ℓ(x0,…,xm):x0,…,xm is a chain from x to y }. Because X is connected, every two points of X are joined by a chain (this and the independence of ℓ from the chosen faces are proved in The chain metric is a metric, its topology is the weak topology, and the space is proper and complete ↗), so the infimum is taken over a nonempty set of real numbers, and 0≤d(x,y)<∞. This finiteness follows from (H1) and the gluing data; it is not an additional hypothesis.

What is asserted, and what is not. For all x,y,z∈X one has d(x,x)=0 (the one-term chain), d(x,y)=d(y,x) (reverse a chain) and d(x,z)≤d(x,y)+d(y,z) (concatenate chains), and these three facts need no hypothesis beyond the definitions. No other metric axiom, no agreement of d with the weak topology, and no completeness, properness or geodesic property is asserted here: those are the conclusions of the theorems of this page, under (H1)–(H3).

Caveat on cell metrics. If x,y lie in a common cell then the one-step chain gives d(x,y)≤dp(x,y), but equality can fail, because a chain may leave the cell and return with smaller total length (Bridson–Haefliger I.7.6). Nothing above asserts that the chain metric restricts to the Euclidean metric of a cell, and no cell is assumed to be geodesic for d.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Face coherence, global hat coordinates and a uniform star radius

Statement

Let X be an isometric polyhedral gluing with standing hypotheses (H1)-(H3) of Abstract isometric polyhedral gluings and the chain metric, with chain metric candidate d, maximal dimension D and finite model list. Write P∗:=P∖{∅} and let K be the order complex (Face poset and order complex) of P∗: its vertices are the elements of P∗ and its simplices are the finite chains in P∗.

For every p∈P∗ let bp be the barycentre of Cp, that is, the average of its vertices, the vertices of a compact convex polyhedral cell being its 0-dimensional faces. Then:

(i) Compatible barycentric triangulation. Each bp is a point of the relative interior of Cp. The canonical map Φ ⁣:∣K∣→X that sends a vertex p to bp and a simplex, that is a chain F0<⋯<Fk in P∗, affinely onto the convex hull of bF0,…,bFk inside CFk is well defined, is a bijection onto X, and is a homeomorphism from the weak topology of ∣K∣ to the weak topology of X. Consequently every point of X lies in the relative interior of exactly one of these simplices, its carrier simplex, whose dimension is at most D.

(ii) Hat coordinates and a uniform Lipschitz constant. For every vertex v∈P∗ let λv ⁣:X→[0,1] assign to x the barycentric coordinate of its carrier simplex at v; equivalently λv(Φ(α))=α(v) for α∈∣K∣ (The geometric realization of an abstract simplicial complex). Then each λv is well defined, ∑vλv(x)=1 for every x∈X with only finitely many nonzero terms, each λv is affine on every simplex of K, and there is a real constant L<∞, depending only on the finite model list, with ∣λv(x)−λv(y)∣≤L d(x,y) for all x,y∈X and every v. Explicitly, one may take for L the maximum of 1 and of the finitely many slopes 1/h of the barycentric coordinate at a vertex of a positive-dimensional simplex of the barycentric subdivision of a model cell, where h>0 is the distance from that vertex to the affine hull of the opposite face of that simplex.

Coordinates on singleton simplices are constant and contribute slope 0; if every cell is a point, take L=1.

(iii) Uniform star radius and finite stars. For every x∈X there is a vertex v with λv(x)≥1/(D+1); for such a v the open ball B(x,δ) of radius δ:=1/(2L(D+1)) is contained in the open star of v (Subcomplexes, closures, stars, and links in a simplicial complex), transported to X along Φ. Every closed star is the image under Φ of the realization of a finite subcomplex of K, and it is compact and metrizable in the weak topology; the open stars cover X; and for every vertex v only finitely many vertices lie with v in a common cell.

Facts & Assumptions

Given: An isometric polyhedral gluing X with (H1)-(H3), shape poset P, cells Cp, face isometries hp,q, chain metric candidate d, maximal dimension D; the set P∗=P∖{∅} and the order complex K of P∗.

[F1]

A compact convex polyhedral cell is a nonempty bounded set in a finite-dimensional Euclidean affine space given by finitely many affine inequalities ℓi(x)≥0; its faces are the intersections with supporting hyperplanes, and equivalently every nonempty face arises by turning some of the defining inequalities into equalities, so a face of a cell is again such a cell and faces of faces are faces. Finite convex cell complex and linear subdivision

[F2]

Every nonempty bounded finite-inequality cell has finitely many faces and a relative interior point, and its proper faces cover its relative boundary. Intersections of finite linear complexes form a convex cell complex

[F3]

Every finite convex cell complex has a compatible finite simplicial triangulation: choose one relative interior point in each nonempty cell, triangulate the boundary in increasing dimension and cone from that point; the construction agrees on every common face and preserves each cell as a subpolyhedron. A triangulation is a finite linear simplicial complex, so its cells are geometric simplices with affinely independent vertices and distinct cells have disjoint relative interiors. Finite convex cell complexes admit compatible triangulations, Finite convex cell complex and linear subdivision

[F4]

For a finite abstract simplicial complex K the weak topology on ∣K∣ agrees with the Euclidean topology, and ∣K∣ is compact, metrizable and Hausdorff; a finite subcomplex of any complex includes into its realization as a closed embedding. Finite simplicial weak topology agrees with euclidean topology, A finite simplicial complex has a compact Hausdorff realization

[F5]

A point of ∣K∣ is a function α on the vertex set with finite support, values in [0,1] and total sum 1, whose support is a simplex (The geometric realization of an abstract simplicial complex); a subset of ∣K∣ is open exactly when its trace on every simplex is relatively open, and the simplices of the order complex are the finite chains in P∗ (Face poset and order complex, An abstract simplicial complex).

[F6]

The chain length of a chain is the sum of the Euclidean distances of its steps computed in any common cells, d is the infimum of chain lengths, (H1)-(H3) hold, and D is the maximum of the dimensions of the cells. Abstract isometric polyhedral gluings and the chain metric

[F7]

The closed star of a vertex v is the union of the closed simplices containing v, and the open star is the union of their relative interiors. Subcomplexes, closures, stars, and links in a simplicial complex

[F8]

A continuous real-valued function on a nonempty compact metric space attains its maximum. A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value

Proof

Given: An isometric polyhedral gluing X with (H1)-(H3), cells Cp, chain metric candidate d, and the order complex K of P∗.

1.1F1F2F8algebra

Every nonempty face p has finitely many vertices and at least one, and its barycentre bp lies in the relative interior of Cp. By [F2] the cell Cp has finitely many faces, and a 0-dimensional face is a singleton by [F1]. If dim⁡Cp=0 the cell is its own only face. If dim⁡Cp≥1, then not all defining inequalities of Cp are constant on its affine span, since otherwise Cp would be that whole affine space, which is unbounded in positive dimension, or empty; so some defining inequality ℓ is nonconstant on Cp and satisfies ℓ≥0 there. In orthonormal affine coordinates ℓ=c+∑i=1naixi satisfies ∣ℓ(x)−ℓ(y)∣≤(∑i∣ai∣)∥x−y∥2, so it is continuous. Its maximum M>0 is attained on the nonempty compact cell Cp by [F8], and the set G={x∈Cp:ℓ(x)=M} is a face of Cp by [F1], nonempty, bounded and closed, and of dimension strictly smaller than dim⁡Cp because it lies in the proper affine subspace {ℓ=M}∩aff⁡Cp. Iterating this construction strictly decreases the dimension, so it produces a 0-dimensional face, which is a face of Cp by [F1]. This gives the vertices, and their average bp is defined. If bp were not relatively interior, then by [F2] it would lie in a proper face G of Cp, cut out by some active defining inequalities by [F1], and since G is proper some active inequality ℓ is not identically zero on Cp; then ℓ≥0 on Cp and 0=ℓ(bp) is an average of nonnegative numbers, so ℓ vanishes at every vertex of Cp. But ℓ is nonconstant on Cp, so its maximum face {ℓ=max⁡Cpℓ} is a face of Cp on which ℓ>0, and by the previous paragraph that face contains a vertex of Cp, where ℓ would have to vanish: a contradiction. Hence bp∈relint⁡Cp.

2.1F1F3step 1.1

Fix p. The faces of Cp, together with the empty set, form a finite convex cell complex: by [F1] each face is again a cell, faces of faces are faces, and the intersection of two faces is a face of both because it is obtained by activating the union of their defining equalities. Applying [F3] to this complex with the relative interior points bF of [step 1.1] gives a compatible finite simplicial triangulation of Cp. By induction on dimension over the coning construction its simplices are exactly the convex hulls conv⁡(bF0,…,bFk) for strict chains F0>F1>⋯>Fk of nonempty faces of Cp, and two such simplices with the same top face meet in the simplex of the common subchain. Moreover the construction only uses the faces and their barycentres, so for r≤p the triangulations of Cp and of Cr agree on the common face hr,p(Cr), transported by the affine isometry hr,p.

3.1F5F6step 2.1

The family of all convex hulls conv⁡(bF0,…,bFk) over strict chains F0>⋯>Fk in P∗ is a well-defined family of subsets of X, the map Φ ⁣:∣K∣→X that is affine on each simplex of K with the corresponding vertex values is well defined, and it is a bijection. Each such hull lies in the cell CF0 and is computed there; if the same chain is regarded inside a larger cell the hull is unchanged because all its points lie in the face CF0 and that face is convex, so the subset of X is unambiguous. The images of the simplices of K are exactly the simplices of the triangulations of the cells of [step 2.1], so they cover X, and distinct ones have disjoint relative interiors: within one cell this is the triangulation property of [step 2.1]; and if x lies in the relative interior of simplices with top faces F and G, then x∈relint⁡F∩relint⁡G by the coning description of [step 2.1], while x∈CF∩CG=CF∧G by the intersection condition of [F6]; as CF∧G is a face of CF containing x and x is relatively interior in F, that face must be F itself, and likewise G⊆CF∧G, so F and G are faces of one cell with a common relative interior point and hence coincide by [F2]; then the two simplices are two cells of one triangulation with a common relative interior point and hence coincide. Therefore every point of X is in the relative interior of exactly one of the simplices, so Φ is bijective, and its carrier is unique.

3.2F3F5F6step 2.1

There is a real L with 1≤L<∞, depending only on the finite model list, such that for every simplex of K and every vertex v the function λv restricted to that simplex is L-Lipschitz for the Euclidean metric of its image. On a singleton simplex all coordinates are constant, with slope 0. On a positive-dimensional simplex of K with chain F0>⋯>Fk the function λv either vanishes identically, when v is not one of the Fi, or equals the barycentric coordinate at bv; its linear part has norm 1/h, where h>0 is the distance from bv to the affine hull of the remaining barycentres, because its gradient is perpendicular to that affine hull and the coordinate changes from 0 there to 1 over the perpendicular displacement of length h. Each such configuration is isometric to a configuration in a model cell, because the cells of X fall into finitely many isometry classes and the face isometries are affine and isometric, so the positive-dimensional model simplices supply only finitely many positive numbers h. Take L to be the maximum of 1 and their reciprocals; when no such simplex exists take L=1. This bounds every coordinate slope.

4.1F4F5step 3.1

The bijection Φ of [step 3.1] is a homeomorphism from the weak topology of ∣K∣ to the weak topology of X. A subset V⊆X is weakly open in X exactly when its trace on every closed cell is relatively open, and by [F4] applied to the finite triangulation of a cell this holds exactly when its trace on every simplex of the triangulation of every cell is relatively open. By [step 2.1] those simplices are the images under Φ of the simplices of K, affinely and hence homeomorphically, so this is exactly the condition that Φ−1(V) has relatively open trace on every simplex of K, which by [F5] is openness in ∣K∣. Hence Φ and Φ−1 carry open sets to open sets.

4.2F2F6step 3.1

Every point of X lies in the relative interior of exactly one simplex of K, its carrier, of dimension at most D. Uniqueness and existence are [step 3.1]. A simplex of K is a strict chain F0>⋯>Fk of nonempty faces; passing from Fi+1 to Fi is passing to a proper face, which by [F2] lies in a supporting hyperplane, so the dimensions strictly increase along the chain: k≤dim⁡F0≤D; the simplex therefore has k+1≤D+1 vertices and dimension at most D.

4.3F5step 3.1

Define λv(x):=α(v) where x=Φ(α), using the bijection of [step 3.1]. Each λv is well defined, takes values in [0,1] by [F5], is affine on every simplex of K because α↦α(v) is affine on each simplex and Φ is affine there, and satisfies ∑vλv(x)=1: the sum is over the support of the carrier of x, a finite set, with total 1 by [F5].

4.4step 3.2step 2.1

Let x,y lie in a common cell Cp, whose Euclidean metric is dp. Then ∣λv(x)−λv(y)∣≤L dp(x,y) for every v. The segment [x,y] lies in Cp by convexity, and it is covered by the finitely many simplices of the triangulation of Cp; its intersection with a simplex is convex, hence a point or a subsegment, and on each nondegenerate subsegment λv is L-Lipschitz by [step 3.2]. Summing over the finitely many subsegments gives ∣λv(x)−λv(y)∣≤L dp(x,y).

5.1F6step 4.4algebra

For all x,y∈X and every vertex v one has ∣λv(x)−λv(y)∣≤L d(x,y). Let x=x0,…,xm=y be a chain as in [F6]; each consecutive pair lies in a common cell, so [step 4.4] gives ∣λv(xi−1)−λv(xi)∣≤L dpi(xi−1,xi), and summing the at most m inequalities and using the triangle inequality for real numbers gives ∣λv(x)−λv(y)∣≤L ℓ(x0,…,xm). Taking the infimum over all chains from x to y gives the claim, since L>0.

6.1F7step 5.1step 4.2

Let x∈X with carrier simplex σ and let δ:=1/(2L(D+1))>0, which is legitimate because L≥1. By [step 4.2] the carrier has at most D+1 vertices and the coordinates (λv(x))v of the carrier are nonnegative and sum to 1 over them, so some vertex v of σ satisfies λv(x)≥1/(D+1). For every y∈X with d(x,y)<δ we get λv(y)≥λv(x)−L d(x,y)>1/(D+1)−1/(2(D+1))>0 by [step 5.1]; so the support of the carrier of y contains v, which means that y lies in the relative interior of a simplex containing v, that is, in the open star of v by [F7]. Hence B(x,δ) is contained in the open star of v.

7.1F4F6F7step 4.1step 4.4step 5.1∎

For every vertex v the closed star of v is compact and metrizable, and its open star is open and hence a neighbourhood of each of its own points. The closed star is Φ(∣S∣) where S is the subcomplex of K consisting of every simplex containing v together with all its faces: the simplices containing v are chains in P∗ containing v, and the elements of P∗ comparable with v are finitely many, because P≤v is finite by the shape condition of [F6] and the faces q≥v are finitely many by (H2) of [F6] (a cell Cq meets the relative interior of Cv exactly when v≤q). There are finitely many such chains, and each has finitely many faces, so S is a finite subcomplex, ∣S∣ is compact and metrizable by [F4], and its image under the homeomorphism of [step 4.1] is compact and metrizable. The open star is the union of the relative interiors of precisely the simplices containing v, not of all faces in S. Equivalently it is {x:λv(x)>0}, which is open: on each cell the coordinate is continuous by step 4.4, or for the chain metric it is Lipschitz by step 5.1. It is contained in the closed star and is a neighbourhood of each of its own points; and every x∈X lies in the relative interior of its carrier, which has at least one vertex, so the open stars cover X. Finally, if a vertex w lies in a common cell with v, then w≤q for some q≥v; there are finitely many such q as just shown and each P≤q is finite, so only finitely many such w exist.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

The chain metric is a metric, its topology is the weak topology, and the space is proper and complete

Statement

Let X be an isometric polyhedral gluing with standing hypotheses (H1)-(H3) of Abstract isometric polyhedral gluings and the chain metric, let d be its chain metric candidate, and let L and δ be the constants of Face coherence, global hat coordinates and a uniform star radius for this gluing. Then:

(1) Well-definedness and metric. The length of a chain does not depend on the cells chosen to measure its steps, every two points of X are joined by a chain, and d ⁣:X×X→[0,∞) is a metric on X: for all x,y,z∈X, d(x,x)=0, d(x,y)=d(y,x), d(x,y)>0 whenever x≠y, and d(x,z)≤d(x,y)+d(y,z) (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

(2) Topology. The metric topology of d (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) coincides with the weak topology of the gluing: a subset of X is open in the metric topology if and only if its trace on every closed cell is relatively open.

(3) Properness and completeness. Every closed d-bounded subset of X is compact (Open cover, subcover, compact metric space, and compact subset of a metric space); in particular (X,d) is complete (Complete metric space: every Cauchy sequence converges in the space) and every closed ball is compact. No bound on the number of cells meeting a vertex is needed beyond local finiteness.

Facts & Assumptions

Given: An isometric polyhedral gluing X with (H1)-(H3), its chain metric candidate d, and the constants L≥1 and δ=1/(2L(D+1))>0 of the star lemma.

[F1]

The gluing data: cells Cp with affine face isometries hp,q, the intersection condition, the weak topology, (H1)-(H3), the maximum dimension D; the chain metric candidate d is the infimum of lengths of chains, where a chain's length is the sum over its steps of the Euclidean distance in any cell containing the two consecutive points. Abstract isometric polyhedral gluings and the chain metric

[F2]

The order complex K of P∗ and the map Φ ⁣:∣K∣→X: Φ is a homeomorphism from the weak topology of ∣K∣ to the weak topology of X; every point of X lies in the relative interior of exactly one simplex of K; the hat coordinates λv satisfy ∑vλv=1, are affine on every simplex, and satisfy ∣λv(x)−λv(y)∣≤L d(x,y); for every x there is v with λv(x)≥1/(D+1) and B(x,δ) lies in the open star of v; every closed star is the image under Φ of the realization of a finite subcomplex of K, hence compact and metrizable; the open stars cover X; and each vertex has only finitely many vertices in a common cell with it. Face coherence, global hat coordinates and a uniform star radius

[F4]

A compact metric space is complete; a closed subset of a compact metric space is compact; a continuous bijection from a compact metric space onto a metric space has continuous inverse; a Cauchy sequence with a convergent subsequence converges to that subsequential limit. A compact metric space is complete and totally bounded, and neither implication uses any choice principle, A closed subset of a compact metric space is compact, A continuous bijection from a compact metric space onto a metric space carries open sets to open sets, so its inverse is continuous, A Cauchy sequence in a metric space with a convergent subsequence converges to that subsequence’s limit

[F5]

For a finite abstract simplicial complex the weak topology on its realization agrees with the Euclidean topology and the realization is a compact metric space; a finite subcomplex of any complex includes into its realization as a closed embedding with that topology. Finite simplicial weak topology agrees with euclidean topology

Proof

Given: The gluing X with (H1)-(H3), its chain metric candidate d, the constants L,δ, the order complex K and the map Φ.

1.1F1

The length of a chain is independent of the chosen cells and is finite, so d is a symmetric real-valued function with d(x,x)=0 and the triangle inequality. If xi,xi+1 lie in cells Cp and Cq, then by the intersection condition of [F1] both points lie in Cp∧q, and the affine face isometries identify the three cells on their common points, so the Euclidean distances computed in Cp and in Cq agree; hence every choice gives the same sum. For finiteness, fix x and let A be the set of points joined to x by a chain; if a cell Cp meets A, say in y, then any z∈Cp is joined to x by the given chain followed by a one-step chain, so Cp⊆A: thus the trace of A on every closed cell is either that cell or empty, and A is open and closed in the weak topology of [F1]; as X is connected, A=X. Therefore every two points are joined by a chain, each chain has finite length, and 0≤d(x,y)<∞ for all x,y. Reversing a chain shows d(x,y)=d(y,x), the one-term chain shows d(x,x)=0, and concatenating chains at y and passing to the infimum shows the triangle inequality.

1.2F2algebra

For every x0∈X and real r>0 the closed ball Bˉ(x0,r) is contained in a finite union of closed stars. Call two vertices v,w adjacent when they lie in a common cell; by [F2] each vertex has only finitely many adjacent vertices. Choose v0 with B(x0,δ)⊆st⁡(v0) and let Sr be the finite set of vertices reachable from v0 by a walk of at most K:=⌈2(r+1)/δ⌉ steps of the adjacency relation; then Bˉ(x0,r)⊆⋃v∈Srst⁡ˉ(v). Indeed, let z∈Bˉ(x0,r). If z=x0, it already lies in the starting star. Otherwise choose a chain x0=y0,…,ym=z of length 0<ℓ<r+1, delete consecutive repeated points, and traverse each remaining step at unit speed in its cell to obtain a map γ ⁣:[0,ℓ]→X with γ(0)=x0, γ(ℓ)=z and d(γ(s),γ(s′))≤∣s−s′∣, because the sub-chain between two parameter values has length at most the parameter difference. Put h:=δ/2 and let 0=s0<s1<⋯<sN=ℓ be the parameters obtained by steps of size h, the last gap being at most h; then N≤K. For each j choose a vertex vj with B(γ(sj),δ)⊆st⁡(vj), taking v0 for j=0. Since d(γ(sj),γ(sj+1))≤h<δ, the point γ(sj+1) lies both in B(γ(sj),δ)⊆st⁡(vj) and in B(γ(sj+1),δ)⊆st⁡(vj+1), so the two open stars meet and vj,vj+1 lie in a common cell, that is, they are adjacent. By induction vN∈Sr, and z=γ(sN) lies in st⁡(vN)⊆st⁡ˉ(vN).

2.1F2F3step 1.1

d is a metric: if d(x,y)=0 then x=y. Suppose d(x,y)=0. By the Lipschitz clause of [F2], ∣λv(x)−λv(y)∣≤L d(x,y)=0 for every vertex v, so λv(x)=λv(y) for all v. Since x and y correspond under the bijection Φ of [F2] to the functions λ(x),λ(y) on the vertex set (their values on the carrier), this gives Φ−1(x)=Φ−1(y) and hence x=y. With [step 1.1] this gives all the metric axioms of [F3].

2.2F1F3step 1.1

Every metric ball is weakly open: the metric topology is contained in the weak topology of [F1]. Fix x∈X and a cell Cp with its Euclidean metric dp. For u,v∈Cp the reverse triangle inequality gives ∣d(x,u)−d(x,v)∣≤d(u,v), and the one-step chain gives d(u,v)≤dp(u,v); hence d(x,⋅) is 1-Lipschitz, in particular continuous, on Cp. Therefore the trace of any open ball B(x,r) on Cp is relatively open, and as p was arbitrary each ball is weakly open.

3.1F2F3F4step 1.2step 2.2

Every closed bounded subset of X is compact. Let A⊆X be closed and bounded; if A=∅ this is [F3]. Otherwise A⊆B(x0,r)⊆Bˉ(x0,r) for some x0 and r>0. The ball Bˉ(x0,r) is closed, since y↦d(x0,y) is 1-Lipschitz and hence continuous, and by [step 1.2] it is contained in the union of the finitely many closed stars st⁡ˉ(v), v∈Sr; each of those is compact in the weak topology by [F2] and therefore compact for the metric subspace topology by step 2.2: any metric-open cover is also weakly open on the star and thus has a finite subcover. Their finite union is metric compact, since an open cover has a finite subcover on each of the finitely many stars, and Bˉ(x0,r), being a closed subset of that compact metric space, is compact by [F4]. Finally A, closed in X, is closed in the subspace Bˉ(x0,r) and therefore compact by [F4].

3.2F2F3F4F5step 2.2

The weak topology is contained in the metric topology. Let W⊆X be weakly open and let x∈W. By [F2] choose a vertex v with λv(x)≥1/(D+1) and B(x,δ) contained in the open star of v; the closed star Sˉ of v is the image under Φ of the realization ∣S∣ of a finite subcomplex S of K. The map Φ∣S ⁣:∣S∣→Sˉ is a continuous bijection from the compact metric space ∣S∣ of [F5] onto Sˉ with the weak topology, and the identity on Sˉ towards the metric subspace topology is continuous by [step 2.2], so the composite is a continuous bijection from a compact metric space onto a metric space; by [F4] the weak and metric topologies agree on Sˉ. Hence W∩Sˉ is open in the metric subspace Sˉ: there is ε>0 with B(x,ε)∩Sˉ⊆W. Taking ε′:=min⁡{ε,δ}>0 and using B(x,δ)⊆st⁡(v)⊆Sˉ we obtain B(x,ε′)=B(x,ε′)∩Sˉ⊆W. Therefore every weakly open set is metric open, and with [step 2.2] the two topologies coincide.

4.1F3F4step 3.1∎

Every closed ball is compact by [step 3.1], since a closed ball is closed and bounded. For completeness, let (xk) be a Cauchy sequence in X; by [F3] fix an index N with d(xm,xk)<1 for all m,k≥N. The finitely many terms x0,…,xN−1 have finite distances from xN, so there is a real ρ>0 with d(xk,xN)≤ρ for every k, and hence the sequence lies in the closed ball Bˉ(xN,ρ), which is compact by [step 3.1] and therefore complete by [F4]; being Cauchy in X and lying in this complete subspace, (xk) converges to a point of it, so (X,d) is complete.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Length in a metric target: lower semicontinuity and arc-length reparametrization

Statement

Let (X,d) be a metric space (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric) and let a<b be real numbers. A path in X is a map γ ⁣:[a,b]→X. A partition of [a,b] is a finite sequence a=t0<t1<⋯<tm=b; the polygonal sum of γ over that partition is ∑i=1md(γ(ti−1),γ(ti)), and the length of γ is the supremum L(γ):=sup⁡{ ∑i=1md(γ(ti−1),γ(ti)):a=t0<⋯<tm=b }∈[0,∞] For a singleton interval [u,u], its only partition is the one-term sequence u, its polygonal sum is the empty sum 0, and its path length is 0. For nondegenerate intervals the supremum is taken in the extended reals (The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined, Every subset of R‾ has a least upper bound and a greatest lower bound in R‾, agreeing with the real supremum and infimum on nonempty sets bounded in R, Upper bound, least upper bound, and strict upper bound); γ is rectifiable if L(γ)<∞. For [u,v]⊆[a,b] write γ∣[u,v] for the restriction of γ to [u,v], a path on [u,v], and L(γ∣[u,v]) for its length.

Chord bound and additivity at the initial point. For a≤u≤v≤b one has d(γ(u),γ(v))≤L(γ∣[u,v]), and for a≤v≤w≤b one has L(γ∣[a,w])=L(γ∣[a,v])+L(γ∣[v,w]); in particular s(t):=L(γ∣[a,t]) is nondecreasing on [a,b].

(i) Lower semicontinuity. If γk,γ ⁣:[a,b]→X are paths with sup⁡t∈[a,b]d(γk(t),γ(t))→0 (uniform convergence, Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on YX and on C(X,Y)), then L(γ)≤lim inf⁡k→∞L(γk), the limit inferior being taken in [0,∞] (Limit superior and limit inferior of a nonnegative extended-real sequence).

(ii) Arc-length parametrization. If γ is continuous (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form) and rectifiable, with L:=L(γ)<∞, then s(t):=L(γ∣[a,t]) defines a continuous nondecreasing surjection s ⁣:[a,b]→[0,L] with s(a)=0 and s(b)=L; there is a unique map γˉ ⁣:[0,L]→X with γ=γˉ∘s; and γˉ is 1-Lipschitz with L(γˉ∣[r,q])=q−r for all 0≤r≤q≤L. If L=0 then γ is constant, [0,L]={0}, and γˉ is that constant.

(iii) Equicontinuity of bounded arc-length families. Call a path γ ⁣:[a,b]→X arc-length parametrized when L(γ)<∞ and L(γ∣[s,t])=t−sb−a L(γ)for all a≤s≤t≤b. If M<∞ and the paths γk ⁣:[0,1]→X are arc-length parametrized with L(γk)≤M for every k, then each γk is M-Lipschitz and the family (γk) is equicontinuous and uniformly equicontinuous (Equicontinuity at a point, uniform equicontinuity, and pointwise boundedness of a family of maps between metric spaces).

(iv) Application to polyhedral gluings. If X carries the chain metric d of an isometric polyhedral gluing with hypotheses (H1)-(H3) (Abstract isometric polyhedral gluings and the chain metric), then d is a metric on X (The chain metric is a metric, its topology is the weak topology, and the space is proper and complete (1)), and clauses (i)-(iii) apply verbatim to paths in (X,d).

No compactness, completeness, convexity or local structure of X is used in (i)-(iii), and no Euclidean-target theorem on arc length is invoked: the statements are proved in the stated metric generality.

Facts & Assumptions

Given: A metric space (X,d), real numbers a<b, and paths γ,γk ⁣:[a,b]→X as in the Statement, together with the partition sums, the length L and the restrictions γ∣[u,v] defined there.

[F1]

As a metric space, (X,d) satisfies d(x,x)=0, d(x,y)=d(y,x) and d(x,z)≤d(x,y)+d(y,z) for all x,y,z∈X, and d(x,y)≥0. Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, Nonnegativity of a metric is a consequence of the other axioms, not an axiom

[F2]

Reverse triangle inequality: ∣d(x,z)−d(y,z)∣≤d(x,y) for all x,y,z∈X. The reverse triangle inequality ∣d(x,z)−d(y,z)∣≤d(x,y) in any metric space

[F3]

The extended real line R‾ is totally ordered, its order restricts to that of R, and every subset of R‾ has a least upper bound and a greatest lower bound in R‾; a least upper bound of a set is an upper bound of it lying below every upper bound, and a greatest lower bound is a lower bound lying above every lower bound. The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined, Every subset of R‾ has a least upper bound and a greatest lower bound in R‾, agreeing with the real supremum and infimum on nonempty sets bounded in R, Upper bound, least upper bound, and strict upper bound, Greatest lower bound (infimum)

[F4]

A sequence of maps into a metric space converges uniformly when one index serves every point of the domain: for every real ε>0 there is K with d(fk(x),f(x))<ε for every x and every k≥K. Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on YX and on C(X,Y)

[F5]

For a sequence (ak) in [0,+∞] the limit inferior is the supremum of the tail infima, lim inf⁡kak=sup⁡N∈Ninf⁡k≥Nak, all suprema and infima taken in R‾. Limit superior and limit inferior of a nonnegative extended-real sequence

[F6]

Real sequences: xk→x means that for every real ε>0 there is K with ∣xk−x∣<ε for all k≥K; a finite sum of convergent real sequences converges to the sum of the limits; and if xk≤yk from some index on, then lim⁡kxk≤lim⁡kyk whenever both limits exist. Limits and Cauchy sequences of reals, Algebra of limits: sums, scalar multiples, products and quotients, Limits preserve non-strict inequalities

[F7]

Archimedean property and translation: for every real ε>0 there is a natural number n≥1 with 1/n<ε, and x<y implies x+z<y+z for reals x,y,z. For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε, Order is preserved by adding a constant and by adding inequalities

[F8]

The real line is the complete ordered field: every nonempty set of reals that is bounded above has a real least upper bound. Every interval is connected, and a continuous real-valued map on a connected space assumes every value between any two of its values. Complete ordered field (least-upper-bound property), The connected subspaces of R with its usual topology are exactly the order-convex subsets, the published characterisation transported by the identification of the two descriptions of "open in R", A real-valued continuous map on a connected space has order-convex image, so it takes every value between any two of its values

[F9]

Metric continuity: γ is continuous at t when for every real ε>0 there is a real δ>0 with d(γ(t′),γ(t))<ε for every t′ with ∣t′−t∣<δ. Continuity of a map between metric spaces, at a point and globally, in the ε-δ form

[F10]

Uniform equicontinuity of a family of maps between metric spaces asks for one δ serving every member of the family and every pair of points within δ; uniform equicontinuity implies equicontinuity. Equicontinuity at a point, uniform equicontinuity, and pointwise boundedness of a family of maps between metric spaces

[F11]

For an isometric polyhedral gluing with hypotheses (H1)-(H3), the chain metric candidate is a metric on the gluing and its metric topology is the weak topology. Abstract isometric polyhedral gluings and the chain metric, The chain metric is a metric, its topology is the weak topology, and the space is proper and complete

Proof

Given: A metric space (X,d), real numbers a<b, a path γ ⁣:[a,b]→X and, where the clause says so, paths γk as in the Statement.

1.1F1F3F7

(Chord bound, additivity at the initial point, monotonicity.) For a≤u≤v≤b if u=v both the chord and the length are 0 by the singleton convention and [F1]; if u<v the sequence u,v is a partition of [u,v] with polygonal sum d(γ(u),γ(v)), so d(γ(u),γ(v))≤L(γ∣[u,v]) because L(γ∣[u,v]) is the least upper bound of all polygonal sums [F3]. For a≤v≤w≤b let first P be a partition of [a,w]; inserting v if it is absent gives a partition P′ of [a,w] whose polygonal sum is at least that of P by the triangle inequality [F1], and which is the union of a partition of [a,v] and a partition of [v,w]. Hence every polygonal sum of γ∣[a,w] is at most L(γ∣[a,v])+L(γ∣[v,w]), so L(γ∣[a,w])≤L(γ∣[a,v])+L(γ∣[v,w]) [F3]. Conversely, if both summands are finite, then for every real ε>0 there are partitions of [a,v] and of [v,w] with sums exceeding L(γ∣[a,v])−ε/2 and L(γ∣[v,w])−ε/2, and their union is a partition of [a,w], so L(γ∣[a,w])≥L(γ∣[a,v])+L(γ∣[v,w])−ε; as the real ε>0 is arbitrary, [F7] gives L(γ∣[a,w])≥L(γ∣[a,v])+L(γ∣[v,w]). If L(γ∣[a,v])=+∞, then every partition of [a,v] extends by w to a partition of [a,w] with sum no smaller, since the added chord is nonnegative, so L(γ∣[a,w])≥L(γ∣[a,v])=+∞ and the two sides agree; and if L(γ∣[a,v])<∞ while L(γ∣[v,w])=+∞, then for every real M there is a partition of [v,w] with sum exceeding M, and adjoining any fixed partition of [a,v] yields a partition of [a,w] with sum exceeding M, so L(γ∣[a,w])=+∞. The degenerate cases v=a or v=w follow directly from the singleton convention. This proves additivity, and monotonicity of s follows from s(w)=s(v)+L(γ∣[v,w])≥s(v) for v≤w because lengths are suprema of sums of nonnegative terms [F1, F3].

1.2F1F2F3F4F5F6F7

(Lower semicontinuity.) Suppose u∈R‾ is an upper bound of the tail infima ℓN:=inf⁡k≥NL(γk) of [F5]; I show u≥L(γ). Assume u<L(γ). Then u is a real number, because u=+∞ contradicts u<L(γ)≤+∞ and u=−∞ is impossible as all L(γk)≥0 forces every ℓN≥0 [F1, F3]. Since L(γ) is the least upper bound of the polygonal sums of γ [F3] and u<L(γ), some partition P of [a,b] has polygonal sum S(P)>u. By [F7] choose a natural number n≥1 with 1/n<S(P)−u. For each partition point ti, the convergence sup⁡td(γk(t),γ(t))→0 gives d(γk(ti),γ(ti))→0 [F4]; consequently Sk(P):=∑id(γk(ti−1),γk(ti)) converges to S(P) by [F2] and [F6]. So there is K with Sk(P)>S(P)−1/n>u for all k≥K. Since Sk(P)≤L(γk) by [F3], this gives ℓK=inf⁡k≥KL(γk)≥S(P)−1/n>u, contradicting that u is an upper bound of the ℓN. Hence every upper bound u of the tail infima satisfies u≥L(γ), and since the least such upper bound is lim inf⁡kL(γk) [F5], L(γ)≤lim inf⁡kL(γk).

2.1step 1.1

(The arclength function.) From now on assume that γ is continuous and that L:=L(γ)<∞; write s(t):=L(γ∣[a,t]). Then s(a)=0, s(b)=L, and s is nondecreasing by [step 1.1]; moreover s(w)−s(v)=L(γ∣[v,w]) for all a≤v≤w≤b, by additivity at the initial point [step 1.1].

2.2F1F10step 1.1

(Equicontinuity of bounded arc-length families.) Let γk ⁣:[0,1]→X be arc-length parametrized with L(γk)≤M<∞. For 0≤s≤t≤1 the chord bound [step 1.1] and the definition of arc-length parametrized give d(γk(s),γk(t))≤L(γk∣[s,t])=(t−s)L(γk)≤M(t−s), so every γk is M-Lipschitz. If M=0 then every γk is constant by separation [F1] and the family is uniformly equicontinuous with any δ>0. If M>0 and ε>0 is real, take δ:=ε/M>0; then d(γk(s),γk(t))≤M∣s−t∣<ε for all k and all s,t with ∣s−t∣<δ, so the family is uniformly equicontinuous, hence equicontinuous [F10].

3.1F1F2F3F9step 2.1

(s is continuous.) Fix t∈[a,b) and a real δ>0; put ε:=δ/2. Since L is the least upper bound of the polygonal sums, choose a partition P of [a,b] with polygonal sum S(P)>L−ε [F3], and insert t into P if absent (the sum only increases [F1]); write A and B for the sums of the parts of P on [a,t] and on [t,b], so that A+B=S(P), and let t+ be the successor of t in P when t<b. By continuity of γ at t [F9] choose η∈(0,t+−t] with d(γ(t),γ(t′))<ε for ∣t′−t∣<η; I claim s(t+h)−s(t)≤δ for every h∈(0,η). Let R be a partition of [t,t+h]; then the union of the parts of P on [a,t], of R, and of the part of P on [t+,b] is a partition of [a,b] whose polygonal sum is A+Sum(R)+d(γ(t+h),γ(t+))+(B−d(γ(t),γ(t+)))≤L, so Sum(R)≤L−S(P)+d(γ(t),γ(t+))−d(γ(t+h),γ(t+))≤L−S(P)+d(γ(t),γ(t+h))<ε+ε=2ε by the reverse triangle inequality [F2]. Taking the supremum over R gives s(t+h)−s(t)=L(γ∣[t,t+h])≤2ε=δ [step 2.1]. The same argument applied to partitions of [t−h,t] gives left-continuity at every t∈(a,b]; hence s is continuous.

4.1F8step 2.1step 3.1

(s is surjective.) The interval [a,b] is connected [F8] and s ⁣:[a,b]→R is continuous [step 3.1] with s(a)=0 and s(b)=L [step 2.1]; by the intermediate value theorem [F8], for every real r with 0≤r≤L there is t∈[a,b] with s(t)=r.

5.1F1step 1.1step 2.1step 4.1

(Factorisation through s.) If a≤u≤v≤b satisfy s(u)=s(v), then L(γ∣[u,v])=s(v)−s(u)=0 [step 2.1], so d(γ(u),γ(v))≤0 by the chord bound [step 1.1] and hence γ(u)=γ(v) by separation [F1]. Since s is surjective [step 4.1], there is therefore a well-defined and unique map γˉ ⁣:[0,L]→X with γ=γˉ∘s, namely γˉ(r):=γ(t) for any t with s(t)=r. If L=0 then s vanishes identically and the same argument with u=a, v=b shows that γ is constant; then [0,L]={0} and γˉ is that constant.

6.1F8step 1.1step 2.1step 3.1step 4.1step 5.1

(γˉ is 1-Lipschitz and has unit speed.) Given 0≤r≤q≤L, choose by [step 4.1] points u,v∈[a,b] with s(u)=r and s(v)=q, and relabel so that u≤v; then d(γˉ(r),γˉ(q))=d(γ(u),γ(v))≤L(γ∣[u,v])=s(v)−s(u)=q−r by the chord bound [step 1.1] and [step 2.1], so γˉ is 1-Lipschitz. If r=q, the singleton-interval convention gives L(γˉ∣[r,r])=0=q−r; hence assume r<q for the length identity. Define, for each real ρ with 0≤ρ≤L, the number uρ:=sup⁡{t∈[a,b]:s(t)≤ρ}, which exists by the least-upper-bound property [F8] and satisfies s(uρ)=ρ: indeed s(uρ)≤ρ because points of the set approach uρ from below and s is continuous [step 3.1], while if uρ<b then every t>uρ has s(t)>ρ and continuity gives s(uρ)≥ρ, and if uρ=b then s(uρ)=L≤ρ≤L. Also uρ≤uρ′ for ρ≤ρ′, and γˉ(ρ)=γ(uρ) [step 5.1]. Now let r=ρ0<⋯<ρN=q be a partition of [r,q]; its polygonal sum for γˉ is ∑id(γ(uρi−1),γ(uρi))≤∑iL(γ∣[uρi−1,uρi])=∑i(ρi−ρi−1)=q−r by the chord bound [step 1.1] and [step 2.1], so L(γˉ∣[r,q])≤q−r. Conversely let v0<⋯<vN be a partition of [ur,uq]; its polygonal sum for γ is ∑id(γˉ(s(vi−1)),γˉ(s(vi))), the points s(vi) form a nondecreasing sequence from r=s(v0) to q=s(vN), and after deleting repetitions this is a partition of [r,q] whose polygonal sum for γˉ is the same number; hence every polygonal sum of γ∣[ur,uq] is at most L(γˉ∣[r,q]), and q−r=L(γ∣[ur,uq])≤L(γˉ∣[r,q]) [step 2.1]. Therefore L(γˉ∣[r,q])=q−r.

7.1F11step 1.2step 2.2step 6.1∎

(Application.) Let X carry the chain metric d of an isometric polyhedral gluing with (H1)-(H3); by [F11] this d is a metric on X, so clauses (i)-(iii), whose statements and proofs mention only the metric space (X,d), hold verbatim for paths in (X,d); in particular the constants a<b are arbitrary reals and no hypothesis beyond the metric axioms was used.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck pendingaudited 2026-10-08Open item page →

Under the Axiom of Choice, proper polyhedral spaces admit minimizing geodesics

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X be an isometric polyhedral gluing with standing hypotheses (H1)-(H3) of Abstract isometric polyhedral gluings and the chain metric, so that (X,d) is a proper metric space by The chain metric is a metric, its topology is the weak topology, and the space is proper and complete. Then every pair x,y∈X is joined by a minimizing geodesic: there is a path γ ⁣:[0,d(x,y)]→X with γ(0)=x, γ(d(x,y))=y and d(γ(s),γ(t))=∣s−t∣ for all s,t (Geodesics and geodesic metric spaces); in particular (X,d) is a geodesic metric space. More precisely, every sequence of chains from x to y whose lengths tend to d(x,y) has a subsequence whose associated polygonal paths, each traversed at constant speed on the common domain [0,1], converge uniformly to a continuous path of length d(x,y) whose arc-length reparametrization is a minimizing geodesic from x to y. The case x=y is included: then d(x,y)=0 and the degenerate interval [0,0]={0} carries the geodesic γ(0)=x.

Facts & Assumptions

Given: An isometric polyhedral gluing X with (H1)-(H3), its chain metric candidate d, and points x,y∈X with R:=d(x,y); the Axiom of Choice is assumed.

[F1]

Chains and the chain metric: a chain from x to y is a finite sequence x=x0,…,xm=y such that each consecutive pair lies in a common cell; its length is the sum of the Euclidean distances of its steps computed in any common cells; d is the infimum of the lengths of chains from x to y, and these lengths form a nonempty set of reals. (Abstract isometric polyhedral gluings and the chain metric)

[F3]

In a metric space: d(γ(u),γ(v))≤L(γ∣[u,v]) (chord bound) and L(γ∣[a,w])=L(γ∣[a,v])+L(γ∣[v,w]) for paths, where L is the supremum of polygonal sums; L is lower semicontinuous under uniform convergence; and a continuous rectifiable path γ ⁣:[a,b]→X has a continuous nondecreasing surjective arclength function s ⁣:[a,b]→[0,L] with s(a)=0, s(b)=L, through which it factors uniquely as γ=γˉ∘s with γˉ 1-Lipschitz and L(γˉ∣[r,q])=q−r. (Length in a metric target: lower semicontinuity and arc-length reparametrization, Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric)

[F4]

Axiom of Choice (The Axiom of Choice): every family of nonempty sets has a choice function.

[F5]

Ascoli-Arzela for proper targets, under the Axiom of Choice: for a nonempty compact metric domain Z, a proper metric target Y and an equicontinuous sequence (fk) in C(Z,Y) that is pointwise bounded, some subsequence converges uniformly to a member of C(Z,Y). (Under the Axiom of Choice, a pointwise bounded equicontinuous sequence on a nonempty compact metric domain into a proper metric target has a uniformly convergent subsequence)

[F6]

Geodesic segments: a map γ ⁣:[0,ℓ]→X with γ(0)=x, γ(ℓ)=y and d(γ(s),γ(t))=∣s−t∣ for all s,t is a geodesic segment from x to y, and necessarily ℓ=d(x,y); (X,d) is geodesic when every two points are joined by one. (Geodesics and geodesic metric spaces)

[F7]

The infimum R=inf⁡S of a nonempty set S of reals is the greatest lower bound of S, so for every real ε>0 there is t∈S with t<R+ε. (Greatest lower bound (infimum))

[F10]

For a sequence (ak) in [0,∞], the limit inferior is the supremum of the tail infima: lim inf⁡kak=sup⁡Ninf⁡k≥Nak, so inf⁡k≥Nak≤lim inf⁡kak for every N; and for every real ε>0 there is a natural N≥1 with 1/N<ε. (Limit superior and limit inferior of a nonnegative extended-real sequence, For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε)

Proof

Given: The gluing X with (H1)-(H3), the metric d and its properties [F2], points x,y∈X and R=d(x,y).

1.1F1F3

(Realizing a chain by a path.) Every chain x=x0,…,xm=y of length ℓ is the vertex sequence of a path γ ⁣:[0,1]→X traversing straight segments of the cells at constant speed, with γ(0)=x, γ(1)=y, d(γ(s),γ(t))≤(t−s)ℓ for all s≤t, and L(γ)≤ℓ. Deleting one of each two consecutive equal points leaves a chain of the same length, so assume xi−1≠xi and put Li:=dpi(xi−1,xi)>0 and ℓ=L1+⋯+Lm>0; if ℓ=0 the reduced chain is the single point x=y and we take the constant path, for which all claims are immediate. For t∈[0,1] define γ(t) to be the point at fraction (t−Ti−1)/(Ti−Ti−1) of the straight segment from xi−1 to xi inside Cpi, where Ti:=(L1+⋯+Li)/ℓ; this is well defined because the segment lies in the convex cell Cpi [F1]. Given s≤t, the points γ(s), the vertices xi strictly between the parameters s and t, and γ(t) form a chain whose steps lie in the traversed cells and whose length is the total traversed Euclidean distance (t−s)ℓ, because the path moves at constant speed inside each cell; hence d(γ(s),γ(t))≤(t−s)ℓ by [F1]. Every polygonal sum of γ over a partition is therefore at most ℓ, so the supremum over partitions gives L(γ)≤ℓ [F3].

2.1F1F4F7step 1.1

(Near-minimizing paths.) By [F7], for each n≥1 there is a chain from x to y of length ℓn<R+1/n; apply [F4] to the countable family of nonempty sets of such chains, recording in each chain a common cell for each step (only finitely many choices per chain). This selects a sequence of chains and their realizing paths from step 1.1. Each selected chain yields a path γn ⁣:[0,1]→X with γn(0)=x, γn(1)=y, L(γn)≤ℓn<R+1/n and d(γn(s),γn(t))≤ℓn ∣t−s∣≤(R+1)∣t−s∣, the last inequality because 1/n≤1 and R≥0.

3.1F8step 2.1

(Equicontinuity and pointwise boundedness.) By step 2.1 each γn is (R+1)-Lipschitz, hence continuous, and the family (γn) is equicontinuous: for a real ε>0 the number δ:=ε/(R+1)>0 satisfies d(γn(s),γn(t))≤(R+1)∣s−t∣<ε for all n and all s,t with ∣s−t∣<δ. It is pointwise bounded: for every t∈[0,1], d(γn(t),x)=d(γn(t),γn(0))≤(R+1)t≤R+1, so {γn(t):n≥1}⊆Bˉ(x,R+1)⊆B(x,R+2) is bounded.

4.1F2F4F5F9step 3.1

(The Ascoli subsequence.) The interval [0,1] is a nonempty compact metric space [F9], the target X is a proper metric space [F2], and (γn) is an equicontinuous, pointwise bounded sequence of continuous maps by step 3.1, so the Ascoli-Arzela theorem [F5] — with its Choice hypothesis [F4] — gives a subsequence (γnk) converging uniformly to a continuous γ ⁣:[0,1]→X. Uniform convergence implies γ(0)=x and γ(1)=y, since γnk(0)=x and γnk(1)=y for every k.

5.1F3F10step 2.1step 4.1

(The limit has length R.) By lower semicontinuity [F3], L(γ)≤lim inf⁡kL(γnk). For every real ε>0, the strictly increasing positive indices nk tend to infinity (inductively nk≥k+1), so L(γnk)≤R+1/nk<R+ε for all sufficiently large k [step 2.1, F10]. Every tail, including those starting earlier, contains such a term; its infimum is therefore at most R+ε. Taking the supremum of all tail infima gives lim inf⁡kL(γnk)≤R+ε by [F10]. As this holds for every ε>0, that limit inferior is at most R, and hence L(γ)≤R. Conversely the two-point partition gives d(γ(0),γ(1))≤L(γ) [F3], that is R≤L(γ) by step 4.1. Therefore L(γ)=R<∞.

6.1F2F3F6step 4.1step 5.1

(The minimizing geodesic.) Since γ is continuous and rectifiable with L(γ)=R, clause (ii) of [F3] provides a continuous nondecreasing surjection s ⁣:[0,1]→[0,R] with s(0)=0, s(1)=R, a unique γˉ ⁣:[0,R]→X with γ=γˉ∘s, and L(γˉ∣[r,q])=q−r for all 0≤r≤q≤R; in particular γˉ(0)=γ(0)=x and γˉ(R)=γ(1)=y. Let 0≤r≤q≤R. The chord bound gives d(γˉ(r),γˉ(q))≤L(γˉ∣[r,q])=q−r, and the triangle inequality for d [F2] together with the chord bound on [0,r] and [q,R] gives R=d(x,y)≤d(x,γˉ(r))+d(γˉ(r),γˉ(q))+d(γˉ(q),y)≤r+d(γˉ(r),γˉ(q))+(R−q), so d(γˉ(r),γˉ(q))≥q−r. Hence d(γˉ(r),γˉ(q))=q−r for all r≤q, and γˉ is a geodesic segment from x to y in the sense of [F6]; as x,y were arbitrary, (X,d) is geodesic.

7.1F4F5F8F10step 1.1step 3.1step 5.1step 6.1∎

(The subsequence clause.) Let now (C(n)) be any sequence of chains from x to y with lengths ℓn→R, and choose realizing paths γn from step 1.1 using [F4] if common cells are not already specified; then L(γn)≤ℓn and d(γn(s),γn(t))≤ℓn∣t−s∣, and ℓn≤R+1 for all sufficiently large n, so each γn is M-Lipschitz with the common constant M:=1+sup⁡nℓn<∞ and the family is equicontinuous and pointwise bounded (all values lie in the bounded set Bˉ(x,M), since d(γn(t),x)≤ℓnt≤M). Ascoli's theorem [F5] gives a uniformly convergent subsequence, and its limit has the same endpoints. The proof of step 5.1 applies because L(γnk)≤ℓnk→R: every tail infimum is at most R+ε for every ε>0, so lower semicontinuity and the chord bound give limit length exactly R and whose arc-length reparametrization is, by step 6.1, a minimizing geodesic from x to y.

5 · Examples, counterexamples and false statements

None yet.

Sources