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 · 3 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 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Short Loop Polygons and Quantitative Energy Decrease

1 · Prerequisites

2 · Summary

The finite spherical metric-flag proof needs quantitative short-loop homotopy control that generic homotopy and compactness suppliers do not establish: a loop of length <2π cannot be contracted through loops of length <2π across a closed local geodesic, and the failure is detected by a uniform energy decrement along midpoint iteration. This page expands Bowditch's energy and comparison-disk proof into explicit ordered local suppliers and states the resulting short-loop criterion for compact locally CAT(1) spaces.

The page fixes its conventions first: Short loops, the uniform-plus-length topology, short-loop homotopies, and nonshrinkability defines short loops, the uniform-plus-length topology, short-loop homotopies and nonshrinkability, and Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin fixes a uniform local radius l<π/2, the cyclic tuples of mesh <l, their length and energy functionals, the midpoint operation f and the zero-limit basin Ch0(n). The midpoint machinery is analysed in Existence of the uniform radius, continuity of the midpoint operation, the energy drop, its equality case, and convergence of zero-limit polygons: lengths, mesh and energy do not increase, equality holds exactly for constant tuples and equally spaced lists of points of a closed local geodesic, and the basin is characterised by an iterate of length <l/2. Local CAT(1) of the l2 product from a model S2×S2 sine-comparison calculation supplies the CAT(1) product comparison used at every perturbation step, and Short local geodesics in a CAT(1) space are geodesics, and closed local geodesics have length at least 2π the short-geodesic uniqueness and local-geodesic facts.

The quantitative heart of the page is The spherical radius estimate, the quadrilateral separation constant, and the finite midpoint-operation comparison disk: the finite midpoint-operation comparison disk, its radius estimate η=(π−r)/2 for loops of length 2r, the intrinsic quadrilateral separation constant δ, and the resulting one-step deficit ζk≤(ξk+ξk+1)/2−δ. Perturbation by a Euclidean regular polygon: comparison-disk bounds for degenerate comparison triangles removes the nondegeneracy hypothesis by a product with a collapsing Euclidean regular polygon, and The uniform energy decrement on the basin, bounded iteration, and the closedness of the basin inside the short polygon space turns the deficit into the uniform decrement E(fx)≤E(x)−λn(L(x)), the bounded iteration statement on length bands, and the clopenness of the basin inside the short polygon space with the exclusion of straight equilateral tuples. Finally Polygon transfer, the basin as the shrinkable class, and the short-loop criterion transfers between rectifiable loops and polygons, identifies the basin with the shrinkable class on polygons, proves that every loop shorter than the minimal embedded-circle length m is shrinkable, that m is attained as the minimum nonshrinkable length when m<2π, and collects the equivalent characterisations of global CAT(1) for compact locally CAT(1) spaces.

The companion page short-loop-polygons-and-quantitative-energy-decrease-examples tests the constructions: midpoint iteration on a small spherical triangle, equally spaced points on a short metric circle, the null-homotopy versus short-loop comparison on S2 and on Sℓ1, and the zero-length boundary of the energy criterion. Required earlier pages: cat-comparison-link-criteria-and-local-globalization. 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 →

Short loops, the uniform-plus-length topology, short-loop homotopies, and nonshrinkability

Definition

Fix the following definitions and conventions; they are used throughout this page. Let X be a compact locally CAT(1) metric space (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles, Open cover, subcover, compact metric space, and compact subset of a metric space).

(1) Rectifiable loops and normalization. A loop in X is a continuous map γ ⁣:[0,1]→X with γ(0)=γ(1); its length L(γ)∈[0,∞] is 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). A rectifiable loop is normalized if it is parametrized proportionally to arclength, i.e. L(γ∣[s,t])=(t−s) L(γ) for all 0≤s≤t≤1 (Intervals of R: the nine order-convex forms, nondegeneracy, and length); by the arc-length parametrization clause of Length in a metric target: lower semicontinuity and arc-length reparametrization every rectifiable loop of positive length has a normalized reparametrization, and a loop of length 0 is normalized exactly when it is constant. Henceforth every loop on this page is normalized.

(2) Short loops. A loop γ is short if L(γ)<2π (Pi is the first positive zero of sine). The constant loop at any point is short.

(3) The uniform-plus-length topology. For loops γ,γ′ write γk→γ in the uniform-plus-length topology when sup⁡t∈[0,1]d(γk(t),γ(t))→0 and L(γk)→L(γ) (Limits and Cauchy sequences of reals). Uniform convergence of the maps alone does not bound rectifiable lengths, so the length term belongs to the topology by definition; the resulting uniform length bound b<2π and the common fine mesh of a compact short family are proved in Polygon transfer, the basin as the shrinkable class, and the short-loop criterion ↗.

(4) Short-loop homotopies. A short-loop homotopy from γ0 to γ1 is a family (γs)s∈[0,1] of short loops with γ0,γ1 the given loops such that s↦γs is continuous for the uniform-plus-length topology (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form). A short loop is shrinkable if it is short-loop homotopic to some constant loop, and nonshrinkable otherwise. Short-loop homotopy is an equivalence relation on short loops (reflexivity, symmetry and transitivity hold by reparametrizing the parameter interval).

(5) Comparison with ordinary null-homotopy. A null-homotopy of a short loop allows intermediate loops of arbitrary length, whereas a short-loop homotopy demands that every intermediate loop be short; the comparison of the two notions, and the fact that a closed local geodesic is never shrinkable, are theorems of this page, not part of the definition.

(6) Polygons are defined separately. The cyclic tuples, midpoint operation and zero-limit basin used below are defined without reference to short-loop homotopy; their identification with the classes of (4) is a theorem proved after the basin's topological properties are established.

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

Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin

Definition

Let X be a compact locally CAT(1) metric space (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles, Open cover, subcover, compact metric space, and compact subset of a metric space).

(1) Uniform local CAT(1) radius. A real number l>0 is a uniform local CAT(1) radius for X if every closed ball Bˉ(x,r)⊆X with x∈X and 0<r≤l (Open ball, closed ball and sphere in a metric space), with the induced metric, is a CAT(1) space. Such an l exists and may be chosen with l<π/2 (Pi is the first positive zero of sine); the existence proof is part of Existence of the uniform radius, continuity of the midpoint operation, the energy drop, its equality case, and convergence of zero-limit polygons ↗ and is not asserted by this definition. Fix such an l for the remainder of the page.

(2) Cyclic tuples, mesh, length, energy. Fix an integer n≥3 and a real h with 0<h<l. For a tuple x=(x0,…,xn−1)∈Xn the indices are read modulo n, and mesh⁡(x):=max⁡0≤i<nd(xi,xi+1),L(x):=∑i=0n−1d(xi,xi+1),E(x):=∑i=0n−1d(xi,xi+1)2. The mesh-h polygon space is Ph(n):={x∈Xn:mesh⁡(x)≤h}; its points are called cyclic small-mesh polygons. Fixing n (rather than letting the vertex count grow) is essential: the quantitative constants of this page depend on n but not on h, and they are not uniform in a variable vertex count.

(3) The midpoint operation. For x∈Xn with mesh⁡(x)<l, consecutive vertices satisfy d(xi,xi+1)<l<π/2, and the closed ball Bˉ(xi,l) is CAT(1); by the convexity and uniqueness clause for balls of radius <π/2 (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences) the geodesic segment [xi,xi+1] inside that ball is unique (Geodesics and geodesic metric spaces) and has a unique midpoint. Define f(x)∈Xn by f(x)i:=mid⁡(xi,xi+1) for 0≤i<n. Continuity of f on {mesh⁡<l} and the invariance mesh⁡(fx)≤mesh⁡(x), which make f a self-map of Ph(n), are proved in Existence of the uniform radius, continuity of the midpoint operation, the energy drop, its equality case, and convergence of zero-limit polygons ↗. Write fk for the k-fold iterate.

(4) The zero-limit basin. Ch0(n):={x∈Ph(n):fk(x) is defined for every k≥0 and lim⁡k→∞L(fkx)=0} (Limits and Cauchy sequences of reals). By (3) the definability condition is automatic on Ph(n), so Ch0(n)={x∈Ph(n):lim⁡kL(fkx)=0}; this set is the zero-limit basin. It is defined purely through the iterated lengths, without reference to short-loop homotopy; its identification with a short-loop class is proved later on this page, after its topological properties are established.

(5) Conventions. A tuple is constant if all its entries are equal; a constant tuple has mesh⁡=L=E=0 and is fixed by f (the midpoint of a degenerate segment is its point, in accordance with Geodesics and geodesic metric spaces). If some consecutive vertices coincide while the tuple is not constant, the corresponding edge contributes 0 to mesh, length and energy, and the midpoint operation is applied to the (possibly degenerate) pair by the same rule.

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

Existence of the uniform radius, continuity of the midpoint operation, the energy drop, its equality case, and convergence of zero-limit polygons

Statement

Let X be compact and locally CAT(1), and let l, n≥3 and h<l be as in Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin. Then:

(i) The uniform radius, compactness and continuity. A uniform local CAT(1) radius l for X exists, and one may assume l<π/2; every x∈Xn with mesh⁡(x)<l has a well-defined midpoint tuple f(x), and mesh⁡(fx)≤mesh⁡(x), so f restricts to a self-map of Ph(n). The space Ph(n) is a compact metric subspace of Xn, the functions mesh⁡, L and E are continuous on Xn, and f is continuous on {mesh⁡<l}.

(ii) The energy does not increase. For every x∈Ph(n) one has L(fx)≤L(x) and E(fx)≤E(x).

(iii) Equality analysis. E(fx)=E(x) holds if and only if either x is constant, or all n edge lengths d(xi,xi+1) equal a common value ξ>0 and every consecutive triple is straight, i.e. xi+1 is the midpoint of a geodesic segment from xi to xi+2 (equivalently d(xi,xi+2)=d(xi,xi+1)+d(xi+1,xi+2)). In the second case the concatenation of the n segments [xi,xi+1] is a closed local geodesic of length nξ on which x0,…,xn−1 are equally spaced. For n=2 the only equality case is the constant tuple.

(iv) The basin is the eventually-short-polygon set and is open. The set U:={x∈Ph(n):L(fmx)<l/2 for some m≥0} is open in Ph(n) and equals the zero-limit basin Ch0(n); in particular Ch0(n) is open.

(v) Convergence in the basin. If x∈Ch0(n), then L(fkx)→0 and the iterates converge to a constant tuple: if L(fmx)=0 an iterate is already constant and all subsequent iterates equal it; for every m with 0<L(fmx)<l/2 all later iterates lie in the closed ball Bˉ((fmx)0, L(fmx)/2), whose radii tend to 0, the diameters of the iterates tend to 0, and the whole sequence (fkx) converges in Xn to a constant tuple (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R). Conversely, if the iterates of x∈Ph(n) converge to a constant tuple, then x∈Ch0(n).

(vi) Degenerate and zero-length cases. If E(x)=0 then x is constant and fx=x. If some consecutive vertices of x coincide, the corresponding edge contributes 0 to mesh, length and energy, the midpoint of the degenerate pair is the point itself, and the statements (ii) and (iii) hold unchanged; the equality analysis includes collapsed comparison triangles by continuity.

Facts & Assumptions

Given: A compact locally CAT(1) space X, a uniform local radius l<π/2, an integer n≥3 and h<l, with Ph(n), f, L, E, mesh and Ch0(n) as in the definition.

[F1]

Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin: l is a uniform local CAT(1) radius when all closed balls of radius at most l are CAT(1); for mesh⁡(x)<l consecutive vertices are joined by a unique geodesic inside B(xi,l) and f(x)i=mid⁡(xi,xi+1); Ph(n)={x∈Xn:mesh⁡(x)≤h}; Ch0(n)={x∈Ph(n):lim⁡kL(fkx)=0}; a constant tuple has mesh⁡=L=E=0 and is fixed by f, and a degenerate pair has midpoint the point itself.

[F2]

Short local geodesics in a CAT(1) space are geodesics, and closed local geodesics have length at least 2π: in a CAT(1) space geodesics between points at distance <π are unique and depend continuously on their endpoints, and every nonconstant closed local geodesic has length at least 2π and image of diameter at least π.

[F3]

Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles: CAT(1) and locally CAT(1) spaces; a convex subset of a CAT(1) space with the induced metric is CAT(1); X is compact.

[F4]

Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences: comparison triangles of perimeter <2π exist in S2; the spherical cosine rule cos⁡c=cos⁡acos⁡b+sin⁡asin⁡bcos⁡γ; balls of radius <π/2 in a CAT(1) space are convex; the CAT(1) inequality holds for all pairs of points of a triangle of perimeter <2π.

[F5]

Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric: metric axioms, triangle inequality, and the product (sup) metric on Xn.

[F6]

Open ball, closed ball and sphere in a metric space: B(x,r)={y:d(x,y)<r} and Bˉ(x,r)={y:d(x,y)≤r}.

[F7]

Continuity of a map between metric spaces, at a point and globally, in the ε-δ form: continuity of maps between metric spaces, and continuity of finite maxima and sums of continuous functions.

[F9]

A product of finitely many compact spaces is compact in the product topology, A closed subset of a compact metric space is compact: finite products of compact spaces are compact and closed subsets of compact spaces are compact.

[F11]

Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R, Limits and Cauchy sequences of reals: convergence of sequences and of real nets as used in lim⁡kL(fkx)=0.

[F14]

A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: a continuous real-valued function on a nonempty compact metric space attains a positive minimum if it is everywhere positive.

Proof

technique · direct
1.1F1F3F4F10algebra

