Source-pinned research

Research proof index

Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.

This index contains 38 research declarations. Search 10,000 more complete Mathlib declarations.

All topics

38 results

Clear filters
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

Three APFree w Inner one mu ddconv mu mu two smul mu

ThreeAPFree.wInner_one_mu_ddconv_mu_mu_two_smul_mu

Plain-language statement

For a finite group of odd order and a three-term-progression-free set ss, the normalized inner product between μsμs\mu_s*\mu_s and the uniform measure on 2s2s is exactly s2|s|^{-2}. The identity records the precise normalized count forced by the absence of nontrivial three-term progressions.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Unbalancing

unbalancing'

Project documentation

An unbalancing lemma in physical space. Suppose ν\nu is a probability weight, ff is real-valued, and ff and ν\nu admit self-difference-convolution factorizations f=ggf=g\mathbin{\circleddash}g and ν=hh\nu=h\mathbin{\circleddash}h. If 0<ε10<\varepsilon\le1, p0p\ne0, and fLp(ν)ε\|f\|_{L^p(\nu)}\ge\varepsilon, then some integer pp' satisfies p210ε2pp'\le 2^{10}\varepsilon^{-2}p and 1+fLp(ν)1+ε/2\|1+f\|_{L^{p'}(\nu)}\ge1+\varepsilon/2.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record