Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 4.3, p. 349 — base case: a single-vertex (sub)tree satisfies the bound by (i)

Proved
TreewidthApprox.TreeMeasure.base_case

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, and let μ:V(T)→R\mu : V(T) \to \mathbb Rμ:V(T)→R and 0<C<10 < C < 10<C<1 satisfy the hypotheses of Lemma 4.3:

  1. μ(v)≥1\mu(v) \ge 1μ(v)≥1 for every vertex vvv;
  2. ∑c∈ch(v)μ(c)≤μ(v)\sum_{c \in \mathrm{ch}(v)} \mu(c) \le \mu(v)∑c∈ch(v)​μ(c)≤μ(v) for every vertex vvv, where ch(v)\mathrm{ch}(v)ch(v) is the set of children of vvv;
  3. μ(c)≤C μ(v)\mu(c) \le C\,\mu(v)μ(c)≤Cμ(v) whenever vvv is the parent of ccc.

If a vertex vvv has no children, then the subtree TvT_vTv​ rooted at vvv consists of vvv alone and satisfies the bound of Lemma 4.3:

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

This is the base case of the induction on the size of the tree in the proof of Lemma 4.3.

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 (the number of descendants of vvv, including vvv). The paper's base case is a tree with one vertex; here it is a leaf vvv of a fixed tree TTT, whose subtree is that one-vertex tree. Hypotheses (ii) and (iii) are carried for uniformity with the other steps of the proof.

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

open HarelTarjan.Compressed

theorem base_case {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) (hleaf : children T v = ∅) :
    (size T v : ℝ) ≤ (1 + 1 / (1 - C)) * μ v - 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, proof of Lemma 4.3, first paragraph (base case |V(T)| = 1)
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