Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.8 — Independent rounding

Open
SubquadCutReach.Faster.Supplement.lemma_3_8

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1randomized-rounding

Let HHH be a simple graph on nnn labelled vertices and let 1≤T≤n1\le T\le n1≤T≤n be an integer. Let z1,…,zTz_1,\dots,z_Tz1​,…,zT​ be integral orientation rules (for example those of Algorithm 1) and zˉ=1T∑tzt\bar z=\frac1T\sum_t z_tzˉ=T1​∑t​zt​ their average fractional rule. For each pair u<vu<vu<v choose an iteration I(u,v)I(u,v)I(u,v) uniformly from {1,…,T}\{1,\dots,T\}{1,…,T}, independently over the pairs, and give the pair its direction in zI(u,v)z_{I(u,v)}zI(u,v)​. Let DDD be the orientation of HHH induced by the resulting rule. Then

Pr⁡[∥bD−bzˉ∥1≤4n2T]≥12.\Pr\Big[\|b_D-b_{\bar z}\|_1\le\frac{4n^2}{\sqrt T}\Big]\ge\frac12 .Pr[∥bD​−bzˉ​∥1​≤T​4n2​]≥21​.

This is the rounding step of the warm-up protocol: one random integral orientation whose imbalance stays close to that of the average.

Formalization Note The independent uniform choices are the uniform law on choice functions III from the pairs u<vu<vu<v to {1,…,T}\{1,\dots,T\}{1,…,T}, so the probability is the fraction of choice functions for which the bound holds.

Differences from the source:

  • generalization: the rules z1,…,zTz_1,\dots,z_Tz1​,…,zT​ generated by Algorithm 1 → every family of TTT integral rules z : Fin T → Rule n; reason: the proof uses only that each ztz_tzt​ is integral, deg⁡H≤n\deg_H\le ndegH​≤n and T≤nT\le nT≤n; taking z t := warmRule H b T t gives the source's statement
  • encoding: independent uniform choices Iuv∈{1,…,T}I_{uv}\in\{1,\dots,T\}Iuv​∈{1,…,T} → a uniform choice function I : Pairs n → Fin T, probability as a counting ratio (roundingProb); reason: the product of independent uniform laws is the uniform law on choice functions
  • encoding: the sampled orientation DDD and bzˉb_{\bar z}bzˉ​ → induced H (roundRule z I) and fractionalImbalance H (avgRules z); reason: the same objects
Preamble
import Definitions.Def_SubquadCutReach_Faster_Supplement_Warmup

set_option autoImplicit false
Formal statement
namespace SubquadCutReach.Faster.Supplement

open SubquadCutReach.Faster

/-- Lemma 3.8, p. 9 (PDF 11), restated p. 15 (PDF 17). Stated for every family of `T`
integral rules, in particular those of Algorithm 1. -/
theorem lemma_3_8 (n T : ℕ) (hT1 : 1 ≤ T) (hTn : T ≤ n) (H : SimpleGraph (Fin n))
    (z : Fin T → Rule n) :
    (1 : ℝ) / 2 ≤ roundingProb z fun D =>
      l1 (fun v => (imbalance (induced H D) v : ℝ) - fractionalImbalance H (avgRules z) v) ≤
        4 * (n : ℝ) ^ 2 / Real.sqrt (T : ℝ) := by sorry

end SubquadCutReach.Faster.Supplement
Source
Henry Fleischmann, Sagnik Mukhopadhyay, Swagato Sanyal, STOC 2027 submission #503 (October 2026), p. 9, Lemma 3.8 (PDF p. 11); restated p. 15 (PDF p. 17), proof pp. 15–16 (PDF pp. 17–18)

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