Hilbert's inequality

In analysis, a branch of mathematics, Hilbert's inequality states that

$\left|\sum _{r\ne s}\frac{u_r\overline{u_s}}{r-s}\right|\le \pi \sum _r|u_r{|}^2.$

for any sequence Template:Math of complex numbers. It was first demonstrated by David Hilbert with the constant Template:Math instead of Template:Math; the sharp constant was found by Issai Schur. It implies that the discrete Hilbert transform is a bounded operator in Template:Math.

Formulation

Let Template:Math be a sequence of complex numbers. If the sequence is infinite, assume that it is square-summable:

$\sum _m|u_m{|}^2<\mathrm{\infty }$

Hilbert's inequality (see Template:Harvtxt) asserts that

$\left|\sum _{r\ne s}\frac{u_r\overline{u_s}}{r-s}\right|\le \pi \sum _r|u_r{|}^2.$

Extensions

In 1973, Montgomery & Vaughan reported several generalizations of Hilbert's inequality, considering the bilinear forms

$\sum _{r\ne s}{u}_r{\bar{u}}_s\csc \pi (x_r-x_s)$

and

$\sum _{r\ne s}\frac{u_r{\bar{u}}_s}{{\lambda }_r-{\lambda }_s},$

where Template:Math are distinct real numbers modulo 1 (i.e. they belong to distinct classes in the quotient group Template:Math) and Template:Math are distinct real numbers. Montgomery & Vaughan's generalizations of Hilbert's inequality are then given by

$|\sum _{r\ne s}{u}_r\overline{u_s}\csc \pi (x_r-x_s)|\le {\delta }^{-1}\sum _r|u_r{|}^2.$

and

$\left|\sum _{r\ne s}\frac{u_r\overline{u_s}}{{\lambda }_r-{\lambda }_s}\right|\le \pi {\tau }^{-1}\sum _r|u_r{|}^2.$

where

$\delta =\underset{r,s}{\min }{}_{+}\Vert x_r-x_s\Vert ,\tau =\underset{r,s}{\min }{}_{+}\Vert {\lambda }_r-{\lambda }_s\Vert ,$

$\Vert s\Vert =\underset{m\in \mathbb{Z}}{\min }|s-m|$

is the distance from Template:Math to the nearest integer, and Template:Math denotes the smallest positive value. Moreover, if

$0<{\delta }_r\le \underset{s}{\min }{}_{+}\Vert x_r-x_s\Vert \text{and}0<{\tau }_r\le \underset{s}{\min }{}_{+}\Vert {\lambda }_r-{\lambda }_s\Vert ,$

then the following inequalities hold:

$|\sum _{r\ne s}{u}_r\overline{u_s}\csc \pi (x_r-x_s)|\le \frac{3}{2}\sum _r|u_r{|}^2{\delta }_r^{-1}.$

and

$\left|\sum _{r\ne s}\frac{u_r\overline{u_s}}{{\lambda }_r-{\lambda }_s}\right|\le \frac{3}{2}\pi \sum _r|u_r{|}^2{\tau }_r^{-1}.$

References

• Online book chapter Hilbert’s Inequality and Compensating Difficulties extracted from Template:Cite book.
• Template:Cite journal

External links

• Template:SpringerEOM