pith. machine review for the scientific record. sign in

arxiv: 2604.21949 · v1 · submitted 2026-04-22 · 🧮 math.CA · math.CO

Recognition: unknown

A note on the sum-product problem for fractal sets

Adam Cushman, William O'Regan

Pith reviewed 2026-05-09 22:16 UTC · model grok-4.3

classification 🧮 math.CA math.CO
keywords sum-product problemfractal setsHausdorff dimensionbox dimensionincidence geometryreal analysis
0
0 comments X

The pith

For any real set of Hausdorff dimension s at most 1/2, either the product set or the sum set has box dimension at least 29s/23.

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

The paper proves a sum-product type theorem that applies to arbitrary subsets of the reals having small Hausdorff dimension. When a set A has dimension s with s no larger than one half, at least one of the product set AA or the sum set A+A is forced to have noticeably larger box dimension, at least 29s/23. The argument combines recent incidence bounds on balls and tubes with known discrete sum-product results and transfers them to the continuous setting. Replacing the sum set by the difference set improves the constant slightly to 33s/26. The result shows that additive and multiplicative structures cannot both remain small for low-dimensional fractals.

Core claim

For 0 < s ≤ 1/2 and any A ⊂ ℝ with Hausdorff dimension s, either the upper-box dimension of AA or the lower-box dimension of A+A must be at least 29s/23. The bound improves to 33s/26 when the difference set replaces the sum set.

What carries the argument

Incidence geometry estimates for balls and tubes together with discrete sum-product theorems, transferred to control the dimensions of the continuous sum and product sets.

If this is right

  • Low-dimensional sets cannot keep both additive and multiplicative structure small at the same time.
  • The same incidence-plus-discrete method yields a modest improvement when differences replace sums.
  • The constant 29/23 is an explicit quantitative improvement over earlier fractal sum-product bounds.
  • Further progress on tube incidences would immediately raise the exponent in the same argument.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The approach may adapt to other pairs of operations or to sets in higher-dimensional Euclidean space.
  • Self-similar sets such as the middle-third Cantor set could be checked numerically to see how close the bound comes to being sharp.
  • The result suggests that sum-product phenomena remain robust when passing from finite sets to their fractal limits.

Load-bearing premise

Recent incidence geometry results for balls and tubes can be applied directly to fractal sum and product sets without introducing additional dimension loss.

What would settle it

Exhibit a concrete set A with Hausdorff dimension s ≤ 1/2 such that the upper box dimension of AA is less than 29s/23 and the lower box dimension of A+A is also less than 29s/23.

read the original abstract

Utilising recent advances in incidence geometry for balls and tubes, and advances in sum-product theory in the discrete setting, we show that for $0 < s \leq 1/2$ and for any $A \subset \mathbb{R}$ with Hausdorff dimension $s$, either the upper-box dimension of $AA$, or the lower-box dimension of $A+A$ must be at least $29s/23$. We obtain the slightly better bound of $33 s / 26$ when we replace the sum-set with the smoother difference-set.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript proves a quantitative sum-product result for arbitrary subsets A of the real line with Hausdorff dimension s in (0,1/2]. For any such A, either the upper box dimension of the product set AA or the lower box dimension of the sum set A+A is at least 29s/23. A variant replaces A+A by the difference set A-A and improves the constant to 33s/26. The argument proceeds by discretizing A at scale δ, applying recent incidence-geometry bounds for balls and tubes together with discrete sum-product theorems, and passing to the limit as δ→0.

Significance. If the discretization step incurs no hidden exponent loss, the result supplies an explicit, nontrivial lower bound on the dimension of either the sum or product set for purely Hausdorff-dimensional sets, thereby extending discrete sum-product technology to the fractal setting. The constants 29/23 and 33/26 are derived directly from cited incidence and discrete bounds, making the claim falsifiable and potentially improvable with future advances in those areas. The paper correctly identifies the relevant external theorems and assembles them into a continuous statement.

major comments (2)
  1. [§2] §2 (discretization step preceding the application of the discrete sum-product theorem): the passage from an arbitrary s-dimensional Hausdorff set to its δ-net invokes covering numbers N(δ) ≲ δ^{-s} but does not explicitly control the possible discrepancy between the s-Hausdorff measure and the uniform counting measure on the net. Because the incidence bounds for tubes are applied to this net, any nonuniform mass distribution could produce an additional o(1) loss in the exponent that is not absorbed into the final 29s/23 (or 33s/26) constant; the argument therefore requires a quantitative error estimate to confirm that the claimed bound is attained without degradation.
  2. [§3] §3 (tube-incidence application for the difference-set variant): the lower-box-dimension conclusion for A-A relies on the same discretization; the same potential loss of exponent must be ruled out, or the constant 33/26 must be adjusted accordingly.
minor comments (2)
  1. [Abstract and §1] Notation for box dimensions is introduced inconsistently between the abstract and the body; adopting a uniform convention (e.g., dim_B^+ and dim_B^-) throughout would improve readability.
  2. [§2] The dependence of the implicit constants on the cited incidence theorems (e.g., the precise tube constants) is not tabulated; a short remark listing the numerical values used to obtain 29/23 would make the derivation fully transparent.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on our manuscript. We address the major comments point by point below. We have revised the paper to include additional clarifications on the discretization and limiting arguments.

read point-by-point responses

  1. Referee: [§2] §2 (discretization step preceding the application of the discrete sum-product theorem): the passage from an arbitrary s-dimensional Hausdorff set to its δ-net invokes covering numbers N(δ) ≲ δ^{-s} but does not explicitly control the possible discrepancy between the s-Hausdorff measure and the uniform counting measure on the net. Because the incidence bounds for tubes are applied to this net, any nonuniform mass distribution could produce an additional o(1) loss in the exponent that is not absorbed into the final 29s/23 (or 33s/26) constant; the argument therefore requires a quantitative error estimate to confirm that the claimed bound is attained without degradation.

    Authors: We appreciate the referee highlighting this aspect of the discretization. We select a maximal δ-net A_δ of A satisfying |A_δ| ≲ δ^{-s}. The cited incidence bounds for points and tubes (or balls) apply to arbitrary finite configurations and do not require uniform distribution of mass. When deriving the dimension lower bounds, we pass to the limit δ → 0. Any δ-dependent o(1) discrepancy in the discrete exponents vanishes in the definitions of upper/lower box dimension (via limsup and liminf of log N(r)/−log r as r → 0). Consequently the constants 29/23 and 33/26 are attained without degradation. We have added a clarifying paragraph in §2 that spells out this limiting procedure and confirms the error terms are harmless. revision: yes

  2. Referee: [§3] §3 (tube-incidence application for the difference-set variant): the lower-box-dimension conclusion for A-A relies on the same discretization; the same potential loss of exponent must be ruled out, or the constant 33/26 must be adjusted accordingly.

    Authors: The same discretization and limiting argument used for A+A applies directly to the difference set A−A in §3. The incidence bounds remain valid for arbitrary nets, and the o(1) terms again disappear in the limit, preserving the improved constant 33/26. We have inserted a cross-reference in §3 to the new explanatory paragraph in §2, making the error control uniform across both statements. revision: yes

Circularity Check

0 steps flagged

No circularity: direct invocation of external incidence and discrete sum-product theorems

full rationale

The paper's central result is obtained by discretizing an arbitrary Hausdorff-s set at scale δ and applying known external theorems on incidences for balls/tubes and discrete sum-product estimates. No quantity is defined in terms of the target dimension bound, no parameter is fitted to a subset and re-predicted, and no load-bearing step reduces to a self-citation or ansatz from the authors' prior work. The derivation chain therefore remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The proof rests on standard properties of Hausdorff and box dimensions together with two external black-box results (incidence geometry for balls/tubes and discrete sum-product estimates). No free parameters are introduced and no new entities are postulated.

axioms (2)
  • standard math Standard properties of Hausdorff dimension, upper and lower box dimension, and their relations under sums and products
    Invoked throughout the dimension calculations in the abstract statement.
  • domain assumption Recent incidence-geometry bounds for balls and tubes hold in the plane
    Cited as the key external input that controls the continuous incidences arising from the sum and product sets.

pith-pipeline@v0.9.0 · 5377 in / 1376 out tokens · 31002 ms · 2026-05-09T22:16:23.911293+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

15 extracted references · 5 canonical work pages

  1. [1]

    Thomas F. Bloom. Control and its applications in additive combinatorics. arXiv preprint arXiv:2501.09470 , 2025

    work page arXiv 2025

  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]

    A note on the sum-product problem and the convex sumset problem

    Adam Cushman. A note on the sum-product problem and the convex sumset problem. arXiv preprint arXiv:2512.13849 , 2025

    work page arXiv 2025

  4. [4]

    Incidence estimates for quasi-product sets and applications

    Ciprian Demeter and William O'Regan. Incidence estimates for quasi-product sets and applications. https://arxiv.org/abs/2511.15899 , 2025

    work page arXiv 2025

  5. [5]

    Szemer\'edi- T rotter bounds for tubes and applications

    Ciprian Demeter and Hong Wang. Szemer\'edi- T rotter bounds for tubes and applications. Ars Inven. Anal. , pages Paper No. 1, 46, 2025

    2025

  6. [6]

    On the number of sums and products

    Gy \"o rgy Elekes. On the number of sums and products. Acta Arithmetica , 81(4):365--367, 1997

    1997

  7. [7]

    G. A. Edgar and Chris Miller. Borel subrings of the reals. Proc. Amer. Math. Soc. , 131(4):1121--1129, 2003

    2003

  8. [8]

    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

  9. [9]

    K. J. Falconer. On the H ausdorff dimensions of distance sets. Mathematika , 32(2):206--212, 1985

    1985

  10. [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. New York J. Math. , 7:149--187, 2001

    2001

  11. [11]

    Discretised sum-product theorems by S hannon-type inequalities

    Andr\'as M\'ath\'e and William O'Regan. Discretised sum-product theorems by S hannon-type inequalities. J. Lond. Math. Soc. (2) , 112(6):Paper No. e70389, 16, 2025

    2025

  12. [12]

    Projections, Furstenberg sets, and theABCsum-product problem

    Tuomas Orponen and Pablo Shmerkin. Projections, F urstenberg sets, and the abc sum-product problem. arXiv preprint arXiv:2301.10199 , 2023

    work page arXiv 2023

  13. [13]

    An update on the sum-product problem

    Misha Rudnev and Sophie Stevens. An update on the sum-product problem. Math. Proc. Cambridge Philos. Soc. , 173(2):411--430, 2022

    2022

  14. [14]

    Furstenberg sets estimate in the plane

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

    work page arXiv 2023

  15. [15]

    Shkredov

    Tomasz Schoen and Ilya D. Shkredov. On sumsets of convex sets. Combin. Probab. Comput. , 20(5):793--798, 2011

    2011