The Marcinkiewisz real interpolation theorem #
This file contains a proof of the Marcinkiewisz real interpolation theorem. The proof roughly follows Folland, Real Analysis. Modern Techniques and Their Applications, section 6.4, theorem 6.28, but a different truncation is used, and some estimates instead follow the technique as e.g. described in [Duoandikoetxea, Fourier Analysis, 2000].
This file has the definitions for the main proof, and the final proof of the theorem. A few other files contain the necessary pre-requisites:
- (in
InterpolateExponents.lean) Convenience results for working with (interpolated) exponents - (in
InterpolateExponents.lean) Results about the particular choice of exponent - (in
Misc.lean) Interface for using cutoff functions - (in
Misc.lean) Results about the particular choice of scale - (in
Misc.lean) Some tools for measure theory computations - (in
Misc.lean) Results about truncations of a function - (in
Misc.lean) Measurability properties of truncations - (in
Misc.lean) Truncations and Lp spaces - (in
Misc.lean) Some results about the integrals of truncations - (in
Minkowski.lean) Minkowski's integral inequality - (in
Minkowski.lean) Apply Minkowski's integral inequality to truncations - (in
Minkowski.lean) Weaktype estimates applied to truncations
TODO #
Generalise this to functions taking values in ℝ≥0∞, instead of ℝ. This entails generalising
most intermediate lemmas from normed spaces to the appropriate enorm classes.
Equations
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
The operator is subadditive on functions satisfying P with constant A
(this is almost vacuous if A = ⊤).
Equations
Instances For
The operator is sublinear on functions satisfying P with constant A.
Equations
- MeasureTheory.AESublinearOn T P A ν = (MeasureTheory.AESubadditiveOn T P A ν ∧ ∀ (f : α → ε₁) (c : NNReal), P f → T (c • f) =ᵐ[ν] c • T f)
Instances For
Proof of the real interpolation theorem #
In this section the estimates are combined to finally give a proof of the
real interpolation theorem.
Proposition that expresses that the map T map between function spaces preserves
AE strong measurability on L^p.
Equations
- MeasureTheory.PreservesAEStrongMeasurability T p = ∀ ⦃f : α → ε₁⦄, MeasureTheory.MemLp f p μ → MeasureTheory.AEStronglyMeasurable (T f) ν
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
The trivial case for the estimate in the real interpolation theorem
when the function Lp norm of f vanishes.
The estimate for the real interpolation theorem in case p₀ < p₁.
The main estimate in the real interpolation theorem for p₀ = p₁, before taking roots,
for the case q₀ < q₁.
The main estimate for the real interpolation theorem for p₀ = p₁, requiring q₀ ≠ q₁,
before taking roots.
The main estimate for the real interpolation theorem, before taking roots, combining
the cases p₀ ≠ p₁ and p₀ = p₁.
The definition of the constant in the real interpolation theorem, when viewed as
an element of ℝ≥0∞.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The constant occurring in the real interpolation theorem
Equations
- MeasureTheory.C_realInterpolation p₀ p₁ q₀ q₁ q C₀ C₁ A t = (MeasureTheory.C_realInterpolation_ENNReal p₀ p₁ q₀ q₁ q C₀ C₁ A t).toNNReal
Instances For
Marcinkiewicz real interpolation theorem