Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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

CAT Comparison, Link Criteria, and Local Globalization

1 · Prerequisites

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 2π. 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

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

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. E2 is R2 with the Euclidean metric d2 (Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it). The comparison sphere is S2⊂R3 with the round metric dS(x,y):=arccos⁡(x⋅y) (Spherical Gram simplices and angular links of Euclidean faces, Principal inverse sine and inverse cosine); more generally dS(x,y):=arccos⁡(x⋅y) is defined on every sphere Sn−1 (Euclidean spheres and closed balls as subspaces of Rn).

(2) Geodesic triangles and comparison. A geodesic triangle in a metric space X consists of three points p,q,r∈X and a choice of geodesic segments [p,q], [q,r], [r,p] joining them (Geodesics and geodesic metric spaces); its perimeter is d(p,q)+d(q,r)+d(r,p). A comparison triangle for it in E2, or in S2 when its perimeter is <2π, is a triangle (pˉ,qˉ,rˉ) 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 x on a specified chosen side, the comparison point xˉ 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 X is CAT(0) if it is geodesic and for every geodesic triangle in X and all points x,y of that triangle, d(x,y)≤d2(xˉ,yˉ). It is CAT(1) if every pair of points of X at distance <D1:=π is joined by a geodesic segment in X, and every geodesic triangle in X of perimeter <2π satisfies d(x,y)≤dS(xˉ,yˉ) for all points x,y of the triangle. Thus for CAT(1) only triangles of perimeter <2π are tested, and geodesic segments are demanded only for pairs at distance <π; a triangle of perimeter <2π has all sides <π, so its sides are available by hypothesis. A metric space is locally CAT(0), equivalently of curvature ≤0, if every point has a closed ball Bˉ(x,r), r>0, such that the induced metric on Bˉ(x,r) is CAT(0); locally CAT(1) is defined in the same way.

