Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.1, p. 5, proof of Theorem 1 — optimality of the bisection Ṽ1, Ṽ2 implies |S| ≤ |R|

Proved
LPCommunity.MinBisect.S_le_R_of_optimal

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

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

Let GGG be a graph on V={1,…,n}V=\{1,\dots,n\}V={1,…,n} with a planted bisection V1,V2V_1, V_2V1​,V2​, and let V~1,V~2\tilde V_1,\tilde V_2V~1​,V~2​ be an optimal solution of the minimum bisection problem, i.e. a bisection whose cost is at most the cost of every bisection of VVV. With U1=V1∩V~1U_1 = V_1\cap\tilde V_1U1​=V1​∩V~1​, U2=V2∩V~2U_2 = V_2\cap\tilde V_2U2​=V2​∩V~2​, W1=V1∩V~2W_1 = V_1\cap\tilde V_2W1​=V1​∩V~2​, W2=V2∩V~1W_2=V_2\cap\tilde V_1W2​=V2​∩V~1​ and the edge sets R=R1∪R2R = R_1\cup R_2R=R1​∪R2​ (edges U1U_1U1​–W2W_2W2​ and W1W_1W1​–U2U_2U2​) and S=S1∪S2S = S_1\cup S_2S=S1​∪S2​ (edges U1U_1U1​–W1W_1W1​ and U2U_2U2​–W2W_2W2​), we have

∣S∣≤∣R∣.|S| \le |R|.∣S∣≤∣R∣.

The edges cut by V~1,V~2\tilde V_1,\tilde V_2V~1​,V~2​ are S∪TS\cup TS∪T and those cut by the planted bisection are R∪TR\cup TR∪T, with T=T1∪T2T = T_1\cup T_2T=T1​∪T2​ (edges U1U_1U1​–U2U_2U2​ and W1W_1W1​–W2W_2W2​); optimality gives ∣S∣+∣T∣≤∣R∣+∣T∣|S|+|T|\le|R|+|T|∣S∣+∣T∣≤∣R∣+∣T∣. This is the first of the three inequalities that combine into Theorem 1.

Formalization Note V~1\tilde V_1V~1​ is the Finset W and V~2\tilde V_2V~2​ = Wᶜ; optimality is stated as cutCost G W ≤ cutCost G S for every bisection S. The paper's additional normalizations (∣U1∣≤n/4|U_1|\le n/4∣U1​∣≤n/4, U1≠∅U_1\neq\emptysetU1​=∅) are not needed for this step and are not assumed.

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

theorem S_le_R_of_optimal {n : ℕ} (G : SimpleGraph (Fin n)) (V1 W : Finset (Fin n))
    (hV1 : IsBisection n V1) (hW : IsBisection n W)
    (hopt : ∀ S : Finset (Fin n), IsBisection n S → cutCost G W ≤ cutCost G S) :
    Scard G V1 W ≤ Rcard G V1 W := by sorry

end LPCommunity.MinBisect
Source
Del Pia, Khajavirad, Kunisky, Linear Programming and Community Detection, arXiv:2006.03213v2, §2.1, p. 5, proof of Theorem 1 (the optimality of the bisection Ṽ1, Ṽ2 implies |S| ≤ |R|)
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