Existence and approximation guarantee for the thinning output law
ProvedStabilityDichotomies.Solvability.thinning_algorithm_approximationalgorithmsconstraint-satisfactionprobability
For any Horn or dual-Horn Boolean constraint language Γ and any 0 < ε ≤ 1, there exists a semantic solver with the exact thinning output law of Definition 4.2 that satisfies at least a 1−ε fraction of constraint occurrences in expectation on each satisfiable input. This is the existence and approximation portion of Theorem 4.3. It makes no claim about sensitivity or an executable implementation.
Preamble
import Definitions.Def_StabilityDichotomies_Approximability_Thinning noncomputable section open scoped Classical open StabilityDichotomies.Solvability
Formal statement
theorem StabilityDichotomies.Solvability.thinning_algorithm_approximation (Γ : Language) (b : Bool)
(hΓ : ∀ R ∈ Γ.relations, ∀ x y : Fin R.arity → Bool,
x ∈ R.tuples → y ∈ R.tuples →
(fun i => if b then x i || y i else x i && y i) ∈ R.tuples)
(ε : ℝ) (hε : 0 < ε) (hε1 : ε ≤ 1) :
∃ A : Solver Γ, ThinningOutputLaw Γ b ε A ∧ Approximates A ε := by sorrySource
Wang and Yoshida, Stability Dichotomies for Boolean Constraint Satisfaction Problems, STOC 2027 submission #535, Definition 4.2 and Theorem 4.3, p. 16, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/535.pdf