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.

Alexandrov comparison: straightening a hinge, gluing comparison triangles, and patchwork

Statement

(i) Alexandrov's Lemma. Let κ∈{0,1}, let Mκ2 be E2 for κ=0 and S2 for κ=1, and let A,B,B′,C be four distinct points of Mκ2; if κ=1 assume d(C,B)+d(C,B′)+d(A,B)+d(A,B′)<2π. Suppose B and B′ lie on opposite sides of the geodesic line through A and C. Let α,β,γ and α′,β′,γ′ be the angles of the triangles Δ(A,B,C) and Δ(A,B′,C) at A,B,C and A,B′,C. If γ+γ′≥π, then

(1) d(B,C)+d(B′,C)≤d(B,A)+d(B′,A);

(2) if Δ′′ is a triangle with vertices Aˉ,Bˉ,Bˉ′ such that d(Aˉ,Bˉ)=d(A,B), d(Aˉ,Bˉ′)=d(A,B′) and d(Bˉ,Bˉ′)=d(B,C)+d(C,B′), and Cˉ∈[Bˉ,Bˉ′] satisfies d(Bˉ,Cˉ)=d(B,C), then the angle αˉ of Δ′′ at Aˉ, the angle βˉ′ of Δ′′ at Bˉ′ and the distance d(Aˉ,Cˉ) satisfy αˉ≥α+α′, βˉ′≥β′ and d(Aˉ,Cˉ)≥d(A,C); equality in any one of the three assertions implies the others and holds if and only if γ+γ′=π.

(ii) Gluing Lemma for triangles. Let X be a metric space in which every pair of points at distance <Dκ is joined by a geodesic, and let Δ=([q0,q1],[q1,p],[p,q0]) be a geodesic triangle in X of perimeter <2Dκ with distinct vertices. Let r∈[q0,q1] with r≠p, let [p,r] be a geodesic, and put Δ1=([q0,r],[r,p],[p,q0]) and Δ2=([p,r],[r,q1],[q1,p]). If for i=1,2 every defined vertex angle of a comparison triangle Δˉi in Mκ2 is no smaller than the corresponding angle of Δi, then the same is true for the angles of any comparison triangle for Δ (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles).

(iii) Patchwork. Let X be a metric space of curvature ≤κ, let p,q0,q1∈X with q0≠q1, p∉[q0,q1], and d(p,q0)+d(p,q1)+d(q0,q1)<2Dκ, let γ:[0,1]→X be a geodesic from q0 to q1, and let cs:[0,1]→X, s∈[0,1], be geodesics from p to γ(s) depending continuously on s with c0=[p,q0] and c1=[p,q1]. Then the vertex angles of the triangle Δ=([q0,q1],[q1,p],[p,q0]) are no greater than the corresponding angles of any comparison triangle in Mκ2. The same conclusion holds for a finite subdivision obtained by successive applications of (ii), provided each intermediate union is a geodesic triangle of perimeter <2Dκ and its common-side splitting point lies on the opposite geodesic side.

(iv) Upper-angle facts. For nonconstant geodesic segments with a common initial point, restricting either segment to any nonzero initial subsegment leaves their Alexandrov upper angle unchanged. The two opposite directions at an interior point of a geodesic have upper angle π. For any three nonconstant geodesic segments a,b,c with the same initial point, their upper angles satisfy ∠(a,c)≤∠(a,b)+∠(b,c).

Facts & Assumptions

Given: The models E2 and S2 with their metrics and geodesic lines, and the classes of geodesic triangles, as in Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles; the comparison angle of a length triple, the model angle of a model triangle, the Alexandrov upper angle between geodesics, and the angles of a geodesic triangle in a metric space, as in Comparison angles of hinges, model triangle angles, and the Alexandrov upper angle. In (ii) and (iii) a metric space X as described there, together with the triangles, points and geodesics named in the Statement.

[F1]

In E2 and in S2 the geodesics are the straight segments and the minimal great-circle arcs, the distance in S2 is the round distance, and D0=∞, D1=π (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles, Euclidean spheres and closed balls as subspaces of Rn, Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it).

[F2]

