Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.7 — the canonical list is ε-close and has at most d+1 members

Proved
ListReplicableBias.LowerBound.Supplement.lemma_6_7

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

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

Let ε>0\varepsilon>0ε>0 and p∈[0,1]dp\in[0,1]^dp∈[0,1]d, and let Lp={Ru(p):u∈[0,ε)}\mathcal L_p=\{R_u(p):u\in[0,\varepsilon)\}Lp​={Ru​(p):u∈[0,ε)}. Then

  1. every y∈Lpy\in\mathcal L_py∈Lp​ satisfies ∥y−p∥∞<ε\|y-p\|_\infty<\varepsilon∥y−p∥∞​<ε;
  2. ∣Lp∣≤d+1|\mathcal L_p|\le d+1∣Lp​∣≤d+1.

The canonical list is the list witnessing (d+1)(d+1)(d+1)-list replicability of the upper-bound algorithms (Theorems 6.8, A.2), and its blockwise products give the lists of Theorem 6.13.

Differences from the source:

  • encoding: the grid width ε of §6.2 (positive throughout §6) → hypothesis 0 < ε; reason: ε > 0 is the standing assumption of §6; for ε ≤ 0 the rounding is undefined
  • encoding: vectors in ℝ^d with the ℓ∞ norm → functions Fin d → ℝ with their sup norm; reason: the same finite coordinates and the same distance
  • encoding: |L_p| ≤ d + 1 → Set.encard (canonicalList ε p) ≤ d + 1; reason: extended cardinality; the bound also asserts that L_p is finite, as the source's |L_p| presupposes
Preamble
import Mathlib
import Definitions.Def_ListReplicableBias_LowerBound_Geometry
import Definitions.Def_ListReplicableBias_LowerBound_Supplement_Rounding

noncomputable section

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

open ListReplicableBias.LowerBound

/-- Lemma 6.7, PDF p. 9 (with Definition 6.6), both clauses. Clause (2) is
stated with `Set.encard`, so it also asserts that L_p is finite. -/
theorem lemma_6_7 (ε : ℝ) (hε : 0 < ε) (d : ℕ) (p : Fin d → ℝ) (hp : p ∈ cube d 0 1) :
    (∀ y ∈ canonicalList ε p, ‖y - p‖ < ε) ∧
    (canonicalList ε p).encard ≤ (d : ℕ∞) + 1 := 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, Definition 6.6 and Lemma 6.7, PDF p. 9

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