Sum-product phenomena for Ahlfors-regular sets

William O'Regan

REVIEW 3 major objections 5 minor 15 references

Sum-product phenomena for Ahlfors-regular sets

T0 review · 3 major / 5 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Ahlfors-regular sets of dimension at most 1/2 satisfy a sharp sum-product bound: at every small scale, the sum set and product set cannot both be small.

desk verdict A genuinely new fractal sum-product bound (Solymosi-type 4/3) derived from Orponen's projection theorem, with a clean entropy argument; the sharpness section and a parameter typo need fixing before publication. read the letter →

arxiv 2501.02131 v3 pith:66EUA4RJ submitted 2025-01-03 math.CA math.COmath.MG

William O'Regan This is my paper · ORCID

classification math.CAmath.COmath.MG MSC 05B9928A7828A80

keywords sum-productphenomenonAhlfors-regularsetsdiscretisedShannonentropyfractaldimensionSolymosiboundradialprojectionsbox-countingnumbers

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper proves a sum-product theorem for Ahlfors-regular (fractal) sets of dimension at most $1/2$. If $A\subset[1,2]$ is an $(s,C)$-regular set with $00$ and all sufficiently small $\delta$ the number of length-$\delta$ intervals needed to cover the sum set and the product set satisfies $N_\delta(A+A)+N_\delta(AA)\ge \delta^{-4s/3+\eta}$. Equivalently, for i.i.d. random variables $X,Y$ drawn from an $(s,C)$-regular measure, $H_\delta(X+Y)+2H_\delta(XY)\ge (4s-\eta)\log(1/\delta)-O_C(1)$. This is the fractal analogue of Solymosi's $4/3$ bound for finite sets of reals, and the paper shows the entropy exponent $4s$ cannot be increased. If correct, it says that regular fractal sets of dimension at most $1/2$ cannot resemble rings at any small scale.

What carries the argument

The mechanism is a two-step entropy argument. A discretised submodularity inequality (Lemma 2.7) is applied to three i.i.d. variables $X,Y,Z$ to obtain $H_\delta((X+Y)Z)+2H_\delta(X)\le H_\delta(X+Y)+2H_\delta(XY)+O(1)$. The lower bound on $H_\delta((X+Y)Z)$ comes from a projection-multiplicity theorem quoted as Theorem 3.2 (from [Orp24]), which bounds the measure of points whose orthogonal projection fibre has multiplicity at least $\delta^{-\sigma}$; a projective transformation converts this into a radial-projection estimate (Lemma 3.4), and Proposition 3.6 turns that into the entropic lower bound $H_\delta((Y-Z)/X\mid Z)\ge (1-\epsilon)(2s-2\sigma)\log(1/\delta)$. Combining the lower and upper bounds yields Theorem 1.2.

What would settle it

