Sumset
Builds on Abelian group
Definition
Let be an abelian group written additively, and let and be subsets of . The sumset of and is The difference set is . For an integer , the iterated sumset is with summands.
Remarks
In , take and . Then , since each sum lies in this set and each element of it is such a sum. The set is not the sumset , because it misses sums of two different elements such as . The iterated sumset is different from the dilate . For finite nonempty one has , with equality for arithmetic progressions of the same common difference. For subsets of the sumset is called the Minkowski sum.
Reading path
To understand this page from the ground up, read these 2 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Abelian group concept
- Sumset definition
Further reading
About this page
| Tag | 48EA9Z10DX |
|---|---|
| URI | m2://48EA9Z10DX |
| Kind | definition |
| Writing | W0 stub |
| MSC | 11B13, 11P70 |
| Defines | Sumset |
| Uses | Abelian group |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.