Bounds for the weak type (1,1) constant of the centred maximal operator over squares

A mix of human-written and AI-generated textHuman understanding: all partsmath.CA — Classical Analysis and ODEsmath.AP — Analysis of PDEsmath.NA — Numerical Analysis

Contributed by Tejasvi Singh Tomar ↗

Version 1 / Nov 15, 2026 / CC BY 4.0

Abstract

Let c2c_2 be the best constant in the weak type (1,1)(1,1) inequality for the centred Hardy–Littlewood maximal operator over axis-parallel squares in the plane. We prove 1.7027237335≤c2≤3.591231.7027237335\le c_2\le3.59123, improving the bounds 1.6855…≤c2<3.6157491.6855\ldots\le c_2<3.615749 obtained by Lin. The upper bound comes from a new kernel in Lin's comparison principle, which bounds c2c_2 by half the integral of a suitable kernel; closed forms for the fractional operator in this principle make its conditions checkable. The lower bound comes from a periodic measure obtained by modifying Lin's lattice of point masses. Both proofs are computer-assisted and formally verified in Lean.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716077

References

  1. J. M. Aldaz, A remark on the centered nn-dimensional Hardy--Littlewood maximal function , Czechoslovak Math. J. 50 (2000), 103--112.
  2. J. M. Aldaz, The weak type (1,1)(1,1) bounds for the maximal function associated to cubes grow to infinity with the dimension , Ann. of Math. (2) 173 (2011), 1013--1023.
  3. P. Courrège, Générateur infinitésimal d'un semi-groupe de convolution sur Rn\R^n, et formule de Lévy--Khinchine , Bull. Sci. Math. (2) 88 (1964), 3--30.
  4. E. Di Nezza, G. Palatucci and E. Valdinoci, Hitchhiker's guide to the fractional Sobolev spaces , Bull. Sci. Math. 136 (2012), 521--573.
  5. Q. Huangfu and J. A. J. Hall, Parallelizing the dual revised simplex method , Math. Program. Comput. 10 (2018), 119--142.
  6. F. Johansson, Arb: efficient arbitrary-precision midpoint-radius interval arithmetic , IEEE Trans. Comput. 66 (2017), 1281--1292.
  7. Y. Lin, c2<4c_2<4 , manuscript (PDF of 30 September 2026), https://coolrmal.github.io/assets/papers/c2-less-than-4.pdf.link
  8. Y. Lin, Centred maximal constants for squares and Euclidean balls , Lean formalization, https://github.com/CoolRmal/centered-maximal-constant, commit 72c022b (1 October 2026); Palomar registry entry PALOMAR-2026-09-19-000002, version 3.link
  9. Y. Lin, Two partial balayage principles for weak-type estimates , manuscript (PDF of 5 October 2026), https://coolrmal.github.io/assets/papers/two-partial-balayage-principles.pdf.link
  10. Y. Lin, Two partial balayage principles in Lean , Lean formalization, https://github.com/CoolRmal/partial-balayage-lean, commit 0055cdf (6 October 2026, UTC); the files for squares were removed later the same day in commit f0777f5 . The Lean build of commit 0055cdf passed; its Comparator check did not complete.link
Show all 14 referencesShow fewer references
  1. A. D. Melas, The best constant for the centered Hardy--Littlewood maximal inequality , Ann. of Math. (2) 157 (2003), 647--688.
  2. D. Spector and C. B. Stockdale, The weak-type (1,1)(1,1) bound for the Hardy--Littlewood maximal function is O(nlog⁡n)O(\sqrt n\log n) , arXiv:2609.05377, 2026.arXiv
  3. T. Tao, 245A, Notes 5: Differentiation theorems , 2010, https://terrytao.wordpress.com/2010/10/16/245a-notes-5-differentiation-theorems/.link
  4. T. Tao et al., Optimization constants in mathematics , https://teorth.github.io/optimizationproblems/, 2026.link

Version history

  1. v1 · 12 pagesSubmitted by Tejasvi Singh TomarPublished on Zenodo: https://doi.org/10.5281/zenodo.23716077CurrentNov 15, 2026