Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

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

Statement

Let X be a connected complete metric space that is locally CAT(0) and a length space, and suppose X is simply connected (Simply connected topological spaces, Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles). Then:

(i) For every x0∈X the endpoint evaluation exp⁡:Gx0→X of The space of local geodesics, its length metric, and the covering criterion for local isometries is a covering map and a homeomorphism, and every two points of X are joined by exactly one local geodesic, which is a minimizing geodesic (Geodesics and geodesic metric spaces).

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

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

Facts & Assumptions

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

[F1]

exp⁡:Gx0→X is a covering map with simply connected total space; the covering is local-isometric for the induced length metric (The space of local geodesics, its length metric, and the covering criterion for local isometries).

[F3]

Endpoint stability provides, along a local geodesic, a uniform radius on which perturbations have unique local geodesics with convex separation, continuous dependence, and the length bound L(c′)≤L(c)+d(c(0),c′(0))+d(c(1),c′(1)) (Endpoint stability for local geodesics in complete locally CAT(0) spaces).

[F4]

Patchwork: in a space of curvature ≤κ the vertex angles of a geodesic triangle swept by a continuous family of geodesics are no greater than the angles of any comparison triangle; and the vertex-opposite-side criterion of the CAT(0) inequality, together with the convexity of the distance function between geodesics with a common initial point and proportional parametrizations, holds in a CAT(0) space (Alexandrov comparison: straightening a hinge, gluing comparison triangles, and patchwork clauses (i)–(iii), Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences clauses (iv)(b)–(iv)(c), Comparison angles of hinges, model triangle angles, and the Alexandrov upper angle).

Proof

1.1F1F2F5

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

2.1step 1.1F1F5

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

3.1step 2.1F3F5algebra

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

4.1step 2.1step 3.1F3

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

5.1step 2.1step 3.1step 4.1F4F5construct

Verification of the patchwork hypotheses. Consider a triangle with vertices p,q0,q1 and let γ parametrize [q0,q1]. The unique geodesics cs from p to γ(s) form a continuous sweep by step 4.1; evaluation (s,t)↦cs(t) is continuous, since uniform convergence controls evaluation and each fixed geodesic is continuous. Every image point z has a closed induced-metric CAT(0) ball by local CAT(0). A smaller concentric ball is convex by the midpoint inequality [F4], hence again CAT(0); its interior is a neighbourhood of z. The compact sweep image is covered by finitely many such interiors, and their preimages admit a positive subdivision size on the compact parameter square, so each rectangle in a sufficiently fine grid is contained in one of these CAT(0) balls. These are exactly the local-chart hypotheses of patchwork [F4]. The side and perimeter restrictions are automatic for κ=0, since D0=∞. If the triangle has distinct vertices and no vertex lies on the opposite side, patchwork therefore proves domination of all its vertex angles. If a vertex lies on the opposite side, uniqueness identifies all three sides with subsegments of a single geodesic; comparison is then equality in a degenerate Euclidean segment. Repeated vertices are handled the same way.

6.1step 5.1F4algebra

Vertex-to-side comparison. Let r be an interior point of [q0,q1] in a nondegenerate triangle and join p to r by the unique geodesic. By step 5.1 the comparison angles of (p,q0,r) and (p,r,q1) dominate their actual angles. At r these two actual angles have sum at least π: take points x,y on the opposite base germs at equal small distance h from r and z on the germ toward p at small distance k. In a CAT(0) chart the midpoint inequality gives d(z,x)2+d(z,y)2≥2k2+2h2. The Euclidean cosine rule therefore gives cos⁡∠~r(x,z)+cos⁡∠~r(z,y)≤0, hence the sum of these two comparison angles is at least π. In every sufficiently small neighbourhood the supremum defining each upper angle is at least its corresponding angle here; taking the infimum over neighbourhood sizes preserves the sum bound. Glue their Euclidean comparison triangles along the comparison side [p,r], placing the base vertices on opposite sides. Alexandrov's straightening inequality F4(2) gives d(p,r)≤d2(pˉ,rˉ) in the comparison triangle of (p,q0,q1), with rˉ at the same distance from qˉ0 along its base. If one subtriangle degenerates, the same inequality follows by continuity of the Euclidean straightening inequality in its side lengths, or directly by its collinear equality case. At the endpoints r=qi comparison is equality. Thus every vertex-to-opposite-side comparison holds; the vertex-to-side criterion of [F4] now gives the full CAT(0) inequality.

7.1step 4.1F4F5∎

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

Depends on

Used by

Dependency tree · two levels

103 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources