Math 2.0

Number theory Definition

Schnirelmann density

Builds on Natural numbers

Definition

Let AA be a subset of the natural numbers. For each integer n≥1n \ge 1, let A(n)A(n) be the number of elements a∈Aa \in A with 1≤a≤n1 \le a \le n. The Schnirelmann density of AA is σ(A)=inf⁡n≥1A(n)n.\sigma(A) = \inf_{n \ge 1} \frac{A(n)}{n}.

Remarks

Always 0≤σ(A)≤10 \le \sigma(A) \le 1, and A(n)≥σ(A) nA(n) \ge \sigma(A)\, n for every n≥1n \ge 1. The element 00, if present, does not count. One has σ(A)=1\sigma(A) = 1 if and only if AA contains every positive integer.

Example: for the set AA of odd positive integers, A(n)/n=1/2A(n)/n = 1/2 for even nn and A(n)/n=(n+1)/(2n)>1/2A(n)/n = (n+1)/(2n) > 1/2 for odd nn; so σ(A)=1/2\sigma(A) = 1/2. Contrast: for the even positive integers, A(1)/1=0A(1)/1 = 0, so σ(A)=0\sigma(A) = 0, although their natural density is 1/21/2.

Schnirelmann's inequality: if 0∈A0 \in A and 0∈B0 \in B, then σ(A+B)≥σ(A)+σ(B)−σ(A)σ(B)\sigma(A + B) \ge \sigma(A) + \sigma(B) - \sigma(A)\sigma(B), where A+B={a+b:a∈A,b∈B}A + B = \set{a + b : a \in A, b \in B}.

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
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. Natural numbers object
  2. Schnirelmann density definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Schnirelmann_density
About this page
TagXBDB3YNV9S
URIm2://XBDB3YNV9S
Kinddefinition
WritingW0 stub
MSC11B05, 11B13
DefinesSchnirelmann density
UsesNatural numbers
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.