Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.4 — |š’«ā€²| ≤ 4n/β₁: if none of ℰ₁, ā„°ā‚‚, ā„°ā‚ƒ(2g) occurs, every congestion-(cāˆ’1) routing routes ≤ 4n/β₁ pairs

Proved
EDPHardness.IntegralityGap.routed_pairs_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 g=⌈3β1β2c2āŒ‰g=\lceil3\beta_1\beta_2c^2\rceilg=⌈3β1​β2​c2āŒ‰. There are absolute constants α>0\alpha>0α>0 and N0N_0N0​ such that for every n≄N0n\ge N_0n≄N0​, every integer ccc with 2≤c≤α log⁔log⁔nlog⁔log⁔log⁔n2\le c\le\alpha\,\frac{\log\log n}{\log\log\log n}2≤c≤αlogloglognloglogn​, and every hypergraph HHH on nnn vertices with ⌊β2nāŒ‹\lfloor\beta_2n\rfloor⌊β2​nāŒ‹ hyperedges of size ccc for which none of E1\mathcal E_1E1​, E2\mathcal E_2E2​, E3(2g)\mathcal E_3(2g)E3​(2g) occurs, every integral routing in G(H)G(H)G(H) with congestion at most cāˆ’1c-1cāˆ’1 routes at most

∣Pā€²āˆ£ā‰¤4nβ1|\mathcal P'|\le\frac{4n}{\beta_1}∣Pā€²āˆ£ā‰¤Ī²1​4n​

pairs (log⁔\loglog to base 222 in β1\beta_1β1​ and in the range of ccc).

This combines the three bounds on ∣P1∣|\mathcal P_1|∣P1ā€‹āˆ£, ∣P2∣|\mathcal P_2|∣P2ā€‹āˆ£, ∣P3∣|\mathcal P_3|∣P3ā€‹āˆ£ with the estimate 2gc(6β2c2)2g+2≤n/β12gc(6\beta_2c^2)^{2g+2}\le n/\beta_12gc(6β2​c2)2g+2≤n/β1​, valid for large nnn in this range of ccc.

Formalization Note "Sufficiently large nnn" and the range of ccc are the constants N0N_0N0​ and α\alphaα, chosen before nnn, ccc and HHH. The page writes the final estimate as a chain 2gc(6β2c2)2g+2≤(β2c2)3g≤24glog⁔β2=272(4β1)cln⁔2β1≤n≤n/β12gc(6\beta_2c^2)^{2g+2}\le(\beta_2c^2)^{3g}\le2^{4g\log\beta_2}=2^{72(4\beta_1)^c\ln^2\beta_1}\le\sqrt n\le n/\beta_12gc(6β2​c2)2g+2≤(β2​c2)3g≤24glogβ2​=272(4β1​)cln2β1​≤n​≤n/β1​ whose "===" is not an identity; only the conclusion is stated.

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

theorem routed_pairs_bound :
    ∃ α : ā„, 0 < α ∧ ∃ Nā‚€ : ā„•, āˆ€ n : ā„•, Nā‚€ ≤ n → āˆ€ c : ā„•, 2 ≤ c →
      (c : ā„) ≤ α * Real.logb 2 (Real.logb 2 n) / Real.logb 2 (Real.logb 2 (Real.logb 2 n)) →
      āˆ€ H : Hyp n (numEdges n c) c, ¬ E1 n c H → ¬ E2 n c H → ¬ E3 n c (2 * gParam n c) H →
      āˆ€ R : IntRouting (gapGraph H) (src n (numEdges n c)) (snk n (numEdges n c)) (c - 1),
        (R.routed.card : ā„) ≤ 4 * (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. 496, Section 2.4 (the chain for |P′3| and "In total, |P′| ⩽ 4n/β1")
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