Lemma 6.10 — the good-shift and accuracy events fail with probability at most 1/8 and η
OpenListReplicableBias.LowerBound.Supplement.lemma_6_10list-replicabilityp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilitysample-complexity
Run Algorithm 1 with parameters , on coins with biases , and let
Then
- ;
- ;
- .
On Algorithm 1 outputs the rounding (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