C OMPOSITIO M ATHEMATICA
L. J. M ORDELL
On some arithmetical results in the geometry of numbers
Compositio Mathematica, tome 1 (1935), p. 248-253
<http://www.numdam.org/item?id=CM_1935__1__248_0>
© Foundation Compositio Mathematica, 1935, tous droits réservés.
L’accès aux archives de la revue « Compositio Mathematica » (http:
//http://www.compositio.nl/) implique l’accord avec les conditions gé- nérales d’utilisation (http://www.numdam.org/conditions). Toute utili- sation 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/
Numbers
by L. J. Mordell
Manchester
Let a function
f (x1,
312’ ...,xn ) ,
or sayf
forbrevity,
of the nvariables xi, X2, ...,
aen, be
defined for all real xl , x2 , ... , xn, , and have thefollowing properties:
(A).
For all real t > 0,where 5 >
0 is a constantindependent
of the x’sand t,
and thepositive
arithmetical valueof tÓ
is taken.where k > 0 is a constant
independent
of the x’s andy’s.
(C).
Thenumber, N,
of latticepoints,
thatis,
sets ofintegers
lti, , x 2 , - .. , xn, such that
where G > 0 is
sufficiently large,
satisfies theinequality
where J > 0 is
independent
of G.Then
integer
values of the x’s not all zero exist such that It may besupposed
in(C)
that N is finite for bounded G.When the
hypersolid S
definedby
has a volume V > 0,
(and
Minkowski has considered the249
question
of the existence of Vsubject
to conditions of thetype (A)
and(B)),
it is clearby taking hypercubes,
centresat the lattice
points
and sides oflength unity,
that as G ---> oo, Hence if G islarge, (5)
holds forJ V,
and then also for J = V. For onmaking
J ->V,
at least one and at most a finitenumber of sets of values of the x’s exist
satisfying (5).
Henceon
taking
the limit of both sides of(5),
it follows that for at least one of these sets,The last result is of a well known
type,
which in the caseô=k=l,
withslightly
different conditions was introducedby
Minkowski
1 )
into thetheory
of numbers in which it is knownto be of
great importance.
My proof
iscompletely
arithmetical and evensimpler
thanMinkowski’s
geometric proof.
It has itsorigin
in my2)
recentarithmetical demonstration of Minkowski’s theorem for linear
homogeneous
forms.It is an immediate consequence of the obvious fact that if M is any
positive integer,
there existsonly
Mn sets ofincongruent
residues for a set of n
integers
X1’ x2 , ..., xn. For thehypersolid,
will for
sufficiently large
g and M contain at leastMn+1
latticepoints.
From(4),
it suffices to take g such thator
For two of
these,
say the setsand
where X1’ x2 , ..., xn are
integers
whieh are not all zero.From
(B)
1 ) Geometrie der Zahlen (1910), 76.
2) Journal London Math. Soeiety 8 (1933), 179-182.
and so from
(11), (10), (1), (9)
This
gives (5)
withJ-r5/n replaced by
g.By making
g -J-r5/n ,
it is clear
by
theargument following (7),
that(5)
followsimmediately.
The
proof
shows that ifS,
instead ofbeing given by f (x,,
x2, ...,xn)
1, is definedby
any number ofinequalities, where c,.
is 0 or + 1, andeach f
satisfies(A), (B),
and(C)
with(3), (6) replaced by
respectively,
then(5), (8)
still hold.It is also clear that if
q($, y )
is a function of the real variablese, q satisfying
the conditionsfor t > 0, and
for
the condition
(B)
can bereplaced by
and then 2k in
(5), (8)
must bereplaced by tp(l, 1).
The conditions
(A), (B)
arereally
different from those of Minkowski. He assumes first that the solid S has a centre, i. e.,By including
in(12) inequalities
such as :1:XÔ
0,(e.
g., whenrt = 3, and ô is an odd
integer
> 0, theinequalities xâ
0,x2
0,xâ
0, mean that S will lie in oneoctant),
this is seennot to be necessary, but no
essentially
new results arise.He assumes next that the
hypersolid
S is convex, and thenproves that if a convex n dimensional solid has centre at the
origin 0,
and has avolume >
2n, then at least one latticepoint
in addition to O must lie within
S, i. e. ,
be an interior orboundary point
of S. Theconvexity
conditionreally
means that ifP, Q,
are two
points
withinS,
thenP + Q
lies within2S,
i.e. thepoint
whose coordinates are the sum of those of P and
Q
lies withinthe solid derived from S
by increasing
the coordinates of all itspoints
in the ratio 2 : 1.251
Suppose, however,
S is a semi-convexsolid,
thatis,
a constantk exists such that
P+ Q
lies withinkS,
sothat k >
2 is a sort ofmeasure of the lack of
convexity
of S. Then my theorem includes theresult,
that if S has a centre at 0 and a volume V >kn,
it contains within it at least one latticepoint
in addition to theorigin.
1give
theproof 3 )
ab initio.MS
If M is any
positive integer,
thehypersolid MS
has a volumek
and so as M - oo, N the number of lattice
points
withinsatisfies
if Tl > kn. Hence two of these lattice
points,
sayP, Q
will havecoordinates which are
unequal
andcongruent
mod M.Hence,
since P -Q Q Q
is P +’ where ’ Q’ is the image
is theimage
ofQ
in0, p M Q
is a lattice
point lying
withink (M) S
or S. This proves the result for V > kn. It follows for V = knby
theargument leading
to
(5).
My
form alsosimplifies
some of theapplications.
Thus take
then
(A ), (B)
are satisfied with ô= k = 1,
since alsotaken over
Thus if all the a’s are
real,
onputting
3 ) The theorem and method of proof still hold if S has no centre and
P - Q lies within kS.
then
Hence the well known
result,
where xl, x2 , ... , aen are
integers
not all zero.Again
suppose that p is anynumber >
1, and thatare any
given integers >
0 whose sum is n.Take
say,
etc.,
where eï
etc. denote thepositive
values.Then
(A), (B)
are satisfied with ô = p, h; =2P-1,
as is clearsince
Also
is
easily
evaluated for thegeneral
case ofcomplex
a’l’8 when in eachf, complex
linear forms occur inconjugate pairs.
When all the a’s are
real,
where
etc.
These are Dirichlet’s
integrals, whence
253
Hence
integer
values of the x’s not all zero exist such thatetc., where the coefficients of the linear
forms f,
are allreal, and oc, fJ, y,
... are anyintegers >
0, with sum n.When
ex. = n, p == y == ... = 0,
this becomes Minkowski’s resultThe
proof
of thisby
his theoremrequires
the consideration of and his now well knowninequality
for
positive
but which is not sosimple
asused above.
(Received, November 2nd, 1933.)