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 , let be for and for , and let be four distinct points of ; if assume . Suppose and lie on opposite sides of the geodesic line through and . Let and be the angles of the triangles and at and . If , then
(1) ;
(2) if is a triangle with vertices such that , and , and satisfies , then the angle of at , the angle of at and the distance satisfy , and ; equality in any one of the three assertions implies the others and holds if and only if .
(ii) Gluing Lemma for triangles. Let be a metric space in which every pair of points at distance is joined by a geodesic, and let be a geodesic triangle in of perimeter with distinct vertices. Let with , let be a geodesic, and put and . If for every defined vertex angle of a comparison triangle in is no smaller than the corresponding angle of , 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 be a metric space of curvature , let with , , and , let be a geodesic from to , and let , , be geodesics from to depending continuously on with and . Then the vertex angles of the triangle are no greater than the corresponding angles of any comparison triangle in . The same conclusion holds for a finite subdivision obtained by successive applications of (ii), provided each intermediate union is a geodesic triangle of perimeter 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 with the same initial point, their upper angles satisfy .
Facts & Assumptions
Given: The models and 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 as described there, together with the triangles, points and geodesics named in the Statement.
In and in the geodesics are the straight segments and the minimal great-circle arcs, the distance in is the round distance, and , (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles, Euclidean spheres and closed balls as subspaces of , as the set of functions , and , , are metrics on it).
The angle of a model triangle is the comparison angle of its three side lengths: for sides , and meeting at , in the angle at has , and in , when , it has ; in both models, for fixed the map and the inverse map 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).
Comparison triangles in and exist and are unique up to isometry for every triple of nonnegative side lengths satisfying the triangle inequalities, with the additional perimeter bound in ; a triangle of the model is a comparison triangle for itself; and for fixed two positive sides (both in ) 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).
is a metric space and satisfies the triangle inequality, and a geodesic segment is distance preserving with (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Geodesics and geodesic metric spaces).
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.
The square is compact (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line); every open cover of it has a Lebesgue number (Every open cover of a compact metric space has a Lebesgue number: a such that every nonempty subset of diameter less than lies inside a single member of the cover). Continuity pulls a cover by local CAT charts back to an open cover of the square (Continuity of a map between metric spaces, at a point and globally, in the - form); every point of a space of curvature has a neighbourhood, with the induced metric, that is CAT() (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles).
Proof
Spherical size and orientation. The model comparison angles agree with geometric angles: on the sphere, the unit tangent towards at is , whose dot product with the analogous tangent towards is exactly the cosine formula in [F2]; the Euclidean assertion is the corresponding dot-product formula. Write , , , , and . For , gives , since ; every boundary edge is also , since its complementary path has length at least that edge. The polygonal loop lies in an open hemisphere: take points dividing its arclength into halves of length ; every point on either half satisfies , hence . In that hemisphere the projection , with , maps minor great-circle arcs to straight segments and preserves the side of each line and whether an interior angle is reflex. Because are on opposite sides of , the projected quadrilateral is simple. Its angles at are convex, and its angle at is reflex or straight because . Triangulating along shows that its angle at is convex and that lies in the closed triangle ; the same conclusions hold before projection. Thus . Moreover : otherwise , so , and (the original open hemisphere excludes antipodal ). A hemisphere contains the minor geodesic segments joining its points, since their unit vectors are normalized positive linear combinations; hence the hemisphere with pole contains the spherical triangle and , giving , equivalently , a contradiction. In the Euclidean case the same planar quadrilateral argument gives , and there is no size restriction.
A monotonicity lemma for a marked point. Let be a triangle in with , (with when ), , and angle at ; let satisfy with . Then is a strictly increasing function of : it is the third side of the model triangle with sides and meeting at the angle , so the claim is the strict monotonicity in the included angle from [F2], applied with the fixed positive sides . Consequently, if is a second such triangle with , , , and marked point with , having angle at , then by the strict monotonicity of the angle in the opposite side from [F2] (fixed sides ), hence .
Reduction to an interior splitting point in (ii). If or then one of 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 , which makes all six side lengths of positive, since and the vertices of are distinct.
Local CAT angle comparison. For two unit-speed spherical rays meeting at angle , let their points at distances with have distance , and put . The cosine rule and addition formulas give . Factoring the left side yields . With for and , it follows that ; when , both sides are zero. Since , The limit of sin x divided by x at zero is one makes the ratio tend uniformly to as , with no restriction on . The Euclidean comparison cosine thus tends to . 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.
Local triangles for (iii). Apply a finite cover and the Lebesgue-number property of the compact square to the continuous map . Choose partitions so that the image of each closed small rectangle is contained in a CAT() ball of radius when , 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 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 , and the joining geodesics chosen there are ambient geodesics. Put and . For each strip take the triangle and, for , the two triangles and , choosing the horizontal and diagonal edges within the corresponding ball. Each of these 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 and the same limiting inequalities apply.
Straightening construction. Extend the segment beyond by length to . Step 1.1 gives in the spherical case, so this extension remains a minimal arc; in both models , , and .
Perimeter bounds. The perimeter of each of is at most the perimeter of , which is , so the comparison triangles exist by [F3]; moreover and by the reverse triangle inequality applied to the two ends of , so and ; in particular and , and the four boundary distances in (i) sum to the perimeter of , , as required.
Angle triangle inequality and the splitting point. For three geodesics issuing from , write for the upper angles between the first and middle, and middle and last. If their angle triangle inequality is automatic. Otherwise take , with . For sufficiently short endpoints at distances on the first and last geodesics, use the point at distance on the middle geodesic. This tends uniformly to zero with , and the definition of upper angle bounds the two distances to that point by the Euclidean sides for included angles . In the Euclidean triangle formed by rays at angles to their middle ray, that value of is the intersection of the middle ray with the side joining the endpoints; hence the sum of those two bounds is . The metric triangle inequality and the law of cosines show that the comparison angle between the first and last endpoints is at most . Taking the defining upper limit and then , proves the angle triangle inequality. At , the first and last segments are the opposite halves of , of angle , so the angles of there sum to at least ; their comparison angles therefore also sum to at least . At the same triangle inequality bounds the angle of by the sum of the two subtriangle angles.
The comparison step. In both models is the distance determined by the two sides and and the included angle at , while is determined by the same two sides and the included angle ; since gives , the strict monotonicity of the third side in the included angle from [F2] yields , with equality if and only if .
Proof of (1). By the triangle inequality and step 2.2, , and step 3.1 (together with ) gives , which is (1).
Proof of (2): the distance assertion. Let be as in the Statement and put . The triangle of steps 2.2 and 1.2 has , , , and its marked point has ; the triangle has , , , and its marked point has . Both satisfy the hypotheses of step 1.2 with the same and , the second with the larger opposite side, so , with equality if and only if , that is, if and only if by step 3.1.
Proof of (2): the angle at . The triangles and have two side lengths in common, and , and their third sides are and ; 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 .
Proof of (2): the angle at . By step 1.1 the angle between and is in both models. The triangles and have the same two adjacent sides ; their opposite sides are and . Since , the law of cosines and its strict monotonicity give . Equality holds exactly when , equivalently , equivalently . Together with steps 4.2 and 5.1 this proves all three comparisons and simultaneous equality.
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 or , and no continuity of angles in the metric space is being assumed. Glue and along their common side so that and lie on opposite sides of the line through and , which is possible because comparison triangles are unique up to isometry [F3]. In the glued configuration the four points are distinct, the points lie on opposite sides of the line through and , the angles at 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 and then with and interchanged produces the comparison triangle of together with the point with , and clause (2) gives: the angles of at and at are at least the comparison angles of at ; the angle of at is at least the sum of those comparison angles at ; and , being the point at distance from on the side .
Conclusion of (ii). By step 7.1 the angles of the comparison triangle of at dominate the comparison angles of at those vertices, which dominate the angles of there by the hypothesis of (ii), and the angle of at dominates the sum of the comparison angles at , which dominates the angle of at ; hence every vertex angle of the comparison triangle is at least the corresponding angle of .
Assembling the strips. Starting with , glue along and then along . The splitting points are respectively and , so (ii) successively gives the angle comparisons for and . 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 . 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 ; 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
- Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles
- Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences
- Comparison angles of hinges, model triangle angles, and the Alexandrov upper angle
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Open ball, closed ball and sphere in a metric space
- Geodesics and geodesic metric spaces
- Continuity of a map between metric spaces, at a point and globally, in the $\varepsilon$-$\delta$ form
- Euclidean spheres and closed balls as subspaces of $\mathbb{R}^n$
- Principal inverse sine and inverse cosine
- The addition formulas for sine and cosine
- Signs, monotonicity intervals, and ranges of sine and cosine
- Pi is the first positive zero of sine
- The limit of sin x divided by x at zero is one
- $\mathbb{R}^n$ as the set of functions $n \to \mathbb{R}$, and $d_1$, $d_2$, $d_\infty$ are metrics on it
- Open cover, subcover, compact metric space, and compact subset of a metric space
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- Every open cover of a compact metric space has a Lebesgue number: a $\delta > 0$ such that every nonempty subset of diameter less than $\delta$ lies inside a single member of the cover
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
- Martin R. Bridson and André Haefliger, Metric Spaces of Non-Positive Curvature (Springer Grundlehren 319, 1999; author-hosted PDF) (standard reference, not scraped)
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (first-edition author manuscript, 2007-2008) (standard reference, not scraped)