Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, Eq. (16), second inequality: Pr⁡[Bin(m,1/2)<G]≤e−m/8\Pr[\mathrm{Bin}(m,1/2)<G]\le e^{-m/8}Pr[Bin(m,1/2)<G]≤e−m/8 for every integer m≥4Gm\ge4Gm≥4G

Proved
ConstOverheadCompile.Main.binomial_tail_eq16

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

concentration-inequalitiesp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1probability

For all nonnegative integers GGG and mmm with m≥4Gm\ge 4Gm≥4G,

Pr⁡[Bin(m,1/2)<G]=12m∑k=0G−1(mk) ≤ e−m/8.\Pr[\mathrm{Bin}(m,1/2)<G]=\frac{1}{2^m}\sum_{k=0}^{G-1}\binom{m}{k}\ \le\ e^{-m/8}.Pr[Bin(m,1/2)<G]=2m1​k=0∑G−1​(km​) ≤ e−m/8.

In the paper this bound controls the number of state-injection calls of Algorithm 1: if more than mmm injections occur, fewer than GGG of the first mmm independent fair coins came up "no correction needed". It fixes the cutoff tmax⁡t_{\max}tmax​ in the proofs of Theorems 2, 7 and 9.

Differences from the source:

  • reading: Eq. (16) chains Pr⁡[I>m]≤Pr⁡[Bin(m,1/2)<G]≤e−m/8\Pr[I>m]\le\Pr[\mathrm{Bin}(m,1/2)<G]\le e^{-m/8}Pr[I>m]≤Pr[Bin(m,1/2)<G]≤e−m/8 → only the second inequality; reason: the first concerns the random number III of injection calls of Algorithm 1, an object of the proof of Theorem 9 that this mission does not define; the title marks the part stated.
  • encoding: Pr⁡[Bin(m,1/2)<G]\Pr[\mathrm{Bin}(m,1/2)<G]Pr[Bin(m,1/2)<G] → the explicit sum 2−m∑k<G(mk)2^{-m}\sum_{k<G}\binom mk2−m∑k<G​(km​); reason: the same number.
Preamble
import Mathlib
Formal statement
namespace ConstOverheadCompile.Main

/-- §2, p.7, Eq. (16), second inequality: for all integers `m ≥ 4G ≥ 0`,
`Pr[Bin(m, 1/2) < G] = 2^{-m} Σ_{k < G} C(m, k) ≤ e^{-m/8}`. -/
theorem binomial_tail_eq16 (G m : ℕ) (h : 4 * G ≤ m) :
    (∑ k ∈ Finset.range G, (m.choose k : ℝ)) / 2 ^ m ≤ Real.exp (-(m : ℝ) / 8) := by sorry

end ConstOverheadCompile.Main
Source
Chenyi Zhang, Xinyu Tan, Robin Kothari, David Gosset, Craig Gidney, Quantum circuit compilation with constant overhead, STOC 2027 submission #397 (October 2026), source.pdf SHA-256 b848604016de1821f5f693c59f328e0b2a9e535bca0b37bb664e6f40dbe3681f, p.7, §2, Eq. (16) (second inequality)
Human review
  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 11, 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