Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2003 / Problems / Day 1, P5

IMC 2003 · Day 1 · P5

hard

Let g:[0,1]Rg : [0,1] \to \mathbb{R} be a continuous function and let fn:[0,1]Rf_n : [0,1] \to \mathbb{R} be a sequence of functions defined by f0(x)=g(x)f_0(x) = g(x) and fn+1(x)=1x0xfn(t)dt(x(0,1], n=0,1,2,).f_{n+1}(x) = \frac{1}{x} \int_0^x f_n(t)\,dt \quad (x \in (0,1],\ n = 0, 1, 2, \dots). Determine limnfn(x)\lim\limits_{n \to \infty} f_n(x) for every x(0,1]x \in (0,1].

Solution (official)

B. We shall prove in two different ways that limnfn(x)=g(0)\lim_{n \to \infty} f_n(x) = g(0) for every x(0,1]x \in (0,1]. (The second one is more lengthy but it tells us how to calculate fnf_n directly from gg.)

Proof I. First we prove our claim for non-decreasing gg. In this case, by induction, one can easily see that

1. each fnf_n is non-decrasing as well, and

2. g(x)=f0(x)f1(x)f2(x)g(0)g(x) = f_0(x) \ge f_1(x) \ge f_2(x) \ge \dots \ge g(0) (x(0,1])(x \in (0,1]).

Then (2) implies that there exists h(x)=limnfn(x)(x(0,1]).h(x) = \lim_{n \to \infty} f_n(x) \quad (x \in (0,1]). Clearly hh is non-decreasing and g(0)h(x)fn(x)g(0) \le h(x) \le f_n(x) for any x(0,1]x \in (0,1], n=0,1,2,n = 0, 1, 2, \dots. Therefore to show that h(x)=g(0)h(x) = g(0) for any x(0,1]x \in (0,1], it is enough to prove that h(1)h(1) cannot be greater than g(0)g(0).

Suppose that h(1)>g(0)h(1) > g(0). Then there exists a 0<δ<10 < \delta < 1 such that h(1)>g(δ)h(1) > g(\delta). Using the definition, (2) and (1) we get fn+1(1)=01fn(t)dt0δg(t)dt+δ1fn(t)dtδg(δ)+(1δ)fn(1).f_{n+1}(1) = \int_0^1 f_n(t)\,dt \le \int_0^{\delta} g(t)\,dt + \int_{\delta}^1 f_n(t)\,dt \le \delta g(\delta) + (1 - \delta) f_n(1). Hence fn(1)fn+1(1)δ(fn(1)g(δ))δ(h(1)g(δ))>0,f_n(1) - f_{n+1}(1) \ge \delta (f_n(1) - g(\delta)) \ge \delta (h(1) - g(\delta)) > 0, so fn(1)f_n(1) \to -\infty, which is a contradiction.

Similarly, we can prove our claim for non-increasing continuous functions as well.

Now suppose that gg is an arbitrary continuous function on [0,1][0,1]. Let M(x)=supt[0,x]g(t),m(x)=inft[0,x]g(t)(x[0,1])M(x) = \sup_{t \in [0,x]} g(t), \qquad m(x) = \inf_{t \in [0,x]} g(t) \qquad (x \in [0,1]) Then on [0,1][0,1] mm is non-increasing, MM is non-decreasing, both are continuous, m(x)g(x)M(x)m(x) \le g(x) \le M(x) and M(0)=m(0)=g(0)M(0) = m(0) = g(0). Define the sequences of functions Mn(x)M_n(x) and mn(x)m_n(x) in the same way as fnf_n is defined but starting with M0=MM_0 = M and m0=mm_0 = m.

Then one can easily see by induction that mn(x)fn(x)Mn(x)m_n(x) \le f_n(x) \le M_n(x). By the first part of the proof, limnmn(x)=m(0)=g(0)=M(0)=limnMn(x)\lim_n m_n(x) = m(0) = g(0) = M(0) = \lim_n M_n(x) for any x(0,1]x \in (0,1]. Therefore we must have limnfn(x)=g(0)\lim_n f_n(x) = g(0).

