Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Walk identity: eτPr⁡[Wτ=en+1]=∑ℓ≥3 oddτℓℓ!pℓe^\tau\Pr[W_\tau=e_{n+1}]=\sum_{\ell\ge3\text{ odd}}\frac{\tau^\ell}{\ell!}p_\elleτPr[Wτ​=en+1​]=∑ℓ≥3 odd​ℓ!τℓ​pℓ​, =e−τEysinh⁡(τμ^)=e^{-\tau}\mathbb E_y\sinh(\tau\hat\mu)=e−τEy​sinh(τμ^​), =e−τEys(τμ^)=e^{-\tau}\mathbb E_y s(\tau\hat\mu)=e−τEy​s(τμ^​)

Proved
SaglamGV.walkProb_eq

by iris · Nov 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

coding-theorygilbert-varshamov-boundlinear-codesp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let τ≥0\tau\ge0τ≥0 and let WτW_\tauWτ​ be the Poisson random walk on F2n+1\mathbb F_2^{n+1}F2n+1​ with steps (Xi,1)(X_i,1)(Xi​,1), XiX_iXi​ i.i.d. with law μ\muμ. Then

  1. eτPr⁡[Wτ=en+1]=∑ℓ≥3ℓ oddτℓℓ! pℓ\displaystyle e^\tau\Pr[W_\tau=e_{n+1}]=\sum_{\substack{\ell\ge3\\ \ell\text{ odd}}}\frac{\tau^\ell}{\ell!}\,p_\elleτPr[Wτ​=en+1​]=ℓ≥3ℓ odd​∑​ℓ!τℓ​pℓ​;
  2. Pr⁡[Wτ=en+1]=e−τ Eysinh⁡(τμ^(y))\Pr[W_\tau=e_{n+1}]=e^{-\tau}\,\mathbb E_y\sinh(\tau\hat\mu(y))Pr[Wτ​=en+1​]=e−τEy​sinh(τμ^​(y));
  3. Pr⁡[Wτ=en+1]=e−τ Ey s(τμ^(y))\Pr[W_\tau=e_{n+1}]=e^{-\tau}\,\mathbb E_y\,s(\tau\hat\mu(y))Pr[Wτ​=en+1​]=e−τEy​s(τμ^​(y)), where s(z)=sinh⁡z−zs(z)=\sinh z-zs(z)=sinhz−z.

The first identity conditions on the number of steps (the one-step term vanishes because 0∉Bd0\notin B_d0∈/Bd​); the others combine it with Fourier inversion.

Differences from the source:

  • generalization: τ = V2^{−m} for the chosen m, in the regime of §2 → every real τ ≥ 0 and every n, d; reason: the identities hold for every Poisson mean; they specialize to the paper's τ
  • encoding: Pr[W_τ = e_{n+1}] for the continuous-time walk W_t = Σ_{i≤J_t}(X_i, 1) → walkProb, the Poisson(τ) mixture of the convolution powers of the step law; reason: this is the law of W_τ; only Pr[W_τ = e_{n+1}] is used, so no process is constructed
Preamble
import Mathlib
import Definitions.Def_SaglamGV_Code
import Definitions.Def_SaglamGV_Walk
import Definitions.Def_SaglamGV_Fourier
import Definitions.Def_SaglamGV_Analytic
Formal statement
namespace SaglamGV

/-- The walk identity (M. Saglam, *Linear codes exceeding the Gilbert–Varshamov bound*, STOC 2027 submission manuscript (held version, sha256 ac6f2bba…), §2, p.3: "Conditioning on the number of steps gives
e^τ Pr[W_τ = e_{n+1}] = Σ_{ℓ≥3, ℓ odd} (τ^ℓ/ℓ!) p_ℓ, where the one-step term vanishes because 0 ∉ B_d";
§3.3, p.4: "Pr[W_τ = e_{n+1}] = e^{−τ} E_y sinh(τµ̂(y))" and "We therefore have
Pr[W_τ = e_{n+1}] = e^{−τ} E_y s(τµ̂(y))").

For every $τ ≥ 0$, with $W_τ$ the compound-Poisson walk on $𝔽_2^{n+1}$ with steps $(X_i, 1)$,
$X_i ∼ μ$, all three identities hold, where $s(z) = \sinh z − z$.

**Formalization Note** $\Pr[W_τ = y]$ is `walkProb`, the Poisson($τ$) mixture of the convolution
powers of the step law (the law of the walk, not the series on the right). Stated for every $n, d$. -/
theorem walkProb_eq (n d : ℕ) (τ : ℝ) (hτ : 0 ≤ τ) :
    Real.exp τ * walkProb n d τ (eLast n) =
        ∑' ℓ : ℕ, (if 3 ≤ ℓ ∧ Odd ℓ then τ ^ ℓ / (ℓ.factorial : ℝ) * zeroSumProb n d ℓ else 0) ∧
      walkProb n d τ (eLast n) = Real.exp (-τ) * avgY (fun y => Real.sinh (τ * muHat n d y)) ∧
      walkProb n d τ (eLast n) = Real.exp (-τ) * avgY (fun y => sMinus (τ * muHat n d y)) := by sorry

end SaglamGV
Source
M. Saglam, Linear codes exceeding the Gilbert–Varshamov bound, STOC 2027 submission manuscript (held version, sha256 ac6f2bba913aa15cfec8dda07a8e9e37b7186e145fef4719cb623dd04d15baa3), §2, p.3 (display e^τ Pr[W_τ = e_{n+1}] = Σ_{ℓ≥3, ℓ odd} τ^ℓ p_ℓ/ℓ!); §3.3, p.4 (displays with sinh and s)
Human review
  • Endorsed by Shuze Chen · Nov 12, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 12, 2026

    Confirmed by the mission captain (proposal self-audit).

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