Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A contact interval for Lipschitz profiles (Falconer, Lemma prep:contact)

Proved
OAI.Falconer.profile_contact_interval

by dangnguyen · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisfalconerlipschitzreal-analysis

Let m:R→Rm:\mathbb{R}\to\mathbb{R}m:R→R be KKK-Lipschitz on [0,1][0,1][0,1] with m(0)=0m(0)=0m(0)=0, and suppose m(u)≥sum(u)\ge sum(u)≥su for every u∈[0,1]u\in[0,1]u∈[0,1]. If q<t<sq<t<sq<t<s, then there exist 0<A<B<10<A<B<10<A<B<1 with B<2AB<2AB<2A such that

m(w)≥qw(0≤w≤A),m(w)\ge qw \quad (0\le w\le A),m(w)≥qw(0≤w≤A), m(w)−m(A)≥t(w−A)(A≤w≤B),m(w)-m(A)\ge t(w-A) \quad (A\le w\le B),m(w)−m(A)≥t(w−A)(A≤w≤B), m(w)−m(B)≥q(w−B)(B≤w≤1).m(w)-m(B)\ge q(w-B) \quad (B\le w\le 1).m(w)−m(B)≥q(w−B)(B≤w≤1).

Only the values of mmm on [0,1][0,1][0,1] matter. The paper states the lemma for m:[0,1]→Rm:[0,1]\to\mathbb{R}m:[0,1]→R nondecreasing and Lipschitz. The nondecreasing assumption is not needed, so this statement omits it and is slightly stronger than the paper's. It matches the statement of the same lemma in OpenAI's Lean formalization (OAI.Falconer.profile_contact_interval).

Preamble
import Mathlib
open Set
open scoped NNReal
Formal statement
namespace OAI
namespace Falconer
theorem profile_contact_interval {m : ℝ → ℝ} {K : ℝ≥0} {q t s : ℝ}
    (hm : LipschitzOnWith K m (Icc 0 1)) (hzero : m 0 = 0)
    (hlower : ∀ u ∈ Icc (0:ℝ) 1, s*u ≤ m u) (hqt : q < t) (hts : t < s) :
    ∃ A B : ℝ, 0 < A ∧ A < B ∧ B < 1 ∧ B < 2*A ∧
      (∀ w ∈ Icc 0 A, q*w ≤ m w) ∧
      (∀ w ∈ Icc A B, t*(w-A) ≤ m w-m A) ∧
      (∀ w ∈ Icc B 1, q*(w-B) ≤ m w-m B) := by sorry
end Falconer
end OAI
Source
OpenAI, The Falconer distance conjecture in all dimensions, OpenAI Math Release preprint, September 23, 2026, Section 4 (Preparation), Lemma 'A contact interval' (label prep:contact), https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/The-Falconer-distance-conjecture-in-all-dimensions-September-23-2026/paper.pdf. Lean statement as in https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/MeasureTheory/Falconer/Recursion/ProfileContactInterval.lean#L30-L36

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