Abstract Lovász Local Lemma for valuations on a bounded lattice (asymmetric form)
ProvedQLLL.Valuation.lllLet be a bounded lattice and let be a valuation: is nonnegative, monotone and modular, , with and (definition bundle QLLL_LocalLemma_Basic). Meets play the role of intersections of events or subspaces.
Let and let form a dependency graph: for every and every set of indices with and ,
Let be real numbers with such that
Then
This is Theorem 14 of Ambainis, Kempe and Sattath in the generality the paper points to after its proof: only properties (i), (ii) and (iv) of Lemma 8 of relative dimension are used. Taking to be relative dimension on subspaces gives the quantum local lemma QLLL.quantum_lll; taking to be uniform probability on events gives the classical asymmetric Lovász Local Lemma QLLL.SAT.classical_lll.
Formalization Note The index set is Fin n. The dependency-graph condition excludes itself from the independent family (the paper's Definition 12 read literally includes when , which would force ), and mutual independence is stated in product form rather than through conditional values as in Definition 9; the two agree whenever the conditional is defined.
import Definitions.Def_QLLL_LocalLemma_Basic
import Mathlib
open QLLL
open Finset
open QLLL.Valuation
variable {α : Type*} [Lattice α] [BoundedOrder α]
variable (R : Valuation α)
variable {n : ℕ} {X : Fin n → α} {Γ : Fin n → Finset (Fin n)} {y : Fin n → ℝ}theorem QLLL.Valuation.lll (hΓ : R.IsDependencyGraph X Γ)
(hy₀ : ∀ i, 0 ≤ y i) (hy₁ : ∀ i, y i < 1)
(hX : ∀ i, 1 - y i * ∏ j ∈ Γ i, (1 - y j) ≤ R (X i)) :
∏ i, (1 - y i) ≤ R (univ.inf X) := by sorry