The angle of a model triangle is the comparison angle of its three side lengths: for sides b=d(O,P), c=d(O,Q) and a=d(P,Q) meeting at O, in E2 the angle θ at O has cos⁡θ=(b2+c2−a2)/(2bc), and in S2, when b,c,a∈(0,π), it has cos⁡θ=(cos⁡a−cos⁡bcos⁡c)/(sin⁡bsin⁡c); in both models, for fixed b,c>0 the map θ↦a and the inverse map a↦θ are strictly increasing (Comparison angles of hinges, model triangle angles, and the Alexandrov upper angle, Principal inverse sine and inverse cosine, Signs, monotonicity intervals, and ranges of sine and cosine, Pi is the first positive zero of sine). The sine and cosine addition formulas hold (The addition formulas for sine and cosine).

[F3]

Comparison triangles in E2 and S2 exist and are unique up to isometry for every triple of nonnegative side lengths satisfying the triangle inequalities, with the additional perimeter bound <2π in S2; a triangle of the model is a comparison triangle for itself; and for fixed two positive sides (both <π in S2) the third side is a strictly increasing function of the included angle, by the cosine formulas in [F2] (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences).

[F4]

(X,d) is a metric space and d satisfies the triangle inequality, and a geodesic segment γ:[0,ℓ]→X is distance preserving with ℓ=d(γ(0),γ(ℓ)) (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, Geodesics and geodesic metric spaces).

[F5]

Angles are the Alexandrov upper angles of Comparison angles of hinges, model triangle angles, and the Alexandrov upper angle. Restricting either geodesic to an initial nonzero subsegment preserves the angle because the defining infimum uses only arbitrarily short initial segments. Opposite halves of a geodesic have angle π directly from their distance sum. The triangle inequality for these angles is proved in step 2.4; no angle additivity in a general metric space is assumed.

[F7]

lim⁡u→0sin⁡u/u=1 (The limit of sin x divided by x at zero is one).

Proof

1.1F1F2F4algebragiven

Spherical size and orientation. The model comparison angles agree with geometric angles: on the sphere, the unit tangent towards V at U is (V−(U⋅V)U)/sin⁡d(U,V), whose dot product with the analogous tangent towards W is exactly the cosine formula in [F2]; the Euclidean assertion is the corresponding dot-product formula. Write u=d(C,B), y=d(C,B′), p=d(A,B), q=d(A,B′), x=d(A,C) and L=u+y+p+q. For κ=1, L<2π gives x<π, since 2x≤(u+p)+(y+q)=L; every boundary edge is also <π, since its complementary path has length at least that edge. The polygonal loop A,B,C,B′,A lies in an open hemisphere: take points P,Q dividing its arclength into halves of length L/2; every point Z on either half satisfies d(P,Z)+d(Q,Z)≤L/2<π, hence (P+Q)⋅Z=cos⁡d(P,Z)+cos⁡d(Q,Z)>0. In that hemisphere the projection Z↦Z/(h⋅Z), with h=(P+Q)/∥P+Q∥, maps minor great-circle arcs to straight segments and preserves the side of each line and whether an interior angle is reflex. Because B,B′ are on opposite sides of AC, the projected quadrilateral is simple. Its angles at B,B′ are convex, and its angle at C is reflex or straight because γ+γ′≥π. Triangulating along AC shows that its angle at A is convex and that C lies in the closed triangle ABB′; the same conclusions hold before projection. Thus α+α′≤π. Moreover u+y<π: otherwise p+q<π, so (B+B′)⋅A=cos⁡p+cos⁡q>0, and (B+B′)⋅B=(B+B′)⋅B′=1+B⋅B′>0 (the original open hemisphere excludes antipodal B,B′). A hemisphere contains the minor geodesic segments joining its points, since their unit vectors are normalized positive linear combinations; hence the hemisphere with pole B+B′ contains the spherical triangle ABB′ and C, giving cos⁡u+cos⁡y>0, equivalently u+y<π, a contradiction. In the Euclidean case the same planar quadrilateral argument gives α+α′≤π, and there is no size restriction.

1.2F2F3algebra

A monotonicity lemma for a marked point. Let V,W,U be a triangle in Mκ2 with ∣VW∣=s>0, ∣VU∣=p>0 (with s,p<π when κ=1), ∣WU∣=q, and angle θ at V; let C0∈[V,W] satisfy ∣VC0∣=u with 0<u<s. Then ∣UC0∣ is a strictly increasing function of θ∈[0,π]: it is the third side of the model triangle with sides p and u meeting at the angle θ, so the claim is the strict monotonicity in the included angle from [F2], applied with the fixed positive sides p,u. Consequently, if V′W′U′ is a second such triangle with ∣V′W′∣=s, ∣V′U′∣=p, ∣W′U′∣=q′≤q, and marked point C0′∈[V′W′] with ∣V′C0′∣=u, having angle θ′ at V′, then θ′≤θ by the strict monotonicity of the angle in the opposite side from [F2] (fixed sides p,s), hence ∣U′C0′∣≤∣UC0∣.

