Integer cap bounds and lifting through orthogonal projections
OpenFalconerPath.integer_caps_and_liftingcapsfalconerprojections
For a relation , its directional laws are and , without fiber normalization. Bounds in both orientations mean bounds at almost every pin for the corresponding marginal. Two assertions hold.
- For every integer , let be probabilities on with bounded separated supports. Suppose and , and suppose both full radial laws have jointly measurable nonnegative surface densities with th power integrals at most at every support pin. For every there exist and such that for every there is a Borel with product mass at most . On the complementary supported relation, both directional laws give every radius- cap mass at most for .
- For every , let be a continuous linear map with . Let be probabilities whose original and projected support pairs are bounded and separated. There is a fixed such that for every Borel relation in the projected product and every , , , cap bounds in both projected orientations for imply cap bounds in both original orientations on 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 FalconerPathSource
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.