Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Confidence length ℓδ(N)\ell_\delta(N)ℓδ​(N)

Definition
StreamRot_Supplement_ellDelta

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

p2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationspace-complexitystreaming-algorithms

For a horizon NNN and a failure probability δ\deltaδ, the confidence length is

ℓδ(N)={min⁡{N,log⁡(2/δ)},0<δ≤1/3,N,δ=0,\ell_\delta(N)=\begin{cases}\min\{N,\log(2/\delta)\}, & 0<\delta\le 1/3,\\ N, & \delta=0,\end{cases}ℓδ​(N)={min{N,log(2/δ)},N,​0<δ≤1/3,δ=0,​

with the natural logarithm. It is the factor by which the upper width bound (B.2) of the confidence-uniform width law depends on the confidence level: at δ=0\delta=0δ=0 it is the horizon, and for positive δ\deltaδ it is capped by log⁡(2/δ)\log(2/\delta)log(2/δ).

Formalization Note The value is defined by cases on δ>0\delta>0δ>0, so δ=0\delta=0δ=0 gives NNN and never log⁡(2/0)\log(2/0)log(2/0). A negative δ\deltaδ also gives NNN; Theorem B.1 uses only 0≤δ≤1/30\le\delta\le 1/30≤δ≤1/3.

Definition code
import Mathlib

namespace StreamRot

namespace Supplement

/-- The confidence length `ℓ_δ(N) = min{N, log(2/δ)}` for `0 < δ ≤ 1/3`, and `ℓ_0(N) = N`, with the natural
logarithm. Qi, Constant-Failure Width Bounds for Streaming Rotations, STOC 2027 submission (manuscript sha256 3ffd9cd7…), Section B.1, p.20 (also Section 7, p.9).

**Formalization Note** The value is defined by cases on `0 < δ`, so `δ = 0` gives `N` and never `log(2/0)`.
Negative `δ` also gives `N`; Theorem B.1 only uses `0 ≤ δ ≤ 1/3`. -/
noncomputable def ellDelta (N : ℕ) (δ : ℝ) : ℝ :=
  if 0 < δ then min (N : ℝ) (Real.log (2 / δ)) else (N : ℝ)

end Supplement

end StreamRot
Source
Qi, Constant-Failure Width Bounds for Streaming Rotations, STOC 2027 submission (manuscript sha256 3ffd9cd7…), Section B.1, p.20 (PDF 22); Section 7, p.9 (PDF 11)

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