Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Supermodular finite-difference telescoping inequality

Proved
ZeroFreeRRG.Hardcore.finite_supermodular_telescoping

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

Let vvv be a real-valued function of finite sets whose mixed difference is nonnegative whenever two new elements are inserted. For every finite set SSS,

v(S)≥v(∅)+∑i∈S(v({i})−v(∅)).v(S)\ge v(\varnothing)+\sum_{i\in S}(v(\{i\})-v(\varnothing)).v(S)≥v(∅)+i∈S∑​(v({i})−v(∅)).

This is the finite telescoping inequality underlying the supermodularity step in the hardcore Bethe monotonicity argument.

Preamble
import Mathlib
open scoped BigOperators
Formal statement
namespace ZeroFreeRRG.Hardcore
theorem finite_supermodular_telescoping {ι : Type} [DecidableEq ι] (v : Finset ι → ℝ)
    (hSM : ∀ S : Finset ι, ∀ i j, i ∉ S → j ∉ S → i ≠ j →
      v (insert i (insert j S)) + v S ≥ v (insert i S)+v (insert j S))
    (S : Finset ι) :
    v S ≥ v ∅ + ∑ i ∈ S, (v {i} - v ∅) := by sorry
end ZeroFreeRRG.Hardcore
Source
Chen, Wang, and Zhang, Zero-Freeness for Random Regular Graphs up to the Replica Symmetry Breaking Threshold, https://github.com/sigact-stoc/stoc2027/releases/download/papers-2/1461.pdf, proof of Lemma 4.17, printed p. 30.

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