Centered Hardy–Littlewood maximal constant in dimension 2
In ℝ^d (d≥ 1), let M_d denote the centered Hardy–Littlewood maximal operator associated to cubes, defined by M_d f(x) := sup_r>0 1/lvert Q(x,r)rvert∫_Q(x,r) lvert f(y)rvert dy, where Q(x,r) is a closed ℓ_∞ ball of radius r and center x in ℝ^d, that is, a closed cube centered at x, with sides…
Current state (tracked automatically)
- Best known bounds for constant 47a: 1.6855099933 ≤ C ≤ 3.879. Upper bound ([Lin2026], Comparison with an explicit kernel for the Cauchy generator A=- D\_u- D\_v); lower bound ([Lin2026], Periodic measure: masses 1 and w=(17+422)/9 on alternating columns x=ih, rows y=jV, with h=(5+22)/6 and V=h+1).
All tracked facts and sources
| Fact | Value | Source |
|---|---|---|
| Best lower bound with an explicit value (constant 47a) | 1.6855099933 [Lin2026] — Periodic measure: masses 1 and w=(17+422)/9 on alternating columns x=ih, rows y=jV, with h=(5+22)/6 and V=h+1. | Tao's optimization constants |
| Best upper bound with an explicit value (constant 47a) | 3.879 [Lin2026] — Comparison with an explicit kernel for the Cauchy generator A=- D\_u- D\_v. | Tao's optimization constants |
Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): Tao's optimization constants (checked 2026-11-12). How it works.
From the catalogue. Imported from Terence Tao and contributors (optimizationproblems repository) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim.
Cite
@misc{cairn-constant-47a-centered-hardy-littlewood-maximal-constant-in-dimension-2,
title = {Centered Hardy–Littlewood maximal constant in dimension 2},
author = {{Cairn Commons contributors}},
howpublished = {\url{https://cairn-commons.com/problems/constant-47a-centered-hardy-littlewood-maximal-constant-in-dimension-2}},
year = {2026},
note = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-12}
} Also: CITATION.cff · Atom feed of results
Status badge for a README (shields.io):
[](https://cairn-commons.com/problems/constant-47a-centered-hardy-littlewood-maximal-constant-in-dimension-2)
- Claims
- 0
- Verified
- 0
- Disputed
- 0
- Refuted
- 0
- On the literature board
- 0
Nobody has worked on this problem here yet
Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.
- Get a task — one click
- Your chatbot works on it — 5–10 minutes, in its own tab
- Paste its answer here — check it and publish it under your name
What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.
ChatGPT opens in a new tab and starts on the task right away; Claude opens with it filled in.
Current state
No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.
The problem
Description of constant
In (), let denote the centered Hardy–Littlewood maximal operator associated to cubes, defined by
where is a closed ball of radius and center in , that is, a closed cube centered at , with sides parallel to the coordinate axes, and sidelength , and denotes Lebesgue measure. <a href="#Ald2011-def-Md">[Ald2011-def-Md]</a> <a href="#Ald2011-def-Qxr">[Ald2011-def-Qxr]</a>
Let be the smallest constant such that for every and every ,
<a href="#Ald2011-def-cd">[Ald2011-def-cd]</a>
We define
the optimal weak-type constant of the centered Hardy–Littlewood maximal operator associated to axis-parallel squares in .
Known upper bounds
| Bound | Reference | Comments |
|---|---|---|
| [Tao2006] | The standard covering-lemma proof gives an explicit constant in the weak-type inequality, and the same argument applies to cubes; hence . [Tao2006-weak-3d] [Tao2006-cubes] | |
| [Tao2010] | The Vitali-covering proof can be sharpened from to by covering centers with -dilates of a disjoint subcollection and letting . The same argument applies to balls, i.e. axis-parallel cubes; hence . [Tao2010-ex42] | |
| <a href="#Lin2026">[Lin2026]</a> | Comparison with an explicit kernel for the Cauchy generator . In the diamond radius , the kernel with and satisfies on the unit diamond and away from the origin, which gives . Formalized in Lean 4 as CenteredMaximal.weakTypeConstant_two_le_upper. |
Known lower bounds
| Bound | Reference | Comments |
|---|---|---|
| [Ald2000] | Aldaz's Proposition 1.4 gives a lower bound in every dimension . Specializing the formula to gives the displayed value. [Ald2000-prop1.4] | |
| <a href="#Mel2003">[Mel2003]</a>, <a href="#Ald2011">[Ald2011]</a> | Melas proved . Since , we get . <a href="#Mel2003-c1-formula">[Mel2003-c1-formula]</a> <a href="#Ald2011-monotone">[Ald2011-monotone]</a> | |
| <a href="#Lin2026">[Lin2026]</a> | Periodic measure: masses and on alternating columns , rows , with and . Its maximal function is at least on a period cell except four open slots, so , where , and . Formalized in Lean 4 and registered on Palomar. <a href="#Lin2026-construction">[Lin2026-construction]</a> |
Additional comments and links
- Reading the tables. Rows are in chronological order, not in order of strength, so the last row is not always the record. The current records are the \Phipprox 1.6855099933 lower bound and the upper bound, both [Lin2026]; among the earlier lower bounds, [Ald2000]'s pprox 1.6211915 is stronger than the [Mel2003] row that follows it.
- Status. The exact value of is unknown; in fact, no best constants are known for . <a href="#Ald2011-open-d-gt-1">[Ald2011-open-d-gt-1]</a>
- Dimension growth for cubes. For cube averages, the optimal weak-type constants satisfy as . <a href="#Ald2011-cd-infty">[Ald2011-cd-infty]</a>
- Discretization (Dirac deltas). For cubes, studying sums of Dirac deltas suffices for upper bounds and growth questions; moreover discretization does not change the best constants. <a href="#Ald2011-discretization">[Ald2011-discretization]</a>
References
- [Ald2000] Aldaz, José M. A remark on the centered -dimensional Hardy-Littlewood maximal function. Czechoslovak Mathematical Journal 50 (2000), no. 1, 103-112. MR 1745465. DML-CZ. PDF.
- [Ald2000-prop1.4] loc: p. 110, Proposition 1.4. note: Specializing Aldaz's formula to gives .
- <a id="Ald2011"></a>[Ald2011] Aldaz, José M. The weak type (1,1) bounds for the maximal function associated to cubes grow to infinity with the dimension. Annals of Mathematics (2) 173 (2011), no. 2, 1013–1023. DOI: 10.4007/annals.2011.173.2.10. Google Scholar+bounds+for+the+maximal+function+associated+to+cubes+grow+to+infinity+with+the+dimension+Aldaz). arXiv PDF
- <a id="Ald2011-cd-infty"></a>[Ald2011-cd-infty] loc: arXiv PDF p.1, Abstract. quote: “We show that as .”
- <a id="Ald2011-def-Md"></a>[Ald2011-def-Md] loc: arXiv PDF p.1, Introduction (definition of ). quote: “(1) .”
- <a id="Ald2011-def-Qxr"></a>[Ald2011-def-Qxr] loc: arXiv PDF p.1, Introduction (definition of ). quote: “By a cube we mean a closed ball of radius and center in , that is, a closed cube centered at , with sides parallel to the coordinate axes, and sidelength .”
- <a id="Ald2011-def-cd"></a>[Ald2011-def-cd] loc: arXiv PDF p.1, Introduction (definition of ). quote: “Denote by the best (i.e. lowest) constant satisfying (2) in .”
- <a id="Ald2011-monotone"></a>[Ald2011-monotone] loc: arXiv PDF p.1, Introduction. quote: “In fact, these constants approach in a monotone manner, since by [AV, Theorem 2].”
- <a id="Ald2011-discretization"></a>[Ald2011-discretization] loc: arXiv PDF p.2, Introduction. quote: “We mention for completeness that considering Dirac deltas also suffices to give upper bounds, as shown by M. de Guzmán, see [Gu, Theorem 4.1.1]. Furthermore, M. Trinidad Menárguez and F. Soria proved that discretizing does not alter constants, cf. [MS, Theorem 1], so it can be used to study the precise values of .”
- <a id="Ald2011-open-d-gt-1"></a>[Ald2011-open-d-gt-1] loc: arXiv PDF p.2, Introduction. quote: “No best constants are known for dimensions larger than one.”
- <a id="Lin2026"></a>[Lin2026] Lin, Yongxi. Bounds 1.6855 and 3.879 for the planar centred Hardy-Littlewood maximal constant over squares. Lean 4 formalization, GitHub at commit
8e1ee3d, registered on the Palomar registry as PALOMAR-2026-09-19-000002 (2026). - <a id="Lin2026-construction"></a>[Lin2026-construction] loc:
README.md(section The construction) anddocs/PROOF.md. note: The Lean statementCenteredMaximal.ofReal_phi_le_weakTypeConstant_twouses closed cubes and the strict level set , which gives the same constant as the non-strict level set used above. The compared theorems depend only on the axiomspropext,Classical.choiceandQuot.sound.
- <a id="Mel2003"></a>[Mel2003] Melas, Antonios D. The best constant for the centered Hardy–Littlewood maximal inequality. Annals of Mathematics (2) 157 (2003), no. 2, 647–688. DOI: 10.4007/annals.2003.157.647. Google Scholar. arXiv PDF
- <a id="Mel2003-c1-formula"></a>[Mel2003-c1-formula] loc: arXiv PDF p.3, Introduction (equation (1.8) and the following sentence). quote: “Hence (1.8) is the largest solution of the quadratic equation (1.9) .”
- [Tao2010] Tao, Terence. 245A, Notes 5: Differentiation theorems. What's new, 16 October 2010. Blog post.
- [Tao2010-ex42] loc: Exercise 42. quote: “Improve the constant in the Hardy-Littlewood maximal inequality to .”
- <a id="Tao2006"></a>[Tao2006] Tao, Terence. 247A Notes 3: Maximal theorem of Hardy-Littlewood. Lecture notes (Fall 2006). Google Scholar. Author PDF
- <a id="Tao2006-weak-3d"></a>[Tao2006-weak-3d] loc: Author PDF (
notes3.pdf) p.3, end of proof of Theorem 1.2. quote: “and then on summing (1) we get (2) (with an explicit constant of ).” - <a id="Tao2006-cubes"></a>[Tao2006-cubes] loc: Author PDF (
notes3.pdf) p.3, Remark 1.4. quote: “One can also replace balls by similar objects, such as cubes; the main property that one needs is that if two such objects overlap, then the smaller one is contained in some dilate of the larger.”
What counts as progress
- A better upper or lower bound, with a proof or a construction whose value is re-computed by published code (reproducible), ideally with a certificate a deterministic checker can validate.
- A formal proof (Lean) of a known bound, or a precise error in a claimed one.
- New references for the tables above (literature claims).
Source and licence
Imported from the crowdsourced repository of optimization constants (Terence Tao and contributors), commit 87b4ebbd426f, Apache License 2.0; reformatted for this page. New records should also be reported there.