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.
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.
Depends on
- 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
- The reverse triangle inequality $|d(x,z) - d(y,z)| \le d(x,y)$ in any metric space
- The extended real line $\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}$, its order, and the arithmetic that is left undefined
- Every subset of $\overline{\mathbb{R}}$ has a least upper bound and a greatest lower bound in $\overline{\mathbb{R}}$, agreeing with the real supremum and infimum on nonempty sets bounded in $\mathbb{R}$
- Upper bound, least upper bound, and strict upper bound
- Greatest lower bound (infimum)
- Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on $Y^{X}$ and on $C(X,Y)$
- Limit superior and limit inferior of a nonnegative extended-real sequence
- Limits and Cauchy sequences of reals
- Algebra of limits: sums, scalar multiples, products and quotients
- Limits preserve non-strict inequalities
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
- Order is preserved by adding a constant and by adding inequalities
- Complete ordered field (least-upper-bound property)
- The connected subspaces of $\mathbb{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 $\mathbb{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
- Continuity of a map between metric spaces, at a point and globally, in the $\varepsilon$-$\delta$ form
- Equicontinuity at a point, uniform equicontinuity, and pointwise boundedness of a family of maps between metric spaces
- 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
Used by
- Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles Definition
- Short loops, the uniform-plus-length topology, short-loop homotopies, and nonshrinkability Definition
- Null-homotopy versus shrinkability through short loops on S² and on a short circle Example
- Endpoint stability for local geodesics in complete locally CAT(0) spaces Lemma
- Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas Lemma
- Minimum nonshrinkable loops, radial vertex cones, and the excursion of length π Lemma
- Polygon transfer, the basin as the shrinkable class, and the short-loop criterion Lemma
- The space of local geodesics, its length metric, and the covering criterion for local isometries Lemma
- Complete, simply connected, locally CAT(0) length spaces are CAT(0) Theorem
- Under the Axiom of Choice, proper polyhedral spaces admit minimizing geodesics Theorem
Dependency tree · two levels
83 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Martin R. Bridson and André Haefliger, Metric Spaces of Non-Positive Curvature (Springer Grundlehren 319, 1999; author-hosted PDF) (standard reference, not scraped)