The Polynomial Carleson Operator

TL;DR

This paper proves the $L^p$-boundedness of the Polynomial Carleson operator in one dimension, introducing new wave-packet analysis and tile discretization techniques that eliminate exceptional sets and establish full boundedness range.

Contribution

It introduces a novel higher-order wave-packet framework and a new tile discretization method, advancing the analysis of the Polynomial Carleson operator and resolving longstanding conjectures.

Findings

Established $L^p$ boundedness for $1<p< $ in the polynomial Carleson operator.

Developed a new framework for higher-order wave-packet analysis.

Provided a direct proof of the strong $L^2$ bound without interpolation.

Abstract

We prove affirmatively the one dimensional case of a conjecture of Stein regarding the $L^p$-boundedness of the Polynomial Carleson operator, for $1<p<\infty$. The proof is based on two new ideas: i) developing a framework for \emph{higher-order wave-packet analysis} that is consistent with the time-frequency analysis of the (generalized) Carleson operator, and ii) a new tile discretization of the time-frequency plane that has the major consequence of \emph{eliminating the exceptional sets} from the analysis of the Carleson operator. As a further consequence, we are able to provide the full $L^p$ boundedness range and prove directly -- without interpolation techniques -- the strong $L^2$ bound for the (generalized) Carleson operator, answering a question raised by C. Fefferman.