Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Contracted-walk upward counts split at the first unit hit

Proved
CountingLLL.ContractedWalk.upward_count_segment

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

algorithmsprobability

For a contracted-walk path from level m+1m+1m+1, split at the first time the coupled walk from level one reaches zero. If both that unit path and the remaining shifted path from level mmm reach zero, the total number of upward moves is the sum of their upward counts. This is the pathwise segmentation used to factor the paper’s generating functions.

Preamble
import Definitions.Def_CountingLLL_ContractedGF
open CountingLLL.ContractedWalk
Formal statement
theorem CountingLLL.ContractedWalk.upward_count_segment (ω : Tape) (m : ℕ) (h : ∃ t, level ω 1 t = 0) (hrest : ∃ t, level (fun k => ω (k+stopTime ω 1)) m t = 0) : upwardCount ω (m+1) = upwardCount ω 1 + upwardCount (fun k => ω (k+stopTime ω 1)) m := by sorry
Source
Liu, Wang, Yin, Zhang and Zhou, A Counting and Sampling Lovász Local Lemma, STOC 2027 #442, proof of Lemma 6.5, PDF p. 27, 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