Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 6.5, p. 369 — restricting (L, X, R) to G₁, G₂ gives terminal separations of orders |X ∩ A₁|, |X ∩ A₂|

Proved
TreewidthApprox.Pushed.restrict_terminal_sep

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

graph-separationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1terminal-separationtreewidth

This is the step of the proof of Lemma 6.5 that establishes part (i).

Let (A1,B,A2)(A_1, B, A_2)(A1​,B,A2​) and (L,X,R)(L, X, R)(L,X,R) be two separations of a finite graph GGG. Put

TL=L∩B,XB=X∩B,TR=R∩B,k1=∣X∩A1∣,k2=∣X∩A2∣,T_L = L \cap B,\quad X_B = X \cap B,\quad T_R = R \cap B,\quad k_1 = |X \cap A_1|,\quad k_2 = |X \cap A_2|,TL​=L∩B,XB​=X∩B,TR​=R∩B,k1​=∣X∩A1​∣,k2​=∣X∩A2​∣,

and for i=1,2i = 1, 2i=1,2 let Gi=G[Ai∪(B∖XB)]G_i = G[A_i \cup (B \setminus X_B)]Gi​=G[Ai​∪(B∖XB​)] with terminals TL,TRT_L, T_RTL​,TR​. Then:

  1. (L∩(A1∪B),  X∩A1,  R∩(A1∪B))\bigl(L \cap (A_1 \cup B),\; X \cap A_1,\; R \cap (A_1 \cup B)\bigr)(L∩(A1​∪B),X∩A1​,R∩(A1​∪B)) is a terminal separation of G1G_1G1​ of order k1k_1k1​;
  2. (L∩(A2∪B),  X∩A2,  R∩(A2∪B))\bigl(L \cap (A_2 \cup B),\; X \cap A_2,\; R \cap (A_2 \cup B)\bigr)(L∩(A2​∪B),X∩A2​,R∩(A2​∪B)) is a terminal separation of G2G_2G2​ of order k2k_2k2​;
  3. k1+k2+∣XB∣=∣X∣k_1 + k_2 + |X_B| = |X|k1​+k2​+∣XB​∣=∣X∣.

The paper phrases items 1–2 as "X∩A1X \cap A_1X∩A1​ and X∩A2X \cap A_2X∩A2​ are terminal separations in G1G_1G1​ and G2G_2G2​", naming each separation by its middle part. Item 3 is the budget identity behind k1+k2+∣XB∣≤k+1k_1 + k_2 + |X_B| \le k+1k1​+k2​+∣XB​∣≤k+1 when ∣X∣≤k+1|X| \le k+1∣X∣≤k+1.

Formalization Note GiG_iGi​ is encoded by its vertex set Ai∪(B∖XB)A_i \cup (B \setminus X_B)Ai​∪(B∖XB​) (see the definitions file).

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

theorem restrict_terminal_sep {V : Type} [Fintype V] [DecidableEq V] (G : SimpleGraph V)
    (A₁ B A₂ : Finset V) (hAB : IsSeparation G A₁ B A₂)
    (L X R : Finset V) (hLXR : IsSeparation G L X R) :
    IsTerminalSep G (A₁ ∪ (B \ (X ∩ B))) (L ∩ B) (R ∩ B) (X ∩ A₁).card
        (L ∩ (A₁ ∪ B)) (X ∩ A₁) (R ∩ (A₁ ∪ B)) ∧
      IsTerminalSep G (A₂ ∪ (B \ (X ∩ B))) (L ∩ B) (R ∩ B) (X ∩ A₂).card
        (L ∩ (A₂ ∪ B)) (X ∩ A₂) (R ∩ (A₂ ∪ B)) ∧
      (X ∩ A₁).card + (X ∩ A₂).card + (X ∩ B).card = X.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), p. 369, proof of Lemma 6.5, first paragraph
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