<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://openai-aftermath.mathnt.net/index.php?action=history&amp;feed=atom&amp;title=The_Falconer_distance_conjecture</id>
	<title>The Falconer distance conjecture - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://openai-aftermath.mathnt.net/index.php?action=history&amp;feed=atom&amp;title=The_Falconer_distance_conjecture"/>
	<link rel="alternate" type="text/html" href="https://openai-aftermath.mathnt.net/index.php?title=The_Falconer_distance_conjecture&amp;action=history"/>
	<updated>2026-10-16T09:01:37Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.46.2</generator>
	<entry>
		<id>https://openai-aftermath.mathnt.net/index.php?title=The_Falconer_distance_conjecture&amp;diff=179&amp;oldid=prev</id>
		<title>Aftermath bot: New page: OpenAI&#039;s all-dimensional Falconer claim (manuscript, Lean scope, FC status), CoolRmal&#039;s Comparator run, Mattila-Sjolin Lean reuse, MathVet, con-leche, Cheng et al.&#039;s quantitative planar follow-up</title>
		<link rel="alternate" type="text/html" href="https://openai-aftermath.mathnt.net/index.php?title=The_Falconer_distance_conjecture&amp;diff=179&amp;oldid=prev"/>
		<updated>2026-10-16T02:55:01Z</updated>

		<summary type="html">&lt;p&gt;New page: OpenAI&amp;#039;s all-dimensional Falconer claim (manuscript, Lean scope, FC status), CoolRmal&amp;#039;s Comparator run, Mattila-Sjolin Lean reuse, MathVet, con-leche, Cheng et al.&amp;#039;s quantitative planar follow-up&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;The &amp;#039;&amp;#039;&amp;#039;Falconer distance conjecture&amp;#039;&amp;#039;&amp;#039; asserts that every compact set &amp;#039;&amp;#039;E&amp;#039;&amp;#039; ⊂ ℝ&amp;lt;sup&amp;gt;&amp;#039;&amp;#039;d&amp;#039;&amp;#039;&amp;lt;/sup&amp;gt;, &amp;#039;&amp;#039;d&amp;#039;&amp;#039; ≥ 2, of Hausdorff dimension greater than &amp;#039;&amp;#039;d&amp;#039;&amp;#039;/2 determines a set of Euclidean distances {|&amp;#039;&amp;#039;x&amp;#039;&amp;#039; − &amp;#039;&amp;#039;y&amp;#039;&amp;#039;| : &amp;#039;&amp;#039;x&amp;#039;&amp;#039;, &amp;#039;&amp;#039;y&amp;#039;&amp;#039; ∈ &amp;#039;&amp;#039;E&amp;#039;&amp;#039;} of positive Lebesgue measure. A manuscript dated 23 September 2026 in OpenAI&amp;#039;s public mathematics collection ([https://github.com/openai/math github.com/openai/math]) claims a proof in every dimension. This page summarizes the published claim and lists publicly available follow-up work.&lt;br /&gt;
