Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Threshold separation for sums of geometric variables, uniform in the scale Λ\LambdaΛ of the means (binomial thinning)

Proved
BosonicLearn.geometric_threshold_scaled

by Senrui Chen · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

bosonic-gaussian-statesquantum-informationquantum-learning

A version of BosonicLearn.geometric_pgf_threshold whose constant does not depend on the bound Λ\LambdaΛ of the means; it is what makes the photon-counting argument of Lemma 12 work for hot states (ν≥1\nu\ge1ν≥1, Theorem 9).

There is an absolute constant c>0c>0c>0 such that for every Λ≥1\Lambda\ge1Λ≥1: let 0≤λi−≤λi+≤Λ0\le\lambda^-_i\le\lambda^+_i\le\Lambda0≤λi−​≤λi+​≤Λ (i=1,…,mi=1,\dots,mi=1,…,m) and let p±p^\pmp± be the laws on N\mathbb NN of K±=∑iMi±K_\pm=\sum_iM^\pm_iK±​=∑i​Mi±​, sums of independent geometric variables with means λi±\lambda^\pm_iλi±​, given through ∑kpk±zk=∏i11+λi±(1−z)\sum_kp^\pm_kz^k=\prod_i\frac{1}{1+\lambda^\pm_i(1-z)}∑k​pk±​zk=∏i​1+λi±​(1−z)1​ for 0≤z≤10\le z\le10≤z≤1. Put δ=∑i(λi+−λi−)\delta=\sum_i(\lambda^+_i-\lambda^-_i)δ=∑i​(λi+​−λi−​). If 0<δ0<\delta0<δ and δ2≤1+∑iλi−(1+λi−)\delta^2\le1+\sum_i\lambda^-_i(1+\lambda^-_i)δ2≤1+∑i​λi−​(1+λi−​), then there is a threshold τ\tauτ with

Pr⁡(K+>τ)−Pr⁡(K−>τ) ≥ c δ/Λ1+∑iλi−Λ(1+λi−Λ).\Pr(K_+>\tau)-\Pr(K_->\tau)\ \ge\ c\,\frac{\delta/\Lambda}{\sqrt{1+\sum_i\frac{\lambda^-_i}{\Lambda}\big(1+\frac{\lambda^-_i}{\Lambda}\big)}} .Pr(K+​>τ)−Pr(K−​>τ) ≥ c1+∑i​Λλi−​​(1+Λλi−​​)​δ/Λ​.

Proof idea: binomial thinning with probability 1/Λ1/\Lambda1/Λ maps a sum of geometric variables with means λi\lambda_iλi​ to one with means λi/Λ≤1\lambda_i/\Lambda\le1λi​/Λ≤1 (the generating function is evaluated at 1−η+ηz1-\eta+\eta z1−η+ηz), and a thinned threshold test is a mixture of threshold tests (Abel summation), so the Λ=1\Lambda=1Λ=1 case applies.

Formalization Note Laws are sequences ℕ → ℝ with non-negative entries determined by the generating-function identities; tails are ∑' k, if τ < k then p k else 0.

Preamble
import Mathlib
Formal statement
namespace BosonicLearn

/-- **Threshold separation for sums of geometric variables, uniformly in the scale of the means.**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, §5.7, Lemmas 13–14 and Eqs. (137)–(142) (threshold separation for the photon count), used in §8 for hot states
(`ν ≥ 1`, proof of Theorem 9, p. 66).

There is an absolute constant `c > 0` such that for every `Λ ≥ 1`: let `0 ≤ λ⁻_i ≤ λ⁺_i ≤ Λ` and let `p⁺, p⁻` be the laws
on `ℕ` of sums of independent geometric variables with means `λ^±_i` (given through their generating functions
`∑ₖ p^±_k zᵏ = ∏ᵢ 1/(1 + λ^±_i(1 − z))`, `0 ≤ z ≤ 1`). Put `δ = ∑ᵢ(λ⁺_i − λ⁻_i)`. If `0 < δ` and
`δ² ≤ 1 + ∑ᵢ λ⁻_i(1 + λ⁻_i)`, then there is a threshold `τ` with

`Pr(K₊ > τ) − Pr(K₋ > τ) ≥ c (δ/Λ) / √(1 + ∑ᵢ (λ⁻_i/Λ)(1 + λ⁻_i/Λ))`.

**Formalization Note.** This is `geometric_pgf_threshold` (whose constant depends on the bound `Λ` of the means) made
uniform: binomial thinning with probability `1/Λ` maps a sum of geometric variables with means `λ_i` to one with means
`λ_i/Λ ≤ 1`, and a thinned threshold test is a mixture of threshold tests. -/
theorem geometric_threshold_scaled :
    ∃ c : ℝ, 0 < c ∧ ∀ Λ : ℝ, 1 ≤ Λ →
      ∀ (m : ℕ) (lp lm : Fin m → ℝ), (∀ i, 0 ≤ lm i) → (∀ i, lm i ≤ lp i) → (∀ i, lp i ≤ Λ) →
      ∀ (pp pm : ℕ → ℝ), (∀ k, 0 ≤ pp k) → (∀ k, 0 ≤ pm k) →
        (∀ z : ℝ, 0 ≤ z → z ≤ 1 →
          HasSum (fun k => pp k * z ^ k) (∏ i, (1 + lp i * (1 - z))⁻¹)) →
        (∀ z : ℝ, 0 ≤ z → z ≤ 1 →
          HasSum (fun k => pm k * z ^ k) (∏ i, (1 + lm i * (1 - z))⁻¹)) →
        0 < ∑ i, (lp i - lm i) →
        (∑ i, (lp i - lm i)) ^ 2 ≤ 1 + ∑ i, lm i * (1 + lm i) →
        ∃ τ : ℕ, c * ((∑ i, (lp i - lm i)) / Λ) /
            Real.sqrt (1 + ∑ i, lm i / Λ * (1 + lm i / Λ)) ≤
          (∑' k, if τ < k then pp k else 0) - ∑' k, if τ < k then pm k else 0 := by sorry

end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, §5.7, Lemmas 13–14 and Eqs. (137)–(142); used for §8, proof of Theorem 9, p. 66

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