Find an $(s,C)$-regular set $A\subset[1,2]$ with $0<s\le 1/2$ for which, along arbitrarily small $\delta$, $N_\delta(A+A)+N_\delta(AA)\le \delta^{-4s/3-\eta'}$ for some $\eta'>0$, or produce a counterexample to the projection-multiplicity theorem (Theorem 3.2) at the parameters the proof needs. A numerical search on self-similar Cantor-type sets of dimension near $1/2$ in $[1,2]$ would be a practical way to look for such a violation.

Watch

Extended reading notes

Core claim

The paper's central claim is that Ahlfors-regularity forces a quantitative sum-product tradeoff at every scale. Theorem 1.2 states that for an $(s,C)$-regular probability measure $\mu$ supported in $[1,2]$, with $0<s\le 1/2$ and $X,Y$ i.i.d. with law $\mu$, the entropy inequality $H_\delta(X+Y)+2H_\delta(XY)\ge (4s-\eta)\log(1/\delta)-O_C(1)$ holds for arbitrarily small $\eta>0$ and all $\delta<\delta_0(C,s,\eta)$. The immediate covering-number corollary (Theorem 1.3) is $N_\delta(A+A)+N_\delta(AA)\ge \delta^{-4s/3+\eta}$ for every $(s,C)$-regular set $A\subset[1,2]$, and the same statements hold with subtraction or division replacing addition or multiplication. A self-similar construction in Section 4 shows the coefficient $4s$ in the entropy inequality is best possible. The author notes that the proof only uses the projection-multiplicity theorem for dimensions at most $1$, so an extension of that input would give the result for all $0<s<1$.

Load-bearing premise

The load-bearing premise is an external theorem (Theorem 3.2, quoted from [Orp24]) saying that, for regular fractal measures, the set of points whose projecting lines meet the fractal in unusually many places has very small measure; if that estimate is wrong at the parameters used here, the entropy bound and the $4/3$ covering-number bound collapse.

Editorial extensions

If this is right

For every $(s,C)$-regular $A\subset[1,2]$ with $0<s\le 1/2$ and every $\eta>0$, at all sufficiently small $\delta$ either $N_\delta(A+A)$ or $N_\delta(AA)$ exceeds $(1/2)\delta^{-4s/3+\eta}$, so sums and products cannot both be compressed.
The stronger product inequality $N_\delta(A+A)N_\delta(AA)^2\ge \delta^{-4s+\eta}$ also follows, and is sharp in the exponent.
Replacing addition by subtraction or multiplication by division gives the same bounds, so the result is insensitive to the signs in the two operations.
If the projection-multiplicity input is extended to dimensions above $1$, the same proof yields the fractal sum-product bound for the full range $0<s<1$, as Remark 1.6 observes.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

Because the entropy inequality is proved from submodularity and a projection-multiplicity estimate, a Frostman (rather than Ahlfors-regular) version of that estimate would immediately give the same sum-product bound for the broader class of Frostman measures, which the paper does not address.
The coefficient $2$ on $H_\delta(XY)$ suggests an underlying multiplicative-energy control similar to the discrete proof via sumsets; this hints that a collision-entropy or $L^2$-based version of the $4/3$ bound might hold directly for regular sets, without passing through Shannon entropy.
A concrete check on digit-restricted Cantor sets in $[1,2]$ with dimension just below $1/2$ could test whether $N_\delta(A+A)+N_\delta(AA)$ actually approaches $\delta^{-4s/3}$, providing numerical evidence for the sharpness of Theorem 1.3's exponent.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

The main result is real and worth engaging with. Theorem 1.2 gives an entropy lower bound Hδ(X+Y)+2Hδ(XY) ≥ (4s−η) log(1/δ) for (s,C)-regular measures on [1,2], and the covering-number corollary is the promised fractal analogue of Solymosi's 4/3 bound. The proof is a fresh combination: Orponen's high-multiplicity projection theorem, a radial-projection conversion, and the discretized submodularity lemma from Máthé–O'Regan. I checked the chain Proposition 3.6 → Corollary 3.7 → Theorem 1.2 and it is structurally sound. This is a subfield-level advance, not a revolution, and it is honest about resting on Orponen's recent deep theorem.

The paper as written has three soft spots, in increasing order of seriousness. First, in Section 3.2 the parameter choice says (1−ε)(s−σ) ≥ 2s−η, which is impossible for small ε,σ. The intended inequality is clearly 2(1−ε)(s−σ) ≥ 2s−η, and with that the proof goes through. That is a typo, but it should be fixed.

Second, Section 4 is more serious. The construction claims Nδ(A+A) < δ^{−s+η}, but A⊂A+A forces Nδ(A+A) ≥ Nδ(A) ≈ δ^{−s}, and δ^{−s+η} is smaller than δ^{−s} for small δ. So the displayed inequality cannot hold. Also, the doubling map sends [0,1] to [0,2], not to [1,2], as claimed. The sharpness section should be corrected or simply removed; the main theorem does not depend on it.

Third, and most importantly, the load-bearing external input is Orponen's Theorem 3.2, from an unreviewed arXiv preprint. The paper never verifies that the word 'regular' in Orponen's theorem means the same as Definition 1.1. If Orponen requires two-sided Ahlfors regularity, then the merely upper-regular Frostman measures used here may not satisfy his hypotheses, and Proposition 3.6 would not follow. The quoted δ0 also appears independent of s, which is likely a typo if Orponen's constant depends on s. The author needs to check this and add a sentence confirming the hypothesis match.

My overall read: the central lower bound is credible and the method is attractive. The paper deserves a serious referee, but not acceptance in its current form. The right recommendation is to send it to peer review with a request for revision: fix the parameter typo, fix or cut the sharpness section, and resolve the Orponen hypothesis question. Analysts in fractal additive combinatorics will want this result, and the proof is short enough that an expert can verify the main line in an afternoon.

Referee Report

3 major / 5 minor

Summary. The paper proves a discretised sum-product estimate for (upper) regular subsets of the real line. Theorem 1.2 states that for an (s,C)-regular measure μ supported in [1,2] with 0<s≤1/2 and for i.i.d. samples X,Y from μ, the δ-entropy of X+Y plus twice that of XY is at least (4s−η)log(1/δ)−O_C(1). Theorem 1.3 translates this into a covering-number bound Nδ(A+A)+Nδ(AA) ≥ δ^{-4s/3+η}, the fractal analogue of Solymosi's 4/3 bound. The proof combines a theorem of Orponen on high-multiplicity radial projections (Theorem 3.2) with an entropy submodularity inequality (Lemma 2.8) and a conditional-entropy/tube-counting argument (Proposition 3.6). The paper also claims sharpness via a self-similar construction.

Significance. If the external theorem of Orponen is valid in the needed form, the main inequality is a genuine improvement for regular sets, achieving the expected exponent 4s/3 in the discretised sum-product problem for s≤1/2. The entropy-submodularity framework is elegant and may be of independent interest; in particular, Lemma 2.7 and Lemma 2.8 are clearly and correctly presented. The paper is concise and does not rely on any fitted parameters. However, the argument depends critically on the precise regularity hypotheses in Orponen's theorem, and the sharpness section currently contains errors; both need attention before the claims are established.

major comments (3)

[§3.2, proof of Theorem 1.2] The parameter condition '(1−ε)(s−σ) ≥ 2s−η' is impossible for any positive ε, σ when η<s, because the left-hand side is at most s < 2s−η. The inequality needed for the subsequent display is (1−ε)(s−σ) ≥ s−η/2 (equivalently 2(1−ε)(s−σ) ≥ 2s−η). As written, the proof of Theorem 1.2 fails at this step; this is a load-bearing point, though it appears to be a typographical error that is readily fixable.
[§4, Sharpness of Theorem 1.2] The sharpness argument contains several incorrect assertions. First, the map x→2x sends [0,1] to [0,2], not into [1,2]. Second, the claimed bound Nδ(A+A) < δ^{-s+η} contradicts the trivial inclusion A+A ⊇ A, since Nδ(A) ≈ δ^{-s} and δ^{-s+η} < δ^{-s} for η>0 and small δ. Third, even if the stated bounds Nδ(A+A) < δ^{-s+η} and Nδ(A1A1) < δ^{-s+η/2} were accepted, they would give log(Nδ(A1+A1)) + 2 log(Nδ(A1A1)) ≤ (3s+O(η)) log(1/δ), not the displayed (4s+η) log(1/δ). Thus the section is internally inconsistent and, as written, would contradict Theorem 1.2 for the very measure being constructed.
[§3.1, Lemma 3.4 and Theorem 3.2] The manuscript's Definition 1.1 of '(s,C)-regular measure' requires only an upper Frostman bound for the measure and upper regularity of its support. Orponen's Theorem 3.2, quoted from [Orp24], is invoked for the product measure μ×ν and its projective image P(μ×ν), but the paper does not verify that these measures satisfy the hypotheses of Orponen's theorem. If Orponen's regularity notion is the standard two-sided Ahlfors-regularity, then the product of merely Frostman measures need not be regular, and the proof of Proposition 3.6, which uses only upper bounds, cannot be justified by Theorem 3.2. This is a load-bearing gap: the authors should either prove that Theorem 3.2 holds under their weaker notion of regularity or restate the main theorems for Ahlfors-regular measures in the standard sense.

minor comments (5)

[§3.1, Theorem 3.2] The statement gives δ0 = δ0(C, ε, σ) independent of s; unless this independence is actually proved, δ0 should be allowed to depend on s as well.
[§3.1, Lemma 3.4] Lemma 3.4 is stated for a general line l, but the proof is only supplied for l = {0}×R and refers to [OSW24, Remark 4.13] for the general case. Since only the special case is used later, the lemma statement should be restricted accordingly or the missing cases supplied.
[§1, Definition 1.1] The title and abstract use 'Ahlfors-regular sets', but Definition 1.1 defines only upper (s,C)-regularity for sets and measures. This terminology mismatch could mislead readers about the strength of the hypotheses.
[§2.2, Lemma 2.6] The proof silently uses that a δ-cube is contained in a ball of radius proportional to δ; the O(1) term in the conclusion should account for the dimension and the implicit geometric constant.
[§4, Sharpness construction] The regularity constant C for the self-similar measure depends on N in the construction, and the theorem's O_C(1) may grow with N; the argument should track this dependence to ensure that the upper bound (4s+η) log(1/δ) is uniform in the parameters that are allowed to scale with η.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: Theorem 1.2 is a genuine derivation from Orponen's external projection theorem and a reproduced entropy submodularity inequality.

full rationale

The central claim is not circular. Theorem 1.2 is obtained by combining two independent inequalities. The lower bound is Corollary 3.7, which follows from Proposition 3.6 and Lemma 3.4, a projective-transformation restatement of Orponen's Theorem 3.2, an external result not due to the author. The upper bound is Lemma 2.8, derived from the discretised submodular inequality Lemma 2.7; although the paper cites the author's prior work [MO23] for this inequality, the proof is fully reproduced in the text, so the citation is not load-bearing. No parameter is fitted to produce the claimed exponent: the quantities ε and σ are auxiliary smallness parameters chosen only to absorb the η loss, and the bound is not equivalent to the definition of (s,C)-regularity by construction. A possible discrepancy between the paper's one-sided upper-regular Definition 1.1 and the version of Ahlfors regularity in Orponen's quoted theorem, or the fact that [Orp24] is an unrefereed preprint, would be an external correctness risk, not a circularity. The sharpness construction in Section 4 is independent of the proof and does not enter the derivation.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

The paper introduces no free parameters or new entities; it derives a quantitative inequality from external theorems, chiefly Orponen's projection estimate.

assumptions (3)

domain assumption Orponen's Theorem 3.2: for (s,C)-regular µ on [-10,10]^2 and (ε,C)-Frostman ν on S^1, the ν-average of the µ-measure of points with projection multiplicity ≥ δ^{-σ} is ≤ ε for δ small.
The main lower bound (Corollary 3.7) is derived from this external result, cited as unrefered preprint [Orp24]. If incorrect, the main theorem fails.
standard math Product regularity: µ×ν is (2s,C^2)-upper regular, used to bound the number of tubes and ball masses in Proposition 3.6.
Standard product of Ahlfors regular measures; used implicitly in Proposition 3.6.
domain assumption Bi-Lipschitz behaviour of the projective transform P in Lemma 3.4, with constant K=1000.
Needed to transfer Orponen's orthogonal projection theorem to radial projections; only proven for l={0}×R, the case used in the application.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Sum-product phenomena for Ahlfors-regular sets." pith.science (2026). https://pith.science/paper/66EUA4RJ

@misc{pith2026250102131,
  author       = {Pith},
  title        = {Pith review of: Sum-product phenomena for Ahlfors-regular sets},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/66EUA4RJ}},
  note         = {Machine review of arXiv:2501.02131}
}