1.3F4given

Reduction to an interior splitting point in (ii). If r=q0 or r=q1 then one of Δ1,Δ2 has a repeated vertex, its comparison triangle degenerates to a segment, the hypothesis for that index is vacuous, and the claim reduces to the hypothesis for the other index; so assume r∈(q0,q1), which makes all six side lengths of Δ1,Δ2 positive, since r≠p and the vertices of Δ are distinct.

1.4F2F3F5F7algebra

Local CAT angle comparison. For two unit-speed spherical rays meeting at angle θ, let their points at distances s,t>0 with s+t<π have distance D, and put h=∣s−t∣. The cosine rule and addition formulas give 4sin⁡2(D/2)−4sin⁡2(h/2)=2sin⁡ssin⁡t(1−cos⁡θ). Factoring the left side yields 4sin⁡((D+h)/2)sin⁡((D−h)/2). With sinc⁡(u)=sin⁡u/u for u≠0 and sinc⁡(0)=1, it follows that (D2−h2)/(2st)=(1−cos⁡θ)sinc⁡(s)sinc⁡(t)/(sinc⁡((D+h)/2)sinc⁡((D−h)/2)); when D=h, both sides are zero. Since h≤D≤s+t, The limit of sin x divided by x at zero is one makes the ratio tend uniformly to 1 as max⁡(s,t)→0, with no restriction on s/t. The Euclidean comparison cosine 1−(D2−h2)/(2st) thus tends to cos⁡θ. In a CAT(1) triangle, CAT comparison bounds distances of arbitrarily short initial side points by these spherical model distances, hence bounds their Euclidean comparison angles by the model Euclidean angles. Taking the defining upper limit proves that each actual upper angle is at most its spherical model angle. The Euclidean case is the same cosine argument with the model angle constant.

2.1step 1.4F2F3F4F5F6construct

Local triangles for (iii). Apply a finite cover and the Lebesgue-number property of the compact square to the continuous map c(s,t)=cs(t). Choose partitions si,tj so that the image of each closed small rectangle is contained in a CAT(κ) ball Uij of radius <Dκ/4 when κ=1, with its closure inside the corresponding local CAT chart. Such balls are geodesically convex: their intrinsic short geodesics are ambient minimizing segments, and distance from the center is convex in the Euclidean case and balls of radius <π/2 are convex in the spherical case by comparison with the convex model ball [F3]. Thus all restrictions of the radial geodesics and the last-row base segments remain in Uij, and the joining geodesics chosen there are ambient geodesics. Put Lj=csi−1(tj) and Rj=csi(tj). For each strip take the triangle (p,L1,R1) and, for 1≤j<n, the two triangles (Lj,Rj,Rj+1) and (Lj,Lj+1,Rj+1), choosing the horizontal and diagonal edges within the corresponding ball. Each of these 2n−1 triangles lies in its local CAT ball and has comparison angles dominating its angles: apply the CAT inequality to arbitrarily short initial side points and take the upper-angle definition; the required uniform two-variable model-angle limit is established in step 1.4. In the Euclidean case the comparison angle is constant on short initial subsegments; in the spherical case that limit transfers the same bound to the Euclidean upper-angle convention. Coincident vertices contribute no angle obligation; collinear comparison triangles have angles 0,0,π and the same limiting inequalities apply.

2.2step 1.1F1F2construct

Straightening construction. Extend the segment [B,C] beyond C by length y to B1′. Step 1.1 gives u+y<π in the spherical case, so this extension remains a minimal arc; in both models C∈[B,B1′], d(B,B1′)=u+y, and ∠ACB1′=π−γ.

2.3step 1.3F3F4algebra

