Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

Midpoint iteration on a small equilateral spherical triangle contracts geometrically to its centre

Example

Assume the Axiom of Choice for the cited uniform decrement. Let S2 be the round unit sphere with the metric dS(x,y)=arccos⁡(x⋅y) (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences, Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles) and let 0<s<π/2. Let x=(x0,x1,x2) be the vertices of the equilateral spherical triangle of side s centred at the north pole; fix a uniform local radius of the page with s<l<π/2 and x∈Ph(3). Then:

(i) fx is again an equilateral triangle centred at the north pole, with side s1=arccos⁡(1+3cos⁡s2+2cos⁡s)<s, so L(fx)=3s1<3s=L(x), E(fx)=3s12<3s2=E(x) and mesh⁡(fx)=s1<s=mesh⁡(x) (Open ball, closed ball and sphere in a metric space).

(ii) Iterating, each fkx is equilateral with side sk given by sk+1=arccos⁡((1+3cos⁡sk)/(2+2cos⁡sk)), and sk↓0; hence x lies in the zero-limit basin Ch0(3), the iterates converge to the constant tuple at the north pole, and the drop agrees with Existence of the uniform radius, continuity of the midpoint operation, the energy drop, its equality case, and convergence of zero-limit polygons (ii) and The uniform energy decrement on the basin, bounded iteration, and the closedness of the basin inside the short polygon space (i).

(iii) The equality case Existence of the uniform radius, continuity of the midpoint operation, the energy drop, its equality case, and convergence of zero-limit polygons (iii) does not occur: E(fx)<E(x), and the deficit is strictly positive for every s>0.

Facts & Assumptions

Given: The round unit sphere S2 with its intrinsic metric; a real s with 0<s<π/2; the equilateral triangle centred at the north pole with vertices x0,x1,x2 at pairwise distance s.

[L1]

Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences: comparison triangles and the spherical cosine rule on S2, the midpoint identity cos⁡dS(x,a)=(cos⁡dS(x,y)+cos⁡dS(x,z))/(2cos⁡(dS(y,z)/2)), and the convexity of balls of radius <π/2.

Verification

technique · explicit spherical computation
1.1L1L3L4algebra

The actual midpoint side. Represent the vertices by unit vectors u0,u1,u2 with ui⋅uj=c:=cos⁡s∈(0,1) for i≠j. The midpoint of the short arc from ui to uj is (ui+uj)/2+2c. Two adjacent such midpoints have dot product (ui+uj)⋅(uj+uk)/(2+2c)=(1+3c)/(2+2c), so their spherical distance is s1=arccos⁡((1+3c)/(2+2c)). The rotational symmetry fixes the north pole and permutes these midpoints, so the midpoint triangle is equilateral with that same centre.

2.1step 1.1L3algebra

Strict contraction. For 0<c<1, the quotient u=(1+3c)/(2+2c) satisfies u<1 and u−c=(1−c)(1+2c)/(2+2c)>0. Thus 0<s1=arccos⁡u<arccos⁡c=s by [L3].

3.1step 1.1step 2.1L2algebra

The midpoint triangle is equilateral (i). The symmetry group of the equilateral triangle acts transitively on its vertices and fixes the centre N; the midpoint operation is equivariant under isometries of S2, so fx is again an equilateral triangle with centre N and side s1; hence L(fx)=3s1, E(fx)=3s12 and mesh⁡(fx)=s1, and step 2.1 gives the strict inequalities of (i).

4.1step 3.1L2L3L5algebra

The iteration contracts to zero (ii). By step 3.1 applied to each iterate, fkx is equilateral with side sk, where sk+1=arccos⁡((1+3cos⁡sk)/(2+2cos⁡sk)), and (sk) is strictly decreasing and bounded below by 0; hence it converges to some λ≥0 by A monotone sequence converges if and only if it is bounded, and continuity of the recursion ([L1], [L3]) gives c∞=(1+3c∞)/(2+2c∞) with c∞=cos⁡λ>0, so (c∞−1)(2c∞+1)=0 and c∞=1, hence λ=0. Moreover 1−cos⁡sk+1=(1−cos⁡sk)/(2+2cos⁡sk)≤(1−cos⁡sk)/2, so sin⁡(sk/2)≤2−k/2sin⁡(s0/2). Since sk≤s0<π/2, The limit of sin x divided by x at zero is one bounds u/sin⁡u near zero; away from zero its numerator is bounded and its denominator is bounded below by [L3]. Thus sk≤C2−k/2 for some C>0, establishing the geometric rate in the title. Therefore L(fkx)=3sk→0, so x∈Ch0(3) by the description of the basin [L2]. Moreover L(fkx)=3sk∈(0,2π) for every k, so the uniform decrement of [L5] applies to each iterate and gives E(fk+1x)≤E(fkx)−λ3(3sk), in agreement with the strict drop computed in step 3.1.

4.2step 3.1L2algebra

The equality case does not occur (iii). By step 3.1, E(fx)=3s12<3s2=E(x) for every s>0, so the tuple is neither constant nor equally spaced along a closed local geodesic; the deficit E(x)−E(fx) is strictly positive and the equality characterization of L2 does not apply.

5.1step 4.1L4algebra

Convergence to the constant tuple. The three vertex vectors have equal dot product with the north-pole vector N and sum to a positive multiple of N. Thus cos⁡2ρk=(1+2cos⁡sk)/3, by squaring their sum; since sk→0, ρk→0; hence the iterates converge uniformly to the constant tuple at the north pole.

6.1step 1.1step 3.1step 4.1step 5.1step 4.2∎

Conclusion. Clause (i) is steps 1.1, 2.1 and 3.1, clause (ii) is steps 4.1 and 5.1, and clause (iii) is step 4.2: the midpoint iteration on a small equilateral spherical triangle stays equilateral, contracts the side strictly, converges to the centre and realises a strict energy drop at every step.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

87 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