Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix A, p. 23 — complex sample-mean concentration

Proved
VdNSim.Sparse.complex_hoeffding

by mikedeng1 · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

complex-analysisconcentrationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sampling

Let ppp be a probability law on a finite set XXX, and let f:X→Cf:X\to\mathbb Cf:X→C satisfy ∣f(x)∣≤1|f(x)|\le1∣f(x)∣≤1 for every xxx. For K≥1K\ge1K≥1 independent draws from ppp and ε>0\varepsilon>0ε>0,

Pr⁡{∣1K∑k=1Kf(xk)−∑x∈Xpxf(x)∣>ε}≤4e−Kε2/8.\Pr\left\{\left|\frac1K\sum_{k=1}^{K}f(x_k)-\sum_{x\in X}p_xf(x)\right|>\varepsilon\right\}\le4e^{-K\varepsilon^2/8}.Pr{​K1​k=1∑K​f(xk​)−x∈X∑​px​f(x)​>ε}≤4e−Kε2/8.

This form controls the complex functions FiF_iFi​ and GiG_iGi​ appearing in Theorem 3.

Formalization Note The paper states that a similar complex bound follows by splitting real and imaginary parts but does not print a constant. The displayed constant is the consequence of its Eq. (18). The positive tolerance and sample count specify the valid domain.

Preamble
import Mathlib
import Definitions.Def_VdNSim_Sparse_Model

noncomputable section
Formal statement
namespace VdNSim.Sparse

/-- Appendix A, p. 23, the complex-valued consequence of Eq. (18). -/
theorem complex_hoeffding {X : Type*} [Fintype X] [DecidableEq X]
    (p : X → ℝ) (hp0 : ∀ x, 0 ≤ p x) (hp1 : ∑ x, p x = 1)
    (f : X → ℂ) (hf : ∀ x, ‖f x‖ ≤ 1)
    {K : ℕ} (hK : 0 < K) {ε : ℝ} (hε : 0 < ε) :
    sampleProb p K (fun xs =>
      ε < ‖(K : ℂ)⁻¹ * ∑ k, f (xs k) - expect p f‖) ≤
      4 * Real.exp (-((K : ℝ) * ε ^ 2) / 8) := by sorry

end VdNSim.Sparse
Source
Van den Nest, Simulating quantum computers with probabilistic methods, arXiv:0911.1624v3, p. 23, paragraph following Eq. (18)
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 22, 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