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

Hg toolkit local geodesics and hausdorff control

Definition

Use the metric, segment and point-to-set conventions of Hg toolkit slim triangles products and four point constants. A path parametrized by arc length is a continuous map q:IX on a real interval such that each compact restriction q[s,t] has length ts. Here length is the supremum, over finite subdivisions s=t0<<tn=t, of id(q(ti1),q(ti)). In particular d(q(s),q(t))ts.

For k0, an arc-length path is k-local geodesic if each restriction to a compact subinterval of length at most k is an isometric parametrization. The k=0 condition is vacuous beyond the arc-length requirement. Results converting locality into global estimates must specify a positive radius when needed.

As in Quasi-geodesics and quasi-geodesic metric spaces, a (λ,ε)-quasi-geodesic is a map q:IX, where λ1, ε0, satisfying λ1stεd(q(s),q(t))λst+ε for all s,tI. This does not assume continuity, arc-length parametrization or properness. A compact-interval segment has nonempty domain [a,b] with ab; a one-point domain is allowed.

For nonempty subsets A,BX, their Hausdorff distance is dH(A,B)=max{supaAd(a,B),supbBd(b,A)}. A supremum is + if its set of values is unbounded; otherwise it exists by completeness. Thus dH takes values in [0,+], and no finite-valued metric on all subsets is claimed. In particular dH(A,B)R means both point-to-set suprema are at most R, even if closest points do not exist. The formula excludes empty subsets. These are definitions and require no simultaneous choices.

Depends on

Used by

Dependency tree · two levels

6 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