All proofs
Project-declaredLean 4.32.0 · mathlib@81a5d257c8e4

Chang

chang

Project documentation

Chang's lemma for the large Fourier spectrum. If ff is nonzero and η>0\eta>0, there is a subset Δ\Delta of the η\eta-large spectrum such that the entire large spectrum lies in the additive span of Δ\Delta. The theorem also gives the explicit bound ΔCeL ⁣(f12/(f22G))/η2|\Delta| \le \left\lceil C e\,\left\lceil \mathcal L\!\left(\|f\|_1^2/(\|f\|_2^2|G|)\right)\right\rceil/\eta^2\right\rceil, with the project's constant CC.

Exact Lean statement

lemma chang (hf : f ≠ 0) (hη : 0 < η) :
    ∃ Δ, Δ ⊆ largeSpec f η ∧
      #Δ ≤ ⌈changConst * exp 1 * ⌈𝓛 ↑(‖f‖_[1] ^ 2 / ‖f‖_[2] ^ 2 / card G)⌉₊ / η ^ 2⌉₊ ∧
      largeSpec f η ⊆ Δ.addSpan

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma chang (hf : f  0) (hη : 0 < η) :     Δ, Δ  largeSpec f η  ⌈changConst * exp 1 * ⌈𝓛 ↑(‖f‖_[1] ^ 2 / ‖f‖_[2] ^ 2 / card G)⌉₊ / η ^ 2⌉₊       largeSpec f η  Δ.addSpan := by  refine exists_subset_addSpan_card_le_of_forall_addDissociated fun Δ hΔη hΔ  ?_  obtain hΔ' | hΔ' := eq_zero_or_pos #Δ  · simp [hΔ']  let α := ‖f‖_[1] ^ 2 / ‖f‖_[2] ^ 2 / card G  have : 0 < α := by positivity  set β := ⌈𝓛 α⌉₊  have hβ : 0 < β := Nat.ceil_pos.2 (curlog_pos (by positivity) <| α_le_one _)  have : 0 < ‖f‖_[1] := by positivity  refine le_of_pow_le_pow_left₀ hβ.ne' zero_le <| Nat.cast_le.1 <| le_of_mul_le_mul_right ?_    (by positivity : 0 <^ β *^ (2 * β) * α))  push_cast  rw [ mul_assoc,  pow_add,  two_mul]  refine ((spec_hoelder hη.le hΔη hβ.ne').trans <| hΔ.boringEnergy_le _).trans ?_  refine le_trans ?_ <| mul_le_mul_of_nonneg_right (pow_le_pow_left₀ ?_ (Nat.le_ceil _) _) ?_  any_goals positivity  rw [mul_right_comm, div_pow, mul_pow, mul_pow, exp_one_pow,  pow_mul, mul_div_assoc]  calc    _ = (changConst ** β) ^ β := by ring    _  (changConst ** β) ^ β ** exp β) := ?_    _  (changConst ** β) ^ β * ((η / η) ^ (2 * β) * α * exp β) := by      rw [div_self hη.ne', one_pow, one_mul]    _ = _ := by ring  refine le_mul_of_one_le_right (by positivity) ?_  rw [ inv_le_iff_one_le_mul₀' (by positivity)]  calc    α⁻¹ = exp (0 + log α⁻¹) := by rw [zero_add, exp_log]; positivity    _  exp ⌈0 + log α⁻¹⌉₊ := by gcongr; exact Nat.le_ceil _    _  exp β := by unfold β; gcongr; exact zero_le_one
Project
Arithmetic Progressions Almost Periodicity
License
Apache-2.0
Commit
afafc42a5326
Source
APAP/Prereqs/Chang.lean:177-208

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