# An *L*<sup>3</sup> bound for the trilinear Hilbert transform

> A singular average of three shifted functions obeys an L³ × L³ × L³ to L¹ size bound, the paper claims. Plain-English explainer with sources.

Canonical: https://closedform.nishachay.tech/e/openai-math-2026-086/
Last updated: 2026-10-14

**A singular average of three shifted functions obeys an L³ × L³ × L³ to L¹ size bound, the paper claims.**

**Trust:** Claimed, not checked · **Papers:** 1 · **First paper:** October 5, 2026 · **Field:** Real and complex analysis · **Entry:** 086

*Explained by AI.* Drafted by one AI model and checked sentence by sentence against the paper by a different one. Spot a mistake? Report an error.

The trilinear Hilbert transform multiplies three functions at points x − t, x − 2t and x − 3t. It then averages over t with weight 1/t. The question is whether the output stays controlled by the sizes of the inputs. This paper claims to prove that its total size is at most a fixed constant times the product of the inputs' L³ sizes. This is one case of a standard conjecture.

## At a glance

- **First step:** 1997 (Lacey and Thiele, the two-function (bilinear) version)
- **Significance:** Major. If the proof holds, it settles one case of a well-known open bound for straight-line trilinear averages.
- **Trust:** Claimed, not checked
- **Field:** Real and complex analysis (1 paper)

## The explanation

Take a function f that equals 2 on an interval of length 1/8, and 0 elsewhere. Its L³ size [the cube root of the total area under |f| cubed] is the cube root of 8 × 1/8. That is exactly 1. Its L¹ size [the total area under |f|] is 2 × 1/8, which is 0.25. Sizes like these measure how big a function is overall.

Now multiply three copies of f. The product equals 8 on the same short interval, so its L¹ size is 8 × 1/8 = 1. That equals 1 × 1 × 1, the product of the three L³ sizes. A classical rule called Hölder's inequality says this never fails: three L³ sizes multiplied always bound the L¹ size of the product. The exponents fit because 1/3 + 1/3 + 1/3 = 1.

The trilinear Hilbert transform makes this much harder. At each point x, it multiplies f₁ at x − t, f₂ at x − 2t and f₃ at x − 3t. Then it adds these products over every shift t, weighting each by 1/t. Positive and negative shifts get opposite signs, so much of the sum cancels. The weight blows up near t = 0, so the sum is a principal value [a symmetric interval around zero is removed, then shrunk][1].

The paper claims the Hölder pattern survives this averaging, up to a constant. The L¹ size of the output is at most a fixed number C times the three L³ sizes multiplied[2]. The constant is not computed. The paper calls this the L³ × L³ × L³ to L¹ case of the standard conjecture for slopes 1, 2 and 3.

The two-function version, with shifts x − t and x − 2t, was treated by Lacey and Thiele in 1997 and 1999[3]. With three functions, progress stalled. In 2015 Terence Tao showed some cancellation for truncated versions[4]. That improved the simple logarithmic bound to a smaller, sublogarithmic one[5]. In the account of Hu and Lie, the straight-line three-function problem remained open[6]. Their own results on curved versions address a different source of oscillation[7].

The paper names the difficulty as cancellation across scales meeting quadratic modulation[8]. A scale here is a range of shift sizes, such as t near 1, near 2, or near 4. Quadratic modulation is a wave whose phase grows like the square of position. Here is why it bites. Take the four points 0, 1, 2, 3 and the weights −1, 3, −3, 1. The weights sum to 0. The weighted positions give 0 + 3 − 6 + 3 = 0. The weighted squares give 0 + 3 − 12 + 9 = 0. Only the cubes fail, giving 0 + 3 − 24 + 27 = 6.

So a quadratic wave can line up across all four points and dodge the cancellation. The paper says such matched quadratic phases can persist in the related four-function form[9]. What is learned at one scale must not cost a loss that grows with the number of scales[10]. The paper's main outside tool is a 2024 inverse theorem of Leng, Sah and Sawhney[11]. Roughly, it says a function that defeats this kind of cancellation must partly match a structured, quadratic-like pattern. That theorem alone does not add up the scales[12]. The paper adds its own machinery to keep the loss from growing.

The scope is narrow on purpose. The full conjecture asks for a wider range of exponents[13]. The paper concerns only the one operator with slopes 1, 2 and 3[14]. Other exponent cases and other slopes stay open as far as this paper goes.

