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

Sublinear triangle minsize implies hyperbolicity

Statement

Assume AC. Every nonempty geodesic space X with mX(P)/P0 as P has a finite uniform slimness constant. The empty space is separately vacuously δ-slim for every δ0; no minsize profile is assigned to it.

Facts & Assumptions

Given: AC and a nonempty geodesic X with m_X(P)=o(P).

[F1]

Every cone is uniquely geodesic and every segment is the limit of any prescribed representative sides. (Sublinear minsize identifies every cone segment with a limit segment).

[F2]

Minsize extrema exist and tripod triangles characterize real trees. (Triangle extrema and the tripod and branch rules for real trees).

[F3]

If all basepoint/ordinary-null-scale cones for a fixed free ultrafilter are trees, X has a uniform slimness bound. (Tree cones at all basepoints and scales imply uniform slimness).

[F4]

AC is assumed, in particular for the free ultrafilter and representative-side selections used by the cone suppliers. (The Axiom of Choice).

[F5]

Under AC a free ultrafilter extending the cofinite filter exists. (Free tail ultrafilters and bounded real ultralimit calculus).

Proof

technique · direct
1.1

Fix a free ultrafilter, whose existence under AC follows from [F5], and arbitrary basepoints and positive ordinary-null scales. The resulting cone is geodesic and uniquely geodesic by [F1]. For any triangle in it, choose representatives of its three vertices and original sides; [F1] identifies their limits with the three specified cone sides.

F1F4F5
2.1

These representative triangle perimeters have λnPn uniformly bounded. The estimate λnmX(Pn)ελnPn+λnP0, with P0 a threshold for sublinearity, shows their scaled minsize tends to zero. Minimizing triples exist by [F2], are bounded after scaling, and coalesce at a point p lying on all three limit sides. AC supplies the countable family of triples.

step 1.1F2F4given
3.1

In a uniquely geodesic space, if p lies on all three sides, those sides are unions of the three legs from p to the vertices. Two legs meet only at p: a common point qp on the legs to x,y would give d(x,y)d(x,q)+d(q,y)=d(x,p)+d(p,y)2d(p,q)<d(x,y). Thus the triangle is a tripod, with zero legs allowed. Every cone triangle is a tripod, hence the cone is a real tree by [F2].

step 1.1step 2.1F2algebra
4.1

The basepoints and scales were arbitrary for the fixed free ultrafilter. Apply [F3] to obtain a finite slimness constant for X. For empty X there are no chosen triangles, so the separate vacuous assertion holds without a profile.

step 3.1F3

Depends on

Used by

Dependency tree · two levels

22 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