For complex functions and on , hard truncation endpoints , and , the truncated triangular Hilbert transform is defined by . The maximal triangular Hilbert transform is . For complex functions on and endpoints , the scalar triangular form in symmetric coordinates is . For exponents satisfying the scalar Hölder relation , the choice is the symmetric point. The question is whether maps boundedly into and admits an endpoint-uniform trilinear bound at the symmetric point.
Thiele stated the symmetric triangular Hilbert transform problem in Grafakos, Oliveira e Silva, Pramanik, Seeger, and Stovall. The triangular Hilbert transform appears in the discussion by Demeter and Thiele of bilinear averages for two commuting transformations. Estimates for a Walsh model with one structurally restricted input are due to Kovač, Thiele, and Zorin-Kranich. Sublogarithmic cancellation for one-dimensional multilinear Hilbert transforms was proved by Tao. Zorin-Kranich extended this cancellation to simplex Hilbert transforms. Across finitely many smooth scales, square-function estimates of Durcik, Kovač, Škreb, and Thiele gave square-root cancellation for the scalar triangular form. With hard truncation endpoints , Durcik, Kovač, and Thiele proved power-type cancellation, giving a bound at the symmetric point that grows like and retains dependence on the scale range. Bounds for averages over direction parameters were obtained by Durcik and Roos. For rough angular weights, Lin and Slavíková obtained bounds for directional averages. Christ, Durcik, and Roos proved bounds for curved translations along the curve . Hsu and Lin treated more general curves under geometric hypotheses excluding the flat curve .
The September 24, 2026 preprint proves that there exists an absolute constant such that, for every pair of complex functions , . From this estimate, for complex functions , the preprint also derives joint almost-everywhere and convergence of as and , together with an endpoint-uniform bound and joint limit as and for on complex triples, none of which the Lean library contains.
The Lean library proves this maximal inequality with a named constant built from the library’s dissipation, jump and kernel-error constants. The results on these pages are the Lean library’s, each stated as the Lean library states it and linked to the Lean declaration behind it. Lean has checked every result of the Lean library, with no unfinished proofs and no external result taken as an unproved hypothesis, so the Lean library is the reference. Where the preprint states a result differently, the statement on the page is the Lean library’s, with the preprint’s given beside it. The preprint is a guide only, giving the results their order and their names. OpenAI catalog entry 082 also lists two October 5, 2026 preprints, one on annular variation of the triangular Hilbert transform at the symmetric point and one on an bound for the dyadic triangular Hilbert form; neither of those preprints is covered, and the Lean library covers only the results of the September 24, 2026 preprint.
TriangularHilbert is a Lean library: 23 items, in seven groups. Each has a page written by OctoInform, listed below.
No item matches.