Real and complex analysis·OpenAI Math·Result 085·Lean formalisation listed

Endpoint Sobolev regularity of centered disk averages

One of the 372 results in OpenAI's public mathematics catalogue, filed under real and complex analysis: 1 preprint, the latest dated 26 September 2026. This page quotes OpenAI's own summary of the claim, links the paper and abstract, and will embed the animation.

Latest paper

An Endpoint Gradient Bound for the Centered Disk Maximal Operator

26 September 2026 · PDF

The animation for this result has not been released yet. Subscribe on YouTube to catch it.

What OpenAI claims

Resolves the planar centered-disk case of the Hajłasz–Onninen maximal-function regularity problem. For every real f ∈ W1,1(ℝ2), the centered disk maximal function satisfies ‖∇ Mf‖1 ≤ C‖∇ f‖1 with an absolute constant. It belongs locally to W1,1 and has a globally integrable weak gradient. (Lean)

Paper

  1. An Endpoint Gradient Bound for the Centered Disk Maximal Operator

    · Preprint, not peer reviewed · PDF

    We prove the endpoint gradient bound ‖∇ Mf‖1 ≤ C‖∇ f‖1 for every real-valued f ∈ W1,1(ℝ2), where Mf(x) is the supremum of the averages of |f| over disks centered at x, and C is an absolute constant. The maximal function belongs to W1,1loc(ℝ2) and has a globally integrable weak gradient. This gives a positive resolution of the planar centered-disk case of the endpoint question of Hajłasz and Onninen.

Status

Preprint. The paper has not been independently reviewed. Treat the result as OpenAI's claim until other mathematicians have checked it. If a video exists, it illustrates the statement; it is not the proof.

Related results in Real and complex analysis

All 16 results in Real and complex analysis →