Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4 — every (2ℓ−β−1β−1,β)(\frac{2\ell-\beta-1}{\beta-1},\beta)(β−12ℓ−β−1​,β)-hopset on some sparse graphs has size Ω(m1+1/ℓ)\Omega(m^{1+1/\ell})Ω(m1+1/ℓ)

Open
PivotADO.OneHop.Supplement.theorem_4

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

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

Assume the standard Erdős girth conjecture. Fix integers β≥2\beta\ge2β≥2 and ℓ>β\ell>\betaℓ>β. Then there are constants a,b,κ>0a,b,\kappa>0a,b,κ>0 such that for every threshold NNN there are n≥Nn\ge Nn≥N and a simple graph GGG on nnn vertices with m=∣E(G)∣m=|E(G)|m=∣E(G)∣ edges, an≤m≤bnan\le m\le bnan≤m≤bn, such that every (2ℓ−β−1β−1,β)\bigl(\tfrac{2\ell-\beta-1}{\beta-1},\beta\bigr)(β−12ℓ−β−1​,β)-hopset FFF for GGG (Definition 1) satisfies

κ m1+1/ℓ≤∣F∣.\kappa\,m^{1+1/\ell}\le|F|.κm1+1/ℓ≤∣F∣.

In words: for every fixed hopbound β≥2\beta\ge2β≥2, under the girth conjecture there are arbitrarily large sparse graphs on which every hopset of stretch (2ℓ−β−1)/(β−1)(2\ell-\beta-1)/(\beta-1)(2ℓ−β−1)/(β−1) and hopbound β\betaβ has size Ω(m1+1/ℓ)\Omega(m^{1+1/\ell})Ω(m1+1/ℓ). The constants depend only on β\betaβ and ℓ\ellℓ, and the graph does not depend on the hopset. No degree bound is asserted.

This extends Theorem 3 (the case β=2\beta=2β=2, stretch 2ℓ−32\ell-32ℓ−3) to every fixed hopbound.

Differences from the source:

  • generalization: the standard Erdős girth conjecture (graphs of girth ≥ 2t+2 with Ω(N^{1+1/t}) edges) → for each t ≥ 1 a constant a > 0 and, for arbitrarily large N, an N-vertex graph of girth ≥ 2t+2 with ≥ a·N^{1+1/t} edges; reason: this is the weakest reading of the Ω-family, implied by every stronger reading (for every N, or for infinitely many N), so the Lean theorem has a weaker hypothesis and specializes to the source's claim; it is exactly what the proof uses (PDF p. 29)
  • encoding: m = Θ(n) and an Ω(·) size bound, for arbitrarily large n → explicit a, b, κ > 0 chosen before the threshold N, then n ≥ N and G with a·n ≤ m ≤ b·n and κ·m^{1+1/ℓ} ≤ |F|; reason: this is the meaning of the asymptotic notation with constants depending on β and ℓ only
  • encoding: a set F of edges on V → a SimpleGraph F on Fin n (unordered, loopless), size = its number of edges; reason: a loop has weight δ_G(x,x) = 0 and only spends a hop, so deleting loops keeps a hopset and lowers its size; the bound for loopless F gives the bound for all F
  • encoding: minimum weight of a path with at most β edges → infimum in [0, ∞] over walks of length ≤ β in G ⊔ F of the sum of δ_G over the walk's edges (G-edges weigh δ_G = 1); reason: removing a cycle from a walk lowers both length and weight, so the minimum is the same; ∞ when no such walk exists
  • encoding: stretch (2ℓ − β − 1)/(β − 1) → the real quotient (2ℓ − β − 1)/(β − 1) with natural β ≥ 2, ℓ > β; reason: computed in ℝ, so no truncated subtraction or integer division; the denominator is positive
Preamble
import Definitions.Def_PivotADO_OneHop_Supplement_Hopset
import Definitions.Def_PivotADO_OneHop_Supplement_ErdosGirth

set_option autoImplicit false
open scoped Classical
Formal statement
namespace PivotADO.OneHop.Supplement

open PivotADO.OneHop

/-- Theorem 4, Kadria–Roditty, STOC 2027 submission #584 (October 2026), p.27 (PDF 28).
The stretch `(2ℓ − β − 1)/(β − 1)` is a real quotient (`β ≥ 2`, so the denominator is
positive). All constants depend only on `β` and `ℓ` and precede `n` and `G`; the graph does
not depend on the hopset. No degree bound. The standard Erdős girth conjecture is an
explicit hypothesis. -/
theorem theorem_4 (hconj : ErdosGirthConjecture) :
    ∀ β ℓ : ℕ, 2 ≤ β → β < ℓ → ∃ (a b κ : ℝ), 0 < a ∧ 0 < b ∧ 0 < κ ∧
      ∀ N : ℕ, ∃ (n : ℕ) (G : SimpleGraph (Fin n)),
        N ≤ n ∧ a * (n : ℝ) ≤ (edgeCount G : ℝ) ∧ (edgeCount G : ℝ) ≤ b * (n : ℝ) ∧
        ∀ F : SimpleGraph (Fin n),
          IsHopset G F ((2 * (ℓ : ℝ) - β - 1) / ((β : ℝ) - 1)) β →
            κ * (edgeCount G : ℝ) ^ (1 + 1 / (ℓ : ℝ)) ≤ (edgeCount F : ℝ) := by sorry

end PivotADO.OneHop.Supplement
Source
Avi Kadria, Liam Roditty, STOC 2027 submission #584 (October 2026), Theorem 4, p.27 (PDF p. 28); first stated p.4 (PDF p. 5); 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