Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Observation 5, forward direction: cloud supply is bounded by separator charge

Proved
DvorakNorin2018.cloud_supply_le_separator_charge

by lreyzin · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

flowsgraph-theorytreewidth

Let GGG be a finite undirected graph, let WWW be its designated sinks, and let g(v)∈[0,1]g(v)\in[0,1]g(v)∈[0,1] and f(u,v)≥0f(u,v)\ge0f(u,v)≥0 describe a WWW-cloud. Flow is supported on graph edges, leaves no sink, and satisfies

g(v)+∑uf(u,v)=∑uf(v,u)(v∉W).g(v)+\sum_u f(u,v)=\sum_u f(v,u)\qquad(v\notin W).g(v)+u∑​f(u,v)=u∑​f(v,u)(v∈/W).

Assume its congestion is at most α\alphaα, so g(v)+∑uf(u,v)≤αg(v)+\sum_u f(u,v)\le\alphag(v)+∑u​f(u,v)≤α at every vertex. For every separation into pairwise disjoint parts L,S,RL,S,RL,S,R, with no edge between LLL and RRR and with W⊆L∪SW\subseteq L\cup SW⊆L∪S, the total supply satisfies

∑vg(v)≤∣L∣+α∣S∣.\sum_v g(v)\le |L|+\alpha|S|.v∑​g(v)≤∣L∣+α∣S∣.

Equivalently, a cloud with supply greater than sss excludes every separator whose sink-side charge ∣L∣+α∣S∣|L|+\alpha|S|∣L∣+α∣S∣ is at most sss. This is the forward implication of Observation 5. The converse, constructing a cloud by max-flow/min-cut, is a separate result.

Preamble
import Definitions.Def_TreewidthApprox_Pushed_Setting

set_option autoImplicit false
open scoped Classical BigOperators
Formal statement
namespace DvorakNorin2018

open TreewidthApprox.Pushed

theorem cloud_supply_le_separator_charge {V : Type} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) (W : Finset V) (supply : V → ℝ) (flow : V → V → ℝ) (α : ℝ)
    (hsupply : ∀ v, 0 ≤ supply v ∧ supply v ≤ 1)
    (hflow : ∀ u v, 0 ≤ flow u v)
    (hsupport : ∀ u v, ¬ G.Adj u v → flow u v = 0)
    (hsinks : ∀ u ∈ W, ∀ v, flow u v = 0)
    (hcons : ∀ v ∉ W, supply v + ∑ u, flow u v = ∑ u, flow v u)
    (hcongestion : ∀ v, supply v + ∑ u, flow u v ≤ α)
    (L S R : Finset V) (hpart : IsPartition3 Finset.univ L S R)
    (hno : NoEdge G L R) (hW : W ⊆ L ∪ S) :
    (∑ v, supply v) ≤ (L.card : ℝ) + α * S.card := by sorry

end DvorakNorin2018
Source
Z. Dvorak and S. Norin, Treewidth of graphs with balanced separations, arXiv:1408.3869v2, https://arxiv.org/pdf/1408.3869v2, Section 2.2, Observation 5 (PDF pp. 4–5), forward implication. This is a foundation for the separator-to-treewidth step used by Ravichandran–Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, Theorem 4.3 and Lemma 4.4.

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