Perimeter bounds. The perimeter of each of Δ1,Δ2 is at most the perimeter of Δ, which is <2Dκ, so the comparison triangles Δˉ1,Δˉ2 exist by [F3]; moreover 2d(q0,q1)≤d(q0,q1)+d(q1,p)+d(p,q0) and 2d(p,r)≤d(p,q0)+d(p,q1)+d(q0,q1) by the reverse triangle inequality applied to the two ends of [q0,q1], so d(q0,q1)<Dκ and d(p,r)<Dκ; in particular d(rˉ,qˉ0)+d(rˉ,qˉ1)=d(q0,q1)<Dκ and d(pˉ,rˉ)=d(p,r)<Dκ, and the four boundary distances in (i) sum to the perimeter of Δ, <2Dκ, as required.

2.4step 1.3F2F4F5algebragiven

Angle triangle inequality and the splitting point. For three geodesics issuing from O, write a,b for the upper angles between the first and middle, and middle and last. If a+b≥π their angle triangle inequality is automatic. Otherwise take a0>a, b0>b with a0+b0<π. For sufficiently short endpoints at distances s,t on the first and last geodesics, use the point at distance v=stsin⁡(a0+b0)/(ssin⁡a0+tsin⁡b0) on the middle geodesic. This tends uniformly to zero with max⁡(s,t), and the definition of upper angle bounds the two distances to that point by the Euclidean sides for included angles a0,b0. In the Euclidean triangle formed by rays at angles a0,b0 to their middle ray, that value of v is the intersection of the middle ray with the side joining the endpoints; hence the sum of those two bounds is s2+t2−2stcos⁡(a0+b0). The metric triangle inequality and the law of cosines show that the comparison angle between the first and last endpoints is at most a0+b0. Taking the defining upper limit and then a0↓a, b0↓b proves the angle triangle inequality. At r, the first and last segments are the opposite halves of [q0,q1], of angle π, so the angles of Δ1,Δ2 there sum to at least π; their comparison angles therefore also sum to at least π. At p the same triangle inequality bounds the angle of Δ by the sum of the two subtriangle angles.

3.1step 2.2F2F3algebra

The comparison step. In both models d(A,B1′) is the distance determined by the two sides x=d(A,C) and y=d(C,B1′) and the included angle ∠ACB1′=π−γ at C, while d(A,B′) is determined by the same two sides and the included angle γ′=∠ACB′; since γ+γ′≥π gives π−γ≤γ′, the strict monotonicity of the third side in the included angle from [F2] yields d(A,B1′)≤d(A,B′)=q, with equality if and only if γ+γ′=π.

4.1step 2.2step 3.1F4

Proof of (1). By the triangle inequality and step 2.2, d(B,A)+d(A,B1′)≥d(B,B1′)=u+y, and step 3.1 (together with d(B,A)=p) gives d(B,A)+d(B′,A)≥d(B,A)+d(A,B1′)≥d(B,C)+d(C,B′), which is (1).

4.2step 2.2step 3.1step 1.2algebra

Proof of (2): the distance assertion. Let Δ′′ be as in the Statement and put x′′:=d(Aˉ,Cˉ). The triangle (A,B,B1′) of steps 2.2 and 1.2 has ∣AB∣=p, ∣BB1′∣=u+y, ∣AB1′∣=d(A,B1′)≤q, and its marked point C∈[B,B1′] has ∣BC∣=u; the triangle (Bˉ,Bˉ′,Aˉ) has ∣BˉBˉ′∣=u+y, ∣BˉAˉ∣=p, ∣Bˉ′Aˉ∣=q, and its marked point Cˉ∈[Bˉ,Bˉ′] has ∣BˉCˉ∣=u. Both satisfy the hypotheses of step 1.2 with the same s=u+y and p, the second with the larger opposite side, so d(Aˉ,Cˉ)≥d(A,C)=x, with equality if and only if d(A,B1′)=q, that is, if and only if γ+γ′=π by step 3.1.

5.1step 4.2F2algebra

Proof of (2): the angle at Bˉ′. The triangles (Aˉ,Cˉ,Bˉ′) and (A,C,B′) have two side lengths in common, y=d(Cˉ,Bˉ′)=d(C,B′) and q=d(Aˉ,Bˉ′)=d(A,B′), and their third sides are x′′ and x; the angles βˉ′ and β′ lie opposite those third sides, so the strict monotonicity of the angle in the opposite side from [F2] gives βˉ′≥β′, with strict inequality exactly when x′′>x.

6.1step 1.1step 4.2step 5.1F2F4algebra

