Markov transition law of the fully suppressed execution
ProvedCountingLLL.ReciprocalTest.suppressed_history_transitionformalizationprobability
For any event determined by the complete finite state history of the fully suppressed ReciprocalTest execution, the joint probability of that event, the current state, and a given next state factors into the history-and-current-state probability times the suppressed transition mass. This is the finite-history Markov property with no division by conditioning probabilities.
Preamble
import Definitions.Def_CountingLLL_ReciprocalSuppressedTransition open MeasureTheory ProbabilityTheory CountingLLL.ReciprocalTest open scoped ENNReal
Formal statement
theorem CountingLLL.ReciprocalTest.suppressed_history_transition (B : ℝ≥0∞) (hB : B ≤ 1) (n : ℕ)
(H : (Fin (n+1) → State) → Prop) (s s' : State) :
entropyLaw B {ω | H (fun j => allSuppressedRun ω j.val) ∧
allSuppressedRun ω n = s ∧ allSuppressedRun ω (n+1) = s'} =
entropyLaw B {ω | H (fun j => allSuppressedRun ω j.val) ∧
allSuppressedRun ω n = s} * suppressedTransitionMass B s s' := by sorrySource
Liu, Wang, Yin, Zhang, Zhou, A Counting and Sampling Lovász Local Lemma, STOC submission #442, §6.2, Lemma 6.5; Markov law of the suppressed execution.