Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sparse input and compact flip-list word bounds

Proved
KSATSingleFlip.Connect.sparse_flip_word_bounds

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

If m≤cnm\le cnm≤cn, then a sparse width-kkk instance, initial assignment and requested variable occupy at most 4+(2kc+1)n4+(2kc+1)n4+(2kc+1)n abstract words. If a compact flip list has at most Aln⁡nA\ln nAlnn flips with A≥0A\ge0A≥0, then its initial assignment and flip list occupy at most (1+A)n+1(1+A)n+1(1+A)n+1 abstract words. These are representation-size bounds; they do not establish the existence or running time of an algorithm.

Preamble
import Definitions.Def_KSATSingleFlip_Connect_SparseFlip

open scoped Classical BigOperators
Formal statement
namespace KSATSingleFlip.Connect

/-- Sparse input and logarithmic flip output have linear abstract word size. -/
theorem sparse_flip_word_bounds (n k m c : ℕ) (hn : 0 < n) (hm : m ≤ c * n) :
    sparseFlipInputWords n k m ≤ 4 + (2 * k * c + 1) * n ∧
    ∀ (p : FlipListPath n) (A : ℝ), 0 ≤ A →
      (p.flips.length : ℝ) ≤ A * Real.log n →
      (p.wordCount : ℝ) ≤ (1 + A) * n + 1 := by
  sorry

end KSATSingleFlip.Connect
Source
Wang, Yin, Yu, Zhang, Single-Variable Connectivity in Random k-SAT, compact path representation printed p. 32 (PDF p. 34) and Theorem 1.3 printed p. 4, 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