All proofs
Project-declaredLean 4.32.0 · mathlib@81a5d257c8e4

D Lp Norm ddconv le

dLpNorm_ddconv_le

Plain-language statement

A special case of Young's convolution inequality.

Exact Lean statement

lemma dLpNorm_ddconv_le {p : ℝ≥0} (hp : 1 ≤ p) (f g : G → 𝕜) :
    ‖f ∗ᵈ g‖_[p] ≤ ‖f‖_[p] * ‖g‖_[1]

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma dLpNorm_ddconv_le {p : 0} (hp : 1  p) (f g : G  𝕜) :    ‖f ∗ᵈ g‖_[p]  ‖f‖_[p] * ‖g‖_[1] := by  obtain rfl | hp := hp.eq_or_lt  · simp_rw [ENNReal.coe_one, dL1Norm_eq_sum_norm, sum_mul_sum, ddconv_eq_sum_sub']    calc      ∑ x, ‖∑ y, f y * g (x - y)‖  ∑ x, ∑ y, ‖f y * g (x - y)‖ :=        sum_le_sum fun x _  norm_sum_le _ _      _ = _ := ?_    rw [sum_comm]    simp_rw [norm_mul]    exact sum_congr rfl fun x _  Fintype.sum_equiv (Equiv.subRight x) _ _ fun _  rfl  have hp₀ := zero_lt_one.trans hp  rw [ rpow_le_rpow_iff _ _ hp₀, mul_rpow]  any_goals positivity  dsimp  simp_rw [dLpNorm_rpow_eq_sum_norm hp₀.ne', ddconv_eq_sum_sub']  have hpconj : (p : ).HolderConjugate (1 - (p : )⁻¹)⁻¹ :=    by simp, mod_cast hp₀, by bound  have (x : G) : ‖∑ y, f y * g (x - y)‖ ^ (p : )       (∑ y, ‖f y‖ ^ (p : ) * ‖g (x - y)‖) * (∑ y, ‖g (x - y)‖) ^ (p - 1 : ) := by    rw [ le_rpow_inv_iff_of_pos, mul_rpow,  rpow_mul, sub_one_mul, mul_inv_cancel₀]    any_goals positivity    calc      _  ∑ y, ‖f y * g (x - y)‖ := norm_sum_le _ _      _ = ∑ y, ‖f y‖ * ‖g (x - y)‖ ^ (p : )⁻¹ * ‖g (x - y)‖ ^ (1 - (p : )⁻¹) := ?_      _  _ := inner_le_Lp_mul_Lq _ _ _ hpconj      _ = _ := ?_    · congr with t      rw [norm_mul, mul_assoc,  rpow_add' (by positivity), add_sub_cancel, rpow_one]      simp    · have : 1 - (p : )⁻¹  0 := sub_ne_zero.2 (inv_ne_one.2 <| NNReal.coe_ne_one.2 hp.ne').symm      simp [mul_rpow, rpow_nonneg, hp₀.ne', this, abs_rpow_of_nonneg]  calc    ∑ x, ‖∑ y, f y * g (x - y)‖ ^ (p : )         ∑ x, (∑ y, ‖f y‖ ^ (p : ) * ‖g (x - y)‖) * (∑ y, ‖g (x - y)‖) ^ (p - 1 : ) :=      sum_le_sum fun i _  this _    _ = _ := ?_  have hg :  x, ∑ y, ‖g (x - y)‖ = ‖g‖_[1] := by    simp_rw [dL1Norm_eq_sum_norm]    exact fun x  Fintype.sum_equiv (Equiv.subLeft _) _ _ fun _  rfl  have hg' :  y, ∑ x, ‖g (x - y)‖ = ‖g‖_[1] := by    simp_rw [dL1Norm_eq_sum_norm]    exact fun x  Fintype.sum_equiv (Equiv.subRight _) _ _ fun _  rfl  simp_rw [hg]  rw [ sum_mul, sum_comm]  simp_rw [ mul_sum, hg']  rw [ sum_mul, mul_assoc,  rpow_one_add' (by positivity), add_sub_cancel]  rw [add_sub_cancel]  positivity
Project
Arithmetic Progressions Almost Periodicity
License
Apache-2.0
Commit
afafc42a5326
Source
APAP/Prereqs/Convolution/Norm.lean:81-129

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

Add Dissociated boring Energy le

AddDissociated.boringEnergy_le

Project documentation

If a finite set ss is additively dissociated, then its order-nn additive energy is at most CnnnsnC^n n^n |s|^n, where CC is the project's Chang constant. This is the quantitative dissociated-set estimate used in the proof of Chang's lemma.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Linfty almost periodicity

AlmostPeriodicity.linfty_almost_periodicity

Project documentation

An LL^\infty almost-periodicity theorem. Under the small-growth hypothesis σ[A,S]K\sigma[A,S]\le K, and for nonempty finite sets B,CB,C, there is a set of translations TT with TK4096L(C/B)/ε2S|T|\ge K^{-4096\lceil\mathcal L(|C|/|B|)\rceil/\varepsilon^2}|S|. Every tTt\in T changes the normalized convolution μA1BμC\mu_A*1_B*\mu_C by at most ε\varepsilon in LL^\infty.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Linfty almost periodicity boosted

AlmostPeriodicity.linfty_almost_periodicity_boosted

Plain-language statement

A boosted LL^\infty almost-periodicity estimate. Under σ[A,S]K\sigma[A,S]\le K, it finds a large set TT, with the stated lower bound TK4096L(C/B)k2/ε2S|T|\ge K^{-4096\lceil\mathcal L(|C|/|B|)\rceil k^2/\varepsilon^2}|S|, such that averaging the target convolution against the kk-fold convolution of μT\mu_T changes it by at most ε\varepsilon in LL^\infty.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record