Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Increasing occurrence-mask feasibility chains obey the harmonic change bound

Proved
StabilityDichotomies.Bijunctive.thinning_feasibility_chain_total_changes_harmonic_bound

by wcysai · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

Fix any first-stage occurrence mask and any increasing chain of occurrence masks extending it. With its implication graph fixed and iid exponential shifts, the sum over chain steps and variables of the feasible-root output-change probabilities is at most rΓ∣C∣H2∣V∣r_\Gamma |C|H_{2|V|}rΓ​∣C∣H2∣V∣​. This specializes equation (8) to the actual occurrence-mask representation used by the algorithm.

Preamble
import Definitions.Def_StabilityDichotomies_Approximability_BijunctiveLaw
open scoped Classical ENNReal BigOperators
open MeasureTheory ProbabilityTheory Set Function StabilityDichotomies.Solvability StabilityDichotomies.Bijunctive
Formal statement
theorem StabilityDichotomies.Bijunctive.thinning_feasibility_chain_total_changes_harmonic_bound {Γ : Language} {V : Type} [Fintype V]
    (rep : TwoCNFRepresentation Γ) (I : Instance Γ V) (hI : Satisfiable I)
    (m : ℕ → Fin I.constraints.card → Bool) (k : ℕ)
    (hbase : ∀ i ≤ k, ∀ j, m 0 j = true → m i j = true)
    (hchain : ∀ i < k, ∀ j, m i j = true → m (i+1) j = true)
    (β : ℝ) (hβ : 0 < β) :
    (∑ i ∈ Finset.range k, ∑ v : V,
      (Measure.pi (fun _ : Literal V => expMeasure β)
        {δ : Literal V → ℝ |
          decide (literalScore rep (thinnedInstance I (m 0)) (thinnedInstance I (m i)) δ (v,false) <
            literalScore rep (thinnedInstance I (m 0)) (thinnedInstance I (m i)) δ (v,true)) ≠
          decide (literalScore rep (thinnedInstance I (m 0)) (thinnedInstance I (m (i+1))) δ (v,false) <
            literalScore rep (thinnedInstance I (m 0)) (thinnedInstance I (m (i+1))) δ (v,true))}).toReal) ≤
      (maxArity Γ * I.constraints.card : ℕ) * (harmonic (Fintype.card (Literal V)) : ℝ) := by
  sorry
Source
Wang and Yoshida, Stability Dichotomies for Boolean CSPs, STOC 2027, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/535.pdf, proof of Theorem 4.9, equation (8).

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