Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.6 — fusing two consecutive row parts does not increase the mixed value of C

Proved
TwinWidthI.GridThm.lemma_5_6

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

divisionmatrixmixed-valuep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1twin-width

Let MMM be an n×mn\times mn×m matrix over a finite alphabet, R\mathcal RR a row-division of MMM (every part consists of consecutive rows), and CCC a set of consecutive columns. Let X,X′∈RX,X'\in\mathcal RX,X′∈R be consecutive parts, i.e. the last row of XXX is immediately followed by the first row of X′X'X′, and let R′\mathcal R'R′ be the row-division obtained by replacing XXX and X′X'X′ by X∪X′X\cup X'X∪X′. Then the mixed value of CCC does not increase:

mv⁡(C,R′) ≤ mv⁡(C,R),\operatorname{mv}(C,\mathcal R')\ \le\ \operatorname{mv}(C,\mathcal R),mv(C,R′) ≤ mv(C,R),

where mv⁡(C,R)\operatorname{mv}(C,\mathcal R)mv(C,R) is the number of mixed zones Ri∩CR_i\cap CRi​∩C plus the number of mixed cuts of CCC on R\mathcal RR.

This monotonicity is what lets the greedy fusion procedure of Lemma 5.7 keep the mixed value of every column part under control while fusing row parts.

Formalization Note "Consecutive" is stated as: there are a∈Xa\in Xa∈X, b∈X′b\in X'b∈X′ with a=max⁡Xa=\max Xa=maxX, b=min⁡X′b=\min X'b=minX′ and b=a+1b=a+1b=a+1. R′\mathcal R'R′ is any Finpartition whose parts are those of R\mathcal RR with X,X′X,X'X,X′ replaced by X∪X′X\cup X'X∪X′.

Preamble
import Mathlib
import Definitions.Def_TwinWidthI_GridThm_Setting
Formal statement
namespace TwinWidthI.GridThm

/-- Lemma 5.6, p. 3:20: fusing two consecutive parts `X`, `X'` of a row-division `R` into one part
(giving `R'`) does not increase the mixed value of a set `C` of consecutive columns on the
row-division. -/
theorem lemma_5_6 {A : Type*} [Fintype A] {n m : ℕ} (M : Matrix (Fin n) (Fin m) A)
    (R R' : Finpartition (Finset.univ : Finset (Fin n))) (hR : IsDivision R)
    (C : Finset (Fin m)) (hC : IsIntervalSet C)
    (X X' : Finset (Fin n)) (hX : X ∈ R.parts) (hX' : X' ∈ R.parts)
    (hcons : ∃ a ∈ X, ∃ b ∈ X', (∀ x ∈ X, x ≤ a) ∧ (∀ y ∈ X', b ≤ y) ∧ (a : ℕ) + 1 = b)
    (hR' : R'.parts = insert (X ∪ X') ((R.parts.erase X).erase X')) :
    mixedValueRow M R' C ≤ mixedValueRow M R C := by sorry

end TwinWidthI.GridThm
Source
Bonnet, Kim, Thomassé and Watrigant, Twin-width I: Tractable FO Model Checking, J. ACM 69(1), Article 3 (2021), p. 3:20, Lemma 5.6
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