Maximal Theorem
📂Measure TheoryMaximal Theorem
Theorem
For every f∈Lloc1 and every α>0, there exists a constant C>0 that satisfies the following condition.
μ({x : Hf(x)>α})≤αC∫∣f(y)∣dy
This inequality is called the Hardy-Littlewood maximal inequality.
The Hardy-Littlewood maximal function
Hf(x)=r>0supAr∣f∣(x)=r>0supμ(B(r,x))1∫B(r,x)∣f(y)∣dy
Proof
Let’s say Eα={x ∣ Hf(x)>α}. Then, by the definition of Hf, we know that for some r, Ar∣f∣(x)>α holds. Let’s fix this r and name it rx. Now, let’s say B={B(rx,x) ∣ x∈Eα}, U=⋃B∈BB. Then, U is a cover of Eα, therefore c<μ(Eα)≤μ(U).
Maximal lemma
Let’s say B is a collection of open balls in Rn. Let’s say U=B∈B⋃B. Then, for some c<m(U), there exists a finite number of disjoint Bj∈B that satisfy the following condition:
j=1∑kμ(Bj)>3−nc
By the maximal lemma, for each x1,⋯,xk∈Xα, there exists a finite number of open balls Bj=B(rxj,xj) that satisfy the following equation:
1∑km(Bj)>3n1c
Now, let’s fix xj. Then, the following holds:
Arxj∣f∣(xj)=m(Bj)1∫Bj∣f∣(y)dy>α⟹m(Bj)<α1∫Bj∣f∣(y)dy
Therefore, we obtain the following:
c<3n1∑km(Bj)≤α3n1∑k∫Bj∣f(y)∣dy≤α3n∫Rn∣f(y)∣dy=α3n∣f∣L1
Taking the limit c↗m(Eα) completes the proof.
■