Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.5 (ii), p. 369 — a left-pushed and a right-pushed terminal separation glue to a terminal separation of G of order ≤ k+1

Proved
TreewidthApprox.Pushed.glue_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 first assertion of Lemma 6.5 (ii).

Let (A1,B,A2)(A_1, B, A_2)(A1​,B,A2​) be a separation of a finite graph GGG, let (TL,XB,TR)(T_L, X_B, T_R)(TL​,XB​,TR​) be a partition of BBB, and let k,k1,k2≥0k, k_1, k_2 \ge 0k,k1​,k2​≥0 be integers with k1+k2+∣XB∣≤k+1k_1 + k_2 + |X_B| \le k + 1k1​+k2​+∣XB​∣≤k+1. Let G1=G[A1∪(B∖XB)]G_1 = G[A_1 \cup (B \setminus X_B)]G1​=G[A1​∪(B∖XB​)] and G2=G[A2∪(B∖XB)]G_2 = G[A_2 \cup (B \setminus X_B)]G2​=G[A2​∪(B∖XB​)], both with terminals TL,TRT_L, T_RTL​,TR​. If (L1,X1,R1)(L_1, X_1, R_1)(L1​,X1​,R1​) is a left-pushed terminal separation of G1G_1G1​ of order k1k_1k1​ and (L2,X2,R2)(L_2, X_2, R_2)(L2​,X2​,R2​) is a right-pushed terminal separation of G2G_2G2​ of order k2k_2k2​, then

(L1∪TL∪L2,  X1∪XB∪X2,  R1∪TR∪R2)(L_1 \cup T_L \cup L_2,\; X_1 \cup X_B \cup X_2,\; R_1 \cup T_R \cup R_2)(L1​∪TL​∪L2​,X1​∪XB​∪X2​,R1​∪TR​∪R2​)

is a terminal separation of GGG (with terminals TL,TRT_L, T_RTL​,TR​) of order at most k+1k+1k+1.

The conclusion in fact holds for any terminal separations of G1G_1G1​ and G2G_2G2​ of orders k1k_1k1​ and k2k_2k2​; pushedness is only needed for the size bounds of Lemma 6.5. The statement keeps the paper's hypotheses.

Formalization Note GiG_iGi​ is encoded by its vertex set; a terminal separation of GGG itself is one with vertex set W=V(G)W = V(G)W=V(G).

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

theorem glue_terminal_sep {V : Type} [Fintype V] [DecidableEq V] (G : SimpleGraph V)
    (A₁ B A₂ : Finset V) (hAB : IsSeparation G A₁ B A₂)
    (TL XB TR : Finset V) (hpart : IsPartition3 B TL XB TR)
    (k k₁ k₂ : ℕ) (hbudget : k₁ + k₂ + XB.card ≤ k + 1)
    (L₁ X₁ R₁ L₂ X₂ R₂ : Finset V)
    (h₁ : IsLeftPushed G (A₁ ∪ (B \ XB)) TL TR k₁ L₁ X₁ R₁)
    (h₂ : IsRightPushed G (A₂ ∪ (B \ XB)) TL TR k₂ L₂ X₂ R₂) :
    IsTerminalSep G Finset.univ TL TR (k + 1) (L₁ ∪ TL ∪ L₂) (X₁ ∪ XB ∪ X₂) (R₁ ∪ TR ∪ R₂) := 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, Lemma 6.5 (ii), first assertion
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