Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 26 (used in the proof of Theorem 27) — Exact generalized potential growth

Open
RandomStreamCI.CodeIntersection.Supplement.generalized_potential_growth

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

optimal-polynomial-intersectionp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quantum-informationstreaming

Let 1≤d≤n1\le d\le n1≤d≤n, and let C⊆ΣnC\subseteq\Sigma^nC⊆Σn be a finite code with pairwise agreement at most d−1d-1d−1. Fix s≥3ns\ge3\sqrt ns≥3n​, η=e−s2/(4n)<1/2\eta=e^{-s^2/(4n)}<1/2η=e−s2/(4n)<1/2, κ(k)=⌈k/2+s⌉+1\kappa(k)=\lceil k/2+s\rceil+1κ(k)=⌈k/2+s⌉+1, and 1≤τ≤n1\le\tau\le n1≤τ≤n. For an arbitrary positive-width www branching program BBB, writing S=log⁡2wS=\log_2 wS=log2​w, with

log⁡2w≤s28d−log⁡2∣C∣,\log_2 w\le\frac{s^2}{8d}-\log_2|C|,log2​w≤8ds2​−log2​∣C∣,

at every 0≤t<M=n∣Σ∣0\le t<M=n|\Sigma|0≤t<M=n∣Σ∣,

Ψ(τ)(t+1)−Φ(τ)(t)≤n/(dη)+1M−tmax⁡0≤k<n(n−k2βn−k−1(τ−κ(k))).\Psi^{(\tau)}(t+1)-\Phi^{(\tau)}(t)\le\frac{n/(d\eta)+1}{M-t}\max_{0\le k<n}\left(\frac{n-k}{2}\beta_{n-k-1}(\tau-\kappa(k))\right).Ψ(τ)(t+1)−Φ(τ)(t)≤M−tn/(dη)+1​0≤k<nmax​(2n−k​βn−k−1​(τ−κ(k))).

The binomial argument is signed; the threshold ceiling, the additive one, the factor (n−k)/2(n-k)/2(n−k)/2 and the full maximum are retained. No condition κ(n)≤τ\kappa(n)\le\tauκ(n)≤τ is assumed. This is the one-step estimate supporting Theorem 27.

Differences from the source:

  • encoding: coordinates, times and symbols as finite labelled sets → Fin indices numbered from zero and finite alphabet types; reason: bijections of labels preserve every source instance
  • encoding: the infinite threshold sum in (79)/(88) and integer binomial arguments → the finite range kappa(k_c) <= j <= min(k_c,tau), with signed integer tau-j and beta zero off its support; reason: all omitted terms vanish for positive eta, including on unreachable events
  • encoding: the maximum over 0 <= k < n and width w=2^S → the supremum of a finite nonempty real image and arbitrary natural width w with budget log_2 w; reason: d>=1 and d<=n ensure an attained maximum; t<M ensures a positive denominator; B.start forces w>0, so S=log_2 w is exactly equivalent to w=2^S without rounding
  • generalization: log_2 |C| implicitly requires a nonempty code → also permits C empty, using the published total value log_2 0=0; reason: all source nonempty codes are included; for the added empty case both potentials are zero and the right side is nonnegative
Preamble
import Definitions.Def_RandomStreamCI_CodeIntersection_Supplement_Agreement
import Definitions.Def_RandomStreamCI_CodeIntersection_Supplement_Potential
Formal statement
namespace RandomStreamCI.CodeIntersection.Supplement

/-- Lemma 26, p. 20, proof through p. 22: exact one-step growth, with all constants.
The width is arbitrary, with S = log₂ w as in the source's w = 2^S.
No terminal-threshold admissibility assumption is added. -/
theorem generalized_potential_growth {n d w : ℕ} {Alphabet : Type*} [Fintype Alphabet] [DecidableEq Alphabet]
    (hd0 : 1 ≤ d) (hdn : d ≤ n) (C : Finset (Word n Alphabet))
    (hC : PairwiseAgreement C d) (s : ℝ)
    (hs : 3 * Real.sqrt (n : ℝ) ≤ s) (hη : surplusEta n s < 1/2)
    (B : BranchingProgram n Alphabet w) (τ : ℕ) (hτ0 : 1 ≤ τ) (hτn : τ ≤ n)
    (hS : log₂ (w : ℝ) ≤ s^2 / (8 * (d : ℝ)) - log₂ (C.card : ℝ))
    (t : Fin (Fintype.card (Address n Alphabet))) :
    edgePotential B C (surplusEta n s) (surplusThreshold s) τ t -
        vertexPotential B C (surplusEta n s) (surplusThreshold s) τ t.val ≤
      (((n : ℝ) / ((d : ℝ) * surplusEta n s) + 1) /
        ((Fintype.card (Address n Alphabet) : ℝ) - t.val)) *
        growthMaximum n τ (surplusThreshold s) := by sorry

end RandomStreamCI.CodeIntersection.Supplement
Source
Bouland–Ding–Jain, Exponential quantum space advantage in random data streams, STOC 2027 submission #71, preprint dated 2026-11-02, release papers-1/71.pdf, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/71.pdf, SHA256 3fe1835efedc1b9f29103379085d28d84ab1057dc30c3e3f05a8dce9f536a797, Lemma 26, p. 20 (printed = PDF; offset 0)

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