Khintchine inequality explained

In mathematics, the Khintchine inequality, named after Aleksandr Khinchin and spelled in multiple ways in the Latin alphabet, is a theorem from probability, and is also frequently used in analysis. Heuristically, it says that if we pick

N complex numbers x _{1,...,x} _{N} \in C , and add them together each multiplied by a random sign \pm 1 , then the expected value of the sum's modulus, or the modulus it will be closest to on average, will be not too far off from \sqrt{|x ^{2} _{1 |} + … + |x ^{2} _{N|} }.

Statement

Let

\{\varepsilon _{n\}} ^{N} ^{n =1} be i.i.d. random variables with P(\varepsilon _{n = \pm 1 ) = (12)/()} for n =1 ,\ldots, N , i.e., a sequence with Rademacher distribution. Let 0 <p< inf ty and let x _{1,\ldots,x} _{N\in} C . ThenA _{p} \left( \sum ^{N} _{n =1} |x ^{2} _{n|} \right) ^{1/2} \leq \left(\operatorname{E} \left|\sum ^{N} _{n =1} \varepsilon _{n} x ^{p} _{n\right|} \right) ^{1/p} \leq B _{p} \left(\sum ^{N} _{n =1} |x ^{2 \right)} _{n|} ^{1/2}

for some constants

A _{p,B} _{p>0} depending only on p (see Expected value for notation). The sharp values of the constants A _{p,B} _{p} were found by Haagerup (Ref. 2; see Ref. 3 for a simpler proof). It is a simple matter to see that A _{p} = 1 when p \ge 2 , and B _{p} = 1 when 0 < p \le 2 .

Haagerup found that

\begin{align} A _{p} & = \begin{cases} 2 ^{1/2-1/p} & 0 <p\le p _{0,} \\ 2 ^{1/2} (\Gamma((p +1 )/ 2 )/\sqrt{\pi}) ^{1/p} & p _{0} < p < 2 \\ 1 & 2 \le p < inf ty \end{cases} \\ & and \\ B _{p} & = \begin{cases} 1 & 0 < p \le 2 \\ 2 ^{1/2} (\Gamma((p +1 )/ 2 )/\sqrt\pi) ^{1/p} & 2 < p < inf ty \end{cases}, \end{align} where p _{0 ≈} 1 . 847 and \Gamma is the Gamma function.One may note in particular that B _{p} matches exactly the moments of a normal distribution.

Uses in analysis

The uses of this inequality are not limited to applications in probability theory. One example of its use in analysis is the following: if we let

T be a linear operator between two L^p spaces L ^{p(X,\mu)} and L ^{p(Y,\nu)} , 1 < p < inf ty , with bounded norm \|T\|< inf ty , then one can use Khintchine's inequality to show that\left\|\left(\sum ^{N} _{n =1} |Tf ^{2} _{n|} \right) ^{1/2} \right\| _{L ^{p(Y,\nu)}} \leq C _{p} \left\|\left(\sum ^{N} _{n =1} |f ^{2 \right)} _{n|} ^{1/2} \right\| _{L ^{p(X,\mu)}}

for some constant

C _{p>0} depending only on p and \|T\| .

Generalizations

For the case of Rademacher random variables, Pawel Hitczenko showed^[1] that the sharpest version is:

A \left(\sqrt{p}\left(\sum ^{N} _{n = b +1} x ^{2 \right)} _{n} ^{1/2} + \sum ^{b} _{n =1} x _{n\right) \leq} \left(\operatorname{E} \left|\sum ^{N} _{n =1} \varepsilon _{n} x ^{p} _{n\right|} \right) ^{1/p} \leq B \left(\sqrt{p}\left(\sum ^{N} _{n = b +1} x ^{2 \right)} _{n} ^{1/2} + \sum ^{b} _{n =1} x _{n\right)}

where

b = \lfloor p\rfloor , and A and B are universal constants independent of p .

Here we assume that the

x _{i} are non-negative and non-increasing.

See also

• Marcinkiewicz–Zygmund inequality
• Burkholder-Davis-Gundy inequality

References

1. Thomas H. Wolff, "Lectures on Harmonic Analysis". American Mathematical Society, University Lecture Series vol. 29, 2003.
2. Uffe Haagerup, "The best constants in the Khintchine inequality", Studia Math. 70 (1981), no. 3, 231 - 283 (1982).
3. Fedor Nazarov and Anatoliy Podkorytov, "Ball, Haagerup, and distribution functions", Complex analysis, operators, and related topics, 247 - 267, Oper. Theory Adv. Appl., 113, Birkhäuser, Basel, 2000.

Notes and References

1. [Hitczenko|Pawel Hitczenko]