Define the sequence f1,f2,…:[0,1)→R of continuously differentiable functions by the following recurrence:
f1=1;fn+1′=fnfn+1on (0,1),andfn+1(0)=1.
Show that limn→∞fn(x) exists for every x∈[0,1) and determine the limit function.
Πρωτότυπο από το επίσημο PDF
Η μεταγραφή συγκρίθηκε σύμβολο προς σύμβολο με το πρωτότυπο, όχι ακόμα από άνθρωπο.
Χρόνος σε αυτό το θέμα
Δούλεψε τουλάχιστον 45 λεπτά πριν ανοίξεις τη λύση.
Επίσημη λύση
(Proposed by Tomáš Bárta, Charles University, Prague)
Solution. First of all, the sequence fn is well defined and it holds that
fn+1(x)=e∫0xfn(t)dt.(2)
The mapping Φ:C([0,1))→C([0,1)) given by
Φ(g)(x)=e∫0xg(t)dt
is monotone, i.e. if f<g on (0,1) then
Φ(f)(x)=e∫0xf(t)dt<e∫0xg(t)dt=Φ(g)(x)
on (0,1). Since f2(x)=e∫0x1mathrmdt=ex>1=f1(x) on (0,1), we have by induction fn+1(x)>fn(x) for all x∈(0,1), n∈N. Moreover, function f(x)=1−x1 is the unique solution to f′=f2, f(0)=1, i.e. it is the unique fixed point of Φ in {φ∈C([0,1)):φ(0)=1}. Since f1<f on (0,1), by induction we have fn+1=Φ(fn)<Φ(f)=f for all n∈N. Hence, for every x∈(0,1) the sequence fn(x) is increasing and bounded, so a finite limit exists.
Let us denote the limit g(x). We show that g(x)=f(x)=1−x1. Obviously, g(0)=limfn(0)=1. By f1≡1 and (2), we have fn>0 on [0,1) for each n∈N, and therefore (by (2) again) the function fn+1 is increasing. Since fn, fn+1 are positive and increasing also fn+1′ is increasing (due to fn+1′=fnfn+1), hence fn+1 is convex. A pointwise limit of a sequence of convex functions is convex, since we pass to a limit n→∞ in
fn(λx+(1−λ)y)≤λfn(x)+(1−λ)fn(y)
and obtain
g(λx+(1−λ)y)≤λg(x)+(1−λ)g(y)
for any fixed x, y∈[0,1) and λ∈(0,1). Hence, g is convex, and therefore continuous on (0,1). Moreover, g is continuous in 0, since 1≡f1≤g≤f and limx→0+f(x)=1. By Dini's Theorem, convergence fn→g is uniform on [0,1−ε] for each ε∈(0,1) (a monotone sequence converging to a continuous function on a compact interval). We show that Φ is continuous and therefore fn have to converge to a fixed point of Φ.
In fact, let us work on the space C([0,1−ε]) with any fixed ε∈(0,1), ∥⋅∥ being the supremum norm on [0,1−ε]. Then for a fixed function h and ∥φ−h∥<δ we have
for δ>0 small enough. Hence, Φ is continuous on C([0,1−ε]). Let us assume for contradiction that Φ(g)=g. Hence, there exists η>0 and x0∈[0,1−ε] such that ∣Φ(g)(x0)−g(x0)∣>η. There exists δ>0 such that ∥Φ(φ)−Φ(g)∥<31η whenever ∥φ−g∥<δ. Take n0 so large that ∥fn−g∥<min{δ,31η} for all n≥n0. Hence, ∥fn+1−Φ(g)∥=∥Φ(fn)−Φ(g)∥<31η. On the other hand, we have ∣fn+1(x0)−Φ(g)(x0)∣>∣Φ(g)(x0)−g(x0)∣−∣g(x0)−fn+1(x0)∣>η−31η=32η, contradiction. So, Φ(g)=g.
Since f is the only fixed point of Φ in {φ∈C([0,1−ε]):φ(0)=1}, we have g=f on [0,1−ε]. Since ε∈(0,1) was arbitrary, we have limn→∞fn(x)=1−x1 for all x∈[0,1).
Μεταγραφή από το επίσημο κείμενο λύσεων, σελίδες 3–5. Η μεταγραφή δεν έχει ελεγχθεί δεύτερη φορά· αν έχεις αμφιβολία, κοίτα το πρωτότυπο.
Θέμα αρχείου: η εκφώνηση είναι το επίσημο κείμενο (μεταγραμμένο, με το πρωτότυπο παραπάνω). Η ταξινόμηση ανά αντικείμενο και η δυσκολία εκτιμήθηκαν αυτόματα· υποδείξεις και λύση στα ελληνικά προστίθενται σταδιακά.
Πώς πήγε;
Οι κινήσεις που σημειώνεις επιστρέφουν νωρίτερα στη διαλογή.