Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.4 — |𝒫₂| ≤ n/β₁: at most n/β₁ pairs use non-canonical paths of length ≥ g

Proved
EDPHardness.IntegralityGap.long_paths_bound

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

edge-disjoint-pathsintegrality-gapp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let c≥2c\ge2c≥2, assume β1>0\beta_1>0β1​>0 and β2≥1\beta_2\ge1β2​≥1, let g=⌈3β1β2c2⌉g=\lceil3\beta_1\beta_2c^2\rceilg=⌈3β1​β2​c2⌉, and let HHH be any hypergraph on nnn vertices with ⌊β2n⌋\lfloor\beta_2n\rfloor⌊β2​n⌋ hyperedges of size ccc. In every integral routing in G(H)G(H)G(H) with congestion at most c−1c-1c−1, the set P2\mathcal P_2P2​ of pairs routed on a non-canonical path with at least ggg edges satisfies

∣P2∣≤nβ1.|\mathcal P_2|\le\frac n{\beta_1}.∣P2​∣≤β1​n​.

The reason is capacity: G(H)G(H)G(H) has at most 3β2cn3\beta_2cn3β2​cn edges, so the total length of all routing paths is at most 3β2c2n3\beta_2c^2n3β2​c2n, and 3β2c2n/g≤n/β13\beta_2c^2n/g\le n/\beta_13β2​c2n/g≤n/β1​.

Formalization Note Length is the number of edges of G(H)G(H)G(H) on the path. The paper's count "at most 3β2cn3\beta_2cn3β2​cn edges" uses ⌊β2n⌋≤β2n\lfloor\beta_2n\rfloor\le\beta_2n⌊β2​n⌋≤β2​n hyperedges and β2c\beta_2cβ2​c large; the hypothesis β2≥1\beta_2\ge1β2​≥1 makes it hold (it holds in the regime of Theorem 5).

Preamble
import Mathlib
import Definitions.Def_EDPHardness_IntegralityGap_FlowRelaxation
import Definitions.Def_EDPHardness_IntegralityGap_GapInstance
Formal statement
namespace EDPHardness.IntegralityGap

theorem long_paths_bound (n c : ℕ) (hc : 2 ≤ c) (hβ₁ : 0 < beta1 n c) (hβ₂ : 1 ≤ beta2 n c)
    (H : Hyp n (numEdges n c) c)
    (R : IntRouting (gapGraph H) (src n (numEdges n c)) (snk n (numEdges n c)) (c - 1)) :
    ((Finset.univ.filter
        (fun v : R.routed => (R.path v).support ≠ canonicalSupport H v ∧
          gParam n c ≤ (R.path v).length)).card : ℝ)
      ≤ (n : ℝ) / beta1 n c := by sorry

end EDPHardness.IntegralityGap
Source
Andrews, Chuzhoy, Guruswami, Khanna, Talwar, Zhang, Inapproximability of Edge-Disjoint Paths and Low Congestion Routing on Undirected Graphs, Combinatorica 30 (2010), p. 495, Section 2.4, Gap Analysis for EDPwC (bound on |P2|)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

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