TOPICS
Search

Sumset


The sumset A_1+A_2+...+A_h of the sets of integers A_1, A_2, ..., A_h, where h>=2, is the set of all integers of the form a_1+a_2+...+a_h, where a_i is a member of A_i for i=1, 2, ..., h.

The same definition applies to subsets of any additive group, in particular to sets of real numbers. In this setting, the sum-product problem compares the cardinalities of the sumset A+A and the product set AA (Zhang et al. 2026).

Positive upper Banach density also forces infinite sumsets of arbitrarily many summands. Li and Su (2026) proved that, for every fixed positive integer k, a positive-upper-Banach-density subset A of a countably infinite Abelian group contains B_1+...+B_k with every B_i infinite. Li and Su (2026) report using AI tools to develop a Lean formalization.


See also

Ostmann Conjecture, Sum-Free Set, Sum-Product Problem

Portions of this entry contributed by Tony Noe

Explore with Wolfram|Alpha

References

Li, S. and Su, Y. "Solutions to Several Problems on Infinite Sumset Configurations." 29 Oct 2026. https://arxiv.org/abs/2610.39637.Nathanson, M. B. Additive Number Theory: Inverse Problems and the Geometry of Sumsets. New York: Springer-Verlag, p. 1, 1996.Zhang, K.; Zeng, Y.; and Wang, Y. "Ideal-Smooth Sets and an Explicit Upper Bound for the Real Sum-Product Exponent." 5 Oct 2026. https://arxiv.org/abs/2610.05725.

Referenced on Wolfram|Alpha

Sumset

Cite this as:

Weisstein, Eric W., with contributions by Tony Noe. "Sumset." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Sumset.html

Subject classifications