Positive chance of a counter decrease from a loop state
ProvedCountingLLL.ReciprocalTest.suppressed_loop_decreaseformalizationprobability
At any fully suppressed loop state with a positive first counter, the joint probability of an arbitrary finite past history and a decrease within three steps is at least B/2 times the probability of that history and state. The result is valid for all B at most one and does not divide by a conditioning probability.
Preamble
import Definitions.Def_CountingLLL_ReciprocalSuppressedTransition open MeasureTheory ProbabilityTheory CountingLLL.ReciprocalTest open scoped ENNReal
Formal statement
theorem CountingLLL.ReciprocalTest.suppressed_loop_decrease (B : ℝ≥0∞) (hB : B ≤ 1) (n : ℕ)
(H : (Fin (n+1) → State) → Prop) (s : State)
(hs : s.phase = .loop) (hi : 0 < s.i) :
entropyLaw B {ω | H (fun j => allSuppressedRun ω j.val) ∧ allSuppressedRun ω n = s} * (B/2) ≤
entropyLaw B {ω | H (fun j => allSuppressedRun ω j.val) ∧ allSuppressedRun ω n = s ∧
(allSuppressedRun ω (n+3)).i < s.i} := by sorrySource
Liu, Wang, Yin, Zhang, Zhou, A Counting and Sampling Lovász Local Lemma, STOC submission #442, Algorithm 6 and Lemma 6.5; bounded-time progress toward almost-sure nonsticking.