(4) Truncated angular metrics on links. Let F be a face of an isometric polyhedral gluing with its chain metric (Abstract isometric polyhedral gluings and the chain metric) and let L:=Lk⁡X(F) be its angular link with the auxiliary extended componentwise path metric dpath and the finite angular metric dπ:=min⁡{π,dpath} (The angular path metric, the Euclidean cone and spherical joins, Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas). Then every dπ-triangle of perimeter <2π has all sides <π: if one side were π, the triangle inequality would make the perimeter at least 2π. Thus its vertices lie in one intrinsic component of L, 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 (L,dπ) of perimeter <2π 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 C(∅)={o} and L∗∅=L (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 I⊆R be an interval. A map c:I→X is a constant-speed local geodesic if there is a fixed λ≥0 such that for every t∈I some ε>0 satisfies d(c(t′),c(t′′))=λ∣t′−t′′∣ whenever t′,t′′∈(t−ε,t+ε)∩I. Here λ is its speed; λ=1 is the unit-speed convention and λ=0 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 t′,t′′∈I.

(6) Length. A continuous path γ:[a,b]→X has length L(γ)∈[0,∞], the supremum of its polygonal sums, and is rectifiable if L(γ)<∞ (Length in a metric target: lower semicontinuity and arc-length reparametrization, Upper bound, least upper bound, and strict upper bound). X is a length space if for all x,y∈X and every ε>0 there is a path from x to y of length <d(x,y)+ε.

(7) Round circles. For ℓ>0 let Sℓ1:=R/ℓZ be the circle of circumference ℓ, with dℓ(x,y):=min⁡{∣x−y+kℓ∣:k∈Z}; for ℓ=2π this is the unit circle. An isometrically embedded circle of length ℓ in a metric space X is an isometric embedding Sℓ1→X (Isometry, isometric embedding, and the subspace metric on a subset); its image is a subset of X isometric to (Sℓ1,dℓ).

Remarks

The definition asserts no property of the objects it names beyond the conventions recorded. The metric axioms for dS and dℓ, 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 E2 and S2 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.

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

Comparison angles of hinges, model triangle angles, and the Alexandrov upper angle

Definition

(1) Comparison angle of a length triple. For real lengths b,c>0 and a≥0 satisfying ∣b−c∣≤a≤b+c, define θE(a;b,c):=arccos⁡ ⁣(b2+c2−a22bc). This is a number in [0,π] (Principal inverse sine and inverse cosine): the two assumed length inequalities give (b−c)2≤a2≤(b+c)2, hence −2bc≤b2+c2−a2≤2bc. For spherical adjacent lengths b,c∈(0,π) and an opposite length a≥0, put zS(a;b,c):=cos⁡a−cos⁡bcos⁡csin⁡bsin⁡c. The denominator is positive (Pi is the first positive zero of sine). Whenever zS(a;b,c)∈[−1,1], define the spherical comparison angle by θS(a;b,c):=arccos⁡zS(a;b,c)∈[0,π]. No spherical angle is assigned by this definition when that validity condition fails. In either model the notation chooses the unique angle in [0,π] having the indicated cosine.

(2) Comparison angle of a metric hinge. In a metric space (X,d) (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric), let p,x,y∈X with x≠p and y≠p; x=y is allowed. The Euclidean comparison angle at p is ∠~p(x,y):=θE(d(x,y);d(p,x),d(p,y)). Its length triple meets (1): the metric triangle inequality gives d(x,y)≤d(p,x)+d(p,y) and, applied with each of x,y as the middle point, ∣d(p,x)−d(p,y)∣≤d(x,y).

(3) Alexandrov upper angle. Let c:[0,L]→X and c′:[0,L′]→X be unit-speed geodesic segments with L,L′>0 and c(0)=c′(0) (Geodesics and geodesic metric spaces). For ε>0 set H(ε):=sup⁡{∠~c(0)(c(s),c′(t)):0<s≤min⁡(ε,L), 0<t≤min⁡(ε,L′)}, and define their Alexandrov upper angle by ∠(c,c′):=inf⁡ε>0H(ε). Each set in the supremum is nonempty and contained in [0,π], so its supremum exists and also lies in [0,π] (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 ∠(c,c′)∈[0,π] is well defined. This is the two-variable upper-limit convention, without asserting existence of an ordinary limit, monotonicity of the comparison angles in s,t, 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 Mκ2, κ∈{0,1}, 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 (0,π) 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.

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

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 a,b,c≥0 with a≤b+c, b≤c+a, c≤a+b there are pˉ,qˉ,rˉ∈E2 with the three prescribed distances, and any two such triangles are related by an isometry of E2 (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 E2, and the plane is CAT(0): for a triangle in E2 the comparison triangle is congruent to it and the defining inequality is an equality.

(ii) The round sphere. For n≥2 the function dS(x,y)=arccos⁡(x⋅y) is a metric on Sn−1⊂Rn; (Sn−1,dS) 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 <π/2 is convex (Open ball, closed ball and sphere in a metric space). For every triple of side lengths with perimeter <2π satisfying the triangle inequalities there is a comparison triangle in S2, unique up to an isometry of S2. Hence S2 is CAT(1), the CAT(1) inequality for a triangle in S2 of perimeter <2π being an equality.

(iii) Spherical cosine rule and midpoint identity. For A,B,C∈S2 with a=dS(B,C),b=dS(C,A)∈(0,π), c=dS(A,B)<π and vertex angle γ at C, cos⁡c=cos⁡acos⁡b+sin⁡asin⁡bcos⁡γ. If c<π, a is the midpoint of a geodesic [y,z] of length c and x∈S2, then cos⁡dS(x,a)=cos⁡dS(x,y)+cos⁡dS(x,z)2cos⁡(c/2),cos⁡(c/2)>0.

(iv) Consequences of CAT(0). Let X 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 d(γ(t),δ(t))≤(1−t)d(γ(0),δ(0))+t d(γ(1),δ(1)) for t∈[0,1]; (c) (hinged criterion) for a geodesic triangle with vertices z,x,y and the point pt on [x,y] at distance t d(x,y) from x, the CAT(0) inequality d(z,pt)≤d2(zˉ,pˉt) holds if and only if d(z,pt)2≤(1−t)d(z,x)2+t d(z,y)2−t(1−t)d(x,y)2, 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 x on a side the comparison inequality d(p,x)≤d2(pˉ,xˉ) with the opposite vertex p holds; (d) for every pair y,y′, every midpoint m of a geodesic segment [y,y′] and every z, d(z,m)2≤12(d(z,y)2+d(z,y′)2)−14d(y,y′)2.

(v) CAT(1) short-geodesic estimates. Let X be CAT(1), p∈X, 0<r<π/2 and x,y,z∈B(p,r). Then B(p,r) is convex, [y,z] is unique with midpoint a, and, whenever the CAT(1) test is admissible, i.e. d(x,y)+d(y,z)+d(z,x)<2π, cos⁡d(x,a)≥cos⁡d(x,y)+cos⁡d(x,z)2cos⁡(d(y,z)/2), where d(y,z)≤2r<π makes the denominator positive. The admissibility bound is a hypothesis and not a consequence of r<π/2: a triple in such a ball has perimeter <6r only, and the CAT(1) inequality is stated for triangles of perimeter <2π.

(vi) The round circle. For every ℓ>0, dℓ is a metric on Sℓ1 (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles); (Sℓ1,dℓ) is a compact complete geodesic space locally isometric to R, contains an isometrically embedded circle of length ℓ, and is CAT(1) if and only if ℓ≥2π. For ℓ<2π the points 0,ℓ/3,2ℓ/3 form a triangle of perimeter ℓ<2π whose side midpoint is at distance ℓ/2 from the opposite vertex, which exceeds the distance in the spherical comparison triangle; for ℓ≥2π every triangle of perimeter <2π 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 E2 and Sn−1 with the metrics d2 and dS(x,y)=arccos⁡(x⋅y), geodesic triangles with their comparison triangles and comparison points, the CAT(0) and CAT(1) classes, and the circles (Sℓ1,dℓ).

[F1]

The Euclidean plane, the round sphere, the CAT(0) and CAT(1) inequalities with their perimeter restriction, and the round circle Sℓ1=R/ℓZ with dℓ(x,y)=min⁡{∣x−y+kℓ∣:k∈Z} are those fixed in Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles.

[F2]

arccos⁡:[−1,1]→[0,π] is the inverse of the restriction of cos⁡ to [0,π], so cos⁡(arccos⁡y)=y for y∈[−1,1] (Principal inverse sine and inverse cosine).

[F3]

Cosine is strictly decreasing on [2mπ,(2m+1)π] and sine is strictly increasing on [−π/2+2mπ,π/2+2mπ]; both have range [−1,1] (Signs, monotonicity intervals, and ranges of sine and cosine).

[F4]

cos⁡(x+y)=cos⁡xcos⁡y−sin⁡xsin⁡y and sin⁡(x+y)=sin⁡xcos⁡y+cos⁡xsin⁡y for all real x,y (The addition formulas for sine and cosine).

[F5]

sin⁡π=0 and sin⁡x>0 for 0<x<π; in particular π is a positive real (Pi is the first positive zero of sine).

[F6]

∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality if and only if x,y are linearly dependent (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[F7]

For n≥1 the Euclidean metric d2(x,y)=∑k<n(xk−yk)2 is a metric on Rn (Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it).

[F8]

Sn−1:=S2(0,1)={x∈Rn:∥x∥2=1} is the unit sphere centred at the origin (Euclidean spheres and closed balls as subspaces of Rn).

[F9]

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).

[F10]
[F12]

A geodesic segment from x to y is a map γ:[0,ℓ]→X with γ(0)=x, γ(ℓ)=y and d(γ(s),γ(t))=∣s−t∣; then ℓ=d(x,y) (Geodesics and geodesic metric spaces).

[F13]

The reciprocal Archimedean property For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε gives an integer bound above every positive real, by applying it to the reciprocal of that real.

Proof

1.1F3F4F5algebra

The series of Sine and cosine defined by their real power series contain only even powers of t in cos⁡t and only odd powers in sin⁡t, so cos⁡(−t)=cos⁡t, sin⁡(−t)=−sin⁡t, cos⁡0=1 and sin⁡0=0; replacing y by −y in [F4] therefore gives cos⁡(x−y)=cos⁡xcos⁡y+sin⁡xsin⁡y and sin⁡(x−y)=sin⁡xcos⁡y−cos⁡xsin⁡y, and the case x=y=t of the cosine subtraction formula gives the Pythagorean identity cos⁡2t+sin⁡2t=cos⁡0=1, whence cos⁡2t=2cos⁡2t−1. Since sin⁡π=0 by [F5], cos⁡2π=1; cos⁡ is strictly decreasing on [0,π] by [F3] with cos⁡0=1, so cos⁡π<1 and hence cos⁡π=−1; then 0=cos⁡π+1=2cos⁡2(π/2) gives cos⁡(π/2)=0, and strict decrease gives cos⁡t>0 for 0≤t<π/2.

1.2F7algebra

Let a,b,c>0 satisfy the three triangle inequalities and put t:=(b2+c2−a2)/(2b) and s:=c2−t2, which is real because c2−t2=(a+b+c)(b+c−a)(a+c−b)(a+b−c)4b2≥0; set pˉ:=(0,0), rˉ:=(b,0) and qˉ:=(t,s) in R2. Then d2(pˉ,rˉ)=b, d2(pˉ,qˉ)2=t2+s2=c2 and d2(rˉ,qˉ)2=(t−b)2+s2=t2−2bt+b2+s2=c2+b2−2bt=a2, so the three prescribed distances are realised. This construction includes every positive degenerate triple because then s=0. If b=0, the inequalities force a=c, and pˉ=rˉ=(0,0), qˉ=(c,0) realise the triple; the other zero-side cases follow by relabeling.

1.3F2F6F8algebra

For x,y∈Sn−1 the Cauchy–Schwarz inequality [F6] gives ∣x⋅y∣≤1, so dS(x,y)=arccos⁡(x⋅y) is defined by [F2]; symmetry is x⋅y=y⋅x, separation at x=y is arccos⁡1=0, and if dS(x,y)=0 then x⋅y=1, so x,y are linearly dependent by the equality case of [F6]; as unit vectors they satisfy y=±x, and x⋅y=1 excludes y=−x, so x=y.

1.4F2F5F6algebra

Let A,B,C∈Sn−1 with a:=dS(B,C) and b:=dS(C,A) both in (0,π), and let c:=dS(A,B), u:=(B−(B⋅C)C)/∣B−(B⋅C)C∣ and v:=(A−(A⋅C)C)/∣A−(A⋅C)C∣. Here B⋅C=cos⁡a and A⋅C=cos⁡b by [F2], so ∣B−(B⋅C)C∣2=1−cos⁡2a=sin⁡2a>0 and likewise ∣A−(A⋅C)C∣2=sin⁡2b>0, using sin⁡a>0 and sin⁡b>0 from [F5]; hence B=(cos⁡a)C+(sin⁡a)u and A=(cos⁡b)C+(sin⁡b)v with u,v unit vectors orthogonal to C. Expanding gives the spherical cosine rule cos⁡c=A⋅B=cos⁡acos⁡b+sin⁡asin⁡b (u⋅v), and cos⁡γ:=u⋅v∈[−1,1] by [F6] defines the vertex angle γ∈[0,π] at C.

1.5F1algebra

Let X be a geodesic space with a geodesic triangle z,x,y and pt on [x,y] at distance t d(x,y) from x; in the Euclidean comparison triangle pˉt=(1−t)xˉ+tyˉ, so the identity ∣zˉ−pˉt∣2=(1−t)∣zˉ−xˉ∣2+t∣zˉ−yˉ∣2−t(1−t)∣xˉ−yˉ∣2 holds by expansion, and substituting the comparison distances shows that d(z,pt)≤d2(zˉ,pˉt) is equivalent to its squared form, both sides being nonnegative.

1.6F1F9F10F11F13algebra

On Sℓ1=R/ℓZ the minimum defining dℓ exists: for δ=x−y, choose N>2∣δ∣/ℓ by [F13]; when ∣k∣>N, ∣δ+kℓ∣≥∣k∣ℓ−∣δ∣>∣δ∣, so a minimum occurs among the finitely many integers ∣k∣≤N. Changing representatives just shifts these integers. Thus dℓ is well defined and symmetric and vanishes exactly on the diagonal, and dℓ(x,z)=min⁡k∣x−z+kℓ∣≤min⁡k∣x−y+kℓ∣+min⁡j∣y−z+jℓ∣=dℓ(x,y)+dℓ(y,z) by choosing minimising integers; hence dℓ is a metric. The map t↦t+ℓZ from [0,ℓ] onto Sℓ1 is surjective: a finite integer bound from [F13] permits subtracting an integer multiple of ℓ to place each real representative in [0,ℓ) and satisfies dℓ(s,t)=min⁡(∣s−t∣,ℓ−∣s−t∣) for s,t∈[0,ℓ], so it is continuous and sends the compact interval onto Sℓ1, 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 r<ℓ/4 isometric to an interval of R, since differences between lifts in that ball are <ℓ/2. A minimizing segment lifts successively through these interval charts, starting at any chosen lift; each chart restriction of its lift is affine of slope +1 or −1 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 ℓ/2; the identity map exhibits an isometrically embedded circle of length ℓ in the sense of [F9].

2.1step 1.2F9algebra

Two triangles in R2 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 d2(P,R)=b>0, the map ϕ(x):=P+Bx, with B orthogonal sending (1,0) to (R−P)/b, is an isometry of R2, and applying the coordinate computation of step 1.2 to ϕ−1 of a triangle shows that a point Q at distance c from P and a from R has coordinates (t,±s) with t,s as in step 1.2; the two solutions differ by the reflection (x1,x2)↦(x1,−x2), so any two triangles with the prescribed side lengths are obtained from the normal form of step 1.2 by an isometry.

2.2step 1.3step 1.4F1F3F4F5

With the notation of step 1.4 and a,b∈(0,π): if a+b≤π then cos⁡c≥cos⁡acos⁡b−sin⁡asin⁡b=cos⁡(a+b) by [F4] and sin⁡asin⁡b≥0 from [F5], and since c≤π and cos⁡ strictly decreases on [0,π] by [F3], c≤a+b; if a+b>π then c≤π<a+b. If a=0 then C=B and c=b=a+b; if b=0 similarly c=a. Hence dS satisfies the triangle inequality, and by step 1.3 it is a metric on Sn−1.

2.3step 1.1step 1.3F2F12algebra

Let x,y∈Sn−1 and θ:=dS(x,y)∈(0,π]; when θ<π put ξ:=(y−(x⋅y)x)/∣y−(x⋅y)x∣, so that y=(cos⁡θ)x+(sin⁡θ)ξ with ξ a unit vector orthogonal to x by step 1.3 and [F2], and choose any unit ξ⊥x when θ=π. Then c(t):=(cos⁡t)x+(sin⁡t)ξ satisfies c(0)=x, c(θ)=y, and c(t)⋅c(t′)=cos⁡(t−t′) for t,t′∈[0,θ] with ∣t−t′∣≤θ≤π by step 1.1, so dS(c(t),c(t′))=∣t−t′∣ by [F2]; thus minimal great-circle arcs are geodesic segments in the sense of [F12].

2.4step 1.1step 1.4F1F2F6F9

Let a,b,c≥0 satisfy the triangle inequalities with a+b+c<2π. Then a,b,c<π, since a≥π forces a+b+c≥2a≥2π. If a,b,c>0, put γ:=arccos⁡cos⁡c−cos⁡acos⁡bsin⁡asin⁡b; the argument lies in [−1,1] directly from the length hypotheses. Indeed c≥∣a−b∣ gives cos⁡c≤cos⁡(a−b)=cos⁡acos⁡b+sin⁡asin⁡b. If a+b≤π, then c≤a+b gives cos⁡c≥cos⁡(a+b); if a+b>π, the perimeter bound gives c<2π−a−b<π, hence cos⁡c>cos⁡(2π−a−b)=cos⁡(a+b). In both cases cos⁡c≥cos⁡acos⁡b−sin⁡asin⁡b, proving the required range without presupposing a spherical realization, and the construction C:=(1,0,0), B:=(cos⁡a)C+(sin⁡a)(0,1,0), A:=(cos⁡b)C+(sin⁡b)(cos⁡γ (0,1,0)+sin⁡γ (0,0,1)) uses cos⁡2t+sin⁡2t=1 (step 1.1) to give unit vectors with B⋅C=cos⁡a, A⋅C=cos⁡b and A⋅B=cos⁡acos⁡b+sin⁡asin⁡bcos⁡γ=cos⁡c; if one of a,b,c vanishes, say a=0, then b=c and C:=(1,0,0), B:=C, A:=(cos⁡b)C+(sin⁡b)(0,1,0) 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 R3 along orthonormal bases of the orthocomplements; so the comparison triangle is unique up to an isometry of S2 by [F9]. A triangle in S2 of perimeter <2π is a comparison triangle for itself, so the CAT(1) inequality holds with equality for it and S2 is CAT(1).

2.5step 1.2F1F12

Let X be CAT(0) and let γ,δ be geodesic segments from x to y of length L=d(x,y); the geodesic triangle with sides γ,δ and the degenerate third side has side lengths L,L,0, and its comparison triangle in E2 is degenerate with the comparison points of γ(t) and δ(t) coinciding, both being at distance t from the comparison vertex xˉ along the same comparison side; hence d(γ(t),δ(t))≤d2(γˉ(t),δˉ(t))=0 by the CAT(0) inequality, so γ=δ and geodesic segments are unique.

3.1step 1.2step 2.1F1F6F12

A geodesic triangle in a metric space has side lengths obeying the triangle inequalities, because the metric satisfies (M3) of Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric; in E2 every geodesic side is a straight segment: equality ∣x−w∣+∣w−y∣=∣x−y∣ along a minimizing segment forces the two displacement vectors to be nonnegative multiples by the equality case of [F6], and their lengths fix w. By steps 1.2 and 2.1 every metric triangle therefore has a comparison triangle in E2, unique up to isometry, and if the triangle itself lies in E2 then it is a comparison triangle for itself by step 2.1, so the CAT(0) inequality is an equality for it and E2 is CAT(0).

3.2step 1.1step 1.4step 2.3F2F4F6algebra

Let x,y∈Sn−1, θ:=dS(x,y)∈(0,π), and let z∈Sn−1 satisfy dS(x,z)+dS(z,y)=θ; write α:=dS(x,z) and β:=dS(z,y), so θ=α+β. The Gram matrix of x,y,z has entries x⋅x=y⋅y=z⋅z=1, x⋅y=cos⁡θ, x⋅z=cos⁡α, y⋅z=cos⁡β, and is positive semidefinite because vTGv=∣∑iviui∣2≥0; by step 1.1, cos⁡θ=cos⁡(α+β)=cos⁡αcos⁡β−sin⁡αsin⁡β, so its determinant is 1+2cos⁡αcos⁡βcos⁡θ−cos⁡2α−cos⁡2β−cos⁡2θ=sin⁡2αsin⁡2β−(cos⁡θ−cos⁡αcos⁡β)2=0, the bracket being sin⁡αsin⁡β. Hence x,y,z are linearly dependent; since θ∈(0,π) makes x,y independent, z lies in the plane P:=span{x,y}. Parametrise the unit circle of P by c(s)=(cos⁡s)x+(sin⁡s)ξ with ξ as in step 2.3, so that y=c(θ); a unit vector of P with x⋅z=cos⁡α is c(α) or c(−α), and if z=c(−α) with α>0 then z⋅y=c(−α)⋅c(θ)=cos⁡(θ+α)≠cos⁡(θ−α)=cos⁡β by steps 1.1 and 1.4, since equality would force sin⁡θsin⁡α=0; so z=c(α), a point of the minimal arc from x to y.

3.3step 2.3F2F3F5algebra

Let p∈Sn−1, 0<r<π/2 and x,y∈Bˉ(p,r); if x=y there is nothing to prove, so assume x≠y and put θ:=dS(x,y)∈(0,π]. If θ=π then y=−x by [F2], so p⋅y=−p⋅x≤−cos⁡r while p⋅y=cos⁡dS(p,y)≥cos⁡r, a contradiction since cos⁡r>0; hence θ<π. For 0≤t≤θ the point c(t)=sin⁡(θ−t)sin⁡θx+sin⁡tsin⁡θy of the arc of step 2.3 has nonnegative coefficients by [F5], whose sum is cos⁡(t−θ/2)/cos⁡(θ/2)≥1 by the addition formulas and decreasing cosine, so p⋅c(t)≥min⁡(p⋅x,p⋅y)≥cos⁡r>0 and therefore dS(p,c(t))≤r by [F2] and [F3]; hence Bˉ(p,r) is convex.

3.4step 2.5F1algebra

Let γ,δ be geodesics with common initial point x=γ(0)=δ(0) and proportional parametrisations on [0,1]; if γ(1)=δ(1) the claim follows from step 2.5, so let y:=γ(1), z:=δ(1) and consider the geodesic triangle x,y,z. In its Euclidean comparison triangle the points γˉ(t) and δˉ(t) are at distance t d(y,z) for every t∈[0,1], by similarity; the CAT(0) inequality applied to the pair γ(t),δ(t) gives d(γ(t),δ(t))≤t d(y,z)=(1−t)d(γ(0),δ(0))+t d(γ(1),δ(1)) since γ(0)=δ(0).

3.5step 1.5step 2.1F1F2F3algebra

Let X 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 x,y lie on one side the comparison preserves distances along that side; if one of x,y 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 0, reduce to these cases. It remains to treat a triangle with sides [p,q],[q,r],[r,p], points x∈[p,q] and y∈[p,r] with x≠p≠y, x≠q and y≠r, comparison triangle (pˉ,qˉ,rˉ), comparison points xˉ∈[pˉ,qˉ] and yˉ∈[pˉ,rˉ], and the positive numbers a:=d(p,x), b:=d(p,y); write d^:=d(x,y) and let α^ be the vertex angle at the point corresponding to p in the comparison triangle of (p,x,y), so that d^2=a2+b2−2abcos⁡α^. Apply the hypothesis to the geodesic triangle (p,x,r) with vertex x and the point y of the opposite side [p,r]: if (p^′,x^′,r^′) is the comparison triangle of (p,x,r) and y^′∈[p^′,r^′] is the comparison point of y, then d^≤D:=d2(x^′,y^′). The triangles (p^′,x^′,y^′) and the comparison triangle of (p,x,y) have two sides in common, of lengths a and b, and opposite sides D≥d^, so the angle at p^′ of the former is at least α^: for fixed a,b>0 the quantity (a2+b2−s2)/(2ab) is strictly decreasing in s and cos⁡ is strictly decreasing on [0,π] (F3), so the included angle is increasing in the opposite side. As y^′ lies on the side [p^′,r^′], that angle is exactly the vertex angle α^′ of the comparison triangle of (p,x,r) at p^′, so α^′≥α^. Apply the hypothesis again, to (p,q,r) with vertex r and the point x of the opposite side [p,q]: d(r,x)≤d2(rˉ,xˉ), so the triangles (p^′,x^′,r^′) and (pˉ,xˉ,rˉ) have two sides in common, of lengths a and d(p,r), and opposite sides d(x,r)≤d2(xˉ,rˉ); the same monotonicity of the included angle gives α^′≤αˉ, the vertex angle of (pˉ,qˉ,rˉ) at pˉ, and xˉ∈[pˉ,qˉ] with xˉ≠pˉ makes the ray from pˉ to xˉ the ray to qˉ, so this angle is exactly the vertex angle of (pˉ,xˉ,rˉ) at pˉ. Hence α^≤αˉ, and the two laws of cosines d(x,y)2=a2+b2−2abcos⁡α^ and d2(xˉ,yˉ)2=a2+b2−2abcos⁡αˉ give d(x,y)≤d2(xˉ,yˉ) because cos⁡ is decreasing on [0,π] (F3). Thus a geodesic space is CAT(0) if and only if every vertex-opposite-side comparison holds.

3.6step 1.5step 2.5

The case t=1/2 of the squared form in step 1.5, with m:=p1/2 a midpoint of [y,y′]:=[x,y] and z the opposite vertex, gives d(z,m)2≤12d(z,y)2+12d(z,y′)2−14d(y,y′)2, which is (d) since midpoints are unique by step 2.5.

3.7step 2.4F1algebra

Let ℓ≥2π and let x,y,z∈Sℓ1 be the vertices of a triangle of perimeter p<2π, 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 <ℓ/2 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 g1,g2,g3>0. If all gi≤ℓ/2 then the three pairwise distances are g1,g2,g3 and p=ℓ≥2π, contrary to hypothesis; so some g3>ℓ/2, the complementary arc of length s:=ℓ−g3 contains all three points, and the two adjacent distances are g1,g2 while the third is g1+g2=s, so p=2s<2π and s<π. Thus the triangle is degenerate and isometric, side by side, to a configuration on an arc of length s; placing three points of a great arc of S2 of the same length s<π 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 Sℓ1 is CAT(1) for ℓ≥2π.

4.1step 2.5step 3.4F1

Geodesic segments in a CAT(0) space vary continuously with their endpoints. Let γ be the geodesic from x to y and γ′ the geodesic from x′ to y′, let t∈[0,1], and let δ be the geodesic from x to y′, so that γ,δ are geodesics from the common initial point x with proportional parametrizations. Step 3.4 gives d(γ(t),δ(t))≤(1−t)d(γ(0),δ(0))+t d(γ(1),δ(1))=t d(y,y′), and step 3.4 applied to the reversed geodesics δˉ(s)=δ(1−s) from y′ to x and γˉ′(s)=γ′(1−s) from y′ to x′, which again have a common initial point and proportional parametrizations, gives d(δ(t),γ′(t))=d(δˉ(1−t),γˉ′(1−t))≤(1−t) d(x,x′). Hence d(γ(t),γ′(t))≤(1−t) d(x,x′)+t d(y,y′) for every t, which tends to 0 uniformly in t as x′→x and y′→y; since the geodesic segments are unique by step 2.5, they vary continuously with their endpoints as asserted in (iv)(a).

4.2step 2.3step 3.2F2F12algebra

Let γ:[0,θ]→Sn−1 be a geodesic from x to y with θ<π. If θ=0 it is constant. Otherwise dS(x,γ(t))+dS(γ(t),y)=θ, so step 3.2 puts γ(t) on the unique minimal arc at position t, and step 2.3 identifies its parametrization. If θ=π, choose z=γ(π/2), perpendicular to x. Each half has length π/2 and is the unique short arc just proved; because y=−x, both halves lie in the plane spanned by x,z and form one semicircle. This proves the claimed classification of all spherical geodesics.

4.3step 2.4step 3.3F1F12choose

Let X be CAT(1), p∈X, 0<r<π/2 and y,z∈B(p,r). Since d(y,z)<2r<π, segments exist. Two competing segments give a triangle with repeated vertex and perimeter 2d(y,z)<2π; its comparison sides coincide, so CAT(1) forces equal-parameter points to coincide. Thus [y,z] is unique. Choose r′ with max⁡{d(p,y),d(p,z)}<r′<r. The triangle p,y,z has perimeter <4r′<2π. Its comparison side lies in the convex spherical ball Bˉ(pˉ,r′) by step 3.3, so CAT(1) gives d(p,w)≤r′<r for every w∈[y,z]. Hence B(p,r) is convex, and the same argument with non-strict endpoint bounds proves convexity of closed balls of radius <π/2.

5.1step 1.1step 4.2F2F3algebra

Let y,z∈S2 with c:=dS(y,z)<π and x∈S2; put a:=(y+z)/∣y+z∣, a unit vector because y≠−z. Then y⋅a=z⋅a=(1+cos⁡c)/∣y+z∣>0, since cos⁡c>−1=cos⁡π by step 1.1 and [F3], so s:=dS(y,a)=dS(z,a) by [F2] and cos⁡s>0. Since ∣y+z∣2=2+2cos⁡c (step 1.1) and s=arccos⁡(y⋅a), we get cos⁡2s=(1+cos⁡c)/2, hence cos⁡c=2cos⁡2s−1=cos⁡2s by step 1.1; as c,2s∈[0,π] and cos⁡ is injective there by [F3], c=2s and cos⁡(c/2)=cos⁡s>0. Finally cos⁡dS(x,a)=x⋅a=x⋅y+x⋅z∣y+z∣=cos⁡dS(x,y)+cos⁡dS(x,z)2cos⁡(c/2), using ∣y+z∣=2cos⁡(c/2).

6.1step 4.3step 5.1F1F3

Let X be CAT(1), p∈X, 0<r<π/2 and x,y,z∈B(p,r) with d(x,y)+d(y,z)+d(z,x)<2π; the sides are <2r<π, so [y,z] is unique with midpoint a by step 4.3 and the CAT(1) inequality applied to the pair (x,a) of the triangle x,y,z gives d(x,a)≤dS(xˉ,aˉ), where aˉ is the midpoint of the comparison side [yˉ,zˉ] of length d(y,z). Step 5.1 applied in S2 to xˉ,yˉ,zˉ gives cos⁡dS(xˉ,aˉ)=cos⁡dS(xˉ,yˉ)+cos⁡dS(xˉ,zˉ)2cos⁡(d(y,z)/2), and since d(x,a)≤dS(xˉ,aˉ)≤π and cos⁡ strictly decreases on [0,π] by [F3], cos⁡d(x,a)≥cos⁡dS(xˉ,aˉ)=cos⁡d(x,y)+cos⁡d(x,z)2cos⁡(d(y,z)/2), the denominator being positive by step 5.1.

6.2step 1.1step 1.4step 5.1F1F3algebra

Let ℓ<2π and let x:=0, y:=ℓ/3, z:=2ℓ/3 in Sℓ1; the three pairwise distances are ℓ/3<π, so the triangle has perimeter ℓ<2π; let a:=ℓ/6 be the midpoint of [x,y], so dℓ(a,z)=min⁡{ℓ/2,ℓ/2}=ℓ/2. In the comparison triangle in S2, whose sides all have length ℓ/3, the midpoint aˉ of a side satisfies cos⁡dS(aˉ,zˉ)=cos⁡(ℓ/3)cos⁡(ℓ/6) by step 5.1, with cos⁡(ℓ/6)>0 by step 1.1 since ℓ/6<π/3<π/2; and step 1.1 gives cos⁡(ℓ/6)cos⁡(ℓ/2)=12cos⁡(2ℓ/3)+12cos⁡(ℓ/3)<12cos⁡(ℓ/3)+12cos⁡(ℓ/3)=cos⁡(ℓ/3), because cos⁡(2ℓ/3)−cos⁡(ℓ/3)=−2sin⁡(ℓ/2)sin⁡(ℓ/6)<0 by the addition formulas and [F5]. Dividing by cos⁡(ℓ/6)>0 gives cos⁡(ℓ/2)<cos⁡(ℓ/3)cos⁡(ℓ/6)=cos⁡dS(aˉ,zˉ), that is dS(aˉ,zˉ)<ℓ/2=dℓ(a,z); the CAT(1) inequality fails at the pair (a,z) by step 1.4 and [F3].

7.1step 1.6step 3.1step 3.4step 3.5step 3.6step 3.7step 4.1step 4.2step 4.3step 6.1step 6.2∎

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).

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

Alexandrov comparison: straightening a hinge, gluing comparison triangles, and patchwork

Statement

(i) Alexandrov's Lemma. Let κ∈{0,1}, let Mκ2 be E2 for κ=0 and S2 for κ=1, and let A,B,B′,C be four distinct points of Mκ2; if κ=1 assume d(C,B)+d(C,B′)+d(A,B)+d(A,B′)<2π. Suppose B and B′ lie on opposite sides of the geodesic line through A and C. Let α,β,γ and α′,β′,γ′ be the angles of the triangles Δ(A,B,C) and Δ(A,B′,C) at A,B,C and A,B′,C. If γ+γ′≥π, then

(1) d(B,C)+d(B′,C)≤d(B,A)+d(B′,A);

(2) if Δ′′ is a triangle with vertices Aˉ,Bˉ,Bˉ′ such that d(Aˉ,Bˉ)=d(A,B), d(Aˉ,Bˉ′)=d(A,B′) and d(Bˉ,Bˉ′)=d(B,C)+d(C,B′), and Cˉ∈[Bˉ,Bˉ′] satisfies d(Bˉ,Cˉ)=d(B,C), then the angle αˉ of Δ′′ at Aˉ, the angle βˉ′ of Δ′′ at Bˉ′ and the distance d(Aˉ,Cˉ) satisfy αˉ≥α+α′, βˉ′≥β′ and d(Aˉ,Cˉ)≥d(A,C); equality in any one of the three assertions implies the others and holds if and only if γ+γ′=π.

(ii) Gluing Lemma for triangles. Let X be a metric space in which every pair of points at distance <Dκ is joined by a geodesic, and let Δ=([q0,q1],[q1,p],[p,q0]) be a geodesic triangle in X of perimeter <2Dκ with distinct vertices. Let r∈[q0,q1] with r≠p, let [p,r] be a geodesic, and put Δ1=([q0,r],[r,p],[p,q0]) and Δ2=([p,r],[r,q1],[q1,p]). If for i=1,2 every defined vertex angle of a comparison triangle Δˉi in Mκ2 is no smaller than the corresponding angle of Δi, 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 X be a metric space of curvature ≤κ, let p,q0,q1∈X with q0≠q1, p∉[q0,q1], and d(p,q0)+d(p,q1)+d(q0,q1)<2Dκ, let γ:[0,1]→X be a geodesic from q0 to q1, and let cs:[0,1]→X, s∈[0,1], be geodesics from p to γ(s) depending continuously on s with c0=[p,q0] and c1=[p,q1]. Then the vertex angles of the triangle Δ=([q0,q1],[q1,p],[p,q0]) are no greater than the corresponding angles of any comparison triangle in Mκ2. The same conclusion holds for a finite subdivision obtained by successive applications of (ii), provided each intermediate union is a geodesic triangle of perimeter <2Dκ 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 a,b,c with the same initial point, their upper angles satisfy ∠(a,c)≤∠(a,b)+∠(b,c).

Facts & Assumptions

Given: The models E2 and S2 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 X as described there, together with the triangles, points and geodesics named in the Statement.

[F1]

In E2 and in S2 the geodesics are the straight segments and the minimal great-circle arcs, the distance in S2 is the round distance, and D0=∞, D1=π (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles, Euclidean spheres and closed balls as subspaces of Rn, Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it).

[F2]

The angle of a model triangle is the comparison angle of its three side lengths: for sides b=d(O,P), c=d(O,Q) and a=d(P,Q) meeting at O, in E2 the angle θ at O has cos⁡θ=(b2+c2−a2)/(2bc), and in S2, when b,c,a∈(0,π), it has cos⁡θ=(cos⁡a−cos⁡bcos⁡c)/(sin⁡bsin⁡c); in both models, for fixed b,c>0 the map θ↦a and the inverse map a↦θ 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).

[F3]

Comparison triangles in E2 and S2 exist and are unique up to isometry for every triple of nonnegative side lengths satisfying the triangle inequalities, with the additional perimeter bound <2π in S2; a triangle of the model is a comparison triangle for itself; and for fixed two positive sides (both <π in S2) 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).

