betaFeedback

WorksMathematics

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

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.

Introduction

These notes emphasize the ideas in Bourgain’s arguments in [1][2]. This paper seeks to balance, in its presentation, the ideas behind the proof and its details. Before starting the proof, I will try to give a rough outline and explain the main ideas. Readers who are not interested in the technical details may read only this part and skip the lengthy proof that follows. Absolute constants may change from line to line; sufficiently small parameters may be reselected to absorb preceding losses. Scale-dependent losses and structural hypotheses are recorded explicitly where needed.

In 1966, Erdős [4] considered the following problem:

“Does there exist a sub-ring of R\mathbb{R} which is a Borel set and has Hausdorff dimension strictly between 0 and 1?”

This problem is connected to Falconer’s distance problem, Furstenberg set problem, and exceptional set estimate for orthogonal projection. For instance, Falconer [5] used results on the distance problem to show

Theorem 0.1. Let R⊂RR \subset\mathbb{R} be a Borel subring and dim⁡HR>12\dim_H R > \frac{1}{2}, then we must have dim⁡HR=1\dim_H R = 1.

Proof. Notice that

Δ(R×R)=(R−R)2+(R−R)2⊂R∩[0,∞),\Delta(R \times R)=\sqrt{(R-R)^2+(R-R)^2}\subset\sqrt{R\cap[0,\infty)},

since RR is a subring. The map t↦tt\mapsto\sqrt{t} is Lipschitz on each interval [1/n,n][1/n,n], so countable stability of Hausdorff dimension gives dim⁡HR∩[0,∞)≤dim⁡HR\dim_H\sqrt{R\cap[0,\infty)}\leq\dim_H R. By Falconer’s result, we get

dim⁡HR≥dim⁡HR∩[0,∞)≥dim⁡HΔ(R×R)≥min⁡{1,dim⁡H(R×R)−12}≥min⁡{1,2dim⁡HR−12}.\begin{aligned} \dim_H R&\geq\dim_H\sqrt{R\cap[0,\infty)}\geq\dim_H\Delta(R\times R)\\ &\geq\min\{1,\dim_H(R\times R)-\tfrac{1}{2}\}\\ &\geq\min\{1,2\dim_H R-\tfrac{1}{2}\}. \end{aligned}

Writing s=dim⁡HRs=\dim_H R, if 12<s<1\frac{1}{2}<s<1, then min⁡{1,2s−12}>s\min\{1,2s-\frac{1}{2}\}>s, a contradiction. Therefore s=1s=1. □\square

Remark. If R⊂RR\subset\mathbb{R} is a Borel subring with dim⁡HR=12\dim_H R=\frac{1}{2}, then

dim⁡H(R×R)≥1&dim⁡HΔ(R×R)≤dim⁡HR=12.\dim_H(R\times R)\geq1\quad\&\quad\dim_H\Delta(R\times R)\leq\dim_H R=\frac{1}{2}.

Therefore, if one want to improve Falconer’s bound dim⁡HΔ(E)≥12\dim_H\Delta(E)\geq\frac{1}{2}, one have to show such 12\frac{1}{2}-dim Borel subring doesn’t exist.

In 2003, Bourgain [1] answer this question negatively.

Theorem 0.2. A Borel subring of R\mathbb{R} cannot have Hausdorff dimension strictly intermediate between 0 and 1.

In fact, Bourgain proved a more quantitative version, as considered by Katz and Tao [3], refer to as the discretized ring conjecture:

Theorem 0.3. If AA is a (δ,σ)1(\delta,\sigma)_1-set, 0<σ<10<\sigma<1 such that ∣A∣>δ1−σ+ϵ|A|>\delta^{1-\sigma+\epsilon}, then

∣A+A∣+∣A⋅A∣>δ1−σ−c(≈δ−c∣A∣)(1)|A+A|+|A\cdot A|>\delta^{1-\sigma-c}\quad(\approx\delta^{-c}|A|) \tag*{(1)}

for an absolute constant c=c(σ)>0c=c(\sigma)>0.

Here, a bounded subset A⊂RA\subset\mathbb{R} is called a (δ,σ)1(\delta,\sigma)_1-set, provided AA is a union of δ\delta-intervals and satisfies

∣A∩I∣<δ−ϵ⋅δ⋅(rδ)σ|A\cap I|<\delta^{-\epsilon}\cdot\delta\cdot\left(\frac{r}{\delta}\right)^\sigma

