Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.10 — the good-shift and accuracy events fail with probability at most 1/8 and η

Open
ListReplicableBias.LowerBound.Supplement.lemma_6_10

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

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

Run Algorithm 1 with parameters ε∈(0,1)\varepsilon\in(0,1)ε∈(0,1), η∈(0,1/8)\eta\in(0,1/8)η∈(0,1/8) on d≥1d\ge1d≥1 coins with biases p∈[0,1]dp\in[0,1]^dp∈[0,1]d, and let

G=⋂i∈[d]{U is 3αm-good for pi},H=⋂i∈[d], j∈[m]{p^i(j)∈[pi−αj,pi+αj]}.G=\bigcap_{i\in[d]}\{U\text{ is }3\alpha_m\text{-good for }p_i\},\qquad H=\bigcap_{i\in[d],\,j\in[m]}\{\hat p_i^{(j)}\in[p_i-\alpha_j,p_i+\alpha_j]\}.G=i∈[d]⋂​{U is 3αm​-good for pi​},H=i∈[d],j∈[m]⋂​{p^​i(j)​∈[pi​−αj​,pi​+αj​]}.

Then

  1. Pr⁡(Gc)≤1/8\Pr(G^c)\le 1/8Pr(Gc)≤1/8;
  2. Pr⁡(Hc)≤η\Pr(H^c)\le\etaPr(Hc)≤η;
  3. Pr⁡(Gc∪Hc)≤1/8+η≤1/4\Pr(G^c\cup H^c)\le 1/8+\eta\le1/4Pr(Gc∪Hc)≤1/8+η≤1/4.

On G∩HG\cap HG∩H Algorithm 1 outputs the rounding RU(p)R_U(p)RU​(p) (Lemma 6.11), so these bounds control its failure probability.

Differences from the source:

  • encoding: Algorithm 1 run on d coins with shift U ~ Unif([0, ε)), probabilities over U and the tosses → the explicit outcome space (U, all block tosses) with law Unif([0, ε)) ⊗ independent Bern(p_i) tosses; rounds 1..m are blocks Fin m (block b is round b+1); probabilities are ℝ≥0∞ masses; reason: this is the paper's own analysis model on PDF p. 10 (an independent block of n_j tosses for every coin and round, only used blocks counted)
  • encoding: d ∈ ℕ coins indexed by [d] → 1 ≤ d; reason: at d = 0 the parameter m = ⌈log₂(24d)⌉ (and log(d/·)) is undefined, so only undefined cases are excluded
Preamble
import Mathlib
import Definitions.Def_ListReplicableBias_LowerBound_Geometry
import Definitions.Def_ListReplicableBias_LowerBound_Supplement_Algorithms

noncomputable section

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

open ListReplicableBias.LowerBound

/-- Lemma 6.10, PDF p. 10, all three clauses (both inequalities of (3)). -/
theorem lemma_6_10 (d : ℕ) (hd : 1 ≤ d) (ε η : ℝ) (hε : ε ∈ Set.Ioo (0 : ℝ) 1)
    (hη : η ∈ Set.Ioo (0 : ℝ) (1 / 8)) (p : Fin d → ℝ) (hp : p ∈ cube d 0 1) :
    alg1Law d ε η p (eventG d ε η p)ᶜ ≤ ENNReal.ofReal (1 / 8) ∧
    alg1Law d ε η p (eventH d ε η p)ᶜ ≤ ENNReal.ofReal η ∧
    alg1Law d ε η p ((eventG d ε η p)ᶜ ∪ (eventH d ε η p)ᶜ) ≤ ENNReal.ofReal (1 / 8 + η) ∧
    1 / 8 + η ≤ 1 / 4 := 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, Events G, H and Lemma 6.10, PDF p. 10

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