A uniform radius exists. By local CAT(1), every z∈X has a closed ball Bˉ(z,ρz) that is CAT(1); replacing ρz by min⁡{ρz,π/4} we may assume ρz<π/2, because a closed sub-ball of radius <π/2 of a CAT(1) ball is convex ([F4]) and a convex subset of a CAT(1) space with the induced metric is CAT(1) ([F3]). The open balls B(z,ρz/2) cover the compact space X, so by [F10] the cover has a Lebesgue number δ>0. Put l:=min⁡{δ/4,π/4}<π/2 and let x∈X, 0<r≤l: the closed ball Bˉ(x,r) has diameter at most 2r≤δ/2<δ, so it is contained in B(z,ρz/2)⊆Bˉ(z,ρz) for some z; as a ball of radius r≤π/4<π/2 in the CAT(1) space Bˉ(z,ρz) it is convex, and a convex subset of a CAT(1) space with the induced metric is CAT(1), so the induced metric on Bˉ(x,r) is CAT(1). Hence l is a uniform local CAT(1) radius and l<π/2; applying this with the given l replaced by the smaller number justifies the standing assumption.

1.2F1F2F4algebra

Pointwise midpoint bound. Let x∈Xn with mesh⁡(x)<l and put ξi:=d(xi,xi+1). For each i the three vertices xi,xi+1,xi+2 lie in the closed ball Bˉ(xi+1,l) of radius l, which is CAT(1) by [F1]; the triangle (xi,xi+1,xi+2) has perimeter at most 2(ξi+ξi+1)<4l<2π and its sides lie in the ball by convexity, so its comparison triangle in S2 exists and the CAT(1) inequality gives d(m1,m2)≤dS(mˉ1,mˉ2), where m1:=mid⁡(xi,xi+1)=f(x)i, m2:=mid⁡(xi+1,xi+2)=f(x)i+1 and mˉ1,mˉ2 are the comparison points of the model triangle. In the model, the two points lie at distances ξi/2 and ξi+1/2 from the vertex xˉi+1 with some included angle θˉ, so the cosine rule of [F4] gives cos⁡dS(mˉ1,mˉ2)=cos⁡(ξi/2)cos⁡(ξi+1/2)+sin⁡(ξi/2)sin⁡(ξi+1/2)cos⁡θˉ≥cos⁡((ξi+ξi+1)/2) by cos⁡θˉ≥−1 and the addition formula; since (ξi+ξi+1)/2<l<π/2 and cos⁡ is decreasing on [0,π], we conclude d(f(x)i,f(x)i+1)≤(ξi+ξi+1)/2. If one of the two half-edges vanishes the midpoint coincides with the vertex and the same conclusion is immediate, so the estimate holds for all tuples of mesh <l.

1.3F1F2F5F7F13algebra

Continuity. Endpoint distances are continuous by the reverse triangle inequality, so their finite maximum mesh and finite sums L,E are continuous. To check f at x of mesh <l, fix i and choose R with d(xi,xi+1)<R<l. The fixed chart Z=Bˉ(xi,R) is CAT(1). If xk→x, then for large k both endpoints xik,xi+1k belong to Z. Their short geodesic in Z is also the geodesic defining f(xk)i: both geodesics are contained in Bˉ(xik,l), since every point on either is at distance at most their endpoint distance <l from xik; uniqueness in that CAT(1) ball identifies them. Continuous endpoint dependence applied in the fixed CAT(1) space Z now gives f(xk)i→f(x)i. There are finitely many indices, so f(xk)→f(x).

2.1step 1.3F8F9algebra

Ph(n) is compact. The function mesh is continuous on Xn by step 1.3, so Ph(n)=mesh⁡−1([0,h]) is closed in Xn; the sup metric has the finite product topology (a radius-r ball is a product of coordinate radius-r balls, and every finite product neighborhood contains such a ball), so Xn is compact by [F9], hence Ph(n), a closed subspace of a compact space, is compact by [F9].

2.2step 1.2F1F12algebra

Monotonicity and the self-map property. For x∈Ph(n) and each i, step 1.2 gives d(f(x)i,f(x)i+1)≤(ξi+ξi+1)/2 with ξi=d(xi,xi+1); summing gives L(fx)≤12∑i(ξi+ξi+1)=L(x), and summing squares gives E(fx)≤14∑i(ξi+ξi+1)2, while ∑i(ξi+ξi+1)2=2∑iξi2+2∑iξiξi+1≤2∑iξi2+∑i(ξi2+ξi+12)=4∑iξi2=4E(x) by 2ab≤a2+b2 ([F12]), so E(fx)≤E(x). Also d(f(x)i,f(x)i+1)≤(ξi+ξi+1)/2≤mesh⁡(x), so mesh⁡(fx)≤mesh⁡(x)≤h: the midpoint operation maps Ph(n) into itself, and it is defined on all of Ph(n) because h<l. This proves (i)'s midpoint assertions and clause (ii).

3.1step 1.2step 2.2F1F4algebra

Equality analysis. Suppose E(fx)=E(x). Combining the two bounds of step 2.2, E(fx)≤14∑i(ξi+ξi+1)2≤E(x), so equality forces both 14∑i(ξi+ξi+1)2=E(x), i.e. ∑i(ξi−ξi+1)2=0 and hence all ξi are equal to a common ξ, and all the pointwise inequalities of step 1.2 to be equalities: d(f(x)i,f(x)i+1)=(ξi+ξi+1)/2=ξ for every i. If ξ=0 then all consecutive vertices coincide and x is constant. If ξ>0, fix i; in the notation of step 1.2 the equality d(m1,m2)=ξ combined with d(m1,m2)≤dS(mˉ1,mˉ2)≤ξ forces equality throughout, so cos⁡θˉ=−1 and θˉ=π; the comparison triangle is degenerate with d(xi,xi+2)=ξ+ξ=2ξ, so equality holds in the triangle inequality d(xi,xi+2)≤d(xi,xi+1)+d(xi+1,xi+2) and the concatenation of the two geodesics [xi,xi+1], [xi+1,xi+2] is a geodesic segment with midpoint xi+1. Conversely, if x is constant then fx=x and E(fx)=E(x)=0; and if all edge lengths equal ξ>0 and every triple is straight, then each d(f(x)i,f(x)i+1) equals ξ as the distance between the two points at distance ξ/2 from xi+1 on a common geodesic through it, so E(fx)=nξ2=E(x). In the nonconstant case the concatenation of the n segments [xi,xi+1], parametrized on Snξ1 by arclength, is by construction locally isometric at every point (at the vertices by straightness of the corresponding triple, inside the edges by the geodesic property) and has length nξ, so it is a closed local geodesic on which x0,…,xn−1 are equally spaced. For n=2 the two edges are d(x0,x1)=d(x1,x0)=ξ and f(x)0=f(x)1 is their midpoint, so d(f(x)0,f(x)1)=0 and equality E(fx)=E(x)=2ξ2 forces ξ=0: only the constant tuple.

3.2step 1.1step 1.3step 2.2F1F4F6F8F11algebra

Convergence in the basin. Let x∈Ch0(n), so Lk:=L(fkx)→0 by [F1]. If Lm=0 for some m, that iterate is constant and fixed by f, proving convergence. Otherwise all Lk>0; fix m with Lm<l/2; then each vertex (fmx)j is at distance at most Lm/2 from (fmx)0, because the two arcs of the polygon from (fmx)0 to (fmx)j have lengths summing to Lm, so the shorter one is at most Lm/2. The closed ball Bˉ((fmx)0,Lm/2) has radius <l/4<π/2 and is contained in the CAT(1) ball Bˉ((fmx)0,l), so it is convex by [F4]; hence it contains all vertices of fmx and, by induction, all vertices of fkx for k≥m, since each next iterate has as vertices midpoints of pairs of vertices of the previous one. Therefore d((fkx)i,(flx)i)≤Lm for all k,l≥m and all i, so (fkx) is Cauchy in the compact metric space Xn and converges to some z∈Xn ([F8], [F11]); taking limits in d(zi,zj)≤Lm for arbitrary m and using Lm→0 shows that z is constant and the diameters of the iterates tend to 0. Since L is continuous by step 1.3, L(fkx)→L(z)=0. Conversely, if fkx→z with z constant, then L(fkx)→L(z)=0 by continuity of L, so x∈Ch0(n).

4.1step 1.2step 2.2step 3.1F1F4algebra

Degenerate and zero-length cases. If E(x)=0 then every ξi=0, so all consecutive vertices of x coincide and x is constant; then fx=x by the convention of [F1], and (ii) and (iii) hold for it. If some consecutive vertices of x coincide while x is not constant, the corresponding edge contributes 0 to mesh, L and E, the midpoint of a degenerate pair is the point itself by [F1], and the proofs of steps 1.2, 2.2 and 3.1 go through verbatim: if a half-edge vanishes the model midline estimate reduces to the immediate bound, and a collapsed comparison triangle is the limiting case of degenerate comparison triangles, in which the cosine-rule identity and the CAT(1) inequality remain valid by continuity; the equality case then includes the possibility that a midpoint coincides with a vertex, and the straightness conclusion is unchanged.

4.2step 1.1step 1.3step 2.1step 2.2step 3.1step 3.2F1F2F6F9F12F14algebra

The eventually-short set is the basin and is open. Write U={x∈Ph(n):L(fmx)<l/2 for some m}. For x∈U, put y=fmx, c=y0 with L(y)<l/2. Its vertices lie in the convex CAT(1) ball B0=Bˉ(c,l/4), so all later vertices do too. For ε>0 the set Kε={z∈Ph(n):zi∈B0 for every i, E(z)≥ε} is compact. If nonempty, the continuous deficit D(z)=E(z)−E(fz) is strictly positive there: equality would give a nonconstant closed local geodesic by step 3.1; every edge remains in B0 by convexity, so the entire curve would be a closed local geodesic in the CAT(1) space B0, contradicting [F2] since diam⁡B0≤l/2<π. Thus D has a positive minimum on nonempty Kε, and the nonnegative energy of fky must eventually fall below ε. If Kε is empty, it is already below ε. Hence E(fky)→0 and L(fky)→0 by L2≤nE. This proves U⊆Ch0(n); the reverse inclusion follows from L(fkx)→0. Finally U is the union of the open sets {L∘fm<l/2}, since f and L are continuous.

5.1step 1.1step 1.3step 2.1step 2.2step 3.1step 3.2step 4.1step 4.2F1∎

Conclusion. Clause (i) is step 1.1 for the radius, step 2.2 for the self-map, step 2.1 for compactness and step 1.3 for continuity; clause (ii) is step 2.2; clause (iii) is step 3.1; clause (iv) is step 4.2; clause (v) is step 3.2 together with step 4.2 for the identification of U with the basin; clause (vi) is step 4.1. This proves all assertions.

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

Local CAT(1) of the l2 product from a model S2×S2 sine-comparison calculation

Statement

(i) The l2 product. For metric spaces (X,dX) and (Y,dY) let X×Y carry the l2 product metric d((x,y),(x′,y′)):=(dX(x,x′)2+dY(y,y′)2)1/2 (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it). If X and Y are locally CAT(1), then X×Y is locally CAT(1) (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles). More precisely, if B(x,r)⊆X and B(y,r)⊆Y are CAT(1) and convex for some r<π/2, then every triangle in the product chart B(x,r)×B(y,r) whose perimeter is <2π satisfies the CAT(1) inequality; the same holds with either factor replaced by a Euclidean space.

(ii) Model vertex-to-side comparison in S2×S2. Let v ⁣:[0,1]→S2×S2 be a constant-speed geodesic segment, let p∈S2×S2, put a=d(p,v(0)), b=d(p,v(1)), V=d(v(0),v(1)) and assume the closed curve formed by v and geodesic segments from p has perimeter <2π. Then for all t∈[0,1], cos⁡d(p,v(t)) ≥ sin⁡((1−t)V)cos⁡a+sin⁡(tV)cos⁡bsin⁡V,V>0, the right-hand side being the cosine of the vertex-to-side distance of the spherical comparison triangle with side lengths a,b,V; for V=0 the inequality reduces to d(p,v(t))≤a.

(iii) Reduction to the model. For a triangle in a product of CAT(1) spaces whose projections to the two factors are geodesic segments, comparison with the paired factor-model triangles and the model inequality (ii) yields the CAT(1) vertex-to-side inequality for the product triangle; the vertex-to-side comparisons together with the spherical law of cosines (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences) give all side-point comparisons, and hence the CAT(1) inequality on sufficiently small product charts. No smooth-manifold comparison, curvature tensor or CAT(0) squared-distance surrogate is used.

Facts & Assumptions

Given: Locally CAT(1) spaces X,Y with CAT(1) convex balls B(x,r),B(y,r), r<π/2; for clause (ii) a constant-speed geodesic v in S2×S2, a point p, and the numbers a,b,V.

[F1]

Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles: CAT(1) means that every pair of points at distance <π is joined by a geodesic segment and that every geodesic triangle of perimeter <2π satisfies d(x,y)≤dS(xˉ,yˉ) for all points x,y of the triangle; locally CAT(1) means that every point has a CAT(1) closed ball Bˉ(x,r), with the induced metric; dS(x,y)=arccos⁡(x⋅y) on S2.

[F2]

Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences: for side lengths satisfying the triangle inequalities with perimeter <2π a comparison triangle in S2 exists and is unique up to isometry; the spherical cosine rule cos⁡c=cos⁡acos⁡b+sin⁡asin⁡bcos⁡γ holds for a triangle of S2 with sides a,b,c<π and angle γ opposite c; balls of radius <π/2 in a CAT(1) space are convex with unique geodesics.

[F3]

Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric: the metric axioms, the triangle inequality, and the product metric d2=dX2+dY2 on X×Y.

[F4]

Open ball, closed ball and sphere in a metric space: B(x,r)={y:d(x,y)<r}, and a subset of a geodesic space is convex when it contains a geodesic segment between any two of its points.