[F4]

(X,d) is a metric space and d satisfies the triangle inequality, and a geodesic segment γ:[0,ℓ]→X is distance preserving with ℓ=d(γ(0),γ(ℓ)) (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, Geodesics and geodesic metric spaces).

[F5]

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.

[F7]

lim⁡u→0sin⁡u/u=1 (The limit of sin x divided by x at zero is one).

Proof

1.1F1F2F4algebragiven

Spherical size and orientation. The model comparison angles agree with geometric angles: on the sphere, the unit tangent towards V at U is (V−(U⋅V)U)/sin⁡d(U,V), whose dot product with the analogous tangent towards W is exactly the cosine formula in [F2]; the Euclidean assertion is the corresponding dot-product formula. Write u=d(C,B), y=d(C,B′), p=d(A,B), q=d(A,B′), x=d(A,C) and L=u+y+p+q. For κ=1, L<2π gives x<π, since 2x≤(u+p)+(y+q)=L; every boundary edge is also <π, since its complementary path has length at least that edge. The polygonal loop A,B,C,B′,A lies in an open hemisphere: take points P,Q dividing its arclength into halves of length L/2; every point Z on either half satisfies d(P,Z)+d(Q,Z)≤L/2<π, hence (P+Q)⋅Z=cos⁡d(P,Z)+cos⁡d(Q,Z)>0. In that hemisphere the projection Z↦Z/(h⋅Z), with h=(P+Q)/∥P+Q∥, maps minor great-circle arcs to straight segments and preserves the side of each line and whether an interior angle is reflex. Because B,B′ are on opposite sides of AC, the projected quadrilateral is simple. Its angles at B,B′ are convex, and its angle at C is reflex or straight because γ+γ′≥π. Triangulating along AC shows that its angle at A is convex and that C lies in the closed triangle ABB′; the same conclusions hold before projection. Thus α+α′≤π. Moreover u+y<π: otherwise p+q<π, so (B+B′)⋅A=cos⁡p+cos⁡q>0, and (B+B′)⋅B=(B+B′)⋅B′=1+B⋅B′>0 (the original open hemisphere excludes antipodal B,B′). A hemisphere contains the minor geodesic segments joining its points, since their unit vectors are normalized positive linear combinations; hence the hemisphere with pole B+B′ contains the spherical triangle ABB′ and C, giving cos⁡u+cos⁡y>0, equivalently u+y<π, a contradiction. In the Euclidean case the same planar quadrilateral argument gives α+α′≤π, and there is no size restriction.

