In mathematics, in the area of additive number theory, the Erdős–Fuchs theorem is a statement about the number of ways that numbers can be represented as a sum of elements of a given additive basis, stating that the average order of this number cannot be too close to being a linear function. The theorem is named after Paul Erdős and Wolfgang Heinrich Johannes Fuchs, who published it in 1956.
Statement Let A ⊆ N {\displaystyle {\mathcal {A}}\subseteq \mathbb {N} } be an infinite subset of the natural numbers and r A , h ( n ) {\displaystyle r_{{\mathcal {A}},h}(n)} its representation function, which denotes the number of ways that a natural number n {\displaystyle n} can be expressed as the sum of h {\displaystyle h} elements of A {\displaystyle {\mathcal {A}}} (taking order into account). We then consider the accumulated representation function
s A , h ( x ) := ∑ n ⩽ x r A , h ( n ) , {\displaystyle s_{{\mathcal {A}},h}(x):=\sum _{n\leqslant x}r_{{\mathcal {A}},h}(n),}
which counts (also taking order into account) the number of solutions to k 1 + ⋯ + k h ⩽ x {\displaystyle k_{1}+\cdots +k_{h}\leqslant x} , where k 1 , … , k h ∈ A {\displaystyle k_{1},\ldots ,k_{h}\in {\mathcal {A}}} . The theorem then states that, for any given c > 0 {\displaystyle c>0} , the relation
s A , 2 ( n ) = c n + o ( n 1 / 4 log ( n ) − 1 / 2 ) {\displaystyle s_{{\mathcal {A}},2}(n)=cn+o\left(n^{1/4}\log(n)^{-1/2}\right)}
cannot be satisfied; that is, there is no A ⊆ N {\displaystyle {\mathcal {A}}\subseteq \mathbb {N} } satisfying the above estimate.
Theorems of Erdős–Fuchs type The Erdős–Fuchs theorem has an interesting history of precedents and generalizations. In 1915, it was already known by G. H. Hardy that in the case of the sequence Q := { 0 , 1 , 4 , 9 , … } {\displaystyle {\mathcal {Q}}:=\{0,1,4,9,\ldots \}} of perfect squares one has
lim sup n → + ∞ | s Q , 2 ( n ) − π n | n 1 / 4 log ( n ) 1 / 4 > 0 {\displaystyle \limsup _{n\to +\infty }{\frac {\left|s_{{\mathcal {Q}},2}(n)-\pi n\right|}{n^{1/4}\log(n)^{1/4}}}>0}
This estimate is a little better than that described by Erdős–Fuchs, but at the cost of a slight loss of precision, P. Erdős and W. H. J. Fuchs achieved complete generality in their result (at least for the case h = 2 {\displaystyle h=2} ). Another reason this result is so celebrated may be due to the fact that, in 1941, P. Erdős and P. Turán conjectured that, subject to the same hypotheses as in the theorem stated, the relation
s A , 2 ( n ) = c n + O ( 1 ) {\displaystyle s_{{\mathcal {A}},2}(n)=cn+O(1)}
could not hold. This fact remained unproven until 1956, when Erdős and Fuchs obtained their theorem, which is even stronger than the previously conjectured estimate.
Improved versions for h = 2 This theorem has been extended in a number of different directions. In 1980, A. Sárközy considered two sequences which are "near" in some sense. He proved the following:
Theorem (Sárközy, 1980). If A = { a 1 < a 2 < … } {\displaystyle {\mathcal {A}}=\{a_{1}<a_{2}<\ldots \}} and B = { b 1 < b 2 < … } {\displaystyle {\mathcal {B}}=\{b_{1}<b_{2}<\ldots \}} are two infinite subsets of natural numbers with a i − b i = o ( a i 1 / 2 log ( a i ) − 1 ) {\displaystyle a_{i}-b_{i}=o{\big (}a_{i}^{1/2}\log(a_{i})^{-1}{\big )}} , then | { ( i , j ) : a i + b j ⩽ n } | = c n + o ( n 1 / 4 log ( n ) − 1 / 2 ) {\displaystyle |\{(i,j):a_{i}+b_{j}\leqslant n\}|=cn+o{\big (}n^{1/4}\log(n)^{-1/2}{\big )}} cannot hold for any constant c > 0 {\displaystyle c>0} . In 1990, H. L. Montgomery and R. C. Vaughan were able to remove the log from the right-hand side of Erdős–Fuchs original statement, showing that
s A , 2 ( n ) = c n + o ( n 1 / 4 ) {\displaystyle s_{{\mathcal {A}},2}(n)=cn+o(n^{1/4})}
cannot hold. In 2004, Gábor Horváth extended both these results, proving the following:
Theorem (Horváth, 2004). If A = { a 1 < a 2 < … } {\displaystyle {\mathcal {A}}=\{a_{1}<a_{2}<\ldots \}} and B = { b 1 < b 2 < … } {\displaystyle {\mathcal {B}}=\{b_{1}<b_{2}<\ldots \}} are infinite subsets of natural numbers with a i − b i = o ( a i 1 / 2 ) {\displaystyle a_{i}-b_{i}=o{\big (}a_{i}^{1/2}{\big )}} and | A ∩ [ 0 , n ] | − | B ∩ [ 0 , n ] | = O ( 1 ) {\displaystyle |{\mathcal {A}}\cap [0,n]|-|{\mathcal {B}}\cap [0,n]|=O(1)} , then | { ( i , j ) : a i + b j ⩽ n } | = c n + o ( n 1 / 4 ) {\displaystyle |\{(i,j):a_{i}+b_{j}\leqslant n\}|=cn+o{\big (}n^{1/4}{\big )}} cannot hold for any constant c > 0 {\displaystyle c>0} .
General case (h ≥ 2) The natural generalization to Erdős–Fuchs theorem, namely for h ⩾ 3 {\displaystyle h\geqslant 3} , is known to hold with same strength as the Montgomery–Vaughan's version. In fact, M. Tang showed in 2009 that, in the same conditions as in the original statement of Erdős–Fuchs, for every h ⩾ 2 {\displaystyle h\geqslant 2} the relation
s A , h ( n ) = c n + o ( n 1 / 4 ) {\displaystyle s_{{\mathcal {A}},h}(n)=cn+o(n^{1/4})}
cannot hold. In another direction, in 2002, Gábor Horváth gave a precise generalization of Sárközy's 1980 result, showing that
Theorem (Horváth, 2002) If A ( j ) = { a 1 ( j ) < a 2 ( j ) < … } {\displaystyle {\mathcal {A}}^{(j)}=\{a_{1}^{(j)}<a_{2}^{(j)}<\ldots \}} ( j = 1 , … , k {\displaystyle j=1,\ldots ,k} ) are k {\displaystyle k} (at least two) infinite subsets of natural numbers and the following estimates are valid:
a i ( 1 ) − a i ( 2 ) = o ( ( a i ( 1 ) ) 1 / 2 log ( a i ( 1 ) ) − k / 2 ) {\displaystyle a_{i}^{(1)}-a_{i}^{(2)}=o{\big (}(a_{i}^{(1)})^{1/2}\log(a_{i}^{(1)})^{-k/2}{\big )}}
| A ( j ) ∩ [ 0 , n ] | = Θ ( | A ( 1 ) ∩ [ 0 , n ] | ) {\displaystyle |{\mathcal {A}}^{(j)}\cap [0,n]|=\Theta {\big (}|{\mathcal {A}}^{(1)}\cap [0,n]|{\big )}} (for j = 3 , … , k {\displaystyle j=3,\ldots ,k} )
then the relation:
| { ( i 1 , … , i k ) : a i 1 ( 1 ) + … + a i k ( k ) ⩽ n , a i j ( j ) ∈ A ( j ) ( j = 1 , … , k ) } | = c n + o ( n 1 / 4 log ( n ) 1 − 3 k / 4 ) {\displaystyle |\{(i_{1},\ldots ,i_{k}):a_{i_{1}}^{(1)}+\ldots +a_{i_{k}}^{(k)}\leqslant n,~a_{i_{j}}^{(j)}\in {\mathcal {A}}^{(j)}(j=1,\ldots ,k)\}|=cn+o{\big (}n^{1/4}\log(n)^{1-3k/4}{\big )}}
cannot hold for any constant c > 0 {\displaystyle c>0} .
Non-linear approximations Yet another direction in which the Erdős–Fuchs theorem can be improved is by considering approximations to s A , h ( n ) {\displaystyle s_{{\mathcal {A}},h}(n)} other than c n {\displaystyle cn} for some c > 0 {\displaystyle c>0} . In 1963, Paul T. Bateman, Eugene E. Kohlbecker and Jack P. Tull proved a slightly stronger version of the following:
Theorem (Bateman–Kohlbecker–Tull, 1963). Let L ( x ) {\displaystyle L(x)} be a slowly varying function which is either convex or concave from some point onward. Then, on the same conditions as in the original Erdős–Fuchs theorem, we cannot have s A , 2 ( n ) = n L ( n ) + o ( n 1 / 4 log ( n ) − 1 / 2 L ( n ) α ) {\displaystyle s_{{\mathcal {A}},2}(n)=nL(n)+o{\big (}n^{1/4}\log(n)^{-1/2}L(n)^{\alpha }{\big )}} , where α = 3 / 4 {\displaystyle \alpha =3/4} if L ( x ) {\displaystyle L(x)} is bounded, and 1 / 4 {\displaystyle 1/4} otherwise. At the end of their paper, it is also remarked that it is possible to extend their method to obtain results considering n γ {\displaystyle n^{\gamma }} with γ ≠ 1 {\displaystyle \gamma \neq 1} , but such results are deemed as not sufficiently definitive.
See also Erdős–Tetali theorem: For any h ≥ 2 {\displaystyle h\geq 2} , there is a set A ⊆ N {\displaystyle {\mathcal {A}}\subseteq \mathbb {N} } which satisfies r A , h ( n ) = Θ ( log ( n ) ) {\displaystyle r_{{\mathcal {A}},h}(n)=\Theta (\log(n))} . (Existence of economical bases) Erdős–Turán conjecture on additive bases: If A ⊆ N {\displaystyle {\mathcal {A}}\subseteq \mathbb {N} } is an additive basis of order 2, then r A , 2 ( n ) ≠ O ( 1 ) {\displaystyle r_{{\mathcal {A}},2}(n)\neq O(1)} . (Bases cannot be too economical)
References
Further reading Newman, D. J. (1998). Analytic number theory. GTM. Vol. 177. New York: Springer. pp. 31–38. ISBN 0-387-98308-2. Halberstam, H.; Roth, K. F. (1983) [1966]. Sequences (2nd ed.). Berlin, New York: Springer-Verlag. ISBN 978-0-387-90801-4. MR 0210679.