Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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 hinge comparison

Statement

Assume the inherited Axiom of Countable Choice ACω. Let (M,g) be a complete, connected, boundaryless Riemannian manifold of dimension n≥2 with sectional curvature ≥k at every tangent two-plane, where k∈R. Let σ1:[0,a]→M and σ2:[0,b]→M be unit-speed minimizing geodesics with the common initial point p:=σ1(0)=σ2(0) and a,b>0; put x:=σ1(a),y:=σ2(b), let θ∈[0,π] be the included angle at p, cos⁡θ=gp(σ1′(0),σ2′(0)), and put c:=dg(x,y). If k>0, assume moreover a,b,c<πk,a+b+c<2πk. Then c≤ck(a,b,θ), where ck(a,b,θ) is the opposite side of the constant-k model hinge: in the two-dimensional space form Mk2 of constant sectional curvature k choose a point pˉ and unit-speed geodesics of lengths a and b issuing from pˉ with included angle θ, and let ck(a,b,θ) be the distance in Mk2 between their endpoints. This number is independent of the choices made and is the value determined by the model cosine law recorded in Comparison triangle in the two dimensional space form; the proof below derives it as the inverse of the model comparison-angle function.

With the legs and the included angle fixed, the inequality says that a curvature lower bound forces the opposite side to be at most the model value: more curvature shortens the opposite side. Both legs are minimizing, of length a and b; the open unit-speed parametrization of the legs is the only regularity used; the degenerate case c=a+b forces θ=π, and the degenerate case c=∣a−b∣ is covered by the reverse triangle inequality. For k>0 the three bounds a,b,c<π/k and the perimeter bound, together with the strict triangle inequalities ∣a−b∣<c<a+b, ensure that the comparison triangle of side lengths (a,b,c) exists. The endpoint cases c=a+b and c=∣a−b∣ are treated separately in the proof.

Facts & Assumptions

Given: The inherited ACω of [A1]; the complete connected boundaryless Riemannian manifold (M,g) of dimension n≥2 with K≥k; the minimizing unit-speed legs σ1,σ2 with endpoints x,y and lengths a,b>0; the included angle θ∈[0,π]; and, when k>0, the bounds on a,b,c and the perimeter displayed in the statement.

[A1]

The countable-choice premise is the inherited ACω (The Axiom of Countable Choice (ACω)), carried through the Hopf–Rinow, exponential, cut-locus, comparison and continuity suppliers below; no further family is selected anywhere in the proof.

[F1]

Comparison triangles and the model cosine law (Comparison triangle in the two dimensional space form, Constant sectional curvature and space form): Mk2 is the complete, simply connected surface of constant sectional curvature k; it is the round sphere of radius 1/k when k>0, whose diameter is Dk:=π/k; the Euclidean plane when k=0; and a hyperbolic plane when k<0. A comparison triangle with side lengths (A,B,C) is a labelled triple of points of Mk2 together with the three minimizing geodesic segments joining them and realizing those distances; it exists, and is unique up to the isometries of Mk2, whenever A,B,C>0 satisfy the strict triangle inequalities and, in the case k>0, also A,B,C<Dk and A+B+C<2Dk; when k≤0 no upper restriction is imposed. The angle θˉ of such a triangle at the vertex opposite the side C is the comparison angle and is given by the model cosine law: when k>0, cos⁡θˉ=cos⁡(k C)−cos⁡(k A)cos⁡(k B)sin⁡(k A)sin⁡(k B), when k=0, cos⁡θˉ=(A2+B2−C2)/(2AB), and when k<0, cos⁡θˉ=cosh⁡(−k A)cosh⁡(−k B)−cosh⁡(−k C)sinh⁡(−k A)sinh⁡(−k B); the stated side hypotheses make the value lie in (−1,1), so θˉ∈(0,π) exists and is unique.

[F2]

Distance support inequality (Toponogov distance support inequality): let (N,h) be a complete connected boundaryless Riemannian manifold of dimension ≥2 with sectional curvature ≥k; let γ:[0,L]→N be a unit-speed minimizing geodesic; let o∈N; put a:=dh(o,γ(0)), b:=dh(o,γ(L)); suppose (L,b,a) are the ordered side lengths of a comparison triangle (oˉ,xˉ,yˉ) in Mk2 with side γˉ:[0,L]→Mk2 from xˉ to yˉ. Then dh(o,γ(t)) ≥ dk(oˉ,γˉ(t))(0≤t≤L).

