R ENDICONTI
del
S EMINARIO M ATEMATICO
della
U NIVERSITÀ DI P ADOVA
W ERNER G EORG N OWAK
An Ω
+-estimate for the number of lattice points in a sphere
Rendiconti del Seminario Matematico della Università di Padova, tome 73 (1985), p. 31-40
<http://www.numdam.org/item?id=RSMUP_1985__73__31_0>
© Rendiconti del Seminario Matematico della Università di Padova, 1985, tous droits réservés.
L’accès aux archives de la revue « Rendiconti del Seminario Matematico della Università di Padova » (http://rendiconti.math.unipd.it/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/conditions).
Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit conte- nir la présente mention de copyright.
Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques
http://www.numdam.org/
An 03A9+-Estimate for the Number of Lattice Points in
aSphere.
WERNER GEORG NOWAK
(*)
Let
A( T)
be the number of latticepoints
in thesphere x2 --E- y2
+ + z2 T, then it is the purpose of thepresent
paper to prove that(log, denoting
the k-fold iteratedlogarithm).
This is doneby
a methoddue to K. S.
Gangadharan
[7] on the basis of anexplicit
formula ofP. T. Bateman [1].
1. Introduction.
Denote
by
the number oftriples (u,
v,w)
E Z3satisfying
u2
+
1]2+
w2 = n, then it is theobjective
of thepresent
paper to establish a result on the behaviour of the « lattice rest»for T -~ oo .
Concerning
the0-problem,
it has beenproved by
I. M.Vinogradov ([14J
and[15],
p. 29f )
thatP(T)
=O(Tf(log T)c)
forsome absolute constant c.
(Vinogradov
gave the value c = 6 which(*)
Indirizzo dell’A.: Institut für Mathematik der Universitat für Boden- kultur,Gregor
Mendel-StraBe 33, A-1180 Vienna, Austria.can be
readily improved
at least to c =2 ;
Chen J. R.[4]
stated this result even with c =0.)
In the other
direction,
y G.Szegô [13]
showed thatapparently
the best result of that kind to date. On theopposite
sideK. Chandrasekharan and R. Narasimhan
[3] proved
thatIn this paper we are
going
to establish a refinement of this lastresult,
i.e. we prove the
following
estimate.THEOREM. For T -~ 00 me have
where
logk
denotes thek- f old
iteratedlogarithm.
REMARKS. We
employ
the methoddeveloped by
K. S.Ganga-
dharan
[7]
for the divisor and the circleproblem,
the essentialdifficulty
(due
to the somewhat «irregular»
behaviour ofr3(n)) being
surmountedby
the lemma on page 6(the proof
of which is based on theexplicit
formula
(17)
forr3(n) ) .
Infact,
there are numerous contributions to the literature(see
thereferences)
which containinvestigations analogous
to the
part
of ourargument leading
from our lemma to(3),
most ofthem
involving generating
functions(-in
our case this would beEpstein’s zeta-function )
whichsatisfy
a certain functionalequation
due to Chandrasekharan and Narasimhan.
However, apparently
noneof this results can be
applied directly (i.e.
without thenecessity
toget
rid of some condition which is not satisfied in our
case)
to infer(3)
from our lemma. So we
prefer
togive
anargument
assimple
and self-contained as desirable which avoids the use of
generating
functions.2.
[Notation
and otherpreliminaries.
Throughout
the whole paper, n and m arenonnegative integers, q
resp. qj denotes
square-free integers
and p denotesprimes. X
is a(large)
realvariable, qj
are thesquare-free positive integers
not exceed-33
ing
X(1 j N = N(~)~. C+
is thehalf-plane
of allcomplex
numbers with a
positive
realpart.
LetT(u)
bev
any
trigonometric polynomial
andH(s)
ananalytic
function onC+,
then we define for a > 0
We further
put (for
realoc)
and
where
is the
complex conjugate
of 7: runsthrough
an index set ofcardinality
C3x,
the coefficientsbr
are of modulus 1 and the numbers(JT
have thefollowing property
relevant for later purposes. If we definethen
Ivln:1:
for all i andNo. Moreover, putting
we note that
Gangadharan [7]
hasproved
thatfor
sufficiently large X
with somepositive
constants a andb(b > 2).
Hence
for each r and any n G
No.
Wefinally
remark that it follows from theabove in a
straightforward
manner that(for or
> 0 and ~, >0)
where = cr-A and the 0-constant is an absolute one.
(This
willbe the case for all 0- and «-constants
throughout
the wholepaper.)
3. Proo£ of the theorem.
3.1. Foru > 0 we define
P(’U)
=~-~(JP(~~) 2013 l)y
thenPo
= supW(u)
(taken
over all u >0)
is a finitepositive
number for 1 8 3.(If
this were not true for some 8 >
1,
astronger
estimate than our theorem would followimmediately.)
We furtherput P(u2) + 1,
then
0,
and we obtain forarbitrary s
EC+
where
and
35
It follows from
(9)
that(for J
>0)
In this formula we now
put (for
alarge parameter X)
(with
a suitablelarge
absolute constantA)
andproceed
to establishasymptotic
evaluations of the terms on theright
side of(10).
To thisend we first infer from
(9’)
that(For
aproof
cf. theanalogue
treatedby
G. H.Hardy [9],
p.266.)
From this the
following
two assertions are easy consequences(see
lemma 1 and 2 of
Gangadharan [7]
fordetails~ :
From this we obtain an
asymptotic expansion
for the second term onthe
right
side of(10) :
PROPOSITION :
PROOF.
Recalling (5),
we first note thatApplying (I) (with
obtain
and the same
argument
holds forT.11. Finally
we infer from(II)
(with
c =3JtXf, ro
==2x exp (- q(X)~,
in view of(7))
that(because
of(6))
whichcompletes
theproof
of ourproposition.
Next we obtain as an immediate consequence of
(8)
and(11)
that(for
X -oo)
and
Entering
this and the aboveproposition
into(10)
andnoting
that.T’(1-f- 8(X))
=1-f- o(1)
weget
(since, by definition,
andTx(u)
are > 0 for every u >0).
3.2. We are now
going
to establish the essentialauxiliary
result ofthe whole
argument:
37
PROOF.
Suppose
that n # 0(mod 4)
and write n =m2 q (q
square-free),
then on - 1(mod 2 ),
hence m2 « 1(mod 8)
and therefore n _--_- q(mod 8).
We make use of thefollowing explicit
formula forr3(n)
dueto P. T. Bateman
[1],
p. 99:where
(b denoting
thelargest integer
such that n = 0(mod p2b), (oeffl) being
Jacobi’s
symbol
for and 0otherwise) ; z(n) = 0
if(mod 8), X(n)
= 1 if(mod 8)
andy(n) = 2
otherwise.According
to E. Landau[11],
p.219,
we have(noting
that Landau’sproof
holds also without the somewhat morerestrictive
concept
of a « fundamentaldiscriminant»);
here isEuler’s function.
Since
obviously
we conclude from
(17), (18)
and(19)
thatSummation
by parts yields
hence, noting
thatr3(4k)
=r3(k),
we infer thatTherefore, by (20),
weget
Observing
thatwe
complete
theproof
of the lemma.3.3. In view of the result
just
obtained we infer from(16)
thatthere exists a
positive
absolute constant C suchthat,
forsufficiently large X,
Writing L(X)
=X"(log X)-l
forshort,
we concludethat,
for eachsufficiently large .X,
there exists a real numbersatisfying
and that
necessarily u(X) -
oo for ~ --~ 00. We nowput v(X)
=-
(thus v(X) > 1)
andobtain, noting
that in-creases for
large x,
Let
Qw
denote the inverse function andput Wg
= max{1,
2log v(X)}
then we infer from the above that
Q-1(2 log XWg. Using
39
this and
(23)
we conclude that(for large X)
Since
(as
notedearlier) ~(X) -~
oo we have thusproved
thatInfering (e.g. by
del’Hôpital’s rule)
from the definition ofQ(x)
in(6)
that
(log b)-ilog y log2 y,
we obtain the assertion of ourtheorem.
REFERENCES
[1] P. T. BATEMAN, On the
representation of
a number as the sumof
threesquares, Trans. Amer. Math. Soc., 71
(1951),
pp. 70-101.[2] B. C. BERNDT, On the average order
of
a classof
arithmeticalfunctions
I, II,J. Number
Theory,
3 (1971), pp. 184-203 and 288-305.[3]
K. CHANDRASEKHARAN - R. NARASIMHAN, Hecke’sfunctional equation
and the average order
of
arithmeticalfunctions,
Acta Arith., 6(1961),
pp. 487-503.
[4] J. R. CHEN, The
lattice points in a
circle, Chin. Math., 4(1963),
pp. 322-339.[5] K. CORRÁDI - I. KÁTAI, A comment on K. S.
Gangadharan’s
paper en- titled « Two classical latticepoint problems» (in Hungarian), Magyar.
Tud. Akad. Mat. Fiz. Oszt. Közl., 17
(1967),
pp. 89-97.[6] F. FRICKER,
Einführung in
dieGitterpunktlehre,
Basel, Boston,Suttgart:
Birkhäuser, 1982.
[7] K. S. GANGADHARAN, Two
classical lattice point problems,
Proc.Cambridge,
57(1961),
pp. 699-721.[8] J. L. HAFNER, On the average order
of
a classof
arithmeticalfunctions,
J. Number
Theory,
15(1982),
pp. 36-76.[9] G. H. HARDY, On the
expression of
a number as the sumof
two squares, Quart. J. Math., 46(1915),
pp. 263-283.[10] S. KANEMITSU, Some results in the divisor
problems,
to appear.[11]
E. LANDAU,Elementary
numbertheory,
2nd ed., New York, Chelsea Publ.Co., 1955.
[12] D. REDMOND,
Omega
theoremsfor
a classof
Dirichlet series,Rocky
Mt.J. Math., 9
(1979),
pp. 733-748.[13] G. SZEGÖ,
Beiträge
zur Theorie derLaguerreschen Polynome,
II: Zahlen- theoretischeAnwendungen,
Math. Z., 25(1926),
pp. 388-404.[14] 1. M. VINOGRADOV, On the number
of
latticepoints
in asphere (in Russian),
Izv. Akad. Nauk.
SSSR
Ser. Mat., 27(1963),
pp. 957-968.[15]
1. M. VINOGRADOV,Special
variantsof
the methodof trigonometric
sums(in Russian),
Moscow, Nauka, 1976.Manoscritto
pervenuto
in redazione il 23 settembre 1983 eparzialmente
modificato il 7 febbraio 1984.