Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 3:26 — twin-width is the maximum over connected components

Proved
TwinWidthI.MinorFree.twinWidth_components

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

connected-componentsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1twin-width

Let GGG be a finite graph and ddd a nonnegative integer. Then GGG has twin-width at most ddd exactly when every connected component of GGG, with its induced graph, has twin-width at most ddd:

tww⁡(G)≤d⟺∀C∈Comp⁡(G), tww⁡(G[C])≤d.\operatorname{tww}(G)\le d\quad\Longleftrightarrow\quad \forall C\in\operatorname{Comp}(G),\ \operatorname{tww}(G[C])\le d.tww(G)≤d⟺∀C∈Comp(G), tww(G[C])≤d.

This permits the excluded-minor argument to work component by component. The empty graph is included; its contraction sequence ends at the empty partition.

Preamble
import Mathlib
import Definitions.Def_TwinWidthI_MinorFree_Setting
Formal statement
namespace TwinWidthI.MinorFree

/-- The twin-width of a graph is the maximum of that of its connected components (p. 3:26). -/
theorem twinWidth_components {V : Type} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) (d : ℕ) :
    TwinWidthI.BoolWidth.TwinWidthLE G d ↔
      ∀ c : G.ConnectedComponent,
        letI : Fintype c.supp := Fintype.ofFinite c.supp
        letI : DecidableEq c.supp := Classical.decEq c.supp
        TwinWidthI.BoolWidth.TwinWidthLE (G.induce c.supp) d := by sorry

end TwinWidthI.MinorFree
Source
Bonnet, Kim, Thomassé and Watrigant, Twin-width I: Tractable FO Model Checking, J. ACM 69(1), Article 3 (2021), p. 3:26, proof of Theorem 6.3, 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