Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

Comparison angles of hinges, model triangle angles, and the Alexandrov upper angle

Definition

(1) Comparison angle of a length triple. For real lengths b,c>0 and a≥0 satisfying ∣b−c∣≤a≤b+c, define θE(a;b,c):=arccos⁡ ⁣(b2+c2−a22bc). This is a number in [0,π] (Principal inverse sine and inverse cosine): the two assumed length inequalities give (b−c)2≤a2≤(b+c)2, hence −2bc≤b2+c2−a2≤2bc. For spherical adjacent lengths b,c∈(0,π) and an opposite length a≥0, put zS(a;b,c):=cos⁡a−cos⁡bcos⁡csin⁡bsin⁡c. The denominator is positive (Pi is the first positive zero of sine). Whenever zS(a;b,c)∈[−1,1], define the spherical comparison angle by θS(a;b,c):=arccos⁡zS(a;b,c)∈[0,π]. No spherical angle is assigned by this definition when that validity condition fails. In either model the notation chooses the unique angle in [0,π] having the indicated cosine.

(2) Comparison angle of a metric hinge. In a metric space (X,d) (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric), let p,x,y∈X with x≠p and y≠p; x=y is allowed. The Euclidean comparison angle at p is ∠~p(x,y):=θE(d(x,y);d(p,x),d(p,y)). Its length triple meets (1): the metric triangle inequality gives d(x,y)≤d(p,x)+d(p,y) and, applied with each of x,y as the middle point, ∣d(p,x)−d(p,y)∣≤d(x,y).

(3) Alexandrov upper angle. Let c:[0,L]→X and c′:[0,L′]→X be unit-speed geodesic segments with L,L′>0 and c(0)=c′(0) (Geodesics and geodesic metric spaces). For ε>0 set H(ε):=sup⁡{∠~c(0)(c(s),c′(t)):0<s≤min⁡(ε,L), 0<t≤min⁡(ε,L′)}, and define their Alexandrov upper angle by ∠(c,c′):=inf⁡ε>0H(ε). Each set in the supremum is nonempty and contained in [0,π], so its supremum exists and also lies in [0,π] (Upper bound, least upper bound, and strict upper bound, The Cauchy-sequence reals have the least-upper-bound property). The set of these suprema is likewise nonempty and bounded; its infimum exists by applying the same least-upper-bound property to its negatives. Thus ∠(c,c′)∈[0,π] is well defined. This is the two-variable upper-limit convention, without asserting existence of an ordinary limit, monotonicity of the comparison angles in s,t, invariance under reparametrization, or a CAT inequality.

(4) Triangle-angle conventions. In a geodesic triangle with distinct vertices and chosen sides (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles), the angle at a vertex means (3) for the unit-speed parametrizations of the two sides starting there. For a model triangle in Mκ2, κ∈{0,1}, with distinct vertices, the model angle at a vertex is defined by (1) from its two adjacent side lengths and opposite side length. In the spherical case the side lengths must be in (0,π) and the validity condition in (1) must hold. Model angles are therefore side-length comparison angles; the identification with geometric angles, and any further relations among upper angles, require their own arguments.

Remarks

A comparison angle in (2) is a quantity determined by the three metric distances, while (3) uses arbitrarily short initial portions of the two geodesics. The definition supplies these quantities and their domains; it does not by itself prove the upper-angle triangle inequality or the angle comparison consequences of curvature bounds.

Depends on

Used by

Dependency tree · two levels

38 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