Documentation

Carleson.ToMathlib.HardyLittlewood

This should roughly contain the contents of chapter 9.

noncomputable def maximalFunction {X : Type u_1} {ε : Type u_2} [PseudoMetricSpace X] [MeasurableSpace X] [ENorm ε] {ι : Type u_4} (μ : MeasureTheory.Measure X) (š“‘ : Set ι) (c : ι → X) (r : ι → ā„) (p : ā„) (u : X → ε) (x : X) :

The uncentered Hardy-Littlewood maximal function, for a family of balls.

Equations
Instances For
    noncomputable def globalMaximalFunction {X : Type u_1} {ε : Type u_2} [PseudoMetricSpace X] [MeasurableSpace X] [ENorm ε] (μ : MeasureTheory.Measure X) (p : ā„) (u : X → ε) (x : X) :

    The uncentered Hardy-Littlewood maximal function.

    Equations
    Instances For
      theorem laverage_le_globalMaximalFunction {X : Type u_1} {ε : Type u_2} [PseudoMetricSpace X] [MeasurableSpace X] [ENorm ε] {μ : MeasureTheory.Measure X} {u : X → ε} {x z : X} {r : ā„} (h : dist x z < r) :

      The average of the norm of a function over a particular ball is smaller than the value of the globalMaximalFuntion at a point inside that ball.

      theorem lintegral_ball_le_volume_mul_globalMaximalFunction {X : Type u_1} {ε : Type u_2} [PseudoMetricSpace X] [MeasurableSpace X] [ENorm ε] {μ : MeasureTheory.Measure X} {u : X → ε} {x : X} [ProperSpace X] [MeasureTheory.IsFiniteMeasureOnCompacts μ] {z : X} {r : ā„} (h : dist x z < r) :

      The integral of the norm of a function over a particular ball is smaller than the volume of the ball times the value of the globalMaximalFuntion at a point inside that ball.

      theorem measure_biUnion_le_lintegral {X : Type u_1} {A : NNReal} [PseudoMetricSpace X] [MeasurableSpace X] {μ : MeasureTheory.Measure X} [μ.IsDoubling A] {ι : Type u_5} {c : ι → X} {r : ι → ā„} [OpensMeasurableSpace X] [TopologicalSpace.SeparableSpace X] (š“‘ : Set ι) (l : ENNReal) (u : X → ENNReal) (h2u : āˆ€ i ∈ š“‘, l * μ (Metric.ball (c i) (r i)) ≤ ∫⁻ (x : X) in Metric.ball (c i) (r i), u x āˆ‚Ī¼) :
      l * μ (ā‹ƒ i ∈ š“‘, Metric.ball (c i) (r i)) ≤ ↑A ^ 2 * ∫⁻ (x : X), u x āˆ‚Ī¼
      theorem lowerSemiContinuous_maximalFunction {X : Type u_1} {ε : Type u_2} [PseudoMetricSpace X] [MeasurableSpace X] [ENorm ε] {μ : MeasureTheory.Measure X} {ι : Type u_4} {š“‘ : Set ι} {c : ι → X} {r : ι → ā„} {p : ā„} {u : X → ε} :
      LowerSemicontinuous (maximalFunction μ š“‘ c r p u)
      theorem measurable_maximalFunction {X : Type u_1} {ε : Type u_2} [PseudoMetricSpace X] [MeasurableSpace X] [ENorm ε] {μ : MeasureTheory.Measure X} {ι : Type u_4} {š“‘ : Set ι} {c : ι → X} {r : ι → ā„} {p : ā„} {u : X → ε} [BorelSpace X] :
      Measurable (maximalFunction μ š“‘ c r p u)
      theorem maximalFunction_one_le_eLpNormEssSup {X : Type u_1} {ε : Type u_2} [PseudoMetricSpace X] [MeasurableSpace X] [ENorm ε] {μ : MeasureTheory.Measure X} {ι : Type u_4} {š“‘ : Set ι} {c : ι → X} {r : ι → ā„} {u : X → ε} {x : X} :
      maximalFunction μ š“‘ c r 1 u x ≤ MeasureTheory.eLpNormEssSup u μ
      noncomputable def CMB (A p : NNReal) :

      The constant factor in the statement that M_š“‘ has strong type.

      Equations
      Instances For
        theorem CMB_def {A p : NNReal} :
        CMB A p = MeasureTheory.C_realInterpolation ⊤ 1 ⊤ 1 (↑p) 1 (A ^ 2) 1 (↑p)⁻¹
        theorem CMB_eq_of_one_lt_q {b q : NNReal} (hq : 1 < q) :
        CMB b q = 2 * (q / (q - 1) * b ^ 2) ^ (↑q)⁻¹
        theorem CMB_defaultA_two_eq {a : ā„•} :
        CMB (↑(defaultA a)) 2 = 2 ^ (↑a + 3 / 2)
        theorem hasStrongType_maximalFunction_one {X : Type u_1} {ε' : Type u_3} {A : NNReal} [PseudoMetricSpace X] [MeasurableSpace X] {μ : MeasureTheory.Measure X} [μ.IsDoubling A] {ι : Type u_4} {š“‘ : Set ι} {c : ι → X} {r : ι → ā„} [TopologicalSpace ε'] [ESeminormedAddMonoid ε'] [SMul NNReal ε'] [ENormSMulClass NNReal ε'] [TopologicalSpace.PseudoMetrizableSpace ε'] [MeasurableSpace ε'] [BorelSpace ε'] [BorelSpace X] [MeasureTheory.IsFiniteMeasureOnCompacts μ] [ProperSpace X] [μ.IsOpenPosMeasure] {p : NNReal} (hp : 1 < p) :
        MeasureTheory.HasStrongType (maximalFunction μ š“‘ c r 1) (↑p) (↑p) μ μ ↑(CMB A p)

        Special case of equation (2.0.44). The proof is given between (9.0.12) and (9.0.34). Use the real interpolation theorem instead of following the blueprint.

        noncomputable def C2_0_6 (A p₁ pā‚‚ : NNReal) :

        The constant factor in the statement that M_{š“‘, p} has strong type.

        Equations
        Instances For
          theorem hasStrongType_maximalFunction {X : Type u_1} {ε' : Type u_3} {A : NNReal} [PseudoMetricSpace X] [MeasurableSpace X] {μ : MeasureTheory.Measure X} [μ.IsDoubling A] {ι : Type u_4} {š“‘ : Set ι} {c : ι → X} {r : ι → ā„} [TopologicalSpace ε'] [ContinuousENorm ε'] [BorelSpace X] [MeasureTheory.IsFiniteMeasureOnCompacts μ] [ProperSpace X] [μ.IsOpenPosMeasure] {p₁ pā‚‚ : NNReal} (hp₁ : 0 < p₁) (hp₁₂ : p₁ < pā‚‚) :
          MeasureTheory.HasStrongType (maximalFunction μ š“‘ c r ↑p₁) (↑pā‚‚) (↑pā‚‚) μ μ ↑(C2_0_6 A p₁ pā‚‚)

          The maximalFunction has strong type when p₁ < pā‚‚.

          noncomputable def C_weakType_maximalFunction (A p₁ pā‚‚ : NNReal) :
          Equations
          Instances For
            theorem C_weakType_maximalFunction_lt_top {A p₁ pā‚‚ : NNReal} :
            theorem hasWeakType_maximalFunction {X : Type u_1} {ε' : Type u_3} {A : NNReal} [PseudoMetricSpace X] [MeasurableSpace X] {μ : MeasureTheory.Measure X} [μ.IsDoubling A] {ι : Type u_4} {š“‘ : Set ι} {c : ι → X} {r : ι → ā„} [TopologicalSpace ε'] [ContinuousENorm ε'] [BorelSpace X] [MeasureTheory.IsFiniteMeasureOnCompacts μ] [ProperSpace X] [μ.IsOpenPosMeasure] {p₁ pā‚‚ : NNReal} (hp₁ : 0 < p₁) (hp₁₂ : p₁ ≤ pā‚‚) :
            MeasureTheory.HasWeakType (fun (u : X → ε') (x : X) => maximalFunction μ š“‘ c r (↑p₁) u x) (↑pā‚‚) (↑pā‚‚) μ μ (C_weakType_maximalFunction A p₁ pā‚‚)

            hasStrongType_maximalFunction minus the assumption hR, but where p₁ = pā‚‚ is possible and we only conclude a weak-type estimate.

            theorem C2_0_6_defaultA_one_two_eq {a : ā„•} :
            C2_0_6 (↑(defaultA a)) 1 2 = 2 ^ (↑a + 3 / 2)
            theorem C2_0_6_defaultA_one_le {a : ā„•} {q : NNReal} (hq : 1 < q) :
            C2_0_6 (↑(defaultA a)) 1 q ≤ 2 ^ (2 * a + 1) * (q / (q - 1))