Proof of (2): the angle at Aˉ. By step 1.1 the angle between AB and AB′ is α+α′≤π in both models. The triangles (A,B,B′) and Δ′′ have the same two adjacent sides p,q; their opposite sides are d(B,B′) and s=u+y. Since d(B,B′)≤s, the law of cosines and its strict monotonicity give αˉ≥α+α′. Equality holds exactly when d(B,B′)=u+y, equivalently C∈[B,B′], equivalently γ+γ′=π. Together with steps 4.2 and 5.1 this proves all three comparisons and simultaneous equality.

7.1step 2.3step 2.4step 4.2step 5.1step 6.1F3algebra

Gluing and straightening. If one comparison triangle is collinear, use the closed cosine inequalities of (i), obtained from noncollinear model triangles by continuity of their side-length formulas; these inequalities remain valid when an included angle is 0 or π, and no continuity of angles in the metric space is being assumed. Glue Δˉ1 and Δˉ2 along their common side [pˉ,rˉ] so that qˉ0 and qˉ1 lie on opposite sides of the line through pˉ and rˉ, which is possible because comparison triangles are unique up to isometry [F3]. In the glued configuration the four points pˉ,rˉ,qˉ0,qˉ1 are distinct, the points qˉ0,qˉ1 lie on opposite sides of the line through pˉ and rˉ, the angles at rˉ sum to at least π by step 2.4, and the spherical perimeter hypothesis of clause (i) holds by step 2.3. Applying clause (i), whose clause (2) is established in steps 4.2, 5.1 and 6.1, with (A,C,B,B′)=(pˉ,rˉ,qˉ0,qˉ1) and then with qˉ0 and qˉ1 interchanged produces the comparison triangle Δ′′=Δ(pˉ,qˉ0,qˉ1) of Δ together with the point Cˉ∈[qˉ0,qˉ1] with d(qˉ0,Cˉ)=d(q0,r), and clause (2) gives: the angles of Δ′′ at qˉ0 and at qˉ1 are at least the comparison angles of Δˉ1,Δˉ2 at qˉ0,qˉ1; the angle of Δ′′ at pˉ is at least the sum of those comparison angles at pˉ; and d(pˉ,Cˉ)≥d(p,r), Cˉ being the point at distance d(q0,r) from qˉ0 on the side [qˉ0,qˉ1].

8.1step 7.1step 2.4given

Conclusion of (ii). By step 7.1 the angles of the comparison triangle Δ′′ of Δ at qˉ0,qˉ1 dominate the comparison angles of Δˉ1,Δˉ2 at those vertices, which dominate the angles of Δ1,Δ2 there by the hypothesis of (ii), and the angle of Δ′′ at pˉ dominates the sum of the comparison angles at pˉ, which dominates the angle of Δ at p; hence every vertex angle of the comparison triangle Δ′′ is at least the corresponding angle of Δ.

9.1step 2.1step 2.4step 8.1F2F3F4algebra∎

Assembling the strips. Starting with (p,L1,R1), glue (Lj,Rj,Rj+1) along LjRj and then (Lj,Lj+1,Rj+1) along LjRj+1. The splitting points are respectively Rj∈[p,Rj+1] and Lj∈[p,Lj+1], so (ii) successively gives the angle comparisons for (p,Lj,Rj+1) and (p,Lj+1,Rj+1). The perimeter of each such intermediate triangle is at most the full strip perimeter: bound its cross side by the remaining lengths on its two radial sides plus its final base side. The full strip perimeter is at most that of Δ, by bounding both radial endpoint distances through the appropriate endpoints of the base. Thus every application has perimeter <2Dκ. Repeated or collinear triangles are removed or treated with the degenerate comparisons just described, and the same cosine inequalities extend to degenerate model triangles by continuity of the side-length formulas. Finally join the strips successively along [p,γ(si)]; now the splitting point is on the geodesic base and again each intermediate perimeter is at most the perimeter of Δ. This proves (iii), and the last sentence follows by the same finite induction whenever its stated intermediate-triangle conditions hold.

Remarks

The spherical four-distance bound of Bridson–Haefliger I.2.16 is essential to the orientation argument: step 1.1 proves that it implies both the short straightening arc and α+α′≤π. Patchwork requires the total perimeter bound of II.4.11, rather than three separate side bounds. The choices in the proof are finite; no Axiom of Choice is used.

Depends on

Used by

Dependency tree · two levels

92 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