(Communicated at the meeting of April ) n n 6 (K) ~ 2-2 d (A)

Similar documents
IK"" f dxn. K in Rn is defined as a closed bounded point set containing the origin 0. Denote by

School of Mathematics and Statistics. MT5824 Topics in Groups. Problem Sheet I: Revision and Re-Activation

Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc.

Doubly Indexed Infinite Series

INDUCTION AND RECURSION. Lecture 7 - Ch. 4

I ƒii - [ Jj ƒ(*) \'dzj'.

MATH 326: RINGS AND MODULES STEFAN GILLE

2. THE EUCLIDEAN ALGORITHM More ring essentials

Hermite normal form: Computation and applications

Czechoslovak Mathematical Journal

0 Sets and Induction. Sets

On Weird and Pseudoperfect

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

Modeling and Stability Analysis of a Communication Network System

1 Differentiable manifolds and smooth maps. (Solutions)

Linear Algebra and its Applications

1 Differentiable manifolds and smooth maps. (Solutions)

A Gel fond type criterion in degree two

Mathematical Induction Assignments

STABILIZATION BY A DIAGONAL MATRIX

ELEMENTARY LINEAR ALGEBRA

64 P. ERDOS AND E. G. STRAUS It is possible that (1.1) has only a finite number of solutions for fixed t and variable k > 2, but we cannot prove this

THE UNIVERSITY OF TORONTO UNDERGRADUATE MATHEMATICS COMPETITION. Sunday, March 14, 2004 Time: hours No aids or calculators permitted.

ELEMENTARY LINEAR ALGEBRA

AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES

THE FIXED POINT PROPERTY FOR CONTINUA APPROXIMATED FROM WITHIN BY PEANO CONTINUA WITH THIS PROPERTY

A GENERALIZATION OF A THEOREM OF FENCHEL

Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some. Notation: b Fact: for all, b, c Z:

An Algebraic Interpretation of the Multiplicity Sequence of an Algebraic Branch

ANOTHER CLASS OF INVERTIBLE OPERATORS WITHOUT SQUARE ROOTS

NOTES ON INTEGERS. 1. Integers

PUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.

ON THE PARTITIONS OF A GROUP AND THE RESULTING CLASSIFICATION*

1. Algebra 1.7. Prime numbers

2. Linear recursions, different cases We discern amongst 5 different cases with respect to the behaviour of the series C(x) (see (. 3)). Let R be the

Upper Bounds for Partitions into k-th Powers Elementary Methods

(3) Let Y be a totally bounded subset of a metric space X. Then the closure Y of Y

EXISTENCE THEOREMS FOR SOLUTIONS OF DIFFERENTIAL EQUATIONS OF NON-INTEGRAL ORDER*

A proof of a partition conjecture of Bateman and Erdős

Algebra Ph.D. Entrance Exam Fall 2009 September 3, 2009

ON THE NUMBER OF POSITIVE INTEGERS LESS THAN x AND FREE OF PRIME DIVISORS GREATER THAN x e

8.5 Taylor Polynomials and Taylor Series

Sequences and Series of Functions

Induced subgraphs with many repeated degrees

INVERSES AND ZERO-DIVISORS

OH BOY! Story. N a r r a t iv e a n d o bj e c t s th ea t e r Fo r a l l a g e s, fr o m th e a ge of 9

A POSTULATIONAL CHARACTERIZATION OF STATISTICS

Convex Geometry. Otto-von-Guericke Universität Magdeburg. Applications of the Brascamp-Lieb and Barthe inequalities. Exercise 12.

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31

Introduction to Real Analysis Alternative Chapter 1

Integers With Digits 0 or 1

Years. Marketing without a plan is like navigating a maze; the solution is unclear.

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =

Algebra Review. Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor. June 15, 2001

Notation. 0,1,2,, 1 with addition and multiplication modulo

Introduction and Preliminaries

INTEGER ALGORITHMS TO SOLVE LINEAR EQUATIONS AND SYSTEMS

Section 5.8. Taylor Series

* 8 Groups, with Appendix containing Rings and Fields.

Convergence of sequences and series

Lattices and Hermite normal form

2. Let S stand for an increasing sequence of distinct positive integers In ;}

Problems and Solutions

1 Lecture 1 (1/5/2009)

1 Lecture 1 (1/5/2009)

Chapter 4. Measure Theory. 1. Measure Spaces

NATIONAL BOARD FOR HIGHER MATHEMATICS. Research Scholarships Screening Test. Saturday, January 20, Time Allowed: 150 Minutes Maximum Marks: 40

Reaching a Consensus in a Dynamically Changing Environment - Convergence Rates, Measurement Delays and Asynchronous Events

We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors

ON CONVERSE GAP THEOREMS

A L A BA M A L A W R E V IE W

THE SEMIGROUP βs APPLICATIONS TO RAMSEY THEORY

A NEW METHOD OF INVERSION OF THE LAPLACE TRANSFORM* ATHANASIOS PAPOULIS. Polytechnic Institute of Brooklyn

P. ERDÖS 2. We need several lemmas or the proo o the upper bound in (1). LEMMA 1. { d ( (k)) r 2 < x (log x)c5. This result is due to van der Corput*.

Parts Manual. EPIC II Critical Care Bed REF 2031

and ttuu ee 2 (logn loglogn) 1 J

I M P O R T A N T S A F E T Y I N S T R U C T I O N S W h e n u s i n g t h i s e l e c t r o n i c d e v i c e, b a s i c p r e c a u t i o n s s h o

Exercises on chapter 1

Part 3.3 Differentiation Taylor Polynomials

Groups. 3.1 Definition of a Group. Introduction. Definition 3.1 Group

P-adic Functions - Part 1

Topological properties

Beautiful Mathematics

12.1 Arithmetic Progression Geometric Progression General things about sequences

ON THE DENSITY OF SOME SEQUENCES OF INTEGERS P. ERDOS

Applications. More Counting Problems. Complexity of Algorithms

ON THE CORE OF A GRAPHf

Math 113 Homework 5. Bowei Liu, Chao Li. Fall 2013

Spheres with maximum inner diameter

Connections between connected topological spaces on the set of positive integers

Procedure for Measuring Swing Bearing Movement on 300 A Series Hydraulic Excavators {7063}

SOUTH AFRICAN TERTIARY MATHEMATICS OLYMPIAD

Chapter III. Stability of Linear Systems

Contribution of Problems

Chapter 1. Sets and Numbers

On certain generalizations of the Smarandache. function

2 ERDOS AND NATHANSON k > 2. Then there is a partition of the set of positive kth powers In k I n > } = A, u A Z such that Waring's problem holds inde

P a g e 5 1 of R e p o r t P B 4 / 0 9

Extreme points of compact convex sets

Transcription:

Mathematics. - On the minimum determinant of a special point set. By K. MAHLER (Manchester). (Communicated by Prof. J. G. VAN DER CORPUT.) *) (Communicated at the meeting of April 23. 1949.) In a preceding paper 1) C. A. ROG ERS proves the inequality n-1 1 1 1 2 1n 6 (K) ~ 2-2 d (A) for the successive minima 2 1, 2 2, 2n of an arbitrary point set K for a lattice A. In the present paper. I shall construct a point set for which this formula holds with the equality siun. I prove. moreover. that there exist bounded star bodies for which the quotient of the two sides of ROGERS's n-i inequality approaches arbitrarily near to 1. The constant 2-2 - of ROGERS is therefore best~possible. ev,en in th.e very specialized case of a bounded star body. 1 ) Let ~n be the n~dimensional Euclidean space of all points X = (xl' X2 Xn) with rea 1 coordinates. For k = 1. 2... n. denote by Tk the set of all points with integral coordinates satisfying 2) Uk ~O. (UI. U2.... Uk. O... 0) and by Ck the set of all points n-k X = tp. wh ere t :> 2-ṉ and PeTk. Further write for the union of Cl' C 2 Cn and C = Cl U C 2 U... U C n K=~n-C for the set of all points in ~n which do not belong to C. AlthouUh K is not a bounded set. it is of the finite type. For the lattice..1 0 consisting of the points (2U1' 2U2.... 2Un-1' Un). *) This article has been sent to J. G. VAN DER CORPUT on February 12. 1949. 1) C. A. ROOERS. The product of the minima and the determinant of a set. These Proceedings 52. 256-263 (1949). 2) gcd(gl. g2... Bd means the greatest comman divisor of gl. B2.... Bk. and similarly in other cases.

634 where UI' U2... Un run over all integers. is evidently K~admissible. l::j. (K) ~ d(a,) = 2 n - 1 OUt' aim is to find the exact value of L. (K). and so (1) 2) The origin 0 = (0. O... 0) is an inner point of K. and K is of the fini te type; therefore 3) K possesses at least one critical lattice; the lattice A say. By (1). d(a) ~ 2 n - l (2) For k = 1. 2... n. let fl k be the parallelepiped ~ < 1 if 1 ~ h ~ n. h ~ k: I Xh I ( ~ 2n-1 if h = k. By (2) and by MINKOWSKl'S theorem on linear forms. each parallelepiped flk contains a point Qk =!= 0 of A. Since A is K~admissible. and from the definition of K. this point belongs to C; hence only the k~th coordinate of Qt. 'YJk say. is different from zero and may be assumed positive: The point Qk = (0.. 'Y/k.. 0). where 'YJk > O... (3) Q = QI + Q2 +... + Qn = ('YJI' 'YJ2... 'YJn) also belongs to A and therefore to C. Since 'YJn > O. Q necessarily lies in Cn. From the definition of this set. there exist th en a positive number 'YJ and n positive integers ql. q2... qn such that 3) The n lattice points 'Y/k='YJqk (k = 1.2... n). QI' Q2... Qn do not necessarily form a basis of A; they are. however. linearly in~ dependent. and so they generate a sublattice of A. Hence there exists a fixed positive integer. q say. such that every point P of A can be written in the form P=! Ipl al + Pl al +... + pn ani = (!L PI ql.!l P2 q2!l pn qn) q q q q with integral coefficients Pl' P2... pn depending on P. For shortness. put ~ =!L. 50 that ~ > 0. q (4). (5) By MINKOWSKI' s method of reduction 4). we can now select a basis Pl' P 2... Pn 3) See my paper. On the critical lattices of an arbitrary point set. Canadian Journal of Mathematics. I (1949). 78-87. 4) Geometrie der Zahlen (1910). 46.

635 of A sueh that eaeh basis point Pk. where k = 1. 2... n. is a linear combination of Q1' Q2... Qk. henee of the form wh ere Pk = (~Pkl. ~Pk2 ~Pkk. 0... 0) Pkl. Pk2 Pkk are integers. and Pkk > 0 It may. moreover. be assumed that 0::::; Pkl < Pil for all pairs of indices k. I satisfying 1::::; k < I ~ n. (8) 4) Lemma: Let n Lh (x) =.2 ahk Xk (h = 1. 2... m) k=1 be m linear farms in n variables Xl' X2'... Xn. with integral coefficients ah not all z era. Denate by a = gcd ahk the greatest cam man divisar of these coefficients. and by L(x) = gcd Lh(X) the greatjest comman divisar of the numbers Lh (x). wh~re h = 1. 2... m. Th'e,n thereexist intefj.ers Xl' X2'... Xn such that L(x) = a. Pro of: By the theory of elementary divisors 5). two integral uni~ modular square matrices (bgh) and (Ckt) of m 2 and n 2 elements. respectively. can be found su eh that the product matrix = (dgl) say. of mn elements is a diagonal matrix. viz. Put and sa that n Xk=.2CkIXt. 1=1 dgl = 0 if g::j= l. r = min (m. n) m Lg (x') =.2 bgh Lh (x). h=1 (6) (7) Then evidently a = gcd (dh' d 22.... d,,) 5) See e.g. B. L. VAN DER WAERDEN. Moderne Algebra. Vol. 2 (1931). 106.

and 636 L (x) = gcd Lg (x') = gcd(dll X;. d 22 X;.. d rr x~). and the assertion follows on putting x; =x; =... =x~= 1. 5) Every point P of A can be written as P = XlPl + X2P2 +... + XnPn with integral coefficients Xl' X2.. Xn. Therefore P has the coordinates where. for shortness. P = (~ Ldx). ~ L2 (x) ~ Ln (x)). (9) n Lh (x) = I Pgh Xg (h = 1. 2... n).... (10) g=h Let now dt. for k = 1. 2... n. be the greatest common divisor of the coefficients pgh with 1::= h <: g <: k. From this definition. it is obvious that dk is divisible by dk+l for k = 1. 2... n-1.... (11) Since the matrix of the n forms Ldx). L 2 (x).... Ln(x) is triangular. dt mayalso be defined as the greatest common divisor of the coefficients of in the forms Ldx). L 2 (x)... Lt(x). It follows therefore. for k = 1. 2... n. from the lemma in -4) that there exist integers Xkl. Xk2... Xkk not all zero such th at the greatest common divisor of the k numbers is equal to dk. The point k ghk = I Pgh Xkg g=h (h = 1. 2... k) Rk = Xkl PI + Xk2 P 2 +... + Xkk Pk =f 0 belongs to A and has the coordinates Rk = (~glk. ~ g2k... ~ gkk. O.. 0) which are not all zero and satisfy the equation gcd (glk. g2k.. gkk) = dk. (14) Since Rt is not an inner point of K. it belongs to one of the sets Cl' C 2... Ct. We conclude therefore. from the definition of these sets. that (12) (13) (k = 1. 2... n).... (15)

637 6) Next let 1; be the positive real number for which n-k 1; min 2- -n- dk = 1. whence 0 < 1; ~~. (16) k=1,2,...,n! >-2 for k = 1, 2... n, n 1; d :::.- k n - )I. = 2- ṉ for k = ". There is then an index" with 1 -< " -< n such that l n-k From these formulae (17) : Hence. if k < ". th en n-k ~- k dk :;:: 1;-1 2 n = 2 n dx (k = 1. 2... n).. (17) whence. by (11). dk:;:: 2 d x H. however. k :> ". then and (11) implies now that for k=1.2... x-l..... (18) 'Y., - n dk :;:: 2 n d~ > -Ir d, for k = x. x + 1.... n...... (19) On combining (18) and (19). we obtain the further inequality. ~n dl d 2 dn :;:: 1;n dl d 2 dn :;:: 2' -1 (?;dx)n = 2 n - l, (20) 7) The critical lattice A we have been considering. has the basis Pl' P 2 Pn of the form (6). lts determinant is therefore d (A) = ~n PIl P22. pnn..... (21) since all factors on the right-hand side of this equation are positive. Fram the definition of dk. Pkk is divisible by d k Hence by (20) and (21). whence d (A) :;:: ~n dl d 2 dn :;:: 2 n - 1 for k = I, 2,..., n.... (22) II (K):;:: 2 n - l. (23) The same right-hand si de was. by (1). also a lower bound of f::. (K) ; hence the final result is obtained. II (K) = 2 n - l... (A)

638 8) By means of the last formulae. all critical lattices of K can be obtained as follows. It is clear. from the previous discussion. that to any critical lattice A. there is a unique index x with 1 <: x :::::; n such that and th at further dk= ~ 2 d. for k = 1. 2... x-i. ~ dx for k = x. x + 1.... n. c=~.... Pil = dl' P22 = d2 pnn = dn ;.... (21) for otherwise d(a) would be larger than 2 n - l. Since we may. if necessary. replace ~ by d,,~. there is no loss of generality in assuming that whence. by (17): (25) (26) dx = 1........... (27) n-~ The basis points Pl' P 2... Pn become. ~ = 2 n. (28) P k = (2n~< Pkl. 2n~x Pk2... 2n~, Pkk. 0... 0) with integral pkl. By (7). (8). and (21)-(28). moreover and ~ 2 if k = 1. 2... x-i. ~ Pkk = 1 'f k - + 1.. (29) 1 - >e, ~, t n, l l 0 if 1 ::::;; 1 < k ::::;; " - 1. Pkl = 0 if,,::::;; 1 < k::::;; n.. o or 1 if,,::::;; k ::::;; n. 1 ::::;; 1 ::::;;,,- 1.... (30) It is also clear that different choices of " and of the integers pkl lead to different critical lattices. Since for exactly (x-i) (n-x + 1) coefficients pkl there is the alternative pkl = 0 or 1. there are then for each x just 2(X-1) (n-x+l) different critical lattices. We find therefore. on summing over x. that the total number N (n) of different critical lattices of K is given by the formula n N (n) = :2 2(H) (n-<+l). (8) x=l Thus N(n) = 3.9.33.161.1089... for n = 2.3. 1.5.6...

639 9) We next det;ermine the successive minima )'1' )'2'... )'n of K in the lattice Al of all points with integral coordinates. Denote by )K. for ). > O. the set of all points ),X where X belongs to K. The first minimum )'1 of K for Al is defined as the lower bound of all l> 0 sueh that lk eontains a point of Al different from 0; if further k = 2. 3... n. th en the n~th minimum )'k of K for Al is defined as the lower bound of all ), > 0 su eh that )X eontains k linearly independent points of An. We find these minima as follows. Consider an arbitrary point P = (g1' g2'... gn) ~ 0 of Al; here g1. g2.... gn are integers. Put and assume. say. th at d = gcd (gl. g"2'... gn). so that d:> 1. gk =f O. but gk+t =... = gn = O. for some integer k with 1 <: k <: n. Then Pld belongs to Tk. and tp belongs to Ck if and only if n-k t~ 2- n- d- t Therefore )K. for ). > O. eontains P if. and only if. We deduee that if l:::;; 2 n-t -- n then A.K eontains no lattiee point exeept 0 ; if. however. n-k n-k-t 2- - n-< l:::;; 2--n- (31) where k = 1. 2... n. then )X eontains just the points of the k sets Tl' T 2. Tk. Hence. if (31) holds. then J.K eontains k. and not more. linearly inde~ pendent points of Al' The sueeessive minima of K for Al are therefore given by the equations. By (A). this implies that n-k - - lk=2 n (k = 1.2... n). (32) _,; n-k n-t n-t J. t J. 2... l n 6(K)=2 k=t n 2n-t=2 2 =2 2 d(a t ).. (C) We have thus proved that in the special case of the point set K and the

640 lattice Al' the sign of equality holds in ROGERS's inequality [or the suc~ssive minima of a point set 6). 10) The point setk is neither bounded nor a star body. It can, however, be approximated by a bounded star body of nearly the same minimum determinant and with the same successive minima, as follows. Let e be a small positive number. IE X is any point different from 0, then denote by S.(X) the open set consisting of all points tx + e(t-i)y where t runs over all numbers with t> 1, and Y runs over all points of the open unit sphere IYI<I; evidently S.(X) is a cone open towards infinity with vertex at X and axis on the line through and X. Let further S. be the closed sphere of radius 1/ e which consists of all points Z satisfying I Z I:::: I/e. We now define K. as the set of all those points of K which belong to S. but to none of the cones n-k ) ( St 2- ṉ X. wh ere Xer k and k = 1.2.. n. Since only a finite number of the cones contains points of S. it is clear that K. is a bounded star body. Let À;. À2. À~ be the successive minima of K. for A. Since K. is a subset of K. necessarily (k = 1. 2... n). We can in the present case replace these inequalities immediately by the equations À"=).k because the n boundary points ( n- l ) (n-2 ) (k = 1. 2... n) i/i. O... 0. O. i/i.... 0... (0. 0... 1). in which the successive minima of K for Al are attained. are still boundary points of K. provided e is sufficiently small. 11 ) We further show that 6) Sec l.c. 1). (33) lim 6. (K.) = 6. (K). (34).~o

641 Let this equation be false. There exists then a sequence of positive numbers tending to zero such that exists. but is different from 6. (K). But then lim 6 (Kt r) < 6 (K), r-+ a>. (35) sin ce each K. r is a subset of K. As a bounded star body. each K. r possesses at least one critical lattice. Ar say; by the last formula. it may be assumed that (r = 1. 2, 3,... ). Moreover, all sets K. r contain a fixed neighbourhood of the origin 0 as subset. The sequence of lattices Al' A 2 A3,... is therefore bounded. and so. on possibly replacing this sequence by a suitable infinite subsequence. we may assume that the lattices Ar tend to a limiting lattice, A say. By (35), d (A) = lim d (Ar) = lim 6 (Ke r ) < 6 (K),. r-+a> r-+a>. (36) and therefore A cannot be K-admissible. Hence there exists a point P =j:- 0 of A which is an inner point of K. This means that p, for sufficiently small E> O. is also an inner point of K. We can now select in each lattice Ar a point Pr =j:- 0 such that the sequence of points Pl' P 2 P 3. tends to P. Hence. for any fixed sufficiently small E> O. all but a fini te number of these points are inner points of K. Now. since Er > Er+I, each star body K. r is contained in all the following bodies K ' r+1' K ' r+2' K ' r+3'... Therefore. when ris sufficiently large. then the point Pr is an inner point of K. r' contrary to the hypothesis that Ar is a critical. hence also an admissible lattice of K Er' This concludes the proof of (34). 12) The two formulae (33) and (34) imply that n -1 lim ).'1 ),~, À~ 6 (K,) = 2 2 d (Al) ' e -+ 0 Hence if d> 0 is an arbitrarily small number, th en there exists a positive

642 number E such that the successive minima 1;.l;... 1~ inequality. n-i 1; 12 1~ 6. (K.) > (1-<5) 2 2 d(a.). where Al is the lattice of all points with integral coordinates. n-. of K. satisfy the We have therefore proved that the constant 2-2 - in ROGERS's inequality is best-possible even lor bounded star bodies. This is very surprising as this inequality applies to general sets. December 15, 1948. Mathematics Department, Manchester University. Postscript (May 16, 1949): In a no te in the c.r. de l' Academie des Sciences (Paris), 228 (March 7,1949),796-797, Ch. Chabauty announces the main result of this paper, but does not give a detailed proof.