Bourbaki

Exercise 7, § 6

Integration, IV, p. 136

Bourbaki marks this one as harder than the rest.

Let ff be a numerical function that is positive, measurable and non-negligible. a) Show that if, for a finite number r>0r > 0, frf^r is integrable, then log⁡f\log f is quasi-integrable (§ 5, Exer. 15). b) Suppose that frf^r is integrable for 0<r<r00 < r < r_0. Let AA be the set of x∈Xx \in X such that f(x)>0f(x) > 0; show that if μ∗(A)>1\mu^*(A) > 1, then Nr(f)N_r(f) tends to +∞+\infty as rr tends to 0; if μ(A)<1\mu(A) < 1, Nr(f)N_r(f) tends to 0 with rr (make use of Prop. 4 of Ch. I). c) If μ(A)=1\mu(A) = 1, show that ∫frdμ\int f^r d\mu tends to 1 as rr tends to 0, and has a right-derivative at this point, equal to ∫log⁡f dμ\int \log f \, d\mu (make use of Exer. 12 of § 5); from this, deduce that as rr tends to 0, Nr(f)N_r(f) tends to G(f)=exp⁡(∫log⁡f dμ)G(f) = \exp(\int \log f \, d\mu). d) If μ(X)=1\mu(X) = 1 and if frf^r and log⁡f\log f are integrable, show that G(f)≤Nr(f)G(f) \leq N_r(f), the equality holding only if ff is constant almost everywhere (make use of Exer. 4). e) If μ(X)=1\mu(X) = 1 and if ff and gg are two measurable functions, positive and such that G(f)G(f) and G(g)G(g) are defined, show that G(f+g)G(f + g) is defined and that G(f)+G(g)≤G(f+g)G(f) + G(g) \leq G(f + g), the equality holding only if there exist two numbers α,β\alpha, \beta, not both zero, such that αf(x)=βg(x)\alpha f(x) = \beta g(x) almost everywhere, or if G(f+g)=0G(f + g) = 0 (make use of dd), considering the functions f/(f+g)f/(f + g) and g/(f+g)g/(f + g)).

Solution

No solution has been written yet.

Transcribed from the printed volume. Not translated.