Alphabeta Math
LemmaStatement: 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.

Existence of the uniform radius, continuity of the midpoint operation, the energy drop, its equality case, and convergence of zero-limit polygons

Statement

Let X be compact and locally CAT(1), and let l, n≥3 and h<l be as in Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin. Then:

(i) The uniform radius, compactness and continuity. A uniform local CAT(1) radius l for X exists, and one may assume l<π/2; every x∈Xn with mesh⁡(x)<l has a well-defined midpoint tuple f(x), and mesh⁡(fx)≤mesh⁡(x), so f restricts to a self-map of Ph(n). The space Ph(n) is a compact metric subspace of Xn, the functions mesh⁡, L and E are continuous on Xn, and f is continuous on {mesh⁡<l}.

(ii) The energy does not increase. For every x∈Ph(n) one has L(fx)≤L(x) and E(fx)≤E(x).

(iii) Equality analysis. E(fx)=E(x) holds if and only if either x is constant, or all n edge lengths d(xi,xi+1) equal a common value ξ>0 and every consecutive triple is straight, i.e. xi+1 is the midpoint of a geodesic segment from xi to xi+2 (equivalently d(xi,xi+2)=d(xi,xi+1)+d(xi+1,xi+2)). In the second case the concatenation of the n segments [xi,xi+1] is a closed local geodesic of length nξ on which x0,…,xn−1 are equally spaced. For n=2 the only equality case is the constant tuple.

(iv) The basin is the eventually-short-polygon set and is open. The set U:={x∈Ph(n):L(fmx)<l/2 for some m≥0} is open in Ph(n) and equals the zero-limit basin Ch0(n); in particular Ch0(n) is open.

(v) Convergence in the basin. If x∈Ch0(n), then L(fkx)→0 and the iterates converge to a constant tuple: if L(fmx)=0 an iterate is already constant and all subsequent iterates equal it; for every m with 0<L(fmx)<l/2 all later iterates lie in the closed ball Bˉ((fmx)0, L(fmx)/2), whose radii tend to 0, the diameters of the iterates tend to 0, and the whole sequence (fkx) converges in Xn to a constant tuple (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R). Conversely, if the iterates of x∈Ph(n) converge to a constant tuple, then x∈Ch0(n).

(vi) Degenerate and zero-length cases. If E(x)=0 then x is constant and fx=x. If some consecutive vertices of x coincide, the corresponding edge contributes 0 to mesh, length and energy, the midpoint of the degenerate pair is the point itself, and the statements (ii) and (iii) hold unchanged; the equality analysis includes collapsed comparison triangles by continuity.

Facts & Assumptions

Given: A compact locally CAT(1) space X, a uniform local radius l<π/2, an integer n≥3 and h<l, with Ph(n), f, L, E, mesh and Ch0(n) as in the definition.

[F1]

Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin: l is a uniform local CAT(1) radius when all closed balls of radius at most l are CAT(1); for mesh⁡(x)<l consecutive vertices are joined by a unique geodesic inside B(xi,l) and f(x)i=mid⁡(xi,xi+1); Ph(n)={x∈Xn:mesh⁡(x)≤h}; Ch0(n)={x∈Ph(n):lim⁡kL(fkx)=0}; a constant tuple has mesh⁡=L=E=0 and is fixed by f, and a degenerate pair has midpoint the point itself.

[F2]

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 between points at distance <π are unique and depend continuously on their endpoints, and every nonconstant closed local geodesic has length at least 2π and image of diameter at least π.

[F3]

Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles: CAT(1) and locally CAT(1) spaces; a convex subset of a CAT(1) space with the induced metric is CAT(1); X is compact.

[F4]

Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences: comparison triangles of perimeter <2π exist in S2; the spherical cosine rule cos⁡c=cos⁡acos⁡b+sin⁡asin⁡bcos⁡γ; balls of radius <π/2 in a CAT(1) space are convex; the CAT(1) inequality holds for all pairs of points of a triangle of perimeter <2π.

[F5]

Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric: metric axioms, triangle inequality, and the product (sup) metric on Xn.

