Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.1, p. 794 — on a c-edge-expander with unit capacities the uniform min-cut is 𝒮 ≥ c/(n − 1)

Proved
LeightonRao.BadExample.min_cut_ge

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

expander-graphp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sparsest-cut

Let GGG be a graph on n≥2n\ge 2n≥2 nodes with unit edge capacities such that, for a constant c>0c>0c>0, ∣⟨U,Uˉ⟩∣≥cmin⁡{∣U∣,∣Uˉ∣}|\langle U,\bar U\rangle|\ge c\min\{|U|,|\bar U|\}∣⟨U,Uˉ⟩∣≥cmin{∣U∣,∣Uˉ∣} for every U⊆VU\subseteq VU⊆V. Then the min-cut of the uniform multicommodity flow problem on GGG satisfies

S=min⁡∅≠U⊊V∣⟨U,Uˉ⟩∣∣U∣ ∣Uˉ∣ ≥ cn−1.\mathcal S=\min_{\emptyset\ne U\subsetneq V}\frac{|\langle U,\bar U\rangle|}{|U|\,|\bar U|}\ \ge\ \frac{c}{n-1}.S=∅=U⊊Vmin​∣U∣∣Uˉ∣∣⟨U,Uˉ⟩∣​ ≥ n−1c​.

This is the lower bound on the min-cut in Leighton and Rao's example of a Θ(log⁡n)\Theta(\log n)Θ(logn) gap between max-flow and min-cut.

Formalization Note Regularity is not needed for this inequality and is not assumed. The minimum is over nonempty proper UUU (see the setting).

Preamble
import Mathlib
import Definitions.Def_LeightonRao_BadExample_Setting

set_option autoImplicit false
open scoped BigOperators
Formal statement
namespace LeightonRao.BadExample

/-- §2.1, p. 794: on a graph with `|⟨U, Ū⟩| ≥ c min{|U|, |Ū|}` for all `U`, the uniform
min-cut with unit capacities is at least `c/(n − 1)`. -/
theorem min_cut_ge {V : Type} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj]
    (c : ℝ) (hc : 0 < c) (hexp : IsEdgeExpander G c)
    (hn : 2 ≤ Fintype.card V) :
    c / ((Fintype.card V : ℝ) - 1) ≤ minCut (unitNetwork G) := by sorry

end LeightonRao.BadExample
Source
Leighton and Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J. ACM 46 (1999), p. 794, §2.1, min-cut display
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