Let g:[0,1]→R be a continuous function and let
fn:[0,1]→R be a sequence of functions defined by
f0(x)=g(x) and
fn+1(x)=x1∫0xfn(t)dt(x∈(0,1],n=0,1,2,…).
Determine n→∞limfn(x) for every
x∈(0,1].
Solution (official)
B.
We shall prove in two different ways that
limn→∞fn(x)=g(0) for every x∈(0,1]. (The
second one is more lengthy but it tells us how to calculate fn
directly from g.)
Proof I. First we prove our claim for non-decreasing g. In this
case, by induction, one can easily see that
1. each fn is non-decrasing
as well, and
2. g(x)=f0(x)≥f1(x)≥f2(x)≥⋯≥g(0)(x∈(0,1]).
Then (2) implies that there exists
h(x)=n→∞limfn(x)(x∈(0,1]).
Clearly h is non-decreasing and g(0)≤h(x)≤fn(x) for any
x∈(0,1], n=0,1,2,…. Therefore to show that
h(x)=g(0) for any x∈(0,1], it is enough to prove that
h(1) cannot be greater than g(0).
Suppose that h(1)>g(0). Then there exists a 0<δ<1 such
that h(1)>g(δ). Using the definition, (2) and (1) we get
fn+1(1)=∫01fn(t)dt≤∫0δg(t)dt+∫δ1fn(t)dt≤δg(δ)+(1−δ)fn(1).
Hence
fn(1)−fn+1(1)≥δ(fn(1)−g(δ))≥δ(h(1)−g(δ))>0,
so fn(1)→−∞, which is a contradiction.
Similarly, we can prove our claim for non-increasing continuous
functions as well.
Now suppose that g is an arbitrary continuous function on [0,1].
Let
M(x)=t∈[0,x]supg(t),m(x)=t∈[0,x]infg(t)(x∈[0,1])
Then on [0,1]m is non-increasing, M is non-decreasing, both are
continuous, m(x)≤g(x)≤M(x) and M(0)=m(0)=g(0). Define
the sequences of functions Mn(x) and mn(x) in the same way as
fn is defined but starting with M0=M and m0=m.
Then one can easily see by induction that
mn(x)≤fn(x)≤Mn(x). By the first part of the proof,
limnmn(x)=m(0)=g(0)=M(0)=limnMn(x) for any
x∈(0,1]. Therefore we must have limnfn(x)=g(0).
Proof II. To make the notation clearer we shall denote the variable of
fj by xj. By definition (and Fubini theorem) we get that
fn+1(xn+1)=xn+11∫0xn+1xn1∫0xnxn−11∫0xn−1⋯∫0x2x11∫0x1g(x0)dx0dx1…dxn=xn+110≤x0≤x1≤⋯≤xn≤xn+1∬g(x0)x1…xndx0dx1…dxn=xn+11∫0xn+1g(x0)x0≤x1≤⋯≤xn≤xn+1∬x1…xndx1…dxndx0.
Therefore with the notation
hn(a,b)=a≤x1≤⋯≤xn≤b∬x1…xndx1…dxn
and x=xn+1, t=x0 we have
fn+1(x)=x1∫0xg(t)hn(t,x)dt.
Using that hn(a,b) is the same for any permutation of
x1,…,xn and the fact that the integral is 0 on any
hyperplanes (xi=xj) we get that
n!hn(a,b)=a≤x1,…,xn≤b∬x1…xndx1…dxn=∫ab⋯∫abx1…xndx1…dxn=(∫abxdx)n=(log(b/a))n.
Therefore
fn+1(x)=x1∫0xg(t)n!(log(x/t))ndt.
Note that if g is constant then the definition gives fn=g. This
implies on one hand that we must have
x1∫0xn!(log(x/t))ndt=1
and on the other hand that, by replacing g by g−g(0), we can
suppose that g(0)=0.
Let x∈(0,1] and ε>0 be fixed. By continuity there
exists a 0<δ<x and an M such that
∣g(t)∣<ε on [0,δ] and ∣g(t)∣≤M on
[0,1]. Since
n→∞limn!(log(x/δ))n=0
there exists an n0 sucht
that (log(x/δ))n/n!<ε whenever n≥n0.
Then, for any n≥n0, we have
∣fn+1(x)∣≤x1∫0x∣g(t)∣n!(log(x/t))ndt≤x1∫0δεn!(log(x/t))ndt+x1∫δx∣g(t)∣n!(log(x/δ))ndt≤εx1∫0xn!(log(x/t))ndt+x1∫δxMεdt≤ε+Mε.
Therefore limnfn(x)=0=g(0).
How the field did
contestants scored
185
average (of 20)
7.33
solved (≥ 80%)
29.2%
near-0 (≤ 10%)
45.9%
discrimination
0.54
Score distribution (field cohort)
Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.