Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, p. 4 — if d_in − d_out > n/4 − 1, the minimum bisection problem recovers the planted bisection

Proved
LPCommunity.MinBisect.theorem_1

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

community-detectionexact-recoverygraph-partitioningminimum-bisectionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let G=(V,E)G=(V,E)G=(V,E) be a graph on V={1,…,n}V=\{1,\dots,n\}V={1,…,n} with a planted bisection V1,V2V_1,V_2V1​,V2​ (∣V1∣=∣V2∣=n/2|V_1|=|V_2|=n/2∣V1​∣=∣V2​∣=n/2). Let dind_{\mathrm{in}}din​ be the minimum degree of the nodes of G[V1]∪G[V2]G[V_1]\cup G[V_2]G[V1​]∪G[V2​] and doutd_{\mathrm{out}}dout​ the maximum degree of the nodes of the bipartite graph G0G_0G0​ of edges between V1V_1V1​ and V2V_2V2​. If

din−dout>n4−1,d_{\mathrm{in}} - d_{\mathrm{out}} > \frac{n}{4} - 1,din​−dout​>4n​−1,

then the minimum bisection problem recovers the planted bisection: {V1,V2}\{V_1,V_2\}{V1​,V2​} is the unique bisection of VVV of minimum cost.

The condition involves only the worst-case degree inside and across the communities, with no randomness. It is tight: by Theorem 2 of the paper, for every nnn divisible by eight and every admissible pair with din−dout≤n/4−1d_{\mathrm{in}} - d_{\mathrm{out}} \le n/4-1din​−dout​≤n/4−1 there are graphs on which recovery fails. Section 3 of the paper compares it with the condition din−dout≥n/4d_{\mathrm{in}} - d_{\mathrm{out}}\ge n/4din​−dout​≥n/4 under which the metric LP relaxation recovers the planted bisection.

Formalization Note The vertex set is Fin n. dind_{\mathrm{in}}din​ and doutd_{\mathrm{out}}dout​ are the defined dIn, dOut, and the hypothesis is compared in R\mathbb RR (real division n/4n/4n/4, no truncated subtraction). "Recovers" means: every bisection S with cutCost G S ≤ cutCost G V1 equals V1 or V1ᶜ. At n=0n=0n=0 the statement holds trivially (the only bisection is ∅\emptyset∅).

Preamble
import Mathlib
import Definitions.Def_LPCommunity_MinBisect_Setting
Formal statement
namespace LPCommunity.MinBisect

theorem theorem_1 {n : ℕ} (G : SimpleGraph (Fin n)) (V1 : Finset (Fin n)) (hV1 : IsBisection n V1)
    (h : (dIn G V1 : ℝ) - (dOut G V1 : ℝ) > (n : ℝ) / 4 - 1) :
    MinBisectRecovers G V1 := by sorry

end LPCommunity.MinBisect
Source
Del Pia, Khajavirad, Kunisky, Linear Programming and Community Detection, arXiv:2006.03213v2, p. 4, Theorem 1
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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