Close smooth approx periodic Lp
close_smooth_approx_periodic_Lp
Plain-language statement
Let , , and let belong to . For every , there is a smooth -periodic function such that
Exact Lean statement
lemma close_smooth_approx_periodic_Lp {T : ℝ} [hT : Fact (0 < T)] {f : ℝ → ℂ}
{p : ENNReal} (hp : 1 ≤ p) (hp' : p ≠ ⊤) (hf : MemLp f p (volume.restrict (Set.Ioc 0 T)))
{ε : NNReal} (εpos : 0 < ε) :
∃ (f₀ : ℝ → ℂ), ContDiff ℝ ∞ f₀ ∧ f₀.Periodic T ∧
eLpNorm (f - f₀) p (volume.restrict (Set.Ioc 0 T)) ≤ εFormal artifact
Lean source
lemma close_smooth_approx_periodic_Lp {T : ℝ} [hT : Fact (0 < T)] {f : ℝ → ℂ} {p : ENNReal} (hp : 1 ≤ p) (hp' : p ≠ ⊤) (hf : MemLp f p (volume.restrict (Set.Ioc 0 T))) {ε : NNReal} (εpos : 0 < ε) : ∃ (f₀ : ℝ → ℂ), ContDiff ℝ ∞ f₀ ∧ f₀.Periodic T ∧ eLpNorm (f - f₀) p (volume.restrict (Set.Ioc 0 T)) ≤ ε := by set f' := AddCircle.liftIoc T 0 f have hf' : MemLp f' p volume := by rw [← zero_add T] at hf exact hf.memLp_liftIoc rcases hf'.exists_boundedContinuous_eLpNorm_sub_le (ε := ε / 2) hp' (by simp [εpos.ne']) with ⟨g, hf'g, hg⟩ set h := fun (x : ℝ) ↦ g x have periodic_h : h.Periodic T := by unfold h intro x simp have unicont_h : UniformContinuous h := by apply periodic_h.uniformContinuous_of_continuous hT.out (Continuous.continuousOn _) continuity have meas_h : AEStronglyMeasurable h (volume.restrict (Set.Ioc 0 T)) := unicont_h.continuous.measurable.aestronglyMeasurable set ε' : ℝ := (T ^ p.toReal⁻¹)⁻¹ * (ε / 2) have ε'pos : 0 < ε' := by have := hT.out positivity rcases close_smooth_approx_periodic unicont_h periodic_h ε'pos with ⟨f₀, contdiff_f₀, periodic_f₀, hf₀⟩ have meas_f₀ : AEStronglyMeasurable f₀ (volume.restrict (Set.Ioc 0 T)) := contdiff_f₀.continuous.measurable.aestronglyMeasurable use f₀, contdiff_f₀, periodic_f₀ calc _ _ ≤ eLpNorm (f - h) p (volume.restrict (Set.Ioc 0 T)) + eLpNorm (h - f₀) p (volume.restrict (Set.Ioc 0 T)) := by apply (eLpNorm_add_le (hf.1.sub meas_h) (meas_h.sub meas_f₀) hp).trans_eq' simp _ ≤ ε / 2 + ε / 2 := by gcongr · calc _ _ = eLpNorm (f' - ⇑g) p volume := by nth_rw 1 [← zero_add T] rw [eLpNorm_eq_eLpNorm_liftIoc (by rw [zero_add]; exact hf.1.sub meas_h)] congr with x unfold f' h rw [AddCircle.liftIoc, AddCircle.liftIoc] simp exact hf'g · apply (eLpNorm_le_of_ae_bound (C := ε') _).trans · simp only [MeasurableSet.univ, Measure.restrict_apply, Set.univ_inter, volume_Ioc, sub_zero] unfold ε' -- todo: potentially automatable ENNReal calculation rw [ENNReal.ofReal_rpow_of_pos hT.out, ← ENNReal.ofReal_mul (Real.rpow_nonneg hT.out.le _), ← mul_assoc, mul_inv_cancel₀, one_mul] · norm_cast · rw [Real.rpow_ne_zero hT.out.le] · exact hT.out.ne' · simp only [ne_eq, inv_eq_zero] rw [← ne_eq, ENNReal.toReal_ne_zero] use (by positivity) filter_upwards exact hf₀ _ = ε := by simp- Project
- Carleson formalization
- License
- Apache-2.0
- Commit
- 74ef907d6bdb
- Source
- Carleson/Classical/Approximation.lean:41-103
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Adjoint Carleson adjoint
adjointCarleson_adjoint
Plain-language statement
adjointCarleson is the adjoint of carlesonOn.
Source project: Carleson formalization
Person-level attribution pending.
Ae tendsto zero of distribution le
ae_tendsto_zero_of_distribution_le
Plain-language statement
Suppose that, for every error threshold and every measure tolerance , one can choose so that the set where exceeds has measure at most . Then converges to for almost every .
Source project: Carleson formalization
Person-level attribution pending.
Antichain operator
antichain_operator
Plain-language statement
For an antichain of pairwise incomparable tiles, and measurable functions and bounded by the indicators of and , the pairing of with the Carleson sum over is controlled by the norms of and and by positive powers of the two tile-density parameters. Concretely, the bound is
Source project: Carleson formalization
Person-level attribution pending.