Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.1, p. 5, proof of Theorem 1 — |S| ≥ 2t(d_in − t + 1)

Proved
LPCommunity.MinBisect.two_t_dIn_le_S

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 any bisection of VVV. Put U1=V1∩V~1U_1 = V_1\cap\tilde V_1U1​=V1​∩V~1​, t=∣U1∣t = |U_1|t=∣U1​∣, 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 let S=S1∪S2S = S_1\cup S_2S=S1​∪S2​ where S1S_1S1​ is the set of edges with one endnode in U1U_1U1​ and one in W1W_1W1​ and S2S_2S2​ the set of edges with one endnode in U2U_2U2​ and one in W2W_2W2​. Then

∣S∣≥2t (din−t+1),|S| \ge 2t\,(d_{\mathrm{in}} - t + 1),∣S∣≥2t(din​−t+1),

where dind_{\mathrm{in}}din​ is the minimum number of neighbours a vertex has on its own side of the planted bisection.

Each of the ttt nodes of U1U_1U1​ has at least dind_{\mathrm{in}}din​ neighbours in V1V_1V1​, of which at most t−1t-1t−1 lie in U1U_1U1​; symmetrically for U2U_2U2​, which also has ttt nodes. This is the lower bound on ∣S∣|S|∣S∣ in the proof of Theorem 1. The right-hand side may be negative, in which case the bound is trivial.

Formalization Note The inequality is stated in Z\mathbb ZZ, so that din−t+1d_{\mathrm{in}}-t+1din​−t+1 is not truncated at 000. V~1\tilde V_1V~1​ is the bisection W; ttt is (V1 ∩ W).card. No optimality of W is assumed.

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

theorem two_t_dIn_le_S {n : ℕ} (G : SimpleGraph (Fin n)) (V1 W : Finset (Fin n))
    (hV1 : IsBisection n V1) (hW : IsBisection n W) :
    2 * ((V1 ∩ W).card : ℤ) * ((dIn G V1 : ℤ) - (V1 ∩ W).card + 1) ≤ (Scard 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 (|S1| ≥ t(d_in − t + 1), symmetrically |S2| ≥ t(d_in − t + 1), thus |S| ≥ 2t(d_in − t + 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