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.32.0

D Lp Norm ddconv le d Lp Norm dddconv

dLpNorm_ddconv_le_dLpNorm_dddconv

Plain-language statement

For a complex-valued function and a nonzero even integer nn, discrete self-convolution has no larger LnL^n norm than discrete 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

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

Ent ofsum le

ent_ofsum_le

Plain-language statement

Let X1,X2X_1',X_2' be independent copies of the τ\tau-minimizers X1,X2X_1,X_2. Write k=d[X1;X2]k=d[X_1;X_2] and I1=I[X1+X2:X1+X2X1+X2+X1+X2]I_1=I[X_1+X_2:X_1'+X_2\mid X_1+X_2+X_1'+X_2']. Then the entropy of the four-variable sum obeys H[X1+X2+X1+X2]12H[X1]+12H[X2]+(2+η)kI1H[X_1+X_2+X_1'+X_2']\le\tfrac12H[X_1]+\tfrac12H[X_2]+(2+\eta)k-I_1.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Entropic PFR conjecture

entropic_PFR_conjecture

Plain-language statement

entropic_PFR_conjecture: For two GG-valued random variables X10,X20X^0_1, X^0_2, there is some subgroup HGH \leq G such that d[X10;UH]+d[X20;UH]11d[X10;X20]d[X^0_1;U_H] + d[X^0_2;U_H] \le 11 d[X^0_1;X^0_2].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Entropic PFR conjecture

entropic_PFR_conjecture'

Plain-language statement

In the project's entropic PFR package with parameter η=1/9\eta=1/9, there is a subspace HH and a random variable UU uniformly distributed on HH such that each reference variable is within six times their mutual Ruzsa distance of UU: d(X1,U),d(X2,U)6d(X1,X2)d(X_1,U),d(X_2,U)\le6d(X_1,X_2).

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record