uniolympiads English

IMC 2003, Ημέρα 1, Θέμα 5

Let g ⁣:[0,1]→Rg\colon [0, 1] \to \mathbb{R} be a continuous function and let fn ⁣:[0,1]→Rf_n\colon [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)=1x∫0xfn(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 lim⁡n→∞fn(x)\lim_{n \to \infty} f_n(x) for every x∈(0,1]x \in (0, 1].

Πρωτότυπο από το επίσημο PDF5. Let g : [0, 1] → R be a continuous function and let f n : [0, 1] → R be a sequence of functions defined by f 0 (x) = g(x) and Z 1 x f n (t)dt (x ∈ (0, 1], n = 0, 1, 2, . . .). f n+1 (x) = x 0 Determine lim f n (x) for every x ∈ (0, 1]. (20 points) n→∞

Η μεταγραφή συγκρίθηκε σύμβολο προς σύμβολο με το πρωτότυπο, όχι ακόμα από άνθρωπο.

Χρόνος σε αυτό το θέμα 0:00

Δούλεψε τουλάχιστον 45 λεπτά πριν ανοίξεις τη λύση.

Επίσημη λύση

B. We shall prove in two different ways that lim⁡n→∞fn(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)(x∈(0,1])g(x) = f_0(x) \ge f_1(x) \ge f_2(x) \ge \ldots \ge g(0) \quad (x \in (0, 1]).

Then (2) implies that there exists

h(x)=lim⁡n→∞fn(x)(x∈(0,1]).h(x) = \lim_{n\to\infty} f_n(x) \qquad (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],n=0,1,2,…x \in (0, 1], n = 0, 1, 2, \ldots. 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)dt≤∫0δ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)=sup⁡t∈[0,x]g(t),m(x)=inf⁡t∈[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\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, lim⁡nmn(x)=m(0)=g(0)=M(0)=lim⁡nMn(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 lim⁡nfn(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+1∫0xn+11xn∫0xn1xn−1∫0xn−1…∫0x21x1∫0x1g(x0)dx0dx1…dxn=1xn+1∬0≤x0≤x1≤…≤xn≤xn+1g(x0)dx0dx1…dxnx1…xn=1xn+1∫0xn+1g(x0)(∬x0≤x1≤…≤xn≤xn+1dx1…dxnx1…xn)dx0.\begin{aligned} 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}} \ldots \int_0^{x_2} \frac{1}{x_1} \int_0^{x_1} g(x_0)dx_0dx_1\ldots dx_n \\ &= \frac{1}{x_{n+1}} \iint_{0\le x_0\le x_1\le\ldots\le x_n\le x_{n+1}} g(x_0)\frac{dx_0dx_1\ldots dx_n}{x_1\ldots x_n} \\ &= \frac{1}{x_{n+1}} \int_0^{x_{n+1}} g(x_0) \left( \iint_{x_0\le x_1\le\ldots\le x_n\le x_{n+1}} \frac{dx_1\ldots dx_n}{x_1\ldots x_n} \right) dx_0. \end{aligned}
Therefore with the notation
hn(a,b)=∬a≤x1≤…≤xn≤bdx1…dxnx1…xnh_n(a, b) = \iint_{a\le x_1\le\ldots\le x_n\le b} \frac{dx_1\ldots dx_n}{x_1\ldots x_n}
and x=xn+1,t=x0x = x_{n+1}, t = x_0 we have
fn+1(x)=1x∫0xg(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, \ldots, x_n and the fact that the integral is 0 on any hyperplanes (xi=xj)(x_i = x_j) we get that
n! hn(a,b)=∬a≤x1,…,xn≤bdx1…dxnx1…xn=∫ab…∫abdx1…dxnx1…xn=(∫abdxx)n=(log⁡(b/a))n.\begin{aligned} n!\ h_n(a, b) &= \iint_{a\le x_1,\ldots,x_n\le b} \frac{dx_1\ldots dx_n}{x_1\ldots x_n} = \int_a^b \ldots \int_a^b \frac{dx_1\ldots dx_n}{x_1\ldots x_n} \\ &= \left( \int_a^b \frac{dx}{x} \right)^n = (\log(b/a))^n. \end{aligned}
Therefore
fn+1(x)=1x∫0xg(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
1x∫0x(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 g−g(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

lim⁡n→∞(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 n≥n0n \ge n_0. Then, for any n≥n0n \ge n_0, we have
∣fn+1(x)∣≤1x∫0x∣g(t)∣(log⁡(x/t))nn!dt≤1x∫0δε(log⁡(x/t))nn!dt+1x∫δx∣g(t)∣(log⁡(x/δ))nn!dt≤1x∫0xε(log⁡(x/t))nn!dt+1x∫δxMεdt≤ε+Mε.\begin{aligned} |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 \frac{1}{x}\int_0^x \varepsilon\frac{(\log(x/t))^n}{n!}dt + \frac{1}{x}\int_\delta^x M\varepsilon dt \\ &\le \varepsilon + M\varepsilon. \end{aligned}
Therefore lim⁡nf(x)=0=g(0)\lim_n f(x) = 0 = g(0).

Μεταγραφή από το επίσημο κείμενο λύσεων, σελίδες 2–4. Η μεταγραφή δεν έχει ελεγχθεί δεύτερη φορά· αν έχεις αμφιβολία, κοίτα το πρωτότυπο.

Θέμα αρχείου: η εκφώνηση είναι το επίσημο κείμενο (μεταγραμμένο, με το πρωτότυπο παραπάνω). Η ταξινόμηση ανά αντικείμενο και η δυσκολία εκτιμήθηκαν αυτόματα· υποδείξεις και λύση στα ελληνικά προστίθενται σταδιακά.

Πώς πήγε;