Hilbert's inequality

From HandWiki

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

|∑r≠surus‾r−s|≤π∑r|ur|2.

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

Formulation

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

∑m|um|2<∞

Hilbert's inequality (see (Steele 2004)) asserts that

|∑r≠surus‾r−s|≤π∑r|ur|2.

Extensions

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

∑r≠suru‾scsc⁡π(xr−xs)

and

∑r≠suru‾sλr−λs,

where x1,x2,...,xm are distinct real numbers modulo 1 (i.e. they belong to distinct classes in the quotient group R/Z) and λ1,...,λm are distinct real numbers. Montgomery & Vaughan's generalizations of Hilbert's inequality are then given by

|∑r≠surus‾csc⁡π(xr−xs)|≤δ−1∑r|ur|2.

and

|∑r≠surus‾λr−λs|≤πτ−1∑r|ur|2.

where

δ=minr,s+‖xr−xs‖,τ=minr,s+‖λr−λs‖,
‖s‖=minm∈ℤ|s−m|

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

0<δr≤mins+‖xr−xs‖and0<τr≤mins+‖λr−λs‖,

then the following inequalities hold:

|∑r≠surus‾csc⁡π(xr−xs)|≤32∑r|ur|2δr−1.

and

|∑r≠surus‾λr−λs|≤32π∑r|ur|2τr−1.

References