betaFeedback

WorksMathematics

Solutions to several problems on infinite sumset configurations

Abstract

We resolve a number of the problems collected by Kra, Moreira, Richter and Robertson in their survey "Problems on infinite sumset configurations in the integers and beyond". Our main result is that in every countably infinite abelian group, every set of positive upper Banach density contains a sumset B1+⋯+BkB_1+\dots+B_k of kk infinite sets, for every kk; the proof uses the Kronecker factor, but no higher-order Host-Kra structure theory, nilsystems of step greater than one, or nilspaces. We also answer, positively or negatively, questions on monochromatic sets B+mBB+mB, on sumsets in sets of logarithmic density, on polynomial sumset configurations, on sums of the form Bi1+⋯+BimB_{i_1}+\dots+B_{i_m} with BiB_i drawn from a density family, on random sets, on ordered sumsets in shifted primes, on sums and products in N\mathbb{N} and Q\mathbb{Q}, and on sumsets in abelian groups. Several of these answers concern the questions as literally stated, and two follow directly from known examples; in each case we say so and discuss the natural corrected question. Finally, answering a question of Kousek and Radić, we show that the supremum of the lower Banach densities of sets A⊂NA\subset\mathbb{N} such that B+B+t⊄AB+B+t\not\subset A for every infinite B⊂NB\subset\mathbb{N} and every t≥0t\ge0 (respectively B+B⊄AB+B\not\subset A for every infinite BB) is 1/21/2 (respectively 3/43/4). The main theorem and most of the other results are formalized in Lean 4, with some published theorems entering as explicit hypotheses.

Introduction

A well-known theorem of Moreira, Richter and Robertson [26], answering a question of Erdős, says that every set A⊂NA \subset\mathbb{N} of positive upper Banach density contains a sumset B+C={b+c:b∈B, c∈C}B+C=\{b+c:b\in B,\ c\in C\} with BB and CC infinite. In the survey [22], Kra, Moreira, Richter and Robertson collected a large number of open problems around this theorem: which other infinite configurations must occur in sets of positive density, which density hypotheses are needed, and what happens in the primes, in random sets, in multiplicative settings and in other groups.

In this paper we treat twenty of the questions and conjectures posed in [22] (nineteen questions and Conjecture 4.5); for two of them the answer follows directly from known results, as explained below. Our main result concerns sums of more than two infinite sets in abelian groups.

Main Theorem. Let Γ\Gamma be a countably infinite abelian group and let k≥1k \ge1. Every set A⊂ΓA \subset\Gamma of positive upper Banach density contains a sumset B1+⋯+BkB_1+\cdots+B_k, where B1,…,Bk⊂ΓB_1,\ldots,B_k \subset\Gamma are infinite.

This is Theorem 2.1; it answers Question 5.14 of [22]. The proof uses the Kronecker factor, but no higher-order Host–Kra structure theory, nilsystems of step greater than one, or nilspaces: it extends the short proof of the case k=2k=2 by Kra, Moreira, Richter and Robertson [24] to an arbitrary number of summands, building the required configuration one level at a time and keeping track only of the supports of suitable measures on the Kronecker factor.

The other answers are listed in Table 1, in the order in which they appear in the paper. They are of very different depth. Several are short, and some rely in an essential way on recent work of other authors: Question 5.16 on a theorem of Charamaras and Mountakis [8], the positive part of Question §3.3(a) on a theorem of Kousek [17], Questions 3.31 and §3.6(a) on the dynamical part of the density finite sums theorem of Kra, Moreira, Richter and Robertson [23], and Conjecture 4.5 on a theorem of Tao and Ziegler [30]. The negative answer to Question §3.3(e) follows directly from known counterexamples (one from [22] itself and one due to Ackelsberg [2]), and Question 3.24 is already answered by an example of Kousek and Radić [19], as we check; we record these for completeness. In each case we say precisely what is new.

