All proofs
Project-declaredLean 4.32.0 Β· mathlib@81a5d257c8e4

Rudin exp ineq

rudin_exp_ineq

Plain-language statement

Rudin's inequality, exponential form.

Exact Lean statement

lemma rudin_exp_ineq (f : G β†’ β„‚) (hf : AddDissociated <| support <| cft f) :
    𝔼 a, exp (f a).re ≀ exp (β€–fβ€–β‚™_[2] ^ 2 / 2)

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma rudin_exp_ineq (f : G β†’ β„‚) (hf : AddDissociated <| support <| cft f) :    𝔼 a, exp (f a).re ≀ exp (β€–fβ€–β‚™_[2] ^ 2 / 2) := by  have (z : β„‚) : exp (re z) ≀ cosh β€–zβ€– + re (z / β€–zβ€–) * sinh β€–zβ€– :=    calc      _ = _ := by obtain rfl | hz := eq_or_ne z 0 <;> simp [*]      _ ≀ _ := exp_mul_le_cosh_add_mul_sinh (by simpa using z.abs_re_div_norm_le_one) _  choose c hc hcf using fun ψ ↦ Complex.exists_norm_mul_eq_self (cft f ψ)  have hcβ‚€ (ψ) : c ψ β‰  0 := fun h ↦ by simpa [h] using hc ψ  have (a : G) :    exp (f a).re ≀ ∏ ψ, (cosh β€–cft f Οˆβ€– + (c ψ * sinh β€–cft f Οˆβ€– * ψ a).re) :=    calc      _ = ∏ ψ, exp ((cft f ψ * ψ a).re) := by simp_rw [← exp_sum, ← Complex.re_sum, cft_inversion]      _ ≀ _ := prod_le_prod (fun _ _ ↦ by positivity) fun _ _ ↦ this _      _ = ∏ ψ, (cosh β€–cft f Οˆβ€– + (c ψ * (cft f ψ * ψ a)            / (c ψ * ↑‖cft f Οˆβ€–)).re * sinh β€–cft f Οˆβ€–) := by          simp_rw [norm_mul, AddChar.norm_apply, mul_one, mul_div_mul_left _ _ (hcβ‚€ _)]      _ = _ := by          congr with ψ          obtain hψ | hψ := eq_or_ne (cft f ψ) 0          Β· simp [hψ]          Β· simp only [hcf, mul_left_comm (c _), mul_div_cancel_leftβ‚€ _ hψ, ← Complex.re_mul_ofReal,              mul_right_comm]  calc    _ ≀ 𝔼 a, ∏ ψ, (cosh β€–cft f Οˆβ€– + (c ψ * sinh β€–cft f Οˆβ€– * ψ a).re) :=        expect_le_expect fun _ _ ↦ this _    _ = ∏ ψ, cosh β€–cft f Οˆβ€– :=        AddDissociated.randomisation _ _ <| by simpa [-Complex.ofReal_sinh, hcβ‚€]    _ ≀ ∏ ψ, exp (β€–cft f Οˆβ€– ^ 2 / 2) :=        prod_le_prod (fun _ _ ↦ by positivity) fun _ _ ↦ cosh_le_exp_half_sq _    _ = _ := by simp_rw [← exp_sum, ← sum_div, ← dL2Norm_cft, dL2Norm_sq_eq_sum_norm]
Project
Arithmetic Progressions Almost Periodicity
License
Apache-2.0
Commit
afafc42a5326
Source
APAP/Prereqs/Rudin.lean:29-58

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 Cnnn∣s∣nC^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 L∞L^\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 ∣T∣β‰₯Kβˆ’4096⌈L(∣C∣/∣B∣)βŒ‰/Ξ΅2∣S∣|T|\ge K^{-4096\lceil\mathcal L(|C|/|B|)\rceil/\varepsilon^2}|S|. Every t∈Tt\in T changes the normalized convolution ΞΌAβˆ—1Bβˆ—ΞΌC\mu_A*1_B*\mu_C by at most Ξ΅\varepsilon in L∞L^\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 L∞L^\infty almost-periodicity estimate. Under Οƒ[A,S]≀K\sigma[A,S]\le K, it finds a large set TT, with the stated lower bound ∣T∣β‰₯Kβˆ’4096⌈L(∣C∣/∣B∣)βŒ‰k2/Ξ΅2∣S∣|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 L∞L^\infty.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record