All projects

Standalone Lean project

Arithmetic Progressions Almost Periodicity

Formalized additive-combinatorics results on almost periodicity and arithmetic progressions.

38indexed declarationsLean 4.32.0mathlib@81a5d257c8e4commit afafc42a5326Apache-2.0Repository Versions and build evidence

Flagship declarations

Start with the mathematical results

Pinned project revision
Project-declaredLean 4.32.0

Drc

drc

Plain-language statement

A dependent-random-choice estimate. For p2p \ge 2, a nonnegative function ff, nonempty AA, and intersecting sets B1,B2B_1,B_2, the support hypothesis produces subsets A1B1A_1 \subseteq B_1 and A2B2A_2 \subseteq B_2 whose normalized difference convolution has controlled correlation with ff. Both relative sizes Ai/Bi|A_i|/|B_i| are bounded below by the same explicit quantity, namely one quarter of a normalized 2p2p-th power of the weighted LpL^p norm of 1A1A1_A \mathbin{\circleddash} 1_A.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Sifting cor

sifting_cor

Plain-language statement

A dependent-random-choice corollary. Let AA be nonempty, let 0<ε10<\varepsilon\le 1 and δ>0\delta>0, and let pp be a nonzero even integer satisfying ε1log(2/δ)p\varepsilon^{-1}\log(2/\delta)\le p. Then there are sets A1,A2A_1,A_2 such that the normalized difference distribution μA1μA2\mu_{A_1}\mathbin{\circleddash}\mu_{A_2} assigns mass at least 1δ1-\delta to the source's sifted set sp,ε(A)s_{p,\varepsilon}(A). Both sets retain explicit density: dens(Ai)14dens(A)2p\operatorname{dens}(A_i)\ge \tfrac14\operatorname{dens}(A)^{2p} for i=1,2i=1,2.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

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.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

General hoelder

general_hoelder

Plain-language statement

A weighted Hölder lower bound for Fourier energy. If Δ\Delta lies in the η\eta-large spectrum of ff, m0m\ne0, and a weight ν\nu is at least 11 wherever ff is nonzero, then the order-mm energy of Δ\Delta weighted by ν^\widehat\nu is at least Δ2mη2mf12/f22|\Delta|^{2m}\eta^{2m}\|f\|_1^2/\|f\|_2^2.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record

Project index

More declarations

Search within this project

Showing 8 of 34 additional declarations. Use project search for the complete index.

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
Project-declaredLean 4.32.0

Ap in ff

ap_in_ff

Project documentation

A finite-field approximation lemma. If A1A_1 and A2A_2 each have density at least α\alpha, then for any test set SS and 0<ε10<\varepsilon\le1 there is a subspace VV of explicitly bounded codimension such that smoothing μA1μA2\mu_{A_1}*\mu_{A_2} by the uniform measure on VV changes its total mass on SS by at most ε\varepsilon.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Chord Set subset smul arc Set

BohrSet.chordSet_subset_smul_arcSet

Plain-language statement

For a finite ambient group, the chord model of a Bohr set BB is contained in the arc model after widening BB by the factor π/2\pi/2: Bchord((π/2)B)arcB_{\mathrm{chord}}\subseteq ((\pi/2)B)_{\mathrm{arc}}.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Le iff width

BohrSet.le_iff_width

Plain-language statement

Characterization of the order on Bohr sets. The relation B1B2B_1\le B_2 holds exactly when every frequency of B2B_2 is also a frequency of B1B_1, and widthB1(ψ)widthB2(ψ)\operatorname{width}_{B_1}(\psi)\le \operatorname{width}_{B_2}(\psi) for each such frequency.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Mem arc Set iff nnnorm width

BohrSet.mem_arcSet_iff_nnnorm_width

Plain-language statement

A point xx belongs to the arc model of a Bohr set BB exactly when every frequency ψ\psi of BB satisfies angle(ψ(x),1)widthB(ψ)\|\operatorname{angle}(\psi(x),1)\|\le \operatorname{width}_B(\psi). Thus membership can be checked using only the stored frequencies and widths.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Mem chord Set iff nnnorm width

BohrSet.mem_chordSet_iff_nnnorm_width

Plain-language statement

A point xx belongs to the chord model of a Bohr set BB exactly when 1ψ(x)widthB(ψ)\|1-\psi(x)\|\le \operatorname{width}_B(\psi) for every frequency ψ\psi of BB.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record