[F6]

Open ball, closed ball and sphere in a metric space: B(x,r)={y:d(x,y)<r} and Bˉ(x,r)={y:d(x,y)≤r}.

[F7]

Continuity of a map between metric spaces, at a point and globally, in the ε-δ form: continuity of maps between metric spaces, and continuity of finite maxima and sums of continuous functions.

[F9]

A product of finitely many compact spaces is compact in the product topology, A closed subset of a compact metric space is compact: finite products of compact spaces are compact and closed subsets of compact spaces are compact.

[F11]

Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R, Limits and Cauchy sequences of reals: convergence of sequences and of real nets as used in lim⁡kL(fkx)=0.

[F14]

A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: a continuous real-valued function on a nonempty compact metric space attains a positive minimum if it is everywhere positive.

Proof

technique · direct
1.1F1F3F4F10algebra

A uniform radius exists. By local CAT(1), every z∈X has a closed ball Bˉ(z,ρz) that is CAT(1); replacing ρz by min⁡{ρz,π/4} we may assume ρz<π/2, because a closed sub-ball of radius <π/2 of a CAT(1) ball is convex ([F4]) and a convex subset of a CAT(1) space with the induced metric is CAT(1) ([F3]). The open balls B(z,ρz/2) cover the compact space X, so by [F10] the cover has a Lebesgue number δ>0. Put l:=min⁡{δ/4,π/4}<π/2 and let x∈X, 0<r≤l: the closed ball Bˉ(x,r) has diameter at most 2r≤δ/2<δ, so it is contained in B(z,ρz/2)⊆Bˉ(z,ρz) for some z; as a ball of radius r≤π/4<π/2 in the CAT(1) space Bˉ(z,ρz) it is convex, and a convex subset of a CAT(1) space with the induced metric is CAT(1), so the induced metric on Bˉ(x,r) is CAT(1). Hence l is a uniform local CAT(1) radius and l<π/2; applying this with the given l replaced by the smaller number justifies the standing assumption.

1.2F1F2F4algebra

Pointwise midpoint bound. Let x∈Xn with mesh⁡(x)<l and put ξi:=d(xi,xi+1). For each i the three vertices xi,xi+1,xi+2 lie in the closed ball Bˉ(xi+1,l) of radius l, which is CAT(1) by [F1]; the triangle (xi,xi+1,xi+2) has perimeter at most 2(ξi+ξi+1)<4l<2π and its sides lie in the ball by convexity, so its comparison triangle in S2 exists and the CAT(1) inequality gives d(m1,m2)≤dS(mˉ1,mˉ2), where m1:=mid⁡(xi,xi+1)=f(x)i, m2:=mid⁡(xi+1,xi+2)=f(x)i+1 and mˉ1,mˉ2 are the comparison points of the model triangle. In the model, the two points lie at distances ξi/2 and ξi+1/2 from the vertex xˉi+1 with some included angle θˉ, so the cosine rule of [F4] gives cos⁡dS(mˉ1,mˉ2)=cos⁡(ξi/2)cos⁡(ξi+1/2)+sin⁡(ξi/2)sin⁡(ξi+1/2)cos⁡θˉ≥cos⁡((ξi+ξi+1)/2) by cos⁡θˉ≥−1 and the addition formula; since (ξi+ξi+1)/2<l<π/2 and cos⁡ is decreasing on [0,π], we conclude d(f(x)i,f(x)i+1)≤(ξi+ξi+1)/2. If one of the two half-edges vanishes the midpoint coincides with the vertex and the same conclusion is immediate, so the estimate holds for all tuples of mesh <l.

1.3F1F2F5F7F13algebra

Continuity. Endpoint distances are continuous by the reverse triangle inequality, so their finite maximum mesh and finite sums L,E are continuous. To check f at x of mesh <l, fix i and choose R with d(xi,xi+1)<R<l. The fixed chart Z=Bˉ(xi,R) is CAT(1). If xk→x, then for large k both endpoints xik,xi+1k belong to Z. Their short geodesic in Z is also the geodesic defining f(xk)i: both geodesics are contained in Bˉ(xik,l), since every point on either is at distance at most their endpoint distance <l from xik; uniqueness in that CAT(1) ball identifies them. Continuous endpoint dependence applied in the fixed CAT(1) space Z now gives f(xk)i→f(x)i. There are finitely many indices, so f(xk)→f(x).