1.2F2F3algebra

A monotonicity lemma for a marked point. Let V,W,U be a triangle in Mκ2 with ∣VW∣=s>0, ∣VU∣=p>0 (with s,p<π when κ=1), ∣WU∣=q, and angle θ at V; let C0∈[V,W] satisfy ∣VC0∣=u with 0<u<s. Then ∣UC0∣ is a strictly increasing function of θ∈[0,π]: it is the third side of the model triangle with sides p and u meeting at the angle θ, so the claim is the strict monotonicity in the included angle from [F2], applied with the fixed positive sides p,u. Consequently, if V′W′U′ is a second such triangle with ∣V′W′∣=s, ∣V′U′∣=p, ∣W′U′∣=q′≤q, and marked point C0′∈[V′W′] with ∣V′C0′∣=u, having angle θ′ at V′, then θ′≤θ by the strict monotonicity of the angle in the opposite side from [F2] (fixed sides p,s), hence ∣U′C0′∣≤∣UC0∣.

1.3F4given

Reduction to an interior splitting point in (ii). If r=q0 or r=q1 then one of Δ1,Δ2 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 r∈(q0,q1), which makes all six side lengths of Δ1,Δ2 positive, since r≠p and the vertices of Δ are distinct.

1.4F2F3F5F7algebra

