Hardy's inequality

From testwiki
Jump to navigation Jump to search

Hardy's inequality is an inequality in mathematics, named after G. H. Hardy.

Its discrete version states that if a1,a2,a3, is a sequence of non-negative real numbers, then for every real number p > 1 one has

n=1(a1+a2++ann)p(pp1)pn=1anp.

If the right-hand side is finite, equality holds if and only if an=0 for all n.

An integral version of Hardy's inequality states the following: if f is a measurable function with non-negative values, then

0(1x0xf(t)dt)pdx(pp1)p0f(x)pdx.

If the right-hand side is finite, equality holds if and only if f(x) = 0 almost everywhere.

Hardy's inequality was first published and proved (at least the discrete version with a worse constant) in 1920 in a note by Hardy.[1] The original formulation was in an integral form slightly different from the above.

Statements

General discrete Hardy inequality

The general weighted one dimensional version reads as follows:[2]Template:Rp if an0, λn>0 and p>1,

n=1λn(λ1a1++λnanλ1++λn)p(pp1)pn=1λnanp.

General one-dimensional integral Hardy inequality

The general weighted one dimensional version reads as follows:[2]Template:Rp

  • If α+1p<1, then
0(yα10yxαf(x)dx)pdy1(1α1p)p0f(x)pdx
  • If α+1p>1, then
0(yα1yxαf(x)dx)pdy1(α+1p1)p0f(x)pdx.

Multidimensional Hardy inequalities with gradient

Multidimensional Hardy inequality around a point

In the multidimensional case, Hardy's inequality can be extended to Lp-spaces, taking the form [3]

fLp(n)pnpfLp(n),2n,1p<n,

where fCc(n), and where the constant pnp is known to be sharp; by density it extends then to the Sobolev space W1,p(n).

Similarly, if p>n2, then one has for every fCc(n)

(1np)pn|f(x)f(0)|p|x|pdxn|f|p.

Multidimensional Hardy inequality near the boundary

If Ωn is an nonempty convex open set, then for every fW1,p(Ω),

(11p)pΩ|f(x)|pdist(x,Ω)pdxΩ|f|p,

and the constant cannot be improved.[4]

Fractional Hardy inequality

If 1p< and 0<λ<, λ1, there exists a constant C such that for every f:(0,) satisfying 0|f(x)|p/xλdx<, one has[5]Template:Rp

0|f(x)|pxλdxC00|f(x)f(y)|p|xy|1+λdxdy.

Proof of the inequality

Integral version (integration by parts and Hölder)

Hardy’s original proof[1][2]Template:Rp begins with an integration by parts to get

0(1x0xf(t)dt)pdx=0(0xf(t)dt)p1xpdx=pp10(0xf(t)dt)p1f(x)xp1dx=pp10(1x0xf(t)dt)p1f(x)dx

Then, by Hölder's inequality,

0(1x0xf(t)dt)pdxpp1(0(1x0xf(t)dt)pdx)11p(0f(x)pdx)1p,

and the conclusion follows.

Integral version (scaling and Minkowski)

A change of variables gives

(0(1x0xf(t)dt)p dx)1/p=(0(01f(sx)ds)pdx)1/p,

which is less or equal than 01(0f(sx)pdx)1/pds by Minkowski's integral inequality. Finally, by another change of variables, the last expression equals

01(0f(x)pdx)1/ps1/pds=pp1(0f(x)pdx)1/p.

Discrete version: from the continuous version

Assuming the right-hand side to be finite, we must have an0 as n. Hence, for any positive integer Template:Math, there are only finitely many terms bigger than 2j. This allows us to construct a decreasing sequence b1b2 containing the same positive terms as the original sequence (but possibly no zero terms). Since a1+a2++anb1+b2++bn for every Template:Math, it suffices to show the inequality for the new sequence. This follows directly from the integral form, defining f(x)=bn if n1<x<n and f(x)=0 otherwise. Indeed, one has

0f(x)pdx=n=1bnp

and, for n1<x<n, there holds

1x0xf(t)dt=b1++bn1+(xn+1)bnxb1++bnn

(the last inequality is equivalent to (nx)(b1++bn1)(n1)(nx)bn, which is true as the new sequence is decreasing) and thus

n=1(b1++bnn)p0(1x0xf(t)dt)pdx.

Discrete version: Direct proof

Let p>1 and let b1,,bn be positive real numbers. Set Sk=i=1kbi. First we prove the inequality Template:NumBlk

Let Tn=Snn and let Δn be the difference between the n-th terms in the right-hand side and left-hand side of Template:EquationNote, that is, Δn:=Tnppp1bnTnp1. We have:

Δn=Tnppp1bnTnp1=Tnppp1(nTn(n1)Tn1)Tnp1

or

Δn=Tnp(1npp1)+p(n1)p1Tn1Tnp.

According to Young's inequality we have:

Tn1Tnp1Tn1pp+(p1)Tnpp,

from which it follows that:

Δnn1p1Tn1pnp1Tnp.

By telescoping we have:

n=1NΔn01p1T1p+1p1T1p2p1T2p+2p1T2p3p1T3p++N1p1TN1pNp1TNp=Np1TNp<0

proving Template:EquationNote. Applying Hölder's inequality to the right-hand side of Template:EquationNote we have:

n=1NSnpnppp1n=1NbnSnp1np1pp1(n=1Nbnp)1/p(n=1NSnpnp)(p1)/p

from which we immediately obtain:

n=1NSnpnp(pp1)pn=1Nbnp.

Letting N we obtain Hardy's inequality.

See also

Notes

References