[F6]

Euclidean spheres and closed balls as subspaces of Rn: S2⊂R3 and, more generally, the spheres Sn−1 as subsets of Euclidean space.

[F7]

Real and complex inner-product spaces and their induced length, The induced length is a norm, Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs: the Euclidean inner product induces the norm; ∣⟨u,v⟩∣≤∥u∥ ∥v∥; consequently ∑jaj2+bj2≥(∑jaj)2+(∑jbj)2 for nonnegative reals, and (R′)2≤∑i(ri′)2 when R2=∑iri2.

[F8]

Principal inverse sine and inverse cosine, The addition formulas for sine and cosine, Signs, monotonicity intervals, and ranges of sine and cosine, Pi is the first positive zero of sine: sine and cosine are continuous and differentiable with the addition formulas, cos⁡ is strictly decreasing on [0,π] with cos⁡0=1 and cos⁡π=−1, sin⁡>0 on (0,π), and π>0 is the first positive zero of sine.

[F10]

A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: a continuous real-valued function on a nonempty compact metric space attains its minimum.

[F11]

C2 has the meaning of Higher derivatives and the classes Ck and C∞. At an interior minimum of a C2 function its first derivative is zero by Fermat's interior extremum theorem: if f has a local extremum at a point c interior to its domain and is differentiable at c, then f′(c)=0, and its second derivative is nonnegative: a negative value would make it a strict local maximum by The second-derivative test for strict local extrema. Differentiation of sums, products and quotients is supplied by Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0; the mean-value theorem is The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a). The inverse trigonometric derivatives are For −1<y<1, (arcsin⁡y)′=1/1−y2 and (arccos⁡y)′=−1/1−y2; applying Derivative of an inverse: if f is continuous and injective on a nondegenerate interval I and differentiable at c∈I with f′(c)≠0, then the inverse g is differentiable at f(c) with g′(f(c))=1/f′(c); and if f′(c)=0 then g is not differentiable at f(c) to u↦u2 on (0,∞) gives (z)′=1/(2z), which can be differentiated again there. Thus the positive nonantipodal radial functions below are C2.

Proof

technique · direct
1.1F3F5F7algebra

Product geodesics. Let γ=(γ1,γ2) be a constant-speed geodesic segment in X1×X2 with endpoints P,Q, so that d(γ(s),γ(t))=(t−s)L for 0≤s≤t≤1 with L=d(P,Q); let ℓi be the length of γi and put Li:=di(Pi,Qi). For every partition 0=t0<⋯<tm=1, the Minkowski inequality of [F7] gives ∑jd(γ(tj−1),γ(tj))≥(∑jd1(γ1(tj−1),γ1(tj)))2+(∑jd2(γ2(tj−1),γ2(tj)))2, taking common refinements of partitions approximating both component lengths gives L≥ℓ12+ℓ22; since ℓi≥Li and L=L12+L22, it follows that ℓi=Li for both i. Hence each γi has length equal to the distance between its endpoints, so γi minimizes between its endpoints. For the partition 0,s,t,1, equality in the Euclidean triangle inequality for the nonnegative component-distance vectors is forced by the product-geodesic equality. Its equality case, from [F7], makes each vector proportional to (L1,L2); the middle vector has norm (t−s)L, hence di(γi(s),γi(t))=(t−s)Li: the projections are geodesics with constant speeds Li and L2=L12+L22. Conversely, if the γi are constant-speed geodesics with proportional parametrizations and speeds Li, then d(γ(s),γ(t))2=∑i(t−s)2Li2=(t−s)2L2, so γ is a constant-speed geodesic.

1.2F8F9F10F11algebra

Sine comparison on a short interval. Let 0<V<π and let F∈C2([0,1]) satisfy F′′+V2F≤0. Put H(t)=(sin⁡((1−t)V)F(0)+sin⁡(tV)F(1))/sin⁡V and G=F−H; then G(0)=G(1)=0 and G′′+V2G≤0. Choose K=(V+π)/2 and the positive function w(t)=cos⁡(K(t−1/2)). If G were negative somewhere, G/w would attain a negative minimum at an interior t0; there (G/w)′=0 and (G/w)′′≥0 by [F11]. Writing G=w(G/w) gives G′′+V2G=w(G/w)′′+2w′(G/w)′+(V2−K2)w(G/w)>0 at t0, because K>V, w>0, and G/w<0, a contradiction. Hence F≥H. The required V<π in the model follows from the triangle inequality V≤a+b and a+b+V<2π.

2.1F1F5F6F8F9F11algebra

Radial identities in the model. Let M=M1×⋯×Mm where each factor Mi is either the round sphere S2 with metric dS or a Euclidean space Rki with its metric ([F5], [F6]), and let v ⁣:[0,1]→M be a constant-speed geodesic segment with factor curves vi of speeds Vi and V2=∑iVi2, as in step 1.1. Fix p∈M, write ri(t):=dMi(pi,vi(t)) and R(t):=(∑iri(t)2)1/2=dM(p,v(t)), and assume first that ri(t)>0 for all i and t. Then R is V-Lipschitz, so R(t)≤min⁡{a+tV,b+(1−t)V} where a=R(0) and b=R(1), and under the perimeter hypothesis a+b+V<2π one has R(t)≤12(a+b+V)<π; also ∣ri′∣≤Vi. If Mi=S2 put fi(u):=ucot⁡u and Ai:=fi(ri), while for a Euclidean factor put fi≡1 and Ai:=1. Differentiating the relation cos⁡ri(t)=pi⋅vi(t) twice along the great circle vi gives ri′′=cot⁡ri (Vi2−(ri′)2), that is riri′′=Ai(Vi2−(ri′)2), by [F9], [F8] and [F1]; in the Euclidean factor the same identity riri′′=Vi2−(ri′)2 follows by differentiating ri2=∣pi−vi(t)∣2 twice for an affine vi ([F5], [F9]). Summing the identities over i and using R2=∑iri2, so that RR′′=∑i(ri′)2+∑iriri′′−(R′)2, one gets RR′′=∑iAiVi2+∑i(1−Ai)(ri′)2−(R′)2.

3.1step 2.1F7F8F9F11algebra

A differential inequality for R. In the situation of step 2.1 put f(R):=Rcot⁡R. Subtracting f(R)(V2−(R′)2) from the identity of step 2.1 gives RR′′−f(R)(V2−(R′)2)=∑i(Ai−f(R))(Vi2−(ri′)2)+(1−f(R))(∑i(ri′)2−(R′)2), as expanding the right-hand side and using ∑iVi2=V2 reproduces the left-hand side. Each factor is nonnegative: Vi2−(ri′)2≥0 because ri is Vi-Lipschitz; Ai≥f(R) because either Ai=fi(ri) with ri≤R and fi(u)=ucot⁡u decreasing on (0,π) — indeed fi′(u)=(sin⁡ucos⁡u−u)/sin⁡2u<0: the function u−sin⁡ucos⁡u vanishes at zero and has derivative 2sin⁡2u>0 on (0,π), so [F11]'s mean-value theorem makes it positive — or Ai=1≥f(R), valid because sin⁡u−ucos⁡u vanishes at zero and has derivative usin⁡u>0 on (0,π), so the same theorem gives ucot⁡u<1; and 1−f(R)≥0 together with ∑i(ri′)2≥(R′)2 by Cauchy–Schwarz [F7]. Hence RR′′−f(R)(V2−(R′)2)≥0.

4.1step 3.1F8F9F11algebra

The comparison function satisfies the differential inequality. With F:=cos⁡R one computes F′=−sin⁡R R′ and F′′=−cos⁡R (R′)2−sin⁡R R′′, so (sin⁡R/R)(RR′′−f(R)(V2−(R′)2))=sin⁡R R′′−cos⁡R (V2−(R′)2)=−(F′′+V2F), because Rf(R)=R2cot⁡R and sin⁡R>0; since 0<R<π, step 3.1 gives F′′+V2F≤0 wherever R>0.

5.1step 1.2step 4.1F2F3F8algebra

The model inequality (ii). In the situation of steps 2.1–3.1 with V>0 and ri>0 everywhere, step 1.2 applied to F=cos⁡R with F(0)=cos⁡a, F(1)=cos⁡b gives cos⁡R(t)≥(sin⁡((1−t)V)cos⁡a+sin⁡(tV)cos⁡b)/sin⁡V, whose right-hand side is cos⁡dS2(pˉ,vˉ(t)) for the spherical comparison triangle with side lengths a,b,V and the comparison point vˉ(t) at parameter t on the side of length V, by the cosine rule [F2]; since cos⁡ is strictly decreasing on [0,π] and both arguments lie in [0,π] ([F8]), d(p,v(t))≤dS2(pˉ,vˉ(t)). If some factor distance vanishes at some time, choose approximating data pϵ with every riϵ>0 throughout: for a spherical factor the trace of vi has empty interior in S2, so piϵ can be chosen arbitrarily close to pi outside it; for a Euclidean factor, first embed Rki isometrically in Rki+1 and displace pi by ϵ in the new orthogonal direction, making its distance to the entire trace positive; the inequality proved for the approximants passes to the limit because R, a, b and V depend continuously on (p,v(0),v(1)) and on t↦v(t) ([F3]). For V=0 the geodesic v is constant and d(p,v(t))=a for all t, which is the asserted inequality.

6.1step 1.1step 5.1F1F2F4algebra

Vertex-to-side inequality in a product chart. Let B(x,r)⊆X, B(y,r)⊆Y be CAT(1) and convex, r<π/2, let (P,Q,R) be a geodesic triangle in the chart B(x,r)×B(y,r) with perimeter <2π, and let U be a point of the side [Q,R], say at parameter t from Q. By step 1.1 the factor projections of the sides are geodesic segments in X and Y lying in the convex balls B(x,r),B(y,r) ([F4]), and Ui lies on [Qi,Ri] at the same parameter t. The factor triangles (Pi,Qi,Ri) have perimeter at most the perimeter of (P,Q,R), hence <2π, so the CAT(1) inequality of [F1] applies to the pair (Pi,Ui): di(Pi,Ui)≤dS2(Pi′,Ui′), where Pi′,Ui′ are the corresponding points of the spherical comparison triangle of (Pi,Qi,Ri). Therefore d(P,U)2=∑idi(Pi,Ui)2≤∑idS2(Pi′,Ui′)2. By step 1.1 the pairing t↦(U1′,U2′) is a constant-speed geodesic in S2×S2 from (Q1′,Q2′) to (R1′,R2′) of length ∑idi(Qi,Ri)2=d(Q,R), while ∑idS2(Pi′,Qi′)2=d(P,Q) and likewise for R. Since the perimeter hypothesis is unchanged, the model inequality of step 5.1 applies with p:=(P1′,P2′), a=d(P,Q), b=d(P,R) and V=d(Q,R): d(P,U)≤dS2×S2((P1′,P2′),(U1′,U2′))≤dS2(Pˉ,Uˉ), where (Pˉ,Qˉ,Rˉ) is the spherical comparison triangle of (P,Q,R) and Uˉ is the comparison point of U.

7.1step 6.1F2F8algebra

All side-point comparisons. With the notation of step 6.1 let now U lie on [P,Q] and V on [P,R]. The triangle (P,U,R) has perimeter at most that of (P,Q,R), so step 6.1 applies to it at the vertex U and the point V of the side [P,R]: d(U,V)≤dS2(U′′,V′′), where U′′,V′′ are the corresponding points of the comparison triangle of (P,U,R). That comparison triangle and the configuration (Pˉ,Uˉ,Vˉ) of the big comparison triangle have equal legs ∣PU∣ and ∣PV∣ from the vertex P, while their opposite sides satisfy ∣U′′R′′∣=d(U,R)≤dS2(Uˉ,Rˉ), the latter by step 6.1 applied to the big triangle at the vertex R with the point U of the side [P,Q]. For fixed legs the angle at the vertex of a spherical triangle is an increasing function of the opposite side, because the cosine rule of [F2] gives cos⁡γ=(cos⁡c−cos⁡acos⁡b)/(sin⁡asin⁡b) and cos⁡ is decreasing ([F8]); hence the angle at P′′ is at most the angle at Pˉ, and applying the cosine rule to both configurations gives cos⁡dS2(U′′,V′′)≥cos⁡dS2(Uˉ,Vˉ), that is d(U,V)≤dS2(Uˉ,Vˉ). Pairs on the same side satisfy equality because the comparison map is an isometry on each side, and pairs on two sides sharing a vertex reduce to the treated case after relabelling the triangle; thus every pair of points of (P,Q,R) satisfies the CAT(1) inequality.

8.1step 1.1step 5.1step 6.1step 7.1F1F4∎

Local CAT(1) of products. Let B(x,r)⊆X, B(y,r)⊆Y be CAT(1) and convex with r<π/2: the chart B(x,r)×B(y,r) is convex in X×Y, because a product geodesic between two of its points has factor geodesics lying in the convex factor balls by step 1.1, so the induced metric on the chart agrees with the restricted product metric. Every pair of points of the chart at distance <π has product distance with factor components <π and is joined by the product of the factor geodesics inside the chart, and every geodesic triangle of perimeter <2π in the chart satisfies the CAT(1) inequality by steps 6.1 and 7.1; hence the chart is a CAT(1) space. Choose 0<ρ<min⁡{r,π/2}; the closed product ball of radius ρ about (x,y) lies in this CAT(1) chart and is convex by [F2], hence is itself CAT(1). Therefore X×Y is locally CAT(1) whenever X and Y are, and if B(x,r),B(y,r) are CAT(1) and convex then every triangle in the chart of perimeter <2π satisfies the CAT(1) inequality, the same argument applying verbatim when a factor is Euclidean (steps 2.1 and 5.1 treat the flat case). This proves (i), (ii) and (iii).

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