Local CAT angle comparison. For two unit-speed spherical rays meeting at angle θ, let their points at distances s,t>0 with s+t<π have distance D, and put h=∣s−t∣. The cosine rule and addition formulas give 4sin⁡2(D/2)−4sin⁡2(h/2)=2sin⁡ssin⁡t(1−cos⁡θ). Factoring the left side yields 4sin⁡((D+h)/2)sin⁡((D−h)/2). With sinc⁡(u)=sin⁡u/u for u≠0 and sinc⁡(0)=1, it follows that (D2−h2)/(2st)=(1−cos⁡θ)sinc⁡(s)sinc⁡(t)/(sinc⁡((D+h)/2)sinc⁡((D−h)/2)); when D=h, both sides are zero. Since h≤D≤s+t, The limit of sin x divided by x at zero is one makes the ratio tend uniformly to 1 as max⁡(s,t)→0, with no restriction on s/t. The Euclidean comparison cosine 1−(D2−h2)/(2st) thus tends to cos⁡θ. 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.

2.1step 1.4F2F3F4F5F6construct

Local triangles for (iii). Apply a finite cover and the Lebesgue-number property of the compact square to the continuous map c(s,t)=cs(t). Choose partitions si,tj so that the image of each closed small rectangle is contained in a CAT(κ) ball Uij of radius <Dκ/4 when κ=1, 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 <π/2 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 Uij, and the joining geodesics chosen there are ambient geodesics. Put Lj=csi−1(tj) and Rj=csi(tj). For each strip take the triangle (p,L1,R1) and, for 1≤j<n, the two triangles (Lj,Rj,Rj+1) and (Lj,Lj+1,Rj+1), choosing the horizontal and diagonal edges within the corresponding ball. Each of these 2n−1 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 0,0,π and the same limiting inequalities apply.

2.2step 1.1F1F2construct

Straightening construction. Extend the segment [B,C] beyond C by length y to B1′. Step 1.1 gives u+y<π in the spherical case, so this extension remains a minimal arc; in both models C∈[B,B1′], d(B,B1′)=u+y, and ∠ACB1′=π−γ.

2.3step 1.3F3F4algebra

Perimeter bounds. The perimeter of each of Δ1,Δ2 is at most the perimeter of Δ, which is <2Dκ, so the comparison triangles Δˉ1,Δˉ2 exist by [F3]; moreover 2d(q0,q1)≤d(q0,q1)+d(q1,p)+d(p,q0) and 2d(p,r)≤d(p,q0)+d(p,q1)+d(q0,q1) by the reverse triangle inequality applied to the two ends of [q0,q1], so d(q0,q1)<Dκ and d(p,r)<Dκ; in particular d(rˉ,qˉ0)+d(rˉ,qˉ1)=d(q0,q1)<Dκ and d(pˉ,rˉ)=d(p,r)<Dκ, and the four boundary distances in (i) sum to the perimeter of Δ, <2Dκ, as required.

2.4step 1.3F2F4F5algebragiven

Angle triangle inequality and the splitting point. For three geodesics issuing from O, write a,b for the upper angles between the first and middle, and middle and last. If a+b≥π their angle triangle inequality is automatic. Otherwise take a0>a, b0>b with a0+b0<π. For sufficiently short endpoints at distances s,t on the first and last geodesics, use the point at distance v=stsin⁡(a0+b0)/(ssin⁡a0+tsin⁡b0) on the middle geodesic. This tends uniformly to zero with max⁡(s,t), and the definition of upper angle bounds the two distances to that point by the Euclidean sides for included angles a0,b0. In the Euclidean triangle formed by rays at angles a0,b0 to their middle ray, that value of v is the intersection of the middle ray with the side joining the endpoints; hence the sum of those two bounds is s2+t2−2stcos⁡(a0+b0). The metric triangle inequality and the law of cosines show that the comparison angle between the first and last endpoints is at most a0+b0. Taking the defining upper limit and then a0↓a, b0↓b proves the angle triangle inequality. At r, the first and last segments are the opposite halves of [q0,q1], of angle π, so the angles of Δ1,Δ2 there sum to at least π; their comparison angles therefore also sum to at least π. At p the same triangle inequality bounds the angle of Δ by the sum of the two subtriangle angles.

3.1step 2.2F2F3algebra

The comparison step. In both models d(A,B1′) is the distance determined by the two sides x=d(A,C) and y=d(C,B1′) and the included angle ∠ACB1′=π−γ at C, while d(A,B′) is determined by the same two sides and the included angle γ′=∠ACB′; since γ+γ′≥π gives π−γ≤γ′, the strict monotonicity of the third side in the included angle from [F2] yields d(A,B1′)≤d(A,B′)=q, with equality if and only if γ+γ′=π.

4.1step 2.2step 3.1F4

Proof of (1). By the triangle inequality and step 2.2, d(B,A)+d(A,B1′)≥d(B,B1′)=u+y, and step 3.1 (together with d(B,A)=p) gives d(B,A)+d(B′,A)≥d(B,A)+d(A,B1′)≥d(B,C)+d(C,B′), which is (1).

4.2step 2.2step 3.1step 1.2algebra

Proof of (2): the distance assertion. Let Δ′′ be as in the Statement and put x′′:=d(Aˉ,Cˉ). The triangle (A,B,B1′) of steps 2.2 and 1.2 has ∣AB∣=p, ∣BB1′∣=u+y, ∣AB1′∣=d(A,B1′)≤q, and its marked point C∈[B,B1′] has ∣BC∣=u; the triangle (Bˉ,Bˉ′,Aˉ) has ∣BˉBˉ′∣=u+y, ∣BˉAˉ∣=p, ∣Bˉ′Aˉ∣=q, and its marked point Cˉ∈[Bˉ,Bˉ′] has ∣BˉCˉ∣=u. Both satisfy the hypotheses of step 1.2 with the same s=u+y and p, the second with the larger opposite side, so d(Aˉ,Cˉ)≥d(A,C)=x, with equality if and only if d(A,B1′)=q, that is, if and only if γ+γ′=π by step 3.1.

5.1step 4.2F2algebra

Proof of (2): the angle at Bˉ′. The triangles (Aˉ,Cˉ,Bˉ′) and (A,C,B′) have two side lengths in common, y=d(Cˉ,Bˉ′)=d(C,B′) and q=d(Aˉ,Bˉ′)=d(A,B′), and their third sides are x′′ and x; 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 x′′>x.

6.1step 1.1step 4.2step 5.1F2F4algebra

Proof of (2): the angle at Aˉ. By step 1.1 the angle between AB and AB′ is α+α′≤π in both models. The triangles (A,B,B′) and Δ′′ have the same two adjacent sides p,q; their opposite sides are d(B,B′) and s=u+y. Since d(B,B′)≤s, the law of cosines and its strict monotonicity give αˉ≥α+α′. Equality holds exactly when d(B,B′)=u+y, equivalently C∈[B,B′], equivalently γ+γ′=π. Together with steps 4.2 and 5.1 this proves all three comparisons and simultaneous equality.

7.1step 2.3step 2.4step 4.2step 5.1step 6.1F3algebra

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 0 or π, and no continuity of angles in the metric space is being assumed. Glue Δˉ1 and Δˉ2 along their common side [pˉ,rˉ] so that qˉ0 and qˉ1 lie on opposite sides of the line through pˉ and rˉ, which is possible because comparison triangles are unique up to isometry [F3]. In the glued configuration the four points pˉ,rˉ,qˉ0,qˉ1 are distinct, the points qˉ0,qˉ1 lie on opposite sides of the line through pˉ and rˉ, the angles at rˉ 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 (A,C,B,B′)=(pˉ,rˉ,qˉ0,qˉ1) and then with qˉ0 and qˉ1 interchanged produces the comparison triangle Δ′′=Δ(pˉ,qˉ0,qˉ1) of Δ together with the point Cˉ∈[qˉ0,qˉ1] with d(qˉ0,Cˉ)=d(q0,r), and clause (2) gives: the angles of Δ′′ at qˉ0 and at qˉ1 are at least the comparison angles of Δˉ1,Δˉ2 at qˉ0,qˉ1; the angle of Δ′′ at pˉ is at least the sum of those comparison angles at pˉ; and d(pˉ,Cˉ)≥d(p,r), Cˉ being the point at distance d(q0,r) from qˉ0 on the side [qˉ0,qˉ1].

8.1step 7.1step 2.4given

