Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definition 1 — (k,β)(k,\beta)(k,β)-hopsets and the β\betaβ-hop distance dG∪F≤βd^{\le\beta}_{G\cup F}dG∪F≤β​

Definition
PivotADO_OneHop_Supplement_Hopset

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsgraph-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1theoretical-computer-science

Let G=(V,E)G=(V,E)G=(V,E) be an undirected, unweighted simple graph with shortest-path distance δG\delta_GδG​ (equal to +∞+\infty+∞ between different components). Let β≥1\beta\ge1β≥1 be an integer and k≥1k\ge1k≥1 a real number. A set FFF of edges on VVV is a (k,β)(k,\beta)(k,β)-hopset for GGG when every edge (x,y)∈F(x,y)\in F(x,y)∈F carries the weight δG(x,y)\delta_G(x,y)δG​(x,y) and, for all u,v∈Vu,v\in Vu,v∈V,

dG∪F≤β(u,v)≤k⋅δG(u,v),d^{\le\beta}_{G\cup F}(u,v)\le k\cdot\delta_G(u,v),dG∪F≤β​(u,v)≤k⋅δG​(u,v),

where dG∪F≤β(u,v)d^{\le\beta}_{G\cup F}(u,v)dG∪F≤β​(u,v) is the minimum weight of a uuu–vvv path in G∪FG\cup FG∪F that uses at most β\betaβ edges (an edge of GGG has weight 1=δG1=\delta_G1=δG​). The size of the hopset is ∣F∣|F|∣F∣; the edges of GGG are not counted, and FFF may contain edges of GGG.

The definition is the object of the hopset lower bounds (Theorems 3 and 4). The reverse inequality δG≤dG∪F≤β\delta_G\le d^{\le\beta}_{G\cup F}δG​≤dG∪F≤β​ holds automatically and is not part of the definition.

Formalization Note FFF is a simple graph on VVV (unordered, loopless edges) and its size is its number of edges. The β\betaβ-hop distance is the infimum, in [0,∞][0,\infty][0,∞], over walks of length at most β\betaβ in G⊔FG\sqcup FG⊔F of the sum of δG\delta_GδG​ over the walk's edges; walks and paths give the same minimum, the empty walk gives 000 for u=vu=vu=v, and the infimum is ∞\infty∞ when no walk of at most β\betaβ edges exists. The factor kkk enters as ENNReal.ofReal k.

Definition code
import Definitions.Def_PivotADO_OneHop_Geometry

set_option autoImplicit false
open scoped Classical ENNReal
noncomputable section

namespace PivotADO.OneHop.Supplement

/-! Definition 1 ((k, β)-hopset), Kadria–Roditty, STOC 2027 submission #584
(October 2026), pp.5–6 (PDF 6–7). The hopset `F` is a set of unordered edges on the
vertex set, encoded as a simple graph; an edge `(x, y)` of `F` has weight `δ_G(x, y)`,
and an edge of `G` has weight `1 = δ_G(x, y)`. -/

/-- `d^{≤β}_{G∪F}(u, v)`: the minimum weight of a `u`–`v` walk in `G ∪ F` with at most
`β` edges, each edge `(x, y)` weighted by `δ_G(x, y)`. It is `⊤` when no such walk exists,
and `0` for `u = v` (the empty walk). Walks and paths give the same minimum. -/
def hopDistance {V : Type*} (G F : SimpleGraph V) (β : ℕ) (u v : V) : ℝ≥0∞ :=
  ⨅ (p : (G ⊔ F).Walk u v) (_ : p.length ≤ β),
    (p.darts.map fun d => distance G d.fst d.snd).sum

/-- `F` is a `(k, β)`-hopset for `G`: `d^{≤β}_{G∪F}(u, v) ≤ k · δ_G(u, v)` for all `u, v`.
The size of the hopset is `edgeCount F`; `F` may contain edges of `G`. -/
def IsHopset {V : Type*} (G F : SimpleGraph V) (k : ℝ) (β : ℕ) : Prop :=
  ∀ u v : V, hopDistance G F β u v ≤ ENNReal.ofReal k * distance G u v

end PivotADO.OneHop.Supplement
Source
Avi Kadria, Liam Roditty, STOC 2027 submission #584 (October 2026), Definition 1, p.5–6 (PDF pp. 6–7); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/584.pdf

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me