Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Total graph-only deletion disagreement probabilities obey the source bound

Proved
StabilityDichotomies.Bijunctive.total_graph_deletion_bit_change_probabilities_bound

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

Sum, over all constraint occurrences and variables, the shared-seed probabilities that deleting only the occurrence’s implication arcs changes the output bit. This total is bounded by rΓ∣C∣(log⁡(2∣V∣)+1)/βr_\Gamma |C|(\log(2|V|)+1)/\betarΓ​∣C∣(log(2∣V∣)+1)/β, with the source exponential rate β\betaβ. The probability form connects the proved graph-change estimate to the Wasserstein coupling split.

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.total_graph_deletion_bit_change_probabilities_bound {Γ : Language} {V : Type} [Fintype V] [Nonempty V]
    (rep : TwoCNFRepresentation Γ) (I : Instance Γ V) (hI : Satisfiable I) (ε : ℝ) (hε : 0 < ε) :
    let μ := bijunctiveSeedMeasure rep I ε
    let mid := fun (j : Fin I.constraints.card) (z : (Fin I.constraints.card → ℝ) × ℝ × (Literal V → ℝ)) v =>
      decide (literalScore rep (thinnedInstance I (fun i => decide (z.1 i ≤ 1 - ε / 2) && decide (i ≠ j)))
          (thinnedInstance I (fun i => decide (z.1 i ≤ z.2.1))) z.2.2 (v,false) <
        literalScore rep (thinnedInstance I (fun i => decide (z.1 i ≤ 1 - ε / 2) && decide (i ≠ j)))
          (thinnedInstance I (fun i => decide (z.1 i ≤ z.2.1))) z.2.2 (v,true))
    (∑ j : Fin I.constraints.card, ∑ v : V,
      (μ {z | bijunctiveOutput rep I ε z.1 z.2.1 z.2.2 v ≠ mid j z v}).toReal) ≤
    (maxArity Γ * I.constraints.card : ℕ) *
      ((Real.log (Fintype.card (Literal V)) + 1) / bijunctiveRate rep ε) := 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, graph-only deletion bound.

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