Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.2, p. 3:14 — contracting two twins across the cut gives a (2N − 1)-partition

Proved
TwinWidthI.BoolWidth.first_contraction_red_degree

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

boolean-widthp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1twin-width

Let GGG be a finite simple graph on VVV, let (A,B)(A,B)(A,B) be a partition of VVV (that is, A∩B=∅A\cap B=\emptysetA∩B=∅ and A∪B=VA\cup B=VA∪B=V), and let N≥0N\ge 0N≥0 with ∣A∣≤2N|A|\le 2N∣A∣≤2N. Let u≠vu\neq vu=v be two vertices of AAA with the same neighbourhood in BBB. Let P\mathcal PP be the partition of VVV whose parts are {u,v}\{u,v\}{u,v} and the singletons {w}\{w\}{w}, w∉{u,v}w\notin\{u,v\}w∈/{u,v} (the partition after contracting uuu and vvv). Then P\mathcal PP is a (2N−1)(2N-1)(2N−1)-partition: every part of P\mathcal PP is non-homogeneous to at most

2N−12N-12N−1

other parts.

With N=2kN=2^kN=2k this is the paper's claim that after the first contraction all red edges lie within AeA_eAe​, so the red degree is at most 2k+1−12^{k+1}-12k+1−1.

Formalization Note. The contracted graph G/u,vG/u,vG/u,v is represented by the partition P\mathcal PP (partition form of twin-width); the hypothesis hP fixes its parts. The subtraction 2N−12N-12N−1 is in N\mathbb NN; it is exact whenever the hypotheses hold, since u∈Au\in Au∈A forces N≥1N\ge 1N≥1.

Preamble
import Mathlib
import Definitions.Def_TwinWidthI_BoolWidth_Setting
Formal statement
namespace TwinWidthI.BoolWidth

open Finset

theorem first_contraction_red_degree {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) (A B : Finset V) (hAB : Disjoint A B) (hcover : A ∪ B = univ)
    (N : ℕ) (hA : #A ≤ 2 * N) (u v : V) (hu : u ∈ A) (hv : v ∈ A) (huv : u ≠ v)
    (htwin : ∀ b ∈ B, (G.Adj u b ↔ G.Adj v b))
    (P : Finpartition (univ : Finset V))
    (hP : P.parts = insert {u, v} (((univ.erase u).erase v).image fun w => ({w} : Finset V))) :
    IsDPartition G P (2 * N - 1) := by sorry

end TwinWidthI.BoolWidth
Source
Bonnet, Kim, Thomassé and Watrigant, Twin-width I: Tractable FO Model Checking, J. ACM 69(1), Article 3 (2021), p. 3:14, proof of Theorem 4.2, "The only red edges in G/u,v are within A_e, so the red degree is bounded by 2^{k+1} − 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