Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3, p. 11 — adding edges inside the communities preserves LP recovery

Proved
LPCommunity.LPRecovery.lemma_3

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

community-detectionexact-recoverylinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Characterize a graph GGG with planted bisection V1,V2V_1,V_2V1​,V2​ by the triple (G0,G1,G2)(G_0,G_1,G_2)(G0​,G1​,G2​) of its crossing graph and its two induced subgraphs. Suppose the metric relaxation (LP-P) recovers the planted bisection for (G0,G1,G2)(G_0,G_1,G_2)(G0​,G1​,G2​). Let G~1\tilde G_1G~1​, G~2\tilde G_2G~2​ be graphs on V1V_1V1​, V2V_2V2​ with

E(G~1)⊇E(G1),E(G~2)⊇E(G2).E(\tilde G_1)\supseteq E(G_1),\qquad E(\tilde G_2)\supseteq E(G_2).E(G~1​)⊇E(G1​),E(G~2​)⊇E(G2​).

Then (LP-P) also recovers the planted bisection for (G0,G~1,G~2)(G_0,\tilde G_1,\tilde G_2)(G0​,G~1​,G~2​).

Adding edges inside the communities can only help the LP single out the planted bisection; with Lemma 2 this extends Proposition 2 from regular to sandwiched graphs.

Formalization Note The second graph G′G'G′ has exactly the same crossing edges as GGG, and every edge of GGG inside V1V_1V1​ or inside V2V_2V2​ is an edge of G′G'G′.

Preamble
import Mathlib
import Definitions.Def_LPCommunity_LPRecovery_Setting

open Finset
open scoped Classical
Formal statement
namespace LPCommunity.LPRecovery

theorem lemma_3 {n : ℕ} (G G' : SimpleGraph (Fin n)) (V1 : Finset (Fin n))
    (hV1 : LPCommunity.MinBisect.IsBisection n V1) (hrec : LPRecovers G V1)
    (hcross : ∀ i j, ¬ LPCommunity.MinBisect.sameSide V1 i j → (G'.Adj i j ↔ G.Adj i j))
    (hsame : ∀ i j, LPCommunity.MinBisect.sameSide V1 i j → G.Adj i j → G'.Adj i j) :
    LPRecovers G' V1 := by sorry

end LPCommunity.LPRecovery
Source
Del Pia, Khajavirad, Kunisky, Linear Programming and Community Detection, arXiv:2006.03213v2, p. 11, Lemma 3
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