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

IMC / 2017 / Problems / Day 2, P9

IMC 2017 · Day 2 · P9

hard

Define the sequence f1,f2,:[0,1)Rf_1, f_2, \dots : [0, 1) \to \mathbb{R} of continuously differentiable functions by the following recurrence: f1=1;fn+1=fnfn+1 on (0,1), and fn+1(0)=1.f_1 = 1; \qquad f'_{n+1} = f_n f_{n+1} \text{ on } (0, 1), \text{ and } f_{n+1}(0) = 1. Show that limnfn(x)\lim\limits_{n \to \infty} f_n(x) exists for every x[0,1)x \in [0, 1) and determine the limit function.

(Proposed by Tomáš Bárta, Charles University, Prague)

Solution (official)

First of all, the sequence fnf_n is well defined and it holds that fn+1(x)=e0xfn(t)dt.(2)\tag{2} f_{n+1}(x) = e^{\int_0^x f_n(t)\,dt}. The mapping Φ:C([0,1))C([0,1))\Phi : C([0,1)) \to C([0,1)) given by Φ(g)(x)=e0xg(t)dt\Phi(g)(x) = e^{\int_0^x g(t)\,dt} is monotone, i.e. if f<gf < g on (0,1)(0,1) then Φ(f)(x)=e0xf(t)dt<e0xg(t)dt=Φ(g)(x)\Phi(f)(x) = e^{\int_0^x f(t)\,dt} < e^{\int_0^x g(t)\,dt} = \Phi(g)(x) on (0,1)(0,1). Since f2(x)=e0x1dt=ex>1=f1(x)f_2(x) = e^{\int_0^x 1\,\mathrm{d}t} = e^x > 1 = f_1(x) on (0,1)(0,1), we have by induction fn+1(x)>fn(x)f_{n+1}(x) > f_n(x) for all x(0,1)x \in (0,1), nNn \in \mathbb{N}. Moreover, function f(x)=11xf(x) = \frac{1}{1-x} is the unique solution to f=f2f' = f^2, f(0)=1f(0) = 1, i.e. it is the unique fixed point of Φ\Phi in {φC([0,1)):φ(0)=1}\{ \varphi \in C([0,1)) : \varphi(0) = 1 \}. Since f1<ff_1 < f on (0,1)(0,1), by induction we have fn+1=Φ(fn)<Φ(f)=ff_{n+1} = \Phi(f_n) < \Phi(f) = f for all nNn \in \mathbb{N}. Hence, for every x(0,1)x \in (0,1) the sequence fn(x)f_n(x) is increasing and bounded, so a finite limit exists.

Let us denote the limit g(x)g(x). We show that g(x)=f(x)=11xg(x) = f(x) = \frac{1}{1-x}. Obviously, g(0)=limfn(0)=1g(0) = \lim f_n(0) = 1. By f11f_1 \equiv 1 and (2), we have fn>0f_n > 0 on [0,1)[0,1) for each nNn \in \mathbb{N}, and therefore (by (2) again) the function fn+1f_{n+1} is increasing. Since fnf_n, fn+1f_{n+1} are positive and increasing also fn+1f'_{n+1} is increasing (due to fn+1=fnfn+1f'_{n+1} = f_n f_{n+1}), hence fn+1f_{n+1} is convex. A pointwise limit of a sequence of convex functions is convex, since we pass to a limit nn \to \infty in fn(λx+(1λ)y)λfn(x)+(1λ)fn(y)f_n(\lambda x + (1 - \lambda) y) \le \lambda f_n(x) + (1 - \lambda) f_n(y) and obtain g(λx+(1λ)y)λg(x)+(1λ)g(y)g(\lambda x + (1 - \lambda) y) \le \lambda g(x) + (1 - \lambda) g(y) for any fixed x,y[0,1)x, y \in [0,1) and λ(0,1)\lambda \in (0,1). Hence, gg is convex, and therefore continuous on (0,1)(0,1). Moreover, gg is continuous in 0, since 1f1gf1 \equiv f_1 \le g \le f and limx0+f(x)=1\lim_{x \to 0+} f(x) = 1. By Dini's Theorem, convergence fngf_n \to g is uniform on [0,1ε][0, 1-\varepsilon] for each ε(0,1)\varepsilon \in (0,1) (a monotone sequence converging to a continuous function on a compact interval). We show that Φ\Phi is continuous and therefore fnf_n have to converge to a fixed point of Φ\Phi.

