Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bounded two-step reachability in a bipartite incidence system

Proved
KSATSingleFlip.Connect.bounded_bipartite_reach_card

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

In a finite-neighbor bipartite incidence system, suppose every variable has at most DDD incident clauses and every clause has at most kkk variables. Starting from one variable, at most ∑i=0r(Dk)i\sum_{i=0}^{r}(Dk)^i∑i=0r​(Dk)i variables are reachable by at most rrr variable–clause–variable steps. This provides a path-counting ingredient for the factor-ball bounds in Lemma 2.7.

Preamble
import Definitions.Def_KSATSingleFlip_Connect_BoundedReach

open scoped Classical BigOperators
Formal statement
namespace KSATSingleFlip.Connect

/-- Two-step reachability in a bounded bipartite incidence system. -/
theorem bounded_bipartite_reach_card {V C : Type} [DecidableEq V] [DecidableEq C]
    (clauses : V → Finset C) (scope : C → Finset V)
    (root : V) (D k r : ℕ)
    (hD : ∀ v, (clauses v).card ≤ D) (hk : ∀ c, (scope c).card ≤ k) :
    (boundedReachBall (fun v => (clauses v).biUnion scope) root r).card ≤
      ∑ i ∈ Finset.range (r + 1), (D*k)^i := by
  sorry

end KSATSingleFlip.Connect
Source
Auxiliary path-counting bound for Lemma 2.7 in Wang, Yin, Yu, Zhang, Single-Variable Connectivity in Random k-SAT, printed pp. 12–13, 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