Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Toponogov triangle comparison

Statement

Assume the inherited Axiom of Countable Choice ACω. Let (M,g) be a complete, connected, boundaryless Riemannian manifold of dimension n≥2 whose sectional curvature satisfies K≥k at every tangent two-plane, where k∈R. Let x,y,z∈M be three points joined by minimizing geodesic segments, write a:=dg(y,z),b:=dg(z,x),c:=dg(x,y) and suppose these three side lengths are positive and admit a comparison triangle in the two-dimensional space form Mk2 of constant sectional curvature k, in the sense of Comparison triangle in the two dimensional space form: the strict triangle inequalities hold, and when k>0 also a,b,c<πk,a+b+c<2πk. Let α,β,γ∈[0,π] be the angles of the actual triangle at x,y,z between the two minimizing sides meeting there, and let αˉ,βˉ,γˉ∈(0,π) be the corresponding comparison angles of a comparison triangle with side lengths (a,b,c). Then every actual vertex angle is at least its comparison angle: α≥αˉ,β≥βˉ,γ≥γˉ. Thus a curvature lower bound makes fixed-side triangles fatter than the constant-k model triangle. No compactness of M is assumed; the degenerate case in which a side length is zero or a strict triangle inequality fails is excluded by the admissibility of the comparison triangle, and for k>0 the endpoint values a,b,c=π/k and a+b+c=2π/k are likewise excluded. No choice beyond the inherited ACω is used.

Facts & Assumptions

Given: The inherited ACω of [A1]; a complete, connected, boundaryless Riemannian n-manifold (M,g), n≥2, with K≥k everywhere; three points x,y,z∈M together with minimizing geodesic segments joining them; the side lengths a,b,c>0 and the angles α,β,γ at the vertices; and the hypothesis that (a,b,c) admits a comparison triangle in Mk2 with angles αˉ,βˉ,γˉ.

[A1]

The countable-choice premise is the inherited ACω (The Axiom of Countable Choice (ACω)), carried by the hinge comparison and the comparison-triangle interface cited below; no further family is selected.

[F1]

