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 has a real tree as for every sequence of basepoints and every positive sequence ordinarily, then some finite makes every chosen geodesic triangle in -slim.
Facts & Assumptions
Given: A geodesic space with every stated cone a real tree, one fixed free ultrafilter, and AC.
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).
Oriented sides through bounded regions have full represented interval/ray/line limits. (Limits of geodesic segments, rays and lines).
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).
AC selects violating triangles, nearest points and side families. (The Axiom of Choice).
Proof
The two-side bound extends to , with . Only needs work. If , let be three units before on its side. Then , so [F1] gives ; restoring the last length-three piece increases this by at most three. If , then and both sides lie within four of their common endpoint, giving Hausdorff distance at most four.
If there is no uniform slimness bound, use AC to choose a triangle for each whose slimness . Maximize distance to the other two sides over all three sides, and rename so the maximizing point is with nearest point at distance . Let be nearest to , and put . Crucially every point of each of the three sides is within of the other two.
In the cone based at at scales , write , . It is a real tree, , and every represented point of either opposite side is at distance at least one from . The full side survives and contains ; survives and contains . Nearest points with bounded rescaled distances give points on the full represented limits by [F2].
First suppose the extended limit of is finite. Then survives (modify exceptional coordinates as needed). Apply step 1.1 to the pairs of half-sides toward , toward , and toward , starting respectively at , and . 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.
It remains that . Every point of the third side is then out of bounded rescaled range from , since its distance is at least . In particular escape. The two surviving sides are either rays from a common finite , or lines when also escapes. Orient their halves toward positively, using and as origins. step 1.1 applied to and makes the two positive halves either terminate at the same or share a positive tail.
Choose a point common to the two terminal half-sides toward : take their common finite endpoint, or a point sufficiently far down their common tail past both starting points. Choose similarly. On the full first side the points occur in that order, since its two halves have opposite signed parameters. The other full sides similarly contain and . The finite triangle with these endpoints is a tripod in the cone; hence 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.
For every fixed , take the point at rescaled parameter on , clamping at its endpoint when necessary. These sequences are bounded because . Global maximality in step 1.2 gives distance at most to . The second set is farther than from , so cannot supply this bound on a large set: the selected point is within of after scaling. Thus it has a bounded nearest point on the first side, and its limit has distance at most one from . Every point of the entire negative half-ray of is therefore within one of .
If is finite, are rays from . 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 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 to is its distance back to that split point, which is unbounded. Again step 4.2 excludes this. Thus in both cases , contradicting and . Both extended-ratio cases being impossible, a finite uniform slimness constant exists. The empty space has this property vacuously.
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
- Drutu–Kapovich, Geometric Group Theory — §11.20 Proposition 11.167(a), full proof PDF pp.443–445 (standard reference, not scraped)