ReciprocalTest uses positive uniform ranges
ProvedCountingLLL.ReciprocalTest.uniform_size_positivealgorithms
For every entropy realization and every execution step of Algorithm 6, when the algorithm requests a uniform draw on , its counter satisfies . Consequently, the finite distribution used by the operational model has exactly the intended outcomes.
Preamble
import Definitions.Def_CountingLLL_ReciprocalTest open CountingLLL.ReciprocalTest
Formal statement
theorem CountingLLL.ReciprocalTest.uniform_size_positive (ω : Entropy) (n : ℕ) (h : (run ω n).phase = .uniformCheck) : 0 < (run ω n).j := by sorry
Source
Liu, Wang, Yin, Zhang and Zhou, A Counting and Sampling Lovász Local Lemma, STOC 2027 #442, Algorithm 6, line 14, PDF p. 27, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/442.pdf