The Carleman inequality , named after the Swedish mathematician Torsten Carleman , is an elementary inequality in analysis . It says that a series of geometric means of a sequence is bounded by a constant multiple of the series from above. More precisely, it says that Euler's number is the smallest constant which, as a multiple, fulfills this limit.
(
a
k
)
k
{\ displaystyle (a_ {k}) _ {k}}
∑
a
k
{\ displaystyle \ sum a_ {k}}
e
{\ displaystyle e}
The Carleman inequality was first published in 1923 by Torsten Carleman.
sentence
statement
Be a sequence of real, non-negative numbers. Denote Euler's number . Then:
(
a
k
)
k
=
(
a
1
,
a
2
,
a
3
,
...
)
{\ displaystyle (a_ {k}) _ {k} = (a_ {1}, a_ {2}, a_ {3}, \ ldots)}
e
{\ displaystyle e}
e
≈
2.718
28
...
{\ displaystyle e \ approx 2 {,} 71828 \ ldots}
∑
k
=
1
∞
(
a
1
a
2
...
a
k
)
k
≤
e
⋅
∑
k
=
1
∞
a
k
{\ displaystyle \ sum _ {k = 1} ^ {\ infty} {\ sqrt [{k}] {(a_ {1} a_ {2} \ ldots a_ {k})}} \ leq e \ cdot \ sum _ {k = 1} ^ {\ infty} a_ {k} ~ \,}
.
Where is the smallest number that fulfills this statement.
e
{\ displaystyle e}
proof
Because is ( telescope sum )
1
n
(
n
+
1
)
=
1
n
-
1
n
+
1
{\ displaystyle {\ frac {1} {n (n + 1)}} = {\ frac {1} {n}} - {\ frac {1} {n + 1}}}
∑
n
=
k
∞
1
n
(
n
+
1
)
=
1
k
{\ displaystyle \ sum _ {n = k} ^ {\ infty} {\ frac {1} {n (n + 1)}} = {\ frac {1} {k}} \ quad}
and it follows
1
e
n
<
∏
k
=
1
n
(
k
k
+
1
)
k
=
∏
k
=
1
n
(
k
+
1
)
k
k
(
k
+
1
)
k
+
1
=
(
n
+
1
)
!
(
n
+
1
)
n
+
1
=
n
!
(
n
+
1
)
n
{\ displaystyle {\ frac {1} {e ^ {n}}} <\ prod _ {k = 1} ^ {n} \ left ({\ frac {k} {k + 1}} \ right) ^ { k} = \ prod _ {k = 1} ^ {n} {\ frac {(k + 1) k ^ {k}} {(k + 1) ^ {k + 1}}} = {\ frac {( n + 1)!} {(n + 1) ^ {n + 1}}} = {\ frac {n!} {(n + 1) ^ {n}}}}
1
e
<
n
!
n
n
+
1
{\ displaystyle {\ frac {1} {e}} <{\ frac {\ sqrt [{n}] {n!}} {n + 1}}}
∑
k
=
1
∞
a
k
=
∑
k
=
1
∞
∑
n
=
k
∞
1
n
(
n
+
1
)
k
a
k
=
∑
1
≤
k
≤
n
1
n
(
n
+
1
)
k
a
k
=
∑
n
=
1
∞
1
n
+
1
1
n
∑
k
=
1
n
k
a
k
{\ displaystyle \ sum _ {k = 1} ^ {\ infty} a_ {k} = \ sum _ {k = 1} ^ {\ infty} \ sum _ {n = k} ^ {\ infty} {\ frac {1} {n (n + 1)}} k \, a_ {k} = \ sum _ {1 \ leq k \ leq n} {\ frac {1} {n (n + 1)}} k \, a_ {k} = \ sum _ {n = 1} ^ {\ infty} {\ frac {1} {n + 1}} \; {\ frac {1} {n}} \ sum _ {k = 1} ^ {n} k \, a_ {k}}
and that is according to the AM-GM inequality
≥
∑
n
=
1
∞
1
n
+
1
∏
k
=
1
n
(
k
a
k
)
n
=
∑
n
=
1
∞
n
!
n
n
+
1
∏
k
=
1
n
a
k
n
≥
1
e
∑
n
=
1
∞
a
1
⋯
a
n
n
◻
{\ displaystyle \ geq \ sum _ {n = 1} ^ {\ infty} {\ frac {1} {n + 1}} {\ sqrt [{n}] {\ prod _ {k = 1} ^ {n } (k \, a_ {k})}} = \ sum _ {n = 1} ^ {\ infty} {\ frac {\ sqrt [{n}] {n!}} {n + 1}} {\ sqrt [{n}] {\ prod _ {k = 1} ^ {n} a_ {k}}} \ geq {\ frac {1} {e}} \ sum _ {n = 1} ^ {\ infty} {\ sqrt [{n}] {a_ {1} \ cdots a_ {n}}} \ qquad \ Box}
variants
The following continuous variant of the Carleman inequality applies to a function with :
f
{\ displaystyle f}
f
≢
0
{\ displaystyle f \ not \ equiv 0}
∫
0
∞
exp
(
1
x
∫
0
x
ln
f
(
t
)
d
t
)
d
x
<
e
⋅
∫
0
∞
f
(
x
)
d
x
{\ displaystyle \ int _ {0} ^ {\ infty} \ exp \ left ({\ frac {1} {x}} \ int _ {0} ^ {x} \ ln f (t) \, dt \ right ) \, dx <e \ cdot \ int _ {0} ^ {\ infty} f (x) \, dx \,}
.
literature
<img src="https://de.wikipedia.org/wiki/Special:CentralAutoLogin/start?type=1x1" alt="" title="" width="1" height="1" style="border: none; position: absolute;">