The spherical radius estimate, the quadrilateral separation constant, and the finite midpoint-operation comparison disk

Statement

(i) Spherical radius estimate. Let Z be a CAT(1) space (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles) and let γ be a closed rectifiable curve of length 2r with 0<2r<2π. Split γ at points y,z into two subarcs of length r, and let a be the midpoint of the geodesic [y,z] (which exists because d(y,z)≤r<π). Then for every point x of γ, cos⁡d(a,x) ≥ cos⁡d(x,y)+cos⁡d(x,z)2cos⁡(d(y,z)/2) ≥ cos⁡(r/2), and the image of γ is contained in the closed ball Bˉ(a,r/2); with η:=12(π−r)>0 one has r/2=π/2−η.

(ii) Quadrilateral separation. There is a function δ on {(η,μ):0<μ<2η<π} with values δ(η,μ)>0, continuous on every compact subset of its domain, such that: if a,x,y,z are points of a CAT(1) space with d(a,x)≤π/2−η, d(x,y)=d(x,z)=μ and d(a,y),d(a,z)≤d(a,x), then d(y,z) ≤ 2μ−δ(η,μ). The estimate is intrinsic: the two spherical comparison triangles of (a,x,y) and (a,x,z) are glued along their common side [a,x], and a shortest path in the resulting quadrilateral Q either stays in one triangle or crosses the common side; the ambient spherical chord need not lie in Q and is not used. The bound is uniform on the compact family of configurations with 0<μ<2η, including degenerate comparison triangles by continuity; equality of either radial distance with d(a,x) is also allowed; the equality corner is excluded by μ<2η, and the degenerate case d(a,x)=0 is impossible for a nonconstant configuration.

(iii) The midpoint-operation disk (assuming the Axiom of Choice). Let x∈Ch0(n) and choose m≥1 with L(fmx)<2l (Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin). Assume that every comparison triangle used below is nondegenerate, i.e. its three side lengths satisfy the strict triangle inequalities. Build the finite cellulation G(m,n) from the nested midpoint polygons of a regular Euclidean n-gon: its ears have principal vertices v(i,j),v(i+1,j−1),v(i+1,j) for 0≤i<m, and its final fan has triangles v(m,1),v(m,j−1),v(m,j) for 3≤j≤n. Row-i edges are subdivided at their row-(i+1) midpoints. Assign v(i,j) the point (fix)j of X and give each face the spherical comparison metric of its assigned triple (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences). The ambient space need only have the uniform CAT(1) radius l; its compactness is not used in this finite construction. Then:

(a) every face has perimeter <2l<π and is nondegenerate;

(b) the vertexwise map extends along each edge to a map g ⁣:K1(G)→X of the 1-skeleton, and ρ(u,v)≥d(gu,gv) for all skeleton points u,v, where ρ is the disk's intrinsic polyhedral metric;

(c) every interior vertex of the disk has cone angle at least 2π;

(d) the boundary vertices are exactly V(0)∪V(1); those in V(1) have boundary angle at least π, and those in V(0) have boundary angle <π;

(e) the disk contains no simple closed local geodesic: successive ear removal forces such a curve into the final fan, where the spherical radial maximum argument excludes it;

(f) consequently the disk, with the polyhedral metric, is a CAT(1) space (Compact geodesic locally CAT(1) spaces are CAT(1) exactly when they contain no short circle, Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences).

(iv) Quantitative output (assuming the Axiom of Choice). In the situation of (iii), assume also 0<L(x)<2π and put r=L(x)/2, ξi=d(xi,xi+1), ζi=d(fxi,fxi+1), η=(π−r)/2 and μ=min⁡{r/(2n),η}. If ξi≥r/n for all i (the case produced by the variance estimate used later on this page), then there is an index k with ζk ≤ ξk+ξk+12−δ(η,μ). The index k is adjacent to a first-row boundary vertex b of maximally possible distance from the radius center a supplied by (i); the two outgoing subarcs at b are cut at distance μ, perimeters satisfy 2R+μ<π with R=π/2−η, and the intrinsic quadrilateral estimate (ii) applied in the disk, together with ρ≥d∘(g×g) of (b), gives the displayed deficit for equal cut segments; longer unequal midpoint segments are handled by taking initial equal μ-pieces and adding the remaining lengths.

Facts & Assumptions

Given: A CAT(1) space Z and a closed rectifiable curve γ of length 2r, 0<2r<2π, split at y,z into two subarcs of length r; configurations a,x,y,z as in (ii); a compact locally CAT(1) space X, a uniform radius l<π/2, a fixed n≥3 and a tuple x∈Ch0(n) as in (iii) with all ξi≥r/n.

[F1]

Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles: CAT(1) and locally CAT(1) spaces; dS(x,y)=arccos⁡(x⋅y) on S2; local geodesics; the CAT(1) inequality for all pairs of points of a triangle of perimeter <2π.

[F2]

Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences: comparison triangles of perimeter <2π exist and are unique up to isometry and the comparison map on them is distance-nonincreasing; the spherical cosine rule and the midpoint identity cos⁡dS(x,a)=(cos⁡dS(x,y)+cos⁡dS(x,z))/(2cos⁡(dS(y,z)/2)); balls of radius <π/2 in a CAT(1) space are convex with unique geodesics.

[F3]

Short local geodesics in a CAT(1) space are geodesics, and closed local geodesics have length at least 2π: unique short geodesics with continuous dependence on endpoints; local geodesics of length ≤π are geodesics.

[F4]

Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin and Existence of the uniform radius, continuity of the midpoint operation, the energy drop, its equality case, and convergence of zero-limit polygons: mesh, L, E, the midpoint operation f and its continuity, the zero-limit basin Ch0(n), the invariance mesh⁡(fx)≤mesh⁡(x), and the pointwise bound d(fxi,fxi+1)≤(ξi+ξi+1)/2.

[F9]

Finite comparison-cell construction: take the spherical comparison triangles supplied by [F2] and identify their prescribed corresponding edges by length-preserving maps. This is the definition of the quotient cellulation used in (iii); an arbitrary edge identification is not an application of the triangle-gluing or patchwork lemma, and no global angle comparison follows from the identification alone.

[F10]

Compact geodesic locally CAT(1) spaces are CAT(1) exactly when they contain no short circle: a compact, geodesic, locally CAT(1) space is CAT(1) if and only if it contains no isometrically embedded circle of length <2π.

[F11]

The Axiom of Choice, Under the Axiom of Choice, a pointwise bounded equicontinuous sequence on a nonempty compact metric domain into a proper metric target has a uniformly convergent subsequence: the compact short-circle criterion of [F10] consumes AC through its Arzelà–Ascoli path; the radius estimate, the separation constant, the disk construction are choice-free; clauses (iii)(f) and (iv) consume that criterion and hence assume AC.

[F12]

Upper bound, least upper bound, and strict upper bound defines upper bounds and suprema. By A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, a continuous real-valued function on a nonempty compact metric space is bounded and attains its supremum and infimum; nonemptiness and continuity must be checked for each application.

Proof

technique · direct
1.1F1F2F5F7F8algebra

Radius estimate (i). Let x be a point of γ; it lies on one of the two subarcs between y and z, so writing b:=d(x,y), d:=d(x,z), c:=d(y,z) we have b+d≤r (the two pieces of that subarc dominate the two distances), ∣b−d∣≤c (triangle inequality) and c≤r<π. The triangle (x,y,z) of Z has perimeter b+d+c≤2r<2π, so a comparison triangle exists in the round sphere S2 of [F7] and the CAT(1) inequality of [F1] applied to the pair (a,x) gives d(a,x)≤dS(aˉ,xˉ), where aˉ is the comparison point of the midpoint a of [y,z]. The midpoint identity of [F2] gives cos⁡dS(aˉ,xˉ)=(cos⁡b+cos⁡d)/(2cos⁡(c/2)), and the addition formula ([F8]) turns this into cos⁡((b+d)/2)cos⁡((b−d)/2)/cos⁡(c/2); since ∣b−d∣≤c and cos⁡ decreases on [0,π] with cos⁡(c/2)>0, this is at least cos⁡((b+d)/2), which is at least cos⁡(r/2) because b+d≤r and r/2<π. Hence cos⁡d(a,x)≥cos⁡(r/2) with both arguments in [0,π], so d(a,x)≤r/2: the image of γ is contained in the closed ball of radius r/2 about a, and r/2=π/2−η for η=(π−r)/2.

1.2F1F2F5F8F9F12algebra

Quadrilateral separation (ii). Let a,x,y,z satisfy the hypotheses, and consider the two comparison triangles Tˉy=(aˉ,xˉ,yˉ) and Tˉz=(aˉ,xˉ,zˉ) of the triangles (a,x,y) and (a,x,z) in S2; both are admissible because their perimeters are at most 2d(a,x)+μ≤2(π/2−η)+μ<2π. Glue them along the common side [aˉ,xˉ] on opposite sides, obtaining an abstract spherical quadrilateral Q (two triangles joined along the isometric side [aˉ,xˉ]) with intrinsic distance dQ; the corresponding boundary maps agree on the common side because the geodesic [a,x] is unique (d(a,x)<π, [F3]); comparison on each triangle boundary, followed by the triangle inequality at the crossings of the common side, gives d(y,z)≤dQ(yˉ,zˉ). Write ϑ for the angle at xˉ between [xˉ,aˉ] and [xˉ,yˉ] inside Tˉy and ϑ′ analogously in Tˉz; by the cosine rule and d(a,y)≤d(a,x), cos⁡ϑ=(cos⁡d(a,y)−cos⁡d(a,x)cos⁡μ)/(sin⁡d(a,x)sin⁡μ)≥(cos⁡d(a,x)−cos⁡d(a,x)cos⁡μ)/(sin⁡d(a,x)sin⁡μ)=cot⁡d(a,x)tan⁡(μ/2), and since d(a,x)≤π/2−η gives cot⁡d(a,x)≥tan⁡η, we get cos⁡ϑ≥tan⁡ηtan⁡(μ/2) and likewise cos⁡ϑ′≥tan⁡ηtan⁡(μ/2); as the right-hand side is positive and μ>0, both ϑ,ϑ′ are strictly less than π/2, so with ψ:=arcsin⁡(tan⁡ηtan⁡(μ/2))>0 the angle Φ:=ϑ+ϑ′ satisfies Φ≤π−2ψ<π. Put q:=min⁡{1/2,tan⁡ηtan⁡(μ/2)} and ψ:=arcsin⁡q, so the preceding angle bounds still give Φ≤π−2ψ. The triangle inequality gives μ=d(x,y)≤d(a,x)+d(a,y)≤2d(a,x), hence the common side has length at least μ/2. Cut both outgoing edges at distance e:=μ/4 from xˉ. The short spherical chord joining the cutpoints lies in the wedge of angle Φ<π and in the convex closed ball Bˉ(xˉ,e), since e<π/4. The other two edges are outside this small ball: for p∈[aˉ,yˉ], writing t=d(a,x), the triangle inequality gives dS(xˉ,p)≥max⁡{μ−dS(p,yˉ),t−dS(p,aˉ)}≥(μ+t−d(a,y))/2≥μ/2, and likewise for [aˉ,zˉ]. It meets the common radial side before its far endpoint (at distance at most e<μ/2); each half lies in the corresponding convex spherical triangle. Thus this chord really is a path in Q, irrespective of whether the chord joining yˉ,zˉ lies in Q. Its length is at most ℓe:=arccos⁡(cos⁡2e+sin⁡2ecos⁡(π−2ψ))<2e. Adding the two remaining edge pieces gives dQ(yˉ,zˉ)≤2(μ−e)+ℓe=2μ−δ(η,μ), with δ(η,μ):=2e−ℓe>0. This formula is continuous on the whole stated parameter domain, including parameter values for which no configuration exists; the clamp in q keeps the inverse sine defined there. Degenerate comparison triangles, with a zero angle at xˉ, give the same chord shortcut directly; equality of radial distances was already included in the cosine bound; d(a,x)=0 would give μ=d(x,y)≤d(x,a)+d(a,y)≤0, contradicting μ>0.

1.3F2F4F5F7F8F9algebraconstruct

The finite disk and its face bounds (iii)(a). In the Euclidean plane take a regular n-gon P0, and let Pi+1 be its midpoint polygon; it is a regular n-gon, rotated through π/n and scaled by cos⁡(π/n)>0. The difference between Pi and Pi+1 consists of the n ears T(i,j) with principal vertices v(i,j),v(i+1,j−1),v(i+1,j); their radial sides meet at the row-i vertices, while each row-i side is subdivided at v(i+1,j). The ears for 0≤i<m and the n−2 triangles T(m,j)=(v(m,1),v(m,j−1),v(m,j)), 3≤j≤n, of a diagonal fan triangulate the closed disk P0. Thus the prescribed edge identifications yield a topological disk, with boundary vertices V(0)∪V(1) and interior vertices V(2)∪⋯∪V(m); the row-i polygon is the boundary of the remaining disk after the first i ear layers are removed. Assigning spherical metrics leaves this topology unchanged, since the strict triangle inequalities make each face a nondegenerate closed triangle. The ear sides are ξj−1(i)/2, ξj(i)/2 and d(v(i+1,j−1),v(i+1,j)) in X, so by [F4] their perimeter is at most ξj−1(i)+ξj(i)≤2h<2l<π. For a cap triangle, the three consecutive subarcs of the last-row loop between its three assigned vertices have total length L(fmx)<2l and dominate its three distances; hence its perimeter is also <2l<π. Every face is therefore contained in an open spherical hemisphere and has angles <π.

1.4F1F2F3F4F5F9construct

