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.
Short loops, the uniform-plus-length topology, short-loop homotopies, and nonshrinkability
Definition
Fix the following definitions and conventions; they are used throughout this page. Let be a compact locally CAT(1) metric space (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles, Open cover, subcover, compact metric space, and compact subset of a metric space).
(1) Rectifiable loops and normalization. A loop in is a continuous map with ; its length is the supremum of its polygonal sums and is rectifiable if (Length in a metric target: lower semicontinuity and arc-length reparametrization, Upper bound, least upper bound, and strict upper bound). A rectifiable loop is normalized if it is parametrized proportionally to arclength, i.e. for all (Intervals of : the nine order-convex forms, nondegeneracy, and length); by the arc-length parametrization clause of Length in a metric target: lower semicontinuity and arc-length reparametrization every rectifiable loop of positive length has a normalized reparametrization, and a loop of length is normalized exactly when it is constant. Henceforth every loop on this page is normalized.
(2) Short loops. A loop is short if (Pi is the first positive zero of sine). The constant loop at any point is short.
(3) The uniform-plus-length topology. For loops write in the uniform-plus-length topology when and (Limits and Cauchy sequences of reals). Uniform convergence of the maps alone does not bound rectifiable lengths, so the length term belongs to the topology by definition; the resulting uniform length bound and the common fine mesh of a compact short family are proved in Polygon transfer, the basin as the shrinkable class, and the short-loop criterion ↗.
(4) Short-loop homotopies. A short-loop homotopy from to is a family of short loops with the given loops such that is continuous for the uniform-plus-length topology (Continuity of a map between metric spaces, at a point and globally, in the - form). A short loop is shrinkable if it is short-loop homotopic to some constant loop, and nonshrinkable otherwise. Short-loop homotopy is an equivalence relation on short loops (reflexivity, symmetry and transitivity hold by reparametrizing the parameter interval).
(5) Comparison with ordinary null-homotopy. A null-homotopy of a short loop allows intermediate loops of arbitrary length, whereas a short-loop homotopy demands that every intermediate loop be short; the comparison of the two notions, and the fact that a closed local geodesic is never shrinkable, are theorems of this page, not part of the definition.
(6) Polygons are defined separately. The cyclic tuples, midpoint operation and zero-limit basin used below are defined without reference to short-loop homotopy; their identification with the classes of (4) is a theorem proved after the basin's topological properties are established.
Depends on
- Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles
- 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
- Continuity of a map between metric spaces, at a point and globally, in the $\varepsilon$-$\delta$ form
- Open cover, subcover, compact metric space, and compact subset of a metric space
- Upper bound, least upper bound, and strict upper bound
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- Limits and Cauchy sequences of reals
- Pi is the first positive zero of sine
Used by
- The Coxeter nerve is CAT(1), and its girth and the girths of all its links are at least 2π Corollary
- Null-homotopy versus shrinkability through short loops on S² and on a short circle Example
- 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
- Nonshrinkable edge loops of length <2π have three edges, and the finite locally CAT(1) large metric flag complex is CAT(1) Theorem
Dependency tree · two levels
50 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
- B. H. Bowditch, Notes on locally CAT(1) spaces (Aberdeen preprint, 27 scanned sheets) (standard reference, not scraped)
- Martin R. Bridson and André Haefliger, Metric Spaces of Non-Positive Curvature (Springer Grundlehren 319, 1999; author-hosted PDF) (standard reference, not scraped)
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (first-edition author manuscript, 2007-2008) (standard reference, not scraped)