Comparison triangles and their angles (Comparison triangle in the two dimensional space form, Constant sectional curvature and space form, Pointwise norm and angle from a riemannian metric): Mk2 is the complete, simply connected surface of constant sectional curvature k; a comparison triangle with side lengths (a,b,c) exists, and is unique up to isometries of Mk2, exactly when a,b,c>0 satisfy the strict triangle inequalities and, for k>0, a,b,c<π/k and a+b+c<2π/k; when k≤0 no upper restriction is imposed. Its angle at the vertex opposite the side a, between the sides b and c, is the unique αˉ∈(0,π) given by the model cosine law αˉ=Φb,c(a), where ΦA,B(C):=arccos⁡FA,B(C),FA,B(C):={cos⁡(k C)−cos⁡(k A)cos⁡(k B)sin⁡(k A)sin⁡(k B),k>0,A2+B2−C22AB,k=0,cosh⁡(−k A)cosh⁡(−k B)−cosh⁡(−k C)sinh⁡(−k A)sinh⁡(−k B),k<0, with the other two angles obtained by cycling the sides. The angle at a vertex of a triangle in (M,g) is defined by cos⁡α=gx(u,v) for the unit tangent vectors of the two minimizing sides from that vertex, so α∈[0,π].

[F2]

Hinge comparison and the model opposite side (Toponogov hinge comparison): let N be complete, connected and boundaryless of dimension ≥2 with sectional curvature ≥k, let σ1,σ2 be unit-speed minimizing geodesics from a common point with lengths A,B>0, let θ∈[0,π] be their included angle and let C be the distance between their endpoints. If k>0 assume A,B,C<π/k and A+B+C<2π/k. Then C≤ck(A,B,θ), where ck(A,B,θ) is the distance in Mk2 between the endpoints of unit-speed geodesics of lengths A and B issuing from one point with included angle θ; this number is independent of the choices made. For fixed A,B>0 (with A,B<π/k when k>0) the same item establishes that ck(A,B,⋅) is continuous and strictly increasing on [0,π], that it is the inverse of the comparison-angle function on the admissible interval: ck(A,B,ΦA,B(C))=Cfor ∣A−B∣<C<m(A,B), where m(A,B):=min⁡{A+B, 2π/k−A−B} for k>0 and m(A,B):=A+B for k≤0, and that its endpoint values are ck(A,B,0)=∣A−B∣,ck(A,B,π)=m(A,B).

[F3]

First variation of a hinge: for a unit-speed minimizing geodesic to a point off the cut locus and a unit-speed geodesic leaving that endpoint, the one-sided derivative of the distance to the starting point is g(γ˙(0),σ˙(ρ))=−cos⁡Θ, the cosine of the angle at the endpoint. This is the first-variation input used by the hinge comparison [F2] in the direction of the model hinge; it is recorded here to fix the conventions, and the triangle argument below uses the hinge comparison only through its stated inequality.

Proof

technique · direct: at each vertex apply the hinge comparison to the two minimizing sides, whose endpoint distance is the opposite side; the comparison angle is the model angle of the same three side lengths, so the side inequality passes to the angles because the model opposite side is a strictly increasing function of the included angle. Zero angles are excluded by the endpoint value of the model side and the strict triangle inequalities
1.1F1given

Setup and comparison data. [F1, given] Let γxy,γxz,γyz be the minimizing geodesic segments of the triangle, so that c=dg(x,y), b=dg(z,x) and a=dg(y,z) are the lengths of the three sides, all positive. The angles α,β,γ∈[0,π] are defined at x,y,z by the metric, and for k>0 the side lengths satisfy a,b,c<π/k and a+b+c<2π/k by the admissibility hypothesis. By [F1] a comparison triangle with side lengths (a,b,c) exists in Mk2, is unique up to isometry, and has angles αˉ,βˉ,γˉ∈(0,π) given by the model cosine law: αˉ=Φb,c(a),βˉ=Φc,a(b),γˉ=Φa,b(c). The strict triangle inequalities give ∣b−c∣<a<b+c and its cyclic permutations, and for k>0 the perimeter bound gives a<2π/k−b−c; with the notation m of [F2] this says that the opposite side lies in the admissible interval of its two legs, for instance a∈(∣b−c∣, m(b,c)).

2.1F1F2step 1.1given

The angle at x. [F1, F2, step 1.1, given] The sides from x to y and from x to z are unit-speed minimizing geodesics of lengths c and b with included angle α, and the distance between their endpoints is a. Suppose first that α=0. Then the hinge comparison [F2] applies with legs of lengths b,c, included angle 0 and opposite side a, giving a≤ck(b,c,0)=∣b−c∣ by the endpoint value of [F2], contradicting the strict triangle inequality ∣b−c∣<a from step 1.1. Hence α∈(0,π], and applying [F2] at this angle gives a≤ck(b,c,α). On the other hand step 1.1 gives αˉ=Φb,c(a) with a∈(∣b−c∣,m(b,c)), so the inverse identity of [F2] gives ck(b,c,αˉ)=ck(b,c,Φb,c(a))=a. Combining the two displays, ck(b,c,αˉ)≤ck(b,c,α); since αˉ∈(0,π), α∈(0,π] and ck(b,c,⋅) is strictly increasing on [0,π] by [F2], it follows that αˉ≤α.

2.2F1F2step 1.1given

The angle at y. [F1, F2, step 1.1, given] The same argument at the vertex y applies [F2] to the minimizing sides from y to z and from y to x, of lengths a and c, whose included angle is β and whose endpoint distance is b. If β=0, the endpoint value gives b≤∣a−c∣, contradicting ∣a−c∣<b from step 1.1; hence β∈(0,π], the hinge gives b≤ck(a,c,β), and b=ck(a,c,βˉ) by step 1.1 and the inverse identity of [F2]. Strict increase of ck(a,c,⋅) on [0,π] gives βˉ≤β.

2.3F1F2step 1.1given

The angle at z. [F1, F2, step 1.1, given] Likewise, at z the minimizing sides to x and y have lengths b and a, included angle γ and endpoint distance c; if γ=0 then c≤∣a−b∣, contradicting ∣a−b∣<c from step 1.1, so γ∈(0,π]; the hinge comparison gives c≤ck(a,b,γ), while c=ck(a,b,γˉ) by step 1.1 and [F2], and strict increase of ck(a,b,⋅) on [0,π] gives γˉ≤γ.

3.1F1F2step 1.1step 2.1step 2.2step 2.3given∎

Conclusion and boundary cases. [F1, F2, step 1.1, step 2.1, step 2.2, step 2.3, given] Steps 2.1, 2.2 and 2.3 prove αˉ≤α, βˉ≤β and γˉ≤γ: every actual vertex angle is at least its comparison angle, so fixed-side triangles of a manifold with K≥k are at least as fat as their constant-k model triangles. The boundary cases are accounted for: a zero side length is excluded by the positivity requirement of the comparison-triangle definition, so the three vertices are distinct and the angles are defined; a zero vertex angle is impossible, as shown at each vertex via the endpoint value ck(⋅,⋅,0)=∣A−B∣ and the strict triangle inequalities; an angle equal to π is allowed and is covered, because the hinge comparison is stated for θ∈[0,π] and ck(⋅,⋅,⋅) is strictly increasing on the closed interval [0,π], with αˉ,βˉ,γˉ∈(0,π); and for k>0 the endpoint configurations a,b,c=π/k and a+b+c=2π/k, where the comparison triangle would degenerate, are excluded by the admissibility hypothesis. The argument uses no choice of comparison triangle: its angles are determined by the side lengths through the model cosine law of [F1], and the model side function ck(A,B,θ) is independent of the choices in its construction by [F2]; the only choice principle used is the inherited ACω of [A1], carried by the hinge comparison and the comparison-triangle interface.

Source locator

Eschenburg §6, pp.21–25, proves Toponogov hinge comparison and derives the triangle angle comparison by comparing the model opposite side with the actual side at each vertex. Lang, Riemannian and Metric Geometry, Chapter 5, Lemmas 5.1–5.2 and Theorem 5.15 (printed pp.64–70, PDF pp.67–73), records the model cosine law, monotonicity of the opposite side, and triangle comparison; Lemma 5.9 gives the corresponding side-point version proved separately on this page. The proof above applies the in-run hinge comparison at each vertex, transfers the side inequality to the angle inequality by the strict monotonicity of the model side, and disposes of zero angles with the endpoint value ck(A,B,0)=∣A−B∣.

Depends on

Used by

Dependency tree · two levels

44 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