All proofs
Project-declaredLean 4.32.0 · mathlib@81a5d257c8e4

E728

TileStructure.Forest.e728

Plain-language statement

The pairing of a tree boundary operator applied to ff with a test function gg is bounded by a sum over boundary cubes JJ. Each term integrates f|f| times a maximal function of gg over JJ, multiplied by a scale-decaying sum over grid cubes II whose enlarged balls contain JJ and whose scale is at least that of JJ.

Exact Lean statement

lemma e728 (hf : BoundedCompactSupport f) (hg : BoundedCompactSupport g) :
    ‖∫ x, conj (g x) * (t.boundaryOperator u f x).toReal‖ₑ ≤
    ∑ J ∈ 𝓙 (t u), ∫⁻ y in J, ‖f y‖ₑ * maximalFunction volume 𝓑 c𝓑 r𝓑 1 g y *
      ∑ I : Grid X, if (J : Set X) ⊆ ball (c I) (16 * D ^ s I) ∧ s J ≤ s I then
        (D : ℝ≥0∞) ^ ((s J - s I) / (a : ℝ)) else 0

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma e728 (hf : BoundedCompactSupport f) (hg : BoundedCompactSupport g) :    ‖∫ x, conj (g x) * (t.boundaryOperator u f x).toReal‖ₑ     ∑ J  𝓙 (t u), ∫⁻ y in J, ‖f y‖ₑ * maximalFunction volume 𝓑 c𝓑 r𝓑 1 g y *      ∑ I : Grid X, if (J : Set X)  ball (c I) (16 * D ^ s I)  s J  s I then        (D : 0∞) ^ ((s J - s I) / (a : )) else 0 := by  have nfs := hf.aestronglyMeasurable.enorm  calc    _ = ‖∑ I : Grid X, ((volume (ball (c I) (16 * D ^ s I)))⁻¹.toReal * ∫ x in I, conj (g x)) *        ∑ J  𝓙' t u (c I) (s I), (D ^ ((s J - s I) / (a : )) * ∫⁻ y in J, ‖f y‖ₑ).toReal‖ₑ := by      rw [e728_rearrange hf hg]    _  ∑ I : Grid X, ‖((volume (ball (c I) (16 * D ^ s I)))⁻¹.toReal * ∫ x in I, conj (g x)) *        ∑ J  𝓙' t u (c I) (s I), (D ^ ((s J - s I) / (a : )) * ∫⁻ y in J, ‖f y‖ₑ).toReal‖ₑ := by      simp_rw [enorm_eq_nnnorm,  ENNReal.ofNNReal_finsetSum, ENNReal.coe_le_coe]      apply nnnorm_sum_le    _  ∑ I : Grid X, (volume (ball (c I) (16 * D ^ s I)))⁻¹ * ‖∫ x in I, conj (g x)‖ₑ *        ∑ J  𝓙' t u (c I) (s I), ‖(D ^ ((s J - s I) / (a : )) * ∫⁻ y in J, ‖f y‖ₑ).toReal‖ₑ := by      simp_rw [enorm_mul]; gcongr <;> rw [ ofReal_norm, norm_real, ofReal_norm]      · exact enorm_toReal_le      · simp_rw [enorm_eq_nnnorm,  ENNReal.ofNNReal_finsetSum, ENNReal.coe_le_coe]        apply nnnorm_sum_le    _  ∑ I : Grid X, ((volume (ball (c I) (16 * D ^ s I)))⁻¹ * ∫⁻ x in I, ‖g x‖ₑ) *        ∑ J  𝓙' t u (c I) (s I), D ^ ((s J - s I) / (a : )) * ∫⁻ y in J, ‖f y‖ₑ := by      gcongr with I      · calc          _  _ := enorm_integral_le_lintegral_enorm _          _ = _ := by congr! 2 with x; exact RCLike.enorm_conj _      · exact enorm_toReal_le    _  ∑ I : Grid X,        ((volume (ball (c I) (16 * D ^ s I)))⁻¹ * ∫⁻ x in ball (c I) (16 * D ^ s I), ‖g x‖ₑ) *        ∑ J  𝓙' t u (c I) (s I), D ^ ((s J - s I) / (a : )) * ∫⁻ y in J, ‖f y‖ₑ := by      gcongr with I; refine Grid_subset_ball.trans <| ball_subset_ball ?_      exact mul_le_mul_of_nonneg_right (by norm_num) (by positivity)    _ = ∑ I : Grid X, (⨍⁻ x in ball (c I) (16 * D ^ s I), ‖g x‖ₑ ∂volume) *        ∑ J  𝓙' t u (c I) (s I), D ^ ((s J - s I) / (a : )) * ∫⁻ y in J, ‖f y‖ₑ := by      congr!; rw [laverage_eq, Measure.restrict_apply .univ, univ_inter, ENNReal.div_eq_inv_mul]    _ = ∑ J  𝓙 (t u), ∑ I : Grid X, if (J : Set X)  ball (c I) (16 * D ^ s I)  s J  s I then        (⨍⁻ x in ball (c I) (16 * D ^ s I), ‖g x‖ₑ ∂volume) *          D ^ ((s J - s I) / (a : )) * ∫⁻ y in J, ‖f y‖ₑ else 0 := by      rw [Finset.sum_comm]; congr with I      simp_rw [Finset.mul_sum, mul_assoc,  Finset.sum_filter]      refine Finset.sum_congr ?_ fun _ _  rfl      ext      simp only [𝓙', Finset.mem_filter, Finset.mem_univ, Set.mem_toFinset, true_and]    _ = ∑ J  𝓙 (t u), ∑ I : Grid X, ∫⁻ y in J,        if (J : Set X)  ball (c I) (16 * D ^ s I)  s J  s I then          (⨍⁻ x in ball (c I) (16 * D ^ s I), ‖g x‖ₑ ∂volume) *            D ^ ((s J - s I) / (a : )) * ‖f y‖ₑ else 0 := by      congr!; split_ifs      · rw [lintegral_const_mul'' _ nfs.restrict]      · simp    _ = ∑ J  𝓙 (t u), ∫⁻ y in J, ∑ I : Grid X,        if (J : Set X)  ball (c I) (16 * D ^ s I)  s J  s I then          (⨍⁻ x in ball (c I) (16 * D ^ s I), ‖g x‖ₑ ∂volume) *            D ^ ((s J - s I) / (a : )) * ‖f y‖ₑ else 0 := by      congr with J; refine (lintegral_finsetSum' _ fun I _  ?_).symm      exact (nfs.restrict.const_mul _).ite (.const _) aemeasurable_const    _  ∑ J  𝓙 (t u), ∫⁻ y in J, ∑ I : Grid X,        if (J : Set X)  ball (c I) (16 * D ^ s I)  s J  s I then          maximalFunction volume 𝓑 c𝓑 r𝓑 1 g y * D ^ ((s J - s I) / (a : )) * ‖f y‖ₑ else 0 := by      refine Finset.sum_le_sum fun J mJ  setLIntegral_mono_ae ?_ ?_      · refine (Finset.aemeasurable_fun_sum _ fun I _  ?_).restrict; split_ifs; swap; · simp        refine (AEMeasurable.mul_const ?_ _).mul nfs        exact measurable_maximalFunction.aemeasurable      · refine Eventually.of_forall fun y my  Finset.sum_le_sum fun I _  ?_        split_ifs with hIJ; swap; · rfl        refine mul_le_mul_left (mul_le_mul_left ?_ _) _        obtain b, mb, eb :  i  𝓑, ball (c𝓑 i) (r𝓑 i) = ball (c I) (16 * D ^ s I) := by          use (4, 0, I); norm_num [𝓑, c𝓑, r𝓑]        rw [maximalFunction]; simp_rw [inv_one, ENNReal.rpow_one]        exact le_iSup₂_of_le b mb (by rw [indicator_of_mem (eb ▸ hIJ.1 my), eb])    _ = _ := by      congr! with J - y -; rw [Finset.mul_sum]      congr with I; rw [mul_ite, mul_zero,  mul_rotate]
Project
Carleson formalization
License
Apache-2.0
Commit
74ef907d6bdb
Source
Carleson/ForestOperator/L2Estimate.lean:531-603

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

