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

1 topic

83 results

Clear filters
Project-declaredLean 4.33.0-rc1

Card of slice

card_of_slice

Plain-language statement

For every set AA in the ambient finite F2\mathbb F_2-vector space, some linear functional φ:GF2\varphi:G\to\mathbb F_2 has at least (A1)/2(|A|-1)/2 elements of AA in its 11-fiber.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

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

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.33.0-rc1

Cond multi Dist chain Rule

cond_multiDist_chainRule

Plain-language statement

A chain rule for conditional multidistance. Let π:GH\pi:G\to H be a homomorphism, and suppose the pairs (Xi,Yi)(X_i,Y_i) are independent across the finite index set. Then D[XY]=D[X(πX,Y)]+D[πXY]+I ⁣[iXi:(πXi)i|(π ⁣(iXi),(Yi)i)].D[X\mid Y]=D[X\mid(\pi X,Y)]+D[\pi X\mid Y]+I\!\left[\sum_iX_i:(\pi X_i)_i\,\middle|\,\left(\pi\!\left(\sum_iX_i\right),(Y_i)_i\right)\right]. The first term measures the remaining fiberwise multidistance after adjoining each image π(Xi)\pi(X_i) to its conditioning data.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Cond KLDiv eq

condKLDiv_eq

Plain-language statement

If X,YX, Y are GG-valued random variables, and ZZ is another random variable defined on the same sample space as XX, then DKL((XZ)Y)=DKL(XY)+\bbH[X]\bbH[XZ].D_{KL}((X|Z)\Vert Y) = D_{KL}(X\Vert Y) + \bbH[X] - \bbH[X|Z].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record