Bourbaki

Exercise 21, § 8

Integration, V, p. 121

Denote by λ\lambda the Lebesgue measure on Rn\mathbf{R}^n.

a) Let C0C_0 be a cube (GT, VI, §1, No. 1) in Rn\mathbf{R}^n, and let u be a numerical function on C0C_0 that is integrable (for λ\lambda). Let s be a real number such that

s≥1λ(C0)∫C0∣u∣ dλ. s \geq \frac{1}{\lambda(C_0)} \int_{C_0} |u| \, d\lambda.

Show that there exists a sequence (Ik)(I_k) of open cubes contained in C0C_0, pairwise disjoint, and satisfying the following conditions:

1∘1^\circ ∣u(x)∣≤s|u(x)| \leq s almost everywhere in the set C0−⋃kIkC_0 - \bigcup_k I_k;

2∘2^\circ if one sets

uk=1λ(Ik)∫Ik∣u(x)∣ dλ(x), u_k = \frac{1}{\lambda(I_k)} \int_{I_k} |u(x)| \, d\lambda(x),

then uk≤2nsu_k \leq 2^n s for all kk;

3∘3^\circ ∑kλ(Ik)≤1s∫C0∣u(x)∣ dλ(x)\sum_k \lambda(I_k) \leq \frac{1}{s} \int_{C_0} |u(x)| \, d\lambda(x).

(Dividing into two equal intervals each of the projections of C0C_0, among the 2n2^n pairwise disjoint open cubes choose the cubes I1iI_{1i} such that the corresponding 'mean values' u1iu_{1i} are all ≥s\geq s, and, because of the choice of s, show that u1i≤2nsu_{1i} \leq 2^n s. Similarly decompose into 2n2^n cubes each of the cubes of the first subdivision that does not figure among the I1iI_{1i}, which yields a second finite family of cubes I2iI_{2i} chosen among all of the new cubes obtained as those for which the corresponding mean value u2iu_{2i} is ≤s\leq s. Continue by recursion. To prove that the condition 1∘1^\circ is verified, argue by contradiction, noting that the subset BmB_m of C0−⋃kIkC_0 - \bigcup_k I_k where ∣u(x)∣≥s+1/m|u(x)| \geq s + 1/m is, up to a negligible set, the intersection of a decreasing sequence (Ur)(U_r) of open sets, where UrU_r is the union of the cubes of the r-th subdivision that do not figure among the IkI_k and that contain a point of BmB_m.)

b) Let F\mathscr{F} be the set of integrable numerical functions u on C0C_0 having the following property: for every cube C⊂C0C \subset C_0, if mC(u)m_C(u) is the mean value

1λ(C)∫Cu(x) dλ(x), \frac{1}{\lambda(C)} \int_C u(x) \, d\lambda(x),

then ∫C∣u(x)−mC(u)∣ dλ(x)≤λ(C)\int_C |u(x) - m_C(u)| \, d\lambda(x) \leq \lambda(C); if u∈Fu \in \mathscr{F}, the same is true of u−cu - c for every real number c. For every function u∈Fu \in \mathscr{F}, every number σ>0\sigma > 0 and every cube C⊂C0C \subset C_0, denote by S(σ,u,C)S(\sigma, u, C) the set of x∈Cx \in C such that ∣u(x)−mC(u)∣≥σ|u(x) - m_C(u)| \geq \sigma. Finally, denote by G(σ)G(\sigma) the smallest number such that

λ(S(σ,u,C))≤G(σ)∫C∣u(x)−mC(u)∣ dλ(x) \lambda(S(\sigma, u, C)) \leq G(\sigma) \int_C |u(x) - m_C(u)| \, d\lambda(x)

as uu runs over F\mathscr{F}, and C over the set of cubes contained in C0C_0; one has G(σ)≤1/σG(\sigma) \leq 1/\sigma.

Show that if σ/2n>s≥1\sigma/2^n > s \geq 1 then

G(σ)≤1sG(σ−2ns). G(\sigma) \leq \frac{1}{s} G(\sigma - 2^n s).

(One can restrict oneself to proving that, for a u∈Fu \in \mathscr{F}, one has

λ(S(σ,u,C0))≤1sG(σ−2ns)∫C0∣u(x)−mC0(u)∣dλ(x), \lambda(S(\sigma, u, C_0)) \leq \frac{1}{s} G(\sigma - 2^n s) \int_{C_0} |u(x) - m_{C_0}(u)| d\lambda(x),

and one can suppose, to simplify, that mC0(u)=0m_{C_0}(u) = 0. Make use then of the decomposition of C0C_0 into a union of cubes IkI_k and a set where ∣u(x)∣≤s|u(x)| \leq s almost everywhere, on noting that if x∈Ikx \in I_k belongs to S(σ,u,C0)S(\sigma, u, C_0), then ∣u(x)−mIk(u)∣≥σ−2ns|u(x) - m_{I_k}(u)| \geq \sigma - 2^n s and consequently

λ(Ik∩S(σ,u,C0))≤G(σ−2ns)∫Ik∣u(x)−mIk(u)∣dλ(x). \lambda(I_k \cap S(\sigma, u, C_0)) \leq G(\sigma - 2^n s) \int_{I_k} |u(x) - m_{I_k}(u)| d\lambda(x).

c) Deduce from b) that there exist two constants B,bB, b depending only on nn, such that, for every function u∈Fu \in \mathscr{F} and every number σ>0\sigma > 0, one has λ(S(σ,u,C0))≤Be−bσλ(C0)\lambda(S(\sigma, u, C_0)) \leq Be^{-b\sigma} \lambda(C_0). (Take s=es = e in b).)

Solution

No solution has been written yet.

Transcribed from the printed volume. Not translated.