What was already known
The argument builds on OpenAI’s local-smoothing development. Fernández-Delgado and de la Salle constructed Kakeya sets whose neighborhood volumes have the matching logarithmic order.
AI involvement
Mark Lewko credits ChatGPT with refining the local-smoothing ideas to obtain the sharp estimate. Lewko directed the work and formulated the target. His disclosure leaves the attribution of individual proof steps open.
- Lewko’s result and account of the ChatGPT workAI work and human attribution
- Pinned Kakeya proof and attribution notesAI work and human attribution
Importance
The two estimates give the sharp logarithmic scale for the maximal bound and the corresponding Kakeya neighborhood-volume problem in every dimension at least two.
Technical verification
Palomar reports that Comparator replayed the two statements in Lean 4.35.0 with nanoda and con-ron.
Formal checking
Replayed sharpMaximalBound and sharpTubeBound at the pinned commit with Lean 4.35.0, nanoda and con-ron.
- Checker
- Palomar Comparator
- Scope
- For and , Lewko obtains the Kakeya maximal bound with factor . The weighted estimate bounds the integral of by a dimension-dependent constant times , where , the weights are nonnegative, and the unit tubes have radius and -separated directions.
- Basis
- Reported by the linked checker
- Palomar check of the two Kakeya upper boundsPalomar check of the two Kakeya upper bounds
Human understanding
Lewko explains the volume consequence and the radial sharpness example. Ruixiang Zhang asks how the proof reduces the propagation step, and the discussion gives no explanation of that step.
Correction and publication history
Curated Lewko’s sharp Kakeya estimates and the Palomar replay of both upper bounds.
Read this published revision