In analysis, a branch of mathematics, Hilbert's inequality states that
\left|\sumr ≠ \dfrac{ur\overline{us
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 .
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
In 1973, Montgomery & Vaughan reported several generalizations of Hilbert's inequality, considering the bilinear forms
\sumr ≠ ur\overlineus\csc\pi(xr-xs)
and
\sumr ≠ \dfrac{ur\overlineus}{λr-λs},
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|\sumr ≠ ur\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
\|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\| and 0<\taur\le{mins
then the following inequalities hold:
\left|\sumr ≠ ur\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}}{λr-λs}\right|\le\dfrac{3}{2}\pi\sumr
-1 | |
|u | |
r |
.