2.1step 1.3F8F9algebra

Ph(n) is compact. The function mesh is continuous on Xn by step 1.3, so Ph(n)=mesh⁡−1([0,h]) is closed in Xn; the sup metric has the finite product topology (a radius-r ball is a product of coordinate radius-r balls, and every finite product neighborhood contains such a ball), so Xn is compact by [F9], hence Ph(n), a closed subspace of a compact space, is compact by [F9].

2.2step 1.2F1F12algebra

Monotonicity and the self-map property. For x∈Ph(n) and each i, step 1.2 gives d(f(x)i,f(x)i+1)≤(ξi+ξi+1)/2 with ξi=d(xi,xi+1); summing gives L(fx)≤12∑i(ξi+ξi+1)=L(x), and summing squares gives E(fx)≤14∑i(ξi+ξi+1)2, while ∑i(ξi+ξi+1)2=2∑iξi2+2∑iξiξi+1≤2∑iξi2+∑i(ξi2+ξi+12)=4∑iξi2=4E(x) by 2ab≤a2+b2 ([F12]), so E(fx)≤E(x). Also d(f(x)i,f(x)i+1)≤(ξi+ξi+1)/2≤mesh⁡(x), so mesh⁡(fx)≤mesh⁡(x)≤h: the midpoint operation maps Ph(n) into itself, and it is defined on all of Ph(n) because h<l. This proves (i)'s midpoint assertions and clause (ii).

3.1step 1.2step 2.2F1F4algebra

Equality analysis. Suppose E(fx)=E(x). Combining the two bounds of step 2.2, E(fx)≤14∑i(ξi+ξi+1)2≤E(x), so equality forces both 14∑i(ξi+ξi+1)2=E(x), i.e. ∑i(ξi−ξi+1)2=0 and hence all ξi are equal to a common ξ, and all the pointwise inequalities of step 1.2 to be equalities: d(f(x)i,f(x)i+1)=(ξi+ξi+1)/2=ξ for every i. If ξ=0 then all consecutive vertices coincide and x is constant. If ξ>0, fix i; in the notation of step 1.2 the equality d(m1,m2)=ξ combined with d(m1,m2)≤dS(mˉ1,mˉ2)≤ξ forces equality throughout, so cos⁡θˉ=−1 and θˉ=π; the comparison triangle is degenerate with d(xi,xi+2)=ξ+ξ=2ξ, so equality holds in the triangle inequality d(xi,xi+2)≤d(xi,xi+1)+d(xi+1,xi+2) and the concatenation of the two geodesics [xi,xi+1], [xi+1,xi+2] is a geodesic segment with midpoint xi+1. Conversely, if x is constant then fx=x and E(fx)=E(x)=0; and if all edge lengths equal ξ>0 and every triple is straight, then each d(f(x)i,f(x)i+1) equals ξ as the distance between the two points at distance ξ/2 from xi+1 on a common geodesic through it, so E(fx)=nξ2=E(x). In the nonconstant case the concatenation of the n segments [xi,xi+1], parametrized on Snξ1 by arclength, is by construction locally isometric at every point (at the vertices by straightness of the corresponding triple, inside the edges by the geodesic property) and has length nξ, so it is a closed local geodesic on which x0,…,xn−1 are equally spaced. For n=2 the two edges are d(x0,x1)=d(x1,x0)=ξ and f(x)0=f(x)1 is their midpoint, so d(f(x)0,f(x)1)=0 and equality E(fx)=E(x)=2ξ2 forces ξ=0: only the constant tuple.

3.2step 1.1step 1.3step 2.2F1F4F6F8F11algebra

