Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Abstract Lovász Local Lemma for valuations on a bounded lattice (asymmetric form)

Proved
QLLL.Valuation.lll

by sattath · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

lattice-theorylovasz-local-lemmaquantum-lll

Let LLL be a bounded lattice and let R:L→RR : L \to \mathbb{R}R:L→R be a valuation: RRR is nonnegative, monotone and modular, R(x)+R(y)=R(x∨y)+R(x∧y)R(x) + R(y) = R(x \vee y) + R(x \wedge y)R(x)+R(y)=R(x∨y)+R(x∧y), with R(⊤)=1R(\top) = 1R(⊤)=1 and R(⊥)=0R(\bot) = 0R(⊥)=0 (definition bundle QLLL_LocalLemma_Basic). Meets x∧yx \wedge yx∧y play the role of intersections of events or subspaces.

Let X1,…,Xn∈LX_1, \dots, X_n \in LX1​,…,Xn​∈L and let Γ(1),…,Γ(n)⊆{1,…,n}\Gamma(1), \dots, \Gamma(n) \subseteq \{1, \dots, n\}Γ(1),…,Γ(n)⊆{1,…,n} form a dependency graph: for every iii and every set SSS of indices with i∉Si \notin Si∈/S and S∩Γ(i)=∅S \cap \Gamma(i) = \emptysetS∩Γ(i)=∅,

R(Xi∧⋀j∈SXj)=R(Xi) R(⋀j∈SXj).R\Big(X_i \wedge \bigwedge_{j \in S} X_j\Big) = R(X_i)\, R\Big(\bigwedge_{j \in S} X_j\Big).R(Xi​∧j∈S⋀​Xj​)=R(Xi​)R(j∈S⋀​Xj​).

Let y1,…,yny_1, \dots, y_ny1​,…,yn​ be real numbers with 0≤yi<10 \le y_i < 10≤yi​<1 such that

R(Xi) ≥ 1−yi∏j∈Γ(i)(1−yj)for every i.R(X_i) \ \ge\ 1 - y_i \prod_{j \in \Gamma(i)} (1 - y_j) \qquad \text{for every } i.R(Xi​) ≥ 1−yi​j∈Γ(i)∏​(1−yj​)for every i.

Then

R(⋀i=1nXi) ≥ ∏i=1n(1−yi).R\Big(\bigwedge_{i=1}^{n} X_i\Big) \ \ge\ \prod_{i=1}^{n} (1 - y_i).R(i=1⋀n​Xi​) ≥ i=1∏n​(1−yi​).

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 RRR to be relative dimension on subspaces gives the quantum local lemma QLLL.quantum_lll; taking RRR 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 iii itself from the independent family (the paper's Definition 12 read literally includes iii when (i,i)∉E(i,i) \notin E(i,i)∈/E, which would force R(Xi)∈{0,1}R(X_i) \in \{0,1\}R(Xi​)∈{0,1}), 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.

Preamble
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 → ℝ}
Formal statement
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
Source
A. Ambainis, J. Kempe, O. Sattath, A Quantum Lovász Local Lemma, J. ACM 59(5):24 (2012), arXiv:0911.1696 (numbering of the arXiv version), Theorem 14 (abstracted to any valuation satisfying Lemma 8 (i), (ii), (iv))

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me