J u m p t o c o n t e n t
M a i n m e n u
M a i n m e n u
N a v i g a t i o n
● M a i n p a g e
● C o n t e n t s
● C u r r e n t e v e n t s
● R a n d o m a r t i c l e
● A b o u t W i k i p e d i a
● C o n t a c t u s
● D o n a t e
C o n t r i b u t e
● H e l p
● L e a r n t o e d i t
● C o m m u n i t y p o r t a l
● R e c e n t c h a n g e s
● U p l o a d f i l e
S e a r c h
Search
A p p e a r a n c e
● C r e a t e a c c o u n t
● L o g i n
P e r s o n a l t o o l s
● C r e a t e a c c o u n t
● L o g i n
P a g e s f o r l o g g e d o u t e d i t o r s l e a r n m o r e
● C o n t r i b u t i o n s
● T a l k
( T o p )
1
P r o o f
T o g g l e P r o o f s u b s e c t i o n
1 . 1
A n a p p l i c a t i o n
2
S e e a l s o
3
R e f e r e n c e s
T o g g l e t h e t a b l e o f c o n t e n t s
H a r d y – L i t t l e w o o d i n e q u a l i t y
4 l a n g u a g e s
● F r a n ç a i s
● I t a l i a n o
● 日 本 語
● P o r t u g u ê s
E d i t l i n k s
● A r t i c l e
● T a l k
E n g l i s h
● R e a d
● E d i t
● V i e w h i s t o r y
T o o l s
T o o l s
A c t i o n s
● R e a d
● E d i t
● V i e w h i s t o r y
G e n e r a l
● W h a t l i n k s h e r e
● R e l a t e d c h a n g e s
● U p l o a d f i l e
● S p e c i a l p a g e s
● P e r m a n e n t l i n k
● P a g e i n f o r m a t i o n
● C i t e t h i s p a g e
● G e t s h o r t e n e d U R L
● D o w n l o a d Q R c o d e
● W i k i d a t a i t e m
P r i n t / e x p o r t
● D o w n l o a d a s P D F
● P r i n t a b l e v e r s i o n
A p p e a r a n c e
F r o m W i k i p e d i a , t h e f r e e e n c y c l o p e d i a
∫
R
n
f
(
x
)
g
(
x
)
d
x
≤
∫
R
n
f
∗
(
x
)
g
∗
(
x
)
d
x
{\displaystyle \int _{\mathbb {R} ^{n}}f(x )g(x )\,dx\leq \int _{\mathbb {R} ^{n}}f^{*}(x )g^{*}(x )\,dx}
where
f
∗
{\displaystyle f^{*}}
and
g
∗
{\displaystyle g^{*}}
are the symmetric decreasing rearrangements of
f
{\displaystyle f}
and
g
{\displaystyle g}
, respectively.[1] [2]
The decreasing rearrangement
f
∗
{\displaystyle f^{*}}
of
f
{\displaystyle f}
is defined via the property that for all
r
>
0
{\displaystyle r>0}
the two super-level sets
E
f
(
r
)
=
{
x
∈
X
:
f
(
x
)
>
r
}
{\displaystyle E_{f}(r )=\left\{x\in X:f(x )>r\right\}\quad }
and
E
f
∗
(
r
)
=
{
x
∈
X
:
f
∗
(
x
)
>
r
}
{\displaystyle \quad E_{f^{*}}(r )=\left\{x\in X:f^{*}(x )>r\right\}}
have the same volume (
n
{\displaystyle n}
-dimensional Lebesgue measure) and
E
f
∗
(
r
)
{\displaystyle E_{f^{*}}(r )}
is a ball in
R
n
{\displaystyle \mathbb {R} ^{n}}
centered at
x
=
0
{\displaystyle x=0}
, i.e. it has maximal symmetry.
The layer cake representation [1] [2] allows us to write the general functions
f
{\displaystyle f}
and
g
{\displaystyle g}
in the form
f
(
x
)
=
∫
0
∞
χ
f
(
x
)
>
r
d
r
{\displaystyle f(x )=\int _{0}^{\infty }\chi _{f(x )>r}\,dr\quad }
and
g
(
x
)
=
∫
0
∞
χ
g
(
x
)
>
s
d
s
{\displaystyle \quad g(x )=\int _{0}^{\infty }\chi _{g(x )>s}\,ds}
where
r
↦
χ
f
(
x
)
>
r
{\displaystyle r\mapsto \chi _{f(x )>r}}
equals
1
{\displaystyle 1}
for
r
<
f
(
x
)
{\displaystyle r<f(x )}
and
0
{\displaystyle 0}
otherwise.
Analogously,
s
↦
χ
g
(
x
)
>
s
{\displaystyle s\mapsto \chi _{g(x )>s}}
equals
1
{\displaystyle 1}
for
s
<
g
(
x
)
{\displaystyle s<g(x )}
and
0
{\displaystyle 0}
otherwise.
Now the proof can be obtained by first using Fubini's theorem to interchange the order of integration. When integrating with respect to
x
∈
R
n
{\displaystyle x\in \mathbb {R} ^{n}}
the conditions
f
(
x
)
>
r
{\displaystyle f(x )>r}
and
g
(
x
)
>
s
{\displaystyle g(x )>s}
the indicator functions
x
↦
χ
E
f
(
r
)
(
x
)
{\displaystyle x\mapsto \chi _{E_{f}(r )}(x )}
and
x
↦
χ
E
g
(
s
)
(
x
)
{\displaystyle x\mapsto \chi _{E_{g}(s )}(x )}
appear with the superlevel sets
E
f
(
r
)
{\displaystyle E_{f}(r )}
and
E
g
(
s
)
{\displaystyle E_{g}(s )}
as introduced above:
∫
R
n
f
(
x
)
g
(
x
)
d
x
=
∫
R
n
∫
0
∞
χ
f
(
x
)
>
r
d
r
∫
0
∞
χ
g
(
x
)
>
s
d
s
d
x
=
∫
R
n
∫
0
∞
∫
0
∞
χ
f
(
x
)
>
r
χ
g
(
x
)
>
s
d
r
d
s
d
x
{\displaystyle \int _{\mathbb {R} ^{n}}f(x )g(x )\,dx=\displaystyle \int _{\mathbb {R} ^{n}}\int _{0}^{\infty }\chi _{f(x )>r}\,dr\;\int _{0}^{\infty }\chi _{g(x )>s}\,ds\,dx=\int _{\mathbb {R} ^{n}}\int _{0}^{\infty }\int _{0}^{\infty }\chi _{f(x )>r}\;\chi _{g(x )>s}\,dr\,ds\,dx}
=
∫
0
∞
∫
0
∞
∫
R
n
χ
E
f
(
r
)
(
x
)
χ
E
g
(
s
)
(
x
)
d
x
d
r
d
s
=
∫
0
∞
∫
0
∞
∫
R
n
χ
E
f
(
r
)
∩
E
g
(
s
)
(
x
)
d
x
d
r
d
s
.
{\displaystyle =\int _{0}^{\infty }\int _{0}^{\infty }\int _{\mathbb {R} ^{n}}\chi _{E_{f}(r )}(x )\;\chi _{E_{g}(s )}(x )\,dx\,dr\,ds=\int _{0}^{\infty }\int _{0}^{\infty }\int _{\mathbb {R} ^{n}}\chi _{E_{f}(r )\cap E_{g}(s )}(x )\,dx\,dr\,ds.}
Denoting by
μ
{\displaystyle \mu }
the
n
{\displaystyle n}
-dimensional Lebesgue measure we continue by estimating the volume of the intersection by the minimum of the volumes of the two sets. Then, we can use the equality of the volumes of the superlevel sets for the rearrangements:
=
∫
0
∞
∫
0
∞
μ
(
E
f
(
r
)
∩
E
g
(
s
)
)
d
r
d
s
{\displaystyle =\int _{0}^{\infty }\int _{0}^{\infty }\mu \left(E_{f}(r )\cap E_{g}(s )\right)\,dr\,ds}
≤
∫
0
∞
∫
0
∞
min
{
μ
(
E
f
(
r
)
)
,
μ
(
E
g
(
s
)
)
}
d
r
d
s
{\displaystyle \leq \int _{0}^{\infty }\int _{0}^{\infty }\min \left\{\mu (E_{f}(r )),\,\mu (E_{g}(s ))\right\}\,dr\,ds}
=
∫
0
∞
∫
0
∞
min
{
μ
(
E
f
∗
(
r
)
)
,
μ
(
E
g
∗
(
s
)
)
}
d
r
d
s
.
{\displaystyle =\int _{0}^{\infty }\int _{0}^{\infty }\min \left\{\mu (E_{f^{*}}(r )),\,\mu (E_{g^{*}}(s ))\right\}\,dr\,ds.}
Now, we use that the superlevel sets
E
f
∗
(
r
)
{\displaystyle E_{f^{*}}(r )}
and
E
g
∗
(
s
)
{\displaystyle E_{g^{*}}(s )}
are balls in
R
n
{\displaystyle \mathbb {R} ^{n}}
centered at
x
=
0
{\displaystyle x=0}
, which implies that
E
f
∗
(
r
)
∩
E
g
∗
(
s
)
{\displaystyle E_{f^{*}}(r )\,\cap \,E_{g^{*}}(s )}
is exactly the smaller one of the two balls:
=
∫
0
∞
∫
0
∞
μ
(
E
f
∗
(
r
)
∩
E
g
∗
(
s
)
)
d
r
d
s
{\displaystyle =\int _{0}^{\infty }\int _{0}^{\infty }\mu \left(E_{f^{*}}(r )\cap E_{g^{*}}(s )\right)\,dr\,ds}
=
∫
R
n
f
∗
(
x
)
g
∗
(
x
)
d
x
{\displaystyle =\int _{\mathbb {R} ^{n}}f^{*}(x )g^{*}(x )\,dx}
The last identity follows by reversing the initial five steps that even work for general functions. This finishes the proof.
An application [ edit ]
Let random variable
X
{\displaystyle X}
is Normally distributed with mean
μ
{\displaystyle \mu }
and finite non-zero variance
σ
2
{\displaystyle \sigma ^{2}}
, then using the Hardy–Littlewood inequality, it can be proved that for
0
<
δ
<
1
{\displaystyle 0<\delta <1}
the
δ
th
{\displaystyle \delta ^{\text{th}}}
reciprocal moment for the absolute value of
X
{\displaystyle X}
is
E
[
1
|
X
|
δ
]
≤
2
(
1
−
δ
)
2
Γ
(
1
−
δ
2
)
σ
δ
2
π
irrespective of the value of
μ
∈
R
.
{\displaystyle {\begin{aligned}\operatorname {E} \left[{\frac {1}{\vert X\vert ^{\delta }}}\right]&\leq 2^{\frac {(1-\delta )}{2}}{\frac {\Gamma \left({\frac {1-\delta }{2}}\right)}{\sigma ^{\delta }{\sqrt {2\pi }}}}{\text{ irrespective of the value of }}\mu \in \mathbb {R} .\end{aligned}}}
[3]
The technique that is used to obtain the above property of the Normal distribution can be utilized for other unimodal distributions.
See also [ edit ]
References [ edit ]
^ a b Burchard, Almut . A Short Course on Rearrangement Inequalities (PDF) .
^ Pal, Subhadip; Khare, Kshitij (2014). "Geometric ergodicity for Bayesian shrinkage models" . Electronic Journal of Statistics . 8 (1 ): 604–645. doi :10.1214/14-EJS896 . ISSN 1935-7524 .
R e t r i e v e d f r o m " https://en.wikipedia.org/w/index.php?title=Hardy–Littlewood_inequality&oldid=1221082229 "
C a t e g o r y :
● I n e q u a l i t i e s
H i d d e n c a t e g o r y :
● A r t i c l e s c o n t a i n i n g p r o o f s
● T h i s p a g e w a s l a s t e d i t e d o n 2 7 A p r i l 2 0 2 4 , a t 1 9 : 2 5 ( U T C ) .
● T e x t i s a v a i l a b l e u n d e r t h e C r e a t i v e C o m m o n s A t t r i b u t i o n - S h a r e A l i k e L i c e n s e 4 . 0 ;
a d d i t i o n a l t e r m s m a y a p p l y . B y u s i n g t h i s s i t e , y o u a g r e e t o t h e T e r m s o f U s e a n d P r i v a c y P o l i c y . W i k i p e d i a ® i s a r e g i s t e r e d t r a d e m a r k o f t h e W i k i m e d i a F o u n d a t i o n , I n c . , a n o n - p r o f i t o r g a n i z a t i o n .
● P r i v a c y p o l i c y
● A b o u t W i k i p e d i a
● D i s c l a i m e r s
● C o n t a c t W i k i p e d i a
● C o d e o f C o n d u c t
● D e v e l o p e r s
● S t a t i s t i c s
● C o o k i e s t a t e m e n t
● M o b i l e v i e w