Lemma 6.2 — unbounded submodular width implies unbounded clique embedding power
OpenSparseIncidenceHom.WidthComparison.Supplement.lemma_6_2clique-embeddingshypergraphsp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1submodular-width
Every class of hypergraphs of unbounded submodular width has unbounded clique embedding power: if for every some has , then for every some has .
No recursive enumerability is assumed. With Lemma 6.1 it gives the hardness clause of Theorem 1.4.
Formalization Note Classes are sets of hypergraph codes with membership up to isomorphism, as in the definition item SparseIncidenceHom.WidthComparison.Supplement.Problems.
Differences from the source:
- generalization: every member of a hypergraph class is nonempty and connected (p. 7: "We assume input hypergraphs are nonempty and connected") → classes may contain empty or disconnected hypergraphs (every H_A of a structure, published FiniteHypergraph without InputHypergraph); reason: on a class of nonempty connected hypergraphs the Lean statement is the source's; widths, incidence degeneracy, boundedness of α and Hom decompose over connected components, and the empty hypergraph has every width 0
- encoding: a class of hypergraphs → a set of hypergraph codes (n, edge lists), H belonging to it when some code describes H up to isomorphism; reason: Lean convention for classes; subw and emb are isomorphism invariant
Preamble
import Mathlib import Definitions.Def_SparseIncidenceHom_WidthComparison_Supplement_Problems
Formal statement
namespace SparseIncidenceHom.WidthComparison.Supplement
open SparseIncidenceHom.WidthComparison
/-- Lanzinger, STOC 2027 submission #662, Lemma 6.2, p. 21. No recursive enumerability. -/
theorem lemma_6_2 (𝓗 : HypergraphClass)
(hsubw : ¬ BoundedWidth 𝓗 (fun _ H => submodularWidth H)) :
¬ BoundedWidth 𝓗 (fun _ H => cliqueEmbeddingPower H) := by sorry
end SparseIncidenceHom.WidthComparison.Supplement
Source
Matthias Lanzinger, STOC 2027 submission #662 (October 2026), p. 21, Lemma 6.2; proof p. 27