abstract

We utilise the recent work of Orponen to yield a sum-product result for Ahlfors-regular sets. As a corollary, we obtain the fractal analogue of Solymosi's $4/3$-bound for finite subsets of $\mathbb{R}.$

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

15 extracted references · 10 canonical work pages

[1]

On the spectral gap for finitely-generated subgroups of SU(2)

Jean Bourgain and Alex Gamburd. On the spectral gap for finitely-generated subgroups of SU(2) . Invent. Math. , 171(1):83--121, 2008

work page 2008
[2]

Bourgain

J. Bourgain. On the E rd\"os- V olkmann and K atz- T ao ring conjectures. Geom. Funct. Anal. , 13(2):334--365, 2003

2003
[3]

The discretized sum-product and projection theorems

Jean Bourgain. The discretized sum-product and projection theorems. J. Anal. Math. , 112:193--236, 2010

2010
[4]

Borel subrings of the reals

G Edgar and Chris Miller. Borel subrings of the reals. Proceedings of the American Mathematical Society , 131(4):1121--1129, 2003

work page 2003
[5]

Erd o s and E

P. Erd o s and E. Szemer\' e di. On sums and products of integers. In Studies in pure mathematics , pages 213--218. Birkh\" a user, Basel, 1983

work page 1983
[6]