The skeleton map dominates the ambient distance (iii)(b). Map each edge at constant speed to the corresponding unique short geodesic of X. This is consistent with subdivision: the row-(i+1) vertex on a row-i side is its assigned midpoint by [F4]. Each ear has all assigned vertex distances ≤h<l, and each cap face has all such distances ≤L(fmx)/2<l. Thus each assigned triple lies in a radius-l CAT(1) ball; its three geodesic sides lie there by comparison convexity. The CAT(1) inequality gives d(gu,gv)≤dT(u,v) for any two points of the boundary of its spherical comparison face T. The intrinsic path metric of the finite complex is the infimum of lengths of chains of face segments; for skeleton endpoints, each segment of such a chain begins and ends on the boundary of its face (split at successive face crossings). Applying the boundary comparison to these segments and the triangle inequality in X gives d(gu,gv)≤ the chain length; the infimum gives d(gu,gv)≤ρ(u,v). No extension of g to face interiors is needed.

1.5F2F8algebra

Shortest paths through a vertex span at least π on each side (cone lemma). Let W be a polyhedral surface with an interior vertex v at which the total cone angle is Θ, let u1,u2 be points on two edges issuing from v at positive distance from v, and suppose the concatenation of the two segments [u1,v], [v,u2] is a shortest path from u1 to u2 in W. Then the two sectors of W at v cut out by the segments have angles at least π, so Θ≥2π. Indeed, if a sector had angle φ<π, then in that sector (a sufficiently small spherical wedge of angle <π, hence convex) the two points at equal small distance ε from v on the two edges would be joined by a path of length strictly less than 2ε: the spherical cosine rule gives cos⁡ℓ=cos⁡2ε+sin⁡2εcos⁡φ>cos⁡(2ε) for φ<π, so ℓ<2ε, and adding the remaining pieces gives a strictly shorter path, contradicting minimality. At a boundary vertex the same shortcut applies to its one available disk-side sector and forces that sector to have angle at least π; no second sector or 2π bound is asserted there.

2.1step 1.3step 1.5F2F7F8

Ear removal. Let Di be the closed disk remaining after removal of ear layers 0,…,i−1, with D0=D. Suppose a simple closed local geodesic γ of D lies in Di, i<m. It is also locally shortest among paths in Di. At a tip v(i,j) the only incident face of Di is the ear T(i,j), whose angle is <π; the shortcut argument of step 1.5 excludes passage through that tip. At an interior point of a boundary side of Di, the local space is a spherical half-disk and a local geodesic meeting that boundary must follow its great-circle side. Continuing toward the adjacent tip would reach v(i,j) before any other vertex, which is impossible. Therefore γ avoids all boundary side interiors of Di. A component of its intersection with an ear interior must consequently enter and leave through that ear's base, possibly at its endpoints: the other two sides are boundary sides of Di. Inside the ear the arc is a great-circle arc contained in an open hemisphere; its length is <π, so it cannot meet the same short great-circle base twice unless it coincides with that base. Nor can a whole closed great circle lie in the ear's hemisphere. Thus γ misses the ear interiors and lies in Di+1. Induction forces γ into the final fan Dm.

2.2step 1.3step 1.4step 1.5F1F4algebra

Interior cone angles (iii)(c). Let u=v(i,j) with 2≤i≤m and let w1:=v(i−1,j), w2:=v(i−1,j+1) be the endpoints of the row-(i−1) edge whose midpoint is u; the two radial edges [w1,u] and [u,w2] are sides of the ears T(i−1,j) and T(i−1,j+1) and have ρ-length equal to the X-distances ξj(i−1)/2=d(gw1,gu)=d(gu,gw2). Since gu is the midpoint of the geodesic [gw1,gw2], d(gw1,gw2)=d(gw1,gu)+d(gu,gw2)=ρ(w1,u)+ρ(u,w2), while ρ(w1,w2)≥d(gw1,gw2) by (iii)(b) and ρ(w1,w2)≤ρ(w1,u)+ρ(u,w2) by the triangle inequality; hence equality holds and the concatenation [w1,u]∪[u,w2] is a shortest path. By the cone lemma of step 1.5 the cone angle of D at u is at least 2π. (The cap supplies the inner sector when i=m.)

3.1step 1.3step 1.5step 2.2F1F2F8algebra

Boundary angles (iii)(d). The boundary of D is the subdivided row-0 polygon. At a first-row vertex v(0,j) exactly the ear T(0,j) is incident, so the boundary angle is the angle of its spherical comparison triangle at v(0,j); the comparison triangle is nondegenerate with perimeter <2h<2π, and all angles of a nondegenerate spherical triangle of perimeter <2π are strictly less than π (an angle ≥π would force the opposite side to be at least the sum of the other two by the cosine rule, contradicting strictness), so ∠(∂D,v(0,j))<π. At the boundary vertex v(1,j) of the last row of the first strip, the incident faces are T(0,j), T(0,j+1) and the faces on the remaining-disk side; the concatenation [v(0,j),v(1,j)]∪[v(1,j),v(0,j+1)] is a shortest path by the argument of step 2.2 with w1=v(0,j), w2=v(0,j+1), using only the disk-side sector of the shortcut argument, so by step 1.5 the sector of D at v(1,j) that lies on the disk side of the path -- which is exactly the disk's sector at its boundary vertex -- has angle at least π, i.e. ∠(∂D,v(1,j))≥π; equivalently the row-0 polygon is locally geodesic at v(1,j).

3.2step 1.3step 1.5step 2.1F2F6F7F8algebra

The final fan excludes a closed local geodesic (iii)(e). Write c=v(m,1). On each cap face define R(p) as its spherical distance to c. These functions agree on fan diagonals, hence define a continuous function on Dm; each face lies in the convex spherical ball of radius L(fmx)/2<l<π/2 about c, so R<π/2. Suppose the curve forced into Dm by step 2.1 exists, and let p maximize R on it. Its maximum is positive, so p≠c. If p is in a face interior or a fan diagonal interior, unfold the adjacent faces into S2: the common radial segment to c agrees in the unfolding, and the local geodesic is a great-circle segment. At its radial maximum its two outgoing directions are perpendicular to the radial direction, so the cosine rule gives cos⁡R(γ(t))=cos⁡R(p)cos⁡t<cos⁡R(p) for small nonzero t, contradicting maximality. The same argument applies at a boundary side interior if the curve follows that side. At a remaining boundary vertex p≠c, the one or two incident cap faces form a sector, split by the radial diagonal to c when there are two. If an outgoing direction has angle α to the radial direction, the cosine rule reads cos⁡R(γ(t))=cos⁡R(p)cos⁡t+sin⁡R(p)sin⁡tcos⁡α. Maximality implies cos⁡α≥0, hence both outgoing directions make angles at most π/2 with the radial direction. The sector between them consequently has angle at most π; local minimality requires angle at least π by step 1.5. Equality forces both angles to be π/2, and the same displayed cosine rule again increases R for small positive t, a contradiction. Thus no simple closed local geodesic exists in D.

4.1step 1.3step 2.2step 3.1F1F2algebraconstruct

Local CAT(1) via a spherical cone chart. At a vertex let J be its angular link with metric truncated at π: an interior link is a circle of circumference Θ≥2π, and a boundary link is an interval of its finite boundary angle. Both are CAT(1). For the circle use F2; truncation changes neither short segments nor triangles of perimeter <2π. For the interval every tested triangle lies in a subinterval of length <π and is degenerate. Let p be a one-point space. The Euclidean cone criterion Berestovskii's cone criterion and the polyhedral link criterion makes C(J) CAT(0). The product [0,∞)×C(J) is CAT(0), by adding the squared vertex-to-side inequalities of F2. The join–product isometry The cone and join metrics and the local product chart of a polyhedral gluing (3) identifies it with C({p}∗J); the same cone criterion now makes {p}∗J CAT(1). Its polar metric about p is cos⁡d=cos⁡tcos⁡t′+sin⁡tsin⁡t′cos⁡dJ(u,u′), by The angular path metric, the Euclidean cone and spherical joins. On each angular subinterval of length <π this is exactly the spherical sector metric, and these sectors glue in the same order as the incident faces of D. Thus their polar charts identify a sufficiently small neighborhood of the vertex with a neighborhood of p in the join, preserving lengths. This also identifies the induced distances on smaller balls: choose an outer chart radius σ<π/2 within every incident face; a path leaving it between points of radii at most σ/4 has length at least 3σ/2, whereas the path through the vertex has length at most σ/2. Shorter paths remain in the chart. The join's smaller closed balls are convex and CAT(1), so their corresponding balls in D are CAT(1). Face and edge interiors have spherical disk or half-disk charts, which have convex small CAT(1) balls. Hence D is locally CAT(1), including boundary angles greater than π.

5.1step 1.3step 3.2step 4.1F6F10F11

Global CAT(1) (iii)(f). The intrinsic finite spherical complex is compact, being a quotient of finitely many compact model triangles, and geodesic: a minimizing sequence of constant-speed paths has uniformly bounded speed, and compact Arzelà–Ascoli gives a uniformly convergent subsequence whose limit has length at most the infimum, by the finite-partition definition of length. This is the AC use of [F11]. Step 4.1 supplies local CAT(1), and step 3.2 excludes every simple closed local geodesic, hence every isometrically embedded circle of length <2π. The compact short-circle criterion [F10] now proves that D is CAT(1).

6.1step 1.1step 1.2step 1.4step 5.1F1F2F4F5algebra

Quantitative output (iv). Assume the situation of (iii) and (iv), and use (iii)(f), so that (D,ρ) is CAT(1); put 2r=L(x), η=(π−r)/2, μ=min⁡{r/(2n),η} and R=r/2=π/2−η. Apply the radius estimate (i) to the boundary curve ∂D, which has ρ-length L(x)=2r<2π; this gives a point a∈D with ∂D⊆Bˉ(a,π/2−η). Choose a maximum b of ρ(a,⋅) on ∂D. The boundary lies in a ball of radius R<π/2; on a short boundary segment a maximum cannot occur in its interior. Indeed, if its interior midpoint b maximized the distance, choose equal small offsets y,z on that segment. Its triangle with a is admissible, and the midpoint cosine inequality gives cos⁡ρ(a,b)≥(cos⁡ρ(a,y)+cos⁡ρ(a,z))/(2cos⁡(ρ(y,z)/2))>cos⁡ρ(a,b), since all three radial distances are at most R<π/2. Thus a maximum occurs at a boundary vertex. It cannot occur at a midpoint vertex of V(1): there the two boundary edges concatenate to a local geodesic (step 3.1), and the same cosine comparison on a short segment through that vertex excludes a maximum there. Thus b=v(0,k+1) for some k, and ρ(a,b)≤π/2−η and ρ(a,y)≤ρ(a,b) for every point y of ∂D. Let y1 and y2 be the points of the boundary edges [b,v(1,k)] and [b,v(1,k+1)] at distance exactly μ from b; these exist because those edges have ρ-length ξk/2 and ξk+1/2, and μ≤r/(2n)≤ξ/2 by hypothesis. Then ρ(b,y1)=ρ(b,y2)=μ, ρ(a,yi)≤ρ(a,b) since yi∈∂D, and μ<2η; the separation estimate (ii) in the CAT(1) space (D,ρ) gives ρ(y1,y2)≤2μ−δ(η,μ). Also ρ(v(1,k),y1)=ξk/2−μ and ρ(y2,v(1,k+1))=ξk+1/2−μ, because on the edge [b,v(1,k)] the two points y1 and v(1,k) lie on the same side of b at the stated distances. Since ρ≥d∘(g×g) by (iii)(b) and g(v(1,k))=(fx)k, g(v(1,k+1))=(fx)k+1, the triangle inequality in D gives ζk=d((fx)k,(fx)k+1)≤ρ(v(1,k),y1)+ρ(y1,y2)+ρ(y2,v(1,k+1))≤(ξk+ξk+1)/2−δ(η,μ), the displayed deficit, with the index k adjacent to the first-row vertex b; the triangles to which (ii) is applied have perimeter at most 2(π/2−η)+μ<2π as required there, and longer or unequal midpoint segments are handled by taking the initial equal μ-pieces and adding the remaining lengths, as stated.

7.1step 1.1step 1.2step 1.3step 1.4step 2.1step 2.2step 3.1step 3.2step 4.1step 5.1step 6.1F11∎

Conclusion. Steps 1.1 and 1.2 give (i) and (ii); steps 1.3, 1.4, 2.2 and 3.1 give (iii)(a)–(d). Ear removal and the final-fan radial maximum argument give (iii)(e), the local link test and compact criterion give (iii)(f), and step 6.1 gives (iv). AC enters through the compactness-of-paths argument and the compact short-circle criterion.

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

Perturbation by a Euclidean regular polygon: comparison-disk bounds for degenerate comparison triangles

Statement

Assume the Axiom of Choice. Let X be compact locally CAT(1) and let l, n≥3, h<l be as in Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin. Let x∈Ch0(n) satisfy 0<L(x)<2π. Then the quantitative estimates of The spherical radius estimate, the quadrilateral separation constant, and the finite midpoint-operation comparison disk (iv) extend to degenerate tuples by nondegenerate comparison disks in arbitrarily small product perturbations. The original tuple is assumed to satisfy the same edge bound ξi≥L(x)/(2n)>0 as that quantitative estimate; a literal nondegenerate disk is not asserted for a degenerate tuple.

(i) The perturbed tuple. For ε>0 let ζ0ε,…,ζn−1ε be the vertices of a regular Euclidean n-gon of circumradius ε in the plane R2 (Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it) and put xε:=(xi,ζiε), a cyclic n-tuple in the l2 product X×R2 (Local CAT(1) of the l2 product from a model S2×S2 sine-comparison calculation). Then, for ε small enough that L(xε)<2π and mesh⁡(xε)<l, the tuple xε lies in the zero-limit basin of the product, its midpoint-operation comparison triangles are nondegenerate (the Euclidean triples are noncollinear), and the comparison disk and the quantitative output of The spherical radius estimate, the quadrilateral separation constant, and the finite midpoint-operation comparison disk apply to xε.

