Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 21, p. 809 — restricted distance from a large vertex set

Proved
LeightonRao.ShortPaths.lemma_21

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

graph-distancep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1short-path-flowsparsest-cut

Let GGG be a connected capacitated graph on n≥2n\ge2n≥2 vertices, with uniform sparsest cut value S>0\mathcal S>0S>0 and maximum incident capacity Cmax⁡C_{\max}Cmax​. Let ddd be a nonnegative symmetric distance function of total weight WWW, and let T⊆VT\subseteq VT⊆V contain at least 2n/32n/32n/3 vertices. If LLL is a real number satisfying L≥12Cmax⁡ln⁡n/(nS)L\ge12C_{\max}\ln n/(n\mathcal S)L≥12Cmax​lnn/(nS), then, with distances restricted to paths of at most L/4L/4L/4 edges,

∑u∈V∖TdL/4(T,u)≤6WnS.\sum_{u\in V\setminus T}d_{L/4}(T,u)\le\frac{6W}{n\mathcal S}.u∈V∖T∑​dL/4​(T,u)≤nS6W​.

In particular, all restricted distances in this sum are finite. The estimate links the large component to vertices outside it.

Formalization Note The logarithm in the hypothesis is natural ln⁡n\ln nlnn, while other bounds in the paper use base-two log⁡n\log nlogn. Restricted distances take values in the extended nonnegative reals.

Preamble
import Mathlib
import Definitions.Def_LeightonRao_ShortPaths_Setting
Formal statement
namespace LeightonRao.ShortPaths

/-- Lemma 21, p. 809. The length `L` is real, as on the page; `d(T, u)` uses walks with at most
`L / 4` edges. The restricted distances are extended nonnegative reals. -/
theorem lemma_21 {V : Type} [Fintype V] [DecidableEq V]
    (N : Network V) (hn : 2 ≤ Fintype.card V) (hconn : IsConnectedNet N)
    (d : V → V → ℝ) (hd : IsDistanceFunction d)
    (L : ℝ)
    (hL : 12 * cmax N * Real.log (Fintype.card V : ℝ) /
      ((Fintype.card V : ℝ) * minCut N) ≤ L)
    (T : Finset V)
    (hT : 2 * (Fintype.card V : ℝ) ≤ 3 * (T.card : ℝ)) :
    ∑ u ∈ Tᶜ, distFromL N d (L / 4) T u ≤
      ENNReal.ofReal (6 * totalWeight N d /
        ((Fintype.card V : ℝ) * minCut N)) := by sorry

end LeightonRao.ShortPaths
Source
Leighton and Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J. ACM 46 (1999), p. 809, Lemma 21
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