Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.3 — a rooted tree with a measure μ ≥ 1, superadditive over children and shrinking by C < 1 to each child, has at most (1 + 1/(1−C))μ(r) − 1 vertices

Proved
TreewidthApprox.TreeMeasure.lemma_4_3

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. Suppose μ:V(T)→R\mu : V(T) \to \mathbb Rμ:V(T)→R is a measure on its vertices and CCC is a real constant with 0<C<10 < C < 10<C<1 such that:

  1. μ(v)≥1\mu(v) \ge 1μ(v)≥1 for every v∈V(T)v \in V(T)v∈V(T);
  2. for every vertex vvv with children v1,v2,…,vpv_1, v_2, \dots, v_pv1​,v2​,…,vp​ (possibly p=0p = 0p=0), ∑i=1pμ(vi)≤μ(v)\sum_{i=1}^{p} \mu(v_i) \le \mu(v)∑i=1p​μ(vi​)≤μ(v);
  3. for every two vertices v,v′v, v'v,v′ such that vvv is the parent of v′v'v′, μ(v′)≤C⋅μ(v)\mu(v') \le C \cdot \mu(v)μ(v′)≤C⋅μ(v).

Then

∣V(T)∣  ≤  (1+11−C)μ(r)−1.|V(T)| \;\le\; \Bigl(1 + \frac{1}{1-C}\Bigr)\mu(r) - 1 .∣V(T)∣≤(1+1−C1​)μ(r)−1.

In the paper this bounds the number of nodes of the partial tree decomposition built by the algorithm FindPartialTD, applied with μ(i)=wi/log⁡n\mu(i) = w_i / \log nμ(i)=wi​/logn; it turns a measure that is superadditive over children and decays geometrically along every root-to-leaf path into a linear bound on the size of the tree.

Formalization Note The rooted tree is the referenced HarelTarjan.Compressed.RootedTree: a finite vertex type VVV with a root and a parent map in which every vertex reaches the root, with the convention p(r)=rp(r) = rp(r)=r; ∣V(T)∣|V(T)|∣V(T)∣ is the cardinality of VVV. "ccc is a child of vvv" means c≠rc \ne rc=r and p(c)=vp(c) = vp(c)=v. The paper's "there exists a constant 0<C<10 < C < 10<C<1" is a given constant CCC with hypotheses 0<C0 < C0<C and C<1C < 1C<1, because the conclusion is stated with that CCC; the hypothesis C<1C < 1C<1 also keeps the real division 1/(1−C)1/(1-C)1/(1−C) from being the Lean default 1/0=01/0 = 01/0=0.

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

open HarelTarjan.Compressed

theorem lemma_4_3 {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) :
    (Fintype.card V : ℝ) ≤ (1 + 1 / (1 - C)) * μ T.root - 1 := 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. 349, Lemma 4.3
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