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

Halfspace separation for the local-geodesic mesh

Statement

In a geodesic space with δ-slim triangles, δ>0, let x0,x1,x2 occur in this order on a geodesic, with d(x0,x1)=d(x1,x2)=3δ. Put D(a,b)={z:d(z,a)d(z,b)}. Then dist(D(x0,x1),D(x2,x1))δ,D(x2,x1){z:d(z,x0)>d(z,x1)}. Furthermore dist(x0,D(x1,x0))3δ/2 and dist(x2,D(x1,x2))3δ/2. Distances between nonempty sets mean infima of pairwise distances.

Facts & Assumptions

Given: The space and three collinear points as in the statement.

[F1]

Slimness and point-to-set distances use the infimum convention in Hg toolkit slim triangles products and four point constants.

Proof

1.1

Fix yiD(xi,x1) for i=0,2, and write Ei=d(xi,yi), η=d(y0,y2). Let u be the midpoint of a chosen segment from y0 to y2. Triangle inequalities and the halfspace assumptions give d(u,xi)Ei+η/2 and d(u,x1)Eiη/2 for each i=0,2.

givenalgebra
2.1

For every h>0, slimness of triangle (x0,u,x2) at x1 supplies v on [x0,u] or [x2,u] with d(v,x1)<δ+h. Suppose it is on [xi,u]. Then d(u,v)>Eiη/2δh, while d(xi,u)Ei+η/2, so d(xi,v)<η+δ+h. Therefore 3δ=d(xi,x1)<η+2δ+2h. Since this holds for every h>0, ηδ.

step 1.1F1algebra
3.1

Taking the infimum over y0,y2 gives the first bound; both sets are nonempty since they contain x0,x2, respectively. They are disjoint because δ>0. Thus any zD(x2,x1) does not belong to D(x0,x1), which is precisely the asserted strict inequality.

step 2.1given
4.1

If yD(x1,x0), then 3δd(x0,y)+d(y,x1)2d(x0,y), proving the endpoint bound by taking an infimum. Interchanging x0,x2 gives the other bound. No closest point to a halfspace or bisector has been selected, and all segment selections are finite.

givenalgebra

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