Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Real trees, tripod triangles, slimness and minsize

Definition

A real tree is a geodesic metric space in which every two distinct points are joined by a unique topological arc. An arc means a subspace homeomorphic to [0,1], with the two specified endpoints. An injective continuous parameterization by [0,1] also suffices: the interval is compact by Heine-Borel by bisection: every closed bounded interval [a,b] is compact, the metric image is Hausdorff by Distinct points of a metric space have disjoint balls around them, metric and topological continuity agree by Metric continuity characterisations, with countable choice for the sequential converse, and the compact-to-Hausdorff clause of A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism makes the bijection onto its image a homeomorphism.

For three vertices, a chosen geodesic triangle consists of three specified geodesic segments (Geodesics and geodesic metric spaces), allowing repeated vertices and zero-length sides. A tripod triangle is the union of three legs meeting at one branch point, with each side the union of the corresponding two legs and with distances given by the resulting tree metric; legs may have length zero.

For sides S1,S2,S3 put

slim(Δ)=maximaxxSid(x,SjSk),minsize(Δ)=minxiSimaxi,jd(xi,xj).

Here {i,j,k}={1,2,3} and d(x,A)=infaAd(x,a). The extrema are justified by the following local lemma, rather than assumed from the formulas. A triangle is δ-slim if its slimness is at most δ0; a space is hyperbolic here if some finite δ works for every chosen triangle.

For a nonempty geodesic space and P0 define mX(P)=sup{minsize(Δ):perimeter(Δ)P}. Degenerate triangles at each point ensure a nonempty family; each diameter is at most the perimeter, so 0mX(P)P. No profile is assigned to the empty space, which is nevertheless vacuously δ-slim for every δ0.

For nonempty subsets define dH(A,B)=max{supaAd(a,B),supbBd(b,A)}, allowing +. This extends the finite metric convention of Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric only for subset distance, not for distances between points.

In the profile formula, if the triangle has vertices a,b,c, then perimeter(Δ) means the sum of the three chosen side lengths, namely d(a,b)+d(b,c)+d(c,a). A zero-length side contributes 0.

Depends on

Used by

Dependency tree · two levels

56 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