Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Slim triangles imply the gromov product inequality

Statement

In a geodesic space with δ-slim triangles, δ≥0, one has (x∣z)o≥min⁡{(x∣y)o,(y∣z)o}−3δ for every basepoint o and every x,y,z. No properness is required.

Facts & Assumptions

Given: The specified space and four points.

[F1]

Products, their nonnegativity, and infimum-based slimness are as in Hg toolkit slim triangles products and four point constants.

Proof

1.1F1givenalgebra

Put α=min⁡{(x∣y)o,(y∣z)o}. For any point v∈[x,y], the inequalities d(o,x)≤d(o,v)+d(v,x) and d(o,y)≤d(o,v)+d(v,y) add to give d(o,v)≥(x∣y)o. The same argument applies to [y,z].

2.1step 1.1F1algebra

If α≤δ, nonnegativity gives the claimed lower bound. Otherwise fix 0≤t<α−δ and 0<h<α−δ−t. Choose points xt,yt,zt at distance t from o on three chosen radial sides. These points exist since each radial length is at least α. Slimness and the infimum convention supply a point within distance less than δ+h of xt on [o,y]∪[x,y]. It cannot lie on [x,y], whose points have distance at least α>t+δ+h from o. Let it be v∈[o,y]. Then ∣d(o,v)−t∣<δ+h, so d(xt,yt)<2(δ+h). Applying the same reasoning to yt in triangle (o,y,z) gives d(yt,zt)<2(δ+h).

3.1step 2.1F1algebra

Thus d(xt,zt)<4(δ+h) and the joining route through them gives d(x,z)≤d(o,x)−t+4(δ+h)+d(o,z)−t. Expanding the product yields (x∣z)o≥t−2(δ+h). This is true for every sufficiently small positive h, so (x∣z)o≥t−2δ. Otherwise a sufficiently small h would contradict the strict gap.

4.1step 2.1step 3.1algebra∎

Letting t approach α−δ from below in the same elementary real inequality gives (x∣z)o≥α−3δ. When δ=0 and α>0, the same positive h and t<α argument applies; when both vanish step 2.1 applies. All side selections are finite and all near-point witnesses are used one at a time, so no AC or closest-point attainment was used.

Depends on

Used by

Dependency tree · two levels

3 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