# Schnirelmann Density

## Measuring Additive Size

In additive number theory, ordinary asymptotic density is often too weak to control additive behavior.

For example, a set may have density zero yet still represent all sufficiently large integers after repeated addition. Prime numbers are an important example.

To study additive growth more effectively, entity["people","Lev Schnirelmann","Russian mathematician"] introduced a stronger density notion adapted specifically to additive problems.

This density became one of the foundational tools of early additive number theory.

## Definition

Let

$$
A\subseteq \mathbb N.
$$

Define the counting function

$$
A(n)=\#\{a\in A : a\leq n\}.
$$

The Schnirelmann density of $A$ is

$$
\sigma(A) =
\inf_{n\geq1}
\frac{A(n)}{n}.
$$

Thus $\sigma(A)$ measures the smallest lower proportion of integers captured by $A$ among all initial intervals.

Unlike asymptotic density, Schnirelmann density is sensitive to small integers as well as large-scale behavior.

## Basic Properties

The density satisfies

$$
0\leq\sigma(A)\leq1.
$$

If

$$
\sigma(A)=1,
$$

then $A$ contains every positive integer.

Finite sets have density zero because

$$
A(n)
$$

eventually becomes constant.

The full set of positive integers satisfies

$$
\sigma(\mathbb N)=1.
$$

## Example: Even Numbers

Let

$$
A=2\mathbb N.
$$

Then approximately half of the integers up to $n$ are even, so

$$
A(n)\approx\frac n2.
$$

Hence

$$
\sigma(A)=\frac12.
$$

Thus the even numbers have positive Schnirelmann density.

## Example: Prime Numbers

The Prime Number Theorem gives

$$
\pi(n)\sim\frac n{\log n}.
$$

Therefore

$$
\frac{\pi(n)}n\sim\frac1{\log n}\to0.
$$

Hence the primes have Schnirelmann density zero.

Nevertheless, repeated sums of primes eventually represent all sufficiently large integers.

This illustrates that density zero does not prevent additive richness.

## Sumsets and Density Growth

The key insight of Schnirelmann theory is that density increases under addition.

If

$$
A,B\subseteq\mathbb N,
$$

then the sumset

$$
A+B =
\{a+b : a\in A,\ b\in B\}
$$

often has substantially larger density than either set individually.

Repeated addition can therefore force eventual coverage of all integers.

## Schnirelmann's Inequality

A fundamental theorem states:

$$
\sigma(A+B)
\geq
\sigma(A)+\sigma(B)-\sigma(A)\sigma(B).
$$

Equivalently,

$$
1-\sigma(A+B)
\leq
(1-\sigma(A))(1-\sigma(B)).
$$

Thus additive combination increases density unless one set is extremely sparse.

This inequality is one of the foundational results of additive combinatorics.

## Consequence for Repeated Sumsets

Suppose

$$
\sigma(A)>0.
$$

Applying Schnirelmann's inequality repeatedly shows that

$$
\sigma(hA)\to1
$$

as $h\to\infty$.

Consequently, sufficiently many additions of $A$ eventually cover all positive integers.

Hence:

Every set with positive Schnirelmann density is an additive basis of finite order.

This theorem was revolutionary because it connected additive representation with density growth.

## Mann's Theorem

entity["people","Henry Mann","American mathematician"] later sharpened Schnirelmann's inequality.

Mann's theorem states:

$$
\sigma(A+B)
\geq
\min(1,\sigma(A)+\sigma(B)).
$$

This bound is stronger and more elegant.

It became one of the fundamental structural results of additive number theory.

## Additive Bases and Density

Schnirelmann used density methods to study additive bases.

A major application concerned primes.

Using earlier work and density arguments, Schnirelmann proved that there exists a finite integer $k$ such that every sufficiently large integer is a sum of at most $k$ primes.

This was one of the first major additive results about primes.

Later work dramatically improved the value of $k$, eventually leading toward modern Goldbach-type results.

## Comparison with Asymptotic Density

The asymptotic density of $A$ is

$$
d(A) =
\lim_{n\to\infty}\frac{A(n)}n,
$$

when the limit exists.

Schnirelmann density is stronger because it uses the infimum over all $n$, not merely asymptotic behavior.

A set may have positive asymptotic density but small Schnirelmann density if it initially omits many integers.

Thus Schnirelmann density is particularly suited for additive covering problems.

## Probabilistic Perspective

Density growth under addition resembles probabilistic independence.

The inequality

$$
1-\sigma(A+B)
\leq
(1-\sigma(A))(1-\sigma(B))
$$

resembles the probability formula for intersections of independent events.

This analogy helps explain why repeated addition rapidly fills gaps.

## Modern Developments

Classical Schnirelmann theory influenced many later areas:

- additive combinatorics,
- sumset estimates,
- Freiman theory,
- probabilistic number theory,
- entropy methods.

Modern additive combinatorics often studies finer structural information than density alone, but Schnirelmann's ideas remain foundational.

## Importance

Schnirelmann density was one of the first systematic tools connecting:

- additive representation,
- density growth,
- sumsets,
- covering properties.

It transformed additive number theory from isolated representation problems into a structural theory of additive growth.