DOCSLIB.ORG

Exercises for Geometry of Numbers Week 8: 01.05.2020

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Exercises for Geometry of Numbers Week 8: 01.05.2020 EXERCISES FOR GEOMETRY OF NUMBERS WEEK 8: 01.05.2020 Exercise 1. 1. Consider all the intervals of the form [a2t; (a + 1)2t] with a; t non- ∗ negative integers. For s 2 N , let Ls be the collection of such intervals with t ≤ s − 1 s s contained in [0; 2 ]. Show that for any k 2 N with k ≤ 2 , the interval [0; k] can be covered by at most s elements of Ls. 2. Let F : [0; 1] × (0; 1) be a bounded measurable function and suppose that there exists c > 0 such that for every interval (a; b) ⊂ (0; 1), we have Z 1 Z b 2 F (x; t)dt dx ≤ c(b − a): 0 a Show that 2 X Z 1 Z F (x; t)dt dx ≤ cs2s: 0 I I2Ls ∗ 3. Fix > 0. Show that for every s 2 N , there exists a measurable set As ⊂ [0; 1] such −1−" 1 s that jAsj = O(s ) and for every y2 = As and for every k 2 N with k ≤ 2 , we have Z k s 3 + j F (t; y)dtj ≤ 2 2 s 2 : 0 4. Deduce from 3. 2 that for a.e. y 2 [0; 1], we have Z T 1 − 1 3 j F (y; t)dtj = O(T 2 log(T ) 2 ) T 0 Although the arithmetic functions are not the main focus of the course, the next two exercises touch upon those and aim at proving the arithmetic estimate used in Schmidt's a.s. counting theorem. Exercise 2 (Moebius inversion). A natural number n 2 N is called square-free if no ∗ square of a prime divides n. Recall that the Moebius function µ : N ! C is defined as µ(n) = 0 if n is not square-free, µ(n) = 1 if n has an even number of prime divisors and µ(n) = −1 if n has an odd number of prime divisors. 1. Show that µ is multiplicative (i.e. if d1; d2 are relatively prime then µ(d1d2) = µ(d1)µ(d2)) and X X µ(d) = 1 if n = 1 and µ(d) = 0 if n > 1 djn djn ∗ 2. On the set of arithmetic functions (i.e. functions N ! C), define the operation ∗ by setting X (f ∗ g)(n) = f(d)g(n=d): djn 1 Hint: see the construction of the set Bs in the proof of Schmidt's theorem in lecture notes 2As usual, if you cannot show what is required in step n of the exercise, you are encouraged to use the result of n in the consideration of the step n + k, k ≥ 1. 1 2 EXERCISES FOR GEOMETRY OF NUMBERS WEEK 8: 01.05.2020 Show that ∗ is a commutative and associative operation. 3. Let be the arithmetic function defined by (1) = 1 and (n) = 0 for every n > 1. Show that it is an identity element, i.e. ∗ f = f for every arithmetic function f. P 4. Using 1., 2. and 3. deduce the Moebius inversion formula: if g(n) = djn f(d), then P f(n) = djn µ(d)g(n=d). Exercise 3 (Proving the arithmetic estimate used in Schmidt's a.s. counting theorem). All symbols in this exercise stand for positive integers. Recall that we denote by '(k; q) the number of n ≤ q such that (n; q) ≤ k, where (n; q) stands for the greatest common divisor. 1. Show that X q '(k; q) = '( ): w w≤k wjq P 3 2. Show that n = djn '(d) where ' is Euler's totient function. P −1 3. Using 2. and Moebius inversion formula, show that '(x) = x yjx µ(y)y . 4. Deduce that b v c v minfk;vg bv=wc yw X X X X '(k; q)q−1 = w−1 µ(y)y−1 1: q=1 w=1 y=1 q=1 5. Deduce 4 v minfk;vg bv=wc X X X '(k; q)q−1 = v w−2 µ(y)y−2 + O(log v log k): (1) q=1 w=1 y=1 P −2 −1 6. Using the fact that y≥1 µ(y)y = ζ(2) , conclude that (1) is equal to minfk;vg minfk;vg X X v w−2ζ(2)−1 + O( w−1) + O(log v log k) w=1 w=1 which in turn is equal to v + O(vk−1 + log v log k): 3Hint: it suffices to treat the prime numbers, and prove that ' is multiplicative in the same sense as in the previous exercise. To show multiplicativity, one can use Chinese remainder theorem or prove that if r1 rs Qs 1 n = p : : : ps , then '(n) = n (n − ) 1 k=1 pk 4 Px 1 Recall that y=1 y = O(log x).
Load more

Recommended publications
  • Minkowski's Geometry of Numbers
    Geometry of numbers MAT4250 — Høst 2013 Minkowski’s geometry of numbers Preliminary version. Version +2✏ — 31. oktober 2013 klokken 12:04 1 Lattices Let V be a real vector space of dimension n.Byalattice L in V we mean a discrete, additive subgroup. We say that L is a full lattice if it spans V .Ofcourse,anylattice is a full lattice in the subspace it spans. The lattice L is discrete in the induced topology, meaning that for any point x L 2 there is an open subset U of V whose intersection with L is just x.Forthesubgroup L to be discrete it is sufficient that this holds for the origin, i.e., that there is an open neigbourhood U about 0 with U L = 0 .Indeed,ifx L,thenthetranslate \ { } 2 U 0 = U + x is open and intersects L in the set x . { } Aoftenusefulpropertyofalatticeisthatithasonlyfinitelymanypointsinany bounded subset of V .Toseethis,letS V be a bounded set and assume that L S is ✓ \ infinite. One may then pick a sequence xn of different elements from L S.SinceS { } \ is bounded, its closure is compact and xn has a subsequence that converges, say to { } x. Then x is an accumulation point in L;everyneigbourhoodcontainselementsfrom L distinct from x. The lattice associated to a basis If = v1,...,vn is any basis for V ,onemayconsiderthesubgroupL = Zvi of B { } B i V consisting of all linear combinations of the vi’s with integral coefficients. Clearly L P B is a discrete subspace of V ;IfonetakesU to be an open ball centered at the origin and having radius less than mini vi ,thenU L = 0 .HenceL is a full lattice in k k \ { } B V .
    [Show full text]
  • Chapter 2 Geometry of Numbers
    Chapter 2 Geometry of numbers Literature: W.M. Schmidt, Diophantine approximation, Lecture Notes in Mathematics 785, Springer Verlag 1980, Chap.II, xx1,2, Chap. IV, x1 J.W.S. Cassels, An Introduction to the Geometry of Numbers, Springer Verlag 1997, Classics in Mathematics series, reprint of the 1971 edition C.L. Siegel, Lectures on the Geometry of Numbers, Springer Verlag 1989 2.1 Introduction Geometry of numbers is concerned with the study of lattice points in certain bodies n in R , where n > 2. We discuss Minkowski's theorems on lattice points in central symmetric convex bodies. In this introduction we give the necessary definitions. Lattices. A (full) lattice in Rn is an additive group L = fz1v1 + ··· + znvn : z1; : : : ; zn 2 Zg n where fv1;:::; vng is a basis of R , i.e., fv1;:::; vng is linearly independent. We call fv1;:::; vng a basis of L. The determinant of L is defined by d(L) := j det(v1;:::; vn)j; that is, the absolute value of the determinant of the matrix with columns v1;:::; vn. 7 We show that the determinant of a lattice does not depend on the choice of the basis. Recall that GL(n; Z) is the multiplicative group of n×n-matrices with entries in Z and determinant ±1. Lemma 2.1. Let L be a lattice, and fv1;:::; vng, fw1;:::; wng two bases of L. Then there is a matrix U = (uij) 2 GL(n; Z) such that n X (2.1) wi = uijvj for i = 1; : : : ; n: j=1 Consequently, j det(v1;:::; vn)j = j det(w1;:::; wn)j.
    [Show full text]
  • Introductory Number Theory Course No
    Introductory Number Theory Course No. 100 331 Spring 2006 Michael Stoll Contents 1. Very Basic Remarks 2 2. Divisibility 2 3. The Euclidean Algorithm 2 4. Prime Numbers and Unique Factorization 4 5. Congruences 5 6. Coprime Integers and Multiplicative Inverses 6 7. The Chinese Remainder Theorem 9 8. Fermat’s and Euler’s Theorems 10 × n × 9. Structure of Fp and (Z/p Z) 12 10. The RSA Cryptosystem 13 11. Discrete Logarithms 15 12. Quadratic Residues 17 13. Quadratic Reciprocity 18 14. Another Proof of Quadratic Reciprocity 23 15. Sums of Squares 24 16. Geometry of Numbers 27 17. Ternary Quadratic Forms 30 18. Legendre’s Theorem 32 19. p-adic Numbers 35 20. The Hilbert Norm Residue Symbol 40 21. Pell’s Equation and Continued Fractions 43 22. Elliptic Curves 50 23. Primes in arithmetic progressions 66 24. The Prime Number Theorem 75 References 80 2 1. Very Basic Remarks The following properties of the integers Z are fundamental. (1) Z is an integral domain (i.e., a commutative ring such that ab = 0 implies a = 0 or b = 0). (2) Z≥0 is well-ordered: every nonempty set of nonnegative integers has a smallest element. (3) Z satisfies the Archimedean Principle: if n > 0, then for every m ∈ Z, there is k ∈ Z such that kn > m. 2. Divisibility 2.1. Definition. Let a, b be integers. We say that “a divides b”, written a | b , if there is an integer c such that b = ac. In this case, we also say that “a is a divisor of b” or that “b is a multiple of a”.
    [Show full text]
  • Artin L-Functions and Arithmetic Equivalence (Evan Dummit, September 2013)
    Artin L-Functions and Arithmetic Equivalence (Evan Dummit, September 2013) 1 Intro • This is a prep talk for Guillermo Mantilla-Soler's talk. • There are approximately 3 parts of this talk: ◦ First, I will talk about Artin L-functions (with some examples you should know) and in particular try to explain very vaguely what local root numbers are. This portion is adapted from Neukirch and Rohrlich. ◦ Second, I will do a bit of geometry of numbers and talk about quadratic forms and lattices. ◦ Finally, I will talk about arithmetic equivalence and try to give some of the broader context for Guillermo's results (adapted mostly from his preprints). • Just to give the avor of things, here is the theorem Guillermo will probably be talking about: ◦ Theorem (Mantilla-Soler): Let K; L be two non-totally-real, tamely ramied number elds of the same discriminant and signature. Then the integral trace forms of K and L are isometric if and only if for all odd primes p dividing disc(K) the p-local root numbers of ρK and ρL coincide. 2 Artin L-Functions and Root Numbers • Let L=K be a Galois extension of number elds with Galois group G, and ρ be a complex representation of G, which we think of as ρ : G ! GL(V ). • Let p be a prime of K, Pjp a prime of L above p, with kL = OL=P and kK = OK =p the corresponding residue elds, and also let GP and IP be the decomposition and inertia groups of P above p. ∼ • By standard things, the group GP=IP = G(kL=kK ) is generated by the Frobenius element FrobP (which in the group on the right is just the standard q-power Frobenius where q = Nm(p)), so we can think of it as acting on the invariant space V IP .
    [Show full text]
  • Lattices and the Geometry of Numbers
    Lattices and the Geometry of Numbers Lattices and the Geometry of Numbers Sourangshu Ghosha, aUndergraduate Student ,Department of Civil Engineering , Indian Institute of Technology Kharagpur, West Bengal, India 1. ABSTRACT In this paper we discuss about properties of lattices and its application in theoretical and algorithmic number theory. This result of Minkowski regarding the lattices initiated the subject of Geometry of Numbers, which uses geometry to study the properties of algebraic numbers. It has application on various other fields of mathematics especially the study of Diophantine equations, analysis of functional analysis etc. This paper will review all the major developments that have occurred in the field of geometry of numbers. In this paper we shall first give a broad overview of the concept of lattice and then discuss about the geometrical properties it has and its applications. 2. LATTICE Before introducing Minkowski’s theorem we shall first discuss what is a lattice. Definition 1: A lattice 흉 is a subgroup of 푹풏 such that it can be represented as 휏 = 푎1풁 + 푎2풁 + . + 푎푚풁 풏 Here {푎푖} are linearly independent vectors of the space 푹 and 푚 ≤ 푛. Here 풁 is the set of whole numbers. We call these vectors {푎푖} the basis of the lattice. By the definition we can see that a lattice is a subgroup and a free abelian group of rank m, of the vector space 푹풏. The rank and dimension of the lattice is 푚 and 푛 respectively, the lattice will be complete if 푚 = 푛. This definition is not only limited to the vector space 푹풏.
    [Show full text]
  • Arithmetic of L-Functions
    ARITHMETIC OF L-FUNCTIONS CHAO LI NOTES TAKEN BY PAK-HIN LEE Abstract. These are notes I took for Chao Li's course on the arithmetic of L-functions offered at Columbia University in Fall 2018 (MATH GR8674: Topics in Number Theory). WARNING: I am unable to commit to editing these notes outside of lecture time, so they are likely riddled with mistakes and poorly formatted. Contents 1. Lecture 1 (September 10, 2018) 4 1.1. Motivation: arithmetic of elliptic curves 4 1.2. Understanding ralg(E): BSD conjecture 4 1.3. Bridge: Selmer groups 6 1.4. Bloch{Kato conjecture for Rankin{Selberg motives 7 2. Lecture 2 (September 12, 2018) 7 2.1. L-functions of elliptic curves 7 2.2. L-functions of modular forms 9 2.3. Proofs of analytic continuation and functional equation 10 3. Lecture 3 (September 17, 2018) 11 3.1. Rank part of BSD 11 3.2. Computing the leading term L(r)(E; 1) 12 3.3. Rank zero: What is L(E; 1)? 14 4. Lecture 4 (September 19, 2018) 15 L(E;1) 4.1. Rationality of Ω(E) 15 L(E;1) 4.2. What is Ω(E) ? 17 4.3. Full BSD conjecture 18 5. Lecture 5 (September 24, 2018) 19 5.1. Full BSD conjecture 19 5.2. Tate{Shafarevich group 20 5.3. Tamagawa numbers 21 6. Lecture 6 (September 26, 2018) 22 6.1. Bloch's reformulation of BSD formula 22 6.2. p-Selmer groups 23 7. Lecture 7 (October 8, 2018) 25 7.1.
    [Show full text]
  • The Geometry of Numbers Over Algebraic Number Fields
    THE GEOMETRY OF NUMBERS OVER ALGEBRAIC NUMBER FIELDS BY K. ROGERS^) AND H. P. F. SWINNERTON-DYER 1. The Geometry of Numbers was founded by Minkowski in order to attack certain arithmetical problems, and is normally concerned with lat- tices over the rational integers. Minkowski himself, however, also treated a special problem over complex quadratic number fields [5], and a number of writers have since followed him. They were largely concerned with those fields which have class-number h = 1; and this simplification removes many of the characteristic features of the more general case. Hermann Weyl [10] gave a thorough account of the extension of Minkowski's theory of the reduction of quadratic forms to "gauge functions" over general algebraic number fields and quaternion algebras, and we shall follow part of his developments, though our definition of a lattice is quite different. The desirability of extending the Geometry of Numbers to general alge- braic number fields was emphasized by Mahler in a seminar at Princeton. In this paper we shall carry out this program, extending the fundamental results of Mahler [4] to our more general case and applying them to specific problems. Certain new ideas are necessary, but much of this paper must be regarded as expository. In particular, when the proof of a result is essentially analogous to that for the real case we have merely given a reference to the latter. 2. Let K be an algebraic extension of the rationals of degree m. We regard K as an algebra over the rationals, which we can extend to an algebra K* over the reals.
    [Show full text]
  • Number Theory IV Transcendental Numbers
    A. N. Parshin I. R. Shafarevich (Eds.) Number Theory IV Transcendental Numbers Springer Transcendental Numbers N. I. Fel'dman and Yu. V. Nesterenko Translated from the Russian by Neal Koblitz Contents Notation 9 Introduction 11 0.1 Preliminary Remarks 11 0.2 Irrationality of \/2 11 0.3 The Number тг 13 0.4 Transcendental Numbers 14 0.5 Approximation of Algebraic Numbers 15 0.6 Transcendence Questions and Other Branches of Number Theory 16 0.7 The Basic Problems Studied in Transcendental Number Theory 17 0.8 Different Ways of Giving the Numbers 19 0.9 Methods 20 Chapter 1. Approximation of Algebraic Numbers 22 §1. Preliminaries 22 1.1. Parameters for Algebraic Numbers and Polynomials 22 1.2. Statement of the Problem 22 1.3. Approximation of Rational Numbers 23 1.4. Continued Fractions 24 1.5. Quadratic Irrationalities 25 1.6. Liouville's Theorem and Liouville Numbers 26 2 Contents 1.7. Generalization of Liouville's Theorem 27 §2. Approximations of Algebraic Numbers and Thue's Equation 28 2.1. Thue's Equation 28 2.2. The Case n = 2 30 2.3. The Case n > 3 30 §3. Strengthening Liouville's Theorem. First Version of Thue's Method 31 3.1. A Way to Bound q6 - p 31 3.2. Construction of Rational Approximations for {/ajb 31 3.3. Thue's First Result 32 3.4. Effectiveness 33 3.5. Effective Analogues of Theorem 1.6 34 3.6. The First Effective Inequalities of Baker 36 3.7. Effective Bounds on Linear Forms in Algebraic Numbers ..
    [Show full text]
  • Geometric Number Theory Lenny Fukshansky
    Geometric Number Theory Lenny Fukshansky Minkowki's creation of the geometry of numbers was likened to the story of Saul, who set out to look for his father's asses and discovered a Kingdom. J. V. Armitage Contents Chapter 1. Geometry of Numbers 1 1.1. Introduction 1 1.2. Lattices 2 1.3. Theorems of Blichfeldt and Minkowski 10 1.4. Successive minima 13 1.5. Inhomogeneous minimum 18 1.6. Problems 21 Chapter 2. Discrete Optimization Problems 23 2.1. Sphere packing, covering and kissing number problems 23 2.2. Lattice packings in dimension 2 29 2.3. Algorithmic problems on lattices 34 2.4. Problems 38 Chapter 3. Quadratic forms 39 3.1. Introduction to quadratic forms 39 3.2. Minkowski's reduction 46 3.3. Sums of squares 49 3.4. Problems 53 Chapter 4. Diophantine Approximation 55 4.1. Real and rational numbers 55 4.2. Algebraic and transcendental numbers 57 4.3. Dirichlet's Theorem 61 4.4. Liouville's theorem and construction of a transcendental number 65 4.5. Roth's theorem 67 4.6. Continued fractions 70 4.7. Kronecker's theorem 76 4.8. Problems 79 Chapter 5. Algebraic Number Theory 82 5.1. Some field theory 82 5.2. Number fields and rings of integers 88 5.3. Noetherian rings and factorization 97 5.4. Norm, trace, discriminant 101 5.5. Fractional ideals 105 5.6. Further properties of ideals 109 5.7. Minkowski embedding 113 5.8. The class group 116 5.9. Dirichlet's unit theorem 119 v vi CONTENTS 5.10.
    [Show full text]
  • Number Theory in Geometry
    Number Theory in Geometry Gopal Prasad Myhill Lectures, October 18-19-20, 2016, at SUNY, Buffalo It is a great honor to deliver Myhill lectures. I thank Mohan Ramachandran, David Hemmer and other colleagues here for the invitation to deliver these lectures this year. I had spent a month in spring of 1973 here to attend courses on Algebraic Geometry and Algebraic Groups given by Alexander Grothendieck. I have very fond memory of that stay and of my interaction with Grothendieck. The topic of my talk is number theory in geometry. I will say a few words about history of mathematics to show how geometry has played an important role in the development of mathematics. I will also mention some contributions of Indian Mathematicians of antiquity since these are not widely known. Humans, and apparently some animals too, can and need to count. We count discrete objects, such as siblings, animals, friends, trees, . Therefore, integers have existed in our consciousness for a very very long time. Babylonians had discovered the place-value representation of integers over 3 millennia BCE; they used base 601, so they needed 60 distinct symbols to write the numbers. Historians of mathematics believe that Indians independently came up with place-value representation to base 10 during the Vedic period (c. 1500 BCE). It is not clear if Indus-valley civilization had numerals in their writing; some experts have opined that they indeed had, and that they used 8 as the base. In any case, base 10 is much simpler than base 60 { imagine a child memorizing the multiplication table up to 59×59.
    [Show full text]
  • A Metrical Theorem in Geometry of Numbers
    A METRICAL THEOREM IN GEOMETRY OF NUMBERS BY WOLFGANG SCHMIDT Introduction. If S is a pointset in Rn, n>l, then we write L(S) for the number of lattice-points in S. Here, and throughout this paper, a lattice-point is a point with integral coordinates. If 5 is a Borel set of finite volume V(S), one would expect that L(S) is of about the same order of mag- nitude as V(S). Hence we define the "discrepancy" D(S) by (1) D(S) = \ L(S)V(S)-> - 1\ . As a companion for 7(5), we introduce P(S), the number of primitive lattice-points in 5. (A lattice-point is primitive, if its coordinates are relatively prime.) We put (2) E(S) = | P(5)r(«)F(5)-> - 11 . Next, let $ be a family of Borel sets with finite volumes, such that (i) If SQ$, FG*, then either SQT or TQS. (ii) There exist SQQ with arbitrarily large V(S). Finally, throughout this paper, \^(s), 5^0, should be a positive, nondecreas- ing function, such that /^(s)-1^ exists. Theorem 1. Suppose n>2. Then for almost every linear transformation A ("almost every" in the sense of the n2-dimensional euclidean metric induced by matrix-representation for A), (3) D(AS) = 0(V~li2 log V ^^(log V)), (4) E(AS) = 0(V~V2 log V ^''(log V)) for SQ$. More explicitly, for almost every A there exist constants Ci(^4), Ci(A), such that D(AS) fg a(A)V-^2 log F^/2(log V), whenever V(S)^Ci(A) and SQ<f>.
    [Show full text]
  • Classifications of Number Theory
    International Journal of Scientific & Engineering Research, Volume 4, Issue 6, June-2013 2272 ISSN 2229-5518 Classifications of Number Theory 1. Introduction Number theory (or) arithmetic is a branch of pure mathematics devoted primarily to the study of the integers, more specifically the properties of positive integers. Number theorists study prime numbers as well as the properties of objects made out of integers (e.g., rational numbers) or defined as generalizations of the integers (e.g., algebraic integers). The positive integers are man’s first mathematical creation. The first scientific approach to study of integers, i.e., the true origin of the theory of numbers, is attributed to the Greeks. Around 600BC, Pythagoras and his disciples made through study of integers. Euclid, Diaphanous, Fermat, Euler, Gauss, Goldbach, Dirichlet and Ramanujan were among the main contributors of the theory of the numbers. Integers can be considered either in themselves or as solutions to equations (Diophantine geometry). Questions in number theory are often best understood through the study of analytical objects (e.g., the Riemann zeta function) that encode properties of the integers, primes or other number-theoretic objects in some fashion (analytic number theory). One may also study real numbers in relation to rational numbers, e.g., as approximated by the latter (Diophantine approximation). The older term for number theory is arithmetic. By the early twentieth century, it had been superseded by "number theory". (The word "arithmetic" is used by the general public to mean "elementary calculations"; it has also acquired other meanings in mathematical logic, as in Peano arithmetic, and computer science, as in floating point arithmetic.) The use of the term arithmetic for number theoryIJSER regained some ground in the second half of the 20th century, arguably in part due to French influence.
    [Show full text]