Carleson's convergence theorem for Dirichlet series. (Q1880008)

From MaRDI portal
Revision as of 17:49, 13 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Carleson's convergence theorem for Dirichlet series.
scientific article

    Statements

    Carleson's convergence theorem for Dirichlet series. (English)
    0 references
    0 references
    0 references
    16 September 2004
    0 references
    Lennart Carleson's famous theorem states that Fourier series of functions in \(L^2\) are convergent almost everywhere. The authors' aim is to prove an analogous theorem for Dirichlet series \[ f(s) = \sum_{n=1}^\infty {{a_n}\over {n^s}}, \] satisfying \[ \sum_{n=1}^\infty | a_n| ^2 < \infty. \] These Dirichlet series form a Hilbert space \(\mathcal H\), they are analytic in \(\Re(s)> {1\over 2}\) and define a locally \(L^2\)--function on \(\Re(s)={1\over 2}\). The authors' main result is \[ \sum_{n=1}^\infty {{a_n} \over {n^{{1\over 2} +it}}} \qquad \text{ is convergent for almost every real }t. \] Next, the authors deal with twisted Dirichlet series \[ f_\chi(s) = \sum_{n=1}^\infty a_n \cdot \chi(n) \cdot {1\over{n^s}}, \] where \(\chi\) is a character (\(\chi(1)=1, \; \chi(n)\) is complex of absolute value 1, and \(\chi(mn)=\chi(m)\chi(n)\)). The Haar measure on the group \(\Xi\) of characters allows to use the phrase ``almost all characters''. Then the authors prove: If \(f\in\mathcal H\) is a Dirichlet series, \(\chi\) a character, then the series \[ f_\chi(it) = \sum_{n=1}^\infty a_n \chi(n) \cdot {1\over {n^{it}}} \] is convergent for allmost all characters and almost all real numbers \(t\), and the series \[ \tilde f(\chi) = \sum_{n=1}^\infty a_n \chi(n) \] is convergent for almost all characters \(\chi\). This theorem can be applied to an almost-sure-estimate of character sums: For any \(\epsilon > 0\) the estimate \[ \sum_{n\leq N} \chi(n) = {\mathcal O}\left( \sqrt{N \log N\,} (\log\log N)^{{1\over 2}+ \epsilon}\right) \qquad\text{as } N\to\infty \] is true for almost every character \(\chi\). The estimate \[ \sum_{n\leq N} \chi(n) = {\mathcal O}\left( {{\sqrt{N\,}} \over {\log N}} \right) \] is \textbf{not}\ true for almost every character \(\chi\). For the proofs, the authors ``reformulate'' the Carleson-Hunt maximal function estimate, for example they obtain, with an absolute constant \(B\) and with the kernel function \(\displaystyle K(x,\theta) = {{e^{-i\theta x}}\over {ix}}\), \[ \begin{multlined} \int_0^\infty \int_0^\infty \int_{-\pi}^\pi \int_{-\pi}^\pi K\Bigl(x-y,\max(\theta_1,\theta_2)\Bigr) \phi(x,\theta_1) \bar\phi (y,\theta_2) dx dy d\theta_1 d\theta_2 \\ \leq \int_{-\pi} \left( \int_0^\infty | \phi(x,\theta)| d\theta \right)^2 dx,\end{multlined} \] where \(\phi \) is a \({\mathcal C}^\infty \)--function with compact support contained in \(]-\alpha,\alpha[ \times [0,\infty]\), where \(0<\alpha < {1\over 2} \pi\).
    0 references
    Hilbert space of Dirichlet series
    0 references
    Carleson's [almost] convergence theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references