Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Single-clause gain is a concave endpoint-zero test

Proved
KSATSingleFlip.Connect.soft_clause_gain_concave

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

For any concave endpoint-zero test ψ and nonnegative coordinates v₀,v₁, the paper’s single-clause gain BₛΨ is concave in s on [0,1] and vanishes at s=0 and s=1. The proof includes zero coordinates.

Preamble
import Definitions.Def_KSATSingleFlip_Connect_SoftFieldClause
import Mathlib
open KSATSingleFlip.Connect Set
set_option autoImplicit false
Formal statement
theorem KSATSingleFlip.Connect.soft_clause_gain_concave (ψ : ℝ → ℝ) (hψ : ConcaveOn ℝ (Icc 0 1) ψ)
    (hψ0 : ψ 0 = 0) (hψ1 : ψ 1 = 0) (v0 v1 : ℝ) (hv0 : 0 ≤ v0) (hv1 : 0 ≤ v1) :
    ConcaveOn ℝ (Icc 0 1) (softClauseGain ψ v0 v1) ∧
      softClauseGain ψ v0 v1 0 = 0 ∧ softClauseGain ψ v0 v1 1 = 0 := by sorry
Source
Wang–Yin–Yu–Zhang, Single-Variable Connectivity in Random k-SAT, proof of Lemma 4.5, 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