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.
Coxeter Polyhedral Gluings and Intrinsic Metrics
1 · Prerequisites
- Cayley Graphs, Word Metrics and Quasi-Isometry
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Countability and Uncountability
- Filters and Ultrafilters
- Foundations of the Real Numbers for Analysis
- Function Space Topologies and the Exponential Law
- limsup, liminf, and Subsequential Limits
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simplicial Complexes and Simplicial Homology
- Simplicial Subdivision and Simplicial Approximation
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Ascoli–Arzelà Theorem
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
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 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 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 is symmetric and satisfies the triangle inequality, and it records explicitly that 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 with one uniform Lipschitz constant computed from the finitely many model simplices. The barycentric coordinates of a point sum to over at most carrier vertices, so some is at least there, and every ball of radius 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 glued end to end form a connected locally finite gluing isometric to the half-open interval , 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 -skeleton.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Abstract isometric polyhedral gluings and the chain metric
Definition
Shape and face posets. Let be a poset (Partial order and partially ordered set) with least element such that:
(a) for every the principal down-set is finite and, when , 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 have a greatest lower bound in , that is, an element of that is a lower bound of both and is larger than every such lower bound.
The elements of are called faces, is read " is a face of ", and is the empty face.
Isometric polyhedral gluing. An isometric polyhedral gluing of shape consists of the following data.
(i) Cells and face isometries. For every a nonempty compact convex polyhedral cell in a finite-dimensional Euclidean affine space, and for every pair of nonempty faces a nonempty face of together with an affine isometry from the affine span of onto the affine span of (Isometry, isometric embedding, and the subspace metric on a subset) which carries onto , subject to:
- for every ;
- the cocycle condition whenever ;
- for every the assignment is an isomorphism of posets from onto the set of nonempty faces of , ordered by inclusion.
(ii) Quotient and intersection condition. Let be the quotient of the disjoint union by the equivalence relation generated by for and , and let denote the quotient map. The intersection condition is:
- each is injective; and
- for all nonempty faces one has , where the right-hand side denotes the empty subset of when .
(iii) Weak topology. A subset is declared open if and only if is relatively open in for every nonempty face (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: and is connected. (H2) Local finiteness: every point of lies in for only finitely many . (H3) Finite shapes: the cells fall into only finitely many isometry classes. By (H1) at least one cell exists, so by (H3) the maximum of the dimensions of the cells is a well-defined natural number.
Chains and the chain metric candidate. Write for the Euclidean metric on the affine span of . Let . A chain from to is a finite sequence of points of such that for each some cell contains both and ; for the chain is the one-term sequence . Its length is where for each the face is any nonempty face with ; this number does not depend on these choices. The chain metric candidate of the gluing is Because is connected, every two points of 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 . This finiteness follows from (H1) and the gluing data; it is not an additional hypothesis.
What is asserted, and what is not. For all one has (the one-term chain), (reverse a chain) and (concatenate chains), and these three facts need no hypothesis beyond the definitions. No other metric axiom, no agreement of 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 lie in a common cell then the one-step chain gives , 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 .
Face coherence, global hat coordinates and a uniform star radius
Statement
Let be an isometric polyhedral gluing with standing hypotheses (H1)-(H3) of Abstract isometric polyhedral gluings and the chain metric, with chain metric candidate , maximal dimension and finite model list. Write and let be the order complex (Face poset and order complex) of : its vertices are the elements of and its simplices are the finite chains in .
For every let be the barycentre of , that is, the average of its vertices, the vertices of a compact convex polyhedral cell being its -dimensional faces. Then:
(i) Compatible barycentric triangulation. Each is a point of the relative interior of . The canonical map that sends a vertex to and a simplex, that is a chain in , affinely onto the convex hull of inside is well defined, is a bijection onto , and is a homeomorphism from the weak topology of to the weak topology of . Consequently every point of lies in the relative interior of exactly one of these simplices, its carrier simplex, whose dimension is at most .
(ii) Hat coordinates and a uniform Lipschitz constant. For every vertex let assign to the barycentric coordinate of its carrier simplex at ; equivalently for (The geometric realization of an abstract simplicial complex). Then each is well defined, for every with only finitely many nonzero terms, each is affine on every simplex of , and there is a real constant , depending only on the finite model list, with for all and every . Explicitly, one may take for the maximum of and of the finitely many slopes of the barycentric coordinate at a vertex of a positive-dimensional simplex of the barycentric subdivision of a model cell, where 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 ; if every cell is a point, take .
(iii) Uniform star radius and finite stars. For every there is a vertex with ; for such a the open ball of radius is contained in the open star of (Subcomplexes, closures, stars, and links in a simplicial complex), transported to along . Every closed star is the image under of the realization of a finite subcomplex of , and it is compact and metrizable in the weak topology; the open stars cover ; and for every vertex only finitely many vertices lie with in a common cell.
Facts & Assumptions
Given: An isometric polyhedral gluing with (H1)-(H3), shape poset , cells , face isometries , chain metric candidate , maximal dimension ; the set and the order complex of .
A compact convex polyhedral cell is a nonempty bounded set in a finite-dimensional Euclidean affine space given by finitely many affine inequalities ; 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
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
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
For a finite abstract simplicial complex the weak topology on agrees with the Euclidean topology, and 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
A point of is a function on the vertex set with finite support, values in and total sum , whose support is a simplex (The geometric realization of an abstract simplicial complex); a subset of is open exactly when its trace on every simplex is relatively open, and the simplices of the order complex are the finite chains in (Face poset and order complex, An abstract simplicial complex).
The chain length of a chain is the sum of the Euclidean distances of its steps computed in any common cells, is the infimum of chain lengths, (H1)-(H3) hold, and is the maximum of the dimensions of the cells. Abstract isometric polyhedral gluings and the chain metric
The closed star of a vertex is the union of the closed simplices containing , and the open star is the union of their relative interiors. Subcomplexes, closures, stars, and links in a simplicial complex
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 with (H1)-(H3), cells , chain metric candidate , and the order complex of .
Every nonempty face has finitely many vertices and at least one, and its barycentre lies in the relative interior of . By [F2] the cell has finitely many faces, and a -dimensional face is a singleton by [F1]. If the cell is its own only face. If , then not all defining inequalities of are constant on its affine span, since otherwise would be that whole affine space, which is unbounded in positive dimension, or empty; so some defining inequality is nonconstant on and satisfies there. In orthonormal affine coordinates satisfies , so it is continuous. Its maximum is attained on the nonempty compact cell by [F8], and the set is a face of by [F1], nonempty, bounded and closed, and of dimension strictly smaller than because it lies in the proper affine subspace . Iterating this construction strictly decreases the dimension, so it produces a -dimensional face, which is a face of by [F1]. This gives the vertices, and their average is defined. If were not relatively interior, then by [F2] it would lie in a proper face of , cut out by some active defining inequalities by [F1], and since is proper some active inequality is not identically zero on ; then on and is an average of nonnegative numbers, so vanishes at every vertex of . But is nonconstant on , so its maximum face is a face of on which , and by the previous paragraph that face contains a vertex of , where would have to vanish: a contradiction. Hence .
Fix . The faces of , 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 of [step 1.1] gives a compatible finite simplicial triangulation of . By induction on dimension over the coning construction its simplices are exactly the convex hulls for strict chains of nonempty faces of , 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 the triangulations of and of agree on the common face , transported by the affine isometry .
The family of all convex hulls over strict chains in is a well-defined family of subsets of , the map that is affine on each simplex of with the corresponding vertex values is well defined, and it is a bijection. Each such hull lies in the cell 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 and that face is convex, so the subset of is unambiguous. The images of the simplices of are exactly the simplices of the triangulations of the cells of [step 2.1], so they cover , and distinct ones have disjoint relative interiors: within one cell this is the triangulation property of [step 2.1]; and if lies in the relative interior of simplices with top faces and , then by the coning description of [step 2.1], while by the intersection condition of [F6]; as is a face of containing and is relatively interior in , that face must be itself, and likewise , so and 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 is in the relative interior of exactly one of the simplices, so is bijective, and its carrier is unique.
There is a real with , depending only on the finite model list, such that for every simplex of and every vertex the function restricted to that simplex is -Lipschitz for the Euclidean metric of its image. On a singleton simplex all coordinates are constant, with slope . On a positive-dimensional simplex of with chain the function either vanishes identically, when is not one of the , or equals the barycentric coordinate at ; its linear part has norm , where is the distance from to the affine hull of the remaining barycentres, because its gradient is perpendicular to that affine hull and the coordinate changes from there to over the perpendicular displacement of length . Each such configuration is isometric to a configuration in a model cell, because the cells of 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 . Take to be the maximum of and their reciprocals; when no such simplex exists take . This bounds every coordinate slope.
The bijection of [step 3.1] is a homeomorphism from the weak topology of to the weak topology of . A subset is weakly open in 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 , affinely and hence homeomorphically, so this is exactly the condition that has relatively open trace on every simplex of , which by [F5] is openness in . Hence and carry open sets to open sets.
Every point of lies in the relative interior of exactly one simplex of , its carrier, of dimension at most . Uniqueness and existence are [step 3.1]. A simplex of is a strict chain of nonempty faces; passing from to is passing to a proper face, which by [F2] lies in a supporting hyperplane, so the dimensions strictly increase along the chain: ; the simplex therefore has vertices and dimension at most .
Define where , using the bijection of [step 3.1]. Each is well defined, takes values in by [F5], is affine on every simplex of because is affine on each simplex and is affine there, and satisfies : the sum is over the support of the carrier of , a finite set, with total by [F5].
Let lie in a common cell , whose Euclidean metric is . Then for every . The segment lies in by convexity, and it is covered by the finitely many simplices of the triangulation of ; its intersection with a simplex is convex, hence a point or a subsegment, and on each nondegenerate subsegment is -Lipschitz by [step 3.2]. Summing over the finitely many subsegments gives .
For all and every vertex one has . Let be a chain as in [F6]; each consecutive pair lies in a common cell, so [step 4.4] gives , and summing the at most inequalities and using the triangle inequality for real numbers gives . Taking the infimum over all chains from to gives the claim, since .
Let with carrier simplex and let , which is legitimate because . By [step 4.2] the carrier has at most vertices and the coordinates of the carrier are nonnegative and sum to over them, so some vertex of satisfies . For every with we get by [step 5.1]; so the support of the carrier of contains , which means that lies in the relative interior of a simplex containing , that is, in the open star of by [F7]. Hence is contained in the open star of .
For every vertex the closed star of is compact and metrizable, and its open star is open and hence a neighbourhood of each of its own points. The closed star is where is the subcomplex of consisting of every simplex containing together with all its faces: the simplices containing are chains in containing , and the elements of comparable with are finitely many, because is finite by the shape condition of [F6] and the faces are finitely many by (H2) of [F6] (a cell meets the relative interior of exactly when ). There are finitely many such chains, and each has finitely many faces, so is a finite subcomplex, 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 , not of all faces in . Equivalently it is , 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 lies in the relative interior of its carrier, which has at least one vertex, so the open stars cover . Finally, if a vertex lies in a common cell with , then for some ; there are finitely many such as just shown and each is finite, so only finitely many such exist.
The chain metric is a metric, its topology is the weak topology, and the space is proper and complete
Statement
Let be an isometric polyhedral gluing with standing hypotheses (H1)-(H3) of Abstract isometric polyhedral gluings and the chain metric, let be its chain metric candidate, and let 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 are joined by a chain, and is a metric on : for all , , , whenever , and (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
(2) Topology. The metric topology of (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 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 -bounded subset of is compact (Open cover, subcover, compact metric space, and compact subset of a metric space); in particular 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 with (H1)-(H3), its chain metric candidate , and the constants and of the star lemma.
The gluing data: cells with affine face isometries , the intersection condition, the weak topology, (H1)-(H3), the maximum dimension ; the chain metric candidate 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
The order complex of and the map : is a homeomorphism from the weak topology of to the weak topology of ; every point of lies in the relative interior of exactly one simplex of ; the hat coordinates satisfy , are affine on every simplex, and satisfy ; for every there is with and lies in the open star of ; every closed star is the image under of the realization of a finite subcomplex of , hence compact and metrizable; the open stars cover ; and each vertex has only finitely many vertices in a common cell with it. Face coherence, global hat coordinates and a uniform star radius
Metric vocabulary and elementary facts: and the reverse triangle inequality hold in a metric space; open balls, the metric topology, compactness, completeness, Cauchy sequences and convergence have their usual meaning. Nonnegativity of a metric is a consequence of the other axioms, not an axiom, The reverse triangle inequality in any metric space, Open ball, closed ball and sphere in a metric space, 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, Open cover, subcover, compact metric space, and compact subset of a metric space, Complete metric space: every Cauchy sequence converges in the space, Cauchy sequence in a metric space, Convergence of a sequence in a metric space: iff in
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
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 with (H1)-(H3), its chain metric candidate , the constants , the order complex and the map .
The length of a chain is independent of the chosen cells and is finite, so is a symmetric real-valued function with and the triangle inequality. If lie in cells and , then by the intersection condition of [F1] both points lie in , and the affine face isometries identify the three cells on their common points, so the Euclidean distances computed in and in agree; hence every choice gives the same sum. For finiteness, fix and let be the set of points joined to by a chain; if a cell meets , say in , then any is joined to by the given chain followed by a one-step chain, so : thus the trace of on every closed cell is either that cell or empty, and is open and closed in the weak topology of [F1]; as is connected, . Therefore every two points are joined by a chain, each chain has finite length, and for all . Reversing a chain shows , the one-term chain shows , and concatenating chains at and passing to the infimum shows the triangle inequality.
For every and real the closed ball is contained in a finite union of closed stars. Call two vertices adjacent when they lie in a common cell; by [F2] each vertex has only finitely many adjacent vertices. Choose with and let be the finite set of vertices reachable from by a walk of at most steps of the adjacency relation; then . Indeed, let . If , it already lies in the starting star. Otherwise choose a chain of length , delete consecutive repeated points, and traverse each remaining step at unit speed in its cell to obtain a map with , and , because the sub-chain between two parameter values has length at most the parameter difference. Put and let be the parameters obtained by steps of size , the last gap being at most ; then . For each choose a vertex with , taking for . Since , the point lies both in and in , so the two open stars meet and lie in a common cell, that is, they are adjacent. By induction , and lies in .
is a metric: if then . Suppose . By the Lipschitz clause of [F2], for every vertex , so for all . Since and correspond under the bijection of [F2] to the functions on the vertex set (their values on the carrier), this gives and hence . With [step 1.1] this gives all the metric axioms of [F3].
Every metric ball is weakly open: the metric topology is contained in the weak topology of [F1]. Fix and a cell with its Euclidean metric . For the reverse triangle inequality gives , and the one-step chain gives ; hence is -Lipschitz, in particular continuous, on . Therefore the trace of any open ball on is relatively open, and as was arbitrary each ball is weakly open.
Every closed bounded subset of is compact. Let be closed and bounded; if this is [F3]. Otherwise for some and . The ball is closed, since is -Lipschitz and hence continuous, and by [step 1.2] it is contained in the union of the finitely many closed stars , ; 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 , being a closed subset of that compact metric space, is compact by [F4]. Finally , closed in , is closed in the subspace and therefore compact by [F4].
The weak topology is contained in the metric topology. Let be weakly open and let . By [F2] choose a vertex with and contained in the open star of ; the closed star of is the image under of the realization of a finite subcomplex of . The map is a continuous bijection from the compact metric space of [F5] onto with the weak topology, and the identity on 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 . Hence is open in the metric subspace : there is with . Taking and using we obtain . Therefore every weakly open set is metric open, and with [step 2.2] the two topologies coincide.
Every closed ball is compact by [step 3.1], since a closed ball is closed and bounded. For completeness, let be a Cauchy sequence in ; by [F3] fix an index with for all . The finitely many terms have finite distances from , so there is a real with for every , and hence the sequence lies in the closed ball , which is compact by [step 3.1] and therefore complete by [F4]; being Cauchy in and lying in this complete subspace, converges to a point of it, so is complete.
Length in a metric target: lower semicontinuity and arc-length reparametrization
Statement
Let be a metric space (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric) and let be real numbers. A path in is a map . A partition of is a finite sequence ; the polygonal sum of over that partition is , and the length of is the supremum For a singleton interval , its only partition is the one-term sequence , its polygonal sum is the empty sum , and its path length is . For nondegenerate intervals the supremum is taken in the extended reals (The extended real line , its order, and the arithmetic that is left undefined, Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in , Upper bound, least upper bound, and strict upper bound); is rectifiable if . For write for the restriction of to , a path on , and for its length.
Chord bound and additivity at the initial point. For one has , and for one has ; in particular is nondecreasing on .
(i) Lower semicontinuity. If are paths with (uniform convergence, Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on and on ), then , the limit inferior being taken in (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 , then defines a continuous nondecreasing surjection with and ; there is a unique map with ; and is -Lipschitz with for all . If then is constant, , and is that constant.
(iii) Equicontinuity of bounded arc-length families. Call a path arc-length parametrized when and If and the paths are arc-length parametrized with for every , then each is -Lipschitz and the family 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 carries the chain metric of an isometric polyhedral gluing with hypotheses (H1)-(H3) (Abstract isometric polyhedral gluings and the chain metric), then is a metric on (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 .
No compactness, completeness, convexity or local structure of 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 , real numbers , and paths as in the Statement, together with the partition sums, the length and the restrictions defined there.
As a metric space, satisfies , and for all , and . Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Nonnegativity of a metric is a consequence of the other axioms, not an axiom
Reverse triangle inequality: for all . The reverse triangle inequality in any metric space
The extended real line is totally ordered, its order restricts to that of , and every subset of has a least upper bound and a greatest lower bound in ; 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 , its order, and the arithmetic that is left undefined, Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in , Upper bound, least upper bound, and strict upper bound, Greatest lower bound (infimum)
A sequence of maps into a metric space converges uniformly when one index serves every point of the domain: for every real there is with for every and every . Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on and on
For a sequence in the limit inferior is the supremum of the tail infima, , all suprema and infima taken in . Limit superior and limit inferior of a nonnegative extended-real sequence
Real sequences: means that for every real there is with for all ; a finite sum of convergent real sequences converges to the sum of the limits; and if from some index on, then whenever both limits exist. Limits and Cauchy sequences of reals, Algebra of limits: sums, scalar multiples, products and quotients, Limits preserve non-strict inequalities
Archimedean property and translation: for every real there is a natural number with , and implies for reals . For every in a complete ordered field there is a natural with , Order is preserved by adding a constant and by adding inequalities
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 with its usual topology are exactly the order-convex subsets, the published characterisation transported by the identification of the two descriptions of "open in ", A real-valued continuous map on a connected space has order-convex image, so it takes every value between any two of its values
Metric continuity: is continuous at when for every real there is a real with for every with . Continuity of a map between metric spaces, at a point and globally, in the - form
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
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 , real numbers , a path and, where the clause says so, paths as in the Statement.
(Chord bound, additivity at the initial point, monotonicity.) For if both the chord and the length are by the singleton convention and [F1]; if the sequence is a partition of with polygonal sum , so because is the least upper bound of all polygonal sums [F3]. For let first be a partition of ; inserting if it is absent gives a partition of whose polygonal sum is at least that of by the triangle inequality [F1], and which is the union of a partition of and a partition of . Hence every polygonal sum of is at most , so [F3]. Conversely, if both summands are finite, then for every real there are partitions of and of with sums exceeding and , and their union is a partition of , so ; as the real is arbitrary, [F7] gives . If , then every partition of extends by to a partition of with sum no smaller, since the added chord is nonnegative, so and the two sides agree; and if while , then for every real there is a partition of with sum exceeding , and adjoining any fixed partition of yields a partition of with sum exceeding , so . The degenerate cases or follow directly from the singleton convention. This proves additivity, and monotonicity of follows from for because lengths are suprema of sums of nonnegative terms [F1, F3].
(Lower semicontinuity.) Suppose is an upper bound of the tail infima of [F5]; I show . Assume . Then is a real number, because contradicts and is impossible as all forces every [F1, F3]. Since is the least upper bound of the polygonal sums of [F3] and , some partition of has polygonal sum . By [F7] choose a natural number with . For each partition point , the convergence gives [F4]; consequently converges to by [F2] and [F6]. So there is with for all . Since by [F3], this gives , contradicting that is an upper bound of the . Hence every upper bound of the tail infima satisfies , and since the least such upper bound is [F5], .
(The arclength function.) From now on assume that is continuous and that ; write . Then , , and is nondecreasing by [step 1.1]; moreover for all , by additivity at the initial point [step 1.1].
(Equicontinuity of bounded arc-length families.) Let be arc-length parametrized with . For the chord bound [step 1.1] and the definition of arc-length parametrized give , so every is -Lipschitz. If then every is constant by separation [F1] and the family is uniformly equicontinuous with any . If and is real, take ; then for all and all with , so the family is uniformly equicontinuous, hence equicontinuous [F10].
( is continuous.) Fix and a real ; put . Since is the least upper bound of the polygonal sums, choose a partition of with polygonal sum [F3], and insert into if absent (the sum only increases [F1]); write and for the sums of the parts of on and on , so that , and let be the successor of in when . By continuity of at [F9] choose with for ; I claim for every . Let be a partition of ; then the union of the parts of on , of , and of the part of on is a partition of whose polygonal sum is , so by the reverse triangle inequality [F2]. Taking the supremum over gives [step 2.1]. The same argument applied to partitions of gives left-continuity at every ; hence is continuous.
( is surjective.) The interval is connected [F8] and is continuous [step 3.1] with and [step 2.1]; by the intermediate value theorem [F8], for every real with there is with .
(Factorisation through .) If satisfy , then [step 2.1], so by the chord bound [step 1.1] and hence by separation [F1]. Since is surjective [step 4.1], there is therefore a well-defined and unique map with , namely for any with . If then vanishes identically and the same argument with , shows that is constant; then and is that constant.
( is -Lipschitz and has unit speed.) Given , choose by [step 4.1] points with and , and relabel so that ; then by the chord bound [step 1.1] and [step 2.1], so is -Lipschitz. If , the singleton-interval convention gives ; hence assume for the length identity. Define, for each real with , the number , which exists by the least-upper-bound property [F8] and satisfies : indeed because points of the set approach from below and is continuous [step 3.1], while if then every has and continuity gives , and if then . Also for , and [step 5.1]. Now let be a partition of ; its polygonal sum for is by the chord bound [step 1.1] and [step 2.1], so . Conversely let be a partition of ; its polygonal sum for is , the points form a nondecreasing sequence from to , and after deleting repetitions this is a partition of whose polygonal sum for is the same number; hence every polygonal sum of is at most , and [step 2.1]. Therefore .
(Application.) Let carry the chain metric of an isometric polyhedral gluing with (H1)-(H3); by [F11] this is a metric on , so clauses (i)-(iii), whose statements and proofs mention only the metric space , hold verbatim for paths in ; in particular the constants are arbitrary reals and no hypothesis beyond the metric axioms was used.
Under the Axiom of Choice, proper polyhedral spaces admit minimizing geodesics
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be an isometric polyhedral gluing with standing hypotheses (H1)-(H3) of Abstract isometric polyhedral gluings and the chain metric, so that 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 is joined by a minimizing geodesic: there is a path with , and for all (Geodesics and geodesic metric spaces); in particular is a geodesic metric space. More precisely, every sequence of chains from to whose lengths tend to has a subsequence whose associated polygonal paths, each traversed at constant speed on the common domain , converge uniformly to a continuous path of length whose arc-length reparametrization is a minimizing geodesic from to . The case is included: then and the degenerate interval carries the geodesic .
Facts & Assumptions
Given: An isometric polyhedral gluing with (H1)-(H3), its chain metric candidate , and points with ; the Axiom of Choice is assumed.
Chains and the chain metric: a chain from to is a finite sequence 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; is the infimum of the lengths of chains from to , and these lengths form a nonempty set of reals. (Abstract isometric polyhedral gluings and the chain metric)
Under (H1)-(H3), is a metric on and every closed -bounded subset of is compact, so is proper and complete; in particular closed balls are compact. (The chain metric is a metric, its topology is the weak topology, and the space is proper and complete, Open cover, subcover, compact metric space, and compact subset of a metric space, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric)
In a metric space: (chord bound) and for paths, where is the supremum of polygonal sums; is lower semicontinuous under uniform convergence; and a continuous rectifiable path has a continuous nondecreasing surjective arclength function with , , through which it factors uniquely as with -Lipschitz and . (Length in a metric target: lower semicontinuity and arc-length reparametrization, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric)
Axiom of Choice (The Axiom of Choice): every family of nonempty sets has a choice function.
Ascoli-Arzela for proper targets, under the Axiom of Choice: for a nonempty compact metric domain , a proper metric target and an equicontinuous sequence in that is pointwise bounded, some subsequence converges uniformly to a member of . (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)
Geodesic segments: a map with , and for all is a geodesic segment from to , and necessarily ; is geodesic when every two points are joined by one. (Geodesics and geodesic metric spaces)
The infimum of a nonempty set of reals is the greatest lower bound of , so for every real there is with . (Greatest lower bound (infimum))
Boundedness, balls and continuity: a subset is bounded when it lies in a ball with , and the closed ball about of radius is (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Open ball, closed ball and sphere in a metric space); an -Lipschitz map between metric spaces is continuous, and a family with a common Lipschitz constant is equicontinuous (Contraction implies Lipschitz implies uniformly continuous implies continuous; every Hölder map is uniformly continuous, and a Lipschitz map on a bounded space is Hölder for every exponent, Equicontinuity at a point, uniform equicontinuity, and pointwise boundedness of a family of maps between metric spaces, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
The closed interval is a nonempty compact metric space: it is nonempty, closed and bounded, hence compact by Heine-Borel on the real line, and carries the subspace metric of the usual metric . (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, The absolute value makes a metric space: is a metric, its open balls are the intervals , and it is unbounded, Isometry, isometric embedding, and the subspace metric on a subset, Intervals of : the nine order-convex forms, nondegeneracy, and length)
For a sequence in , the limit inferior is the supremum of the tail infima: , so for every ; and for every real there is a natural with . (Limit superior and limit inferior of a nonnegative extended-real sequence, For every in a complete ordered field there is a natural with )
Proof
Given: The gluing with (H1)-(H3), the metric and its properties [F2], points and .
(Realizing a chain by a path.) Every chain of length is the vertex sequence of a path traversing straight segments of the cells at constant speed, with , , for all , and . Deleting one of each two consecutive equal points leaves a chain of the same length, so assume and put and ; if the reduced chain is the single point and we take the constant path, for which all claims are immediate. For define to be the point at fraction of the straight segment from to inside , where ; this is well defined because the segment lies in the convex cell [F1]. Given , the points , the vertices strictly between the parameters and , and form a chain whose steps lie in the traversed cells and whose length is the total traversed Euclidean distance , because the path moves at constant speed inside each cell; hence by [F1]. Every polygonal sum of over a partition is therefore at most , so the supremum over partitions gives [F3].
(Near-minimizing paths.) By [F7], for each there is a chain from to of length ; 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 with , , and , the last inequality because and .
(Equicontinuity and pointwise boundedness.) By step 2.1 each is -Lipschitz, hence continuous, and the family is equicontinuous: for a real the number satisfies for all and all with . It is pointwise bounded: for every , , so is bounded.
(The Ascoli subsequence.) The interval is a nonempty compact metric space [F9], the target is a proper metric space [F2], and 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 converging uniformly to a continuous . Uniform convergence implies and , since and for every .
(The limit has length .) By lower semicontinuity [F3], . For every real , the strictly increasing positive indices tend to infinity (inductively ), so for all sufficiently large [step 2.1, F10]. Every tail, including those starting earlier, contains such a term; its infimum is therefore at most . Taking the supremum of all tail infima gives by [F10]. As this holds for every , that limit inferior is at most , and hence . Conversely the two-point partition gives [F3], that is by step 4.1. Therefore .
(The minimizing geodesic.) Since is continuous and rectifiable with , clause (ii) of [F3] provides a continuous nondecreasing surjection with , , a unique with , and for all ; in particular and . Let . The chord bound gives , and the triangle inequality for [F2] together with the chord bound on and gives so . Hence for all , and is a geodesic segment from to in the sense of [F6]; as were arbitrary, is geodesic.
(The subsequence clause.) Let now be any sequence of chains from to with lengths , and choose realizing paths from step 1.1 using [F4] if common cells are not already specified; then and , and for all sufficiently large , so each is -Lipschitz with the common constant and the family is equicontinuous and pointwise bounded (all values lie in the bounded set , since ). Ascoli's theorem [F5] gives a uniformly convergent subsequence, and its limit has the same endpoints. The proof of step 5.1 applies because : every tail infimum is at most for every , so lower semicontinuity and the chord bound give limit length exactly and whose arc-length reparametrization is, by step 6.1, a minimizing geodesic from to .
5 · Examples, counterexamples and false statements
None yet.
Sources
- Martin R. Bridson and André Haefliger, Metric Spaces of Non-Positive Curvature (Springer Grundlehren 319, 1999; author-hosted PDF)
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (first-edition author manuscript, 2007-2008)
- C. P. Rourke and B. J. Sanderson, Introduction to Piecewise-Linear Topology