Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Harmonic block mass

Proved
BLTCounting.AccuracySpace.claim_4_4

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

geometric-blocksp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let R≥1R\ge1R≥1 be an integer, let 0<h≤10<h\le10<h≤1, and let wi=∑r∈Si1/rw_i=\sum_{r\in S_i}1/rwi​=∑r∈Si​​1/r be the harmonic mass of the geometric block SiS_iSi​. Then, with an absolute implied constant, uniformly in iii,

wi=h+O ⁣(1R)=h(1+O((Rh)−1)).w_i=h+O\!\left(\frac1R\right)=h\bigl(1+O((Rh)^{-1})\bigr).wi​=h+O(R1​)=h(1+O((Rh)−1)).

Each block therefore carries nearly the same harmonic mass hhh, which is why QQQ acts on a uniform logarithmic scale.

Formalization Note. The two OOO terms are stated as ∣wi−h∣≤C/R|w_i-h|\le C/R∣wi​−h∣≤C/R and ∣wi/h−1∣≤C/(Rh)|w_i/h-1|\le C/(Rh)∣wi​/h−1∣≤C/(Rh), with one constant C>0C>0C>0 chosen before RRR, hhh and iii.

Differences from the source:

  • generalization: the parameters RRR, hhh of equation (28) and block indices i<Ki<Ki<K → all integers R≥1R\ge1R≥1, all 0<h≤10<h\le10<h≤1 and all i∈Ni\in\mathbb Ni∈N; reason: the estimate depends only on these ranges; the source statement is the special case
Preamble
import Mathlib
import Definitions.Def_BLTCounting_AccuracySpace_GeometricBlocks
Formal statement
namespace BLTCounting.AccuracySpace

/-- Claim 4.4, PDF p. 27: `w_i = h + O(1/R) = h(1 + O((Rh)⁻¹))`, with an absolute implied constant,
uniformly in the block index `i`, the integer `R ≥ 1` and the width `0 < h ≤ 1`. -/
theorem claim_4_4 :
    ∃ C : ℝ, 0 < C ∧ ∀ (R : ℕ) (h : ℝ), 1 ≤ R → 0 < h → h ≤ 1 → ∀ i : ℕ,
      |blockMass R h i - h| ≤ C / R ∧ |blockMass R h i / h - 1| ≤ C / (R * h) := by sorry

end BLTCounting.AccuracySpace
Source
Monika Henzinger, Jalaj Upadhyay, Lower Bounds for Memory-Efficient Differentially Private Continual Counting, STOC 2027 submission #357 (October 2026), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/357.pdf, SHA-256 4bc286dfed41ddf6b1f9ec058dd7964f530cf194be79fa5d9dd129d4ae37d510, Claim 4.4, printed p. 26 (PDF p. 27)
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 2026

    Confirmed by the mission captain (proposal self-audit).

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