Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

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.

Depends on

Used by

Dependency tree · two levels

50 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