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.
CAT Comparison, Link Criteria, and Local Globalization
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- 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
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Covering Spaces and Lifting
- Coxeter Polyhedral Gluings and Intrinsic Metrics
- Determinants of Matrices over a Commutative Ring
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Function Space Topologies and the Exponential Law
- Further Trigonometric Identities and Inverse Functions
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hilbert Space Geometry and Riesz Representation
- Homotopy and Homotopy Equivalence
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Simplicial Complexes and Simplicial Homology
- Simplicial Subdivision and Simplicial Approximation
- Sine, Cosine, and the Definition of Pi
- Spherical Simplex Metrics, Angular Links, and Cones
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Ascoli–Arzelà Theorem
- The Derivative and the Mean Value Theorems
- The Fundamental Group
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Riemannian Hadamard theorems do not cover singular Coxeter polyhedra. This page supplies CAT comparison, angular-link equivalence and the precise complete simply connected local-to-global theorem using local-geodesic path spaces.
The nine draft items define Euclidean and spherical comparison, comparison angles and the Alexandrov upper angle, and establish the local suppliers for the two globalization arguments. CAT(1) requires geodesics for distances below and tests only triangles of perimeter below . Truncated angular metrics use these same short tests, including disconnected and empty links.
The model-space lemma constructs comparison triangles and proves the elementary CAT consequences. Alexandrov straightening and finite patchwork supply angle comparison for continuous geodesic sweeps. Berestovskii's cone equivalence then gives the polyhedral link criterion, with normal face links and local product charts explaining why vertex links suffice.
For complete locally CAT(0) length spaces, endpoint stability constructs nearby local geodesics by convergent endpoint corrections. The local-geodesic path space is complete for its induced length metric, and endpoint evaluation is a covering map. Simple connectivity makes that covering one-sheeted; minimization and patchwork yield CAT(0) and a continuous geodesic contraction.
For compact geodesic locally CAT(1) spaces, the short-circle criterion is proved under the Axiom of Choice. Compactness gives continuous dependence of unique short geodesics and a limiting minimum digon. The noncollapse and distance calculations identify an isometrically embedded circle of circumference twice the injectivity radius whenever CAT(1) fails.
Prerequisites and reading
Required earlier pages: spherical-simplex-metrics-angular-links-and-cones, homotopy-and-homotopy-equivalence, covering-spaces-and-lifting, further-trigonometric-identities-and-inverses, hilbert-space-geometry-and-riesz-representation, foundations-of-the-real-numbers. The companion cat-comparison-link-criteria-and-local-globalization-examples tests these constructions and conventions. Exact item dependencies and source reading limits are recorded in research/coxeter-scaffold/inventory.json and research/plan-coxeter-groups-track.md.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles
Definition
Fix the following definitions and conventions for this page.
(1) Models. is with the Euclidean metric ( as the set of functions , and , , are metrics on it). The comparison sphere is with the round metric (Spherical Gram simplices and angular links of Euclidean faces, Principal inverse sine and inverse cosine); more generally is defined on every sphere (Euclidean spheres and closed balls as subspaces of ).
(2) Geodesic triangles and comparison. A geodesic triangle in a metric space consists of three points and a choice of geodesic segments , , joining them (Geodesics and geodesic metric spaces); its perimeter is . A comparison triangle for it in , or in when its perimeter is , is a triangle in that model with the same three side lengths; it is unique up to an isometry of the model (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences ↗). For an occurrence of a point on a specified chosen side, the comparison point is the point of the corresponding side of the comparison triangle at the same distance from the corresponding vertex; a vertex corresponds to itself. If a point belongs to more than one side, each side occurrence has its own comparison point, and the CAT inequalities quantify over every pair of side occurrences.
(3) The CAT inequalities. A metric space is CAT(0) if it is geodesic and for every geodesic triangle in and all points of that triangle, . It is CAT(1) if every pair of points of at distance is joined by a geodesic segment in , and every geodesic triangle in of perimeter satisfies for all points of the triangle. Thus for CAT(1) only triangles of perimeter are tested, and geodesic segments are demanded only for pairs at distance ; a triangle of perimeter has all sides , so its sides are available by hypothesis. A metric space is locally CAT(0), equivalently of curvature , if every point has a closed ball , , such that the induced metric on is CAT(0); locally CAT(1) is defined in the same way.
(4) Truncated angular metrics on links. Let be a face of an isometric polyhedral gluing with its chain metric (Abstract isometric polyhedral gluings and the chain metric) and let be its angular link with the auxiliary extended componentwise path metric and the finite angular metric (The angular path metric, the Euclidean cone and spherical joins, Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas). Then every -triangle of perimeter has all sides : if one side were , the triangle inequality would make the perimeter at least . Thus its vertices lie in one intrinsic component of , and its side lengths equal the untruncated intrinsic path distances. It also holds between any two side points: the shorter of the two boundary routes has length at most half the perimeter, hence , so their truncated distance is and equals their intrinsic path distance. Hence the CAT(1) tests in of perimeter agree with componentwise intrinsic tests (The cone and join metrics and the local product chart of a polyhedral gluing). The empty metric space carries no triangles and satisfies the CAT(0) and CAT(1) tests vacuously; a one-point space is CAT(0) and CAT(1). With the conventions and (The angular path metric, the Euclidean cone and spherical joins), the empty link satisfies the CAT(1) tests vacuously and its cone is a point.
(5) Local geodesics. Let be an interval. A map is a constant-speed local geodesic if there is a fixed such that for every some satisfies whenever . Here is its speed; is the unit-speed convention and gives the constant paths. In this chapter “local geodesic” includes these linear reparametrizations. It is a minimizing geodesic precisely when the same distance equality holds for every pair .
(6) Length. A continuous path has length , 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). is a length space if for all and every there is a path from to of length .
(7) Round circles. For let be the circle of circumference , with ; for this is the unit circle. An isometrically embedded circle of length in a metric space is an isometric embedding (Isometry, isometric embedding, and the subspace metric on a subset); its image is a subset of isometric to .
Remarks
The definition asserts no property of the objects it names beyond the conventions recorded. The metric axioms for and , the existence and uniqueness of comparison triangles under the stated perimeter restrictions, the description of geodesic segments in the models as minimal great arcs and round arcs, and the facts that and are CAT(0), respectively CAT(1), are all proved in the recorded justifier Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences ↗, which depends on this definition; The agreement of the tests is derived in (4), and the local product chart is established by The cone and join metrics and the local product chart of a polyhedral gluing, rather than by the comparison lemma.
Comparison angles of hinges, model triangle angles, and the Alexandrov upper angle
Definition
(1) Comparison angle of a length triple. For real lengths and satisfying , define This is a number in (Principal inverse sine and inverse cosine): the two assumed length inequalities give , hence . For spherical adjacent lengths and an opposite length , put The denominator is positive (Pi is the first positive zero of sine). Whenever , define the spherical comparison angle by . No spherical angle is assigned by this definition when that validity condition fails. In either model the notation chooses the unique angle in having the indicated cosine.
(2) Comparison angle of a metric hinge. In a metric space (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric), let with and ; is allowed. The Euclidean comparison angle at is Its length triple meets (1): the metric triangle inequality gives and, applied with each of as the middle point, .
(3) Alexandrov upper angle. Let and be unit-speed geodesic segments with and (Geodesics and geodesic metric spaces). For set and define their Alexandrov upper angle by Each set in the supremum is nonempty and contained in , so its supremum exists and also lies in (Upper bound, least upper bound, and strict upper bound, The Cauchy-sequence reals have the least-upper-bound property). The set of these suprema is likewise nonempty and bounded; its infimum exists by applying the same least-upper-bound property to its negatives. Thus is well defined. This is the two-variable upper-limit convention, without asserting existence of an ordinary limit, monotonicity of the comparison angles in , invariance under reparametrization, or a CAT inequality.
(4) Triangle-angle conventions. In a geodesic triangle with distinct vertices and chosen sides (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles), the angle at a vertex means (3) for the unit-speed parametrizations of the two sides starting there. For a model triangle in , , with distinct vertices, the model angle at a vertex is defined by (1) from its two adjacent side lengths and opposite side length. In the spherical case the side lengths must be in and the validity condition in (1) must hold. Model angles are therefore side-length comparison angles; the identification with geometric angles, and any further relations among upper angles, require their own arguments.
Remarks
A comparison angle in (2) is a quantity determined by the three metric distances, while (3) uses arbitrarily short initial portions of the two geodesics. The definition supplies these quantities and their domains; it does not by itself prove the upper-angle triangle inequality or the angle comparison consequences of curvature bounds.
Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences
Statement
(i) Euclidean comparison. For all reals with , , there are with the three prescribed distances, and any two such triangles are related by an isometry of (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles). Consequently every geodesic triangle in every metric space has a comparison triangle in , and the plane is CAT(0): for a triangle in the comparison triangle is congruent to it and the defining inequality is an equality.
(ii) The round sphere. For the function is a metric on ; is a geodesic space whose geodesic segments are the minimal great-circle arcs; two points at distance are joined by a unique geodesic segment; and every closed ball of radius is convex (Open ball, closed ball and sphere in a metric space). For every triple of side lengths with perimeter satisfying the triangle inequalities there is a comparison triangle in , unique up to an isometry of . Hence is CAT(1), the CAT(1) inequality for a triangle in of perimeter being an equality.
(iii) Spherical cosine rule and midpoint identity. For with , and vertex angle at , . If , is the midpoint of a geodesic of length and , then
(iv) Consequences of CAT(0). Let be CAT(0). Then: (a) geodesic segments between two points are unique and vary continuously with their endpoints (Geodesics and geodesic metric spaces); (b) if are geodesics with a common initial point and proportional parametrizations, then for ; (c) (hinged criterion) for a geodesic triangle with vertices and the point on at distance from , the CAT(0) inequality holds if and only if the right-hand side being the squared Euclidean comparison distance; consequently a geodesic space is CAT(0) if and only if for every geodesic triangle and every point on a side the comparison inequality with the opposite vertex holds; (d) for every pair , every midpoint of a geodesic segment and every , .
(v) CAT(1) short-geodesic estimates. Let be CAT(1), , and . Then is convex, is unique with midpoint , and, whenever the CAT(1) test is admissible, i.e. , where makes the denominator positive. The admissibility bound is a hypothesis and not a consequence of : a triple in such a ball has perimeter only, and the CAT(1) inequality is stated for triangles of perimeter .
(vi) The round circle. For every , is a metric on (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles); is a compact complete geodesic space locally isometric to , contains an isometrically embedded circle of length , and is CAT(1) if and only if . For the points form a triangle of perimeter whose side midpoint is at distance from the opposite vertex, which exceeds the distance in the spherical comparison triangle; for every triangle of perimeter lies in an arc of length , hence is degenerate and realizes its comparison triangle isometrically.
Facts & Assumptions
Given: The conventions of Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles: the models and with the metrics and , geodesic triangles with their comparison triangles and comparison points, the CAT(0) and CAT(1) classes, and the circles .
The Euclidean plane, the round sphere, the CAT(0) and CAT(1) inequalities with their perimeter restriction, and the round circle with are those fixed in Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles.
is the inverse of the restriction of to , so for (Principal inverse sine and inverse cosine).
Cosine is strictly decreasing on and sine is strictly increasing on ; both have range (Signs, monotonicity intervals, and ranges of sine and cosine).
and for all real (The addition formulas for sine and cosine).
and for ; in particular is a positive real (Pi is the first positive zero of sine).
, with equality if and only if are linearly dependent (Cauchy–Schwarz: , with equality exactly for dependent pairs).
For the Euclidean metric is a metric on ( as the set of functions , and , , are metrics on it).
is the unit sphere centred at the origin (Euclidean spheres and closed balls as subspaces of ).
A function is an isometric embedding when it preserves distances, and two spaces are isometric when some bijective isometric embedding exists (Isometry, isometric embedding, and the subspace metric on a subset).
The image of a compact metric space under a continuous map is compact (The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset).
A compact metric space is complete and totally bounded (A compact metric space is complete and totally bounded, and neither implication uses any choice principle).
A geodesic segment from to is a map with , and ; then (Geodesics and geodesic metric spaces).
The reciprocal Archimedean property For every in a complete ordered field there is a natural with gives an integer bound above every positive real, by applying it to the reciprocal of that real.
Proof
The series of Sine and cosine defined by their real power series contain only even powers of in and only odd powers in , so , , and ; replacing by in [F4] therefore gives and , and the case of the cosine subtraction formula gives the Pythagorean identity , whence . Since by [F5], ; is strictly decreasing on by [F3] with , so and hence ; then gives , and strict decrease gives for .
Let satisfy the three triangle inequalities and put and , which is real because ; set , and in . Then , and , so the three prescribed distances are realised. This construction includes every positive degenerate triple because then . If , the inequalities force , and , realise the triple; the other zero-side cases follow by relabeling.
For the Cauchy–Schwarz inequality [F6] gives , so is defined by [F2]; symmetry is , separation at is , and if then , so are linearly dependent by the equality case of [F6]; as unit vectors they satisfy , and excludes , so .
Let with and both in , and let , and . Here and by [F2], so and likewise , using and from [F5]; hence and with unit vectors orthogonal to . Expanding gives the spherical cosine rule , and by [F6] defines the vertex angle at .
Let be a geodesic space with a geodesic triangle and on at distance from ; in the Euclidean comparison triangle , so the identity holds by expansion, and substituting the comparison distances shows that is equivalent to its squared form, both sides being nonnegative.
On the minimum defining exists: for , choose by [F13]; when , , so a minimum occurs among the finitely many integers . Changing representatives just shifts these integers. Thus is well defined and symmetric and vanishes exactly on the diagonal, and by choosing minimising integers; hence is a metric. The map from onto is surjective: a finite integer bound from [F13] permits subtracting an integer multiple of to place each real representative in and satisfies for , so it is continuous and sends the compact interval onto , which is therefore compact, complete by [F11] and geodesic (the shorter interval between two parameters is mapped isometrically), and each point has a ball of radius isometric to an interval of , since differences between lifts in that ball are . A minimizing segment lifts successively through these interval charts, starting at any chosen lift; each chart restriction of its lift is affine of slope or in unit-speed parameters. Overlaps fix the same slope, so the lift is one straight interval. Therefore all minimizing segments are the shorter arcs, with two choices only at distance ; the identity map exhibits an isometrically embedded circle of length in the sense of [F9].
Two triangles in with the same three side lengths are related by an isometry: when all lengths are zero all vertices coincide, and a translation suffices; otherwise relabel so that the baseline has positive length. If , the map , with orthogonal sending to , is an isometry of , and applying the coordinate computation of step 1.2 to of a triangle shows that a point at distance from and from has coordinates with as in step 1.2; the two solutions differ by the reflection , so any two triangles with the prescribed side lengths are obtained from the normal form of step 1.2 by an isometry.
With the notation of step 1.4 and : if then by [F4] and from [F5], and since and strictly decreases on by [F3], ; if then . If then and ; if similarly . Hence satisfies the triangle inequality, and by step 1.3 it is a metric on .
Let and ; when put , so that with a unit vector orthogonal to by step 1.3 and [F2], and choose any unit when . Then satisfies , , and for with by step 1.1, so by [F2]; thus minimal great-circle arcs are geodesic segments in the sense of [F12].
Let satisfy the triangle inequalities with . Then , since forces . If , put ; the argument lies in directly from the length hypotheses. Indeed gives . If , then gives ; if , the perimeter bound gives , hence . In both cases , proving the required range without presupposing a spherical realization, and the construction , , uses (step 1.1) to give unit vectors with , and ; if one of vanishes, say , then and , , realise the triple. Any two triples of unit vectors with equal pairwise inner products have spans related by a well-defined inner-product-preserving linear map, extended to an orthogonal map of along orthonormal bases of the orthocomplements; so the comparison triangle is unique up to an isometry of by [F9]. A triangle in of perimeter is a comparison triangle for itself, so the CAT(1) inequality holds with equality for it and is CAT(1).
Let be CAT(0) and let be geodesic segments from to of length ; the geodesic triangle with sides and the degenerate third side has side lengths , and its comparison triangle in is degenerate with the comparison points of and coinciding, both being at distance from the comparison vertex along the same comparison side; hence by the CAT(0) inequality, so and geodesic segments are unique.
A geodesic triangle in a metric space has side lengths obeying the triangle inequalities, because the metric satisfies (M3) of Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric; in every geodesic side is a straight segment: equality along a minimizing segment forces the two displacement vectors to be nonnegative multiples by the equality case of [F6], and their lengths fix . By steps 1.2 and 2.1 every metric triangle therefore has a comparison triangle in , unique up to isometry, and if the triangle itself lies in then it is a comparison triangle for itself by step 2.1, so the CAT(0) inequality is an equality for it and is CAT(0).
Let , , and let satisfy ; write and , so . The Gram matrix of has entries , , , , and is positive semidefinite because ; by step 1.1, , so its determinant is , the bracket being . Hence are linearly dependent; since makes independent, lies in the plane . Parametrise the unit circle of by with as in step 2.3, so that ; a unit vector of with is or , and if with then by steps 1.1 and 1.4, since equality would force ; so , a point of the minimal arc from to .
Let , and ; if there is nothing to prove, so assume and put . If then by [F2], so while , a contradiction since ; hence . For the point of the arc of step 2.3 has nonnegative coefficients by [F5], whose sum is by the addition formulas and decreasing cosine, so and therefore by [F2] and [F3]; hence is convex.
Let be geodesics with common initial point and proportional parametrisations on ; if the claim follows from step 2.5, so let , and consider the geodesic triangle . In its Euclidean comparison triangle the points and are at distance for every , by similarity; the CAT(0) inequality applied to the pair gives since .
Let be a geodesic space in which the CAT(0) inequality holds for every geodesic triangle and every pair consisting of a vertex and a point of the opposite side. Then it holds for all pairs. If lie on one side the comparison preserves distances along that side; if one of is a vertex of the triangle, the claim is either the hypothesis (when the other point lies on the opposite side) or the equality of a side length with its comparison length (when the other point is a vertex or lies on an adjacent side and equals the shared vertex); and degenerate triangles, where some side has length , reduce to these cases. It remains to treat a triangle with sides , points and with , and , comparison triangle , comparison points and , and the positive numbers , ; write and let be the vertex angle at the point corresponding to in the comparison triangle of , so that . Apply the hypothesis to the geodesic triangle with vertex and the point of the opposite side : if is the comparison triangle of and is the comparison point of , then . The triangles and the comparison triangle of have two sides in common, of lengths and , and opposite sides , so the angle at of the former is at least : for fixed the quantity is strictly decreasing in and is strictly decreasing on (F3), so the included angle is increasing in the opposite side. As lies on the side , that angle is exactly the vertex angle of the comparison triangle of at , so . Apply the hypothesis again, to with vertex and the point of the opposite side : , so the triangles and have two sides in common, of lengths and , and opposite sides ; the same monotonicity of the included angle gives , the vertex angle of at , and with makes the ray from to the ray to , so this angle is exactly the vertex angle of at . Hence , and the two laws of cosines and give because is decreasing on (F3). Thus a geodesic space is CAT(0) if and only if every vertex-opposite-side comparison holds.
The case of the squared form in step 1.5, with a midpoint of and the opposite vertex, gives , which is (d) since midpoints are unique by step 2.5.
Let and let be the vertices of a triangle of perimeter , so that all three sides are ; if vertices repeat, the two nonzero sides coincide by the circle interval charts: a minimizing circle path of length has a lift with one fixed direction in the overlapping interval charts, hence is the shorter arc. Such triangles realize a degenerate comparison. For three distinct vertices write their cyclic gaps as . If all then the three pairwise distances are and , contrary to hypothesis; so some , the complementary arc of length contains all three points, and the two adjacent distances are while the third is , so and . Thus the triangle is degenerate and isometric, side by side, to a configuration on an arc of length ; placing three points of a great arc of of the same length realises the same three side lengths, so by uniqueness of comparison triangles in step 2.4 the comparison triangle is isometric to the triangle and the CAT(1) inequality holds with equality; hence is CAT(1) for .
Geodesic segments in a CAT(0) space vary continuously with their endpoints. Let be the geodesic from to and the geodesic from to , let , and let be the geodesic from to , so that are geodesics from the common initial point with proportional parametrizations. Step 3.4 gives , and step 3.4 applied to the reversed geodesics from to and from to , which again have a common initial point and proportional parametrizations, gives . Hence for every , which tends to uniformly in as and ; since the geodesic segments are unique by step 2.5, they vary continuously with their endpoints as asserted in (iv)(a).
Let be a geodesic from to with . If it is constant. Otherwise , so step 3.2 puts on the unique minimal arc at position , and step 2.3 identifies its parametrization. If , choose , perpendicular to . Each half has length and is the unique short arc just proved; because , both halves lie in the plane spanned by and form one semicircle. This proves the claimed classification of all spherical geodesics.
Let be CAT(1), , and . Since , segments exist. Two competing segments give a triangle with repeated vertex and perimeter ; its comparison sides coincide, so CAT(1) forces equal-parameter points to coincide. Thus is unique. Choose with . The triangle has perimeter . Its comparison side lies in the convex spherical ball by step 3.3, so CAT(1) gives for every . Hence is convex, and the same argument with non-strict endpoint bounds proves convexity of closed balls of radius .
Let with and ; put , a unit vector because . Then , since by step 1.1 and [F3], so by [F2] and . Since (step 1.1) and , we get , hence by step 1.1; as and is injective there by [F3], and . Finally , using .
Let be CAT(1), , and with ; the sides are , so is unique with midpoint by step 4.3 and the CAT(1) inequality applied to the pair of the triangle gives , where is the midpoint of the comparison side of length . Step 5.1 applied in to gives , and since and strictly decreases on by [F3], , the denominator being positive by step 5.1.
Let and let , , in ; the three pairwise distances are , so the triangle has perimeter ; let be the midpoint of , so . In the comparison triangle in , whose sides all have length , the midpoint of a side satisfies by step 5.1, with by step 1.1 since ; and step 1.1 gives , because by the addition formulas and [F5]. Dividing by gives , that is ; the CAT(1) inequality fails at the pair by step 1.4 and [F3].
Combining steps 3.7 and 6.2 with the metric, compactness, completeness and local flatness of step 1.6 proves every assertion of (vi), and steps 3.1, 4.2, 4.3, 3.4, 3.5, 3.6, 4.1 and 6.1 prove (i) to (v).
Alexandrov comparison: straightening a hinge, gluing comparison triangles, and patchwork
Statement
(i) Alexandrov's Lemma. Let , let be for and for , and let be four distinct points of ; if assume . Suppose and lie on opposite sides of the geodesic line through and . Let and be the angles of the triangles and at and . If , then
(1) ;
(2) if is a triangle with vertices such that , and , and satisfies , then the angle of at , the angle of at and the distance satisfy , and ; equality in any one of the three assertions implies the others and holds if and only if .
(ii) Gluing Lemma for triangles. Let be a metric space in which every pair of points at distance is joined by a geodesic, and let be a geodesic triangle in of perimeter with distinct vertices. Let with , let be a geodesic, and put and . If for every defined vertex angle of a comparison triangle in is no smaller than the corresponding angle of , then the same is true for the angles of any comparison triangle for (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles).
(iii) Patchwork. Let be a metric space of curvature , let with , , and , let be a geodesic from to , and let , , be geodesics from to depending continuously on with and . Then the vertex angles of the triangle are no greater than the corresponding angles of any comparison triangle in . The same conclusion holds for a finite subdivision obtained by successive applications of (ii), provided each intermediate union is a geodesic triangle of perimeter and its common-side splitting point lies on the opposite geodesic side.
(iv) Upper-angle facts. For nonconstant geodesic segments with a common initial point, restricting either segment to any nonzero initial subsegment leaves their Alexandrov upper angle unchanged. The two opposite directions at an interior point of a geodesic have upper angle . For any three nonconstant geodesic segments with the same initial point, their upper angles satisfy .
Facts & Assumptions
Given: The models and with their metrics and geodesic lines, and the classes of geodesic triangles, as in Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles; the comparison angle of a length triple, the model angle of a model triangle, the Alexandrov upper angle between geodesics, and the angles of a geodesic triangle in a metric space, as in Comparison angles of hinges, model triangle angles, and the Alexandrov upper angle. In (ii) and (iii) a metric space as described there, together with the triangles, points and geodesics named in the Statement.
In and in the geodesics are the straight segments and the minimal great-circle arcs, the distance in is the round distance, and , (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles, Euclidean spheres and closed balls as subspaces of , as the set of functions , and , , are metrics on it).
The angle of a model triangle is the comparison angle of its three side lengths: for sides , and meeting at , in the angle at has , and in , when , it has ; in both models, for fixed the map and the inverse map are strictly increasing (Comparison angles of hinges, model triangle angles, and the Alexandrov upper angle, Principal inverse sine and inverse cosine, Signs, monotonicity intervals, and ranges of sine and cosine, Pi is the first positive zero of sine). The sine and cosine addition formulas hold (The addition formulas for sine and cosine).
Comparison triangles in and exist and are unique up to isometry for every triple of nonnegative side lengths satisfying the triangle inequalities, with the additional perimeter bound in ; a triangle of the model is a comparison triangle for itself; and for fixed two positive sides (both in ) the third side is a strictly increasing function of the included angle, by the cosine formulas in [F2] (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences).
is a metric space and satisfies the triangle inequality, and a geodesic segment is distance preserving with (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Geodesics and geodesic metric spaces).
Angles are the Alexandrov upper angles of Comparison angles of hinges, model triangle angles, and the Alexandrov upper angle. Restricting either geodesic to an initial nonzero subsegment preserves the angle because the defining infimum uses only arbitrarily short initial segments. Opposite halves of a geodesic have angle directly from their distance sum. The triangle inequality for these angles is proved in step 2.4; no angle additivity in a general metric space is assumed.
The square is compact (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); every open cover of it has a Lebesgue number (Every open cover of a compact metric space has a Lebesgue number: a such that every nonempty subset of diameter less than lies inside a single member of the cover). Continuity pulls a cover by local CAT charts back to an open cover of the square (Continuity of a map between metric spaces, at a point and globally, in the - form); every point of a space of curvature has a neighbourhood, with the induced metric, that is CAT() (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles).
Proof
Spherical size and orientation. The model comparison angles agree with geometric angles: on the sphere, the unit tangent towards at is , whose dot product with the analogous tangent towards is exactly the cosine formula in [F2]; the Euclidean assertion is the corresponding dot-product formula. Write , , , , and . For , gives , since ; every boundary edge is also , since its complementary path has length at least that edge. The polygonal loop lies in an open hemisphere: take points dividing its arclength into halves of length ; every point on either half satisfies , hence . In that hemisphere the projection , with , maps minor great-circle arcs to straight segments and preserves the side of each line and whether an interior angle is reflex. Because are on opposite sides of , the projected quadrilateral is simple. Its angles at are convex, and its angle at is reflex or straight because . Triangulating along shows that its angle at is convex and that lies in the closed triangle ; the same conclusions hold before projection. Thus . Moreover : otherwise , so , and (the original open hemisphere excludes antipodal ). A hemisphere contains the minor geodesic segments joining its points, since their unit vectors are normalized positive linear combinations; hence the hemisphere with pole contains the spherical triangle and , giving , equivalently , a contradiction. In the Euclidean case the same planar quadrilateral argument gives , and there is no size restriction.
A monotonicity lemma for a marked point. Let be a triangle in with , (with when ), , and angle at ; let satisfy with . Then is a strictly increasing function of : it is the third side of the model triangle with sides and meeting at the angle , so the claim is the strict monotonicity in the included angle from [F2], applied with the fixed positive sides . Consequently, if is a second such triangle with , , , and marked point with , having angle at , then by the strict monotonicity of the angle in the opposite side from [F2] (fixed sides ), hence .
Reduction to an interior splitting point in (ii). If or then one of has a repeated vertex, its comparison triangle degenerates to a segment, the hypothesis for that index is vacuous, and the claim reduces to the hypothesis for the other index; so assume , which makes all six side lengths of positive, since and the vertices of are distinct.
Local CAT angle comparison. For two unit-speed spherical rays meeting at angle , let their points at distances with have distance , and put . The cosine rule and addition formulas give . Factoring the left side yields . With for and , it follows that ; when , both sides are zero. Since , The limit of sin x divided by x at zero is one makes the ratio tend uniformly to as , with no restriction on . The Euclidean comparison cosine thus tends to . In a CAT(1) triangle, CAT comparison bounds distances of arbitrarily short initial side points by these spherical model distances, hence bounds their Euclidean comparison angles by the model Euclidean angles. Taking the defining upper limit proves that each actual upper angle is at most its spherical model angle. The Euclidean case is the same cosine argument with the model angle constant.
Local triangles for (iii). Apply a finite cover and the Lebesgue-number property of the compact square to the continuous map . Choose partitions so that the image of each closed small rectangle is contained in a CAT() ball of radius when , with its closure inside the corresponding local CAT chart. Such balls are geodesically convex: their intrinsic short geodesics are ambient minimizing segments, and distance from the center is convex in the Euclidean case and balls of radius are convex in the spherical case by comparison with the convex model ball [F3]. Thus all restrictions of the radial geodesics and the last-row base segments remain in , and the joining geodesics chosen there are ambient geodesics. Put and . For each strip take the triangle and, for , the two triangles and , choosing the horizontal and diagonal edges within the corresponding ball. Each of these triangles lies in its local CAT ball and has comparison angles dominating its angles: apply the CAT inequality to arbitrarily short initial side points and take the upper-angle definition; the required uniform two-variable model-angle limit is established in step 1.4. In the Euclidean case the comparison angle is constant on short initial subsegments; in the spherical case that limit transfers the same bound to the Euclidean upper-angle convention. Coincident vertices contribute no angle obligation; collinear comparison triangles have angles and the same limiting inequalities apply.
Straightening construction. Extend the segment beyond by length to . Step 1.1 gives in the spherical case, so this extension remains a minimal arc; in both models , , and .
Perimeter bounds. The perimeter of each of is at most the perimeter of , which is , so the comparison triangles exist by [F3]; moreover and by the reverse triangle inequality applied to the two ends of , so and ; in particular and , and the four boundary distances in (i) sum to the perimeter of , , as required.
Angle triangle inequality and the splitting point. For three geodesics issuing from , write for the upper angles between the first and middle, and middle and last. If their angle triangle inequality is automatic. Otherwise take , with . For sufficiently short endpoints at distances on the first and last geodesics, use the point at distance on the middle geodesic. This tends uniformly to zero with , and the definition of upper angle bounds the two distances to that point by the Euclidean sides for included angles . In the Euclidean triangle formed by rays at angles to their middle ray, that value of is the intersection of the middle ray with the side joining the endpoints; hence the sum of those two bounds is . The metric triangle inequality and the law of cosines show that the comparison angle between the first and last endpoints is at most . Taking the defining upper limit and then , proves the angle triangle inequality. At , the first and last segments are the opposite halves of , of angle , so the angles of there sum to at least ; their comparison angles therefore also sum to at least . At the same triangle inequality bounds the angle of by the sum of the two subtriangle angles.
The comparison step. In both models is the distance determined by the two sides and and the included angle at , while is determined by the same two sides and the included angle ; since gives , the strict monotonicity of the third side in the included angle from [F2] yields , with equality if and only if .
Proof of (1). By the triangle inequality and step 2.2, , and step 3.1 (together with ) gives , which is (1).
Proof of (2): the distance assertion. Let be as in the Statement and put . The triangle of steps 2.2 and 1.2 has , , , and its marked point has ; the triangle has , , , and its marked point has . Both satisfy the hypotheses of step 1.2 with the same and , the second with the larger opposite side, so , with equality if and only if , that is, if and only if by step 3.1.
Proof of (2): the angle at . The triangles and have two side lengths in common, and , and their third sides are and ; the angles and lie opposite those third sides, so the strict monotonicity of the angle in the opposite side from [F2] gives , with strict inequality exactly when .
Proof of (2): the angle at . By step 1.1 the angle between and is in both models. The triangles and have the same two adjacent sides ; their opposite sides are and . Since , the law of cosines and its strict monotonicity give . Equality holds exactly when , equivalently , equivalently . Together with steps 4.2 and 5.1 this proves all three comparisons and simultaneous equality.
Gluing and straightening. If one comparison triangle is collinear, use the closed cosine inequalities of (i), obtained from noncollinear model triangles by continuity of their side-length formulas; these inequalities remain valid when an included angle is or , and no continuity of angles in the metric space is being assumed. Glue and along their common side so that and lie on opposite sides of the line through and , which is possible because comparison triangles are unique up to isometry [F3]. In the glued configuration the four points are distinct, the points lie on opposite sides of the line through and , the angles at sum to at least by step 2.4, and the spherical perimeter hypothesis of clause (i) holds by step 2.3. Applying clause (i), whose clause (2) is established in steps 4.2, 5.1 and 6.1, with and then with and interchanged produces the comparison triangle of together with the point with , and clause (2) gives: the angles of at and at are at least the comparison angles of at ; the angle of at is at least the sum of those comparison angles at ; and , being the point at distance from on the side .
Conclusion of (ii). By step 7.1 the angles of the comparison triangle of at dominate the comparison angles of at those vertices, which dominate the angles of there by the hypothesis of (ii), and the angle of at dominates the sum of the comparison angles at , which dominates the angle of at ; hence every vertex angle of the comparison triangle is at least the corresponding angle of .
Assembling the strips. Starting with , glue along and then along . The splitting points are respectively and , so (ii) successively gives the angle comparisons for and . The perimeter of each such intermediate triangle is at most the full strip perimeter: bound its cross side by the remaining lengths on its two radial sides plus its final base side. The full strip perimeter is at most that of , by bounding both radial endpoint distances through the appropriate endpoints of the base. Thus every application has perimeter . Repeated or collinear triangles are removed or treated with the degenerate comparisons just described, and the same cosine inequalities extend to degenerate model triangles by continuity of the side-length formulas. Finally join the strips successively along ; now the splitting point is on the geodesic base and again each intermediate perimeter is at most the perimeter of . This proves (iii), and the last sentence follows by the same finite induction whenever its stated intermediate-triangle conditions hold.
Remarks
The spherical four-distance bound of Bridson–Haefliger I.2.16 is essential to the orientation argument: step 1.1 proves that it implies both the short straightening arc and . Patchwork requires the total perimeter bound of II.4.11, rather than three separate side bounds. The choices in the proof are finite; no Axiom of Choice is used.
Berestovskii's cone criterion and the polyhedral link criterion
Statement
(i) Berestovskii's theorem. Let be a metric space, let , and let be the Euclidean cone with the apex separately included and the metric , (The angular path metric, the Euclidean cone and spherical joins). Then is CAT(0) if and only if is CAT(1) (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles, Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences). With the convention , the empty link is CAT(1) vacuously and its cone is the one-point CAT(0) space, so the equivalence also covers .
(ii) Polyhedral link criterion. Let be a connected isometric polyhedral gluing with finitely many shapes and local finiteness, with its chain metric (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), let be a -dimensional face and let . Then is locally CAT(0) at if and only if the angular link , with its truncated metric, is CAT(1). A sufficiently small ball about is isometric to the ball of the same radius about in with the product metric (The cone and join metrics and the local product chart of a polyhedral gluing). In particular is locally CAT(0) if and only if the angular link of every vertex of is CAT(1).
Facts & Assumptions
Given: An angular link with its cone as in the Statement; in (ii) a connected isometric polyhedral gluing with finitely many shapes and local finiteness, a face and .
The truncated metric is a metric of diameter at most ; agrees with wherever the latter is ; every -triangle of perimeter has at most one side equal to and is intrinsic whenever it has none; the cone metric is a metric, its geodesics are the sector developments and, when , the path through the apex; is a geodesic space when is -geodesic; and the local product chart preserves intrinsic lengths (The cone and join metrics and the local product chart of a polyhedral gluing, The angular path metric, the Euclidean cone and spherical joins, Spherical Gram simplices and angular links of Euclidean faces, Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas).
Laws of cosines and angle conventions in and ; sine and cosine addition formulas (The addition formulas for sine and cosine, Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences, Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles).
A product of CAT(0) spaces with the square-sum metric is CAT(0), since the hinged inequality holds in each factor and adds; is CAT(0) (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences clause (iv)(c), as the set of functions , and , , are metrics on it, Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles).
At every point of a face , the local metric germ is the gluing of its incident tangent cones, with the normal face link independent of the relative interior point; the cone charts preserve lengths (The cone and join metrics and the local product chart of a polyhedral gluing, Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas).
Metric and geodesic vocabulary: unique geodesics in CAT(0) spaces, convexity of balls there, continuity of the metric, and the round sphere metric (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences clause (iv), Continuity of a map between metric spaces, at a point and globally, in the - form, Euclidean spheres and closed balls as subspaces of , Geodesics and geodesic metric spaces).
Proof
Cone geodesics and angular projections. The cone metric and the sector geodesics of [F1] apply to any truncated metric: their triangle-inequality proof uses only the triangle inequality and diameter bound of . A minimizing segment from the apex is radial: for a point on it, equality and the cone formula force when . On a minimizing cone segment from to , , a point satisfies equality in the triangle inequality. If and have sum greater than and , the strict cone triangle inequality proved in [F1] excludes equality. Otherwise develop the radii in the plane at angles : the Euclidean triangle inequality and the decreasing cosine give the cone triangle inequality, and equality forces the developed middle point onto the straight endpoint segment. If , equality also forces , and the segment avoids the apex; its polar angle varies continuously and monotonically from to (unless , when it is radial). The angular projection, parametrised by that angle, is a minimizing segment in : apply the same equality argument to every subsegment. If , the developed segment is a diameter, so every nonapex point has direction or and the segment is the through-apex path. Assume now is CAT(0). Its geodesics exist and are unique by [F5], so this argument gives existence of short angular segments; their uniqueness follows since two such segments would, by sector development, give two cone geodesics between the same positive-radius endpoints.
Forward comparison with the actual chord radii. Let a triangle of short angular segments in have perimeter , and choose its spherical comparison triangle . Take cone vertices , , and Euclidean vertices . Their pairwise distances agree by the cosine formula, so their affine plane is a Euclidean comparison triangle. If lies on an angular side, let be the point on the corresponding cone geodesic whose angular projection is , as supplied by step 1.1. Its radius is the radius of the point on the corresponding straight chord: both sectors have the same opening angle, endpoint radii and polar position. In particular and have the same side parameter; generally . For any two points on angular sides, use the corresponding chord points , and their comparison points. CAT(0) gives . Since , decreasing cosine on yields . With step 1.1 this proves CAT(1).
Reverse comparison, short angular perimeter. Assume is CAT(1). Short angular segments exist and are unique (the CAT(1) inequality on the degenerate triangle made from two competing short segments forces their equal-parameter points to coincide). Sector development and through-apex paths give cone geodesics, and step 1.1 classifies all of them. To prove CAT(0), use the squared vertex-to-side criterion of Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences (iv)(c). Fix a vertex , and a point at fraction of the side from to . If , the criterion is equality by the developed chord norm. If or , the side is radial and the same equality follows by expanding the cone formula. Otherwise put , and . For the side is radial and again equality holds. Suppose and write with angular position . In its developed sector, If , the spherical comparison inequality gives , since the comparison direction at position is . Expanding the cone formula therefore gives
Reverse comparison, large angular perimeter. Retain but suppose . Put , and , so . Since and , reflection and decreasing cosine on give ; the addition formulas consequently give on . Likewise on . In particular . If , sine interpolation on this interval (length ) gives because the coefficients are nonnegative and their sum is ; if use . The triangle inequality bounds . Thus on the two outer intervals its cosine is at least the corresponding cosine above, and on the middle interval it is at least . Hence everywhere, and the expansion in step 2.2 proves the same squared comparison inequality.
Reverse comparison, antipodal side. Suppose . Step 1.1 makes the side the through-apex path and the triangle inequality gives . Thus . If is on the branch, its radius is . The difference between the right side of the squared inequality in step 2.2 and is exactly , by expansion. On the branch it is . Both include the apex. Together with the preceding two paragraphs, this case covers every side and every vertex; the vertex-to-side criterion [F3] therefore proves CAT(0), completing the reverse implication.
Cone equivalence. Steps 1.1 and 2.1 prove the forward implication and steps 2.2, 3.1 and 4.1 the reverse implication, with the empty cone a single point. This proves (i) in full.
Local charts and cone dilation. Put . By [F1], a small ball at is isometric to a ball at in . If is CAT(0), its convex balls are CAT(0). Conversely if a ball about is CAT(0), the maps , , are bijective similarities of , since both coordinate metrics scale by . Any two points can be scaled into that ball, joined there and scaled back, so is geodesic; any chosen geodesic triangle is bounded and can likewise be scaled wholly into the ball, where its CAT(0) inequality holds, and scaled back. Thus local CAT(0) at the origin is equivalent to CAT(0) of . A square-sum product is CAT(0) when both factors are, by adding their squared vertex-to-side inequalities; conversely the slices of each factor are convex (a minimizing product segment with equal endpoints in one coordinate must keep that coordinate constant), so CAT(0) of the product implies CAT(0) of each factor. Since is CAT(0), (i) now proves that is locally CAT(0) at exactly when its normal face link is CAT(1).
Vertex reduction. Necessity follows from step 6.1 with . Conversely suppose every vertex link is CAT(1); then its entire cone is CAT(0) by step 5.1. For any point , choose a vertex of . In the tangent-cone gluing at , the ray representing the cell segment from to has a point at small positive radius. Its incident cells are exactly those containing : in every incident cell the relative interior of the ray is the relative interior of the tangent face corresponding to . The active facet inequalities at are therefore precisely those containing , the same as at , and their Euclidean linear parts and gluing maps agree. Thus the tangent-cone gluing at is isometric to that at . The finite-facet proof of the local chart [F4] applies equally to the finitely many incident polyhedral cones, so it identifies sufficiently small balls at both points with balls in this same tangent gluing (choose radii below the finitely many inactive facet distances, as in [F1]). Since the cone at is CAT(0), its small convex ball at is CAT(0), so the corresponding ball at is CAT(0). Hence is locally CAT(0) everywhere, proving the vertex form.
Remarks
- Comparison route. The reverse implication uses the squared vertex-to-side criterion and explicit sine interpolation; steps 3.1 and 4.1 supply the large-perimeter and antipodal cases directly. The forward implication uses the actual variable radii of chord points, and the local-to-global cone passage uses radial similarities.
- Source locator correction. The scaffold's locator "I.3.14–I.3.17, printed pp. 188–191" is a slip: chapter I.3 is "Length Spaces", while Berestovskii's theorem, the join corollary and the cone-over-a-circle example are II.3.14–II.3.17 at exactly those printed pages (the item cites them correctly). The source metadata and owning manifest use the corrected locations.
- Choice. No step of this proof selects from an infinite family; the cases and the gluing of finitely many comparison triangles are explicit.
Endpoint stability for local geodesics in complete locally CAT(0) spaces
Statement
Let be a complete metric space that is locally CAT(0) (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles), and let be a local geodesic. Then there is such that for every the closed ball is complete and convex, and for all with and there is exactly one local geodesic from to with convex. For this :
(i) for every , and (Length in a metric target: lower semicontinuity and arc-length reparametrization);
(ii) the assignment is continuous for the sup metric , which induces uniform convergence (Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on and on ): if and in then the corresponding local geodesics converge uniformly.
Facts & Assumptions
Given: A complete metric space that is locally CAT(0), and a local geodesic into it, with its constant-speed parametrization; write for its speed.
Locally CAT(0) means every point has a positive radius with CAT(0) in the induced metric; the induced metric on is a geodesic metric and is complete when is complete and finite, the ball being closed in (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles, Open ball, closed ball and sphere in a metric space, Complete metric space: every Cauchy sequence converges in the space, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
In a CAT(0) space geodesic segments are unique and vary continuously with their endpoints, and for geodesics with a common initial point and proportional parametrizations the distance function is convex: ; the midpoint inequality holds for every midpoint of a geodesic (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences clauses (iv)(a), (iv)(b) and (iv)(d)).
A compact subset of a metric space is covered by finitely many balls of any prescribed positive radius; a continuous image of a compact interval is compact; and a finite set of positive numbers has a positive minimum (Open cover, subcover, compact metric space, and compact subset of a metric space, 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 image of a compact metric space under a continuous map is compact, and so is the image of any compact subset).
Length: for a path the length is the supremum of its polygonal sums; it is lower semicontinuous under uniform convergence; the chord bound and the additivity hold (Length in a metric target: lower semicontinuity and arc-length reparametrization).
Continuity at a parameter gives a neighbourhood whose image lies in any prescribed ball about its image; satisfies the triangle inequality and the reverse triangle inequality (Continuity of a map between metric spaces, at a point and globally, in the - form, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, The reverse triangle inequality in any metric space).
A sequence in a metric space converges when its distances to the limit tend to , and uniform convergence of maps into is the metric-distance condition of Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on and on . For continuous maps on , is finite because is continuous and bounded on the compact interval; taking suprema in the metric triangle inequality makes a metric, and its convergence condition is exactly uniform convergence; a Cauchy sequence in a complete space converges (Convergence of a sequence in a metric space: iff in , Cauchy sequence in a metric space, Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on and on , Complete metric space: every Cauchy sequence converges in the space).
Proof
Convexity of balls in a CAT(0) space. Let be CAT(0), , and ; let be a midpoint of the unique geodesic . By [F2] the midpoint inequality gives , so ; iterating the same computation for the midpoints of and and so on, every dyadic point of lies in , and the dyadic points are dense in , so continuity of the geodesic [F2] puts all of in . Hence is convex.
A uniform radius. Consider all pairs with and CAT(0). Their open half-radius balls cover the compact image of , so [F3] supplies finitely many covering it, without choosing a radius at every point. Put . For every , some has , and , so . This ball is thus a ball in a CAT(0) space, hence complete (it is closed in the complete space ) and convex by step 1.1; in particular it is uniquely geodesic and has the convexity property [F2] for pairs of geodesics inside it.
Convexity tools. For geodesics in one CAT(0) chart, introduce the geodesic from to : the common-initial-point estimate of [F2], followed by the same estimate on reversed geodesics, gives . Apply this on every subinterval to obtain convexity of the distance function. A continuous locally convex real function on an interval is convex: on a sufficiently fine subdivision its consecutive secant slopes are nondecreasing by local convexity; summing the resulting inequalities gives the secant inequality for any three prescribed points. Consequently, for local geodesics satisfying , the function is convex: near each parameter both curves are geodesics in the ball of step 2.1. Their distance is thus bounded by interpolation of endpoint distances, and they coincide if their endpoints coincide. A local geodesic whose entire image lies in one CAT(0) chart equals that chart's geodesic between its endpoints, by the same local-convexity argument with endpoint distances zero.
Initial existence. Let mean that for every with and endpoints at distances from there is a constant-speed local geodesic with throughout. Take such that (any if ). Both endpoints then lie in ; its geodesic joins them. The restriction of lies in that ball, hence is its geodesic by step 3.1. Convex separation bounds the distance between these two geodesics by the maximum of their endpoint distances, which is . Thus holds.
Alternating-thirds construction. Suppose and ; set and . Put and . For , use on and to obtain from to and from to , and set , . Step 3.1 makes all these choices unique. Set . Convexity shows inductively that each entire curve is within of . It also gives and, for , and , since the evaluation points are halfway along their respective intervals and the other endpoints agree. Hence both increments at index are at most . Both sequences are Cauchy, and completeness gives limits in the closed -balls around .
Limits and overlap. Step 3.1 also gives and ; summing the geometric series yields uniform limits . To verify they are local geodesics, fix a parameter and a small interval on which and all these curves lie in one ball of step 2.1, using the strict margin and continuity of . Each restricted curve is the chart's geodesic by step 3.1; the endpoint estimate there shows the limit is that geodesic too. Their speeds on overlapping such intervals agree, so each limit has a single constant speed. On , the endpoints of and are , so step 3.1 identifies them on the overlap. Their union is a constant-speed local geodesic on (if the overlap is constant, both speeds are zero). Its separation from is locally convex and therefore convex, bounded by the endpoint maximum . This proves .
Existence and uniqueness. Iteration yields for all ; choose with to obtain on . Step 3.1 makes its separation from convex and gives . Conversely every candidate with convex separation has this bound, and step 3.1 identifies any two candidates with the same endpoints.
Length with one endpoint fixed. Suppose are two solutions in this tube with . For sufficiently small both initial restrictions are minimizing, so step 3.1 and the triangle inequality give . Divide by to obtain . Let be the solution from to given by step 6.1. Apply this inequality first to the reversed curves and then to : and . This is the asserted length bound.
Endpoint continuity. For solutions in the same tube, step 3.1 gives . When the endpoints converge the right side tends to zero, which proves uniform convergence and clause (ii).
The space of local geodesics, its length metric, and the covering criterion for local isometries
Statement
Let be a connected complete metric space that is locally CAT(0) and a length space (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles), let , and let be the set of constant-speed local geodesics with , together with the constant path at , carrying the sup metric (Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on and on ). Then:
(i) is complete; the truncation map , , is continuous and contracts to the constant path, so is contractible and simply connected (Nullhomotopic maps and contractible spaces, Simply connected topological spaces).
(ii) The endpoint evaluation , , is a local isometry: for every there is such that restricts to an isometry of the -ball about onto the -ball about in (Isometry, isometric embedding, and the subspace metric on a subset, Open ball, closed ball and sphere in a metric space).
(iii) Define to be the infimum of over continuous paths from to , where length is computed in the metric (Length in a metric target: lower semicontinuity and arc-length reparametrization). With this induced length metric, is a complete length space, induces the same topology as , and is a local isometry and a covering map (Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings); in particular is surjective and is a universal covering space of (Universal covering spaces).
(iv) Metric covering criterion. Let be a nonempty connected complete metric space, let be a connected locally uniquely geodesic metric space whose local geodesics vary continuously with their endpoints (on a sufficiently small convex neighbourhood of each point, the constant-speed segments depend continuously in the uniform metric on both endpoints), and let be a local isometry; then is a covering map. More precisely, is surjective, and every has a uniquely geodesic neighbourhood over which the fibres of are discrete and restricts to a homeomorphism on a disjoint family of open sheets.
Facts & Assumptions
Given: A connected complete locally CAT(0) length space , a point , and the space of constant-speed local geodesics from with the sup metric; in (iv) nonempty connected complete , connected locally uniquely geodesic with continuous local endpoint dependence and a local isometry .
Endpoint stability, with its uniform radius , uniqueness and convex-separation statements, continuity in the endpoints, and the length bound (Endpoint stability for local geodesics in complete locally CAT(0) spaces).
Closed balls contained in local CAT(0) charts are convex and complete when is complete; their interiors give convex uniquely geodesic open charts; short geodesics are unique in a CAT(0) space and vary continuously with their endpoints (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles, Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences clauses (iv)(a)–(iv)(b), Endpoint stability for local geodesics in complete locally CAT(0) spaces).
Path length is the supremum of polygonal sums, bounds endpoint distance and is additive under subdivision; a rectifiable continuous path has arbitrarily small length on sufficiently short terminal subintervals; the induced length metric used here is the infimum defined in Statement (iii) (Length in a metric target: lower semicontinuity and arc-length reparametrization).
Definitions of covering map, lift, path and homotopy lifting, endpoint invariance of lifted paths, uniqueness of lifts from a connected space, and triviality of connected coverings of a simply connected locally path-connected space; the universal covering space and its uniqueness and dominating property; simple connectivity and contractibility (Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings, Lifts of maps, paths, and homotopies through a covering map, Existence and uniqueness of path lifts through a covering map, Existence and uniqueness of homotopy lifts through a covering map, The endpoint of a lifted path depends only on its endpoint-fixed homotopy class, Two lifts from a connected space that agree at one point agree everywhere, A connected covering of a locally path-connected simply connected space is one-sheeted and trivial, Universal covering spaces, For a path-connected locally path-connected base, a universal cover maps uniquely over the base to every connected covering, and any two universal covers are uniquely isomorphic, Simply connected topological spaces, Nullhomotopic maps and contractible spaces).
Metric facts: convergence, Cauchy sequences, completeness, uniform convergence of metric-target maps (the finite sup metric on is verified below), continuity, compactness of , and the reverse triangle inequality (Convergence of a sequence in a metric space: iff in , Cauchy sequence in a metric space, Complete metric space: every Cauchy sequence converges in the space, Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on and on , Continuity of a map between metric spaces, at a point and globally, in the - form, 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 reverse triangle inequality in any metric space).
Proof
Completeness of the sup metric. For , , so the supremum defining is finite; separation and symmetry follow pointwise, and taking suprema in the pointwise triangle inequality proves its triangle inequality. Convergence in is exactly uniform convergence. Let be uniformly Cauchy. Completeness of gives a uniform continuous limit with . Near any parameter, choose a closed CAT(0) ball centred at and a nontrivial parameter interval on which lies strictly inside that ball. Uniform convergence puts every sufficiently late on this interval inside the same ball. Each restricted is that chart's geodesic, by the local-convexity argument proved in [F1]. Therefore throughout that interval. Fix two distinct parameters there: their converging chord lengths show that has a finite limit . Passing the distance equality to the limit on each such interval gives locally with the same throughout. Thus , and it is the sup-metric limit.
Contraction. Truncations belong to , including the constant path at , and . This proves joint continuity at each , and is constant while . This contraction shows contractibility directly: for every continuous map , composition is a homotopy from a constant to . For a loop based at any , put and . The loops , using three equal parameter pieces, form a continuous based homotopy from with constant pauses to with a constant middle piece. Pauses are removed by linear reparametrization, and the latter retracing loop contracts by replacing with , , on both halves. Every basepoint therefore has trivial fundamental group; the truncation paths also give path connectedness. Thus is simply connected without a change-of-basepoint theorem.
The evaluation chart. Fix and an endpoint-stability radius . Shrink to a radius such that every is contained in a CAT(0) chart: the preimages under of all open half-radius balls with CAT(0) cover , so compactness gives finitely many such balls, and suffices. For any two local geodesics with , their restrictions near each parameter lie in one of these charts. The common-initial-point estimate in [F2], applied also to reversed segments through an intermediate geodesic, gives convexity of locally and hence globally, as in [F1]. Each endpoint with has the solution from [F1]; convex separation from gives . Conversely a local geodesic with has convex separation from , so [F1] identifies it with . Pairwise convexity now gives ; at this yields . Thus evaluation is an isometry between the open -balls. The same argument identifies each smaller closed ball, whose endpoints are still within .
A covering criterion with continuous radial geodesics. First consider a nonempty complete connected locally geodesic metric space , a connected locally uniquely geodesic metric space whose local geodesics depend continuously on endpoints, and a local isometry . Any finite-length path in has a unique lift from a prescribed initial point of its fibre: inverse charts give the lift until its supremal parameter, and preservation of length makes the lifted tail Cauchy, so completeness and one more inverse chart extend it. Uniqueness follows because two lifts agreeing at a parameter agree near it, and the agreement set is closed. Any two points of can be joined by a finite concatenation of short geodesics: the set reachable from a fixed point and its complement are open, hence connectedness makes the former all of . Choose ; lifting such paths from proves surjectivity. Choose an open uniquely geodesic ball at . For each lift its radial geodesics and denote their endpoints by . These endpoints depend continuously on : cover each fixed lifted radial path by finitely many inverse charts and subdivide its parameter; continuity of the radial paths keeps nearby radial paths in the same chart images, and successive inverse charts prove uniform continuity of their lifts near the fixed path. Thus is continuous and . Near each , continuity and the inverse chart show that equals the local inverse of , so its image is open. Distinct sections have disjoint images, since lifting the reversed radial path from a common endpoint would give the same starting fibre point. Every point over lies in a section, by lifting that reversed path first. These sections are precisely the required evenly covered sheets.
The length metric. For , , so the contraction supplies finite-length paths to the constant path and is finite. Path reversal and concatenation give symmetry and the triangle inequality for ; the chord bound gives , hence separation. In an evaluation chart, join sufficiently close endpoints by the geodesic in a smaller convex CAT(0) ball. Its inverse chart path has the same length, and hence for pairs in a sufficiently small concentric ball. The metrics thus have the same topology. For any rectifiable continuous path in , the definition gives ; summing over partitions and using yields . Taking the infimum over these paths proves that is a length metric. A -Cauchy sequence has a -limit by step 1.1; eventually it and its limit lie in such a smaller ball, where equality implies convergence also in . Therefore is complete and evaluation remains a local isometry.
Application to (i)–(iii). Apply step 1.4 to and : steps 1.3 and 2.1 supply local geodesicity, completeness and the local isometry, and has convex CAT(0) balls with continuously varying geodesics by [F2]. The contraction in step 1.2 makes connected and simply connected. Evaluation is therefore a surjective covering and a universal covering. This proves (i)–(iii) without invoking the stronger clause (iv).
General criterion (iv). A local isometry from to identifies a neighbourhood of each point of with a neighbourhood in . Shrinking further to a convex geodesic neighbourhood in makes locally geodesic, so step 1.4 applies directly to the hypotheses of (iv). Its radial sections prove precisely the asserted surjectivity, discreteness of fibres and open disjoint sheets, without requiring either ambient metric to be a global length metric.
Remarks
- Source hypothesis. Clause (iv) includes continuous local dependence of geodesics, as required in Bridson–Haefliger I.3.28(4). Local unique geodesicity alone does not supply that condition in the present proof. The local CAT(0) application supplies it by endpoint convexity, so clauses (i)–(iii) use the criterion with all hypotheses checked.
Complete, simply connected, locally CAT(0) length spaces are CAT(0)
Statement
Let be a connected complete metric space that is locally CAT(0) and a length space, and suppose is simply connected (Simply connected topological spaces, Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles). Then:
(i) For every the endpoint evaluation of The space of local geodesics, its length metric, and the covering criterion for local isometries is a covering map and a homeomorphism, and every two points of are joined by exactly one local geodesic, which is a minimizing geodesic (Geodesics and geodesic metric spaces).
(ii) Every geodesic triangle in satisfies the CAT(0) inequality; hence is CAT(0).
(iii) For every the geodesic contraction , where is the point at distance from on the unique geodesic from to , is continuous and satisfies for all and ; in particular is contractible.
Facts & Assumptions
Given: A connected complete locally CAT(0) length space that is simply connected, a point , the space of constant-speed local geodesics from , and the endpoint evaluation .
is a covering map with simply connected total space; the covering is local-isometric for the induced length metric (The space of local geodesics, its length metric, and the covering criterion for local isometries).
Every connected covering of a locally path-connected simply connected space is one-sheeted and isomorphic to the identity covering; a universal cover admits a unique based map over the base to every connected covering (A connected covering of a locally path-connected simply connected space is one-sheeted and trivial, For a path-connected locally path-connected base, a universal cover maps uniquely over the base to every connected covering, and any two universal covers are uniquely isomorphic, Universal covering spaces, Maps and isomorphisms of covering spaces over a fixed base).
Endpoint stability provides, along a local geodesic, a uniform radius on which perturbations have unique local geodesics with convex separation, continuous dependence, and the length bound (Endpoint stability for local geodesics in complete locally CAT(0) spaces).
Patchwork: in a space of curvature the vertex angles of a geodesic triangle swept by a continuous family of geodesics are no greater than the angles of any comparison triangle; and the vertex-opposite-side criterion of the CAT(0) inequality, together with the convexity of the distance function between geodesics with a common initial point and proportional parametrizations, holds in a CAT(0) space (Alexandrov comparison: straightening a hinge, gluing comparison triangles, and patchwork clauses (i)–(iii), Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences clauses (iv)(b)–(iv)(c), Comparison angles of hinges, model triangle angles, and the Alexandrov upper angle).
Definitions of simply connected, path connected, contractible and the fundamental group; geodesics and length; completeness and the metric axioms (Simply connected topological spaces, Paths, path-connected spaces and path components, Nullhomotopic maps and contractible spaces, Based loops and the fundamental group, Geodesics and geodesic metric spaces, Complete metric space: every Cauchy sequence converges in the space, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
Proof
The covering is trivial. By [F1] is a covering with simply connected total space; is connected, complete and locally CAT(0), hence locally path-connected and path-connected, so [F2] applies and every connected covering of is one-sheeted; in particular is a homeomorphism.
Uniqueness of local geodesics between two points. Since is a bijection, for every there is exactly one constant-speed local geodesic from to ; applying the same argument with replaced by an arbitrary point (the hypotheses are invariant under the change of base point) gives exactly one constant-speed local geodesic from to for every pair .
Minimization by finite subdivision. Let be any rectifiable path from to , and denote the unique local geodesic from to by , parametrized on . For each , [F3] gives a neighbourhood of and endpoint-stability solutions based on ; uniqueness in step 2.1 identifies these with for all sufficiently nearby . On such a parameter neighbourhood the fixed-initial-point length estimate proved in [F3] gives for any two parameters there: both solutions lie in the same tube, so the estimate applies in both directions. Finitely many such parameter neighbourhoods cover ; subdivide so that each consecutive pair belongs to one neighbourhood (a positive subdivision size exists by compactness). Summing gives . Here is constant. Thus for every rectifiable path. Since is a length space, taking the infimum gives , and the reverse inequality is the chord bound. This proves minimization without a mesh-error assertion.
Continuous dependence. By [F3] the unique local geodesics vary continuously with their endpoints, so the minimizing geodesic from to depends continuously on .
Verification of the patchwork hypotheses. Consider a triangle with vertices and let parametrize . The unique geodesics from to form a continuous sweep by step 4.1; evaluation is continuous, since uniform convergence controls evaluation and each fixed geodesic is continuous. Every image point has a closed induced-metric CAT(0) ball by local CAT(0). A smaller concentric ball is convex by the midpoint inequality [F4], hence again CAT(0); its interior is a neighbourhood of . The compact sweep image is covered by finitely many such interiors, and their preimages admit a positive subdivision size on the compact parameter square, so each rectangle in a sufficiently fine grid is contained in one of these CAT(0) balls. These are exactly the local-chart hypotheses of patchwork [F4]. The side and perimeter restrictions are automatic for , since . If the triangle has distinct vertices and no vertex lies on the opposite side, patchwork therefore proves domination of all its vertex angles. If a vertex lies on the opposite side, uniqueness identifies all three sides with subsegments of a single geodesic; comparison is then equality in a degenerate Euclidean segment. Repeated vertices are handled the same way.
Vertex-to-side comparison. Let be an interior point of in a nondegenerate triangle and join to by the unique geodesic. By step 5.1 the comparison angles of and dominate their actual angles. At these two actual angles have sum at least : take points on the opposite base germs at equal small distance from and on the germ toward at small distance . In a CAT(0) chart the midpoint inequality gives . The Euclidean cosine rule therefore gives , hence the sum of these two comparison angles is at least . In every sufficiently small neighbourhood the supremum defining each upper angle is at least its corresponding angle here; taking the infimum over neighbourhood sizes preserves the sum bound. Glue their Euclidean comparison triangles along the comparison side , placing the base vertices on opposite sides. Alexandrov's straightening inequality F4(2) gives in the comparison triangle of , with at the same distance from along its base. If one subtriangle degenerates, the same inequality follows by continuity of the Euclidean straightening inequality in its side lengths, or directly by its collinear equality case. At the endpoints comparison is equality. Thus every vertex-to-opposite-side comparison holds; the vertex-to-side criterion of [F4] now gives the full CAT(0) inequality.
Conclusion of (iii). Let be the point at distance from on the unique geodesic from to , which exists and is unique by steps 2.1–3.1; then is continuous by step 4.1, is constant and is the identity. For the geodesics from to and from to have the common initial point and proportional parametrizations, so the convexity clause [F4] gives . For every continuous map , the map is a homotopy from to the constant , so is contractible in the convention of [F5].
Compact geodesic locally CAT(1) spaces are CAT(1) exactly when they contain no short circle
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be a metric space that is compact, geodesic and locally CAT(1) (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). Then:
(i) is CAT(1) if and only if contains no isometrically embedded circle of length (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences clause (vi)).
(ii) If is not CAT(1), then there is an isometrically embedded circle in of length , where is the supremum of the numbers such that every pair of points at distance is joined by a unique geodesic segment; in particular .
(iii) Comparison below a uniqueness threshold. Let . If every pair of points of at distance is joined by a unique geodesic, then every geodesic triangle of perimeter satisfies the spherical CAT(1) comparison inequality for all pairs of points on its sides: for the corresponding points of its spherical comparison triangle (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles).
Facts & Assumptions
Given: AC, a compact geodesic locally CAT(1) metric space , and the injectivity radius defined in the Statement.
The spherical model, its comparison triangles, spherical cosine rule, and the CAT(1) circle criterion are proved in Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences clauses (ii), (iii), (vi); CAT inequalities and geodesic segments have the definitions Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles, Geodesics and geodesic metric spaces, and isometric subspaces have their induced distances (Isometry, isometric embedding, and the subspace metric on a subset).
Compact metric spaces are complete and totally bounded and sequentially compact; AC gives a uniformly convergent subsequence of every equicontinuous pointwise bounded sequence of continuous maps from a nonempty compact metric space to a proper metric space (A compact metric space is complete and totally bounded, and neither implication uses any choice principle, For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice, 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, The Axiom of Choice, Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on and on ). A compact metric target is proper, because its closed balls are closed subsets and therefore compact (A closed subset of a compact metric space is compact). The interval is compact (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 patchwork sweep gives vertex angle comparison for a triangle of perimeter when its geodesics from one vertex to the opposite side depend continuously on the side point; Alexandrov's straightening gives the comparison distance to a marked splitting point, including the limiting collinear configurations. Angles satisfy the triangle inequality, and the angle between the two directions of a geodesic is (Alexandrov comparison: straightening a hinge, gluing comparison triangles, and patchwork clauses (i), (iii), (iv) and its closed model-comparison argument; Comparison angles of hinges, model triangle angles, and the Alexandrov upper angle).
Metric distances obey the triangle and reverse triangle inequalities (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, The reverse triangle inequality in any metric space). The sine and cosine addition formulas hold; sine is positive on and cosine strictly decreases on (The addition formulas for sine and cosine, Signs, monotonicity intervals, and ranges of sine and cosine, Pi is the first positive zero of sine).
Proof
A short circle obstructs CAT(1). An isometric copy of , , has geodesic triangle sides that remain geodesics in , with exactly the same side and cross distances. The circle's failed CAT(1) test in [F1] is therefore a failed test in . This proves the forward implication of (i). Empty and one-point spaces are CAT(1) and contain no circle; henceforth the non-CAT(1) case is nonempty.
A positive uniform uniqueness radius. Consider the family of all CAT(1) closed balls with radii ; their open half-radius balls cover . Shrinking is legitimate: balls of radius in a CAT(1) chart are convex, since each center-and-endpoints triangle has perimeter and its spherical comparison stays in the model ball. The open half-radius balls cover ; take finitely many, with radii , and put . If and lies in the th half-ball, every geodesic from to lies in its full ball, since each of its points is within of . Any two such geodesics coincide by the CAT(1) test on their digon with a zero third side, whose perimeter is . Thus .
Continuity under short uniqueness. Suppose and all pairs at distance have unique geodesics. If endpoints converge to with , parametrize their geodesics on . Their speeds are bounded, hence they are equicontinuous into compact . By [F2] every subsequence has a uniformly convergent further subsequence; the distance equality passes to the limit by [F4], making that limit the unique geodesic from to . The entire sequence converges uniformly: failure would give a subsequence uniformly separated from that geodesic and contradict its convergent further subsequence. This proves endpoint continuity in the uniform metric. AC is used through the Ascoli corollary.
Angle comparison below the uniqueness threshold. For a triangle of perimeter , every side has length . For any point of the side opposite , the two boundary routes give . Step 1.3 supplies a continuous sweep of the unique geodesics . If is off that side, patchwork [F3] gives angle comparison. If lies on that side, uniqueness makes all sides the corresponding subsegments and the triangle is isometric to its collinear comparison. Thus every triangle of perimeter has vertex angle comparison.
Comparison at scale and the compact uniqueness criterion. Under the hypothesis of (iii), use step 2.1 with that . For a point interior to the side of a triangle of perimeter , the two triangles and have perimeter at most . Their actual angles at have sum at least by [F3], and therefore so do their comparison angles. Glue their models along the common side on opposite sides; the four boundary lengths sum to . Alexandrov's marked-point comparison [F3] then gives in the comparison triangle of . Collinear submodels follow by the closed limiting cosine inequalities; or on the opposite side is already trivial by uniqueness. This proves every vertex-to-opposite-side inequality. It implies all-pair comparison as follows. For , , first apply it in to obtain ; then apply it in to obtain . These subtriangles have perimeter at most the original perimeter. The spherical cosine rule shows that the second inequality bounds the model angle at in by the original model angle at , and the first then bounds by : for fixed two positive sides , the opposite side increases with the included angle because both sines are positive. Zero sides and coinciding points give equality directly. This proves (iii); the sweep, both split triangles and both all-pair subtriangles stay within the same perimeter bound . Taking proves that short uniqueness makes CAT(1). Conversely CAT(1) implies uniqueness below by its digon test. We have proved, rather than assumed, the compact short-uniqueness criterion.
The first failure is below . Suppose is not CAT(1). Step 3.1 gives two distinct geodesics between points of distance . Uniqueness cannot hold at any radius greater than , so . For every pair at distance , uniqueness holds: choose a radius in the defining set strictly greater than that distance, using the definition of supremum. In particular steps 1.3 and 2.1 apply with .
A limiting minimizing digon. For each positive integer choose a pair of distinct geodesics with common endpoints and length , where tends to zero and ; such a pair exists by the definition of , and . This countable selection uses AC. Parametrize both sides on ; they are uniformly Lipschitz with speeds . Apply [F2] to the first sides and then to the corresponding second sides to obtain simultaneous uniform limits and limits of the endpoints. Passing the distance equalities to the limit shows that both are geodesics from to of length .
Explicit noncollapse of the digons. Suppose . Their midpoints then have distance . Put . For large , ; thus each triangle and has perimeter and angle comparison by steps 2.1 and 4.1. If , its comparison angle at satisfies , so . But the two actual angles at sum to at least , because is interior to a geodesic and [F3] applies; comparison bounds their sum by , a contradiction. Consequently . Since for large , uniqueness identifies both halves through the common midpoint, contradicting the distinctness of the original digon sides. Therefore .
Opposite points have distance . Use arclength parameters on and take , with . If or their distance is . Otherwise and by the two routes through . Suppose . If , the endpoint segments all have lengths and uniqueness makes both digon sides coincide, a contradiction. If , both triangles , have perimeter , hence angle comparison. Their model angles at satisfy . The reverse triangle inequality gives . If , the displayed quantity is positive, whereas (the actual angle sum is at least ) would give . Thus . If , the equality puts on a geodesic from to ; that geodesic is unique since , so lies on . The unique segments from and to (of lengths ) are then the corresponding subsegments of both sides, making . If , interchange the sides. This contradiction proves .
All circle distances, and conclusion. For arbitrary let be opposite . Step 7.1 and the reverse triangle inequality give ; the two routes through give the reverse bound. Distances on either single side already equal parameter differences. Thus traversing and then backwards gives an isometry : the distance formula also excludes every additional identification. Since , this proves (ii); together with step 1.1 it proves (i).
Remarks
The proof includes the compact uniqueness criterion of Bridson–Haefliger II.4.12. The two collapse arguments in II.4.16 are written here as spherical cosine computations; each tested triangle has its perimeter explicitly bounded by . AC is used for the near-minimal sequence and the Ascoli extractions, including the continuity argument.
5 · Examples, counterexamples and false statements
None yet.