(ii) Limit. As ε→0 the product edge lengths, the energies of all iterates and the lengths converge to those of x, while the limiting radius constant η=(π−r)/2, μ=min⁡{r/(2n),η} and the quadrilateral constant δ(η,μ) from The spherical radius estimate, the quadrilateral separation constant, and the finite midpoint-operation comparison disk depend only on n and L and converge to their original values as ε→0; the quantitative inequality for xε therefore passes to the limit and holds for x. In particular the deficit estimate ζk≤(ξk+ξk+1)/2−δ(η,μ) extends to tuples with degenerate comparison triangles, with the same constants.

(iii) Hypotheses preserved. The perturbation is chosen so small that every finite-cellulation triangle has strict comparison-triangle inequalities and the mesh and perimeter hypotheses are preserved; the Euclidean energies tend to 0. A sum of squared CAT(0) convexity inequalities is not a substitute for the CAT(1) product comparison.

Facts & Assumptions

Given: A compact locally CAT(1) space X with uniform radius l<π/2, a fixed n≥3 and h<l; a tuple x∈Ch0(n) with edge lengths ξi≥r/n and r=L(x)/2>0; the regular Euclidean n-gons ζε of circumradius ε and the product tuples xε of (i).

[F1]

Local CAT(1) of the l2 product from a model S2×S2 sine-comparison calculation: the l2 product of locally CAT(1) spaces is locally CAT(1) on balls whose product structure has the required componentwise radii, and the product geodesics are componentwise, so the midpoint map of the product is the componentwise midpoint map.

[F2]

The spherical radius estimate, the quadrilateral separation constant, and the finite midpoint-operation comparison disk: the radius estimate (i), the quadrilateral separation (ii), the comparison disk (iii) with its clauses (a), (b) and the quantitative output (iv), under the nondegeneracy hypothesis of (iii).

[F3]

Existence of the uniform radius, continuity of the midpoint operation, the energy drop, its equality case, and convergence of zero-limit polygons and Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin: mesh, L, E, the midpoint map f, its continuity and the invariance of the mesh bound; the basin Ch0(n) and its description by the limit of the iterated lengths.

[F5]

Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences and Short local geodesics in a CAT(1) space are geodesics, and closed local geodesics have length at least 2π: small triangles in a CAT(1) space satisfy the comparison inequality; strict triangle inequalities characterise nondegenerate comparison triangles.

[F6]

Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it: the Euclidean metric on R2, with the distance between adjacent vertices of the regular n-gon of circumradius ε equal to 2εsin⁡(π/n).

[F7]

The Axiom of Choice: AC enters only through the supplier [F2]; the perturbation and the limit argument are choice-free when [F2] is granted.

Proof

technique · direct
1.1F6F3algebra

The auxiliary regular polygon. Put c=2εsin⁡(π/n) and q=cos⁡(π/n)∈(0,1). Euclidean chord midpoints show that the k-th iterate of the regular polygon has circumradius εqk, edge length cqk, length ncqk and energy nc2q2k. The bounded decreasing sequence qk has a limit by A monotone sequence converges if and only if it is bounded, and that limit equals q times itself, hence is zero since q<1. Thus all four quantities tend to zero.

1.2F1F3F4F5algebra

Product geometry and correct length bounds. The product geodesics and midpoint operation are componentwise by [F1]. For any product tuple y=(yX,yE), its edge lengths are ai2+bi2, where ai,bi are the component edge lengths, so E(y)=E(yX)+E(yE) and L(y)≤L(yX)+L(yE). In general the lengths themselves do not satisfy an additive squared identity. The product has the same uniform CAT(1) radius l: a radius-l product ball lies in the product of the CAT(1) X-ball and a convex Euclidean ball, which is CAT(1) by [F1]; the product ball is a radius-l<π/2 ball in that CAT(1) chart, so is convex and CAT(1) by [F5]. Thus the finite construction of [F2], which uses the uniform radius but not ambient compactness, applies in this product.

1.3F4algebra

The edge lower bound survives. Let a=min⁡iξi>0. For u≥a, u2+c2/a2+c2≤u/a, as follows by squaring. Summing gives L(xε)/min⁡iξiε≤L(x)/a≤2n. Thus every perturbed edge obeys ξiε≥L(xε)/(2n), exactly the hypothesis of the finite quantitative output; no strict slack in the original lower bound is required.

2.1step 1.1step 1.2F4F5F6algebra

Strict inequalities for the actual face triples. The ear triples are an old regular-polygon vertex and the midpoints of its two incident edges; their Euclidean projections are noncollinear, since the two old incident edges are not collinear and their lengths are positive. The fan triples are three distinct vertices of the last regular polygon, also noncollinear. This holds at each finite iteration since εqk>0. If a,b,c are the three X-distances and α,β,γ their Euclidean counterparts, then a+b≥c and α+β>γ; hence a2+α2+b2+β2≥(a+b)2+(α+β)2>c2+γ2. Relabeling proves every strict triangle inequality for every ear and cap face.

3.1step 1.1step 1.2step 2.1F2F3F4algebra

Basin, mesh and finite cap. Componentwise iteration and step 1.2 give L(fkxε)≤L(fkx)+ncqk→0. For sufficiently small ε, the product mesh max⁡iξi2+c2 is below l and its length is below 2π; choose a product mesh bound hε<l containing this tuple. The basin condition supplies an integer m≥1 with product iterate length <2l, and step 2.1 makes every face of that finite disk nondegenerate. The finite supplier's conclusions therefore apply without any compactness assumption on X×R2.

4.1step 3.1step 1.3F2F7algebra

The perturbed deficit. Write rε=L(xε)/2, ηε=(π−rε)/2, and με=min⁡{rε/(2n),ηε}. By steps 3.1 and 1.3 and F2, there is an index k=k(ε) such that ζkε≤(ξkε+ξk+1ε)/2−δ(ηε,με). The constants are universal functions of the perturbed length and n, not of the space or mesh. AC is used solely through the finite CAT(1) disk supplier.

5.1step 1.1step 1.2step 2.1step 3.1step 1.3step 4.1F1F2F4F7∎

Limit and conclusion. Take εj↓0. The product edge lengths ξiεj=ξi2+cj2 converge to ξi, and the midpoint lengths converge to ζi because the midpoint operation is componentwise and the Euclidean midpoint-edge length is cjq. Consequently all fixed-iterate lengths and energies converge to their original values, ηεj→η, μεj→μ, and δ(ηεj,μεj)→δ(η,μ) by the finite supplier's continuity. Some index k occurs infinitely often, since there are only finitely many indices; on that subsequence step 4.1 gives ζk≤(ξk+ξk+1)/2−δ(η,μ). This proves the quantitative extension, including degenerate face triples; the perturbation energies vanish and the product comparison is the CAT(1) comparison of [F1].

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

The uniform energy decrement on the basin, bounded iteration, and the closedness of the basin inside the short polygon space

Statement

Assume the Axiom of Choice. Let X be compact locally CAT(1) and let l, n≥3, h<l be as in Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin. Then:

(i) Uniform decrement. There is a continuous function λn ⁣:(0,2π)→(0,∞) — choose λn(2r):=12min⁡{r2n4, δ(η(π−r), min⁡{r/(2n),η(π−r)} )rn},η(ε):=ε/2, with δ from The spherical radius estimate, the quadrilateral separation constant, and the finite midpoint-operation comparison disk — such that for every x∈Ch0(n) with L(x)∈(0,2π), E(fx) ≤ E(x)−λn(L(x)). λn depends only on n and L, not on h, on X or on the mesh; it is allowed to tend to 0 at both ends of (0,2π) (and does), and this explicit minorant has no positive lower bound uniform near 0 or near 2π.

(ii) Bounded iteration. For all 0<a<b<2π there is M∈N — for example M=⌈b2/min⁡[a,b]λn⌉+1 — such that every x∈Ch0(n) with L(x)≤b satisfies L(fMx)<a.

(iii) Closedness and separation. Ch0(n) is open in Ph(n) and closed in the piece {x∈Ph(n):L(x)<2π} in which the estimate (i) is available; hence inside that piece no short-loop homotopy connects a tuple of the basin to a tuple outside it. The basin contains no nonconstant tuple which is equilateral and straight at every vertex, i.e. no nonconstant list of equally spaced points of a closed local geodesic (the equality case of Existence of the uniform radius, continuity of the midpoint operation, the energy drop, its equality case, and convergence of zero-limit polygons (iii)); a straight equilateral closed local geodesic tuple has constant positive length under f and therefore lies outside the basin.

(iv) No circularity. The comparison disk used for (i) is built inside the basin and uses the midpoint operation, the CAT(1) comparisons, the quadrilateral constant and the compact short-circle criterion; shrinkability is never assumed. The identification of the basin with the constant short-homotopy class is made in the short-loop transfer result proved later on this page.

Facts & Assumptions

Given: A compact locally CAT(1) space X with uniform radius l<π/2; a fixed n≥3 and h<l; tuples x∈Ch0(n) with edge lengths ξi=d(xi,xi+1), midpoint lengths ζi=d(fxi,fxi+1), length L(x)=2r∈(0,2π) and energy deficit Δ:=E(x)−E(fx).

[F1]

Existence of the uniform radius, continuity of the midpoint operation, the energy drop, its equality case, and convergence of zero-limit polygons and Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin: the pointwise bound ζi≤(ξi+ξi+1)/2, continuity and mesh-invariance of f, invariance of the basin under f, and the description of Ch0(n) as the set of tuples with some iterate of length <l/2 (clause (iv)); equality in the energy drop holds exactly for constant tuples and for equally spaced vertices of a closed local geodesic (clause (iii)).

[F2]

The spherical radius estimate, the quadrilateral separation constant, and the finite midpoint-operation comparison disk: clauses (i)-(iv), in particular the quadrilateral constant δ and the quantitative output ζk≤(ξk+ξk+1)/2−δ(η,μ) under the hypothesis ξi≥r/n, where η=(π−r)/2 and μ=min⁡{r/(2n),η}.

[F3]

Perturbation by a Euclidean regular polygon: comparison-disk bounds for degenerate comparison triangles: the quantitative output of [F2] extends to tuples whose comparison triangles may be degenerate, with constants independent of the perturbation.

[F6]

The Axiom of Choice, Compact geodesic locally CAT(1) spaces are CAT(1) exactly when they contain no short circle: the compact short-circle criterion consumes AC; the variance estimate, the two-case decrement and the closedness argument are choice-free when [F2] is granted.

[F7]

Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R: convergence in Ph(n) is convergence of the n-tuples, and fM and L are continuous with respect to it.

Proof

technique · direct
1.1F1algebra

Variance estimate for the edge lengths. By [F1], ζi≤(ξi+ξi+1)/2 for every i, whence E(fx)=∑iζi2≤∑i((ξi+ξi+1)/2)2 and therefore Δ=∑i(ξi2−ζi2)≥∑i(ξi2−(ξi+ξi+1)2/4)=14∑i(ξi−ξi+1)2≥0, where the middle identity is the algebraic expansion of the square and the cyclic sums. Consequently ∑i(ξi−ξi+1)2≤4Δ.

1.2F2algebra

First case of the decrement. If Δ>r2/n4, then Δ≥λn(2r), because λn(2r) is half of a minimum one of whose entries is r2/n4, so λn(2r)≤r2/n4<Δ.

1.3F1F7algebra

Openness of the basin. By [F1], Ch0(n) is the union over k≥0 of the sets {x∈Ph(n):L(fkx)<l/2}; each of these is open because fk and L are continuous ([F7]), so the basin is open in Ph(n).

1.4F1algebra

The basin contains no straight equilateral tuple (iii, second part). If x is nonconstant, equilateral (ξi=ξ>0 for all i) and straight at every vertex, then fx consists of the same closed local geodesic's points shifted by arclength ξ/2. Every subarc of that curve of length at most 2ξ lies in the uniform CAT(1) ball of radius ξ<l about its arclength midpoint; it minimizes there by Short local geodesics in a CAT(1) space are geodesics, and closed local geodesics have length at least 2π (ii), since 2ξ<π. Thus every shifted consecutive triple is straight, and induction gives L(fkx)=L(x)=nξ>0 for every k; therefore L(fkx) does not tend to 0 and x∉Ch0(n). Such tuples are exactly the equally spaced lists of points of a closed local geodesic by the equality analysis of F1.

2.1step 1.1F4algebra

Each edge is close to the mean 2r/n. Put δi:=ξi−ξi+1 and recall ∑iξi=2r. For each i, ξi−2r/n=1n∑k=0n−1(ξi−ξi+k)=1n∑k=0n−1∑j=0k−1δi+j; by Cauchy–Schwarz the absolute value of each inner sum is at most 2kΔ≤nΔ, since k≤n−1 and 2n−1≤n, so ∣ξi−2r/n∣≤nΔ.

3.1step 1.1step 2.1F2F3algebra

Second case of the decrement. If Δ≤r2/n4, then ξi≥r/n for every i by step 2.1. Put η=(π−r)/2 and μ=min⁡{r/(2n),η}, so that 0<μ<2η<π; by F2 and [F3] there is an index k with ζk≤(ξk+ξk+1)/2−δ(η,μ), where the constants are continuous in (n,L) and independent of the perturbation. Since ζk≥0, this forces δ(η,μ)≤(ξk+ξk+1)/2, and the sharpened bound ζk2≤((ξk+ξk+1)/2)2−δ(ξk+ξk+1)+δ2 at the index k, combined with the unsharpened bounds at the other indices, gives Δ≥δ(ξk+ξk+1)−δ2≥(δ/2)(ξk+ξk+1)≥δr/n, where the middle inequality uses δ≤(ξk+ξk+1)/2.

