Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bernoulli Tail Lower Affine Le Scalar Bernoulli Tail

Proved
LIDT.MIPStarRE.LDT.Pasting.bernoulliTailLowerAffine_le_scalarBernoulliTail

by Dengnifer · Oct 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

lidt

Affine lower envelope for the scalar Bernoulli tail. Let 0<θ<10<\theta<10<θ<1, let k and degree be natural numbers, and write d0d_0d0​ for degree. Assume

2d0θ≤k.\frac{2d_0}{\theta}\le k.θ2d0​​≤k.

For p∈[0,1]p\in[0,1]p∈[0,1], write A(θ,c,p)\mathcal A(\theta,c,p)A(θ,c,p) for the affine lower envelope and B(k,d0,p)\mathcal B(k,d_0,p)B(k,d0​,p) for the scalar binomial tail. With c=exp⁡(−θ2k/2)c=\exp(-\theta^2k/2)c=exp(−θ2k/2), the theorem states

A ⁣(θ,exp⁡ ⁣(−θ2k2),p)≤B(k,d0,p).\mathcal A\!\left(\theta,\exp\!\left(-\frac{\theta^2 k}{2}\right),p\right) \le \mathcal B(k,d_0,p).A(θ,exp(−2θ2k​),p)≤B(k,d0​,p).

The scalar tail is

B(k,d0,p)=∑r=d0+1k(kr)pr(1−p)k−r,\mathcal B(k,d_0,p)=\sum_{r=d_0+1}^{k}\binom{k}{r}p^r(1-p)^{k-r},B(k,d0​,p)=r=d0​+1∑k​(rk​)pr(1−p)k−r,

while the affine expression is (1−c)−(1−p)/(1−θ)(1-c)-(1-p)/(1-\theta)(1−c)−(1−p)/(1−θ). The proof combines the Hoeffding lower estimate in the region p≥θp\ge\thetap≥θ with nonnegativity of the tail when p<θp<\thetap<θ. This theorem is the scalar input to chernoffBernoulliMatrix.

Formalization credit: Sirui Lu, Ruixuan Deng, Yanqiao Zhu, and Zhengfeng Ji (arXiv:2609.19814). Mathematical source: Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen (arXiv:2009.12982).

Formalization Note. The source declaration is MIPStarRE.LDT.Pasting.bernoulliTailLowerAffine_le_scalarBernoulliTail; its Lean statement gives the exact quantifier order and all boundary hypotheses.

Preamble
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_AxisParallelLine
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_DiagonalLine
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_Distribution
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LinePolynomials
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LowDegreePolynomial
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_OpFamily
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_OperatorExpectations
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_ParametersBase
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_ParametersFiniteAnswers
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_QuantumState
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_SubMeasurementCore
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_SubMeasurementFamilies
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_TensorPlacement
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Bernoulli_Scalar
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Defs_Tuples
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_Basic
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_BlockDiagonal
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_NormalizedTrace
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_Order
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_TracePairing
import Mathlib
import Mathlib.Probability.Distributions.Binomial
import Mathlib.Probability.Moments.SubGaussian

namespace LIDT.MIPStarRE.LDT.Pasting
end LIDT.MIPStarRE.LDT.Pasting

open LIDT
/-!
# Scalar Bernoulli polynomial helpers for pasting

Purely scalar inequalities used by the matrix Chernoff comparison.
-/

@[expose] public section

open LIDT.MIPStarRE.LDT.Pasting

open MIPStarRE.LDT
open MeasureTheory ProbabilityTheory
open scoped BigOperators
Formal statement
theorem LIDT.MIPStarRE.LDT.Pasting.bernoulliTailLowerAffine_le_scalarBernoulliTail
    (theta : _root_.LIDT.MIPStarRE.LDT.Error) (k degree : ℕ)
    (hθ0 : 0 < theta) (hθ1 : theta < 1)
    (hk : (2 * (degree : _root_.LIDT.MIPStarRE.LDT.Error)) / theta ≤ (k : _root_.LIDT.MIPStarRE.LDT.Error))
    {p : _root_.LIDT.MIPStarRE.LDT.Error} (hp0 : 0 ≤ p) (hp1 : p ≤ 1) :
    _root_.LIDT.MIPStarRE.LDT.Pasting.bernoulliTailLowerAffine theta
      (Real.exp (-((theta ^ (2 : ℕ)) * (k : _root_.LIDT.MIPStarRE.LDT.Error)) / 2)) p ≤
        _root_.LIDT.MIPStarRE.LDT.Pasting.scalarBernoulliTail k degree p := by sorry
Source
https://github.com/LionSR/MIPStarRE/blob/f382c801026f53a9efc260fdee707cb35e0adb15/MIPStarRE/LDT/Pasting/Bernoulli/Scalar.lean#L440-L511

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