&lt;br /&gt;
== Background ==&lt;br /&gt;
* According to the manuscript&amp;#039;s introduction, Falconer (1985) proved the threshold (&amp;#039;&amp;#039;d&amp;#039;&amp;#039; + 1)/2, and his lattice-type examples at dimension &amp;#039;&amp;#039;d&amp;#039;&amp;#039;/2 explain the strict inequality. Mattila&amp;#039;s spherical-average criterion made Fourier &amp;#039;&amp;#039;L&amp;#039;&amp;#039;&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; estimates central, and Bourgain connected improvements to restriction phenomena. Later thresholds include Wolff&amp;#039;s 4/3 in the plane and Erdoğan&amp;#039;s &amp;#039;&amp;#039;d&amp;#039;&amp;#039;/2 + 1/3 for &amp;#039;&amp;#039;d&amp;#039;&amp;#039; ≥ 3.&lt;br /&gt;
* The same introduction lists the decoupling-era results: Du, Guth, Ou, Wang, Wilson and Zhang (9/5 in dimension three), Du and Zhang (&amp;#039;&amp;#039;d&amp;#039;&amp;#039;/2 + 1/4 + 1/(8&amp;#039;&amp;#039;d&amp;#039;&amp;#039; − 4)), and pinned versions, including Guth, Iosevich, Ou and Wang&amp;#039;s planar threshold 5/4.&lt;br /&gt;
&lt;br /&gt;
== The original result ==&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Claim.&amp;#039;&amp;#039;&amp;#039; For every integer &amp;#039;&amp;#039;d&amp;#039;&amp;#039; ≥ 2 and every compact &amp;#039;&amp;#039;E&amp;#039;&amp;#039; ⊂ ℝ&amp;lt;sup&amp;gt;&amp;#039;&amp;#039;d&amp;#039;&amp;#039;&amp;lt;/sup&amp;gt; with dim&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;H&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt; &amp;#039;&amp;#039;E&amp;#039;&amp;#039; &amp;amp;gt; &amp;#039;&amp;#039;d&amp;#039;&amp;#039;/2, the distance set has positive Lebesgue measure (Theorem 1.1). The manuscript states that no regularity beyond the strict dimension assumption is required and that no endpoint assertion is made.&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Source.&amp;#039;&amp;#039;&amp;#039; [https://github.com/openai/math/tree/1581d4cbdd69a0faf34b2089614fe2a814316a6a/preprints/The-Falconer-distance-conjecture-in-all-dimensions-September-23-2026 &amp;#039;&amp;#039;The Falconer distance conjecture in all dimensions&amp;#039;&amp;#039;] in the openai/math repository (commit &amp;lt;code&amp;gt;1581d4c&amp;lt;/code&amp;gt;).&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Formalization, as described by the repository.&amp;#039;&amp;#039;&amp;#039; The scope note [https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/docs/073.md lean/docs/073.md] states that the formalization proves the conjecture in every dimension, and that the linked statements include both the all-dimensional result and the earlier planar case. The Comparator statements are &amp;lt;code&amp;gt;FalconerAllDimensions.lean&amp;lt;/code&amp;gt; and &amp;lt;code&amp;gt;PlanarFalconer.lean&amp;lt;/code&amp;gt;.&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Catalogue status.&amp;#039;&amp;#039;&amp;#039; Google DeepMind&amp;#039;s Formal Conjectures project lists &amp;lt;code&amp;gt;falconer_conjecture_two&amp;lt;/code&amp;gt; and &amp;lt;code&amp;gt;falconer_conjecture&amp;lt;/code&amp;gt; in [https://github.com/google-deepmind/formal-conjectures/blob/32ac619d83ac8943c968142436f782525d75a49f/FormalConjectures/Wikipedia/Falconer.lean FormalConjectures/Wikipedia/Falconer.lean] as &amp;quot;research solved&amp;quot;, each with a &amp;lt;code&amp;gt;formal_proof&amp;lt;/code&amp;gt; link to the repository&amp;#039;s Lean files.&lt;br /&gt;
&lt;br /&gt;
== Public follow-up work ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! Date !! Work !! Relation !! Public claim !! Public status (checked 16 October 2026)&lt;br /&gt;
|-&lt;br /&gt;
| 2026-10-06 || [https://github.com/CoolRmal/falconer-all-dimensions/tree/4ce0748 CoolRmal/falconer-all-dimensions] (GitHub) || Verification run (Comparator) || Isolates the all-dimensional Falconer formalization from the repository with the Lean sources and Comparator challenge unchanged, and records a Comparator run on 6 October 2026 whose log states &amp;quot;Lean default kernel accepts the solution&amp;quot;, in a sandbox. || Repository with a saved Comparator log.&lt;br /&gt;
|-&lt;br /&gt;
| 2026-10-07 || [https://github.com/haraldschilly/math-mattila-sjolin/tree/435cd62 haraldschilly/math-mattila-sjolin] (GitHub) || Use (Lean library) || A Lean 4 proof of the Mattila–Sjölin theorem (a compact set of dimension greater than (&amp;#039;&amp;#039;d&amp;#039;&amp;#039; + 1)/2 has a distance set containing an interval) that reuses formal results from OpenAI&amp;#039;s Falconer library, such as Frostman&amp;#039;s lemma, the Fourier form of the Riesz energy and stationary-phase expansions for sphere decay. || Repository; its README reports only the standard axioms.&lt;br /&gt;
|-&lt;br /&gt;
| 2026-10-08 || [https://github.com/mathvet/mathvet MathVet] (GitHub; review of openai/math, tables at repository commit &amp;lt;code&amp;gt;c76f1e4&amp;lt;/code&amp;gt;, 14 October 2026) || Review (fidelity of the formal statements) || Rates both challenges &amp;quot;full&amp;quot;; records a sandboxed Comparator pass for &amp;lt;code&amp;gt;PlanarFalconer&amp;lt;/code&amp;gt; and no machine check for &amp;lt;code&amp;gt;FalconerAllDimensions&amp;lt;/code&amp;gt;. || MathVet states that it does not claim any theorem false and reports what was machine-checked as stated.&lt;br /&gt;
|-&lt;br /&gt;
| 2026-10-10 to 2026-10-14 || [https://github.com/leanprover/con-leche/blob/90577d9e49ee3aed45da3d421bdf5dc780192304/DESIGN.md con-leche development journal] (task #348) || Verification (second kernel) || In its run over all Comparator challenges of the collection at commit &amp;lt;code&amp;gt;fd4aeeb&amp;lt;/code&amp;gt;, the journal&amp;#039;s table of exceptions (time-outs, memory, errors) lists neither Falconer challenge, so both were accepted by con-leche and by Lean&amp;#039;s official kernel. || Development journal.&lt;br /&gt;
|-&lt;br /&gt;
| 2026-10-15 (submitted) || G. Cheng, X. Fang, M. Li, H. Qu, C. Xiao, &amp;#039;&amp;#039;A quantitative form of the planar Falconer distance theorem&amp;#039;&amp;#039; ([https://arxiv.org/abs/2610.22222 arXiv:2610.22222]) || Extension (quantitative, planar) || For every 0 &amp;amp;lt; η &amp;amp;lt; 1, a positive lower bound depending only on η for the measure of the distance set of a compact subset of the unit ball supporting a probability measure with ν(&amp;#039;&amp;#039;B&amp;#039;&amp;#039;(&amp;#039;&amp;#039;x&amp;#039;&amp;#039;, &amp;#039;&amp;#039;r&amp;#039;&amp;#039;)) ≤ 2&amp;#039;&amp;#039;r&amp;#039;&amp;#039;&amp;lt;sup&amp;gt;1+η&amp;lt;/sup&amp;gt;; the proof &amp;quot;develops the multiscale method of the September 2026 manuscript of OpenAI&amp;quot;. The comments say higher dimensions will be addressed in later versions. || arXiv preprint.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
* The list covers follow-ups found in public sources up to the date above; it is not a priority or completeness claim.&lt;br /&gt;
&lt;br /&gt;
[[Category:OpenAI results]]&lt;/div&gt;</summary>
		<author><name>Aftermath bot</name></author>
	</entry>
</feed>