Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Contracted walk: number of changes before absorption

Proved
CountingLLL.ContractedWalk.stopped_change_bound

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

combinatoricsprobability

Consider the absorbed walk with upward steps of two and downward steps of one, started at level 2j−12j-12j−1 with j≥1j\geq 1j≥1. If it reaches zero, and NNN is the initial counter jjj plus the number of upward steps before absorption, then at most 3N3N3N changes occur before absorption. This is a pathwise bound for the abstract contracted walk, not a coupling with the original algorithm.

Preamble
import Definitions.Def_CountingLLL_ContractedGF
open CountingLLL.ContractedWalk
Formal statement
theorem CountingLLL.ContractedWalk.stopped_change_bound (ω : Tape) (j : ℕ) (hj : 1 ≤ j) (h : ∃ t, level ω (2*j-1) t = 0) : stopTime ω (2*j-1) ≤ 3 * (j + upwardCount ω (2*j-1)) := by sorry
Source
Liu, Wang, Yin, Zhang and Zhou, A Counting and Sampling Lovász Local Lemma, STOC #442, proof of Lemma 6.5, computational overhead, p. 28, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/442.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