Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.4 — |𝒫₃| ≤ n/β₁ + 2gc(6β₂c²)^{2g+2} when ℰ₂ and ℰ₃(2g) fail

Proved
EDPHardness.IntegralityGap.short_paths_bound

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

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

Let c≥2c\ge2c≥2, assume β1>0\beta_1>0β1​>0, β2>0\beta_2>0β2​>0, and let g=⌈3β1β2c2⌉g=\lceil3\beta_1\beta_2c^2\rceilg=⌈3β1​β2​c2⌉ with 10β2c≤g10\beta_2c\le g10β2​c≤g. Let HHH be a hypergraph on nnn vertices with ⌊β2n⌋\lfloor\beta_2n\rfloor⌊β2​n⌋ hyperedges of size ccc for which neither E2\mathcal E_2E2​ (more than n/β1n/\beta_1n/β1​ vertices of degree >10β2c>10\beta_2c>10β2​c) nor E3(2g)\mathcal E_3(2g)E3​(2g) (more than (6β2c2)2g+1(6\beta_2c^2)^{2g+1}(6β2​c2)2g+1 cycles of length at most 2g2g2g in G′G'G′) occurs. In every integral routing in G(H)G(H)G(H) with congestion at most c−1c-1c−1, the set P3\mathcal P_3P3​ of pairs routed on a non-canonical path with fewer than ggg edges satisfies

∣P3∣≤nβ1+2gc (6β2c2)2g+2.|\mathcal P_3|\le\frac n{\beta_1}+2gc\,(6\beta_2c^2)^{2g+2}.∣P3​∣≤β1​n​+2gc(6β2​c2)2g+2.

The term n/β1n/\beta_1n/β1​ accounts for the high-degree vertices; the remaining set P3′\mathcal P_3'P3′​ has ∣P3′∣≤2gc(6β2c2)2g+2|\mathcal P_3'|\le2gc(6\beta_2c^2)^{2g+2}∣P3′​∣≤2gc(6β2​c2)2g+2, because a short non-canonical path and the canonical path of a low-degree vertex together close a short cycle of G′G'G′.

Formalization Note The page bounds the discarded high-degree pairs by n/β1n/\beta_1n/β1​ and ∣P3′∣|\mathcal P_3'|∣P3′​∣ separately; the statement is their sum. The hypothesis 10β2c≤g10\beta_2c\le g10β2​c≤g is the page's "g+10β2c≤2gg+10\beta_2c\le2gg+10β2​c≤2g". Lengths are counted in G(H)G(H)G(H).

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

theorem short_paths_bound (n c : ℕ) (hc : 2 ≤ c) (hβ₁ : 0 < beta1 n c) (hβ₂ : 0 < beta2 n c)
    (hg : 10 * beta2 n c * c ≤ (gParam n c : ℝ))
    (H : Hyp n (numEdges n c) c) (hE₂ : ¬ E2 n c H) (hE₃ : ¬ E3 n c (2 * gParam n c) H)
    (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 ∧
          (R.path v).length < gParam n c)).card : ℝ)
      ≤ (n : ℝ) / beta1 n c +
        2 * gParam n c * c * (6 * beta2 n c * (c : ℝ) ^ 2) ^ (2 * gParam n c + 2) := 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), pp. 495–496, Section 2.4, Gap Analysis for EDPwC (bounds on |P3| and |P′3|)
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