Adjoint Carleson adjoint
adjointCarleson_adjoint
Plain-language statement
adjointCarleson is the adjoint of carlesonOn.
Exact Lean statement
lemma adjointCarleson_adjoint
(hf : BoundedCompactSupport f) (hg : BoundedCompactSupport g) (p : π X) :
β« x, conj (g x) * carlesonOn p f x = β« y, conj (adjointCarleson p g y) * f yFormal artifact
Lean source
lemma adjointCarleson_adjoint (hf : BoundedCompactSupport f) (hg : BoundedCompactSupport g) (p : π X) : β« x, conj (g x) * carlesonOn p f x = β« y, conj (adjointCarleson p g y) * f y := by let H := fun x β¦ fun y β¦ conj (g x) * (E p).indicator 1 x * MKD (π° p) x y * f y have hH : Integrable (uncurry H) := by let Hβ := fun x y β¦ βg xβ * βf yβ obtain β¨Mβ, hMβnn, hMββ© := hg.hasCompactSupport.isBounded.exists_bound_of_norm_Ks (π° p) have hHleHβ x y : βH x yβ β€ Mβ * βg xβ * βf yβ := by by_cases h : x β tsupport g Β· unfold H rw [norm_mul, norm_mul, norm_mul, norm_conj] nth_rw 2 [mul_assoc, mul_comm] gcongr apply mul_le_mul (norm_indicator_one_le ..) norm_MKD_le_norm_Ks (by simp) (by simp) |>.trans linarith [hMβ x y h] Β· suffices hz : H x y = 0 by rw [hz]; simp only [norm_zero, ge_iff_le]; positivity unfold H; simp [image_eq_zero_of_notMem_tsupport h] have : Integrable (fun z : X Γ X β¦ Mβ * βg z.1β * βf z.2β) := (hg.norm.const_mul _).integrable.mul_prod hf.norm.integrable apply this.mono Β· refine .mul ?_ hf.aestronglyMeasurable.comp_snd refine .mul ?_ ?_ Β· refine .mul ?_ ?_ Β· exact RCLike.continuous_conj.comp_aestronglyMeasurable hg.aestronglyMeasurable.comp_fst Β· exact aestronglyMeasurable_const.indicator measurableSet_E |>.comp_fst Β· unfold MKD fun_prop Β· apply ae_of_all exact fun z β¦ (hHleHβ z.1 z.2).trans <| Real.le_norm_self _ calc _ = β« x, conj (g x) * β« y, (E p).indicator 1 x * MKD (π° p) x y * f y := by congr 1; ext x; congr 1 rw [carlesonOn, indicator_eq_indicator_one_mul, β smul_eq_mul, β integral_smul] congr 1; ext y; unfold MKD; simp [smul_eq_mul]; ring _ = β« x, β« y, H x y := by unfold H; congr 1; ext x calc conj (g x) * β« y, (E p).indicator 1 x * MKD (π° p) x y * f y = β« y, conj (g x) * ((E p).indicator 1 x * MKD (π° p) x y * f y) := (integral_const_mul _ _).symm _ = β« y, conj (g x) * (E p).indicator 1 x * MKD (π° p) x y * f y := by congr 1; ext y; ring _ = β« y, β« x, H x y := integral_integral_swap hH _ = β« y, (β« x, conj (g x) * (E p).indicator 1 x * MKD (π° p) x y) * f y := by simp_rw [H]; congr 1; ext y exact integral_mul_const _ _ _ = β« y, conj (β« x, g x * (E p).indicator 1 x * conj (MKD (π° p) x y)) * f y := by congr 1; ext y; congr 1 have h : β x, conj (g x) * (E p).indicator 1 x * MKD (π° p) x y = conj (g x * (E p).indicator 1 x * conj (MKD (π° p) x y)) := fun x => by rw [map_mul, conj_conj, map_mul, conj_indicator, map_one] simp_rw [h] exact integral_conj _ = _ := by congr! with y simp_rw [mul_comm (g _) _] calc _ = β« x, (E p).indicator (fun x β¦ g x * conj (MKD (π° p) x y)) x := by congr with x; simp only [indicator]; split_ifs <;> simp _ = β« x in E p, g x * conj (MKD (π° p) x y) := integral_indicator measurableSet_E _ = β« x in E p, conj (MKD (π° p) x y) * g x := by congr; funext; rw [mul_comm] _ = _ := by unfold adjointCarleson MKD congr; funext; rw [map_mul, β exp_conj, mul_comm (cexp _)] congr; simp; ring- Project
- Carleson formalization
- License
- Apache-2.0
- Commit
- 74ef907d6bdb
- Source
- Carleson/Operators.lean:337-400
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
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.
Antichain operator
antichain_operator'
Plain-language statement
For an antichain , a measurable set , and measurable bounded by , the norm of the Carleson sum has the integral estimate
Source project: Carleson formalization
Person-level attribution pending.