Conclusion of (ii). By step 7.1 the angles of the comparison triangle Δ′′ of Δ at qˉ0,qˉ1 dominate the comparison angles of Δˉ1,Δˉ2 at those vertices, which dominate the angles of Δ1,Δ2 there by the hypothesis of (ii), and the angle of Δ′′ at pˉ dominates the sum of the comparison angles at pˉ, which dominates the angle of Δ at p; hence every vertex angle of the comparison triangle Δ′′ is at least the corresponding angle of Δ.

9.1step 2.1step 2.4step 8.1F2F3F4algebra∎

Assembling the strips. Starting with (p,L1,R1), glue (Lj,Rj,Rj+1) along LjRj and then (Lj,Lj+1,Rj+1) along LjRj+1. The splitting points are respectively Rj∈[p,Rj+1] and Lj∈[p,Lj+1], so (ii) successively gives the angle comparisons for (p,Lj,Rj+1) and (p,Lj+1,Rj+1). 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 <2Dκ. 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 [p,γ(si)]; 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.

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

Endpoint stability for local geodesics in complete locally CAT(0) spaces

Statement

Let X 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 c:[0,1]→X be a local geodesic. Then there is ε>0 such that for every t∈[0,1] the closed ball Bˉ(c(t),2ε) is complete and convex, and for all x′,y′∈X with d(c(0),x′)<ε and d(c(1),y′)<ε there is exactly one local geodesic c′:[0,1]→X from x′ to y′ with t↦d(c(t),c′(t)) convex. For this c′:

(i) d(c(t),c′(t))<ε for every t∈[0,1], and L(c′)≤L(c)+d(c(0),x′)+d(c(1),y′) (Length in a metric target: lower semicontinuity and arc-length reparametrization);

(ii) the assignment (x′,y′)↦c′ is continuous for the sup metric ρ(g,h):=sup⁡t∈[0,1]d(g(t),h(t)), which induces uniform convergence (Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on YX and on C(X,Y)): if xn′→x′ and yn′→y′ in X then the corresponding local geodesics converge uniformly.

Facts & Assumptions

Given: A complete metric space X that is locally CAT(0), and a local geodesic c:[0,1]→X into it, with its constant-speed parametrization; write λ=L(c) for its speed.

[F1]

Locally CAT(0) means every point x has a positive radius r(x) with Bˉ(x,r(x)) CAT(0) in the induced metric; the induced metric on Bˉ(x,r(x)) is a geodesic metric and is complete when X is complete and r(x) finite, the ball being closed in X (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: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[F2]

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: d(γ(t),δ(t))≤(1−t)d(γ(0),δ(0))+t d(γ(1),δ(1)); the midpoint inequality d(z,m)2≤12d(z,y)2+12d(z,y′)2−14d(y,y′)2 holds for every midpoint m of a geodesic [y,y′] (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)).

[F4]

Length: for a path γ the length L(γ) is the supremum of its polygonal sums; it is lower semicontinuous under uniform convergence; the chord bound d(γ(s),γ(t))≤L(γ∣[s,t]) and the additivity L(γ∣[a,w])=L(γ∣[a,v])+L(γ∣[v,w]) hold (Length in a metric target: lower semicontinuity and arc-length reparametrization).

[F5]

Continuity at a parameter gives a neighbourhood whose image lies in any prescribed ball about its image; (X,d) satisfies the triangle inequality and the reverse triangle inequality ∣d(x,z)−d(y,z)∣≤d(x,y) (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form, Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, The reverse triangle inequality ∣d(x,z)−d(y,z)∣≤d(x,y) in any metric space).

[F6]

A sequence in a metric space converges when its distances to the limit tend to 0, and uniform convergence of maps into X is the metric-distance condition of Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on YX and on C(X,Y). For continuous maps on [0,1], ρ(g,h)=sup⁡td(g(t),h(t)) is finite because t↦d(g(t),h(t)) 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: xk→x iff d(xk,x)→0 in R, Cauchy sequence in a metric space, Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on YX and on C(X,Y), Complete metric space: every Cauchy sequence converges in the space).

Proof

1.1F2algebra

Convexity of balls in a CAT(0) space. Let Y be CAT(0), y0∈Y, r>0 and u,v∈Bˉ(y0,r); let m be a midpoint of the unique geodesic [u,v]. By [F2] the midpoint inequality gives d(y0,m)2≤12d(y0,u)2+12d(y0,v)2−14d(u,v)2≤r2, so m∈Bˉ(y0,r); iterating the same computation for the midpoints of [u,m] and [m,v] and so on, every dyadic point of [u,v] lies in Bˉ(y0,r), and the dyadic points are dense in [0,1], so continuity of the geodesic [F2] puts all of [u,v] in Bˉ(y0,r). Hence Bˉ(y0,r) is convex.

2.1step 1.1F1F2F3

A uniform radius. Consider all pairs (t,r) with r>0 and Bˉ(c(t),r) CAT(0). Their open half-radius balls cover the compact image of c, so [F3] supplies finitely many B(c(ti),ri/2) covering it, without choosing a radius at every point. Put ε=14min⁡iri>0. For every t, some i has d(c(t),c(ti))<ri/2, and 2ε≤ri/2, so Bˉ(c(t),2ε)⊆Bˉ(c(ti),ri). This ball is thus a ball in a CAT(0) space, hence complete (it is closed in the complete space X) and convex by step 1.1; in particular it is uniquely geodesic and has the convexity property [F2] for pairs of geodesics inside it.

3.1step 2.1F2algebra

Convexity tools. For geodesics g,h in one CAT(0) chart, introduce the geodesic k from g(0) to h(1): the common-initial-point estimate of [F2], followed by the same estimate on reversed geodesics, gives d(g(t),h(t))≤t d(g(1),h(1))+(1−t)d(g(0),h(0)). 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 g,h satisfying d(c(t),g(t)),d(c(t),h(t))<ε, the function d(g(t),h(t)) 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.

4.1step 2.1step 3.1F4choose

Initial existence. Let P(A) mean that for every [a,b]⊆[0,1] with 0<b−a<A and endpoints u,v at distances <ε from c(a),c(b) there is a constant-speed local geodesic g:[a,b]→X with d(c(t),g(t))<ε throughout. Take A0>0 such that λA0<ε (any A0 if λ=0). Both endpoints then lie in B(c(a),2ε); its geodesic joins them. The restriction of c 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 P(A0) holds.

4.2assume-hypstep 3.1F6constructalgebra

Alternating-thirds construction. Suppose P(A) and 0<b−a<3A/2; set a1=a+(b−a)/3 and b1=a+2(b−a)/3. Put p0=c(a1) and q0=c(b1). For n≥1, use P(A) on [a,b1] and [a1,b] to obtain gn from u to qn−1 and hn from pn−1 to v, and set pn=gn(a1), qn=hn(b1). Step 3.1 makes all these choices unique. Set r=max⁡{d(c(a),u),d(c(b),v)}<ε. Convexity shows inductively that each entire curve is within r of c. It also gives d(p1,p0),d(q1,q0)≤r/2 and, for n≥1, d(pn+1,pn)≤12d(qn,qn−1) and d(qn+1,qn)≤12d(pn,pn−1), since the evaluation points are halfway along their respective intervals and the other endpoints agree. Hence both increments at index n are at most r/2n. Both sequences are Cauchy, and completeness gives limits p,q in the closed r-balls around c(a1),c(b1).

5.1step 3.1step 4.2F2F5F6

Limits and overlap. Step 3.1 also gives sup⁡d(gn+1,gn)≤d(qn,qn−1) and sup⁡d(hn+1,hn)≤d(pn,pn−1); summing the geometric series yields uniform limits g,h. To verify they are local geodesics, fix a parameter and a small interval on which c and all these curves lie in one ball of step 2.1, using the strict margin r<ε and continuity of c. 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 [a1,b1], the endpoints of g and h are p,q, so step 3.1 identifies them on the overlap. Their union is a constant-speed local geodesic on [a,b] (if the overlap is constant, both speeds are zero). Its separation from c is locally convex and therefore convex, bounded by the endpoint maximum r. This proves P(3A/2).

6.1step 4.1step 5.1step 3.1algebra

Existence and uniqueness. Iteration yields P((3/2)kA0) for all k; choose k with (3/2)kA0>1 to obtain c′ on [0,1]. Step 3.1 makes its separation from c convex and gives d(c(t),c′(t))≤(1−t)d(c(0),x′)+t d(c(1),y′)<ε. Conversely every candidate with convex separation has this bound, and step 3.1 identifies any two candidates with the same endpoints.

7.1step 3.1step 6.1F4algebra

Length with one endpoint fixed. Suppose g,h are two solutions in this tube with g(0)=h(0). For sufficiently small t>0 both initial restrictions are minimizing, so step 3.1 and the triangle inequality give tL(h)=d(h(0),h(t))≤d(g(0),g(t))+d(g(t),h(t))≤tL(g)+t d(g(1),h(1)). Divide by t to obtain L(h)≤L(g)+d(g(1),h(1)). Let k be the solution from x′ to c(1) given by step 6.1. Apply this inequality first to the reversed curves c,k and then to k,c′: L(k)≤L(c)+d(c(0),x′) and L(c′)≤L(k)+d(c(1),y′). This is the asserted length bound.

8.1step 3.1step 6.1F6∎

Endpoint continuity. For solutions cn′,c′ in the same tube, step 3.1 gives sup⁡td(cn′(t),c′(t))≤max⁡{d(xn′,x′),d(yn′,y′)}. When the endpoints converge the right side tends to zero, which proves uniform convergence and clause (ii).

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

The space of local geodesics, its length metric, and the covering criterion for local isometries

Statement

Let X 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 x0∈X, and let Gx0 be the set of constant-speed local geodesics c:[0,1]→X with c(0)=x0, together with the constant path at x0, carrying the sup metric dG(c,c′)=sup⁡t∈[0,1]d(c(t),c′(t)) (Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on YX and on C(X,Y)). Then:

(i) (Gx0,dG) is complete; the truncation map Φ:Gx0×[0,1]→Gx0, Φ(c,s)(t):=c(st), is continuous and contracts Gx0 to the constant path, so Gx0 is contractible and simply connected (Nullhomotopic maps and contractible spaces, Simply connected topological spaces).

