Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every clique lies in a bag of a finite tree decomposition

Proved
StableMSR.Recovery.clique_in_decomposition_bag

by lreyzin · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

clusteringgraph-theorytreewidth

Let GGG be a graph and let (T,(Xt)t∈V(T))(T,(X_t)_{t\in V(T)})(T,(Xt​)t∈V(T)​) be a tree decomposition with a finite, nonempty decomposition tree. Every finite clique KKK of GGG is contained in one bag:

∃t∈V(T),K⊆Xt.\exists t\in V(T),\qquad K\subseteq X_t.∃t∈V(T),K⊆Xt​.

The empty clique is included. The graph GGG itself need not be finite.

This is the bag-placement fact used to assign the clustering algorithm's clique-supported constraints and contributions to individual bags. The proof establishes the Helly property of nonempty path-convex vertex sets in a finite tree, then applies it to the bag occurrences of the clique vertices. It uses the canonical path-based definition of tree decomposition.

Preamble
import Definitions.Def_RobertsonSeymour1986_GM5_IsTreeDecomposition

set_option autoImplicit false
open scoped Classical
Formal statement
namespace StableMSR.Recovery

theorem clique_in_decomposition_bag {V T : Type} [DecidableEq V] [Fintype T] [DecidableEq T]
    (G : SimpleGraph V) (tree : SimpleGraph T) (bags : T → Finset V)
    (htd : RobertsonSeymour1986.GM5.IsTreeDecomposition G tree bags)
    (K : Finset V) (hK : (K : Set V).Pairwise G.Adj) :
    ∃ t : T, K ⊆ bags t := by sorry

end StableMSR.Recovery
Source
Ravichandran and Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, https://arxiv.org/html/2611.03547v1, Appendix A.6, tree-decomposition paragraph: every clique lies in a bag, so constraints and contributions can be assigned to containing bags. The finite-tree Helly argument is formalized directly.

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