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.

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.

Depends on

Used by

Dependency tree · two levels

46 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