Partial Fourier Sum L2 norm
partialFourierSumL2_norm
Plain-language statement
For an function on a circle of period , the squared norm of its th partial Fourier sum equals the sum of the squared magnitudes of its Fourier coefficients from through :
Exact Lean statement
lemma partialFourierSumL2_norm {T : ℝ} [hT : Fact (0 < T)] [h2 : Fact (1 ≤ (2 : ENNReal))] {f : ↥(Lp ℂ 2 haarAddCircle)} {N : ℕ} :
‖partialFourierSumLp 2 N f‖ ^ 2 = ∑ n ∈ Finset.Icc (-Int.ofNat N) N, ‖@fourierCoeff T hT _ _ _ f n‖ ^ 2Formal artifact
Lean source
lemma partialFourierSumL2_norm {T : ℝ} [hT : Fact (0 < T)] [h2 : Fact (1 ≤ (2 : ENNReal))] {f : ↥(Lp ℂ 2 haarAddCircle)} {N : ℕ} : ‖partialFourierSumLp 2 N f‖ ^ 2 = ∑ n ∈ Finset.Icc (-Int.ofNat N) N, ‖@fourierCoeff T hT _ _ _ f n‖ ^ 2 := by calc ‖partialFourierSumLp 2 N f‖ ^ 2 _ = ‖partialFourierSumLp 2 N f‖ ^ (2 : ℝ) := by rw [← Real.rpow_natCast]; rfl _ = ‖fourierBasis.repr (partialFourierSumLp 2 N f)‖ ^ (2 : ℝ) := by rw [fourierBasis.repr.norm_map (partialFourierSumLp 2 N f)] _ = ‖∑ n ∈ Finset.Icc (-Int.ofNat N) N, fourierCoeff f n • (fourierBasis.repr (@fourierLp T hT 2 h2 n))‖ ^ (2 : ℝ) := by rw [partialFourierSumLp, map_sum] simp_rw [LinearMapClass.map_smul] _ = ∑ n ∈ Finset.Icc (-Int.ofNat N) N, ‖fourierCoeff f n‖ ^ (2 : ℝ) := by rw [← coe_fourierBasis] simp_rw [← fourierBasis.repr_symm_single, LinearIsometryEquiv.apply_symm_apply, ← lp.single_smul] have : 2 = (2 : ENNReal).toReal := by simp rw [this, ← lp.norm_sum_single (by simp), ← this] congr 2 refine Finset.sum_congr (by simp) fun n ↦ ?_ simp only [Int.ofNat_eq_natCast, Finset.mem_Icc, smul_eq_mul, mul_one, implies_true] _ = ∑ n ∈ Finset.Icc (-Int.ofNat N) N, ‖fourierCoeff f n‖ ^ 2 := by simp_rw [← Real.rpow_natCast]; rfl- Project
- Carleson formalization
- License
- Apache-2.0
- Commit
- 74ef907d6bdb
- Source
- Carleson/Classical/SpectralProjectionBound.lean:27-46
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.