Lemma 3.2 (Logarithmic center packing)
ProvedLawLocalComp.lemma_3_2law-compressionmonotone-normsp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilitystochastic-loads
Let be integers, , for , and let be arbitrary positive centers. If , then at least half of the grid points lie at logarithmic distance at least from every center:
This packing bound is the final counting step of the conditional-mean lower bounds.
Differences from the source: none.
Preamble
import Mathlib
Formal statement
namespace LawLocalComp
/-- **Lemma 3.2 (Logarithmic center packing).**
Mahboub–Rahgoshay, *Optimal Law-Local Compression for Stochastic Loads*, STOC 2027
submission manuscript of Oct. 29, 2026 (sha256 5f71501c…aa873), Lemma 3.2, p.5.
Let `m, H ≥ 1` be integers, `A > 0`, `x_i = A(1 + 1/m)^i` for `0 ≤ i < mH`, and let `s ≥ 1` positive
centers `c_1, …, c_s` be arbitrary. If `s < mH/4`, at least half of the grid points lie at logarithmic
distance at least `H/(16s)` from every center. -/
theorem lemma_3_2 (m H : ℕ) (hm : 1 ≤ m) (hH : 1 ≤ H) (A : ℝ) (hA : 0 < A) (s : ℕ) (hs : 1 ≤ s)
(c : Fin s → ℝ) (hc : ∀ j, 0 < c j) (hsmall : (s : ℝ) < m * H / 4) :
(m * H : ℝ) / 2 ≤ ((Finset.range (m * H)).filter (fun i => ∀ j, (H : ℝ) / (16 * s) ≤
|Real.log (A * (1 + 1 / (m : ℝ)) ^ i) - Real.log (c j)|)).card := by sorry
end LawLocalComp
Source
Mahboub–Rahgoshay, Optimal Law-Local Compression for Stochastic Loads, STOC 2027 submission (manuscript of Oct. 29, 2026, sha256 5f71501c…aa873), Lemma 3.2, p.5
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.