# inequality of logarithmic and asymptotic density

For any $A\subseteq\mathbb{N}$ we denote $A(n):=|A\cap\{1,2,\ldots,n\}|$ and $S(n):=\sum\limits_{k=1}^{n}\frac{1}{k}$.

Recall that the values

 $\underline{d}(A)=\liminf_{n\to\infty}\frac{A(n)}{n}\qquad\overline{d}(A)=% \limsup_{n\to\infty}\frac{A(n)}{n}$

are called lower and upper asymptotic density of $A$.

The values

 $\underline{\delta}(A)=\liminf_{n\to\infty}\frac{\sum\limits_{k\in A;k\leq n}% \frac{1}{k}}{S(n)}\qquad\overline{\delta}(A)=\limsup_{n\to\infty}\frac{\sum% \limits_{k\in A;k\leq n}\frac{1}{k}}{S(n)}$

are called lower and upper logarithmic density of $A$.

We have $S(n)\sim\ln n$ (we use the Landau notation). This follows from the fact that $\lim\limits_{n\to\infty}S(n)-\ln n=\gamma$ is Euler’s constant. Therefore we can use $\ln n$ instead of $S(n)$ in the definition of logarithmic density as well.

The sum in the definition of logarithmic density can be rewritten using Iverson’s convention as $\sum_{k=1}^{n}\frac{1}{k}[k\in A]$. (This means that we only add elements fulfilling the condition $k\in A$. This notation is introduced in [1, p.24].)

###### Theorem 1.

For any subset $A\subseteq\mathbb{N}$

 $\underline{d}(A)\leq\underline{\delta}(A)\leq\overline{\delta}(A)\leq\overline% {d}(A)$

holds.

###### Proof.

We first observe that

 $\displaystyle\frac{1}{k}[k\in A]=\frac{A(k)-A(k-1)}{k},$ $\displaystyle D(n):=\sum_{k=1}^{n}\frac{1}{k}[k\in A]=\frac{A(n)}{n}+\sum_{k=1% }^{n-1}\frac{A(k)}{k(k+1)}$

There exists an $n_{0}\in\mathbb{N}$ such that for each $n\geq n_{0}$ it holds $\underline{d}(A)-\varepsilon\leq\frac{A(n)}{n}\leq\overline{d}(A)+\varepsilon$.

We denote $C:=1+S(n_{0})$. For $n\geq n_{0}$ we get

 $\displaystyle D(n)\leq C+\sum_{k=n_{0}}^{n-1}\frac{A(k)}{k}\cdot\frac{1}{k+1}% \leq C+(\overline{d}(A)+\varepsilon)\sum_{k=n_{0}}^{n-1}\frac{1}{k+1}\sim(% \overline{d}(A)+\varepsilon)\ln n,$ $\displaystyle\overline{\delta}(A)=\limsup_{n\to\infty}\frac{D(n)}{\ln n}\leq% \overline{d}(A)+\varepsilon.$

This inequality holds for any $\varepsilon>0$, thus $\overline{\delta}(A)\leq\overline{d}(A)$.

For the proof of the inequality for lower densities we put $C^{\prime}:=\sum_{k=1}^{n_{0}-1}\frac{A(k)}{k(k+1)}-(\underline{d}(A)-% \varepsilon)S(n_{0})$. We get

 $\displaystyle D(n)\geq C^{\prime}+(\underline{d}(A)-\varepsilon)S(n_{0})+(% \underline{d}(A)-\varepsilon)\sum_{k=n_{0}}^{n}\frac{1}{k+1}=\\ \displaystyle C^{\prime}+(\underline{d}(A)-\varepsilon)S(n)\sim(\underline{d}(% A)-\varepsilon)\ln n$

and this implies $\underline{\delta}(A)\geq\underline{d}(A)$. ∎

For the proof using Abel’s partial summation see [4] or [5].

###### Corollary 1.

If a set has asymptotic density, then it has logarithmic density, too.

A well-known example of a set having logarithmic density but not having asymptotic density is the set of all numbers with the first digit equal to 1.

It can be moreover proved, that for any real numbers $0\leq\underline{\alpha}\leq\underline{\beta}\leq\overline{\beta}\leq\overline{% \alpha}\leq 1$ there exists a set $A\subseteq\mathbb{N}$ such that $\underline{d}(A)=\underline{\alpha}$, $\underline{\delta}(A)=\underline{\beta}$, $\overline{\delta}(A)=\overline{\beta}$ and $\overline{d}(A)=\overline{\alpha}$ (see [2]).

## References

• 1 R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete mathematics. A foundation for computer science. Addison-Wesley, 1989.
• 2 L. Mišík. Sets of positive integers with prescribed values of densities. Mathematica Slovaca, 52(3):289–296, 2002.
• 3 H. H. Ostmann. Additive Zahlentheorie I. Springer-Verlag, Berlin-Göttingen-Heidelberg, 1956.
• 4 J. Steuding. http://www.math.uni-frankfurt.de/~steuding/steuding/prob.pdfProbabilistic number theory.
• 5 G. Tenenbaum. Introduction to analytic and probabilistic number theory. Cambridge Univ. Press, Cambridge, 1995.
Title inequality of logarithmic and asymptotic density InequalityOfLogarithmicAndAsymptoticDensity 2014-03-24 9:16:11 2014-03-24 9:16:11 kompik (10588) kompik (10588) 8 kompik (10588) Theorem msc 11B05 AsymptoticDensity LogarithmicDensity