Hilbert's inequality explained

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

\left|\sumr\dfrac{ur\overline{us

}}\right|\le\pi\displaystyle\sum_|u_|^2.

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

Formulation

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

\summ

2
|u
m|

<infty

Hilbert's inequality (see) asserts that

\left|\sumr\dfrac{ur\overline{us

}}\right|\le\pi\displaystyle\sum_|u_|^2.

Extensions

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

\sumrur\overlineus\csc\pi(xr-xs)

and

\sumr\dfrac{ur\overlineus}{λrs},

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

\left|\sumrur\overline{us}\csc\pi(xr-x

-1
s)\right|\le\delta

\sumr

2.
|u
r|

and

\left|\sumr\dfrac{ur\overline{us}}{λr

-1
s}\right|\le\pi\tau

\sumr

2.
|u
r|

where

\delta={minr,s

}_\|x_-x_\|, \quad \tau=\min__\|\lambda_r-\lambda_s\|,

\|s\|=minm\inZ|s-m|

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

0<\deltar\le{mins}{}+\|xr-xs\|and0<\taur\le{mins

}_\|\lambda_r-\lambda_s\|,

then the following inequalities hold:

\left|\sumrur\overline{us}\csc\pi(xr-xs)\right|\le\dfrac{3}{2}\sumr

2
|u
r|
-1
\delta
r

.

and

\left|\sumr\dfrac{ur\overline{us}}{λrs}\right|\le\dfrac{3}{2}\pi\sumr

-1
|u
r

.

References