Existence of the exact bijunctive algorithm output law
ProvedStabilityDichotomies.Bijunctive.bijunctive_output_law_existsconstraint-satisfactionprobability
For every fixed correct two-CNF representation and ε > 0, there is a semantic solver whose output distribution is exactly the product-measure law of Definition 4.8 on satisfiable inputs. This establishes normalization and solver-law existence, but makes no claim about approximation, sensitivity, or executable runtime.
Preamble
import Definitions.Def_StabilityDichotomies_Approximability_BijunctiveLaw noncomputable section open scoped Classical open MeasureTheory StabilityDichotomies.Solvability StabilityDichotomies.Bijunctive
Formal statement
theorem StabilityDichotomies.Bijunctive.bijunctive_output_law_exists (Γ : Language) (rep : TwoCNFRepresentation Γ)
(ε : ℝ) (hε : 0 < ε) : ∃ A : Solver Γ, BijunctiveOutputLaw Γ rep ε A := by sorrySource
Wang and Yoshida, Stability Dichotomies for Boolean Constraint Satisfaction Problems, STOC 2027 submission #535, Definition 4.8, p. 19, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/535.pdf