Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bounded-degree factor-ball cardinality bounds

Proved
KSATSingleFlip.Connect.lemma_2_7_ball_bounds

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

Let every clause have at most kkk variables, with k,r,D≥1k,r,D\ge1k,r,D≥1, and set

Mr,D=∑h=0r+1(kD)h.M_{r,D}=\sum_{h=0}^{r+1}(kD)^h.Mr,D​=h=0∑r+1​(kD)h.

If the radius-2r2r2r factor ball around a variable vvv is a tree and every variable in it has full-formula degree at most DDD, then the number of variable and clause vertices in that ball is at most Mr,DM_{r,D}Mr,D​. For any fixed variable uuu, at most Mr,DM_{r,D}Mr,D​ such locally tree-structured balls contain uuu. These are the two cardinality statements in (2.1); the separate clause-insertion/deletion sensitivity statement of Lemma 2.7 is not included.

Preamble
import Definitions.Def_KSATSingleFlip_Connect_FactorGraph

open scoped Classical BigOperators
Formal statement
namespace KSATSingleFlip.Connect

/-- The two cardinality bounds in (2.1) of Lemma 2.7. The separate
clause-insertion sensitivity conclusion is not part of this target. -/
theorem lemma_2_7_ball_bounds {n : ℕ} (Φ : GFormula (Fin n)) (k r D : ℕ)
    (hk : 1 ≤ k) (hr : 1 ≤ r) (hD : 1 ≤ D)
    (hwidth : ∀ c : Fin Φ.length, (vbl (Φ.get c)).card ≤ k) :
    (∀ v, LocallyTree Φ v r D →
      (ballVars Φ v r).card + (ballIdx Φ v r).card ≤
        ∑ h ∈ Finset.range (r + 2), (k * D)^h) ∧
    (∀ u, (Finset.univ.filter fun v : Fin n =>
      LocallyTree Φ v r D ∧ u ∈ ballVars Φ v r).card ≤
        ∑ h ∈ Finset.range (r + 2), (k * D)^h) := by
  sorry

end KSATSingleFlip.Connect
Source
Wang, Yin, Yu, Zhang, Single-Variable Connectivity in Random k-SAT, Lemma 2.7, equation (2.1), printed pp. 12–13 (PDF pp. 14–15), STOC 2027 submission #737, 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