Documentation

Carleson.Classical.Basic

noncomputable def partialFourierSum' {T : ℝ} [hT : Fact (0 < T)] (N : ℕ) (f : AddCircle T → ℂ) :
Equations
Instances For
    theorem partialFourierSum'_comp_equivAddCircle {p q : ℝ} [hp : Fact (0 < p)] [hq : Fact (0 < q)] {f : AddCircle q → ℂ} {N : ℕ} {x : AddCircle q} :
    (partialFourierSum' N fun (x : AddCircle p) => f ((AddCircle.equivAddCircle p q ⋯ ⋯) x)) ((AddCircle.equivAddCircle q p ⋯ ⋯) x) = (partialFourierSum' N f) x
    noncomputable def partialFourierSumLp {T : ℝ} [hT : Fact (0 < T)] (p : ENNReal) [Fact (1 ≤ p)] (N : ℕ) (f : AddCircle T → ℂ) :
    Equations
    Instances For
      theorem partialFourierSum'_eq_partialFourierSum_apply (N : ℕ) (f : AddCircle (2 * Real.pi) → ℂ) {x : ℝ} (hx : x ∈ Set.Ioc 0 (2 * Real.pi)) :
      (partialFourierSum' N f) ↑x = partialFourierSum N (fun (x : ℝ) => f ↑x) x
      @[simp]
      theorem fourierCoeffOn_mul {a b : ℝ} {hab : a < b} {f : ℝ → ℂ} {c : ℂ} {n : ℤ} :
      fourierCoeffOn hab (fun (x : ℝ) => c * f x) n = c * fourierCoeffOn hab f n
      @[simp]
      theorem fourierCoeffOn_neg {a b : ℝ} {hab : a < b} {f : ℝ → ℂ} {n : ℤ} :
      @[simp]
      theorem fourierCoeffOn_add {a b : ℝ} {hab : a < b} {f g : ℝ → ℂ} {n : ℤ} (hf : IntervalIntegrable f MeasureTheory.volume a b) (hg : IntervalIntegrable g MeasureTheory.volume a b) :
      fourierCoeffOn hab (f + g) n = fourierCoeffOn hab f n + fourierCoeffOn hab g n
      @[simp]
      theorem fourierCoeffOn_sub {a b : ℝ} {hab : a < b} {f g : ℝ → ℂ} {n : ℤ} (hf : IntervalIntegrable f MeasureTheory.volume a b) (hg : IntervalIntegrable g MeasureTheory.volume a b) :
      fourierCoeffOn hab (f - g) n = fourierCoeffOn hab f n - fourierCoeffOn hab g n
      @[simp]
      theorem partialFourierSum_mul {f : ℝ → ℂ} {a : ℂ} {N : ℕ} :
      (partialFourierSum N fun (x : ℝ) => a * f x) = fun (x : ℝ) => a * partialFourierSum N f x
      theorem fourier_periodic {n : ℤ} :
      Function.Periodic (fun (x : ℝ) => (fourier n) ↑x) (2 * Real.pi)
      theorem Function.Periodic.uniformContinuous_of_continuous {f : ℝ → ℂ} {T : ℝ} (hT : 0 < T) (hp : Periodic f T) (hc : ContinuousOn f (Set.Icc (-T) (2 * T))) :
      theorem fourier_uniformContinuous {n : ℤ} :
      UniformContinuous fun (x : ℝ) => (fourier n) ↑x
      theorem lower_secant_bound_aux {η : ℝ} (ηpos : 0 < η) {x : ℝ} (le_abs_x : η ≤ x) (abs_x_le : x ≤ 2 * Real.pi - η) (x_le_pi : x ≤ Real.pi) (h : Real.pi / 2 < x) :
      theorem lower_secant_bound' {η x : ℝ} (le_abs_x : η ≤ |x|) (abs_x_le : |x| ≤ 2 * Real.pi - η) :
      theorem lower_secant_bound {η x : ℝ} (xIcc : x ∈ Set.Icc (-2 * Real.pi + η) (2 * Real.pi - η)) (xAbs : η ≤ |x|) :