4.1step 1.2step 3.1F2F3algebra

The decrement (i). In view of steps 1.2 and 3.1, Δ≥min⁡{r2/n4,δ(η,μ)r/n}≥λn(2r) for λn the half of the displayed minorant. Since δ is continuous and positive on its domain, η(π−r)=(π−r)/2>0 and μ=min⁡{r/(2n),η}>0 depend continuously on r∈(0,π) with μ<2η, the function λn is continuous and positive on (0,2π); it depends only on n and on the length, not on h or on X. The explicit separation constant obeys 0<δ(η,μ)≤μ/2, since it is 2(μ/4) minus a nonnegative chord length. Thus 0<λn(2r)≤r2/(2n4) and λn(2r)≤μr/(4n): the first bound tends to zero as r→0, and the second as r→π because μ≤(π−r)/2. Hence E(fx)≤E(x)−λn(L(x)) for every x∈Ch0(n) with L(x)∈(0,2π).

5.1step 4.1F1F5algebra

Bounded iteration (ii). Let 0<a<b<2π; the restriction of the continuous positive function λn to the compact interval [a,b] attains a positive minimum λ0 ([F5]). Fix x∈Ch0(n) with L(x)≤b and put M=⌈b2/λ0⌉+1. Since L does not increase along the iterates and the basin is invariant ([F1]), every fjx with j≤M is in the basin with L(fjx)≤b; as long as L(fjx)≥a, step 4.1 gives E(fj+1x)≤E(fjx)−λ0. If L(fjx)≥a held for all j<M, then E(fMx)≤E(x)−Mλ0<0 because E(x)≤L(x)2≤b2 and Mλ0>b2, a contradiction; hence L(fjx)<a for some j<M, and then L(fMx)≤L(fjx)<a by monotonicity of L.

6.1step 5.1F1F7algebra

Closedness of the basin inside the short piece. Let xj∈Ch0(n) converge to x∈Ph(n) with L(x)<2π; choose b with max⁡{L(x),l/4}<b<2π and then j0 with L(xj)≤b for all j≥j0, and let M be the integer of step 5.1 for the parameters a=l/4 and b. Then L(fMxj)<l/4 for all j≥j0, and continuity of fM and L ([F7]) gives L(fMx)≤l/4<l/2, so x∈Ch0(n) by the description [F1]. Hence the basin is closed in {x∈Ph(n):L(x)<2π}.

7.1step 6.1F1F5

No homotopy crosses the basin boundary. Let s↦ys be a continuous family in the piece {L<2π}, s∈[0,1]. The basin is open by [F1] and closed in that piece by step 6.1. Its inverse image under the family is therefore both open and closed in [0,1]. Connectedness of the real interval [F5] excludes a nonempty proper subset that is both open and closed. Thus membership is constant along the family. Nonconstant equally spaced closed local geodesic tuples have fixed positive length under f by [F1] and lie outside the basin.

8.1step 4.1step 5.1step 6.1step 7.1F1F2F3F6∎

Conclusion. The finite comparison disk is built from midpoint iterates of a tuple already in the basin; no loop shrinkability assumption is used. Steps 1.1–4.1 prove the decrement, step 5.1 proves bounded iteration, and steps 6.1 and 7.1 prove closedness and separation, with openness supplied by [F1]. The constants depend only on n and length; AC enters through the finite-disk supplier and its perturbation extension.

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

Short local geodesics in a CAT(1) space are geodesics, and closed local geodesics have length at least 2π

Statement

Let X be a CAT(1) space (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles). Then:

(i) Unique short geodesics. Every two points p,q∈X with d(p,q)<π are joined by exactly one geodesic segment up to reparametrization (Geodesics and geodesic metric spaces); moreover the segment depends continuously on its endpoints: if pk→p, qk→q and d(p,q)<π, then the linear parametrizations of [pk,qk] converge uniformly to the linear parametrization of [p,q] (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R).

(ii) Local geodesics of length at most π are geodesics. If I⊆R is an interval (Intervals of R: the nine order-convex forms, nondegeneracy, and length) and c ⁣:I→X is a constant-speed local geodesic of speed λ≥0 with L(c)≤π, then d(c(s),c(t))=λ∣s−t∣ for all s,t∈I. Here, for an arbitrary interval, L(c) means the supremum of the lengths on its nonempty compact subintervals, with value 0 for an empty interval. Every compact restriction, after translation and arclength reparametrization when λ>0, is a geodesic segment; speed zero gives a constant map.

(iii) Closed local geodesics are at least 2π long. If c ⁣:Sℓ1→X is a nonconstant closed local geodesic (i.e. it is locally isometric and parametrized by arclength, as in Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles), then ℓ≥2π; and the image of c has diameter at least π. Consequently no nonconstant closed local geodesic is contained in a ball of diameter <π (Open ball, closed ball and sphere in a metric space).

Facts & Assumptions

Given: A CAT(1) space X; for clause (i) points p,q∈X and geodesic segments [p,q],[p,q]′; for clause (ii) an interval I⊆R and a local geodesic c ⁣:I→X; for clause (iii) a nonconstant closed local geodesic c ⁣:Sℓ1→X.

[F1]

Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles: CAT(1) means every pair of points at distance <π is joined by a geodesic segment, every geodesic triangle of perimeter <2π satisfies d(x,y)≤dS(xˉ,yˉ) for all points x,y of the triangle, and constant-speed local geodesics satisfy locally d(c(t′),c(t′′))=λ∣t′−t′′∣ for a fixed λ≥0, with the unit-speed convention λ=1; Sℓ1 is the circle of circumference ℓ.

[F2]

Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences: for side lengths satisfying the triangle inequalities with perimeter <2π a comparison triangle in S2 exists and is unique up to isometry; the spherical cosine rule holds: for A,B,C∈S2 with a=dS(B,C), b=dS(C,A), c=dS(A,B)<π and vertex angle γ at C, cos⁡c=cos⁡acos⁡b+sin⁡asin⁡bcos⁡γ.

[F3]

Geodesics and geodesic metric spaces: a geodesic segment from x to y is a path γ with d(γ(s),γ(t))=∣s−t∣; its midpoint is the point at equal distance from x and y, and a segment of length 0 is degenerate with midpoint its point.

[F5]

Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R: xk→x means d(xk,x)→0, and uniform convergence of maps is convergence in the supremum metric.

[F6]

Open ball, closed ball and sphere in a metric space: B(x,r)={y:d(x,y)<r}. A nonempty bounded set A has diameter sup⁡{d(a,b):a,b∈A} (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space); thus diameter <π implies that every pairwise distance is <π, without asserting the converse.

[F7]

Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric: the triangle inequality d(x,z)≤d(x,y)+d(y,z) holds, and a path parametrized proportionally to arclength whose length equals its endpoint distance gives a geodesic segment after translation and arclength reparametrization.

Proof

technique · direct
1.1F1F2F3algebra

Uniqueness of short geodesics. Let p,q∈X with d(p,q)<π and let g,g′ be geodesic segments from p to q, parametrized linearly on [0,d(p,q)]. Fix t∈[0,d(p,q)], put r=g(t) and r′=g′(t), and consider the geodesic triangle with vertices p,q,r whose sides are the segment g′ from p to q and the two subarcs of g from p to r and from r to q; its side lengths are d(p,q), d(p,r)=t and d(r,q)=d(p,q)−t, so its perimeter is 2d(p,q)<2π and its spherical comparison triangle is degenerate, with rˉ lying on the side [pˉ,qˉ] at distance t from pˉ. The comparison point of r′ is the point of [pˉ,qˉ] at distance t from pˉ, because r′ lies on the side g′ at that distance from p; by degeneracy this comparison point equals rˉ. The CAT(1) inequality applied to the pair (r,r′) of points of this triangle gives d(r,r′)≤dS(rˉ,rˉ)=0, so r=r′. Since t was arbitrary, g=g′ as linearly parametrized segments; hence geodesics between points at distance <π are unique up to reparametrization.

1.2F1F2F3algebra

Hinge estimate for one common initial point. Fix p∈X and ℓ<π, let q,q′∈X satisfy d(p,q),d(p,q′)≤ℓ and Δ:=d(q,q′)<2π−2ℓ, and let c,c′ be the linear parametrizations of the unique geodesic segments from p to q and to q′. If d(q,q′) is small enough that d(p,q),d(p,q′),Δ form an admissible triangle with perimeter <2π, then the triangle with vertices p,q,q′ and sides c,c′ and a segment from q′ to q is a geodesic triangle of perimeter ≤2ℓ+Δ<2π, and the CAT(1) inequality applied to the pair of its points c(t),c′(t) gives d(c(t),c′(t))≤dS(cˉ(t),cˉ′(t)), where cˉ(t),cˉ′(t) lie on the comparison sides at distances t d(p,q) and t d(p,q′) from pˉ. With γˉ the model angle at pˉ, the cosine rule [F2] gives cos⁡dS(cˉ(t),cˉ′(t))=cos⁡(tL)cos⁡(tL′)+sin⁡(tL)sin⁡(tL′)cos⁡γˉ and cos⁡γˉ=(cos⁡Δ−cos⁡Lcos⁡L′)/(sin⁡Lsin⁡L′), where L=d(p,q), L′=d(p,q′); the right-hand side is jointly continuous in (t,L,L′,Δ) on the compact family and equals 1 when Δ=0 and L=L′, while for L=0 or L′=0 the bound d(c(t),c′(t))≤t(L+L′) is immediate; hence sup⁡t∈[0,1]d(c(t),c′(t))→0 as (Δ,L−L′)→0.

2.1step 1.2F5F3algebra

Continuous dependence of clause (i). Let pk→p, qk→q with d(p,q)<π, and let ck,c be the linear parametrizations of [pk,qk], [p,q]; for large k all lengths are at most some ℓ<π. Fix such k and let ck′ be the linear parametrization of the unique segment from pk to q, which exists for large k because d(pk,q)≤d(pk,p)+d(p,q)<π. Then d(ck(t),c(t))≤d(ck(t),ck′(t))+d(ck′(t),c(t)) for all t: the first term tends to 0 uniformly by the hinge estimate at the common initial point pk with endpoint distance d(qk,q)→0, and the second term tends to 0 uniformly by the hinge estimate applied to the reversed segments, which have common initial point q and endpoint distance d(pk,p)→0. Hence the linear parametrizations of [pk,qk] converge uniformly to that of [p,q].

2.2F1F2F3F4F7step 1.1algebra

A unit-speed local geodesic minimizes on every short interval. Assume the speed is 1 and fix s<t in I with t−s≤π. A finite subdivision into local isometry intervals shows that c∣[s,t] is 1-Lipschitz and has length t−s. Let S={u∈[s,t]:c∣[s,u] is a geodesic}. It contains an initial interval by local isometry, and it is closed: the distance equalities on [s,u] pass to the limit as u increases or decreases to an endpoint. Put u0=sup⁡S∈S. If u0<t, choose 0<ε<u0−s with u0+ε<t, u0+ε−s<π, and c∣[u0−ε,u0+ε] isometric. This is possible since u0−s<t−s≤π. The triangle with vertices c(s),c(u0),c(u0+ε) and its two indicated subarcs has perimeter at most 2(u0+ε−s)<2π. In its model let βˉ be the angle at cˉ(u0). The local isometry gives d(c(u0−σ),c(u0+τ))=σ+τ for small positive σ,τ<ε. Comparison and the cosine rule therefore force βˉ=π: any smaller angle gives a model cross-distance strictly less than σ+τ. Thus the opposite side has length u0+ε−s, and the whole subarc c∣[s,u0+ε] minimizes. Indeed, a strict shortcut between any two of its points, combined with the remaining subarcs, would make its endpoint distance smaller than its length. This contradicts the definition of u0. Hence u0=t and d(c(s),c(t))=t−s.

3.1step 2.2F1F3F4F7algebra

Clause (ii) with arbitrary speed. If λ=0, the map is locally constant and therefore constant on the connected interval I: the inverse image of each attained value is open and its complement is a union of such open fibers. If λ>0, set J=λI and c~(u)=c(u/λ). This is unit-speed locally; finite partitions show that lengths of corresponding compact restrictions agree. For s<t in I, a finite local-isometry subdivision gives L(c∣[s,t])=λ(t−s)≤L(c)≤π. Applying step 2.2 to c~∣[λs,λt] gives d(c(s),c(t))=λ(t−s). Empty and one-point intervals have no unequal pair to test. This proves the distance equality and the stated segment interpretation.

4.1step 3.1step 1.1F1algebra

Clause (iii): ℓ≥2π. Suppose a nonconstant closed local geodesic c ⁣:Sℓ1→X had ℓ<2π, and put p=c(0), q=c(ℓ/2); the arcs α(θ)=c(θ) and β(θ)=c(ℓ−θ), θ∈[0,ℓ/2], are local geodesics of length ℓ/2<π, hence geodesic segments from p to q by step 3.1, and d(p,q)≤ℓ/2<π. Since d(p,α(θ))=θ=d(p,β(θ)) for all θ∈[0,ℓ/2], step 1.1 (uniqueness) gives c(θ)=c(ℓ−θ) for every θ∈[0,ℓ/2]. But c is locally isometric at p, so for small θ>0 with 2θ<ℓ one has d(c(θ),c(−θ))=2θ, where c(−θ):=c(ℓ−θ); this contradicts c(θ)=c(ℓ−θ) and θ>0. Hence ℓ≥2π.

4.2step 3.1step 2.2F6algebra

