A study guide for Bourgain's 2003 sum-product theorem and 2010 discretized projection theorem

These notes present Bourgain's proofs of the discretized sum-product theorem and its applications. The discussion emphasizes the construction of trees with multiscale porosity from small additive doubling, using either quantitative Freiman theorrem or the Plünnecke-Ruzsa inequality, and the amplification of these structures by multiplication. Additive combinatorial tools connect the resulting growth estimates to discretized sum-product problem. The notes also discuss the passage to the exceptional set estimates for orthogonal projections, the exclusion of Borel subrings of intermediate Hausdorff dimension, and Fourier decay for multiplicative convolutions of measures.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.20639
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A study guide for Bourgain's 2003 sum-product theorem and 2010 discretized projection theorem

Yudong Liang
arXiv (Cornell University)
Limits and Structures in Graph Theory
preprint

A study guide for Bourgain's 2003 sum-product theorem and 2010 discretized projection theorem

Yudong Liang
preprint en

Abstract

These notes present Bourgain's proofs of the discretized sum-product theorem and its applications. The discussion emphasizes the construction of trees with multiscale porosity from small additive doubling, using either quantitative Freiman theorrem or the Plünnecke-Ruzsa inequality, and the amplification of these structures by multiplication. Additive combinatorial tools connect the resulting growth estimates to discretized sum-product problem. The notes also discuss the passage to the exceptional set estimates for orthogonal projections, the exclusion of Borel subrings of intermediate Hausdorff dimension, and Fourier decay for multiplicative convolutions of measures.

arXiv (Cornell University)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon