pith. sign in

arxiv: 2604.12864 · v1 · submitted 2026-04-14 · 🧮 math.NT · math.CO· math.DS

An inverse theorem for sumsets of sets of positive density in the integers

Pith reviewed 2026-05-10 14:02 UTC · model grok-4.3

classification 🧮 math.NT math.COmath.DS
keywords sumsetsnatural densityinverse theoremKneser's inequalityErdős-Graham questionadditive combinatoricsresidue classespositive density
0
0 comments X

The pith

Positive-density sets A and B in the integers satisfy d(A+B) = d(A) + d(B) only under a specific arithmetic structure, except when both lie in a proper finite union of residue classes.

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

The paper characterizes all pairs of positive natural density subsets A and B of the positive integers such that the natural density of their sumset equals the sum of the densities. This characterization applies whenever A and B are not both contained in a proper finite union of residue classes. The result functions as an inverse theorem to Kneser's sumset inequality and supplies a partial solution to a question of Erdős and Graham on the structure of such equality cases. A sympathetic reader would care because it identifies precisely when sumset growth is minimal in the density sense, restricting the possible forms of A and B to those with shared periodic or arithmetic features outside the excluded cases.

Core claim

We characterize all sets A, B with positive density satisfying d(A+B)=d(A)+d(B), under the assumption that the two sets are not both contained in a proper finite union of residue classes. This gives a new inverse theorem for Kneser's sumset inequality in the integers, and provides a partial answer to a long-standing open question of Erdős and Graham.

What carries the argument

The inverse characterization of equality cases in the natural-density version of Kneser's sumset inequality for subsets of the integers.

If this is right

  • Equality d(A+B) = d(A) + d(B) forces A and B to share a common difference or periodic structure outside the excluded residue-class cases.
  • The only exceptions to the main structural description occur when both sets are contained in a proper finite union of residue classes.
  • This supplies the first complete inverse result for Kneser's inequality in the integers under the stated assumption.
  • It narrows the possible forms of minimal-growth sumsets to those with explicit arithmetic constraints.

Where Pith is reading between the lines

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

  • The result may extend to analogous equality conditions for other notions of density or in other additive groups such as the rationals.
  • Explicit computation of small-modulus periodic examples could confirm whether the excluded cases are truly the only outliers.
  • The characterization could be applied to decide whether certain constructed sets achieve minimal sumset density.

Load-bearing premise

The sets A and B are not both contained in a proper finite union of residue classes; if this assumption fails, the characterization may miss additional periodic cases where equality still holds.

What would settle it

A concrete pair of sets A and B with positive natural density, not both contained in any proper finite union of residue classes, such that d(A+B) equals d(A) plus d(B) yet the sets fail to match the arithmetic structure given by the characterization.

read the original abstract

Let $d(\cdot)$ denote the natural density on the positive integers. We characterize all sets $A,B$ with positive density satisfying $d(A+B)=d(A)+d(B)$, under the assumption that the two sets are not both contained in a proper finite union of residue classes. This gives a new inverse theorem for Kneser's sumset inequality in the integers, and provides a partial answer to a long-standing open question of Erd\H{o}s and Graham.

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

0 major / 3 minor

Summary. The paper characterizes all pairs of sets A, B ⊆ ℕ with positive natural density d such that d(A + B) = d(A) + d(B), under the assumption that A and B are not both contained in a proper finite union of residue classes. It proves that such sets must be (translates of) arithmetic progressions with the same common difference, yielding an inverse theorem to Kneser's sumset inequality in the integers and a partial resolution of a question of Erdős and Graham.

Significance. If the argument holds, the result is significant: it supplies the first complete structural characterization of equality cases in Kneser's inequality for positive-density subsets of the integers outside the periodic regime. The proof strategy—reduction to syndetic sets, invocation of a density Kneser theorem, and application of a structure theorem—is standard in additive combinatorics yet executed self-containedly here, with explicit credit due for handling the non-periodic assumption cleanly and avoiding parameter fitting or ad-hoc constructions.

minor comments (3)
  1. [Main theorem statement] §2 (or wherever the main theorem is stated): the conclusion that A and B are arithmetic progressions should explicitly include the possible translates, e.g., A = a + dℕ and B = b + dℕ for integers a, b, d ≥ 1, to match the abstract's phrasing.
  2. [Proof of main theorem] The reduction to syndetic sets (mentioned in the proof outline) preserves natural density but the argument that the sumset density equality is unaffected by removing a zero-density set could be expanded with a short lemma or reference to a standard fact.
  3. [Introduction] A brief comparison table or paragraph contrasting the new characterization with the known periodic equality cases (excluded by assumption) would help readers see the boundary of the result.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript and the recommendation for minor revision. The referee's summary accurately describes the main result: a characterization of positive-density sets A, B ⊆ ℕ satisfying d(A + B) = d(A) + d(B) outside the periodic case, yielding an inverse theorem for Kneser's inequality. As the report lists no major comments, we have no point-by-point responses to provide.

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained

full rationale

The paper characterizes pairs of positive-density sets A, B satisfying d(A+B)=d(A)+d(B) under the non-periodic assumption that they are not both contained in a proper finite union of residue classes. The argument proceeds by reducing to the syndetic case, invoking a density form of Kneser's theorem (an external classical result), and applying a structure theorem to identify the sets as arithmetic progressions with common difference. No equation or step reduces by construction to its own inputs, no fitted parameters are relabeled as predictions, and load-bearing citations are to independent prior theorems rather than self-citations whose validity depends on the present work. The derivation therefore stands on its own against external benchmarks and receives the default non-circularity finding.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The result rests on the definition and basic properties of natural density together with Kneser's theorem; no free parameters or new entities are introduced in the abstract.

axioms (2)
  • standard math Natural density d(·) is well-defined and subadditive on subsets of the positive integers
    Invoked implicitly when writing d(A+B)=d(A)+d(B)
  • standard math Kneser's theorem supplies the lower bound d(A+B) ≥ d(A)+d(B) in abelian groups
    The paper is framed as an inverse result for this inequality

pith-pipeline@v0.9.0 · 5371 in / 1301 out tokens · 47876 ms · 2026-05-10T14:02:55.503348+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

6 extracted references · 6 canonical work pages

  1. [1]

    Bergelson, Weakly mixing PET,Ergodic Theory Dynam

    [Ber87]V. Bergelson, Weakly mixing PET,Ergodic Theory Dynam. Systems7no. 3 (1987), 337–349.https://doi.org/10.1017/S0143385700004090. [Blo]T. F. Bloom, Erd˝ os Problem #335,https://www.erdosproblems.com/335. [EG80]P. Erd ˝osandR. L. Graham,Old and New Problems and Results in Combi- natorial Number Theory,Monographies de L’Enseignement Math´ ematique28, Un...

  2. [2]

    Erd ¨osandP

    114 [ET48]P. Erd ¨osandP. Tur ´an, On a problem in the theory of uniform distribution. I,Nederl. Akad. Wetensch., Proc.51(1948), 1146–1154. [Far24]S. Farhangi, A generalization of van der Corput’s difference theorem with applications to recurrence and multiple ergodic averages,Dyn. Syst.39no. 1 (2024), 5–30.https://doi.org/10.1080/14689367.2023.2230160. [...

  3. [3]

    HostandB

    [HK05]B. HostandB. Kra, Nonconventional ergodic averages and nilmanifolds, Ann. of Math. (2)161no. 1 (2005), 397–488.https://doi.org/10.4007/ annals.2005.161.397. [HK09]B. HostandB. Kra, Uniformity seminorms onℓ ∞ and applications,J. Anal. Math.108(2009), 219–276.https://doi.org/10.1007/s11854-009-0024-1. 115 [HK18]B. HostandB. Kra,Nilpotent Structures in...

  4. [4]

    Kneser,Abschätzung der asymptotischen Dichte von Summenmengen, Math

    [JM26]A. JamneshanandS. Machado, The non-ergodic Host-Kra-Ziegler struc- ture theorem forZ d-actions via measurable selections,ArXiv e-prints(2026), 15 pp. Available athttps://arxiv.org/abs/2601.09553. [Kne53]M. Kneser, Absch¨ atzung der asymptotischen Dichte von Summenmengen, Math. Z.58(1953), 459–484.https://doi.org/10.1007/BF01174162. [Kne56]M. Kneser,...

  5. [5]

    [KMRR24a]B. Kra,J. Moreira,F. K. Richter, andD. Robertson, Infinite sumsets in sets with positive density,J. Amer. Math. Soc.37no. 3 (2024), 637–682. https://doi.org/10.1090/jams/1030. [KMRR24b]B. Kra,J. Moreira,F. K. Richter, andD. Robertson, A proof of Erd˝ os’sB+B+tconjecture,Commun. Am. Math. Soc.4(2024), 480–494. https://doi.org/10.1090/cams/34. [KN7...

  6. [6]

    The critical pairs of subsets of a group of prime order

    116 [TV06]T. TaoandV. H. Vu,Additive Combinatorics,Cambridge Studies in Ad- vanced Mathematics, Cambridge University Press, Cambridge, 2006.https: //doi.org/10.1017/CBO9780511755149. [Vos56a]A. G. Vosper, Addendum to “The critical pairs of subsets of a group of prime order”,J. London Math. Soc.31(1956), 280–282.https://doi.org/10.1112/ jlms/s1-31.3.280. [...