Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.3 — A small family of sign tests detects ℓ_1 error

Open
CalibratedMA.Randomized.Supplement.lemma_7_3

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

calibrationmultiaccuracyp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1sample-complexity

There are positive universal constants a∗,A∗,c∗,C∗a_*,A_*,c_*,C_*a∗​,A∗​,c∗​,C∗​. For each integer N≥2N\ge2N≥2 and every real KtestK_{\rm test}Ktest​ in the entire interval A∗log⁡N≤Ktest≤a∗NA_*\log N\le K_{\rm test}\le a_*NA∗​logN≤Ktest​≤a∗​N, there is a finite set of actual sign functions G⊆{−1,1}[N]G\subseteq\{-1,1\}^{[N]}G⊆{−1,1}[N] satisfying

exp⁡(c∗Ktest)≤∣G∣≤exp⁡(C∗Ktest)\exp(c_*K_{\rm test})\le|G|\le\exp(C_*K_{\rm test})exp(c∗​Ktest​)≤∣G∣≤exp(C∗​Ktest​)

and, simultaneously for every d∈RNd\in\mathbb R^Nd∈RN,

max⁡g∈G∣∑i=1Ngidi∣≥c∗Ktest/N∑i=1N∣di∣.\max_{g\in G}\left|\sum_{i=1}^Ng_i d_i\right|\ge c_*\sqrt{K_{\rm test}/N}\sum_{i=1}^N|d_i|.g∈Gmax​​i=1∑N​gi​di​​≥c∗​Ktest​/N​i=1∑N​∣di​∣.

No multiplicity is counted in ∣G∣|G|∣G∣. This finite testing result supports the prescribed group budget in Theorem 7.1.

Differences from the source:

  • encoding: a finite discrete domain [R] → Fin R, with source coordinate i represented by i.val+1; reason: finite relabeling preserves every statistical experiment, test and error
  • encoding: a maximum over the finite sign-test family → for every vector there exists a test attaining at least the bound; reason: equivalent to the maximum inequality on the finite nonempty family; cardinality counts distinct functions
Preamble
import Mathlib
import Definitions.Def_CalibratedMA_Randomized_Supplement_Hidden
Formal statement
namespace CalibratedMA.Randomized.Supplement

/-- Lemma 7.3, p.38: one set of actual functions works for every real vector. -/
theorem lemma_7_3 :
    ∃ a A c C : ℝ, 0 < a ∧ 0 < A ∧ 0 < c ∧ 0 < C ∧
      ∀ N : ℕ, 2 ≤ N → ∀ Ktest : ℝ,
      A * Real.log N ≤ Ktest → Ktest ≤ a * N →
      ∃ G : Finset (Fin N → ℝ),
        (∀ g ∈ G, ∀ i, IsSign (g i)) ∧
        Real.exp (c * Ktest) ≤ (G.card : ℝ) ∧
        (G.card : ℝ) ≤ Real.exp (C * Ktest) ∧
        ∀ d : Fin N → ℝ, ∃ g ∈ G,
          |∑ i : Fin N, g i * d i| ≥
            c * Real.sqrt (Ktest / N) * ∑ i : Fin N, |d i| := by sorry

end CalibratedMA.Randomized.Supplement
Source
Jiuyao Lu, Georgy Noarov, Aaron Roth, Calibrated Multiaccuracy: Deterministic and Randomized Sample Complexity, STOC 2027 submission #900 (October 2026; title page November 2, 2026), p. 38, Lemma 7.3 (PDF pp. 40)

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