Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6.5 — heavy, connected terminal cliques force large clique embedding power

Open
SparseIncidenceHom.WidthComparison.Supplement.proposition_6_5

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

clique-embeddingsconnectivityhypergraphsp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let CH>0C_H>0CH​>0 be a constant satisfying inequality (10) of Lemma 6.4 for every k≥2k\ge2k≥2 and every pseudometric on [k][k][k]. Let HHH be a finite hypergraph, μ\muμ a nonnegative vertex weighting of HHH, and K1,…,KkK_1,\dots,K_kK1​,…,Kk​ disjoint cliques of the primal graph P(H)P(H)P(H) with k≥8k\ge8k≥8. Suppose their union is (μ,λ)(\mu,\lambda)(μ,λ)-connected for some λ>0\lambda>0λ>0, and μ(Ki)≥1/2\mu(K_i)\ge1/2μ(Ki​)≥1/2 for every iii. Then

emb⁡(H)≥λk8CHlog⁡k.(12)\operatorname{emb}(H)\ge\frac{\lambda\sqrt k}{8C_H\log k}.\tag{12}emb(H)≥8CH​logkλk​​.(12)

Combined with Lemma 6.3 this shows that unbounded submodular width forces unbounded clique embedding power (Lemma 6.2).

Formalization Note log⁡\loglog is to base two. The constant CHC_HCH​ of Lemma 6.4 enters only through inequality (10), so the statement is made for every positive constant satisfying (10).

Differences from the source:

  • generalization: the hypergraph H is nonempty and connected (p. 7 standing convention) → H is any finite hypergraph (published FiniteHypergraph), possibly empty or disconnected; reason: on nonempty connected H the Lean statement is the source's
  • reading: C_H, the constant of Lemma 6.4 → any C_H > 0 satisfying inequality (10); reason: the source refers to "the" constant of Lemma 6.4, which is any constant for which (10) holds; the proof uses only (10)
Preamble
import Mathlib
import Definitions.Def_SparseIncidenceHom_WidthComparison_Supplement_Widths
Formal statement
namespace SparseIncidenceHom.WidthComparison.Supplement

open SparseIncidenceHom.WidthComparison

/-- Lanzinger, STOC 2027 submission #662, Proposition 6.5, p. 26 (inequality (12)). `C_H` is any
positive constant for which inequality (10) of Lemma 6.4 holds. -/
theorem proposition_6_5 (C_H : ℝ) (hC : 0 < C_H) (hhub : HubBound C_H)
    (V : Type) [Fintype V] (H : FiniteHypergraph V) (μ : V → ℝ) (hμ : ∀ v, 0 ≤ μ v)
    (k : ℕ) (hk : 8 ≤ k) (K : Fin k → Finset V)
    (hclique : ∀ i, (primal H).IsClique (K i : Set V))
    (hdisj : ∀ i j, i ≠ j → Disjoint (K i) (K j))
    (lam : ℝ) (hlam : 0 < lam) (hconn : IsMuLambdaConnected H μ lam (⋃ i, (K i : Set V)))
    (hmass : ∀ i, (1 : ℝ) / 2 ≤ weightOf μ (K i)) :
    lam * Real.sqrt (k : ℝ) / (8 * C_H * logTwo (k : ℝ)) ≤ cliqueEmbeddingPower H := by sorry

end SparseIncidenceHom.WidthComparison.Supplement
Source
Matthias Lanzinger, STOC 2027 submission #662 (October 2026), p. 26, Proposition 6.5 (inequality (12)); proof pp. 26–27

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