Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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.

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.

Depends on

Used by

Cited to discharge well-definedness by Short loops, the uniform-plus-length topology, short-loop homotopies, and nonshrinkability.

Dependency tree · two levels

124 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