Convergence in the basin. Let x∈Ch0(n), so Lk:=L(fkx)→0 by [F1]. If Lm=0 for some m, that iterate is constant and fixed by f, proving convergence. Otherwise all Lk>0; fix m with Lm<l/2; then each vertex (fmx)j is at distance at most Lm/2 from (fmx)0, because the two arcs of the polygon from (fmx)0 to (fmx)j have lengths summing to Lm, so the shorter one is at most Lm/2. The closed ball Bˉ((fmx)0,Lm/2) has radius <l/4<π/2 and is contained in the CAT(1) ball Bˉ((fmx)0,l), so it is convex by [F4]; hence it contains all vertices of fmx and, by induction, all vertices of fkx for k≥m, since each next iterate has as vertices midpoints of pairs of vertices of the previous one. Therefore d((fkx)i,(flx)i)≤Lm for all k,l≥m and all i, so (fkx) is Cauchy in the compact metric space Xn and converges to some z∈Xn ([F8], [F11]); taking limits in d(zi,zj)≤Lm for arbitrary m and using Lm→0 shows that z is constant and the diameters of the iterates tend to 0. Since L is continuous by step 1.3, L(fkx)→L(z)=0. Conversely, if fkx→z with z constant, then L(fkx)→L(z)=0 by continuity of L, so x∈Ch0(n).

4.1step 1.2step 2.2step 3.1F1F4algebra

Degenerate and zero-length cases. If E(x)=0 then every ξi=0, so all consecutive vertices of x coincide and x is constant; then fx=x by the convention of [F1], and (ii) and (iii) hold for it. If some consecutive vertices of x coincide while x is not constant, the corresponding edge contributes 0 to mesh, L and E, the midpoint of a degenerate pair is the point itself by [F1], and the proofs of steps 1.2, 2.2 and 3.1 go through verbatim: if a half-edge vanishes the model midline estimate reduces to the immediate bound, and a collapsed comparison triangle is the limiting case of degenerate comparison triangles, in which the cosine-rule identity and the CAT(1) inequality remain valid by continuity; the equality case then includes the possibility that a midpoint coincides with a vertex, and the straightness conclusion is unchanged.

4.2step 1.1step 1.3step 2.1step 2.2step 3.1step 3.2F1F2F6F9F12F14algebra

The eventually-short set is the basin and is open. Write U={x∈Ph(n):L(fmx)<l/2 for some m}. For x∈U, put y=fmx, c=y0 with L(y)<l/2. Its vertices lie in the convex CAT(1) ball B0=Bˉ(c,l/4), so all later vertices do too. For ε>0 the set Kε={z∈Ph(n):zi∈B0 for every i, E(z)≥ε} is compact. If nonempty, the continuous deficit D(z)=E(z)−E(fz) is strictly positive there: equality would give a nonconstant closed local geodesic by step 3.1; every edge remains in B0 by convexity, so the entire curve would be a closed local geodesic in the CAT(1) space B0, contradicting [F2] since diam⁡B0≤l/2<π. Thus D has a positive minimum on nonempty Kε, and the nonnegative energy of fky must eventually fall below ε. If Kε is empty, it is already below ε. Hence E(fky)→0 and L(fky)→0 by L2≤nE. This proves U⊆Ch0(n); the reverse inclusion follows from L(fkx)→0. Finally U is the union of the open sets {L∘fm<l/2}, since f and L are continuous.

5.1step 1.1step 1.3step 2.1step 2.2step 3.1step 3.2step 4.1step 4.2F1∎

Conclusion. Clause (i) is step 1.1 for the radius, step 2.2 for the self-map, step 2.1 for compactness and step 1.3 for continuity; clause (ii) is step 2.2; clause (iii) is step 3.1; clause (iv) is step 4.2; clause (v) is step 3.2 together with step 4.2 for the identification of U with the basin; clause (vi) is step 4.1. This proves all assertions.

Depends on

Used by

Cited to discharge well-definedness by Uniform local radii, cyclic small-mesh polygons, mesh, length, energy, the midpoint operation and the zero-limit basin.

Dependency tree · two levels

116 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