[F3]

First variation of the distance to a hinge endpoint (First-variation hinge derivative formula): let N be a complete connected boundaryless Riemannian manifold, o,q∈N with q≠o and q not a cut point of o, let σ:[0,ρ]→N be the unit-speed minimizing geodesic from o to q, and let γ:[0,T]→N be a unit-speed geodesic with γ(0)=q. Then ddt∣0+dh(o,γ(t))=gq(γ˙(0),σ˙(ρ))=−cos⁡Θ, where Θ∈[0,π] is the angle at q between the two legs, cos⁡Θ:=−gq(σ˙(ρ),γ˙(0)). Part (a) of the same item gives L′(0)=g(V(L),u(L))−g(V(0),u(0)) for a smooth family of geodesics.

[F4]

Cut loci, minimizing segments and consequences (Cut point and cut locus of a point, Characterization of a cut point, Minimizing along a geodesic is an initial interval property, A geodesic does not minimize past its first conjugate point, Length minimizers are constant-speed geodesics up to reparametrization, Existence uniqueness and smooth dependence of geodesics, Hopf–Rinow theorem, Riemannian distance is a metric): on a complete connected boundaryless manifold, (i) every two points are joined by a minimizing geodesic; (ii) for a unit direction v at q the set Aq(v)={t≥0:d(q,γ(t))=t} is an initial interval, it contains [0,cq(v)] when the cut time is finite, and q′∈Cut⁡(q) iff q′=γv(cq(v)) for some unit v; (iii) q′∈Cut⁡(q) iff either q,q′ are conjugate along a minimizing geodesic joining them, or two distinct minimizing geodesics join them; conversely each of these two alternatives forces the cut time in the relevant direction to be at most the time of occurrence; (iv) a nonconstant minimizing piecewise smooth curve has a unit-speed geodesic arclength representative; any two nonzero one-sided velocities at a breakpoint are positive multiples of the same tangent vector. In particular, concatenated unit-speed pieces have equal one-sided velocities; (v) two geodesics with the same initial point and velocity coincide; (vi) the Riemannian distance is a metric, so the triangle inequality and the reverse triangle inequality hold.

[F5]

Geometry of the model space forms (Round sphere model geometry, Cartan hadamard, Simply connected complete nonpositively curved manifolds have unique geodesics between points, No conjugate points under nonpositive sectional curvature): for k>0 the model Mk2 is the round sphere of radius 1/k: for every point q and every unit direction v the cut time is Dk=π/k and Cut⁡(q)={−q}, the antipode; the antipodal map is an involution. For k≤0 the model is complete, simply connected and has K=k≤0, so exp⁡pˉ is a diffeomorphism and every two points are joined by exactly one minimizing geodesic; in particular no point of the model is a cut point of another, and every radial geodesic minimizes on all of R.

[F6]

Elementary identities and continuity (The addition formulas for sine and cosine, Parity and the Pythagorean identity for sine and cosine, Quarter-turn values and shifts by pi/2 and pi, Signs, monotonicity intervals, and ranges of sine and cosine, Addition formulas, identities, parity, and derivatives of the hyperbolic functions, Principal inverse sine and inverse cosine, Continuous inverse theorem: a continuous injective f on an interval I is a bijection onto the order-convex set f[I], and the inverse g:f[I]→I is continuous and strictly monotone in the same sense as f, Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function, The derivatives of sine and cosine are cosine and minus sine, A function differentiable at c is continuous at c, Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs): sine, cosine, sinh and cosh are continuous with the usual addition formulas; cos⁡ is strictly decreasing on [0,π] with cos⁡0=1, cos⁡π=−1, and is even, and cos⁡(2π−x)=cos⁡x; cosh⁡ is strictly increasing on [0,∞) with cosh⁡0=1; cosh⁡2−sinh⁡2=1 and sinh⁡a,sinh⁡b>0 for a,b>0; the principal inverse cosine arccos⁡:[−1,1]→[0,π] is continuous and strictly decreasing; sums, products and quotients with nonvanishing denominator of continuous functions are continuous; and ∣g(u,v)∣≤∣u∣ ∣v∣ for tangent vectors, with equality only for linearly dependent vectors.

Proof

