Carleman's inequality is an inequality in mathematics, named after Torsten Carleman, who proved it in 1923[1] and used it to prove the Denjoy - Carleman theorem on quasi-analytic classes.[2] [3]
Let
a1,a2,a3,...
infty | |
\sum | |
n=1 |
\left(a1a2 …
1/n | |
a | |
n\right) |
\lee
infty | |
\sum | |
n=1 |
an.
The constant e
e
Carleman's inequality has an integral version, which states that
infty | |
\int | |
0 |
\exp\left\{
1 | |
x |
x | |
\int | |
0 |
lnf(t)dt\right\}dx\leqe
infty | |
\int | |
0 |
f(x)dx
for any f ≥ 0.
A generalisation, due to Lennart Carleson, states the following:[4]
for any convex function g with g(0) = 0, and for any -1 < p < ∞,
infty | |
\int | |
0 |
xpe-g(x)/xdx\leqep+1
infty | |
\int | |
0 |
xpe-g'(x)dx.
Carleman's inequality follows from the case p = 0.
An elementary proof is sketched below. From the inequality of arithmetic and geometric means applied to the numbers
1 ⋅ a1,2 ⋅ a2,...,n ⋅ an
MG(a1,...,an)=MG(1a1,2a2,...,na
-1/n | |
n)(n!) |
\leMA(1a1,2a2,...,na
-1/n | |
n)(n!) |
where MG stands for geometric mean, and MA - for arithmetic mean. The Stirling-type inequality
n!\ge\sqrt{2\pin}nne-n
n+1
(n!)-1/n\le
e | |
n+1 |
n\ge1.
Therefore,
MG(a1,...,an)\le
e | |
n(n+1) |
\sum1\lekak,
whence
\sumn\ge1MG(a1,...,an)\lee\sumk\ge1(\sumn\ge
1 | |
n(n+1) |
)kak=e\sumk\ge1ak,
proving the inequality. Moreover, the inequality of arithmetic and geometric means of
n
ak=C/k
k=1,...,n
an
One can also prove Carleman's inequality by starting with Hardy's inequality
infty | |
\sum | |
n=1 |
\left(
a1+a2+ … +an | |
n |
\right)p\le\left(
p | |
p-1 |
\right
infty | |
) | |
n=1 |
p | |
a | |
n |
for the non-negative numbers a1,a2,... and p > 1, replacing each an with a, and letting p → ∞.
Christian Axler and Mehdi Hassani investigated Carleman's inequality for the specific cases of
ai=pi
pi
i
a | ||||
|
ai=pi
e
1 | |
e |
a | ||||
|
e