Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.15 — The complete finite-grid ball overlap inequality

Open
AMRangeAvoid.Characterization.Supplement.lemma_2_15

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

complexity-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1range-avoidance

Let n≥1n\ge1n≥1, let RRR be an integer with R>n/2R>\sqrt n/2R>n​/2, and put r−=R−n/2r_-=R-\sqrt n/2r−​=R−n​/2 and r+=R+n/2r_+=R+\sqrt n/2r+​=R+n​/2. For w∈Znw\in\mathbb Z^nw∈Zn with ∥w∥2≤2r−\|w\|_2\le2r_-∥w∥2​≤2r−​, let ER={z∈Zn:∥z∥2≤R}E_R=\{z\in\mathbb Z^n:\|z\|_2\le R\}ER​={z∈Zn:∥z∥2​≤R}. Then

∣ER∩(ER+w)∣∣ER∣≥12πn(r−r+)n(1−∥w∥224r−2)(n+1)/2.\frac{|E_R\cap(E_R+w)|}{|E_R|}\ge\frac1{\sqrt{2\pi n}}\left(\frac{r_-}{r_+}\right)^n\left(1-\frac{\|w\|_2^2}{4r_-^2}\right)^{(n+1)/2}.∣ER​∣∣ER​∩(ER​+w)∣​≥2πn​1​(r+​r−​​)n(1−4r−2​∥w∥22​​)(n+1)/2.

The bound retains the exact constant and exponent and applies to every admissible radius and integer translation, including the boundary ∥w∥2=2r−\|w\|_2=2r_-∥w∥2​=2r−​.

Differences from the source:

  • encoding: integer Euclidean balls in positive dimension → finite sets of vectors on Fin n defined by exact sums of squared coordinates; reason: this is the same closed Euclidean ball, with the positive-dimension convention inherited from Lemma 2.14
Preamble
import Definitions.Def_AMRangeAvoid_Characterization_Supplement_Grid
import Definitions.Def_AMRangeAvoid_Characterization_SSLB
Formal statement
namespace AMRangeAvoid.Characterization.Supplement

theorem lemma_2_15 (n : ℕ) (hn : 1 ≤ n) (R : ℕ)
    (hR : Real.sqrt n / 2 < (R : ℝ)) (w : Fin n → ℤ)
    (hw : ‖integerEuclidean w‖ ≤ 2 * ((R : ℝ) - Real.sqrt n / 2)) :
    ((gridLens R w).card : ℝ) / (gridBall n R).card ≥
      (1 / Real.sqrt (2 * Real.pi * n)) *
        (((R : ℝ) - Real.sqrt n / 2) / ((R : ℝ) + Real.sqrt n / 2)) ^ n *
        Real.rpow (1 - ‖integerEuclidean w‖ ^ 2 /
          (4 * ((R : ℝ) - Real.sqrt n / 2) ^ 2)) (((n : ℝ) + 1) / 2) := by sorry

end AMRangeAvoid.Characterization.Supplement
Source
Zeyong Li, STOC 2027 submission #502 (October 2026), Lemma 2.15, printed p.13 (PDF p.15); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/502.pdf

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