In fact, let us work on the space C([0,1ε])C([0, 1-\varepsilon]) with any fixed ε(0,1)\varepsilon \in (0,1), \| \cdot \| being the supremum norm on [0,1ε][0, 1-\varepsilon]. Then for a fixed function hh and φh<δ\| \varphi - h \| < \delta we have supx[0,1ε]Φ(h)(x)Φ(φ)(x)=supx[0,1ε]e0xh(t)dt1e0xφ(t)h(t)dtC(eδ1)<2Cδ\sup_{x \in [0, 1-\varepsilon]} |\Phi(h)(x) - \Phi(\varphi)(x)| = \sup_{x \in [0, 1-\varepsilon]} e^{\int_0^x h(t)\,dt} \Bigl| 1 - e^{\int_0^x \varphi(t) - h(t)\,dt} \Bigr| \le C (e^\delta - 1) < 2 C \delta for δ>0\delta > 0 small enough. Hence, Φ\Phi is continuous on C([0,1ε])C([0, 1-\varepsilon]). Let us assume for contradiction that Φ(g)g\Phi(g) \ne g. Hence, there exists η>0\eta > 0 and x0[0,1ε]x_0 \in [0, 1-\varepsilon] such that Φ(g)(x0)g(x0)>η|\Phi(g)(x_0) - g(x_0)| > \eta. There exists δ>0\delta > 0 such that Φ(φ)Φ(g)<13η\| \Phi(\varphi) - \Phi(g) \| < \frac13 \eta whenever φg<δ\| \varphi - g \| < \delta. Take n0n_0 so large that fng<min{δ,13η}\| f_n - g \| < \min\{ \delta, \frac13 \eta \} for all nn0n \ge n_0. Hence, fn+1Φ(g)=Φ(fn)Φ(g)<13η\| f_{n+1} - \Phi(g) \| = \| \Phi(f_n) - \Phi(g) \| < \frac13 \eta. On the other hand, we have fn+1(x0)Φ(g)(x0)>Φ(g)(x0)g(x0)g(x0)fn+1(x0)>η13η=23η|f_{n+1}(x_0) - \Phi(g)(x_0)| > |\Phi(g)(x_0) - g(x_0)| - |g(x_0) - f_{n+1}(x_0)| > \eta - \frac13 \eta = \frac23 \eta, contradiction. So, Φ(g)=g\Phi(g) = g.

Since ff is the only fixed point of Φ\Phi in {φC([0,1ε]):φ(0)=1}\{ \varphi \in C([0, 1-\varepsilon]) : \varphi(0) = 1 \}, we have g=fg = f on [0,1ε][0, 1-\varepsilon]. Since ε(0,1)\varepsilon \in (0,1) was arbitrary, we have limnfn(x)=11x\lim\limits_{n \to \infty} f_n(x) = \frac{1}{1-x} for all x[0,1)x \in [0, 1).

How the field did

contestants scored
315
average (of 10)
2.19
solved (≥ 80%)
15.2%
near-0 (≤ 10%)
68.9%
discrimination
0.59

Score distribution (field cohort)

Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.

Similar problems

IMC 2021 · Day 1 · P3very hardavg 1.3/10 · solved 8% · near-0 80% · disc 0.50
IMC 2000 · Day 1 · P6very hardavg 1.3/10 · solved 5% · near-0 68% · disc 0.47
IMC 2020 · Day 2 · P8killeravg 0.1/10 · solved 0% · near-0 98% · disc 0.16
IMC 2010 · Day 2 · P6mediumavg 7.4/10 · solved 47% · near-0 3% · disc 0.49