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

Homomorphism pfr

homomorphism_pfr

Project documentation

Let f:GGf: G \to G' be a function, and let SS denote the set S:={f(x+y)f(x)f(y):x,yG}. S := \{ f(x+y)-f(x)-f(y): x,y \in G \}. Then there exists a homomorphism ϕ:GG\phi: G \to G' such that {f(x)ϕ(x)}S10.|\{f(x) - \phi(x)\}| \leq |S|^{10}.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

I₃ eq

I₃_eq

Plain-language statement

A symmetry identity in the τ\tau-minimizer endgame. Let X1,X2X_1',X_2' be independent copies of X1,X2X_1,X_2, and set U=X1+X2U=X_1+X_2, V=X1+X2V=X_1'+X_2, W=X1+X1W=X_1'+X_1, and S=X1+X2+X1+X2S=X_1+X_2+X_1'+X_2'. Then the conditional mutual informations agree: I[V:WS]=I[U:WS]I[V:W\mid S]=I[U:W\mid S].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

KLDiv add le KLDiv of indep

KLDiv_add_le_KLDiv_of_indep

Plain-language statement

If X,Y,ZX, Y, Z are independent GG-valued random variables, then DKL(X+ZY+Z)DKL(XY).D_{KL}(X+Z\Vert Y+Z) \leq D_{KL}(X\Vert Y).

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

C Lp Norm conjneg

MeasureTheory.cLpNorm_conjneg

Plain-language statement

The compact normalized LpL^p norm is unchanged by conjugating a function and reflecting its argument: xf(x)p=fp\|x\mapsto\overline{f(-x)}\|_p=\|f\|_p.

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 translate

MeasureTheory.cLpNorm_translate

Plain-language statement

Translation preserves the compact normalized LpL^p norm: for every group element aa, τafp=fp\|\tau_a f\|_{p}=\|f\|_{p}.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record