Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.10 — Moser–Tardos lower bound for F_L from uniform initialization

Open
MTWalkSAT3CNF.TwoOcc.Supplement.proposition_4_10

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

p2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1randomized-algorithmssatisfiability

Let L≥40L\ge40L≥40 be an integer and let RRR be any legal history-adaptive clause-selection rule for Moser–Tardos on FLF_LFL​. Under independent uniform initialization,

E[TMT(FL)]≥2((3/2)L−1)27(1516)3(L−1).E[T_{MT}(F_L)]\ge\frac{2((3/2)^L-1)}{27}\left(\frac{15}{16}\right)^{3(L-1)}.E[TMT​(FL​)]≥272((3/2)L−1)​(1615​)3(L−1).

Every clause resampling counts as an update, including one that changes no bit. Infinite expected hitting time is allowed. This is the MT counterpart of the WalkSAT lower bound.

Differences from the source:

  • encoding: one-based branch/module indices and indexed conjunctions → zero-based Fin indices and a bijective reindexing of the constructed clause family, retaining duplicate clauses; reason: only variable and clause labels change; every source instance is preserved
  • encoding: possibly infinite algorithmic hitting times and expectations → published ℕ∞ hitting times and ℝ≥0∞ lower integrals; finite real bounds embedded by ENNReal.ofReal; reason: preserves infinite runtimes and is equivalent to each displayed nonnegative bound
Preamble
import Definitions.Def_MTWalkSAT3CNF_TwoOcc_Supplement_Hard

set_option autoImplicit false
open MeasureTheory
open scoped ENNReal
Formal statement
namespace MTWalkSAT3CNF.TwoOcc.Supplement

theorem proposition_4_10 (L : ℕ) (hL : 40 ≤ L)
    (R : MTRule (cnfSystem (hardFormula L hL))) :
    ENNReal.ofReal (2*(((3:ℝ)/2)^L-1)/27 * ((15:ℝ)/16)^(3*(L-1))) ≤
      (cnfSystem (hardFormula L hL)).expectedTime R := by sorry

end MTWalkSAT3CNF.TwoOcc.Supplement
Source
Minbo Gao, Kun He, Tao Jiang, STOC 2027 submission #914 (October 2026), Proposition 4.10, p. 23; https://github.com/sigact-stoc/stoc2027/releases/download/papers-2/914.pdf

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