technique · direct. The comparison angle of the triple with the actual side lengths is compared with $\theta$ by the distance support inequality applied to a shifted leg, whose first variation at the vertex is available because interior points of minimizing segments are off the cut locus; the model opposite side is the strictly increasing inverse of the model comparison-angle function. Degenerate side configurations are treated separately
1.1givenF1F4F6

Setup and notation. Take the data of the statement. The included angle satisfies cos⁡θ=gp(σ1′(0),σ2′(0)) with unit vectors σ1′(0),σ2′(0), and c=dg(x,y)≥0; the triangle inequality gives ∣a−b∣≤c≤a+b. When k>0 put D:=Dk=π/k and record the hypotheses a,b,c<D and a+b+c<2D. Both legs are minimizing, so a=dg(p,x) and b=dg(p,y). No geodesic is ever used beyond its stated role: σ1 and σ2 are the hinge legs, and σ1∣[0,a−ε], σ2 are the two curves in the first-variation computations below.

1.2F1F5F6

The model hinge. Fix pˉ∈Mk2 and a unit vector u∈TpˉMk2; since TpˉMk2 is two-dimensional, choose w⊥u with ∣w∣=1 and put v:=(cos⁡θ) u+(sin⁡θ) w. Then ∣v∣2=cos⁡2θ+sin⁡2θ=1 and gpˉ(u,v)=cos⁡θ, so the geodesics t↦exp⁡pˉ(tu) and t↦exp⁡pˉ(tv) leave pˉ at included angle θ. Put xˉ:=exp⁡pˉ(au),yˉ:=exp⁡pˉ(bv),c^:=dk(xˉ,yˉ). By [F5] the model is complete and every radial geodesic of the model is minimizing on its initial interval up to the cut time; for k>0 the cut time is D in every direction at every point, and a,b<D, while for k≤0 every radial geodesic minimizes on all of R. Hence dk(pˉ,xˉ)=a,dk(pˉ,yˉ)=b. The three points pˉ,xˉ,yˉ, together with any minimizing geodesic from xˉ to yˉ (which exists by F4), therefore form a labelled triple realizing the ordered side lengths (c^,b,a). The model geodesic used below is the leg σˉ2:=exp⁡pˉ(⋅ v)∣[0,b] from pˉ to yˉ.

1.3F1F6

