Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6.6 — Every MT hitting-time bound: fixed initialization, both uniform mean bounds and the uniform tail

Open
MTWalkSAT3CNF.TwoOcc.Supplement.proposition_6_6

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

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

For GGG satisfying the §6 graph conditions, write N=∣V∣N=|V|N=∣V∣ and use uniform clause selection in MT on F(G)F(G)F(G). For every fixed initial assignment σ\sigmaσ, with active set S(σ)S(\sigma)S(σ),

Eσ[TMT]≤3684(N−∣S(σ)∣).E_\sigma[T_{MT}]\le3684(N-|S(\sigma)|).Eσ​[TMT​]≤3684(N−∣S(σ)∣).

Under independent uniform initialization of every variable, including auxiliary bits,

3N4≤E[TMT]≤2763N,P(TMT>7368N)≤exp⁡(−N/58944).\frac{3N}{4}\le E[T_{MT}]\le2763N,\qquad P(T_{MT}>7368N)\le\exp(-N/58944).43N​≤E[TMT​]≤2763N,P(TMT​>7368N)≤exp(−N/58944).

The mean lower bound, mean upper bound and tail estimate are all retained. The fixed-initialization statement uses the published step kernel with a Dirac initial law.

Differences from the source:

  • generalization: G is a graph of the explicitly constructed family in Lemma 6.2 → any finite simple connected 102-regular graph with λ₁=102 and every other adjacency eigenvalue of absolute value less than 21; reason: every graph in the source family satisfies exactly these conditions; the proofs use only these graph properties
  • encoding: vertices, indexed gadget clauses and Boolean assignments → vertices Fin N, finite sum/product index types and Bool-valued assignments including every auxiliary bit; reason: finite bijective labels change no instance and both orientations of each edge are retained
  • 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_Expander

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

theorem proposition_6_6 {N : ℕ} (G : SimpleGraph (Fin N)) (hG : GoodGraph G) :
    (∀ σ : ExpVar N → Bool,
      mtMeanFrom (expFormula G) (uniformRuleMT (expFormula G)) σ ≤
        ENNReal.ofReal (3684*((N:ℝ)-(active σ).card))) ∧
    ENNReal.ofReal (3*(N:ℝ)/4) ≤
      (cnfSystem (expFormula G)).expectedTime (uniformRuleMT (expFormula G)) ∧
    (cnfSystem (expFormula G)).expectedTime (uniformRuleMT (expFormula G)) ≤
      ENNReal.ofReal (2763*(N:ℝ)) ∧
    (cnfSystem (expFormula G)).mtLaw (uniformRuleMT (expFormula G))
      {ω | (7368*N : ℕ∞) < (cnfSystem (expFormula G)).mtTimeOf ω} ≤
        ENNReal.ofReal (Real.exp (-(N:ℝ)/58944)) := by sorry

end MTWalkSAT3CNF.TwoOcc.Supplement
Source
Minbo Gao, Kun He, Tao Jiang, STOC 2027 submission #914 (October 2026), Proposition 6.6, p. 39; 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