QuestionAnswerSection
5.14Yes: B1+⋯+BkB_1+\cdots+B_k in every countably infinite abelian group2
5.16, §5.3(a)Exactly which sets of translates suffice when [G:2G]<∞[G:2G]<\infty3
5.10No: fibrewise lower density does not suffice in N2\mathbb{N}^24
5.23, §5.4(b)No, as stated, and also for a repaired version in Zd\mathbb{Z}^d; a second repair is open5
§3.2(a)No, for both readings6
§3.3(a)Ordered polynomial sums: exactly the linear case8.1
§3.3(e)No (direct consequence of known examples)8.2
3.20No, for every number r≥2r\ge2 of colours, also when only m≥2m\ge2 is considered9.1
3.23No, as stated9.2
3.24No (already implied by Kousek–Radić)9.3
3.31, §3.6(a)Yes, in the strongest kk-fold form10
4.13For γ>0\gamma>0: yes iff γ∉Z\gamma\notin\mathbb{Z} (for Lebesgue-almost every x∈Rx\in\mathbb{R})11
§4.4(a)Random sets: criterion for monotone pnp_n; in general the set of good pp is not Borel12
4.5Yes (a consequence of a theorem of Tao and Ziegler)13
§5.1(a)Yes for both examples14.1
5.4No14.2
5.6No, as stated14.3

Table 1. Questions from [22] answered in this paper.

In addition, in § 4.8 we answer a question of Kousek and Radić [19] that is not in [22]: the supremum of the lower Banach densities of sets A⊂NA \subset\mathbb{N} such that B+B+t⊈AB+B+t \nsubseteq A for every infinite B⊂NB \subset\mathbb{N} and every t≥0t \ge0 is 1/21/2, and the supremum for sets such that B+B⊈AB+B \nsubseteq A for every infinite BB is 3/43/4.

Conventions. We use the numbering of the second arXiv version of [22]. Some questions in the survey are posed in the running text without a number. We refer to them by the subsection in which they appear followed by a letter, in order of appearance: for instance, Question §3.2(a) is the first unnumbered question in Subsection 3.2 of [22]. Before answering each question we restate it in our notation.

Throughout, N={1,2,3,…}\mathbb{N}=\{1,2,3,\ldots\}, P\mathbb{P} denotes the set of primes, and for A⊂NA\subset\mathbb{N}

d‾(A)=lim sup⁡N→∞∣A∩[N]∣N,d∗(A)=lim sup⁡M≥0N→∞∣A∩[M+1,M+N]∣N.\overline{d}(A)=\limsup_{N\to\infty}\frac{|A\cap[N]|}{N},\qquad d^*(A)=\limsup_{\substack{M\geq0\\N\to\infty}}\frac{|A\cap[M+1,M+N]|}{N}.
d‾log⁡(A)=lim sup⁡N→∞1log⁡N∑n∈A∩[N]1n,\overline{d}_{\log}(A)=\limsup_{N\to\infty}\frac{1}{\log N}\sum_{n\in A\cap[N]}\frac{1}{n},