The comparison-angle function of the side lengths. Fix A,B>0 with A,B<D when k>0. Let I(A,B) be the set of C>0 for which (A,B,C) satisfies the side hypotheses of [F1]: the strict triangle inequalities and, when k>0, C<D and A+B+C<2D. We claim I(A,B)=(∣A−B∣, m(A,B)),m(A,B):={min⁡{A+B, 2D−A−B},k>0,A+B,k≤0. For k>0 the conditions C<D and C<2D−A−B combine to C<min⁡{A+B,D,2D−A−B}, and since A,B<D one has min⁡{A+B,D,2D−A−B}=min⁡{A+B,2D−A−B}: if A+B≤D then A+B≤D≤2D−A−B, and if A+B≥D then 2D−A−B≤D≤A+B. For k≤0 there is no upper bound. So I(A,B) is the displayed interval. On it define ΦA,B(C)∈(0,π) by the model cosine law of [F1], i.e. ΦA,B(C):=arccos⁡FA,B(C) with 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. Each denominator is strictly positive on the domain (sin⁡>0 and sinh⁡>0 for positive arguments, 2AB>0), so by [F6] the function FA,B is continuous on I(A,B), and ΦA,B=arccos⁡∘FA,B is continuous with values in (0,π). Moreover the same function is strictly increasing on I(A,B). On that interval the numerator of FA,B is strictly decreasing in C: for k>0, cos⁡(k C) is strictly decreasing because cos⁡ is strictly decreasing on [0,π] and C↦k C is strictly increasing with values in (0,π); for k=0, A2+B2−C2 is strictly decreasing in C>0; for k<0, −cosh⁡(−k C) is strictly decreasing because cosh⁡ is strictly increasing on [0,∞). Hence FA,B is strictly decreasing, and since arccos⁡ is strictly decreasing on [−1,1], the composition ΦA,B is strictly increasing on I(A,B); in particular ΦA,B is injective. Moreover ΦA,B has the one-sided limits lim⁡C↓∣A−B∣ΦA,B(C)=0,lim⁡C↑m(A,B)ΦA,B(C)=π. Indeed at C=∣A−B∣ the addition formulas of [F6] give FA,B(C)=1; at C=A+B they give FA,B(C)=−1; and when k>0 and m(A,B)=2D−A−B<A+B, the shift formula cos⁡(2π−x)=cos⁡x of [F6] gives cos⁡(k C)=cos⁡(k(2π/k−(A+B)))=cos⁡(k(A+B)), so again FA,B(C)=−1. Continuity of FA,B and of arccos⁡ gives the two displayed limits, and the values lie in (0,π) for C∈I(A,B).

2.1F1F4F5step 1.2step 1.3

The inverse of Φ is the model opposite side. We show that for every θ∈(0,π) the number c^ of step 1.2 satisfies c^=Φa,b−1(θ), which proves at once that c^ depends only on (a,b,θ) and that ck(a,b,θ)=Φa,b−1(θ) for θ∈(0,π). First, c^≤m(a,b): the triangle inequality in the model gives c^≤a+b; when k>0 and a+b>D (the only case in which 2D−a−b<a+b) let pˉ∗ be the antipode of pˉ. By [F5] the cut time of pˉ is D in every direction with cut locus {pˉ∗}, so the radial geodesic φ(t):=exp⁡pˉ(tu) runs from pˉ to pˉ∗ and is minimizing on [0,D], and it is 2D-periodic: φ(s+D) is the cut point of φ(s) in direction u, hence the antipode of φ(s), and applying this twice with the involution q↦−q gives φ(s+2D)=φ(s). Consequently for 0≤s<t≤s+D one has dk(φ(s),φ(t))=t−s, because the radial geodesic from φ(s) in direction u is minimizing on all of [0,D]. Since xˉ=φ(a) and t↦exp⁡pˉ(tv) is minimizing on [0,D] with terminal point exp⁡pˉ(Dv)=pˉ∗, the cut point at time D, the sub-segments of φ from a to D and of this radial geodesic from b to D give dk(xˉ,pˉ∗)=D−a and dk(yˉ,pˉ∗)=D−b, whence c^≤(D−a)+(D−b)=2D−a−b. So c^≤m(a,b) in all cases. Second, c^>∣a−b∣ and c^<m(a,b) unless the included angle is 0 or π. If c^=a+b, the concatenation of the two model legs xˉpˉ and pˉyˉ is a piecewise smooth curve of length a+b=dk(xˉ,yˉ), hence minimizing; by F4 it is a unit-speed geodesic, so its one-sided velocities at pˉ agree. The velocity arriving from the xˉ-side is −u and the departing velocity is v, so v=−u and cos⁡θ=−1, i.e. θ=π. Similarly, if c^=∣a−b∣, say a≥b, then dk(pˉ,xˉ)=b+dk(yˉ,xˉ), so a minimizing geodesic from pˉ to yˉ concatenated with a minimizing geodesic from yˉ to xˉ is minimizing and smooth; since dk(pˉ,yˉ)=b<D when k>0 and minimizing geodesics of the model are unique by [F5] (and for k≤0 likewise), that initial segment is the leg t↦exp⁡pˉ(tv), while as a segment of the geodesic from pˉ to xˉ it is also t↦exp⁡pˉ(tu); hence v=u and θ=0. Finally, if c^=2D−a−b with k>0, the same concatenation argument applied to the two minimizing pieces xˉ→pˉ∗ and pˉ∗→yˉ shows that these pieces join smoothly at pˉ∗; the first is the sub-segment φ∣[a,D] of the geodesic φ, uniqueness of minimizing geodesics between those two points ([F5]; the distance is D−a<D) identifies the pieces with the corresponding sub-segments of φ, and smoothness forces yˉ=φ(2D−b)=φ(−b)=exp⁡pˉ(−bu). Since also yˉ=exp⁡pˉ(bv) with b<D, the uniqueness of minimizing geodesics in the model gives v=−u, so θ=π. Thus for θ∈(0,π) we have ∣a−b∣<c^<m(a,b), i.e. c^∈I(a,b). Now the triple (pˉ,xˉ,yˉ) realizes the ordered side lengths (c^,b,a) with minimizing sides: the two legs are minimizing geodesics of lengths a and b, and a minimizing geodesic from xˉ to yˉ exists by F4. Hence it is a comparison triangle with these ordered side lengths, and by [F1] its angle at pˉ is the model cosine law value Φa,b(c^); its angle at pˉ is θ by construction of v. Therefore θ=Φa,b(c^), and injectivity of Φa,b from step 1.3 gives c^=Φa,b−1(θ). In particular the model opposite side ck(a,b,θ) is well defined on (0,π) and equals Φa,b−1(θ).

2.2F5F6step 1.2step 1.3

The endpoint values. At θ=0 the construction of step 1.2 gives v=u, so xˉ=φ(a), yˉ=φ(b) for the radial geodesic φ(t)=exp⁡pˉ(tu), which minimizes on [0,max⁡{a,b}] by [F5]; therefore ck(a,b,0)=dk(φ(a),φ(b))=∣a−b∣. At θ=π one has v=−u, so yˉ=φ(−b), where φ minimizes on all of R when k≤0 and on [0,D] together with its 2D-periodicity when k>0. If k≤0, then ck(a,b,π)=dk(φ(a),φ(−b))=a+b. If k>0 and a+b≤D, the sub-interval [−b,a] has length a+b≤D, so it is minimizing and ck(a,b,π)=a+b; if a+b>D, periodicity gives yˉ=φ(2D−b) with (2D−b)−a=2D−a−b∈(0,D), so ck(a,b,π)=2D−a−b. Thus ck(a,b,π)={min⁡{a+b, 2D−a−b},k>0,a+b,k≤0. This also shows that ck(a,b,θ) is well defined on all of [0,π], agrees with the model-hinge construction of the statement, and extends Φa,b−1 at the two endpoints.

3.1givenF4step 1.2step 2.2

The degenerate cases c=a+b and c=∣a−b∣. By step 1.1 exactly one of the following holds: (i) c=a+b; (ii) c=∣a−b∣; (iii) ∣a−b∣<c<a+b. We dispose of the first two cases. If c=a+b, the concatenation of σ1 reversed and σ2 is a piecewise smooth curve from x to y of length a+b=dg(x,y), hence minimizing; by F4 it is a unit-speed geodesic, so its one-sided velocities at p agree: the velocity arriving from the x-side is −σ1′(0) and the departing velocity is σ2′(0), so σ2′(0)=−σ1′(0) and θ=π. The endpoint value of step 2.2 then gives ck(a,b,θ)=ck(a,b,π)=a+b=c when k≤0; when k>0 the hypothesis gives 2(a+b)=a+b+c<2D, i.e. a+b<D, so 2D−a−b>a+b and ck(a,b,π)=min⁡{a+b,2D−a−b}=a+b=c. So c≤ck(a,b,θ) in case (i). If c=∣a−b∣, the reverse triangle inequality in the model, applied to the hinge points pˉ,xˉ,yˉ of step 1.2, gives c=∣a−b∣=∣dk(pˉ,xˉ)−dk(pˉ,yˉ)∣≤dk(xˉ,yˉ)=ck(a,b,θ), which is the claim. Only case (iii) remains.

4.1F1step 1.3step 2.1step 2.2step 3.1

Case (iii): the strict comparison data. Assume ∣a−b∣<c<a+b. Then the triple (a,b,c) satisfies the strict triangle inequalities, and for k>0 the bounds a,b,c<D and a+b+c<2D are hypotheses; hence (a,b,c) satisfies the side hypotheses of [F1] and the comparison angle θˉ:=Φa,b(c)∈(0,π) is defined, with c=Φa,b−1(θˉ) by step 1.3. Also θ≠0: if θ=0 then σ1′(0)=σ2′(0) by [F6] (equality in the Cauchy–Schwarz bound for unit vectors), so the two legs coincide by F4, placing x and y on one radial geodesic and forcing c=∣a−b∣, contrary to case (iii). If θ=π, then c<a+b by case (iii) and c<2D−a−b when k>0 by hypothesis, so c<min⁡{a+b, 2D−a−b}=ck(a,b,π)=ck(a,b,θ) by step 2.2 when k>0, and c<a+b=ck(a,b,π)=ck(a,b,θ) when k≤0; this is the claim. It remains to treat θ∈(0,π), which is done in the next layer.

5.1F4givenstep 4.1

The shifted configuration. Assume case (iii) and θ∈(0,π). For ε∈(0,a) put xε:=σ1(a−ε),cε:=dg(xε,y). Then dg(p,xε)=a−ε, the sub-segment σ1∣[0,a−ε] is a minimizing geodesic from p to xε, and dg(xε,x)=ε. By the triangle inequality, cε→c and c−ε≤cε≤c+ε. For all sufficiently small ε>0 the triple (a−ε,b,cε) satisfies the side hypotheses of [F1]: cε>0 and the strict triangle inequalities hold by the estimates cε≥c−ε, cε≤c+ε together with ∣a−b∣<c<a+b (for the inequality cε<(a−ε)+b use cε≤c+ε<a+b−ε for ε<12(a+b−c); the lower bounds are analogous), and for k>0 one has a−ε,b,cε<D and (a−ε)+b+cε≤a+b+c<2D. Also p∉Cut⁡(xε): if p∈Cut⁡(xε), then by the characterization F4 either xε and p are conjugate along a minimizing geodesic joining them, or two distinct minimizing geodesics join them. In the second case, reversing the two geodesics gives two distinct minimizing geodesics joining p and xε; at most one of these two is the segment σ1∣[0,a−ε], so choose one of them and call it τ. Then τ:[0,a−ε]→M is a unit-speed minimizing geodesic with τ(0)=p and τ(a−ε)=xε, and τ′(0)≠σ1′(0), because otherwise τ=σ1∣[0,a−ε] by uniqueness of geodesics with the same initial data F4, contrary to the choice of τ. Since σ1(t)=exp⁡p(t σ1′(0)), applying the converse (b)(2) of the characterization F4 with base p, direction σ1′(0) and time a−ε gives cp(σ1′(0))≤a−ε, contradicting cp(σ1′(0))≥a, which holds because σ1∣[0,a] is minimizing. In the first case, if the conjugacy is carried by a minimizing geodesic joining p and xε other than σ1∣[0,a−ε], then that geodesic together with σ1∣[0,a−ε] gives two distinct minimizing geodesics joining p and xε, and we are back in the second case. If instead the conjugacy is carried by σ1, then p and σ1(a−ε) are conjugate along σ1 with a−ε<a, so σ1∣[0,a] does not minimize past its first conjugate point, by A geodesic does not minimize past its first conjugate point; this contradicts the minimality of σ1. Hence p∉Cut⁡(xε).

6.1F2F4step 5.1

The support inequality for the shifted triangle. Take a minimizing geodesic γε from xε to y (exists by F4). Apply [F2] with N:=M, γ:=σ2 (a unit-speed minimizing geodesic of length b from p to y), o:=xε, a:=a−ε=dg(xε,p) and b:=cε=dg(xε,y): by step 5.1 the triples (b, cε, a−ε) are the side lengths of a comparison triangle (xˉε,pˉ,yˉ) in Mk2, with model side σˉ2,ε from pˉ to yˉ. The lemma gives dg(xε,σ2(t)) ≥ dk(xˉε,σˉ2,ε(t))(0≤t≤b).

6.2F3F4F5step 5.1

The two first-variation derivatives. Apply [F3] in M with o:=xε, q:=p (so the role of the minimizing geodesic σ of [F3] is played by the reverse of σ1∣[0,a−ε]) and the moving geodesic γ:=σ2. The hypothesis holds by step 5.1, and the included angle at p is θ, because the reversed sub-segment has the same initial direction at p as σ1. Hence ddt∣0+dg(xε,σ2(t))=−cos⁡θ. Apply [F3] in the model Mk2 with o:=xˉε, q:=pˉ (the minimizing geodesic from xˉε to pˉ being the corresponding side of the comparison triangle) and γ:=σˉ2,ε. The vertex pˉ is not a cut point of xˉε: when k>0 the model distance is dk(xˉε,pˉ)=a−ε<D while the cut locus of a point of the model sphere is the singleton antipode at distance D [F5]; when k≤0 the model has empty cut loci [F5]. Hence ddt∣0+dk(xˉε,σˉ2,ε(t))=−cos⁡θˉε,θˉε:=Φa−ε,b(cε), the equality θˉε=Φa−ε,b(cε) holding because the angle at pˉ of the comparison triangle is its comparison angle by [F1], and the two legs at pˉ are the side of length a−ε and the side σˉ2,ε of length b.

7.1step 6.1step 6.2F4F6

The angle comparison. Define Gε(t):=dg(xε,σ2(t))−dk(xˉε,σˉ2,ε(t)) on [0,b]. By step 6.1, Gε≥0, and Gε(0)=(a−ε)−(a−ε)=0. Both summands have right derivatives at 0 by step 6.2, so Gε has a right derivative at 0, and since Gε(t)≥0=Gε(0) for t>0, 0≤Gε′(0+)=cos⁡θˉε−cos⁡θ. Since cos⁡ is strictly decreasing on [0,π] and θˉε∈(0,π), θ∈(0,π), this gives θ≥θˉε.

8.1F6step 1.3step 2.1step 4.1step 7.1

Passage to the limit and conclusion in case (iii). As ε↓0 we have a−ε→a and cε→c by step 5.1. The three explicit formulas of step 1.3 define a function of (A,B,C) that is jointly continuous near (a,b,c) by [F6]: the denominators sin⁡(k A)sin⁡(k B), 2AB and sinh⁡(−k A)sinh⁡(−k B) are nonzero there, and for k>0 one has k a,k b∈(0,π) because a,b<D; also arccos⁡ is continuous. Hence θˉε=Φa−ε,b(cε) ⟶ Φa,b(c)=θˉ. Step 7.1 therefore gives θ≥θˉ. Since c=Φa,b−1(θˉ) (step 4.1), θ∈(0,π) and Φa,b−1 is strictly increasing (step 1.3), while ck(a,b,θ)=Φa,b−1(θ) by step 2.1, c=Φa,b−1(θˉ)≤Φa,b−1(θ)=ck(a,b,θ). This completes case (iii) and, with the degenerate cases of step 3.1, the whole proof.

9.1A1F4F5F6step 4.1step 8.1∎

Boundary, choice and consistency audit. Every cited hypothesis is used where it is stated: the completeness and K≥k enter through the support inequality [F2] and Hopf–Rinow; the minimality of both legs enters in step 1.1 and in the comparison of cp(σ1′(0)) in step 5.1; the bounds a,b,c<D and the perimeter bound for k>0 enter in steps 5.1 and 6.1 (validity of the shifted comparison triangles) and in steps 2.2, 3.1 and 4.1 (endpoint and comparison-data cases). The degenerate cases c=a+b, c=∣a−b∣, θ=0, θ=π and a=b, and the boundary value k=0, are each treated explicitly and none is excluded by hypothesis in the general case; the empty case does not arise because a,b>0 and n≥2. No iff is asserted, and the equality case c=ck(a,b,θ) is not characterized here. Only the inherited ACω [A1] is used, through the geodesic, cut-locus and continuity suppliers; no family is selected in the proof, and no minimality of σ2 beyond its role as a leg, no convexity of the distance function, and no equality characterization in the support inequality are used.

Source locator

The statement is the hinge (angle) comparison of Toponogov for curvature ≥k, in the equivalent forms ∣xy∣≤∣x^y^∣ and θ≥θˉ recorded by Lang, Riemannian and Metric Geometry, Chapter 5: Lemma 5.1 is the model cosine law used in [F1], Lemma 5.2 is the strict monotonicity of the opposite side in the included angle (used in steps 1.3 and 2.1 of the proof), Lemma 5.8 is the equivalence (Aκ)⇔(Hκ) between the angle and hinge comparisons, and Remark 5.4 is the existence range of comparison triples used in step 1.3. The route followed here is Eschenburg, Comparison Theorems in Riemannian Geometry, §6: the distance comparison is Theorem 6.1 (the barrier argument proving δ≥0, printed pp.21–25), and the angle comparison is Corollary 6.3, whose proof takes the first variation of the distance to a moving endpoint and shifts the base point to oε when the vertex lies in the cut locus; that shift is step 5.1 here, and the support inequality supplier [F2] is the library form of Theorem 6.1. The displayed inequality (6.10) in the source is printed with a reversed sign, while the proof of Theorem 6.1 establishes δ=σ∘γ−σˉ∘γˉ≥0, i.e. the direction dg(o,γ(t))≥dk(oˉ,γˉ(t)) used in [F2]; the library supplier records the proved direction. 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 in its angle, and Toponogov comparison. Eschenburg §6, Corollary 6.3, gives the first-variation reading of the hinge angle used in steps 6.1–7.1.

Depends on

Used by

Dependency tree · two levels

190 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