Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 7.2 — both join optimum bounds and strictness

Open
ConstrainedCorrelationRepulsion.Main.Supplement.proposition_7_2

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

approximationcorrelation-clusteringp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be any finite simple graph with nnn vertices, m>0m>0m>0 edges and maximum clique size ω(G)\omega(G)ω(G). For every positive integer ttt, join GGG to a new universal clique KtK_tKt​. Its minimum cluster-deletion cost satisfies

OPT⁡del(G∨Kt)≤t(n−ω(G))+m−(ω(G)2)≤t(n−ω(G))+m.\operatorname{OPT}_{\rm del}(G\vee K_t)\le t(n-\omega(G))+m-\binom{\omega(G)}2\le t(n-\omega(G))+m.OPTdel​(G∨Kt​)≤t(n−ω(G))+m−(2ω(G)​)≤t(n−ω(G))+m.

The second displayed inequality is strict. The formal statement retains both the weak inequality and its strict version. This upper bound is used in the exact approximation transfer, and its optimum is the existing constrained objective on the cluster-deletion embedding.

Differences from the source:

  • encoding: finite unsigned graphs, deletion optimum and displayed subtraction → Mathlib simple graphs on labelled vertices, published constrained OPT through the deletion embedding, and real arithmetic; reason: the labelling changes no instance, the embedding counts exactly deleted original edges, and real subtraction avoids natural-number truncation
Preamble
import Definitions.Def_ConstrainedCorrelationRepulsion_Main_Supplement_Graphs
Formal statement
namespace ConstrainedCorrelationRepulsion.Main.Supplement

/-- Proposition 7.2, printed p.35 / PDF p.36, including the binomial term and strictness. -/
theorem proposition_7_2 {n : ℕ} (G : Graph n) (t : ℕ) (ht : 0 < t)
    (hm : 0 < edgeCount G) :
    (deletionOPT (joinClique G t) : ℝ) ≤
      (t : ℝ) * ((n : ℝ) - (omega G : ℝ)) + (edgeCount G : ℝ) -
        (Nat.choose (omega G) 2 : ℝ) ∧
    (t : ℝ) * ((n : ℝ) - (omega G : ℝ)) + (edgeCount G : ℝ) -
        (Nat.choose (omega G) 2 : ℝ) ≤
      (t : ℝ) * ((n : ℝ) - (omega G : ℝ)) + (edgeCount G : ℝ) ∧
    (t : ℝ) * ((n : ℝ) - (omega G : ℝ)) + (edgeCount G : ℝ) -
        (Nat.choose (omega G) 2 : ℝ) <
      (t : ℝ) * ((n : ℝ) - (omega G : ℝ)) + (edgeCount G : ℝ) := by sorry

end ConstrainedCorrelationRepulsion.Main.Supplement
Source
Yixin Cao, Ying Xu, STOC 2027 submission #869 (October 2026), Proposition 7.2, printed p.35 (PDF p.36)

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