Proof II. To make the notation clearer we shall denote the variable of fjf_j by xjx_j. By definition (and Fubini theorem) we get that fn+1(xn+1)=1xn+10xn+11xn0xn1xn10xn1 ⁣0x21x10x1g(x0)dx0dx1dxn=1xn+10x0x1xnxn+1g(x0)dx0dx1dxnx1xn=1xn+10xn+1g(x0)(x0x1xnxn+1dx1dxnx1xn)dx0.\begin{align*} f_{n+1}(x_{n+1}) &= \frac{1}{x_{n+1}} \int_0^{x_{n+1}} \frac{1}{x_n} \int_0^{x_n} \frac{1}{x_{n-1}} \int_0^{x_{n-1}} \dots \int_0^{x_2} \frac{1}{x_1} \int_0^{x_1} g(x_0)\,dx_0\,dx_1 \dots dx_n \\ &= \frac{1}{x_{n+1}} \iint\limits_{0 \le x_0 \le x_1 \le \dots \le x_n \le x_{n+1}} g(x_0)\, \frac{dx_0\,dx_1 \dots dx_n}{x_1 \dots x_n} \\ &= \frac{1}{x_{n+1}} \int_0^{x_{n+1}} g(x_0) \left( \iint\limits_{x_0 \le x_1 \le \dots \le x_n \le x_{n+1}} \frac{dx_1 \dots dx_n}{x_1 \dots x_n} \right) dx_0. \end{align*} Therefore with the notation hn(a,b)=ax1xnbdx1dxnx1xnh_n(a, b) = \iint\limits_{a \le x_1 \le \dots \le x_n \le b} \frac{dx_1 \dots dx_n}{x_1 \dots x_n} and x=xn+1x = x_{n+1}, t=x0t = x_0 we have fn+1(x)=1x0xg(t)hn(t,x)dt.f_{n+1}(x) = \frac{1}{x} \int_0^x g(t)\, h_n(t, x)\,dt. Using that hn(a,b)h_n(a,b) is the same for any permutation of x1,,xnx_1, \dots, x_n and the fact that the integral is 0 on any hyperplanes (xi=xjx_i = x_j) we get that n!hn(a,b)=ax1,,xnbdx1dxnx1xn=ab ⁣abdx1dxnx1xn=(abdxx)n=(log(b/a))n.n!\, h_n(a, b) = \iint\limits_{a \le x_1, \dots, x_n \le b} \frac{dx_1 \dots dx_n}{x_1 \dots x_n} = \int_a^b \dots \int_a^b \frac{dx_1 \dots dx_n}{x_1 \dots x_n} = \left( \int_a^b \frac{dx}{x} \right)^n = (\log(b/a))^n. Therefore fn+1(x)=1x0xg(t)(log(x/t))nn!dt.f_{n+1}(x) = \frac{1}{x} \int_0^x g(t)\, \frac{(\log(x/t))^n}{n!}\,dt. Note that if gg is constant then the definition gives fn=gf_n = g. This implies on one hand that we must have 1x0x(log(x/t))nn!dt=1\frac{1}{x} \int_0^x \frac{(\log(x/t))^n}{n!}\,dt = 1 and on the other hand that, by replacing gg by gg(0)g - g(0), we can suppose that g(0)=0g(0) = 0.

Let x(0,1]x \in (0,1] and ε>0\varepsilon > 0 be fixed. By continuity there exists a 0<δ<x0 < \delta < x and an MM such that g(t)<ε|g(t)| < \varepsilon on [0,δ][0,\delta] and g(t)M|g(t)| \le M on [0,1][0,1]. Since limn(log(x/δ))nn!=0\lim_{n \to \infty} \frac{(\log(x/\delta))^n}{n!} = 0 there exists an n0n_0 sucht that (log(x/δ))n/n!<ε(\log(x/\delta))^n / n! < \varepsilon whenever nn0n \ge n_0. Then, for any nn0n \ge n_0, we have fn+1(x)1x0xg(t)(log(x/t))nn!dt1x0δε(log(x/t))nn!dt+1xδxg(t)(log(x/δ))nn!dtε1x0x(log(x/t))nn!dt+1xδxMεdtε+Mε.\begin{align*} |f_{n+1}(x)| &\le \frac{1}{x} \int_0^x |g(t)|\, \frac{(\log(x/t))^n}{n!}\,dt \\ &\le \frac{1}{x} \int_0^{\delta} \varepsilon\, \frac{(\log(x/t))^n}{n!}\,dt + \frac{1}{x} \int_{\delta}^x |g(t)|\, \frac{(\log(x/\delta))^n}{n!}\,dt \\ &\le \varepsilon\, \frac{1}{x} \int_0^x \frac{(\log(x/t))^n}{n!}\,dt + \frac{1}{x} \int_{\delta}^x M \varepsilon\,dt \\ &\le \varepsilon + M \varepsilon. \end{align*} Therefore limnfn(x)=0=g(0)\lim_n f_n(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.

Similar problems

IMC 2015 · Day 2 · P7hardavg 2.5/10 · solved 20% · near-0 74% · disc 0.48
IMC 2003 · Day 2 · P8easyavg 6.7/10 · solved 56% · near-0 18% · disc 0.57
IMC 2017 · Day 2 · P6easyavg 8.0/10 · solved 73% · near-0 9% · disc 0.35