Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9, p. 98 — vertices of two distinct δ-clean clusters are never both 3δ-good w.r.t. one set X (δ = 1/44)

Proved
CorrClustBBC.Cautious.lemma_9

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

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

Let δ=1/44\delta=1/44δ=1/44. Let GGG be a complete ±\pm±-labelled graph on a finite vertex set VVV, let R⊆VR\subseteq VR⊆V, and let C,C′⊆RC,C'\subseteq RC,C′⊆R be disjoint sets, both δ\deltaδ-clean in the graph induced on RRR. For every X⊆RX\subseteq RX⊆R, every v1∈Cv_1\in Cv1​∈C and every v2∈C′v_2\in C'v2​∈C′,

¬(v1 and v2 are both 3δ-good with respect to X).\neg\big(v_1 \text{ and } v_2 \text{ are both } 3\delta\text{-good with respect to } X\big).¬(v1​ and v2​ are both 3δ-good with respect to X).

With R=VR=VR=V and C=Ci′C=C'_iC=Ci′​, C′=Cj′C'=C'_jC′=Cj′​ (i≠ji\ne ji=j) two clusters of OPT′\mathrm{OPT}'OPT′, this is the paper's statement.

The lemma yields Corollary 10: the removal step never leaves vertices of two different clean clusters together.

Differences from the source:

  • generalization: C′ᵢ, C′ⱼ (i ≠ j) clusters of OPT′ in G and an arbitrary set X → any two disjoint sets C, C′ ⊆ R that are δ-clean in the graph induced on any vertex set R, and any X ⊆ R; reason: the proof uses only cleanliness and disjointness; R = V (so every X qualifies) and C = C′ᵢ, C′ = C′ⱼ is the page's statement.
Preamble
import Mathlib
import Definitions.Def_CorrClustBBC_Cautious_Setting
Formal statement
namespace CorrClustBBC.Cautious
theorem lemma_9 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj]
    (R X C C' : Finset V) (hX : X ⊆ R) (hCR : C ⊆ R) (hC'R : C' ⊆ R) (hdisj : Disjoint C C')
    (hC : IsClean G R δ44 C) (hC' : IsClean G R δ44 C') (v₁ v₂ : V) (hv₁ : v₁ ∈ C) (hv₂ : v₂ ∈ C') :
    ¬ (IsGood G R (3 * δ44) X v₁ ∧ IsGood G R (3 * δ44) X v₂) := by sorry
end CorrClustBBC.Cautious
Source
Bansal, Blum, Chawla, Correlation Clustering, Machine Learning 56 (2004) 89–113, p. 98, Lemma 9 (δ = 1/44 from p. 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