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.

Tree cones at all basepoints and scales imply uniform slimness

Statement

Assume AC. Fix one free ultrafilter ω. If a geodesic space X has a real tree as Coneω(X,e,λ) for every sequence e of basepoints and every positive sequence λn0 ordinarily, then some finite δ0 makes every chosen geodesic triangle in X δ-slim.

Facts & Assumptions

Given: A geodesic space with every stated cone a real tree, one fixed free ultrafilter, and AC.

[F1]

There is M>0 controlling two sides with common endpoint when the other endpoints are at distance greater than one. (Tree cones force uniform control of sides with a common endpoint).

[F2]

Oriented sides through bounded regions have full represented interval/ray/line limits. (Limits of geodesic segments, rays and lines).

[F3]

Triangle extrema, tripod equivalence, common tails for finite-Hausdorff rays, and uniqueness of finite-Hausdorff lines hold. (Triangle extrema and the tripod and branch rules for real trees).

[F4]

AC selects violating triangles, nearest points and side families. (The Axiom of Choice).

Proof

technique · direct
1.1

The two-side bound extends to dH([x,y],[x,z])Cmax(1,d(y,z)), with C=4M+4. Only d(y,z)1 needs work. If d(x,y)3, let y be three units before y on its side. Then 2d(y,z)4, so [F1] gives dH([x,y],[x,z])4M; restoring the last length-three piece increases this by at most three. If d(x,y)<3, then d(x,z)<4 and both sides lie within four of their common endpoint, giving Hausdorff distance at most four.

F1algebra
1.2

If there is no uniform slimness bound, use AC to choose a triangle for each n whose slimness dn>n. Maximize distance to the other two sides over all three sides, and rename so the maximizing point is an[xn,yn] with nearest point bn[yn,zn] at distance dn. Let cn[xn,zn] be nearest to an, and put Dn=d(an,cn)dn. Crucially every point of each of the three sides is within dn of the other two.

F3F4
2.1

In the cone based at an at scales 1/dn, write a=[an], b=[bn]. It is a real tree, d(a,b)=1, and every represented point of either opposite side is at distance at least one from a. The full side [xn,yn] survives and contains a; [yn,zn] survives and contains b. Nearest points with bounded rescaled distances give points on the full represented limits by [F2].

step 1.2F2
3.1

First suppose the extended limit of Dn/dn is finite. Then c=[cn] survives (modify exceptional coordinates as needed). Apply step 1.1 to the pairs of half-sides toward xn, toward yn, and toward zn, starting respectively at (an,cn), (an,bn) and (bn,cn). The resulting Hausdorff bounds remain finite after scaling because these three starting-point distances are bounded after scaling. Each pair limits either to segments with the same terminal endpoint or to rays with common tails by [F3]. The finite/infinite status matches in each pair because their startpoints stay at bounded distance.

step 1.1step 2.1F2F3
3.2

It remains that Dn/dnω+. Every point of the third side is then out of bounded rescaled range from an, since its distance is at least Dn. In particular xn,zn escape. The two surviving sides S,T are either rays from a common finite y=[yn], or lines when yn also escapes. Orient their halves toward y positively, using a and b as origins. step 1.1 applied to [an,yn] and [bn,yn] makes the two positive halves either terminate at the same y or share a positive tail.

step 1.1step 2.1F2F3
4.1

Choose a point x common to the two terminal half-sides toward x: take their common finite endpoint, or a point sufficiently far down their common tail past both starting points. Choose y,z similarly. On the full first side the points x,a,y occur in that order, since its two halves have opposite signed parameters. The other full sides similarly contain [y,z] and [z,x]. The finite triangle with these endpoints is a tripod in the cone; hence a[x,y] belongs to the union of its other two sides. This contradicts the distance-at-least-one conclusion of step 2.1. This construction includes finite zero-length terminal legs and does not invoke an ideal-boundary theorem.

step 3.1step 2.1F2F3
4.2

For every fixed t0, take the point at rescaled parameter t on [bn,zn], clamping at its endpoint when necessary. These sequences are bounded because d(an,bn)/dn=1. Global maximality in step 1.2 gives distance at most dn to [xn,yn][xn,zn]. The second set is farther than Dn from an, so cannot supply this bound on a large set: the selected point is within 1+t of an after scaling. Thus it has a bounded nearest point on the first side, and its limit has distance at most one from S. Every point of the entire negative half-ray of T is therefore within one of S.

step 1.2step 3.2F2F3F4
5.1

If y is finite, S,T are rays from y. Distinct rays from one origin split and their distance to each other grows without bound along either tail, by the tripod rule, contradicting step 4.2. If y is infinite, the two lines share a positive tail by step 3.2. If distinct, their intersection is a closed terminal ray: it cannot have a gap by uniqueness of segments. Beyond its finite initial point their negative rays split, and the distance from a point on the negative tail of T to S is its distance back to that split point, which is unbounded. Again step 4.2 excludes this. Thus in both cases S=T, contradicting aS and d(a,T)1. Both extended-ratio cases being impossible, a finite uniform slimness constant exists. The empty space has this property vacuously.

step 2.1step 3.2step 4.2F3

Depends on

Used by

Dependency tree · two levels

14 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