How sure is this? No Lean formalization is listed for this paper in the openai/math release. So no computer proof checker has checked it. No specialist review has been published.

**What it doesn't show.** This does not cover the other exponents in the full trilinear Hilbert transform conjecture, or other choices of slopes.

## Where it came from

This result comes from an unreleased OpenAI model, published in the openai/math release on 6 October 2026.

## Hype check

Major only if the proof holds. It covers one exponent case and one set of slopes, not the full conjecture. No Lean formalization is listed and no specialist review is published.

## Words used

- **L³ size:** The cube root of the total area under the cube of a function's absolute value (its L³ norm).
- **L¹ size:** The total area under a function's absolute value (its L¹ norm).
- **Hölder's inequality:** A classical rule that bounds the size of a product of functions by the sizes of the factors.
- **Trilinear Hilbert transform:** The operator that multiplies three functions at x − t, x − 2t, x − 3t and sums over t with weight 1/t.
- **Principal value:** A way to sum a weight that blows up at zero: cut out a symmetric interval around zero, then shrink it.
- **Quadratic modulation:** A wave-like factor whose phase grows like the square of position.
- **Inverse theorem:** A result saying that a function which defeats a certain cancellation must have a specific structure.

## The original paper

- [An L3 bound for the trilinear Hilbert transform](https://github.com/openai/math/blob/main/preprints/An-L3-bound-for-the-trilinear-Hilbert-transform-October-5-2026/paper.pdf) - October 5, 2026

## Quoted lines from the paper (14)

[1] From [An L3 bound for the trilinear Hilbert transform](https://github.com/openai/math/blob/main/preprints/An-L3-bound-for-the-trilinear-Hilbert-transform-October-5-2026/paper.pdf):

> The principal value removes a symmetric interval about the origin.

[2] From [An L3 bound for the trilinear Hilbert transform](https://github.com/openai/math/blob/main/preprints/An-L3-bound-for-the-trilinear-Hilbert-transform-October-5-2026/paper.pdf):

> We prove that the trilinear Hilbert transform with fixed slopes $1,2,3$ maps $L^3(\R)\times L^3(\R)\times L^3(\R)$ to $L^1(\R)$, resolving this case of the trilinear Hilbert transform conjecture.

[3] From [An L3 bound for the trilinear Hilbert transform](https://github.com/openai/math/blob/main/preprints/An-L3-bound-for-the-trilinear-Hilbert-transform-October-5-2026/paper.pdf):

> The bilinear predecessor was treated by Lacey and Thiele.

[4] From [An L3 bound for the trilinear Hilbert transform](https://github.com/openai/math/blob/main/preprints/An-L3-bound-for-the-trilinear-Hilbert-transform-October-5-2026/paper.pdf):

> Tao obtained cancellation for truncated multilinear Hilbert transforms, improving the elementary logarithmic truncation bound to a sublogarithmic one.

[5] From [An L3 bound for the trilinear Hilbert transform](https://github.com/openai/math/blob/main/preprints/An-L3-bound-for-the-trilinear-Hilbert-transform-October-5-2026/paper.pdf):

> Tao obtained cancellation for truncated multilinear Hilbert transforms, improving the elementary logarithmic truncation bound to a sublogarithmic one.

[6] From [An L3 bound for the trilinear Hilbert transform](https://github.com/openai/math/blob/main/preprints/An-L3-bound-for-the-trilinear-Hilbert-transform-October-5-2026/paper.pdf):

> The straight-line trilinear boundedness problem remained open in the account of Hu and Lie.

[7] From [An L3 bound for the trilinear Hilbert transform](https://github.com/openai/math/blob/main/preprints/An-L3-bound-for-the-trilinear-Hilbert-transform-October-5-2026/paper.pdf):

> Their results for curved transforms address a different source of oscillation.

[8] From [An L3 bound for the trilinear Hilbert transform](https://github.com/openai/math/blob/main/preprints/An-L3-bound-for-the-trilinear-Hilbert-transform-October-5-2026/paper.pdf):

> The difficulty in the trilinear setting is the interaction of cancellation across scales with quadratic modulation.

[9] From [An L3 bound for the trilinear Hilbert transform](https://github.com/openai/math/blob/main/preprints/An-L3-bound-for-the-trilinear-Hilbert-transform-October-5-2026/paper.pdf):

> Thus matched quadratic phases can persist in the associated four-linear form.

[10] From [An L3 bound for the trilinear Hilbert transform](https://github.com/openai/math/blob/main/preprints/An-L3-bound-for-the-trilinear-Hilbert-transform-October-5-2026/paper.pdf):

> Quantitative information at one scale must be organized so that this persistence does not produce a loss proportional to the number of scales.

[11] From [An L3 bound for the trilinear Hilbert transform](https://github.com/openai/math/blob/main/preprints/An-L3-bound-for-the-trilinear-Hilbert-transform-October-5-2026/paper.pdf):

> The inverse theorem of Leng, Sah and Sawhney provides the quantitative structural input used below.

[12] From [An L3 bound for the trilinear Hilbert transform](https://github.com/openai/math/blob/main/preprints/An-L3-bound-for-the-trilinear-Hilbert-transform-October-5-2026/paper.pdf):

> The inverse theorem alone does not sum the scales.

[13] From [An L3 bound for the trilinear Hilbert transform](https://github.com/openai/math/blob/main/preprints/An-L3-bound-for-the-trilinear-Hilbert-transform-October-5-2026/paper.pdf):

> The full conjecture asks for a broader range of exponents; see.

[14] From [An L3 bound for the trilinear Hilbert transform](https://github.com/openai/math/blob/main/preprints/An-L3-bound-for-the-trilinear-Hilbert-transform-October-5-2026/paper.pdf):

> The result here concerns the displayed fixed operator.

## Other sources

- [M. Lacey and C. Thiele, “Lᵖ estimates on the bilinear Hilbert transform for 2<p<∞”, Annals of Mathematics 146(3) (1997), 693–724](https://doi.org/10.2307/2952458)
- [M. Lacey and C. Thiele, “On Calderón's conjecture”, Annals of Mathematics 149(2) (1999), 475–496](https://arxiv.org/abs/math/9903203)
- [T. Tao, “Cancellation for the multilinear Hilbert transform”, arXiv:1505.06479 (2015)](https://arxiv.org/abs/1505.06479v3)
- [B. Hu and V. Lie, “On the curved trilinear Hilbert transform”, arXiv:2308.10706 (2023)](https://arxiv.org/abs/2308.10706)
- [B. Hu and V. Lie, “On the boundedness of the curved trilinear Hilbert transform and the curved n-linear maximal operator in the quasi-Banach regime”, arXiv:2511.07373 (2025)](https://arxiv.org/abs/2511.07373v1)
- [J. Leng, A. Sah and M. Sawhney, “Quasipolynomial bounds on the inverse theorem for the Gowers U^{s+1}\[N\]-norm”, arXiv:2402.17994 (2024)](https://arxiv.org/abs/2402.17994v3)
- [openai/math release notes (2026): model provenance and review status](https://github.com/openai/math/blob/main/README.md): “manuscripts and supporting proof artifacts produced by an internal OpenAI model”

## Related

- [Riesz transforms and rectifiability in higher codimension](https://closedform.nishachay.tech/e/openai-math-2026-081/) - Real and complex analysis
- [Local smoothing in three dimensions](https://closedform.nishachay.tech/e/openai-math-2026-079/) - Real and complex analysis
- [Endpoint Sobolev regularity of centered disk averages](https://closedform.nishachay.tech/e/openai-math-2026-085/) - Real and complex analysis
- [The geometric case of the Erdős similarity conjecture](https://closedform.nishachay.tech/e/openai-math-2026-084/) - Real and complex analysis
- [Hilbert transforms along Lipschitz directions](https://closedform.nishachay.tech/e/openai-math-2026-083/) - Real and complex analysis
- [Real and complex analysis](https://closedform.nishachay.tech/science/mathematics/real-and-complex-analysis/) - Field · 16 results
- [Open since the 1990s](https://closedform.nishachay.tech/open-since/1990s/) - Era · 55 results
- [Claimed, not yet checked](https://closedform.nishachay.tech/trust/claimed/) - Trust · 130 results
- [Report an error](https://github.com/nishachay/closed-form/issues/new?template=report-error.yml&labels=entry-error&title=%5Bentry%20086%5D%20)
