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 199 research declarations. Search 10,000 more complete Mathlib declarations.

1 topic

199 results

Clear filters
Project-declaredLean 4.32.0

Classical carleson

classical_carleson

Plain-language statement

For every continuous, 2π2\pi-periodic function f:RCf : \mathbb{R} \to \mathbb{C}, the symmetric partial Fourier sums SNf(x)S_N f(x) converge to f(x)f(x) for almost every xRx \in \mathbb{R}.

harmonic analysisFourier analysismeasure theory

Source project: Carleson formalization

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Close smooth approx periodic Lp

close_smooth_approx_periodic_Lp

Plain-language statement

Let T>0T>0, 1p<1 \le p < \infty, and let ff belong to Lp((0,T])L^p((0,T]). For every ε>0\varepsilon>0, there is a smooth TT-periodic function f0:RCf_0 : \mathbb{R}\to\mathbb{C} such that

ff0Lp((0,T])ε.\lVert f-f_0\rVert_{L^p((0,T])} \le \varepsilon.

harmonic analysisFourier analysismeasure theory

Source project: Carleson formalization

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

C Lp Norm conv le c Lp Norm dconv

cLpNorm_conv_le_cLpNorm_dconv

Plain-language statement

For a complex-valued function on the ambient finite group and a nonzero even integer nn, ordinary self-convolution has no larger normalized LnL^n norm than self-difference-convolution: ffnffn\|f*f\|_n\le\|f\mathbin{\circleddash}f\|_n.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

C Lp Norm dft indicator one pow

cLpNorm_dft_indicator_one_pow

Plain-language statement

The 2n2n-th Fourier moment of the indicator of a finite set equals its order-nn additive energy: 1s^2n2n=En(s)\|\widehat{1_s}\|_{2n}^{2n}=E_n(s). This is the standard bridge between Fourier norms and additive tuple counts.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Conditionally Complete Lattice le bi Sup

ConditionallyCompleteLattice.le_biSup

Plain-language statement

In a conditionally complete linear order, suppose the values f(i)f(i) for isi\in s are bounded above. If one of those values is exactly aa, then aa is at most the supremum supisf(i)\sup_{i\in s} f(i).

harmonic analysisFourier analysismeasure theory

Source project: Carleson formalization

Person-level attribution pending.

View proof record