Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8, p. 97 — in a δ-clean cluster every vertex w is 3δ-good w.r.t. N⁺(v) of each member v (δ = 1/44)

Proved
CorrClustBBC.Cautious.lemma_8

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 be a set of vertices, and let C⊆RC\subseteq RC⊆R be δ\deltaδ-clean in the graph induced on RRR. Then for all v,w∈Cv,w\in Cv,w∈C,

w is 3δ-good with respect to NR+(v) (in R).w \text{ is } 3\delta\text{-good with respect to } N^+_R(v) \text{ (in } R).w is 3δ-good with respect to NR+​(v) (in R).

With R=VR=VR=V and C=Ci′C=C'_iC=Ci′​ a δ\deltaδ-clean cluster of OPT′\mathrm{OPT}'OPT′, this is the paper's statement: any vertex w∈Ci′w\in C'_iw∈Ci′​ is 3δ3\delta3δ-good w.r.t. N+(v)N^+(v)N+(v).

The lemma is the base case of the induction in Theorem 7's proof: when Cautious picks a vertex vvv of a clean cluster, no vertex of that cluster is removed from N+(v)N^+(v)N+(v) at the start of the removal step. The proof of Theorem 7 applies it in the remaining graph, hence the set RRR.

Differences from the source:

  • generalization: C′ᵢ a δ-clean cluster of OPT′ in G → any set C ⊆ R that is δ-clean in the graph induced on any vertex set R; reason: the proof uses only that C is δ-clean; R = V and C = C′ᵢ is the page's statement.
Preamble
import Mathlib
import Definitions.Def_CorrClustBBC_Cautious_Setting
Formal statement
namespace CorrClustBBC.Cautious
theorem lemma_8 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj]
    (R C : Finset V) (hCR : C ⊆ R) (hC : IsClean G R δ44 C) (v w : V) (hv : v ∈ C) (hw : w ∈ C) :
    IsGood G R (3 * δ44) (posNbhd G R v) w := by sorry
end CorrClustBBC.Cautious
Source
Bansal, Blum, Chawla, Correlation Clustering, Machine Learning 56 (2004) 89–113, p. 97, Lemma 8 (δ = 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