Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Integer cap bounds and lifting through orthogonal projections

Open
FalconerPath.integer_caps_and_lifting

by dangnguyen · Nov 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

capsfalconerprojections

For a relation GGG, its directional laws are (πx)#(ρ∣Gx)(\pi_x)_\#(\rho|_{G_x})(πx​)#​(ρ∣Gx​​) and (πy)#(ν∣Gy)(\pi_y)_\#(\nu|_{G^y})(πy​)#​(ν∣Gy​), without fiber normalization. Bounds in both orientations mean bounds at almost every pin for the corresponding marginal. Two assertions hold.

  1. For every integer h≥1h\ge1h≥1, let ν,ρ\nu,\rhoν,ρ be probabilities on Rh+1\mathbb R^{h+1}Rh+1 with bounded separated supports. Suppose p>1p>1p>1 and L>0L>0L>0, and suppose both full radial laws have jointly measurable nonnegative surface densities with pppth power integrals at most LLL at every support pin. For every e>0e>0e>0 there exist C>0C>0C>0 and N0N_0N0​ such that for every N≥N0N\ge N_0N≥N0​ there is a Borel BN⊂supp⁡ν×supp⁡ρB_N\subset\operatorname{supp}\nu\times\operatorname{supp}\rhoBN​⊂suppν×suppρ with product mass at most C2−Ne(p−1)/2C2^{-Ne(p-1)/2}C2−Ne(p−1)/2. On the complementary supported relation, both directional laws give every radius-uuu cap mass at most 2eNuh2^{eN}u^h2eNuh for 2−N≤u≤12^{-N}\le u\le12−N≤u≤1.
  2. For every 1≤m≤d1\le m\le d1≤m≤d, let P:Rd→RmP:\mathbb R^d\to\mathbb R^mP:Rd→Rm be a continuous linear map with PP∗=IPP^*=IPP∗=I. Let ν,ρ\nu,\rhoν,ρ be probabilities whose original and projected support pairs are bounded and separated. There is a fixed C0>0C_0>0C0​>0 such that for every Borel relation GGG in the projected product and every q≥0q\ge0q≥0, K>0K>0K>0, 0<δ≤10<\delta\le10<δ≤1, cap bounds KuqKu^qKuq in both projected orientations for δ≤u≤1\delta\le u\le1δ≤u≤1 imply cap bounds C0K(1+C0)quqC_0K(1+C_0)^q u^qC0​K(1+C0​)quq in both original orientations on (P×P)−1(G)(P\times P)^{-1}(G)(P×P)−1(G) for the same radii.

The Lean formulation separates the two quantified assertions and displays the lifting constant.

Preamble
import Definitions.Def_FalconerPath_defs
open Set MeasureTheory Filter
open scoped ENNReal NNReal Topology
Formal statement
namespace FalconerPath
theorem integer_caps_and_lifting :
    (∀ (h : ℕ), 1 ≤ h → ∀ (ν ρ : Measure (Space (h+1))),
      Probability ν → Probability ρ → HasBoundedSeparated ν ρ →
      ∀ p L : ℝ, 1 < p → 0 < L → UniformRadialLp ν ρ p L →
      ∀ e : ℝ, 0 < e → ∃ C : ℝ, 0 < C ∧ ∃ N₀ : ℕ, ∀ N ≥ N₀,
        ∃ B : PairSet (h+1), MeasurableSet B ∧ B ⊆ ν.support ×ˢ ρ.support ∧
          (ν.prod ρ) B ≤ ENNReal.ofReal
            (C * (scale N) ^ (-e*(p-1)/2)) ∧
          bothCaps ν ρ ((ν.support ×ˢ ρ.support) \ B)
            h ((scale N)^e) (mesh N)) ∧
    (∀ (d m : ℕ), 1 ≤ m → m ≤ d →
      ∀ P : Space d →L[ℝ] Space m, OrthogonalSurjection P →
      ∀ ν ρ : Measure (Space d), Probability ν → Probability ρ →
        HasBoundedSeparated ν ρ →
        HasBoundedSeparated (Measure.map P ν) (Measure.map P ρ) →
        ∃ C : ℝ, 0 < C ∧ ∀ (G : PairSet m) (q K δ : ℝ),
          MeasurableSet G → 0 ≤ q → 0 < K → 0 < δ → δ ≤ 1 →
          bothCaps (Measure.map P ν) (Measure.map P ρ) G q K δ →
          bothCaps ν ρ ((fun z : Space d × Space d => (P z.1,P z.2)) ⁻¹' G)
            q (C * K * (1+C)^q) δ) := by sorry
end FalconerPath
Source
OpenAI, The Falconer distance conjecture in all dimensions, OpenAI Math Release preprint, September 23, 2026, https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/The-Falconer-distance-conjecture-in-all-dimensions-September-23-2026/paper.pdf. Section 5.2, Lemma 5.8 (Integer caps and lifting), label prep:integer-caps, first paragraph for integer caps and second paragraph for lifting.

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