Clause (iii): diameter at least π. Let c be as in clause (iii) with ℓ≥2π and fix θ0; the restriction of c to [θ0,θ0+π] is a local geodesic of length π (its length equals the parameter length by the first paragraph of step 2.2), so step 3.1 gives d(c(θ0),c(θ0+π))=π. Hence the image of c has diameter at least π, and by definition of diameter a nonconstant closed local geodesic is never contained in a ball of diameter <π.

5.1step 2.1step 3.1step 4.1step 4.2F1∎

Conclusion. Clause (i) is step 2.1; clause (ii) is step 3.1; clause (iii) is steps 4.1 and 4.2. Therefore in a CAT(1) space short geodesics are unique and depend continuously on their endpoints, every constant-speed local geodesic of length at most π minimizes between its points, and every nonconstant closed local geodesic has length at least 2π and diameter at least π.

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

Polygon transfer, the basin as the shrinkable class, and the short-loop criterion

Statement

Assume the Axiom of Choice. Let X be compact, geodesic and locally CAT(1), with the uniform radius l and the loop conventions of Short loops, the uniform-plus-length topology, short-loop homotopies, and nonshrinkability, and let m:=inf⁡{ℓ>0: X contains an isometrically embedded circle of length ℓ}, with m:=+∞ if the set is empty (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles). Then:

(i) Polygon transfer. For every short rectifiable loop γ and every h∈(0,l) there are n≥3 and a cyclic n-tuple x∈Ph(n) with L(x)≤L(γ) (Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin) such that γ and the polygonal loop of x are short-loop homotopic through loops whose lengths never exceed L(γ); the transfer is by fine chord subdivision and replacement of chords by unique short geodesics.

(ii) Basin and shrinkability agree on polygons. Every polygon x∈Ph(n) with L(x)<2π in the zero-limit basin Ch0(n) is short-loop homotopic to a constant through loops whose lengths never exceed L(x); conversely, every x∈Ph(n) that is short-loop homotopic to a constant through polygons of Ph(n) lies in Ch0(n). Hence, for fixed n and h<l, on the piece L(x)<2π membership in the basin is equivalent to short-shrinkability.

(iii) Short loops below m, and attainment when m<2π. Every short loop γ with L(γ)<m is shrinkable; equivalently, every loop of length <min⁡{m,2π} is shrinkable. If m<2π, then m is attained: X contains an isometrically embedded circle of length m, it is a short nonshrinkable loop, and m is the minimum length of a nonshrinkable loop.

(iv) The CAT(1) case. If m≥2π, then every short loop is shrinkable and X is CAT(1). If X is CAT(1), then m≥2π and again every short loop is shrinkable. Consequently, for compact geodesic locally CAT(1) X, the following are equivalent: (a) X is CAT(1); (b) m≥2π; (c) every short loop is shrinkable; (d) X contains no isometrically embedded circle of length <2π. The equivalence of (a), (b) and (d) is the compact short-circle criterion (Compact geodesic locally CAT(1) spaces are CAT(1) exactly when they contain no short circle); (c) follows from (b) by (iii), and (c) implies (d) because an isometrically embedded circle of length <2π is a short closed local geodesic, hence lies outside the basin and is nonshrinkable by (ii).

Facts & Assumptions

Given: AC and a compact geodesic locally CAT(1) space X with uniform radius l<π/2; a short rectifiable loop γ and h∈(0,l); fixed n≥3 and tuples x∈Ph(n); the number m of the statement.

[F1]

Short loops, the uniform-plus-length topology, short-loop homotopies, and nonshrinkability: the loop conventions, the uniform-plus-length topology, short-loop homotopies and shrinkability, and the fact that short-loop homotopy is an equivalence relation; Length in a metric target: lower semicontinuity and arc-length reparametrization: arclength normalization, additivity of length under subdivision, lower semicontinuity of length, and the chord bound.

[F2]

The spherical radius estimate, the quadrilateral separation constant, and the finite midpoint-operation comparison disk, Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences, Short local geodesics in a CAT(1) space are geodesics, and closed local geodesics have length at least 2π: in a CAT(1) space, geodesics of length <π are unique and depend continuously on their endpoints, and balls of radius <π/2 are convex. Locally, apply these results inside the uniform CAT(1) balls Bˉ(p,l) of Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin: points at distance <l have unique short geodesics in X, since any such geodesic stays in the radius-l ball about its initial point. Convexity of larger ambient balls requires a separate comparison argument, as in step 1.4 below.

[F3]

Existence of the uniform radius, continuity of the midpoint operation, the energy drop, its equality case, and convergence of zero-limit polygons and Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin: the midpoint operation f with ζi≤(ξi+ξi+1)/2, the basin Ch0(n), its description by an iterate of length <l/2, the equality case (constant tuples and equally spaced lists of points of a closed local geodesic), convergence of basin iterates to a constant tuple in (v), and the continuity of f and of the length and energy functionals.

[F4]

The uniform energy decrement on the basin, bounded iteration, and the closedness of the basin inside the short polygon space: the uniform decrement (i), the bounded iteration (ii), and the statement that the basin is open in Ph(n) and closed in the piece {L<2π}, and that no short-loop homotopy inside that piece connects a basin tuple to a tuple outside it.

[F7]

Compact geodesic locally CAT(1) spaces are CAT(1) exactly when they contain no short circle and The Axiom of Choice: the compact criterion (i), its attained circle of length 2injrad⁡(X)<2π in (ii), and its scaled all-pair comparison (iii) for triangle perimeter <2R under uniqueness below R≤π. AC is required by these suppliers.

[F8]

A closed subset of a compact metric space is compact: closed metric balls in the compact space X are compact.

Proof

technique · direct
1.1F1F2F3F6algebra

Continuity of finite polygon loops. A tuple with mesh <l determines its normalized polygonal loop continuously in the uniform-plus-length topology. Its length is a finite sum of continuous endpoint distances. On each edge, the unique short geodesic depends continuously on its endpoints by [F2]; normalized parametrization assigns that edge its length divided by the total length. The cumulative break times are continuous when the total length is positive. Edges tending to length zero have image diameter tending to zero, so do not affect uniform continuity at a coincident break time. If total length tends to zero, the whole image tends to its initial vertex. Thus degenerate edges and constant tuples are included.

1.2F1F2F3F4F6choose

Closed local geodesics cannot be short-shrunk. A continuous short-loop homotopy γs has b:=max⁡sL(γs)<2π, since length is continuous in the specified topology. Normalization and the chord bound make every loop b-Lipschitz. Choose N with 2b/N<h<l, and sample every loop at the fixed times j/N. This gives a continuous family in Ph(N), with polygon lengths at most b. If one endpoint is a nonconstant closed local geodesic, its sampled tuple is equally spaced and every consecutive triple is straight: its two consecutive arcs have total length <l and lie in a uniform CAT(1) chart, where a short local geodesic minimizes by [F2]. That tuple is outside the basin by [F3]; the constant endpoint is inside. This contradicts the no-crossing statement [F4]. Hence every nonconstant short closed local geodesic is nonshrinkable.

1.3F1F7algebra

Identifying the first embedded-circle length. Put r=injrad⁡(X). If X is not CAT(1), F7 gives an embedded circle of length 2r<2π and r>0. Any embedded circle of length ℓ supplies two distinct minimizing arcs between its opposite points, each of length ℓ/2; thus r≤ℓ/2. Consequently m=2r, and this minimum is attained by the supplied circle. If X is CAT(1), F7 gives m≥2π. No limit-of-length argument or unproved shortest-class replacement is used.

1.4F1F2F7F8algebraconstruct

A loop shorter than 2r lies in a convex CAT(1) ball. A zero-length loop is constant and requires no radius-zero ball. For a positive-length loop in the non-CAT(1) case take 0<L<2r and put q=L/4<π/2. Uniqueness holds below r by its definition, so F7 gives all-pair comparison for triangles of perimeter <2r. The proof of the radius estimate The spherical radius estimate, the quadrilateral separation constant, and the finite midpoint-operation comparison disk (i) uses only triangles of perimeter at most L<2r: splitting the loop into equal halves and taking the midpoint a of their endpoints therefore puts the loop in K=Bˉ(a,q). For u,v∈K, the center triangle has perimeter at most 2(d(a,u)+d(a,v))≤4q=L<2r, and its spherical model segment stays in the radius-q ball; scaled comparison shows [u,v]⊆K. Thus K is convex, geodesic and compact by [F8]. To check local CAT(1) in K, intersect a sufficiently small ambient CAT(1) ball centered at u∈K with K: both are convex for its short segments, so their intersection is a CAT(1) ball in the induced metric on K. Any isometrically embedded circle in K would have opposite points whose two minimizing arcs have length equal to their ambient distance, at most 2q=L/2<r, violating uniqueness in X. Hence K has no short embedded circle and is CAT(1) by F7. In the CAT(1) case the ordinary radius estimate applies to every short loop and its radius-L/4 ball is already convex and CAT(1).

2.1step 1.1F1F2F3F6construct

Length-controlled chord replacement (i). Subdivide a normalized loop γ into n≥3 arcs of length <h<l. On one arc β:[0,A]→X, parametrized by arclength, replace its suffix [u,A] by the unique short geodesic from β(u) to β(A), and vary u from A down to 0. The new arc length is u+d(β(u),β(A))≤A, continuous in u; its prefix and geodesic suffix depend continuously on u. After normalization this remains continuous: cumulative lengths of the finitely many unchanged pieces and the variable prefix and suffix are continuous, and a disappearing piece has diameter at most its disappearing length. Repeating for the finitely many arcs gives a short-loop homotopy to the polygon x of subdivision points, with mesh⁡(x)<h and every intermediate length at most L(γ). A zero-length loop needs only the constant tuple.

2.2step 1.1F1F2F3F6algebra

Midpoint sliding and basin contraction. For a polygon y, let yi(t) be the point at fraction t∈[0,1/2] on [yi,yi+1]. The path through yi+1 gives d(yi(t),yi+1(t))≤(1−t)ξi+tξi+1; hence this tuple has mesh at most the old mesh and total length at most L(y). It joins y to fy, and step 1.1 makes the polygon loops a continuous short-loop homotopy. For x in the basin, concatenate these homotopies over intervals tending to the terminal time 1. By F3, the tuples fkx converge to a constant tuple at some p, their lengths tend to zero, and each intermediate vertex is within mesh⁡(fkx)/2 of its old vertex. Thus the intermediate loops converge uniformly to p and their lengths tend to zero. The concatenation extends continuously to the constant loop, with lengths at most L(x).

3.1step 1.1step 2.2step 1.2F1F3F5F6F8construct

A non-basin polygon has a nonconstant closed-geodesic limit. Suppose L(x)<2π and x is not in the basin. Its iterated lengths and energies are bounded nonnegative monotone sequences, so converge by A monotone sequence converges if and only if it is bounded, to L∞>0 and E∞ respectively; the positive length limit follows from nonmembership in the basin. Put h0=mesh⁡(x)≤h<l. Mesh does not increase by [F3], so every iterate lies in K:={y∈Xn:mesh⁡(y)≤h0}. The continuity of mesh makes K closed in compact Xn ([F3], [F5]); hence K is compact by [F8]. Its sequential compactness gives a subsequence fkjx→z∈K⊆Ph(n); continuity of E and f gives E(z)=E∞=E(fz) and L(z)=L∞. Equality analysis in [F3] therefore makes z a nonconstant equally spaced closed local geodesic tuple. The finitely many midpoint-sliding homotopies join x to fkjx through lengths at most L(x). For large j, join each vertex of fkjx to the corresponding vertex of z by a short geodesic. Every intermediate tuple is uniformly close to z, so its mesh remains <l and its length remains <2π, by finite-sum continuity and the positive margins l−h and 2π−L(x). Step 1.1 thus joins that iterate to z by a short-loop homotopy. If x were shrinkable then z would be shrinkable, contradicting step 1.2. Together with step 2.2 this proves that basin membership is equivalent to short-shrinkability, including homotopies through arbitrary normalized short loops.

3.2step 1.1step 2.1step 1.3step 1.4F1F2F7algebra

Length-nonincreasing contraction in that ball. First transfer the loop to a fine polygon in K using step 2.1; all the suffix geodesics remain in K by convexity. Contract each polygon vertex along its geodesic to a. This does not increase pairwise distances: in a spherical comparison triangle about a, with radial lengths u,v≤q<π/2 and included angle θ, the radial points at fraction t∈[0,1] have distance dt with cos⁡dt=cos⁡(t(u−v))−(1−cos⁡θ)sin⁡(tu)sin⁡(tv)≥cos⁡(u−v)−(1−cos⁡θ)sin⁡usin⁡v=cos⁡d1, because cosine decreases and sine increases on the relevant ranges. CAT(1) comparison in K bounds the actual distance by this model distance, so every contracted polygon edge is at most its original length. Step 1.1 supplies continuity, including the constant endpoint. Therefore every loop of length <min⁡{m,2π} is shrinkable, with a homotopy whose lengths never exceed its own length.

4.1step 2.1step 2.2step 1.2step 3.1step 1.3step 3.2F1F4F7∎

Attainment and equivalence. When m<2π, step 1.3 supplies the embedded circle of length m; it is a closed local geodesic and nonshrinkable by step 1.2, while step 3.2 excludes every shorter nonshrinkable loop. Thus m is the attained minimum nonshrinkable length. If m≥2π, step 3.2 shrinks every short loop and F7 gives CAT(1). Conversely CAT(1) gives m≥2π and the same contraction. If all short loops are shrinkable, step 1.2 excludes every short embedded circle, so the criterion gives CAT(1). These are exactly (iii) and (iv); (i) is step 2.1 and (ii) is steps 2.2 and 3.1. AC is inherited from the compact criterion and its scaled comparison.

5 · Examples, counterexamples and false statements

None yet.

Sources