(ii) The endpoint evaluation exp⁡:Gx0→X, exp⁡(c):=c(1), is a local isometry: for every c there is ρ>0 such that exp⁡ restricts to an isometry of the ρ-ball about c onto the ρ-ball about c(1) in X (Isometry, isometric embedding, and the subspace metric on a subset, Open ball, closed ball and sphere in a metric space).

(iii) Define d^(c,c′) to be the infimum of LdG(η) over continuous paths η:[0,1]→Gx0 from c to c′, where length is computed in the metric dG (Length in a metric target: lower semicontinuity and arc-length reparametrization). With this induced length metric, (Gx0,d^) is a complete length space, d^ induces the same topology as dG, and exp⁡:(Gx0,d^)→X is a local isometry and a covering map (Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings); in particular exp⁡ is surjective and (Gx0,d^) is a universal covering space of X (Universal covering spaces).

(iv) Metric covering criterion. Let Y be a nonempty connected complete metric space, let Z 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 f:Y→Z be a local isometry; then f is a covering map. More precisely, f is surjective, and every z∈Z has a uniquely geodesic neighbourhood U over which the fibres of f are discrete and f restricts to a homeomorphism on a disjoint family of open sheets.

Facts & Assumptions

Given: A connected complete locally CAT(0) length space X, a point x0∈X, and the space Gx0 of constant-speed local geodesics from x0 with the sup metric; in (iv) nonempty connected complete Y, connected locally uniquely geodesic Z with continuous local endpoint dependence and a local isometry f:Y→Z.

[F1]

Endpoint stability, with its uniform radius ε, uniqueness and convex-separation statements, continuity in the endpoints, and the length bound L(c′)≤L(c)+d(c(0),x′)+d(c(1),y′) (Endpoint stability for local geodesics in complete locally CAT(0) spaces).

[F2]

Closed balls contained in local CAT(0) charts are convex and complete when X 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).

[F3]

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).

Proof

1.1F1F2F5

Completeness of the sup metric. For c,c′∈Gx0, d(c(t),c′(t))≤L(c)+L(c′), so the supremum defining dG is finite; separation and symmetry follow pointwise, and taking suprema in the pointwise triangle inequality proves its triangle inequality. Convergence in dG is exactly uniform convergence. Let (cn) be uniformly Cauchy. Completeness of X gives a uniform continuous limit c with c(0)=x0. Near any parameter, choose a closed CAT(0) ball centred at c(t) and a nontrivial parameter interval on which c lies strictly inside that ball. Uniform convergence puts every sufficiently late cn on this interval inside the same ball. Each restricted cn is that chart's geodesic, by the local-convexity argument proved in [F1]. Therefore d(cn(u),cn(v))=L(cn)∣u−v∣ throughout that interval. Fix two distinct parameters there: their converging chord lengths show that L(cn) has a finite limit λ. Passing the distance equality to the limit on each such interval gives d(c(u),c(v))=λ∣u−v∣ locally with the same λ throughout. Thus c∈Gx0, and it is the sup-metric limit.

1.2F1F4F5algebra

Contraction. Truncations Φ(c,s)(t)=c(st) belong to Gx0, including the constant path at s=0, and dG(Φ(c,s),Φ(c′,s′))≤dG(c,c′)+L(c′)∣s−s′∣. This proves joint continuity at each (c′,s′), and Φ(c,0) is constant while Φ(c,1)=c. This contraction shows contractibility directly: for every continuous map f:Gx0→Z, composition f∘Φ is a homotopy from a constant to f. For a loop β based at any a∈Gx0, put H(c,s)=Φ(c,1−s) and as(u)=H(a,su). The loops as∗(H(β(−),s))∗aˉs, using three equal parameter pieces, form a continuous based homotopy from β with constant pauses to a1∗aˉ1 with a constant middle piece. Pauses are removed by linear reparametrization, and the latter retracing loop contracts by replacing a1 with u↦a1((1−v)u), 0≤v≤1, on both halves. Every basepoint therefore has trivial fundamental group; the truncation paths also give path connectedness. Thus Gx0 is simply connected without a change-of-basepoint theorem.

1.3F1F2F5

The evaluation chart. Fix c and an endpoint-stability radius ε. Shrink to a radius 0<ρ<ε such that every Bˉ(c(t),2ρ) is contained in a CAT(0) chart: the preimages under c of all open half-radius balls B(a,r/2) with Bˉ(a,r) CAT(0) cover [0,1], so compactness gives finitely many such balls, and ρ<14min⁡r suffices. For any two local geodesics g,h with dG(g,c),dG(h,c)≤ρ, 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 t↦d(g(t),h(t)) locally and hence globally, as in [F1]. Each endpoint y with d(y,c(1))<ρ has the solution cy from [F1]; convex separation from c gives dG(c,cy)≤d(c(1),y)<ρ. Conversely a local geodesic g with dG(g,c)<ρ has convex separation from c, so [F1] identifies it with cg(1). Pairwise convexity now gives d(cy(t),cz(t))≤t d(y,z); at t=1 this yields dG(cy,cz)=d(y,z). Thus evaluation is an isometry between the open ρ-balls. The same argument identifies each smaller closed ball, whose endpoints are still within ε.

1.4F2F3F4F5construct

A covering criterion with continuous radial geodesics. First consider a nonempty complete connected locally geodesic metric space Y, a connected locally uniquely geodesic metric space Z whose local geodesics depend continuously on endpoints, and a local isometry f:Y→Z. Any finite-length path in Z 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 Z 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 Z. Choose y0∈Y; lifting such paths from f(y0) proves surjectivity. Choose an open uniquely geodesic ball U at z. For each y∈f−1(z) lift its radial geodesics and denote their endpoints by sy(w). These endpoints depend continuously on w: 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 sy is continuous and f∘sy=idU. Near each sy(w), continuity and the inverse chart show that sy equals the local inverse of f, 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 U lies in a section, by lifting that reversed path first. These sections are precisely the required evenly covered sheets.

2.1step 1.1step 1.2step 1.3F2F3F5

The length metric. For s,s′∈[0,1], dG(Φ(c,s),Φ(c,s′))≤L(c)∣s−s′∣, so the contraction supplies finite-length paths to the constant path and d^ is finite. Path reversal and concatenation give symmetry and the triangle inequality for d^; the chord bound gives d^≥dG, 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 d^=dG for pairs in a sufficiently small concentric ball. The metrics thus have the same topology. For any rectifiable continuous path η in Gx0, the definition gives d^(η(a),η(b))≤LdG(η∣[a,b]); summing over partitions and using d^≥dG yields Ld^(η)=LdG(η). Taking the infimum over these paths proves that d^ is a length metric. A d^-Cauchy sequence has a dG-limit by step 1.1; eventually it and its limit lie in such a smaller ball, where equality implies convergence also in d^. Therefore d^ is complete and evaluation remains a local isometry.

3.1step 1.2step 1.3step 2.1step 1.4F2F4

Application to (i)–(iii). Apply step 1.4 to Y=(Gx0,d^) and Z=X: steps 1.3 and 2.1 supply local geodesicity, completeness and the local isometry, and X has convex CAT(0) balls with continuously varying geodesics by [F2]. The contraction in step 1.2 makes Y connected and simply connected. Evaluation is therefore a surjective covering and a universal covering. This proves (i)–(iii) without invoking the stronger clause (iv).

4.1step 1.4F4F5∎

General criterion (iv). A local isometry from Y to Z identifies a neighbourhood of each point of Y with a neighbourhood in Z. Shrinking further to a convex geodesic neighbourhood in Z makes Y 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.
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Complete, simply connected, locally CAT(0) length spaces are CAT(0)

Statement

Let X be a connected complete metric space that is locally CAT(0) and a length space, and suppose X 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 x0∈X the endpoint evaluation exp⁡:Gx0→X 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 X are joined by exactly one local geodesic, which is a minimizing geodesic (Geodesics and geodesic metric spaces).

(ii) Every geodesic triangle in X satisfies the CAT(0) inequality; hence X is CAT(0).

(iii) For every x0∈X the geodesic contraction H:X×[0,1]→X, where Ht(x) is the point at distance t d(x0,x) from x0 on the unique geodesic from x0 to x, is continuous and satisfies d(Ht(x),Ht(y))≤t d(x,y) for all x,y∈X and t∈[0,1]; in particular X is contractible.

Facts & Assumptions

Given: A connected complete locally CAT(0) length space X that is simply connected, a point x0∈X, the space Gx0 of constant-speed local geodesics from x0, and the endpoint evaluation exp⁡:Gx0→X.

[F1]

exp⁡:Gx0→X 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).

[F3]

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 L(c′)≤L(c)+d(c(0),c′(0))+d(c(1),c′(1)) (Endpoint stability for local geodesics in complete locally CAT(0) spaces).

[F4]

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).

Proof

1.1F1F2F5

The covering is trivial. By [F1] exp⁡ is a covering with simply connected total space; X is connected, complete and locally CAT(0), hence locally path-connected and path-connected, so [F2] applies and every connected covering of X is one-sheeted; in particular exp⁡ is a homeomorphism.

2.1step 1.1F1F5

Uniqueness of local geodesics between two points. Since exp⁡ is a bijection, for every q∈X there is exactly one constant-speed local geodesic from x0 to q; applying the same argument with x0 replaced by an arbitrary point p (the hypotheses are invariant under the change of base point) gives exactly one constant-speed local geodesic from p to q for every pair p,q∈X.

3.1step 2.1F3F5algebra

Minimization by finite subdivision. Let γ:[0,1]→X be any rectifiable path from p to q, and denote the unique local geodesic from p to γ(s) by cs, parametrized on [0,1]. For each s, [F3] gives a neighbourhood of γ(s) and endpoint-stability solutions based on cs; uniqueness in step 2.1 identifies these with ct for all sufficiently nearby t. On such a parameter neighbourhood the fixed-initial-point length estimate proved in [F3] gives ∣L(ct)−L(cu)∣≤d(γ(t),γ(u)) 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 [0,1]; subdivide 0=t0<⋯<tN=1 so that each consecutive pair belongs to one neighbourhood (a positive subdivision size exists by compactness). Summing gives L(c1)−L(c0)≤∑id(γ(ti−1),γ(ti))≤L(γ). Here c0 is constant. Thus L(c1)≤L(γ) for every rectifiable path. Since X is a length space, taking the infimum gives L(c1)≤d(p,q), and the reverse inequality is the chord bound. This proves minimization without a mesh-error assertion.

