Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 6.5, pp. 369–370 — the four inequalities for L ∩ Aᵢ and R ∩ Aᵢ

Proved
TreewidthApprox.Pushed.four_inequalities

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

balanced-separatorgraph-separationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1treewidth

Let GGG be a finite graph and k≥0k \ge 0k≥0 an integer. Let (A1,B,A2)(A_1, B, A_2)(A1​,B,A2​) be a separation of GGG with ∣A1∣,∣A2∣≤34∣V(G)∣|A_1|, |A_2| \le \tfrac34|V(G)|∣A1​∣,∣A2​∣≤43​∣V(G)∣, and let (L,X,R)(L, X, R)(L,X,R) be a separation of GGG with ∣L∣,∣R∣≤23∣V(G)∣|L|, |R| \le \tfrac23 |V(G)|∣L∣,∣R∣≤32​∣V(G)∣ and ∣X∣≤k+1|X| \le k+1∣X∣≤k+1. Then

∣L∩A1∣+∣L∩A2∣+∣B∣≥13∣V(G)∣−(k+1),∣R∩A1∣+∣R∩A2∣+∣B∣≥13∣V(G)∣−(k+1),∣L∩A1∣+∣R∩A1∣+(k+1)≥14∣V(G)∣−∣B∣,∣L∩A2∣+∣R∩A2∣+(k+1)≥14∣V(G)∣−∣B∣.\begin{aligned} |L \cap A_1| + |L \cap A_2| + |B| &\ge \tfrac13|V(G)| - (k+1),\\ |R \cap A_1| + |R \cap A_2| + |B| &\ge \tfrac13|V(G)| - (k+1),\\ |L \cap A_1| + |R \cap A_1| + (k+1) &\ge \tfrac14|V(G)| - |B|,\\ |L \cap A_2| + |R \cap A_2| + (k+1) &\ge \tfrac14|V(G)| - |B|. \end{aligned}∣L∩A1​∣+∣L∩A2​∣+∣B∣∣R∩A1​∣+∣R∩A2​∣+∣B∣∣L∩A1​∣+∣R∩A1​∣+(k+1)∣L∩A2​∣+∣R∩A2​∣+(k+1)​≥31​∣V(G)∣−(k+1),≥31​∣V(G)∣−(k+1),≥41​∣V(G)∣−∣B∣,≥41​∣V(G)∣−∣B∣.​

These four lower bounds on the "quadrants" L∩AiL \cap A_iL∩Ai​, R∩AiR \cap A_iR∩Ai​ are the counting core of the proof of Lemma 6.5; the dichotomy that follows uses only them.

Formalization Note The page says the two separations are "14\tfrac1441​- and 13\tfrac1331​-balanced"; this is a slip for 34\tfrac3443​ and 23\tfrac2332​, which are the hypotheses of Lemma 6.5 and of the folklore separation, and which are the ones stated here. All quantities are compared as real numbers, since the right-hand sides may be negative.

Preamble
import Mathlib
import Definitions.Def_TreewidthApprox_Pushed_Setting
Formal statement
namespace TreewidthApprox.Pushed

theorem four_inequalities {V : Type} [Fintype V] [DecidableEq V] (G : SimpleGraph V)
    (k : ℕ) (A₁ B A₂ : Finset V) (hAB : IsSeparation G A₁ B A₂)
    (hA₁ : (A₁.card : ℝ) ≤ 3 / 4 * Fintype.card V) (hA₂ : (A₂.card : ℝ) ≤ 3 / 4 * Fintype.card V)
    (L X R : Finset V) (hLXR : IsSeparation G L X R) (hX : X.card ≤ k + 1)
    (hL : (L.card : ℝ) ≤ 2 / 3 * Fintype.card V) (hR : (R.card : ℝ) ≤ 2 / 3 * Fintype.card V) :
    ((L ∩ A₁).card : ℝ) + (L ∩ A₂).card + B.card ≥ 1 / 3 * Fintype.card V - (k + 1) ∧
      ((R ∩ A₁).card : ℝ) + (R ∩ A₂).card + B.card ≥ 1 / 3 * Fintype.card V - (k + 1) ∧
      ((L ∩ A₁).card : ℝ) + (R ∩ A₁).card + (k + 1) ≥ 1 / 4 * Fintype.card V - B.card ∧
      ((L ∩ A₂).card : ℝ) + (R ∩ A₂).card + (k + 1) ≥ 1 / 4 * Fintype.card V - B.card := by sorry

end TreewidthApprox.Pushed
Source
Bodlaender, Drange, Dregi, Fomin, Lokshtanov and Pilipczuk, A c^k n 5-approximation algorithm for treewidth, SIAM J. Comput. 45(2) (2016), pp. 369–370, proof of Lemma 6.5, second paragraph (four bulleted inequalities)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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