Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 5, p. 96 — a clustering whose clusters are all δ-clean (δ ≤ 1/4) makes at most 4·m_OPT mistakes

Proved
CorrClustBBC.Cautious.corollary_5

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

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

Let GGG be a complete ±\pm±-labelled graph on a finite vertex set VVV, let δ≤1/4\delta\le 1/4δ≤1/4 be real, and let DDD be a clustering of VVV in which every cluster is δ\deltaδ-clean. Then for every clustering D′D'D′ of VVV,

mD ≤ 4 mD′,m_D\ \le\ 4\,m_{D'} ,mD​ ≤ 4mD′​,

that is, mD≤4 mOPTm_D\le 4\,m_{\mathrm{OPT}}mD​≤4mOPT​.

Clean clusterings are therefore 444-approximations; the corollary is the paper's summary of Lemmas 3 and 4.

Differences from the source:

  • encoding: m_D ≤ 4·m_OPT → m_D ≤ 4·m_{D′} for every clustering D′; reason: m_OPT is the minimum of m_{D′} over all clusterings, so the two statements are equivalent.
  • encoding: a clustering of V → a setoid on V, its clusters being the classes; reason: a clustering is a partition, and partitions are setoids.
Preamble
import Mathlib
import Definitions.Def_CorrClustBBC_Cautious_Setting
Formal statement
namespace CorrClustBBC.Cautious
theorem corollary_5 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj]
    (δ : ℝ) (hδ : δ ≤ 1 / 4) (D : Setoid V)
    (hD : ∀ v, IsClean G Finset.univ δ (classOf D v)) (D' : Setoid V) :
    mistakes G D.r ≤ 4 * mistakes G D'.r := by sorry
end CorrClustBBC.Cautious
Source
Bansal, Blum, Chawla, Correlation Clustering, Machine Learning 56 (2004) 89–113, p. 96, Corollary 5
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