Additive G ruppen mit vorgegebener H ausdorffscher D imension

Paul Erd o s and Bodo Volkmann. Additive G ruppen mit vorgegebener H ausdorffscher D imension. J. Reine Angew. Math. , 221:203--208, 1966

1966
[7]

Fractal geometry

Kenneth Falconer. Fractal geometry . John Wiley & Sons, Ltd., Chichester, third edition, 2014. Mathematical foundations and applications

work page 2014
[8]

Incidence estimates for -dimensional tubes and -dimensional balls in R^2

Yuqiu Fu and Kevin Ren. Incidence estimates for -dimensional tubes and -dimensional balls in R^2 . J. Fractal Geom. , 11(1-2):1--30, 2024

work page 2024

Show all 15 references

[9]

On the discretized sum-product problem

Larry Guth, Nets Hawk Katz, and Joshua Zahl. On the discretized sum-product problem. Int. Math. Res. Not. IMRN , (13):9769--9785, 2021

2021
[10]

Some connections between F alconer's distance set conjecture and sets of F urstenburg type

Nets Hawk Katz and Terence Tao. Some connections between F alconer's distance set conjecture and sets of F urstenburg type. The New York Journal of Mathematics [electronic only] , 7:149--187, 2001

2001
[11]

Ahlfors- D avid regular sets and bilipschitz maps

