Natural density

In number theory, natural density (or asymptotic density or arithmetic density) is one of the possibilities to measure how large a subset of the set of natural numbers is.

Intuitively, it is thought that there are more positive integers than perfect squares, since every perfect square is already positive, and many other positive integers exist besides. However, the set of positive integers is not in fact larger than the set of perfect squares: both sets are infinite and countable and can therefore be put in one-to-one correspondence. Nevertheless if one goes through the natural numbers, the squares become increasingly scarce. The notion of natural density makes this intuition precise.

If an integer is randomly selected from the interval [1, n], then the probability that it belongs to A is the ratio of the number of elements of A in [1, n] to the total number of elements in [1, n]. If this probability tends to some limit as n tends to infinity, then this limit is referred to as the asymptotic density of A. This notion can be understood as a kind of probability of choosing a number from the set A. Indeed, the asymptotic density (as well as some other types of densities) is studied in probabilistic number theory.

Asymptotic density contrasts, for example, with the Schnirelmann density. One drawback of asymptotic density is that it is not defined for all subsets of $\mathbb {N}$.

Definition

A subset A of positive integers has natural density (or asymptotic density) α if the proportion of elements of A among all natural numbers from 1 to n is asymptotic to α as n tends to infinity.

More explicitly, if one defines for any natural number n the counting function a(n) as the number of elements of A less than or equal to n, then the natural density of A being α exactly means that^[1]

a(n)/n → α as n → +∞.

It follows from the definition that if a set A has natural density α then 0 ≤ α ≤ 1.

Upper and lower asymptotic density

Let $A$ be a subset of the set of natural numbers $\mathbb{N}=\{1,2,\ldots\}.$ For any $n\in \mathbb {N}$ put $A(n)=\{1,2,\ldots,n\} \cap A.$ and $a(n)=|A(n)|$.

Define the upper asymptotic density $\overline{d}(A)$ of $A$ by

$\overline{d}(A) = \limsup_{n \rightarrow \infty} \frac{a(n)}{n}$

where lim sup is the limit superior. $\overline{d}(A)$ is also known simply as the upper density of $A.$

Similarly, $\underline{d}(A)$, the lower asymptotic density of $A$, is defined by

$\underline{d}(A) = \liminf_{n \rightarrow \infty} \frac{ a(n) }{n}$

One may say $A$ has asymptotic density $d(A)$ if $\underline{d}(A)=\overline{d}(A)$, in which case $d(A)$ is equal to this common value.

This definition can be restated in the following way:

$d(A)=\lim_{n \rightarrow \infty} \frac{a(n)}{n}$

if the limit exists.^[2]

It can be proven that the definitions imply that the following also holds. If one were to write a subset of $\mathbb {N}$ as an increasing sequence

$A=\{a_1<a_2<\ldots<a_n<\ldots; n\in\mathbb{N}\}$

then

$\underline{d}(A) = \liminf_{n \rightarrow \infty} \frac{n}{a_n},$

$\overline{d}(A) = \limsup_{n \rightarrow \infty} \frac{n}{a_n}$

and $d(A) = \lim_{n \rightarrow \infty} \frac{n}{a_n}$ if the limit exists.

Remark

A somewhat weaker notion of density is upper Banach density; given a set $A \subseteq \mathbb{N}$, define $d^*(A)$ as

$d^*(A) = \limsup_{N-M \rightarrow \infty} \frac{| A \bigcap \{M, M+1, \ldots , N\}|}{N-M+1}$

Properties and examples

