Sharp logarithmic Kakeya maximal bounds
For each direction, take the largest average of a function’s absolute value over unit tubes of radius pointing that way. How does the norm of these largest averages grow as the tubes narrow?
Why it matters and what counts as progress
Why it matters: The growth rate limits how tightly tubes pointing in different directions can overlap. It also controls the volume of thin neighborhoods of sets that contain a unit segment in every direction.
What counts as progress: An upper bound must hold for every function in the stated class. A matching example shows that the dependence on cannot be improved. Weighted sums of tube indicators give a closely related estimate.
How the problem developed
- 16 Jul 2026 · Matching construction [5]
Rafael J. Fernández-Delgado and Mikael de la Salle Constructed Kakeya sets with a neighborhood-volume upper bound of the conjectured logarithmic order.
- 25 Oct 2026 · Local-smoothing argument [4]
OpenAI Developed analytic ideas that Lewko and ChatGPT later used for the sharp bound.
Mark Lewko and ChatGPT Reported the sharp maximal estimate and weighted tube bound. Palomar registered a Lean check of both upper estimates.
AI contribution
The sharp Kakeya maximal inequality in all dimensions
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.
Sources
Publication history
Daily emails by default, only when there’s an update.