Hardy's inequality

From testwiki
Jump to navigation Jump to search

Template:Short description 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≤(pp−1)p∑n=1∞anp.

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∞(1x∫0xf(t)dt)pdx≤(pp−1)p∫0∞f(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 an≥0, λn>0 and p>1,

∑n=1∞λn(λ1a1+⋯+λnanλ1+⋯+λn)p≤(pp−1)p∑n=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α−1∫0yx−αf(x)dx)pdy≤1(1−α−1p)p∫0∞f(x)pdx
  • If α+1p>1, then
∫0∞(yα−1∫y∞x−αf(x)dx)pdy≤1(α+1p−1)p∫0∞f(x)pdx.

The more general case is weighted integral Hardy inequality

Weighted one-dimensional integral Hardy inequality

The statement is following: if 1<p≤q<∞ inequality

(∫ab(∫axf(t)dt)qu(x)dx)1/q≤C(∫abfp(x)v(x)dx)1/p

holds for −∞≤a<b≤∞ with u,v measurable, positive on (a,b) and also f(x)≥0 any measurable on (a,b), if and only if

A=supx∈(a,b)(∫xbu(t)dt)1/q(∫axv1−p′(t)dt)1/p′<∞

And if 1<q<p<∞ inequality also holds if and only if

A=(∫ab(∫xbu(t)dt)r/q(∫axv1−p′(t)dt)r/q′v1−p′(x)dx)1/r<∞

where 1r=1q−1p,1p+1p′=1 and 1q+1q′=1

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]

‖f|⋅|‖Lp(ℝn)≤pn−p‖∇f‖Lp(ℝn),2≤n,1≤p<n,

where f∈Cc∞(ℝn), and where the constant pn−p is known to be sharp; by density it extends then to the Sobolev space W1,p(ℝn).

Similarly, if p>n≥2, then one has for every f∈Cc∞(ℝn)

(1−np)p∫ℝn|f(x)−f(0)|p|x|pdx≤∫ℝn|∇f|p.

Multidimensional Hardy inequality near the boundary

If Ω⊊ℝn is an nonempty convex open set, then for 1<p<∞ and every f∈W01,p(Ω),

(1−1p)p∫Ω|f(x)|pdist⁡(x,∂Ω)pdx≤∫Ω|∇f|p,

and the constant cannot be improved.[4]

Fractional Hardy inequality

If 1≤p<∞ 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λdx≤C∫0∞∫0∞|f(x)−f(y)|p|x−y|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∞(1x∫0xf(t)dt)pdx=∫0∞(∫0xf(t)dt)p1xpdx=pp−1∫0∞(∫0xf(t)dt)p−1f(x)xp−1dx=pp−1∫0∞(1x∫0xf(t)dt)p−1f(x)dx

Then, by Hölder's inequality,

∫0∞(1x∫0xf(t)dt)pdx≤pp−1(∫0∞(1x∫0xf(t)dt)pdx)1−1p(∫0∞f(x)pdx)1p,

and the conclusion follows.

Integral version (scaling and Minkowski)

A change of variables gives

(∫0∞(1x∫0xf(t)dt)p dx)1/p=(∫0∞(∫01f(sx)ds)pdx)1/p,

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

∫01(∫0∞f(x)pdx)1/ps−1/pds=pp−1(∫0∞f(x)pdx)1/p.

Discrete version: from the continuous version

Assuming the right-hand side to be finite, we must have an→0 as n→∞. Hence, for any positive integer Template:Math, there are only finitely many terms bigger than 2−j. This allows us to construct a decreasing sequence b1≥b2≥⋯ containing the same positive terms as the original sequence (but possibly no zero terms). Since a1+a2+⋯+an≤b1+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 n−1<x<n and f(x)=0 otherwise. Indeed, one has

∫0∞f(x)pdx=∑n=1∞bnp

and, for n−1<x<n, there holds

1x∫0xf(t)dt=b1+…+bn−1+(x−n+1)bnx≥b1+…+bnn

(the last inequality is equivalent to (n−x)(b1+…+bn−1)≥(n−1)(n−x)bn, which is true as the new sequence is decreasing) and thus

∑n=1∞(b1+…+bnn)p≤∫0∞(1x∫0xf(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:=Tnp−pp−1bnTnp−1. We have:

Δn=Tnp−pp−1bnTnp−1=Tnp−pp−1(nTn−(n−1)Tn−1)Tnp−1

or

Δn=Tnp(1−npp−1)+p(n−1)p−1Tn−1Tnp.

According to Young's inequality we have:

Tn−1Tnp−1≤Tn−1pp+(p−1)Tnpp,

from which it follows that:

Δn≤n−1p−1Tn−1p−np−1Tnp.

By telescoping we have:

∑n=1NΔn≤0−1p−1T1p+1p−1T1p−2p−1T2p+2p−1T2p−−3p−1T3p+⋯+N−1p−1TN−1p−Np−1TNp=−Np−1TNp<0

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

∑n=1NSnpnp≤pp−1∑n=1NbnSnp−1np−1≤pp−1(∑n=1Nbnp)1/p(∑n=1NSnpnp)(p−1)/p

from which we immediately obtain:

∑n=1NSnpnp≤(pp−1)p∑n=1Nbnp.

Letting N→∞ we obtain Hardy's inequality.

See also

Notes

References