where [N]={1,…,N}[N]=\{1,\ldots,N\}. The lower densities d‾\underline{d} and d‾log⁡\underline{d}_{\log} are defined with lim inf⁡\liminf in place of lim sup⁡\limsup, and the natural and logarithmic densities dd and dlog⁡d_{\log} are the common values when upper and lower densities agree. The lower Banach density is defined in § 4.8. For a Følner sequence Φ=(ΦN)\Phi=(\Phi_N) in a countable abelian group we write d‾Φ(A)=lim sup⁡N∣A∩ΦN∣/∣ΦN∣\overline{d}_{\Phi}(A)=\limsup_N|A\cap\Phi_N|/|\Phi_N|, and the upper Banach density d∗(A)d^*(A) is the supremum of d‾Φ(A)\overline{d}_{\Phi}(A) over all Følner sequences Φ\Phi. A set is thick if it contains arbitrarily long intervals (in an abelian group: translates of every finite set). Conventions for nonabelian groups are given where they are used. For sets B,CB,C we write B+C={b+c:b∈B,c∈C}B+C=\{b+c:b\in B,c\in C\}, B+t={b+t:b∈B}B+t=\{b+t:b\in B\}, mB={mb:b∈B}mB=\{mb:b\in B\} and B⊕B={b+b′:b,b′∈B, b≠b′}B\oplus B=\{b+b':b,b'\in B,\ b\ne b'\}; thus B+BB+B is the unrestricted sumset, which contains the elements 2b2b.

Questions whose answer depends on the formulation. For several questions the answer we give concerns the question exactly as it is stated in the survey, and the literal statement differs from what the authors of the survey probably intended. We include these answers because the difference is not always obvious and the literal statements have been repeated in the literature, but in each case we point out the issue explicitly, give the natural corrected formulation, and say whether it remains open. This applies to Questions 5.23 and §5.4(b) (where the fibre conditions constrain only one coordinate), Question §3.2(a) (where the density condition can be read in two ways; we answer both readings), Question 3.20 (where m=1m=1 is coprime to every qq; we also answer the question for m≥2m\ge2), Question 3.23 (where B+mBB+mB contains the diagonal terms (m+1)b(m+1)b) and Question 5.6 (where the sign of xx gives an obstruction at the real place).

Formalization. The main theorem and most of the other results have been formalized in Lean 4 with Mathlib; the formalization is available at https://github.com/daizisheng/kmrr25, in the directory lean/Kmrr25. No file contains sorry or declares an axiom; every main theorem depends only on the standard axioms of Lean. Where one of our proofs relies on a published theorem that is not formalized, that theorem is stated as a proposition and appears as an explicit hypothesis of the formal statement, so that what is formalized is the deduction from it. Table 2 gives an overview, and after each formalized result a paragraph headed Formalization names the file and the main formal statements and says what is not covered.

QuestionFileStatus
5.14ThmK* (14 files)conditional on four classical theorems (see the end of § 3.2)
5.16, §5.3(a)Q516conditional on [8 Corollary 1.13]
5.10Q510complete
5.23, §5.4(b)Q523answer to the questions as stated: complete; repaired version (Theorem 5.5): not formalized
§3.2(a)S32acomplete
KR, Q. 5.2KR52Theorem 7.1 and the lower bounds in Theorem 7.2: complete; upper bounds ([19 Theorems 1.2 and 1.3]): not formalized
§3.3(a)S33anegative part: complete; positive part: conditional on [17 Theorem 1.2]
§3.3(e)S33ecomplete
3.20Q320complete
3.23Q323complete
3.24Q324complete
3.31, §3.6(a)Q331conditional on the dynamical input from [23] (Theorem 10.7)
4.13Q413, Q413a, Q413SecondMomentcomplete
§4.4(a)S44a, S44bcriteria and examples: complete; non-Borel results: conditional on [16 Theorems 14.2 and 27.1]
4.5C45conditional on [30 Theorem 1.5]
§5.1(a)S51acomplete
5.4Q54complete
5.6Q56complete

Table 2. Lean formalization. “Complete” means that the answer to the question proved in this paper is formalized without hypotheses beyond the standard axioms; the file names refer to lean/Kmrr25/*.lean.

Organisation. The paper has three parts, organised by the setting. § 2.1, at the beginning of the first part, contains the proof of the main theorem; the other sections of that part concern sumsets in abelian groups and in N2\mathbb{N}^2. The second part concerns sumsets in the integers: density thresholds for B+BB+B and B+B+tB+B+t (§ 4.1 and § 4.8), polynomial and dilated sumsets (§ 4.9 and § 4.11), density Ramsey families (§ 4.14), sparse and random sets (Sections 11 and § 4.20) and the primes (Section 13). The third part concerns configurations that mix sums and products. Each section begins by restating the questions it answers, and the sections can be read independently.

Part 1. Sumsets in groups

Sums of k infinite sets in countable abelian groups

This section answers Question 5.14 of [22]. We show (Theorem 2.1) that in every countably infinite abelian group, every set of positive upper Banach density contains a sumset B1+⋯+BkB_1+\cdots+B_k of kk infinite sets, for every kk. For finite groups the question has a trivially negative answer (Theorem 2.2), so “countably infinite” is the right setting. The proof does not use higher-order Host–Kra theory, nilsystems or nilspaces, or any equidistribution theorem for nilsystems; besides the Kronecker factor, it uses only standard facts of ergodic and spectral theory. It extends to kk summands, and to arbitrary countable abelian groups, the short proof of the case k=2k=2 for subsets of N\mathbb{N} given by Kra, Moreira, Richter and Robertson [24]. The cube is built one level at a time. At each level we re-base on the Kronecker factor of the current measure, and from one level to the next we keep only a condition on topological supports.

The question and the result

Let Γ\Gamma be a countable abelian group, written additively. A Følner sequence in Γ\Gamma is a sequence Φ=(ΦN)N∈N\Phi=(\Phi_N)_{N\in\mathbb{N}} of nonempty finite subsets of Γ\Gamma such that ∣(ΦN+γ)△ΦN∣/∣ΦN∣→0|(\Phi_N+\gamma)\mathbin{\triangle}\Phi_N|/|\Phi_N|\to0 for every γ∈Γ\gamma\in\Gamma. The upper Banach density of A⊂ΓA\subset\Gamma is

d∗(A)=sup⁡Φlim sup⁡N→∞∣A∩ΦN∣∣ΦN∣.d^*(A)=\sup_{\Phi}\limsup_{N\to\infty}\frac{|A\cap\Phi_N|}{|\Phi_N|}.

where the supremum is over all Følner sequences Φ\Phi in Γ\Gamma.

Question 5.14 ([22]). Is it true in every countable abelian group (G,+)(G,+) that every set AA of positive upper Banach density contains B1+⋯+BkB_1+\cdots+B_k for infinite sets B1,…,Bk⊂GB_1,\ldots,B_k\subset G?

Here k∈Nk\in\mathbb{N} is arbitrary; the case k=1k=1 is trivial.

Theorem 2.1. Let Γ\Gamma be a countably infinite abelian group and let k≥1k \ge1. If A⊂ΓA \subset\Gamma satisfies d∗(A)>0d^*(A) > 0, then there are infinite sets B1,…,Bk⊂ΓB_1,\ldots,B_k \subset\Gamma with

B1+⋯+Bk={b1+⋯+bk: bi∈Bi}⊂A.B_1+\cdots+B_k=\{b_1+\cdots+b_k:\ b_i\in B_i\}\subset A.

Remark 2.2 (Finite groups). Read literally, Question 5.14 includes finite groups, and for them the answer is no. A finite group has no infinite subsets, yet every nonempty A⊂GA \subset G has d∗(A)≥∣A∣/∣G∣>0d^*(A) \ge|A|/|G| > 0. (For finite GG, the Følner condition forces ΦN=G\Phi_N=G for all large NN.) So the meaningful version of the question concerns countably infinite groups, and Theorem 2.1 answers that version positively for every kk.

Remark 2.3 (Previously known cases).

(a) For k=2k=2 the conclusion holds in every countably infinite amenable group, with products in place of sums, for sets of positive density along a two-sided Følner sequence. This is due to Moreira, Richter and Robertson [26 Theorem 1.3]. In an abelian group every Følner sequence is two-sided.

(b) For Γ=Z\Gamma= \mathbb{Z}, or rather for A⊂NA \subset\mathbb{N}, the case of general kk is [20 Theorem 1.1] (Theorem 2.8 of [22]). Here and below, theorem numbers in [20] refer to arXiv:2206.01786v2. Its proof relies on pronilfactors: Kra, Moreira, Richter and Robertson construct Erdős cubes in an extension of the system with continuous factor maps to its pronilfactors [20 Section 5].

(c) For k=3k = 3 and [Γ:6Γ]<∞[\Gamma: 6\Gamma] < \infty, the conclusion follows from a theorem of Ackelsberg and Jamneshan [3 Theorem 1.9]. They find t∈Γt \in\Gamma and an infinite B⊂ΓB \subset\Gamma such that A−tA - t contains every sum of three distinct elements of BB. Splitting BB into three disjoint infinite sets B1′,B2′,B3′B'_1, B'_2, B'_3 then gives (B1′+t)+B2′+B3′⊂A(B'_1 + t) + B'_2 + B'_3 \subset A.

After stating Question 5.14, the survey [22] remarks that the techniques of [20], together with work of Griesmer [11], may suffice for Γ=Zd\Gamma= \mathbb{Z}^d. In other groups, it says, “one cannot proceed in the same way, because the analogous ergodic structure theory is not currently available.” The proof below uses no such structure theory.

References

  1. [1]Ethan Ackelsberg, Infinite polynomial patterns in large subsets of the rational numbers, 2025, arXiv:2506.19667.arxiv.org/abs/2506.19667
  2. [2]—, Counterexamples to generalizations of the Erdős B+B+t problem, Electron. J. Combin. 33 (2026), no. 3, Paper No. P3.89, arXiv:2404.17383; theorem numbers refer to arXiv:2404.17383v1.DOI
  3. [3]Ethan Ackelsberg and Asgar Jamneshan, Equidistribution in 2-nilpotent Polish groups and triple restricted sumsets, J. Lond. Math. Soc. (2) 114 (2026), no. 3, Paper No. e70693, arXiv:2504.07865; theorem numbers refer to arXiv:2504.07865v3.arxiv.org/abs/2504.07865
  4. [4]Tim Austin, Non-conventional ergodic averages for several commuting actions of an amenable group, J. Anal. Math. 130 (2016), 243–274.arxiv.org/abs/1309.4315
  5. [5]Vitaly Bergelson, Sets of recurrence of ℤᵐ-actions and properties of sets of differences in ℤᵐ, J. London Math. Soc. (2) 31 (1985), no. 2, 295–304.DOI
  6. [6]Vitaly Bergelson and Joel Moreira, Ergodic theorem involving additive and multiplicative groups of a field and {x + y, xy} patterns, Ergodic Theory Dynam. Systems 37 (2017), no. 3, 673–692.
  7. [7]Dimitrios Charamaras, Ioannis Kousek, Andreas Mountakis, and Tristán Radić, Infinite unrestricted sumsets in subsets of abelian groups with large density, Int. Math. Res. Not. IMRN 2026 (2026), no. 20, Paper No. rnag216, arXiv:2504.08649; lemma numbers refer to arXiv:2504.08649v1.arxiv.org/abs/2504.08649
  8. [8]Dimitrios Charamaras and Andreas Mountakis, Finding product sets in some classes of amenable groups, Forum Math. Sigma 13 (2025), Paper No. e10, arXiv:2402.07779; theorem numbers refer to arXiv:2402.07779v3.DOI
  9. [9]Mauro Di Nasso, Lorenzo Luperi Baglini, Marcello Mamino, Rosario Mennuni, and Mariaclara Ragosta, Ramsey’s witnesses, 2025, arXiv:2503.09246.
  10. [10]Harry Furstenberg, Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions, J. Analyse Math. 31 (1977), 204–256.DOI
  11. [11]John T. Griesmer, Ergodic averages, correlation sequences, and sumsets, Ph.D. thesis, The Ohio State University, 2009.
  12. [12]Neil Hindman, Finite sums from sequences within cells of a partition of N, J. Combinatorial Theory Ser. A 17 (1974), 1–11.DOI
  13. [13]———, Partitions and sums of integers with repetition, J. Combin. Theory Ser. A 27 (1979), no. 1, 19–32.DOI
  14. [14]Bernard Host and Bryna Kra, Uniformity seminorms on ℓ∞ and applications, J. Anal. Math. 108 (2009), 219–276.DOI
  15. [15]Wen Huang, Zhengxing Lian, Song Shao, Rongzhong Xiao, Leiye Xu, and Shuhao Zhang, An affirmative answer to Owing’s sumset question, 2026, arXiv:2607.17333.arxiv.org/abs/2607.17333
  16. [16]Alexander S. Kechris, Classical descriptive set theory, Graduate Texts in Mathematics, vol. 156, Springer-Verlag, New York, 1995.DOI
  17. [17]Ioannis Kousek, Asymmetric infinite sumsets in large sets of integers, Forum Math. Sigma 14 (2026), Paper No. e7, arXiv:2502.03112; theorem numbers refer to the arXiv version.DOI
  18. [18]———, Revisiting sums and products in countable and finite fields, Ergodic Theory Dynam. Systems 46 (2026), no. 2, 543–574, arXiv:2407.03304.DOI
  19. [19]Ioannis Kousek and Tristán Radić, Infinite unrestricted sumsets of the form B+B in sets with large density, Bull. Lond. Math. Soc. 57 (2025), no. 1, 48–68, arXiv:2404.12201.arxiv.org/abs/2404.12201
  20. [20]Bryna Kra, Joel Moreira, Florian K. Richter, and Donald Robertson, Infinite sumsets in sets with positive density, J. Amer. Math. Soc. 37 (2024), no. 3, 637–682, arXiv:2206.01786; theorem numbers refer to arXiv:2206.01786v2.DOI
  21. [21]———, A proof of Erdős’s B + B + t conjecture, Commun. Amer. Math. Soc. 4 (2024), 480–494, arXiv:2206.12377.
  22. [22]———, Problems on infinite sumset configurations in the integers and beyond, Bull. Amer. Math. Soc. (N.S.) 62 (2025), no. 4, 537–574, arXiv:2311.06197v2; question numbers refer to this version.
  23. [23]———, The density finite sums theorem, Invent. Math. 243 (2026), no. 1, 1–31, arXiv:2504.06424; theorem numbers refer to arXiv:2504.06424v3.
  24. [24]———, A short proof of Erdős’s B+C conjecture, 2026, arXiv:2603.27258v2.
  25. [25]Łukasz Mazurkiewicz and Szymon Żeberski, Ideal analytic sets, Math. Logic Quart. 72 (2026), no. 1, Paper No. e70012, arXiv:23010.07693.DOI
  26. [26]Joel Moreira, Florian K. Richter, and Donald Robertson, A proof of a sumset conjecture of Erdős, Ann. of Math. (2) 189 (2019), no. 2, 605–652, arXiv:1803.00498.
  27. [27]J. C. Owings, Jr., Problem E2494, Amer. Math. Monthly 81 (1974), no. 8, 902.
  28. [28]F. P. Ramsey, On a problem of formal logic, Proc. London Math. Soc. (2) 30 (1930), no. 4, 264–286.
  29. [29]Florian K. Richter, Sums and products in sets of positive density, 2025, arXiv:2507.00515v2.arxiv.org/abs/2507.00515
  30. [30]Terence Tao and Tamar Ziegler, Infinite partial sumsets in the primes, J. Anal. Math. 151 (2023), no. 1, 375–389, arXiv:2301.10303; theorem numbers refer to arXiv:2301.10303v4.arxiv.org/abs/2301.10303

Paper details

vlnc:W_zmdffh3k
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

GPT (multiple versions), Anthropic’s Claude

View statement
Looking for related papers…
Contents