## About the boundedness of a multiplication operator.

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

Let be $f$ a $2\pi-$periodic function and $\hat{f}(k)=\frac{1}{2\pi}\int_0^{2\pi}f(x)e^{-ikx}dx$. Consider the operator: \begin{equation} Tf(x)=\sum_{k\in\mathbb{Z}}sign(k)\ \hat{f}(k)\ e^{ikx}. \end{equation} I would like to know if the operator $T:L^p(0,2\pi)\rightarrow L^p(0,2\pi)$ is bounded.

-

1
This is just (a scalar multiple of) the Hilbert transform on the circle. It maps Lp to itself for 1<p<∞. See: en.wikipedia.org/wiki/Hilbert_transform – Mark Lewko Feb 25 at 11:09

1
Multiplication with a bounded sequence always gives a bounded operator: en.wikipedia.org/wiki/Multiplication_operator – András Bátkai Feb 25 at 11:14

1
@András, note the operator acts by multiplying the Fourier transform by a bounded sequence (not the function itself!) – Mark Lewko Feb 25 at 11:29
@Mark: Thank you. An amateurish mistake... – András Bátkai Feb 27 at 7:51

## 1 Answer

When $p=2$, boundedness is a triviality and it is the only trivial case. It is not true for $p=1$ nor for $p=\infty$, although the Fourier multiplier $sign(D_x)$ sends $L^1$ into $L^1_w$ and the Marcinkiewicz interpolation theorem implies boundedness in $L^p$ for all $p\in]1,+\infty[$.

The operator $sign(D_x)$ is is a particular case of the wider class of singular integrals, extensively studied by Calderon and Zygmund, later by Hörmander, Stein & Fefferman. They are defined via a simple condition on their kernels, easily proven $L^2$ bounded, with the property that they send $L^1$ into $L^1_w$. Again Marcinkiewicz Theorem allows to finish the job of proving boundedness in $L^p$ for all $p\in]1,+\infty[$.

To give a simple class of example would be to consider Fourier multiplier $F(D_x)$ where $F$ is an homogeneous function of degree 0 which is smooth outside of the origin. Note that it works as well in any dimension and that the so-called Hörmander-Mihlin multiplier Theorem allows to weaken significantly the smoothness assumption.

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 20, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8613488674163818, "perplexity_flag": "middle"}