4.1step 2.1step 3.1F3

Continuous dependence. By [F3] the unique local geodesics vary continuously with their endpoints, so the minimizing geodesic from p to q depends continuously on (p,q).

5.1step 2.1step 3.1step 4.1F4F5construct

Verification of the patchwork hypotheses. Consider a triangle with vertices p,q0,q1 and let γ parametrize [q0,q1]. The unique geodesics cs from p to γ(s) form a continuous sweep by step 4.1; evaluation (s,t)↦cs(t) is continuous, since uniform convergence controls evaluation and each fixed geodesic is continuous. Every image point z 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 z. 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 κ=0, since D0=∞. 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.

6.1step 5.1F4algebra

Vertex-to-side comparison. Let r be an interior point of [q0,q1] in a nondegenerate triangle and join p to r by the unique geodesic. By step 5.1 the comparison angles of (p,q0,r) and (p,r,q1) dominate their actual angles. At r these two actual angles have sum at least π: take points x,y on the opposite base germs at equal small distance h from r and z on the germ toward p at small distance k. In a CAT(0) chart the midpoint inequality gives d(z,x)2+d(z,y)2≥2k2+2h2. The Euclidean cosine rule therefore gives cos⁡∠~r(x,z)+cos⁡∠~r(z,y)≤0, 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 [p,r], placing the base vertices on opposite sides. Alexandrov's straightening inequality F4(2) gives d(p,r)≤d2(pˉ,rˉ) in the comparison triangle of (p,q0,q1), with rˉ at the same distance from qˉ0 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 r=qi 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.

7.1step 4.1F4F5∎

Conclusion of (iii). Let Ht(x) be the point at distance t d(x0,x) from x0 on the unique geodesic from x0 to x, which exists and is unique by steps 2.1–3.1; then H is continuous by step 4.1, H0 is constant and H1 is the identity. For x,y∈X the geodesics from x0 to x and from x0 to y have the common initial point x0 and proportional parametrizations, so the convexity clause [F4] gives d(Ht(x),Ht(y))≤(1−t)d(x0,x0)+t d(x,y)=t d(x,y). For every continuous map f:X→Y, the map (x,s)↦f(H1−s(x)) is a homotopy from f to the constant f(x0), so X is contractible in the convention of [F5].

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

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 X 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) X is CAT(1) if and only if X contains no isometrically embedded circle of length <2π (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences clause (vi)).

(ii) If X is not CAT(1), then there is an isometrically embedded circle in X of length 2injrad⁡(X)<2π, where injrad⁡(X) is the supremum of the numbers r≥0 such that every pair of points at distance <r is joined by a unique geodesic segment; in particular injrad⁡(X)>0.

(iii) Comparison below a uniqueness threshold. Let 0<R≤π. If every pair of points of X at distance <R is joined by a unique geodesic, then every geodesic triangle of perimeter <2R satisfies the spherical CAT(1) comparison inequality for all pairs of points on its sides: d(u,v)≤dS(uˉ,vˉ) 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 X, and the injectivity radius defined in the Statement.

[F1]

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).

[F3]

The patchwork sweep gives vertex angle comparison for a triangle of perimeter <2π 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).

Proof

1.1F1given

A short circle obstructs CAT(1). An isometric copy of Sℓ1, ℓ<2π, has geodesic triangle sides that remain geodesics in X, with exactly the same side and cross distances. The circle's failed CAT(1) test in [F1] is therefore a failed test in X. 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.

1.2F1F2F4choose

A positive uniform uniqueness radius. Consider the family of all CAT(1) closed balls with radii 0<ρ<π/4; their open half-radius balls cover X. Shrinking is legitimate: balls of radius <π/2 in a CAT(1) chart are convex, since each center-and-endpoints triangle has perimeter <4ρ<2π and its spherical comparison stays in the model ball. The open half-radius balls cover X; take finitely many, with radii ρi, and put ε=min⁡iρi/4. If d(x,y)<ε and x lies in the ith half-ball, every geodesic from x to y lies in its full ball, since each of its points is within d(x,y) of x. Any two such geodesics coincide by the CAT(1) test on their digon with a zero third side, whose perimeter is 2d(x,y)<2π. Thus r:=injrad⁡(X)≥ε>0.

1.3F2F4given

Continuity under short uniqueness. Suppose 0<R≤π and all pairs at distance <R have unique geodesics. If endpoints un,vn converge to u,v with d(u,v)<R, parametrize their geodesics on [0,1]. Their speeds d(un,vn) are bounded, hence they are equicontinuous into compact X. By [F2] every subsequence has a uniformly convergent further subsequence; the distance equality d(cn(s),cn(t))=∣s−t∣d(un,vn) passes to the limit by [F4], making that limit the unique geodesic from u to v. 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.

2.1step 1.3F1F3F4

Angle comparison below the uniqueness threshold. For a triangle of perimeter P<2R, every side has length <R. For any point v of the side opposite p, the two boundary routes give 2d(p,v)≤P<2R. Step 1.3 supplies a continuous sweep of the unique geodesics [p,v]. If p is off that side, patchwork [F3] gives angle comparison. If p 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 <2R has vertex angle comparison.

3.1step 2.1F1F3F4algebra

Comparison at scale R and the compact uniqueness criterion. Under the hypothesis of (iii), use step 2.1 with that R. For a point v interior to the side [q0,q1] of a triangle of perimeter P<2R, the two triangles (p,q0,v) and (p,v,q1) have perimeter at most P. Their actual angles at v have sum at least π by [F3], and therefore so do their comparison angles. Glue their models along the common side [pˉ,vˉ] on opposite sides; the four boundary lengths sum to P<2R≤2π. Alexandrov's marked-point comparison [F3] then gives d(p,v)≤dS(pˉ,vˉ) in the comparison triangle of (p,q0,q1). Collinear submodels follow by the closed limiting cosine inequalities; p=v or p 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 x∈[p,q], y∈[p,z], first apply it in (p,x,z) to obtain d(x,y)≤dS(x^,y^); then apply it in (p,q,z) to obtain d(x,z)≤dS(xˉ,zˉ). These subtriangles have perimeter at most the original perimeter. The spherical cosine rule shows that the second inequality bounds the model angle at p in (p,x,z) by the original model angle at pˉ, and the first then bounds d(x,y) by dS(xˉ,yˉ): 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 2R. Taking R=π proves that short uniqueness makes X CAT(1). Conversely CAT(1) implies uniqueness below π by its digon test. We have proved, rather than assumed, the compact short-uniqueness criterion.

4.1step 1.2step 3.1F4

The first failure is below π. Suppose X is not CAT(1). Step 3.1 gives two distinct geodesics between points of distance L<π. Uniqueness cannot hold at any radius greater than L, so 0<r≤L<π. For every pair at distance <r, 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 R=r.

5.1step 4.1F2F4choose

A limiting minimizing digon. For each positive integer n choose a pair of distinct geodesics with common endpoints and length Ln<r+δn, where δn>0 tends to zero and r+δn<π; such a pair exists by the definition of r, and Ln≥r. This countable selection uses AC. Parametrize both sides on [0,1]; they are uniformly Lipschitz with speeds Ln. Apply [F2] to the first sides and then to the corresponding second sides to obtain simultaneous uniform limits c,c′ and limits x,y of the endpoints. Passing the distance equalities to the limit shows that both are geodesics from x to y of length r.

6.1step 2.1step 4.1step 5.1F1F3F4algebra

Explicit noncollapse of the digons. Suppose c=c′. Their midpoints mn,mn′ then have distance hn→0. Put an=Ln/2<π/2. For large n, Ln+hn<2r; thus each triangle (xn,mn,mn′) and (yn,mn,mn′) has perimeter 2an+hn<2r and angle comparison by steps 2.1 and 4.1. If hn>0, its comparison angle θn at mn′ satisfies cos⁡θn=cos⁡an(1−cos⁡hn)/(sin⁡ansin⁡hn)>0, so θn<π/2. But the two actual angles at mn′ sum to at least π, because mn′ is interior to a geodesic and [F3] applies; comparison bounds their sum by 2θn<π, a contradiction. Consequently hn=0. Since an<r for large n, uniqueness identifies both halves through the common midpoint, contradicting the distinctness of the original digon sides. Therefore c≠c′.

7.1step 2.1step 4.1step 6.1F1F3F4algebra

Opposite points have distance r. Use arclength parameters on c,c′ and take z=c(a), z′=c′(b) with a+b=r. If a=0 or b=0 their distance is r. Otherwise a,b>0 and h=d(z,z′)≤r by the two routes through x,y. Suppose h<r. If h=0, the endpoint segments all have lengths a,b<r and uniqueness makes both digon sides coincide, a contradiction. If h>0, both triangles (x,z,z′), (y,z,z′) have perimeter r+h<2r, hence angle comparison. Their model angles θx,θy at z′ satisfy cos⁡θx+cos⁡θy=sin⁡r(cos⁡(a−b)−cos⁡h)sin⁡asin⁡bsin⁡h. The reverse triangle inequality gives h≥∣a−b∣. If h>∣a−b∣, the displayed quantity is positive, whereas θx+θy≥π (the actual angle sum is at least π) would give cos⁡θx+cos⁡θy=2cos⁡((θx+θy)/2)cos⁡((θx−θy)/2)≤0. Thus h=∣a−b∣. If a≥b, the equality d(x,z)=d(x,z′)+d(z′,z) puts z′ on a geodesic from x to z; that geodesic is unique since a<r, so z′ lies on c. The unique segments from x and y to z′ (of lengths b,a<r) are then the corresponding subsegments of both sides, making c=c′. If b≥a, interchange the sides. This contradiction proves h=r.

8.1step 4.1step 7.1F1F4∎

All circle distances, and conclusion. For arbitrary c(s),c′(t) let w=c′(r−s) be opposite c(s). Step 7.1 and the reverse triangle inequality give d(c(s),c′(t))≥r−∣t−(r−s)∣=min⁡{s+t,2r−s−t}; the two routes through x,y give the reverse bound. Distances on either single side already equal parameter differences. Thus traversing c and then c′ backwards gives an isometry S2r1→c([0,r])∪c′([0,r]): the distance formula also excludes every additional identification. Since 0<r<π, 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 2r. AC is used for the near-minimal sequence and the Ascoli extractions, including the continuity argument.

5 · Examples, counterexamples and false statements

None yet.

Sources