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

1 topic

2 results

Clear filters
Project-declaredLean 4.33.0-rc1

Weak PFR asymm prelim

weak_PFR_asymm_prelim

Plain-language statement

An asymmetric weak-PFR estimate. Let A,BA,B be nonempty finite subsets of a rank-nn free Z\mathbb Z-module GG. There are a subgroup NGN\le G, cosets x,yG/Nx,y\in G/N, and nonempty fibers Ax={aA:a+N=x}A_x=\{a\in A:a+N=x\} and By={bB:b+N=y}B_y=\{b\in B:b+N=y\} such that nlog2logG/N+40d[UA;UB]n\log2\le\log|G/N|+40d[U_A;U_B] and logA+logBlogAxlogBy34(d[UA;UB]d[UAx;UBy]).\log|A|+\log|B|-\log|A_x|-\log|B_y|\le34\bigl(d[U_A;U_B]-d[U_{A_x};U_{B_y}]\bigr).

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record