Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.13 (= Thm 4.4) (corrected: d ≥ 2) — a k-list replicable estimator with O((d² log d/(ε² log k)) log²(d/δ)) samples

Open
ListReplicableBias.LowerBound.Supplement.theorem_6_13

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

list-replicabilityp2o-batch-stoc27sp2o-correctedp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilitysample-complexity

There is an absolute constant C>0C>0C>0 such that for all d,k∈Nd,k\in\mathbb Nd,k∈N with d≥2d\ge2d≥2 and d+1≤k≤2dd+1\le k\le2^dd+1≤k≤2d and all ε,δ∈(0,1)\varepsilon,\delta\in(0,1)ε,δ∈(0,1) there is a randomized NNN-toss sampling algorithm on ddd coins that is (k,ε,δ)(k,\varepsilon,\delta)(k,ε,δ)-list replicable for the ddd-CoinBiasEstimationProblem and uses

N≤C d2ln⁡dε2ln⁡k (ln⁡dδ)2N\le C\,\frac{d^2\ln d}{\varepsilon^2\ln k}\,\Big(\ln\frac d\delta\Big)^2N≤Cε2lnkd2lnd​(lnδd​)2

samples.

Together with Theorem 5.11 this determines the sample complexity of kkk-list replicable bias estimation up to polylogarithmic factors for every k∈[d+1,2d]k\in[d+1,2^d]k∈[d+1,2d].

Differences from the source:

  • correction: d, k ∈ ℕ with k ∈ [d + 1, 2^d] (including d = 1) → 2 ≤ d; reason: at d = 1 (k = 2) the printed bound d² log d/(ε² log k) · log²(d/δ) is 0, forcing N = 0, but with ε = 0.01 and δ = 0.1 one fixed output law would have to put mass ≥ 0.9 near each of 34 points 0.03 apart in [0, 1], which is impossible
  • encoding: arbitrary randomized adaptive algorithms with sample access to d coins, using N samples, output in ℝ^d ∪ {⊥} → the published SamplingAlgorithm d N (arbitrary probability seed space, prefix-dependent coin choices, fixed horizon N) with failure as none; reason: the base mission's model of §3.2 and Appendix B; private randomness is in the seed and an algorithm that stops early is padded with ignored tosses, so N is the worst-case toss count
  • reading: N = O((d² log d/(ε² log k)) log²(d/δ)) with ε, δ fixed first → one constant chosen before every other parameter; reason: the hidden constant cannot depend on ε, which appears inside the bound; the uniform reading is the stronger one
Preamble
import Mathlib
import Definitions.Def_ListReplicableBias_LowerBound_ListReplicability

noncomputable section

open MeasureTheory ProbabilityTheory
open scoped ENNReal
Formal statement
namespace ListReplicableBias.LowerBound.Supplement

open ListReplicableBias.LowerBound

/-- Theorem 6.13 (= Theorem 4.4), PDF pp. 11, 4, corrected to d ≥ 2 (at d = 1
the printed bound is 0). C is chosen before d, k, ε, δ; N is the fixed budget. -/
theorem theorem_6_13 :
    ∃ C : ℝ, 0 < C ∧ ∀ d k : ℕ, 2 ≤ d → d + 1 ≤ k → k ≤ 2 ^ d →
      ∀ ε δ : ℝ, ε ∈ Set.Ioo (0 : ℝ) 1 → δ ∈ Set.Ioo (0 : ℝ) 1 →
      ∃ (N : ℕ) (A : SamplingAlgorithm d N), IsListReplicable A k ε δ ∧
        (N : ℝ) ≤ C * (d : ℝ) ^ 2 * Real.log (d : ℝ) / (ε ^ 2 * Real.log (k : ℝ)) *
          (Real.log ((d : ℝ) / δ)) ^ 2 := by sorry

end ListReplicableBias.LowerBound.Supplement
Source
Chen, Bastan, Pavan, Vinodchandran, The Price of List Replicability: Tight Bounds for Bias Estimation, STOC 2027 submission #681 (October 2026), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/681.pdf, Theorem 6.13, PDF p. 11 (= Theorem 4.4, PDF p. 4); proof PDF pp. 11–12

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