Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 4.3, p. 350 — summing the bounds for the children's subtrees: |V(T)| ≤ 1 − p + (1 + 1/(1−C)) Σ μ(vᵢ)

Proved
TreewidthApprox.TreeMeasure.summed_bound

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rooted-treetreewidth

Let TTT be a finite rooted tree with root rrr, let μ:V(T)→R\mu : V(T) \to \mathbb Rμ:V(T)→R and 0<C<10 < C < 10<C<1 satisfy the hypotheses (i)–(iii) of Lemma 4.3, and write

K=1+11−C.K = 1 + \frac{1}{1-C}.K=1+1−C1​.

Let vvv be a vertex with children v1,…,vpv_1,\dots,v_pv1​,…,vp​ (p≥0p \ge 0p≥0), and let TvT_vTv​ and Tv1,…,TvpT_{v_1},\dots,T_{v_p}Tv1​​,…,Tvp​​ be the subtrees rooted at vvv and at its children. If every child satisfies ∣V(Tvi)∣≤Kμ(vi)−1|V(T_{v_i})| \le K\mu(v_i) - 1∣V(Tvi​​)∣≤Kμ(vi​)−1, then

∣V(Tv)∣  ≤  1−p+K∑i=1pμ(vi).|V(T_v)| \;\le\; 1 - p + K \sum_{i=1}^{p} \mu(v_i) .∣V(Tv​)∣≤1−p+Ki=1∑p​μ(vi​).

This is the inequality obtained in the induction step of the proof of Lemma 4.3 by summing the induction hypotheses for the subtrees rooted at the children; its content is that V(Tv)V(T_v)V(Tv​) is {v}\{v\}{v} together with the disjoint union of the V(Tvi)V(T_{v_i})V(Tvi​​).

Formalization Note ∣V(Tv)∣|V(T_v)|∣V(Tv​)∣ is the subtree size sizeT(v)\mathrm{size}_T(v)sizeT​(v) of the referenced rooted-tree definition; ppp is the number of children of vvv. The paper states the step at the root of the whole tree; stating it at an arbitrary vertex vvv of a fixed tree is the same statement for the subtree TvT_vTv​. Hypotheses (i)–(iii) are carried for uniformity although this step does not use them.

Preamble
import Mathlib
import Definitions.Def_HarelTarjan_Compressed_RootedTree
import Definitions.Def_TreewidthApprox_TreeMeasure_Setting
Formal statement
namespace TreewidthApprox.TreeMeasure

open HarelTarjan.Compressed

theorem summed_bound {V : Type*} [Fintype V] [DecidableEq V] (T : RootedTree V)
    (μ : V → ℝ) (C : ℝ) (hC₀ : 0 < C) (hC₁ : C < 1)
    (h₁ : ∀ v, 1 ≤ μ v)
    (h₂ : ∀ v, ∑ c ∈ children T v, μ c ≤ μ v)
    (h₃ : ∀ v c, IsChild T v c → μ c ≤ C * μ v)
    (v : V)
    (hIH : ∀ c ∈ children T v, (size T c : ℝ) ≤ (1 + 1 / (1 - C)) * μ c - 1) :
    (size T v : ℝ) ≤
      1 - ((children T v).card : ℝ) + (1 + 1 / (1 - C)) * ∑ c ∈ children T v, μ c := by sorry

end TreewidthApprox.TreeMeasure
Source
Bodlaender, Drange, Dregi, Fomin, Lokshtanov and Pilipczuk, A c^k n 5-approximation algorithm for treewidth, SIAM J. Comput. 45(2) (2016), p. 350, proof of Lemma 4.3, first paragraph and first display
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