The fixed-width Lipschitz Kakeya maximal-function conjecture
Let be a Lipschitz map from to the unit circle. For rectangles satisfying and , define
Fixed-width Lipschitz Kakeya conjecture. For some and some finite , for all , all Lipschitz vector fields , and , the operator maps to with norm at most . This fixed-width form is stronger than what is needed for the paper's conditional Hilbert-transform results and is not verified in the source.
References
- Michael Lacey and Xiaochun Li, “On a Conjecture of EM Stein on the Hilbert Transform on Vector Fields”, arXiv:0704.0808 (2008).
Progress summary
A detailed proof blueprint was submitted on September 3, 2026, but it does not prove the conjecture, so the general case remains open.
The conjecture asks for a polynomial weak-type bound for fixed-width rectangles following an arbitrary Lipschitz direction field, for some and finite . Lacey and Li treated this estimate as a conjectural hypothesis in their 2008 conditional work on Hilbert transforms.
Known results
- For one-variable fields , Lacey–Li proved an bound for every , with loss at most .
- In 2011, fixed-width one-variable estimates gave an bound with logarithmic loss and interpolated bounds for .
- For a related variable-width operator, Lacey–Li proved a weak- bound with loss at most ; this does not imply the stated conjecture.
Community submission (unverified), September 3, 2026
A submitted article expands a fourteen-stage roadmap involving discretization, local freezing, angular decompositions, incidence estimates, multiplicity bounds, and recursive -loss bookkeeping. It presents proof obligations and verification checkpoints, but no verified proof of the conjecture.
Current status (as of September 2026): The one-variable and related variable-width cases are known, while the general fixed-width conjecture remains open and the September submission is unverified.
Sources
Solutions 1
THE FIXED-WIDTH LIPSCHITZ KAKeya MAXIMAL-FUNCTION CONJECTURE A More Analytical 14-Stage Research Article Definitions • Geometric Reduction • Incidence Theory • Weak-Type Analysis • Proof Assembly Research manuscript — exploratory and proof-oriented; not a claim that the conjecture is solved.See full solution
This article develops a substantially more analytical version of the fourteen-stage roadmap for the fixed-width Lipschitz Kakeya maximal-function conjecture. The objective is to expose the precise mathematical interfaces between the geometry of admissible rectangles and the desired weak-L^p estimate for some 1<p<2. The argument is organized around normalization, dyadic discretization, local freezing of the Lipschitz field, good-set and angular decompositions, multiplicity estimates, longitudinal multiscale analysis, recursive polynomial δ-losses, and the final distributional inequality. Each stage is expanded into concrete substeps, candidate lemmas, bookkeeping requirements, and verification checkpoints.