Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6, p. 96 — δ-Clean-Up: some clustering OPT′ with δ-clean non-singleton clusters has m_OPT′ ≤ (9/δ² + 1)·m_OPT

Proved
CorrClustBBC.Cautious.lemma_6

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

approximation-algorithmcorrelation-clusteringp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let GGG be a complete ±\pm±-labelled graph on a finite vertex set VVV and let 0<δ<10<\delta<10<δ<1. For every clustering DDD of VVV there is a clustering D′D'D′ of VVV in which every cluster with at least two vertices is δ\deltaδ-clean (in GGG), and

mD′ ≤ (9δ2+1) mD.m_{D'}\ \le\ \Big(\frac{9}{\delta^2}+1\Big)\,m_D .mD′​ ≤ (δ29​+1)mD​.

Applied to an optimal clustering D=OPTD=\mathrm{OPT}D=OPT, this gives the clustering OPT′\mathrm{OPT}'OPT′ of the paper, with mOPT′≤(9/δ2+1) mOPTm_{\mathrm{OPT}'}\le (9/\delta^2+1)\,m_{\mathrm{OPT}}mOPT′​≤(9/δ2+1)mOPT​.

OPT′\mathrm{OPT}'OPT′ is the near-optimal clean target that Algorithm Cautious is shown to recover (Theorem 7); with δ=1/44\delta=1/44δ=1/44 this lemma supplies the factor 9/δ2+19/\delta^2+19/δ2+1 in Theorem 13.

Differences from the source:

  • reading: δ unspecified (Lemma 6 precedes the standing assumption δ = 1/44) → every real δ with 0 < δ < 1; reason: the proof uses δ < 1 ("as δ < 1", p. 97) and 9/δ² needs δ ≠ 0; δ = 1/44 is the instance used later.
  • generalization: OPT (an optimal clustering) → every clustering D; reason: the procedure δ-Clean-Up and its accounting never use optimality; D = OPT is the page's statement.
  • encoding: "non-singleton cluster" → a class with at least two elements, δ-clean with respect to the whole vertex set; reason: same notion.
Preamble
import Mathlib
import Definitions.Def_CorrClustBBC_Cautious_Setting
Formal statement
namespace CorrClustBBC.Cautious
theorem lemma_6 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj]
    (δ : ℝ) (hδ0 : 0 < δ) (hδ1 : δ < 1) (D : Setoid V) :
    ∃ D' : Setoid V, NonsingletonClean G δ D' ∧
      (mistakes G D'.r : ℝ) ≤ (9 / δ ^ 2 + 1) * (mistakes G D.r : ℝ) := by sorry
end CorrClustBBC.Cautious
Source
Bansal, Blum, Chawla, Correlation Clustering, Machine Learning 56 (2004) 89–113, p. 96, Lemma 6 (proof pp. 96–97)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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