whenever I⊂RI\subset\mathbb{R} is an arbitrary interval of size $\delta\leq r\leq1.

Remark. Theorem 0.3 is also a version of discrete sum-product theorem. Let’s briefly recall the sum-product phenomenon in Additive Combinatorics.

Suppose A⊂RA \subset\mathbb{R} is a finite set. The typical example of AA with additive structure: ∣A+A∣∼∣A∣|A+A| \sim|A| is a generalised arithmetic progression (GAP)—and Freiman’s theorem says that the typical example is roughly the only example. Then, what is the typical example of AA with multiplicative structure: ∣A⋅A∣∼∣A∣|A \cdot A| \sim|A|? By analogy, this would be the geometric progression or some dd-dimensional variant of it.

Intuitively, arithmetic and geometric progressions “look quite different”, so any set cannot "simultaneously look like both".

Since a set AA with ∣A+A∣∼∣A∣|A+A| \sim|A| implies “AA looks like an arithmetic progression” by Freiman’s theorem, this heuristic suggests that, ∣A⋅A∣≫∣A∣|A \cdot A| \gg|A|. Erdős and Szemerédi [6] took this heuristic very seriously and conjectured the following in 1983:

Conjecture (Sum-product conjecture). For any ε>0\varepsilon> 0, there is a constant cε>0c_{\varepsilon} > 0 such that

max⁡{∣A+A∣,∣A⋅A∣}≥cε∣A∣2−ε.\max\{|A+A|,|A \cdot A|\} \ge c_{\varepsilon}|A|^{2-\varepsilon}.

Theorem (Erdős & Szemerédi). There are constants δ>0\delta> 0 and c>0c > 0 such that

max⁡{∣A+A∣,∣A⋅A∣}≥c∣A∣1+δ.\max\{|A+A|,|A \cdot A|\} \ge c|A|^{1+\delta}.

The case σ=12\sigma= \frac{1}{2} has been given special attention in Katz & Tao [3], as a corollary, we obtain progress on the Falconer’s distance problem and the Furstenberg conjecture.

Corollary 0.4. If K⊂R2K \subset\mathbb{R}^{2} is a compact set, dim⁡HK≥1\dim_{H} K \ge1, then

dim⁡HΔ(K)>12+c0\dim_{H} \Delta(K) > \frac{1}{2}+c_{0}

for an absolute constant c0>0c_{0} > 0.

Corollary 0.5. If K⊂R2K \subset\mathbb{R}^{2} is a 12\frac{1}{2}-Furstenberg set (in every direction there is a line ℓ\ell such that dim⁡H(K∩ℓ)≥12\dim_{H}(K \cap\ell) \ge\frac{1}{2}), then there exists an absolute constant c>0c > 0 such that dim⁡HK>1+c\dim_{H} K > 1+c.

Actually, in 2010, Bourgain [2] proved Theorem 0.3 again under weaker non-concentration condition.

Notation. We use ∣⋅∣|\cdot| to denote both Lebesgue measure and cardinality, the meaning will be clear from context.

Theorem 0.6. Given 0<σ<10 < \sigma< 1 and κ>0\kappa> 0, there exist ε0>0\varepsilon_{0} > 0 and ε1>0\varepsilon_{1} > 0 such that if δ>0\delta> 0 is sufficiently small and A⊂[1,2]A \subset[1,2] is a discrete set consisting of δ\delta-separated points, satisfying ∣A∣=δ−σ|A| = \delta^{-\sigma} and

∣A∩I∣≤ρκ⋅∣A∣(2)|A \cap I| \le\rho^{\kappa} \cdot|A| \tag*{(2)}

whenever II is a ρ\rho-interval with δ<ρ<δε0\delta< \rho< \delta^{\varepsilon_{0}}, then

N(A+A,δ)+N(A⋅A,δ)>δ−ε1∣A∣.(3)N(A+A,\delta)+N(A \cdot A,\delta) > \delta^{-\varepsilon_{1}}|A|. \tag*{(3)}

Remark. (1) Note that if AA is a finite δ\delta-separated set, then A~:=A+B(0,δ)\widetilde{A}:=A+B(0,\delta) satisfying

#A=N(A,δ)=N(A~,δ)&∣A~∣=δ⋅(#A).\#A=N(A,\delta)=N(\widetilde{A},\delta)\quad\& \quad|\widetilde{A}|=\delta\cdot(\#A).

