Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 23 (used in the proof of Theorem 27) — Generalized potential bounds OPI success

Open
RandomStreamCI.CodeIntersection.Supplement.generalized_potential_bounds_success

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

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

Fix a finite code C⊆ΣnC\subseteq\Sigma^nC⊆Σn, a branching program BBB on the complete Boolean oracle stream, 0<η<1/20<\eta<1/20<η<1/2, and 1≤τ≤n1\le\tau\le n1≤τ≤n. Let κ:{0,…,n}→Z≥1\kappa:\{0,\ldots,n\}\to\mathbb Z_{\ge1}κ:{0,…,n}→Z≥1​ satisfy κ(n)≤τ\kappa(n)\le\tauκ(n)≤τ and increments in {0,1}\{0,1\}{0,1}. With M=n∣Σ∣M=n|\Sigma|M=n∣Σ∣,

Φ(τ)(0)=0,Pr⁡[B succeeds at threshold τ]≤2η+Φ(τ)(M).\Phi^{(\tau)}(0)=0,\qquad\Pr[B\text{ succeeds at threshold }\tau]\le2\eta+\Phi^{(\tau)}(M).Φ(τ)(0)=0,Pr[B succeeds at threshold τ]≤2η+Φ(τ)(M).

Both assertions use the actual uniform oracle/order law and actual posteriors. This is the terminal conversion from the generalized potential to OPI success, 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: kappa on {0,...,n} with positive integer values → a total natural function positive only on its used domain; (78) is a separate predicate; reason: values outside the finite domain are never read
Preamble
import Definitions.Def_RandomStreamCI_CodeIntersection_Supplement_Potential
Formal statement
namespace RandomStreamCI.CodeIntersection.Supplement

/-- Lemma 23, p. 18: both the zero initial value and the full terminal success bound. -/
theorem generalized_potential_bounds_success {n w : ℕ} {Alphabet : Type*}
    [Fintype Alphabet] [DecidableEq Alphabet] (B : BranchingProgram n Alphabet w)
    (C : Finset (Word n Alphabet)) (η : ℝ) (κ : ℕ → ℕ) (τ : ℕ)
    (hη0 : 0 < η) (hη1 : η < 1/2) (hτ0 : 1 ≤ τ) (hτn : τ ≤ n)
    (hκ : AdmissibleThreshold n τ κ) :
    vertexPotential B C η κ τ 0 = 0 ∧
      tauSuccess B C τ ≤ 2 * η + vertexPotential B C η κ τ (Fintype.card (Address n Alphabet)) := 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 23, p. 18 (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