Project-declaredLean 4.32.0

Ae tendsto zero of distribution le

ae_tendsto_zero_of_distribution_le

Plain-language statement

Suppose that, for every error threshold δ>0\delta>0 and every measure tolerance ε>0\varepsilon>0, one can choose N0N_0 so that the set where supN>N0f(x)FN(x)\sup_{N>N_0}\lVert f(x)-F_N(x)\rVert exceeds δ\delta has measure at most ε\varepsilon. Then FN(x)F_N(x) converges to f(x)f(x) for almost every xx.

harmonic analysisFourier analysismeasure theory

Source project: Carleson formalization

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Antichain operator

antichain_operator

Plain-language statement

For an antichain A\mathfrak{A} of pairwise incomparable tiles, and measurable functions ff and gg bounded by the indicators of FF and GG, the pairing of gg with the Carleson sum over A\mathfrak{A} is controlled by the L2L^2 norms of ff and gg and by positive powers of the two tile-density parameters. Concretely, the bound is

C(a,q)dens1(A)(q1)/(8a4)dens2(A)1/q1/2f2g2.C(a,q)\,\mathrm{dens}_1(\mathfrak{A})^{(q-1)/(8a^4)}\,\mathrm{dens}_2(\mathfrak{A})^{1/q-1/2}\,\lVert f\rVert_2\lVert g\rVert_2.

harmonic analysisFourier analysismeasure theory

Source project: Carleson formalization

Person-level attribution pending.

View proof record