Math 2.0

Number theory Definition

Sum-free set

Builds on Abelian groupSumset

Definition

Let GG be an abelian group written additively, and let AA be a subset of GG. The set AA is sum-free if there are no x,y,z∈Ax, y, z \in A, not necessarily distinct, with x+y=zx + y = z.

Remarks

Equivalently, (A+A)∩A=∅(A + A) \cap A = \emptyset, where A+AA + A is the sumset. The set of odd integers is sum-free in ℤ\Z: if xx and yy are odd, then x+yx + y is even, so it is not in the set. The set {1,2,4}\set{1, 2, 4} is not sum-free: with x=y=2x = y = 2 one gets x+y=4x + y = 4, and repeated elements are allowed. For a positive integer NN, the upper half {n:N/2<n≤N}\set{n : N/2 < n \le N} of {1,…,N}\set{1, \dots, N} is sum-free, since any sum of two of its elements exceeds NN. The set {0}\set{0} is never sum-free, since 0+0=00 + 0 = 0; so a sum-free subset of a group does not contain 00.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Abelian group concept
  2. Sumset concept
  3. Sum-free set definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Sum-free_set
About this page
TagMWGG1P8WDC
URIm2://MWGG1P8WDC
Kinddefinition
WritingW0 stub
MSC11B75, 11P70, 05D10
DefinesSum-free set
UsesAbelian group, Sumset
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • 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.