Pertti Mattila and Pirjo Saaranen. Ahlfors- D avid regular sets and bilipschitz maps. Ann. Acad. Sci. Fenn. Math. , 34(2):487--502, 2009

2009
[12]

On the projections of A hlfors regular sets in the plane

Tuomas Orponen. On the projections of A hlfors regular sets in the plane. arXiv preprint arXiv:2410.06872c2 , 2024

2024 arXiv
[13]

Kaufman and F alconer estimates for radial projections and a continuum version of B eck's theorem

Tuomas Orponen, Pablo Shmerkin, and Hong Wang. Kaufman and F alconer estimates for radial projections and a continuum version of B eck's theorem. Geom. Funct. Anal. , 34(1):164--201, 2024

2024
[14]

An update on the sum-product problem

Misha Rudnev and Sophie Stevens. An update on the sum-product problem. In Mathematical Proceedings of the Cambridge Philosophical Society , volume 173, pages 411--430. Cambridge University Press, 2022

2022
[15]

Furstenberg sets estimate in the plane

Kevin Ren and Hong Wang. Furstenberg sets estimate in the plane. arXiv preprint arXiv:2308.08819 , 2023

2023 arXiv

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.

[1] [1]

On the spectral gap for finitely-generated subgroups of SU(2)

Jean Bourgain and Alex Gamburd. On the spectral gap for finitely-generated subgroups of SU(2) . Invent. Math. , 171(1):83--121, 2008

work page 2008

[2] [2]

Bourgain

J. Bourgain. On the E rd\"os- V olkmann and K atz- T ao ring conjectures. Geom. Funct. Anal. , 13(2):334--365, 2003

2003

[3] [3]

The discretized sum-product and projection theorems

Jean Bourgain. The discretized sum-product and projection theorems. J. Anal. Math. , 112:193--236, 2010

2010

[4] [4]

Borel subrings of the reals

G Edgar and Chris Miller. Borel subrings of the reals. Proceedings of the American Mathematical Society , 131(4):1121--1129, 2003

work page 2003

[5] [5]

Erd o s and E

P. Erd o s and E. Szemer\' e di. On sums and products of integers. In Studies in pure mathematics , pages 213--218. Birkh\" a user, Basel, 1983

work page 1983

[6] [6]

Additive G ruppen mit vorgegebener H ausdorffscher D imension

Paul Erd o s and Bodo Volkmann. Additive G ruppen mit vorgegebener H ausdorffscher D imension. J. Reine Angew. Math. , 221:203--208, 1966

1966

[7] [7]

Fractal geometry

Kenneth Falconer. Fractal geometry . John Wiley & Sons, Ltd., Chichester, third edition, 2014. Mathematical foundations and applications

work page 2014

[8] [8]

Incidence estimates for -dimensional tubes and -dimensional balls in R^2

Yuqiu Fu and Kevin Ren. Incidence estimates for -dimensional tubes and -dimensional balls in R^2 . J. Fractal Geom. , 11(1-2):1--30, 2024

work page 2024