Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.4 ¶2 — 1/c on every canonical path is a feasible fractional solution of value n/c

Proved
EDPHardness.IntegralityGap.fractional_solution

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

linear-programming-relaxationmulticommodity-flowp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let c≥2c\ge2c≥2 and let HHH be any hypergraph on nnn vertices with ⌊β2n⌋\lfloor\beta_2n\rfloor⌊β2​n⌋ hyperedges of size ccc, and G(H)G(H)G(H) the EDP instance built from it, with pairs (s(v),t(v))(s(v),t(v))(s(v),t(v)) and canonical paths P(v)P(v)P(v).

Sending 1/c1/c1/c units of flow on each canonical path is a feasible solution of the multicommodity flow relaxation (every edge carries at most one unit), and its value is

∑vxv=nc.\sum_{v} x_v=\frac nc .v∑​xv​=cn​.

Precisely: there is a feasible fractional solution of value n/cn/cn/c whose flow-carrying paths are canonical paths, each carrying 1/c1/c1/c.

This is the fractional side of the integrality gap: the LP optimum of G(H)G(H)G(H) is at least n/cn/cn/c for every HHH.

Formalization Note A flow-carrying path is identified as canonical by its vertex sequence. The statement holds for every HHH (no randomness is needed); a vertex in no hyperedge has the canonical path (s(v),t(v))(s(v),t(v))(s(v),t(v)) by the convention of the definitions.

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

theorem fractional_solution (n c : ℕ) (hc : 2 ≤ c) (H : Hyp n (numEdges n c) c) :
    ∃ F : FracSol (gapGraph H) (src n (numEdges n c)) (snk n (numEdges n c)),
      F.value = (n : ℝ) / c ∧
      ∀ v, ∀ P ∈ F.paths v, P.support = canonicalSupport H v ∧ F.f v P = 1 / (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, second paragraph
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