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.

Compact geodesic locally CAT(1) spaces are CAT(1) exactly when they contain no short circle

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X be a metric space that is compact, geodesic and locally CAT(1) (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles, Open cover, subcover, compact metric space, and compact subset of a metric space). Then:

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

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

(iii) Comparison below a uniqueness threshold. Let 0<R≤π. If every pair of points of X at distance <R is joined by a unique geodesic, then every geodesic triangle of perimeter <2R satisfies the spherical CAT(1) comparison inequality for all pairs of points on its sides: d(u,v)≤dS(uˉ,vˉ) for the corresponding points of its spherical comparison triangle (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles).

Facts & Assumptions

Given: AC, a compact geodesic locally CAT(1) metric space X, and the injectivity radius defined in the Statement.

[F1]

The spherical model, its comparison triangles, spherical cosine rule, and the CAT(1) circle criterion are proved in Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences clauses (ii), (iii), (vi); CAT inequalities and geodesic segments have the definitions Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles, Geodesics and geodesic metric spaces, and isometric subspaces have their induced distances (Isometry, isometric embedding, and the subspace metric on a subset).

[F3]

The patchwork sweep gives vertex angle comparison for a triangle of perimeter <2π when its geodesics from one vertex to the opposite side depend continuously on the side point; Alexandrov's straightening gives the comparison distance to a marked splitting point, including the limiting collinear configurations. Angles satisfy the triangle inequality, and the angle between the two directions of a geodesic is π (Alexandrov comparison: straightening a hinge, gluing comparison triangles, and patchwork clauses (i), (iii), (iv) and its closed model-comparison argument; Comparison angles of hinges, model triangle angles, and the Alexandrov upper angle).

Proof

1.1F1given

A short circle obstructs CAT(1). An isometric copy of Sℓ1, ℓ<2π, has geodesic triangle sides that remain geodesics in X, with exactly the same side and cross distances. The circle's failed CAT(1) test in [F1] is therefore a failed test in X. This proves the forward implication of (i). Empty and one-point spaces are CAT(1) and contain no circle; henceforth the non-CAT(1) case is nonempty.

1.2F1F2F4choose

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

1.3F2F4given

Continuity under short uniqueness. Suppose 0<R≤π and all pairs at distance <R have unique geodesics. If endpoints un,vn converge to u,v with d(u,v)<R, parametrize their geodesics on [0,1]. Their speeds d(un,vn) are bounded, hence they are equicontinuous into compact X. By [F2] every subsequence has a uniformly convergent further subsequence; the distance equality d(cn(s),cn(t))=∣s−t∣d(un,vn) passes to the limit by [F4], making that limit the unique geodesic from u to v. The entire sequence converges uniformly: failure would give a subsequence uniformly separated from that geodesic and contradict its convergent further subsequence. This proves endpoint continuity in the uniform metric. AC is used through the Ascoli corollary.

2.1step 1.3F1F3F4

Angle comparison below the uniqueness threshold. For a triangle of perimeter P<2R, every side has length <R. For any point v of the side opposite p, the two boundary routes give 2d(p,v)≤P<2R. Step 1.3 supplies a continuous sweep of the unique geodesics [p,v]. If p is off that side, patchwork [F3] gives angle comparison. If p lies on that side, uniqueness makes all sides the corresponding subsegments and the triangle is isometric to its collinear comparison. Thus every triangle of perimeter <2R has vertex angle comparison.

3.1step 2.1F1F3F4algebra

Comparison at scale R and the compact uniqueness criterion. Under the hypothesis of (iii), use step 2.1 with that R. For a point v interior to the side [q0,q1] of a triangle of perimeter P<2R, the two triangles (p,q0,v) and (p,v,q1) have perimeter at most P. Their actual angles at v have sum at least π by [F3], and therefore so do their comparison angles. Glue their models along the common side [pˉ,vˉ] on opposite sides; the four boundary lengths sum to P<2R≤2π. Alexandrov's marked-point comparison [F3] then gives d(p,v)≤dS(pˉ,vˉ) in the comparison triangle of (p,q0,q1). Collinear submodels follow by the closed limiting cosine inequalities; p=v or p on the opposite side is already trivial by uniqueness. This proves every vertex-to-opposite-side inequality. It implies all-pair comparison as follows. For x∈[p,q], y∈[p,z], first apply it in (p,x,z) to obtain d(x,y)≤dS(x^,y^); then apply it in (p,q,z) to obtain d(x,z)≤dS(xˉ,zˉ). These subtriangles have perimeter at most the original perimeter. The spherical cosine rule shows that the second inequality bounds the model angle at p in (p,x,z) by the original model angle at pˉ, and the first then bounds d(x,y) by dS(xˉ,yˉ): for fixed two positive sides <π, the opposite side increases with the included angle because both sines are positive. Zero sides and coinciding points give equality directly. This proves (iii); the sweep, both split triangles and both all-pair subtriangles stay within the same perimeter bound 2R. Taking R=π proves that short uniqueness makes X CAT(1). Conversely CAT(1) implies uniqueness below π by its digon test. We have proved, rather than assumed, the compact short-uniqueness criterion.

4.1step 1.2step 3.1F4

The first failure is below π. Suppose X is not CAT(1). Step 3.1 gives two distinct geodesics between points of distance L<π. Uniqueness cannot hold at any radius greater than L, so 0<r≤L<π. For every pair at distance <r, uniqueness holds: choose a radius in the defining set strictly greater than that distance, using the definition of supremum. In particular steps 1.3 and 2.1 apply with R=r.

5.1step 4.1F2F4choose

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

6.1step 2.1step 4.1step 5.1F1F3F4algebra

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

7.1step 2.1step 4.1step 6.1F1F3F4algebra

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

8.1step 4.1step 7.1F1F4∎

All circle distances, and conclusion. For arbitrary c(s),c′(t) let w=c′(r−s) be opposite c(s). Step 7.1 and the reverse triangle inequality give d(c(s),c′(t))≥r−∣t−(r−s)∣=min⁡{s+t,2r−s−t}; the two routes through x,y give the reverse bound. Distances on either single side already equal parameter differences. Thus traversing c and then c′ backwards gives an isometry S2r1→c([0,r])∪c′([0,r]): the distance formula also excludes every additional identification. Since 0<r<π, this proves (ii); together with step 1.1 it proves (i).

Remarks

The proof includes the compact uniqueness criterion of Bridson–Haefliger II.4.12. The two collapse arguments in II.4.16 are written here as spherical cosine computations; each tested triangle has its perimeter explicitly bounded by 2r. AC is used for the near-minimal sequence and the Ascoli extractions, including the continuity argument.

Depends on

Used by

Dependency tree · two levels

104 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