• If d(A) exists for some set A, then for the complement set we have d(A^c) = 1 − d(A).
• If $d(A)$, $d(B)$, and $d(A\cup B)$ exist, then $\max\{d(A),d(B)\} \leq d(A\cup B) \leq \min\{d(A)+d(B),1\}$.
• For any two sets A, B we have $\underline d(A)+\overline d(B)\leq \overline d(A\cup B)\leq \overline d(A)+\overline d(B)$.
• The density d(N) of the entire set of natural numbers is equal to 1.
• For any finite set F of positive integers, d(F) = 0.
• If $A=\{n^2; n\in\mathbb{N}\}$ is the set of all squares, then d(A) = 0.
• If $A=\{2n; n\in\mathbb{N}\}$ is the set of all even numbers, then d(A) = 0.5 . Similarly, for any arithmetical progression $A=\{an+b; n\in\mathbb{N}\}$ we get d(A) = 1/a.
• For the set P of all primes we get from the prime number theorem d(P) = 0.
• The set of all square-free integers has density $\tfrac{6}{\pi^2}$
• The set of abundant numbers has non-zero density.^[3] Marc Deléglise showed in 1998 that the density of the set of abundant numbers and perfect numbers is between 0.2474 and 0.2480.^[4]
• The set $A=\bigcup\limits_{n=0}^\infty \{2^{2n},\ldots,2^{2n+1}-1\}$ of numbers whose binary expansion contains an odd number of digits is an example of a set which does not have an asymptotic density, since the upper density of this set is

$\overline d(A)=\lim_{m \rightarrow \infty} \frac{1+2^2+\cdots +2^{2m}}{2^{2m+1}-1} = \lim_{m \rightarrow \infty} \frac{2^{2m+2}-1}{3(2^{2m+1}-1)} = \frac 23\, ,$

whereas its lower density is

$\underline d(A)=\lim_{m \rightarrow \infty} \frac{1+2^2+\cdots +2^{2m}}{2^{2m+2}-1} = \lim_{m \rightarrow \infty} \frac{2^{2m+2}-1}{3(2^{2m+2}-1)} = \frac 13\, .$

• The set of numbers whose decimal expansion begins with the digit 1 similarly has no natural density: the lower density is 1/9 and the upper density is 5/9.^[1]
• Consider an equidistributed sequence $\{\alpha_n\}_{n\in\N}$ in $[0,1]$ and define a monotone family $\{A_x\}_{x\in[0,1]}$ of sets :

$A_x:=\{n\in\mathbb{N}\,:\, \alpha_n<x \}\, .$

Then, by definition, $d(A_x)= x$ for all $x$.

• If S is a set of positive upper density then Szemerédi's theorem states that S contains arbitrarily large finite arithmetic progressions, and the Furstenberg–Sárközy theorem states that some two members of S differ by a square number.

Other density functions

Other density functions on subsets of the natural numbers may be defined analogously. For example, the logarithmic density of a set A is defined as the limit (if it exists)

$\mathbf{\delta}(A) = \lim_{x \rightarrow \infty} \frac{1}{\log x} \sum_{n \in A, n \le x} \frac{1}{n} \ .$

Upper and lower logarithmic densities are defined analogously as well.

Notes

1. Tenenbaum (1995) p.261
2. Nathanson (2000) pp.256–257
3. Hall, Richard R.; Tenenbaum, Gérald (1988). Divisors. Cambridge Tracts in Mathematics. 90. Cambridge: Cambridge University Press. p. 95. ISBN 0-521-34056-X. Zbl 0653.10001.
4. Deléglise, Marc (1998). "Bounds for the density of abundant integers". Experimental Mathematics. 7 (2): 137–143. doi:10.1080/10586458.1998.10504363. ISSN 1058-6458. MR 1677091. Zbl 0923.11127.

See also

• Dirichlet density

References

• Nathanson, Melvyn B. (2000). Elementary Methods in Number Theory. Graduate Texts in Mathematics. 195. Springer-Verlag. ISBN 0387989129. Zbl 0953.11002.
• Niven, Ivan (1951). "The asymptotic density of sequences". Bulletin of the American Mathematical Society. 57: 420–434. doi:10.1090/s0002-9904-1951-09543-9. MR 0044561. Zbl 0044.03603.
• Steuding, Jörn (2002). "Probabilistic number theory" (PDF). Archived from the original (PDF) on December 22, 2011. Retrieved 2014-11-16.
• Tenenbaum, Gérald (1995). Introduction to analytic and probabilistic number theory. Cambridge Studies in Advanced Mathematics. 46. Cambridge University Press. Zbl 0831.11001.

This article incorporates material from Asymptotic density on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.