Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Insertion sensitivity bounds one-clause replacement

Proved
KSATSingleFlip.Connect.insertion_implies_replacement

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

If inserting one element at any position in a marked-clause list changes an observable by at most L, then changing any single coordinate of a fixed-length list changes it by at most 2L. This is the deletion-and-insertion step needed for the bounded-differences estimate in Lemma 2.6.

Preamble
import Mathlib
set_option autoImplicit false
Formal statement
theorem KSATSingleFlip.Connect.insertion_implies_replacement {A : Type} (j : ℕ) (F : List A → ℝ) (L : ℝ)
    (hins : ∀ (xs : List A) (i : ℕ) (a : A), |F (xs.insertIdx i a) - F xs| ≤ L)
    (x : Fin j → A) (i : Fin j) (a : A) :
    |F (List.ofFn x) - F (List.ofFn (Function.update x i a))| ≤ 2*L := by sorry
Source
Wang–Yin–Yu–Zhang, Single-Variable Connectivity in Random k-SAT, Lemma 2.6, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/737.pdf

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