Graph enumeration

From formulasearchengine
Revision as of 16:21, 10 December 2013 by en>Trappist the monk (rename venn to acad; remove deprecated parameters; using AWB)
Jump to navigation Jump to search

In mathematics, the Khintchine inequality, named after Aleksandr Khinchin and spelled in multiple ways in the Roman alphabet, is a theorem from probability, and is also frequently used in analysis. Heuristically, it says that if we pick N complex numbers x1,,xN, and add them together each multiplied by a random sign ±1, then the expected value of its modulus, or the modulus it will be closest to on average, will be not too far off from |x1|2++|xN|2.

Statement of theorem

Let {ϵn}n=1N be i.i.d. random variables with P(ϵn=±1)=12 for every n=1N, i.e., a sequence with Rademacher distribution. Let 0<p< and let x1,...,xN. Then

Ap(n=1N|xn|2)12(𝔼|n=1Nϵnxn|p)1/pBp(n=1N|xn|2)12

for some constants Ap,Bp>0 depending only on p (see Expected value for notation). The sharp values of the constants Ap,Bp were found by Haagerup (Ref. 2; see Ref. 3 for a simpler proof).

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 Lp spaces Lp(X,μ) and Lp(Y,ν), 1p<, with bounded norm T<, then one can use Khintchine's inequality to show that

(n=1N|Tfn|2)12Lp(Y,ν)Cp(n=1N|fn|2)12Lp(X,μ)

for some constant Cp>0 depending only on p and T.

See also

References

  1. Thomas H. Wolff, "Lectures on Harmonic Analysis". American Mathematical Society, University Lecture Series vol. 29, 2003. ISBN 0-8218-3449-5
  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.