Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Degree-truncated variable reachability in factor graphs

Definition
KSATSingleFlip_Connect_GoodReach

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

In a factor graph, retain the outgoing clause incidences of variables whose full-formula degree is at most DDD, and give variables above the cutoff no outgoing incidences. The degree-truncated variable reachability set consists of variables reachable from a root in at most rrr variable–clause–variable steps through these directed incidences.

Definition code
import Definitions.Def_KSATSingleFlip_Connect_FactorGraph
import Definitions.Def_KSATSingleFlip_Connect_BoundedReach

noncomputable section
open scoped Classical BigOperators
namespace KSATSingleFlip.Connect

/-- The incident clauses of a variable whose full-formula degree is at most D;
variables above the cutoff have no outgoing edges. -/
def goodIncidentClauses {n : ℕ} (Φ : GFormula (Fin n)) (D : ℕ) (u : Fin n) : Finset (Fin Φ.length) :=
  if degree Φ u ≤ D then Finset.univ.filter (fun c => u ∈ vbl (Φ.get c)) else ∅

/-- Variables reachable through at most r variable–clause–variable steps
whose departure variables satisfy the degree cutoff. -/
def goodVariableReach {n : ℕ} (Φ : GFormula (Fin n)) (D : ℕ) (u : Fin n) (r : ℕ) : Finset (Fin n) :=
  boundedReachBall (fun v => (goodIncidentClauses Φ D v).biUnion (fun c => vbl (Φ.get c))) u r

end KSATSingleFlip.Connect
Source
Auxiliary definition 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