Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite split-vertex network for bounded-congestion clouds

Definition
DvorakNorin2018_SplitNetwork

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

flowsgraph-theorytreewidth

For a finite graph GGG with sinks WWW, split each vertex into an input and an output node, and add a source and a sink. Source-to-input capacities are 111; input-to-output capacities are α\alphaα; graph edges give output-to-input arcs of capacity MMM unless their tail belongs to WWW; outputs of vertices in WWW connect to the sink with capacity MMM. Other capacities are zero. Cut capacity sums capacities from the cut to its complement. Finite MMM is chosen above the supply threshold of interest.

Definition code
import Definitions.Def_TreewidthApprox_Pushed_Setting
import Mathlib.Data.Fintype.BigOperators

set_option autoImplicit false
open scoped Classical BigOperators
namespace StableMSR.Recovery.SplitNetwork
abbrev Node (V : Type) := Unit ⊕ (Unit ⊕ (V ⊕ V))
abbrev source {V : Type} : Node V := Sum.inl ()
abbrev sink {V : Type} : Node V := Sum.inr (Sum.inl ())
abbrev input {V : Type} (v : V) : Node V := Sum.inr (Sum.inr (Sum.inl v))
abbrev output {V : Type} (v : V) : Node V := Sum.inr (Sum.inr (Sum.inr v))
noncomputable def capacity {V : Type} [DecidableEq V] (G : SimpleGraph V)
    (W : Finset V) (α M : ℝ) : Node V → Node V → ℝ
  | .inl _, .inr (.inr (.inl _)) => 1
  | .inr (.inr (.inl v)), .inr (.inr (.inr w)) => if v = w then α else 0
  | .inr (.inr (.inr v)), .inr (.inr (.inl w)) => if G.Adj v w ∧ v ∉ W then M else 0
  | .inr (.inr (.inr v)), .inr (.inl _) => if v ∈ W then M else 0
  | _, _ => 0
noncomputable def row {V : Type} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) (W : Finset V) (α M : ℝ) (C : Finset (Node V)) (x : Node V) : ℝ :=
  if x ∈ C then ∑ y, if y ∉ C then capacity G W α M x y else 0 else 0
noncomputable def cut {V : Type} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) (W : Finset V) (α M : ℝ) (C : Finset (Node V)) : ℝ :=
  ∑ x, row G W α M C x

end StableMSR.Recovery.SplitNetwork
Source
Dvorak and Norin, Treewidth of graphs with balanced separations, https://arxiv.org/pdf/1408.3869v2, Section 2.2, construction before Observation 5 (PDF p. 4). Finite M replaces infinite capacities for cuts below M.

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