Ronald Bruck wrote:
:> In article
:> <***@nitrogen.mathforum.org>,
:> mathemaat <***@hotmail.com> wrote:
:>
:>>Given int 0 to infinity f(x)dx is finite, proof xf(x)->0 as
:>>x->infinity. It should be trivial but I don't see it.
:>
:> Probably because it's false. You don't even have f(x) --> 0.
Post by JulesPost by mathemaatI also know that f(x) is non-increasing and f(x)>=0
If f(x) * x > e for some x, then what can you say about the integral
of f from x/2 to x? Using this, what happens if there is some e for
which f(x) * x > e for arbitrarily large values of x?
This question turned out to be more difficult than I expected.
(1) Did I get it right?
(2) Is there an easier way?
-----------
To prove: Given that INT_0^infinity (f(x)dx) is finite,
f(x) is non-increasing and f(x) >= 0, show that
x*f(x) -> 0 as x -> infinity.
------------
(Let INT_0^infinity (f(x)dx) = M.)
If x*f(x) -> 0 as x -> infinity, then (by definition)
for all eps > 0, exists x' such that for all x > x',
abs( x*f(x) ) < eps.
Assume that that is false:
There exist eps > 0 such that for all x' there exists
x > x', such that x*f(x) > eps.
Select such an eps.
It follows that there exists a sequence ( x_j ),
such that x_j*f(x_j) > eps for all j and
x_j -> infinity as j->infinity. (This last condition
will be contradicted later.)
[By the way, if I could use eps/x as a lower bound for f(x),
this proof would be much shorter and clearer. But what
we really have is f(x) > eps/x_j for all x < x_j,
where x_j is any element of the series above.]
We will use the series (x_j) to define g(x) as a lower
bound for f(x):
g(x) = eps/x_j, for x_{j-1} < x < x_j
Let us calculate:
INT_0^infy (f(x)dx) = M
Post by Jules= INT_0^infy (g(x)dx)
= SUM_{j=1}^infy ( eps/x_j*( x_j - x_{j-1} ) )
= eps* SUM_{j=1}^infy ( a_j )
where we define a_j = 1/x_j*( x_j - x_{j-1} )
Note that
x_j = 1/(1-a_j)*x_{j-1}
and thus
x_j = x_0*PRODUCT_{k=1}^j ( 1/(1-a_k))
= x_0* exp( SUM_{k=1}^j (-log( 1-a_k)) )
=< x_0* exp( SUM_{k=1}^j ( a_k ) )
since -log(1-x) =< x. But we have seen above that
SUM_{k=1}^j ( a_k )
=< SUM_{k=1}^infy ( a_k )
=< (1/eps)*INT_0^infy (f(x)dx)
= M/eps
Therefore
x_j =< x_0* exp( SUM_{k=1}^j ( a_k ) )
=< x_0* exp( M/eps )
and x_j does /not/ -> infy as j -> infy.
But we assumed that x_j -> infy, which we could do
if x*f(x) does /not/ -> 0 as x -> infy. Contradiction.
Therefore x*f(x) -> 0 as x -> infy.
----------------
Jim Burns