Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Β§2.4 β€” |𝒫₁| ≀ n/β₁: if ℰ₁ fails, at most n/β₁ pairs are routed on their canonical paths

Proved
EDPHardness.IntegralityGap.canonical_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 let HHH be a hypergraph on nnn vertices with ⌊β2nβŒ‹\lfloor\beta_2n\rfloor⌊β2​nβŒ‹ hyperedges of size ccc for which the event E1\mathcal E_1E1​ does not occur (every set of ⌈n/Ξ²1βŒ‰\lceil n/\beta_1\rceil⌈n/Ξ²1β€‹βŒ‰ vertices contains a hyperedge). Consider any integral routing in G(H)G(H)G(H) with congestion at most cβˆ’1c-1cβˆ’1, and let P1\mathcal P_1P1​ be the set of routed pairs whose path is their canonical path. Then

∣P1βˆ£β‰€nΞ²1.|\mathcal P_1|\le\frac n{\beta_1}.∣P1β€‹βˆ£β‰€Ξ²1​n​.

Otherwise some hyperedge would have all ccc of its vertices routed canonically, and its special edge would carry ccc paths.

Formalization Note "Routed on its canonical path" means that the routing path has the vertex sequence of P(v)P(v)P(v).

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

theorem canonical_paths_bound (n c : β„•) (hc : 2 ≀ c) (hβ₁ : 0 < beta1 n c)
    (H : Hyp n (numEdges n c) c) (hE₁ : Β¬ E1 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)).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 |P1|)
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