Therefore, Theorem 0.3 is the case κ=σ\kappa=\sigma of Theorem 0.6. And when κ=σ\kappa=\sigma, the non-concentration assumption (∗)(*) is essentially equivalent to (δ,σ)1(\delta,\sigma)_{1}-set: for ρ≥δε0\rho\ge\delta^{\varepsilon_{0}}, taking ρ0=δε0\rho_{0}=\delta^{\varepsilon_{0}}, we have trivially

∣A∩I∣=∑Iρ0⊂I∣A∩Iρ0∣≤ρ0σ∣A∣⋅N(A∩I,ρ0)≤ρ0σ⋅δ−σ⋅ρρ0=(ρρ0)1−σ(ρδ)σ≤δ−ε0(1−σ)(ρδ)σ.\begin{aligned} |A \cap I|=\sum_{I_{\rho_{0}}\subset I}|A\cap I_{\rho_{0}}|\le\rho_{0}^{\sigma}|A|\cdot N(A\cap I,\rho_{0}) \\ &\le\rho_{0}^{\sigma}\cdot\delta^{-\sigma}\cdot\frac{\rho}{\rho_{0}}=\left(\frac{\rho}{\rho_{0}}\right)^{1-\sigma}\left(\frac{\rho}{\delta}\right)^{\sigma}\le\delta^{-\varepsilon_{0}(1-\sigma)}\left(\frac{\rho}{\delta}\right)^{\sigma}. \end{aligned}

(2) Hence, (∗)(*) play a role when κ≪σ\kappa\ll\sigma. In fact, (∗)(*) can be viewed as some “two-ends” condition introduced by Wolff [14].

  • For intervals of size 1, there is no requirement.

  • For intervals of size δ\delta, or even (δ∣A∣)1/(1−κ)=δ(1−σ)/(1−κ)(\delta|A|)^{1/(1-\kappa)}=\delta^{(1-\sigma)/(1-\kappa)}, the requirement is trivial:

References

  1. [1]J. Bourgain, On the Erdős–Volkmann and Katz–Tao ring conjectures, Geom. Funct. Anal. 13 (2003), 334–365. doi:10.1007/s000390300008.DOI
  2. [2]J. Bourgain, The discretized sum-product and projection theorems, J. Anal. Math. 112 (2010), 193–236. doi:10.1007/s11854-010-0028-x.DOI
  3. [3]N. H. Katz and T. Tao, Some connections between Falconer’s distance set conjecture and sets of Furstenburg type, New York J. Math. 7 (2001), 149–187. https://nyjm.albany.edu/nyjm/j/2001/7-10.html.DOI
  4. [4]P. Erdős and B. Volkmann, Additive Gruppen mit vorgegebener Hausdorffscher Dimension, J. Reine Angew. Math. 221 (1966), 203–208. doi:10.1515/crll.1966.221.203.DOI
  5. [5]K. J. Falconer, On the Hausdorff dimensions of distance sets, Mathematika 32 (1985), no. 2, 206–212. doi:10.1112/S0025579300010998.DOI
  6. [6]P. Erdős and E. Szemerédi, On sums and products of integers, in Studies in Pure Mathematics: To the Memory of Paul Turán, Birkhäuser, Basel, 1983, 213–218. doi:10.1007/978-3-0348-5438-2_19.DOI
  7. [14]T. H. Wolff, An improved bound for Kakeya type maximal functions, Rev. Mat. Iberoam. 11 (1995), no. 3, 651–674. doi:10.4171/RMI/188.DOI
  8. [16]J. Bourgain, A. A. Glibichuk and S. V. Konyagin, Estimates for the number of sums and products and for exponential sums in fields of prime order, J. London Math. Soc. (2) 73 (2006), no. 2, 380–398. doi:10.1112/S0024610706022721.DOI
  9. [18]T. Orponen, N. de Saxcé and P. Shmerkin, On the Fourier decay of multiplicative convolutions, arXiv:2309.03068, 2023, revised 2024. https://arxiv.org/abs/2309.03068.
  10. [19]P. Cholak, M. Csörnyei, N. Lutz, P. Lutz, E. Mayordomo and D. M. Stull, Bounding the dimension of exceptional sets for orthogonal projections, arXiv:2411.04959, 2024, revised 2025. https://arxiv.org/abs/2411.04959.

Paper details

vlnc:W_ur97gxy2
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents