Number Theory: Sailing on the Sea of Number Theory Proceedings of the 4th China-Japan Seminar, Weihai, China 30 August - 3 September 2006 (Series on Number Theory and Its Applications)

NUMBER THEORY Sailing on the Sea of Number Theory Series on Number Theory and Its Applications ISSN 1793-3161 Serie...

Author: S. Kanemitsu | J-y Liu

25 downloads 516 Views 2MB Size Report

This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form

DOWNLOAD PDF

NUMBER THEORY Sailing on the Sea of Number Theory

Series on Number Theory and Its Applications

ISSN 1793-3161

Series Editor: Shigeru Kanemitsu (Kinki University, Japan) Editorial Board Members: V. N. Chubarikov (Moscow State University, Russian Federation) Christopher Deninger (Universität Münster, Germany) Chaohua Jia (Chinese Academy of Sciences, PR China) H. Niederreiter (National University of Singapore, Singapore) M. Waldschmidt (Université Pierre et Marie Curie, France) Advisory Board: K. Ramachandra (Tata Institute of Fundamental Research, India (retired)) A. Schinzel (Polish Academy of Sciences, Poland)

Vol. 1 Arithmetic Geometry and Number Theory edited by Lin Weng & Iku Nakamura Vol. 2 Number Theory: Sailing on the Sea of Number Theory edited by S. Kanemitsu & J.-Y. Liu

ZhangJi - NumberTheory.pmd

2

5/23/2007, 4:09 PM

Series on Number Theory and Its Applications Vol.2

NUMBER THEORY Sailing on the Sea of Number Theory Proceedings of the 4th China-Japan Seminar Weihai, China

30 August - 3 September 2006

Editors S. KcUiemitSU (KMaUniversity, Japan) J.-Y.

LlU. (ShandongUniversity, China)

World Scientific NEW J E R S E Y • L O N D O N • S I N G A P O R E • B E I J I N G • S H A N G H A I • H O N G K O N G • TAIPEI • C H E N N A I

Published by World Scientific Publishing Co. Pte. Ltd. 5 Toh Tuck Link, Singapore 596224 USA office: 27 Warren Street, Suite 401-402, Hackensack, NJ 07601 UK office: 57 Shelton Street, Covent Garden, London WC2H 9HE

British Library Cataloguing-in-Publication Data A catalogue record for this book is available from the British Library.

Series on Number Theory and Its Applications — Vol. 2 NUMBER THEORY Sailing on the Sea of Number Theory Copyright © 2007 by World Scientific Publishing Co. Pte. Ltd. All rights reserved. This book, or parts thereof, may not be reproduced in any form or by any means, electronic or mechanical, including photocopying, recording or any information storage and retrieval system now known or to be invented, without written permission from the Publisher.

For photocopying of material in this volume, please pay a copying fee through the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, USA. In this case permission to photocopy is not required from the publisher.

ISBN-13 978-981-270-810-6 ISBN-10 981-270-810-3

Printed in Singapore.

ZhangJi - NumberTheory.pmd

1

5/23/2007, 4:09 PM

May 19, 2007

1:52

WSPC - Proceedings Trim Size: 9in x 6in

ws-procs9x6

v

PREFACE The present volume is a collection of survey papers of the talks presented at the very successful fourth China-Japan Seminar on number theory. The seminar was held in Shandong University Academic Center, in Weihai, Shandong, People’s Republic of China, during August 30 – September 3, 2006, under the support of Shandong University, the Japan Society for the Promotion of Science (JSPS) and the National Natural Science Foundation of China (NSFC). The organizers Shigeru Kanemitsu and Jianya Liu would like to express their hearty thanks to Shandong University for their generosity and support. The title of the seminar reads “Sailing on the sea of number theory” which suggests that we are supposed to sail freely both on the sea of number theory and the sea of Weihai. The talks were given in a wide conference hall looking over the sea all round and the atmosphere was superb, and all the participants really got the feeling of sailing on the sea of number theory and the sea of Weihai.

Weihai Sea

It should be mentioned that Ms. Nan Luo, together with other staff members of Shandong University, helped out the organizers throughout in preparing and conducting the seminar very successfully. The organizers also would like to thank two of their Chinese colleagues, Professors T. X. Cai and Z. -W. Sun for their attractions. The former read his own poem

May 19, 2007

1:52

vi


ws-procs9x6

PREFACE

which has a passage referring to Pythagoras and the latter made a spot announcement of some recent results in a live fashion.

Shandong University Academic Center (Weihai)

Traditionally, we have been publishing the collection of papers presented at the seminars, but from this volume onwards, we are going to publish survey papers which give good perspectives of recent progress of research in number theory and related fields. We would like to thank the authors of these papers for their kind cooperation regarding the preparation of excellent manuscript and the subsequent unification process of style, which is to make the volume of a readable book quality. In this volume we assemble the following papers: 1. S. Egami and K. Matsumoto, “Convolutions of the von Mangoldt Function and Related Dirichlet Series” has the theme of analytic continuation of multiple Dirichlet series of various types and their possible natural boundaries. Analytic continuation is furnished largely by means of the Mellin-Barnes integrals which is a form of the definition of the betafunction. The authors consider Φ2 with the coefficients of the form of the Abel convolution G2 of the von Mangoldt function as an example of a multiple Dirichlet series which may have a natural boundary. They also consider the Riesz sum of G2 and obtain an asymptotic formula. 2. K.-Q. Feng and Y. Xue, “Constructing New Non-congruent Numbers by Graph Theory” is regarding the application of graph theory (combined with the results on elliptic curves) to finding non-congruent numbers with arbitrarily many prime factors. The main tools they use from elliptic curve theory is that if the rank of the rational points of a certain elliptic curve (with n in the coefficients) is 0, then n is a non-congruent number and this condition in turn is realized if the corresponding Selmer groups have

May 19, 2007

1:52


ws-procs9x6

PREFACE

vii

the minimal sizes. This last condition is then checked on the basis of the oddness of the suitable graphs. The reader can learn these kinds of various facts about elliptic curves and graph theory. 3. Y. Kitaoka, “Distribution of Units of an Algebraic Number Field Modulo an Ideal” is a massive work expounding the author’s new investigation on the distribution of units modulo an ideal. Here the author combines algebraic structures with an analytic output, i.e. the density etc. and should give rise to a new fertile uncultivated land for the coming younger generation. Uncultivated because, compared with extensive study on other ingredients of an algebraic number field like class numbers, the units have not been paid much attention. Not only the field is promising but the problem setting will be very beneficial to younger scientists: Setting a problem in algebraic aspects and incorporate analytic tools to arrive at some statistical data. In the paper the reader can learn really all notions and tools in algebraic number theory, the Frobenius automorphism, Hilbert’s ramificaˇ tion theory, Galois action, the Cebotar¨ ev density theorem, and the Artin conjecture. 4. W. Kohnen, “Sign Changes of Fourier Coefficients and Eigenvalues of Cusp Forms”. In the paper the recent results are summarized on the sign change problem of the Fourier coefficients a(n) of cusp forms f (Siegel modular forms). The Theorem in §1 about infinitely many sign changes is proved using the Hecke L-series for f and the Rankin-Selberg zeta-function, which motivates the study of the first occurrence of the sign change. For a normalized Hecke eigenform that is a new form of even integral weight k and level N , sharp bounds for the occurrence of the first sign change is obtained, with or without the symmetric square L-function and the Hecke relations, (sub-)convexity bounds, prime number theorem, etc. The same ideas give results including sign changes in short intervals. Sign changes for Siegel modular forms of genus 2 are also summarized. Infinitely many sign changes may not occur in general, yet there are theorems which have similar flavor as those for the elliptic modular case. The proof uses the spinor zeta-function in place of Hecke L-series. 5. Y. -K. Lau, J. -Y. Liu and Y. -B. Ye, “Shifted Convolution Sums of Fourier Coefficients of Cusp Forms”. Let α denote the infimum of the exponent of t in the estimation of the Riemann zeta-function on the critical line σ = 1/2. The GLH (Generalized Lindel¨ of Hypothesis) which follows from the GRH (Generalized Riemann Hypothesis) implies α = 0. The convexity bound which is obtained with the aid of the Phragmén-Lindel¨ of convexity principle is α = 1/4 and the authors call any improvement on the convex-

May 19, 2007

1:52

viii


ws-procs9x6

PREFACE

ity bound a subconvexity bound, while the bound α = 1/6 which is 2/3-rd power of convexity and is due to Weyl, is called a Weyl-like bound. The paper is concerned with summarizing the research made hitherto toward these subconvexity and Weyl-like bounds for automorphic L-functions. The authors refer to the L-functions of degree n according to the degree of the generic polynomial factor in p−s in their Euler product and after mentioning the degree 2 case, they present their newest Weyl-like bound for the Rankin-Selberg L-function L(1/2 + it, f × g) formed from f , a holomorphic Hecke eigenform for Γ0 (N ) of weight k (or a Maass Hecke eigenform for Γ0 (N ) with Laplace eigenvalue 1/4 + k 2 ) and g a fixed holomorphic or Maass cusp form for Γ0 (N ), or for Γ0 (N 0 ) with (N, N 0 ) = 1. The Weyllike bound obtained is 2/3 in the weight aspect, which is expounded in the authors’ most recent article of 78 pages. The method hinges on the meromorphic continuation of the shifted convolution sum formed from the Fourier coefficients. In the paper, the intermediate developments toward the above bound are explained in some detail and the reader can learn a quite rich mixture of many new methods which have their origin in analytic number theory and spectral theory. 6. K. Miyake, “Two Expositions on Arithmetic of Cubics”. The paper consists of two parts. Part I is devoted to the study of cubic generic polynomials R = R(t; x) and Q = Q(s; x) with parameters t and s for the symmetric group of degree 3 and the cyclic group of order 3, respectively. As an application, the divisibility of the class numbers of quadratic fields by 3 is obtained. For the algebraic tools used, the reader is referred to the recent books by G. Gras or J. Neukirch. Thus Part I motivates the study of cubic and more generally, non-abelian fields. In Part II, two types of families of elliptic curves are considered whose sets of rational points over Q are described by certain subsets of cubic fields. One type is given by u3 = u3 + au2 + bu + c whose short forms are Mordell curves, while the other family consists of the twists of Hessian family of elliptic curves over the splitting field of the cubic polynomial R and also over the quadratic field contained in the splitting field. Part II therefore introduces the reader to the world of arithmetic on elliptic curves. Basic knowledge is to be found in the textbooks of J. Silverman and of Silverman and Tate. 7. I. Shparlinski, “Distribution of Points on Modular Hyperbolas”. For a positive integer m and an arbitrary integer a with gcd(a, m) = 1, the author defines the modular hyperbola as xy ≡ a(mod m) and designates all the points (x, y) on it by Ha,m . The author considers the distribution and geometric properties of points of Ha,m , denoted Ha,m (X , Y) whose coordinates

May 19, 2007

1:52


ws-procs9x6

PREFACE

ix

x and y lie in prescribed sets of integers X and Y, respectively. Acquiring precise asymptotic formulas and establishing positivity of #Ha,m (X , Y) for various interesting sets have been the central theme in this area. However, as the author writes, “there is a large number of papers which rather routinely study various problems related to Ha,m on the case by case basis. Here, we explain some standard principles which can be used to derive these and many other results of similar spirit about the points on Ha,m as simple corollaries of just one general result about the uniformity of distribution of point on Ha,m in certain domains. In §3.1, this result, Theorem 10, is derived in a very straightforward fashion from (1.1)—the known bound of Kloosterman sums—using some standard arguments”, and we learn one important lesson that if one keeps doing routine work, eventually all the result obtained will be relinquished into history’s dustbox and will not be referred to as illustrating examples in the subsequent publications. §§2.1– 2.3 give a nice survey on a diversity of methods used to study the point on Ha,m , and especially, it is remarked that multiplicative character sums can sometimes give better results than Kloosterman sums. Various applications are described as well. In particular in §5, one can find some interesting results, especially an unexpected result on torsion of elliptic curves in §5.4.

8. Z. -W. Sun, “A Survey of Problems and Results on Restricted Sumsets”. The paper gives a useful survey on recent results in additive number theory, now being exciting, related to combinatorics. A restricted sumset has the form {a1 + · · · + an : a1 ∈ A1 , . . . , an ∈ An , P (a1 , ..., an ) 6= 0}, where A1 , . . . , An are finite subsets of Z, or a field or an abelian group, and P is a suitable polynomial. The book “Additive Combinatorics” (2006) by T. Tao and V. Vu, mainly summarizes important results on sumsets without restrictions, obtained by various different tools. The author is concerned with the lower bounds for cardinalities of various sumsets obtained by algebraic methods. §1 gives rather enlightening discussion on the powerful “polynomial method” via Alon’s “Combinatorial Nullstellensatz” the proof of which is given and which implies the AlonNathanson-Ruzsa theorem, generalizing Dias da Silva and Hamidoune’s extension of the Erd˝ os-Heilbronn conjecture. In the remaining sections one can find recent developments by the author and his school. The survey also contains some open conjectures. 9. H. Tsukada, “A General Modular Relation in Analytic Number Theory” presents equivalent forms of the functional equation with multiple gamma factors satisfied by two sets of Dirichlet series, in the form of mod-

May 19, 2007

1:52

x


ws-procs9x6

PREFACE

ular relation between the corresponding two sets of H-function series, where H-function means the Fox H-function. As far as we have checked, there is no formula which does not come under this big umbral theorem. In the paper, there are some illustrating examples with multiple gamma factors. Hopefully, the theorem covers also those zeta-functions studied in the papers of Kohnen and Lau-Liu-Ye. 10. D. -Q. Wan, “L-functions of Function Fields”. Let Fq denote a finite field of q elements with characteristic p > 0. As a generalization of the case of C= the projective plane, U = projective plane with the origin and infinity removed and K = Fq (t), the function field, the following general situation is considered: Let C denote a smooth projective geometrically connected curve defined over Fq with function field K, with its absolute Galois group denoted by GK and let j : U → C be a Zariski open dense subset of C. Let F` be a finite extension of Q` , ` being a prime number. With V a finite dimensional vector space over F` , let ρ : GK → GL(V ) be a continuous representation of GK unramified on U . There are two L-functions introduced, the L-function L(U, ρ) and the complete L-function of ρ on C, L(C, ρ) which differ by a finite number of Euler factors. The paper gives a concise survey of recent results on analyticity of these L-functions, especially, for those representations arising from geometry. It is stated that in the `-adic case, with ` 6= p, all `-adic representations are essentially geometric from L-function point of view including `-adic function field analogue of Artin’s entireness conjecture. In the more complicated ` = p case, the location of zeros and poles on the compact unit disc is determined and the author’s result says that if the p-adic representation is geometric, the Lfunction L(U, ρ) is p-adic meromorphic everywhere. The interested reader can go on by reading the references given. All in all, the interested reader can really get benefited by going through this volume and we hope we will keep doing this work of putting together the recent developments in handy volumes. The editors would like to express their hearty thanks to Professor Haruo Tsukada, Dr. Jing Ma and Ms. Nan Luo for their devoted help toward the completion of this volume. Dr. Jing Ma, especially, spent an immense amount of time to edit the final versions of all the papers; without her help, the volume could not have been completed so well and in time. Professor Haruo Tsukada kindly checked the final version of the manuscript and made essential improvement therein to whom the editors would like to express their hearty gratitude. Last but not least, thanks are due to the editor of

May 19, 2007

7:37


ws-procs9x6

PREFACE

xi

the World Scientific, Mrs. Ji Zhang, for her kind and timely help throughout the preparation of the proceedings. As usual, we end up with recording a poem describing our feeling, and this time it is the following.

The fifth China-Japan Seminar will be held in Osaka, at Kinki University and we do hope we’ll meet there again. Wo men xi wang zai jian dao ni men. Jin Gunagzi and Liu Jianya—the editors-organizers

This page intentionally left blank

May 19, 2007

1:52


ws-procs9x6

xiii

PROGRAM Wednesday, August 30, 2006 9:00–9:40 The Organizers, Opening Address

Morning Session (Chair: Jianya Liu) 10:00–10:40 Andrzej Schinzel, The Number of Solutions in a Box of a Linear Homogeneous Congruence 11:00–11:40 Shou-Wu Zhang, Periods Integrals and Special Values of L-series Afternoon Session (Chair: Krishnaswami Alladi) 14:30–15:00 Zhi-Wei Sun, Curious Identities and Congruences Involving Bernoulli Polynomials 15:20–15:40 Shigeki Akiyama, Rational Based Number System and Mahler’s Problem 15:50–16:00 Masayuki Toda, On Gauss’ Formula for ψ and Finite Expressions for the L-series at 1 16:20–16:40 Xiumin Ren, Estimates of Exponential Sums over Primes and Applications in Number Theory 16:50–17:05 Haruo Tsukada, A General Modular Relation Associated with the Riemann Zeta-function 17:10–17:20 Takako Kuzumaki Kobayashi, A Transformation Formula for Certain Lambert Series

May 19, 2007

1:52

xiv


ws-procs9x6

PROGRAM

Thursday, August 31, 2006 Morning Session (Chair: Vladimir N. Chubarikov) 9:00–9:40 Krishnaswami Alladi, New Approaches to Jacobi’s Triple Product Identity and a Quadruple Product Extension 10:00–10:40 Trevor D. Wooley, Waring’s Problem in Function Fields 11:00–11:40 Yangbo Ye, A New Bound for Rankin-Selberg L-functions Afternoon Session (Chair: Yoshio Tanigawa) 14:30–15:00 Wenpeng Zhang The Mean Value of Dedekind Sum and Cochrane Sum in Short Intervals 15:20–15:50 Isao Wakabayashi, Some Thue Equations and Continued Fractions 16:10–16:30 Yuk-Kam Lau, The Error Terms in Dirichlet’s Divisor Problem, the Circle Problem and the Mean Square Formula of the Riemann Zeta-function 16:40–17:00 Wenguang Zhai, On the Fourth Power Moments of ∆(x) and E(t) 17:10–17:20 Tianxin Cai, A Generalization of a Curious Congruence of Harmonic Numbers 17:40–17:50 Kentaro Ihara, On the Structure of Algebra of Multiple Zeta Values

Saturday, September 2, 2006 Morning Session (Chair: Kohji Matsumoto) 9:00–9:40 Vladimir N. Chubarikov, Trigonometric Sums in Number Theory, Analysis and Probability Theory 10:00–10:40 Winfried Kohnen, Sign Changes of Fourier Coefficients and Hecke Eigenvalues of Cusp Forms 11:00–11:40 Igor Shparlinski, Exponential and Character Sums with Combinatorial Sequences Afternoon Session (Chair: Wenpeng Zhang) 14:30–15:00 Chaohua Jia, On a Conjecture of Yiming Long 15:10–15:40 Koichi Kawada, On the Sum of Five Cubes of Primes 15:50–16:10 Honggang Xia, On Zeros of Cubic L-functions 16:20–16:40 Zhiguo Liu, A Theta Function Identity to the Quintic Base 16:50–17:05 Masaki Sudo, On the Exponential Equations ax − by = c (1 ≤ c ≤ 300) 17:25–17:40 Yoshinobu Nakai, On a Function in the Biquadratic Theta-Weyl Sums 17:45–17:55 Deyu Zhang, Zero Density Estimates for Automorphic L-functions

May 19, 2007

1:52


ws-procs9x6

PROGRAM Sunday, September 3, 2006 Morning Session (Chair: Winfried Kohnen) 9:00–9:40 Daqing Wan, L-functions of Infinite Symmetric Powers 10:00–10:30 Yoshiyuki Kitaoka, Distribution of Units of an Algebraic Number Field 10:50–11:20 Kohji Matsumoto, The Riesz Mean of the Convolution Product of Von Mangoldt Functions and the Related Zeta-function 11:30–12:00 Katsuya Miyake, Twists of Hessian Elliptic Curves and Cubic Fields Afternoon Session (Chair: Shigeru Kanemitsu) 14:30–15:00 Leo Murata, On a Property of the Multiplicative Order of a (mod p) 15:20–15:50 Yonggao Chen, On the Prime Power Factorization of n! 16:00–16:20 Yoshio Tanigawa, Kronecker’s Limit Formula and the Hypergeometric Function 16:25–16:35 Guangshi L¨ u, Some Results in Classical Analytic Number Theory 16:40–16:50 Huaning Liu, Mean Value of Dirichlet L-functions and Applications to Pseudorandom Binary Sequences in Cryptography 16:55–17:05 Hailong Li, The Structural Elucidation of Eisenstein’s Formula

xv


May 19, 2007

1:52


ws-procs9x6

xvii

Advisory Committee: Professor Tao Zhan, Shandong University, China Organizing Committee: Professor Shigeru Kanemitsu, Kinki University, Japan Professor Jianya Liu, Shandong University, China Guest Speakers: Professor Krishnaswami Alladi, University of Florida, USA Professor Vladimir N. Chubarikov, Moscow State University, Russia Professor Winfried Kohnen, Universitaet Heidelberg, Germany Professor Andrzej Schinzel, Polish Academy of Sciences, Poland Professor Igor Shparlinski, Macquarie University, Australia Professor Daqing Wan, University of California, USA Professor Trevor D. Wooley, University of Michigan, USA Professor Yangbo Ye, University of Iowa, USA Professor Shou-Wu Zhang, Columbia University, USA

Peripatetic Mathemagicians

May 19, 2007

1:52


ws-procs9x6

xviii

Speakers: Professor Shigeki Akiyama, Niigata University, Japan Professor Tianxin Cai, Zhejiang University, China Professor Yonggao Chen, Nanjing Normal University, China Professor Chaohua Jia, The Chinese Academy of Sciences, China Professor Koichi Kawada, Iwate University, Japan Professor Yoshiyuki Kitaoka, Meijo University, Japan Professor Yuk-Kam Lau, The University of Hong Kong, Hong Kong Professor Zhiguo Liu, East China Normal University, China Professor Kohji Matsumoto, Nagoya University, Japan Professor Katsuya Miyake, Waseda University, Japan Professor Leo Murata, Meiji-Gakuin University, Japan Professor Yoshinobu Nakai, Yamanashi University, Japan Professor Xiumin Ren, Shandong University, China Professor Masaki Sudo, Seikei University, Japan Professor Zhi-Wei Sun, Nanjing University, China Professor Yoshio Tanigawa, Nagoya University, Japan Professor Haruo Tsukada, Kinki University, Japan Professor Isao Wakabayashi, Seikei University, Japan Professor Honggang Xia, Shandong University, China Professor Wenguang Zhai, Shandong Normal University, China Professor Wenpeng Zhang, Northwest University, China

A Dead Heat Match

Short Communications: Dr. Kentaro Ihara, Kinki University, Japan Professor Takako Kuzumaki Kobayashi, Gifu University, Japan Professor Hailong Li, Weinan Teacher’s College, China Dr. Huaning Liu, Northwest University, China Professor Guangshi L¨ u, Shandong University, China Mr. Masayuki Toda, Kinki University, Japan Dr. Deyu Zhang, Shandong University, China

May 19, 2007

1:52


ws-procs9x6

xix


May 19, 2007

1:52


ws-procs9x6

xxi

CONTENTS Preface Program Convolutions of the von Mangoldt Function and Related Dirichlet Series Shigeki Egami and Kohji Matsumoto Constructing New Non-congruent Numbers by Graph Theory Keqin Feng and Yan Xue Distribution of Units of an Algebraic Number Field Modulo an Ideal Yoshiyuki Kitaoka Sign Changes of Fourier Coefficients and Eigenvalues of Cusp Forms Winfried Kohnen

v xiii

1

24

39

97

Shifted Convolution Sums of Fourier Coefficients of Cusp Forms Yuk-Kam Lau, Jianya Liu and Yangbo Ye

108

Two Expositions on Arithmetic of Cubics Katsuya Miyake

136

Distribution of Points on Modular Hyperbolas Igor E. Shparlinski

155

A Survey of Problems and Results on Restricted Sumsets Zhi-Wei Sun

190

May 19, 2007

1:52

xxii


ws-procs9x6

CONTENTS

A General Modular Relation in Analytic Number Theory Haruo Tsukada

214

L-Functions of Function Fields Daqing Wan

237

Index

243

May 11, 2007

15:20


ws-procs9x6

1

CONVOLUTIONS OF THE VON MANGOLDT FUNCTION AND RELATED DIRICHLET SERIES SHIGEKI EGAMI Faculty of Engineering, Toyama University, Gofuku, Toyama 930-8555, Japan E-mail: [email protected] KOHJI MATSUMOTO Graduate School of Mathematics, Nagoya University, Chikusa-ku, Nagoya 464-8602, Japan E-mail: [email protected] In this paper, we first give a brief survey on the theory of meromorphic continuation and natural boundaries of multiple Dirichlet series. Then we consider the double Dirichlet series Φ2 (s) defined by the convolution of logarithmic derivatives of the Riemann zeta-function. Especially we propose the conjecture that Φ2 (s) would have the natural boundary on <s = 1, and give a supportive evidence. We further present an application of Φ2 (s) to the Riesz mean, and discuss its multiple analogues.

1. The analytic continuation of multiple Dirichlet series Let s = σ + it be a complex variable, and P (X1 , . . . , Xr ) a polynomial of complex coefficients. The multiple zeta-function ζr (s; P ) =

∞ X

m1 =1

···

∞ X

P (m1 , . . . , mr )−s

(1.1)

mr =1

was first studied by Mellin [29,30], and independently by Barnes [5,6] for P a linear form, at the beginning of the 20th century. Mellin proved the meromorphic continuation of (1.1) to the whole complex plane C if all the coefficients of P have positive real parts. Several mathematicians after Mellin proved the meromorphic continuation of (1.1) under weaker assumptions. At present, the assumption (H0 S) introduced by Essouabri [12] is the weakest. Essouabri [11] also pointed out that the multi-variable generaliza-

May 11, 2007

15:20

2


ws-procs9x6

SHIGEKI EGAMI AND KOHJI MATSUMOTO

tion ζr (s1 , . . . , sn ; P1 , . . . , Pn ) =

∞ X

m1 =1

···

∞ X

P1 (m1 , . . . , mr )−s1

mr =1

(1.2)

−sn

× · · · × Pn (m1 , . . . , mr )

of (1.1), where s1 , . . . , sn ∈ C and P1 , . . . , Pn ∈ C[X1 , . . . , Xr ], can be continued meromorphically to the whole space Cn under the same type of assumption. A special type of multi-variable multiple series ζEZ,r (s1 , . . . , sr ) =

∞ X

m1 =1

···

∞ X

−s2 1 m−s 1 (m1 + m2 )

(1.3)

mr =1 −sr

× · · · × (m1 + · · · + mr )

,

which is called the Euler-Zagier r-fold sum, has been studied extensively in recent years. The meromorphic continuation of (1.3) to Cr is included in the above theorem of Essouabri [11], but [11] is unpublished. Various different proofs of the continuation were published by Arakawa and Kaneko [3], Zhao [37], Akiyama, Egami and Tanigawa [1], and the second-named author [27]. The method in [27] is based on the Mellin-Barnes integral formula Z 1 Γ(s − z)Γ(z) −z (1 + λ)−s = λ dz (1.4) 2πi (c) Γ(s) (where s, λ ∈ C, λ 6= 0, | arg λ| < π, <s > 0, 0 < c < <s, and the path of integration is the vertical line from c − i∞ to c + i∞), which was already used in Mellin’s papers [29,30]. For arithmetical applications, it is important to consider various multiple Dirichlet series with arithmetical coefficients. Peter [32] discussed the analytic continuation of the series ∞ X

m1 =1

···

∞ X a1 (m1 ) · · · ar (mr ) , P (m1 , . . . , mr )s m =1

(1.5)

r

where ak (mk ) (1 ≤ k ≤ r) are complex numbers. Actually he treated the more general situation that P (m1 , . . . , mr ) in the denominator is replaced by P (λ1 (m1 ), . . . , λr (mr )), where λk (m) are complex numbers in a certain fixed cone on C satisfying limm→∞ |λk (m)| = ∞ (1 ≤ k ≤ r). The multivariable series ∞ ∞ X X f (m1 , . . . , mr ) , (1.6) ··· ms11 · · · msrr m =1 m =1 1

r

May 11, 2007

15:20


ws-procs9x6

CONVOLUTIONS OF THE VON MANGOLDT FUNCTION

3

where f (m1 , . . . , mr ) is a non-negative arithmetical function, was studied by de la Bretèche [8]. In connection with sums of the Euler-Zagier type, multiple L-series defined by twisting (1.3) by Dirichlet characters have been investigated by Goncharov [19], Arakawa and Kaneko [3,4], Akiyama and Ishikawa [2], and Ishikawa [21,22]. More generally, we may claim that if Dirichlet series ϕk (s) =

∞ X ak (m) , ms m=1

1≤k≤r

(1.7)

behave nicely, then we can show that the multiple Dirichlet series of the form ∞ ∞ X X a1 (m1 ) a2 (m2 ) Φr (s1 , . . . , sr ; ϕ1 , . . . , ϕr ) = ··· ms11 (m1 + m2 )s2 m1 =1 mr =1 (1.8) ar (mr ) × ··· × (m1 + · · · + mr )sr also behaves nicely. In fact, the following theorem was proved in Matsumoto and Tanigawa [28]. Theorem 1.1 ([28]). Assume that ϕk (s) (1 ≤ k ≤ r) are absolutely convergent for σ > αk (> 0), can be continued meromorphically to the whole plane C, holomorphic except for a possible pole (of order at most 1) at s = αk , and of polynomial order in any fixed strip σ1 ≤ σ ≤ σ2 . Then Φr (s1 , . . . , sr ; ϕ1 , . . . , ϕr ) can be continued meromorphically to the whole space Cr , and the location of its possible singularities can be described explicitly. In particular, if all ϕk (s) are entire, then Φr (s1 , . . . , sr ; ϕ1 , . . . , ϕr ) is also entire. The proof of the above theorem is an analogue of the second-named author’s proof of the meromorphic continuation of (1.3) given in [27], whose basic tool is the Mellin-Barnes formula (1.4). The idea of applying formula (1.4) in such a situation had been already mentioned by the first-named author [10] in the one-variable case. The authors express their sincere gratitude to Professor Gautami Bhowmik for pointing out an error in the original manuscript, and useful suggestions. In particular, the form of Conjecture (B) below was first suggested by her.

May 11, 2007

15:20

4


ws-procs9x6


2. An example of double Dirichlet series with a natural boundary In Theorem 1.1, there is the condition that each ϕk (s) is holomorphic except for only one possible pole. Actually it is possible to prove a result of similar type under the weaker condition that each ϕk (s) has finitely many poles. However, if some of ϕk (s) has infinitely many poles, the behaviour of the multiple series Φr (s1 , . . . , sr ; ϕ1 , . . . , ϕr ) may be quite different. The following simple example illustrates this phenomenon. Let Λ(n) be the von Mangoldt function, and M (s) = −

∞ X ζ0 Λ(n) (s) = , ζ ns n=1

(2.1)

where ζ(s) is the Riemann zeta-function. Then M (s) is meromorphic in the whole plane, and has infinitely many poles because all zeros of ζ(s) are the poles of M (s). In fact it is known that 1 T log T, T ≥2 2π (Theorem 9.4 of Titchmarsh [36]), where N (T ) is the number of (counted with multiplicity) of ζ(s) in the region 0 < σ < 1, 0 < t which is expected to be equal to the number of poles of M (s) in the region because all zeros of ζ(s) are conjectured to be simple. Let ∞ ∞ X X Λ(k)Λ(m) Φ2 (s) = Φ2 (0, s; M, M ) = . (k + m)s m=1 N (T ) ∼

(2.2) zeros ≤ T, same

(2.3)

k=1

This can be rewritten as

Φ2 (s) = where G2 (n) =

∞ X G2 (n) , ns n=1

X

Λ(k)Λ(m).

(2.4)

(2.5)

k+m=n

The series on the right-hand side of (2.3), (2.4) is absolutely convergent for <s > 2, because G2 (n) ≤

n−1 X k=1

log k · log(n − k) ≤ n(log n)2 .

(2.6)

In the present paper we will show, under the assumption of certain conjectures, that Φ2 (s) has the natural boundary on the line <s = 1 (Theorem

May 11, 2007

15:20


ws-procs9x6


5

2.2 below). Therefore it seems that the behaviour of Φ2 (s) is completely different from that of multiple series studied in [28]. The history of the investigation of natural boundaries of Dirichlet series also goes back to the beginning of the 20th century. The analytic continuaP tion and the natural boundary of the function p p−s (p runs over primes) were studied by Kluyver [23], Landau [25], and Landau and Walfisz [26]. In 1928, Estermann published two papers [13], [14] on natural boundaries of Dirichlet series. In the former paper [13], he considered a certain class of Dirichlet series which have Euler products, and gave a criterion when the series can be continued to the whole plane and when it has the natural boundary. The continuation and natural boundaries of Euler products were further studied in more general situations by several mathematicians such as Dahlquist [9], Kurokawa [24]. A multi-variable generalization was recently discussed by Bhowmik, Essouabri and Lichtin [7]. The results in the present paper give a different direction of research on natural boundaries of Dirichlet series. A part of the present work was already announced on the occasion of a conference on number theory (in honour of Professor Akio Fujii) held at Rikkyo University, Tokyo, in January 2005. On the other hand, independently of the present work, Tanigawa and Zhai [35] have considered Dirichlet series which are more general than ours, and have discussed the same type of problems (except for the Riesz mean). Their proof of the claim on natural boundaries (Theorem 1.3 of [35]) seems incomplete; some condition similar to our (B) below seems to be necessary to verify their argument. We mention here the number-theoretic motivation of the study of Φ2 (s). The function G2 (n) defined by (2.5) is a classical subject matter of number theory, because it is connected with the famous conjecture of C. Goldbach (that is, any even integer (≥ 4) can be expressed as a sum of two primes); in fact, the conjecture implies that G2 (n) > 0 for all even n ≥ 4. Fujii [15] studied the mean value of G2 (n) and proved that, if we assume the Riemann hypothesis (RH) for ζ(s), then X

G2 (n) =

n≤X

1 2 X + O(X 3/2 ) 2

(2.7)

for any large positive X. In [16], Fujii improved his result to obtain X

n≤X

G2 (n) =

1 2 X − H(X) + O((X log X)4/3 ) 2

(2.8)

May 11, 2007

15:20

6


ws-procs9x6


under RH. Here H(X) = 2

X X 1+ρ , ρ(1 + ρ) ρ

where ρ runs over the non-trivial zeros of ζ(s), counted with multiplicity. From the work [20] of Hardy and Littlewood it is expected that G2 (n) for even n is approximated by nS2 (n), where ¶ Y µ ¶ Yµ 1 1 1+ S2 (n) = 1− . (2.9) p−1 (p − 1)2 p|n

(p,n)=1

Moreover it follows from Lemma 1 of Montgomery and Vaughan [31] that X 1 nS2 (n) = X 2 + O(X log X). (2.10) 2 n≤X

From this viewpoint, Fujii [16] reformulated his formula (2.8) into X (G2 (n) − nS2 (n)) = −H(X) + O((X log X)4/3 ).

(2.11)

n≤X

Hence the term H(X) represents the main oscillation in the above formulation of Goldbach’s problem. Some properties of H(X) have been studied in Fujii [17]. By (2.4) and Perron’s formula we have Z c+iT X 1 Xs G2 (n) = Φ2 (s) (2.12) ds + O(T −1 X 2+ε ) 2πi c−iT s n≤X

with c > 2. Therefore the study of Φ2 (s) will be useful to understand the behaviour of G2 (n). In the next section we will prove the following: Theorem 2.1 (under RH). The function Φ2 (s) can be continued meromorphically to the half-plane <s > 1, and holomorphic except for the simple poles at s = 2 (with residue 1) and s = 1 + ρ (with residue −2n(ρ)/ρ) for any non-trivial zero ρ of ζ(s), where n(ρ) is the multiplicity of ρ. By this theorem, we can shift (under RH) the path of integration on the right-hand side of (2.12) to <s = 1 + ε. We encounter the poles s = 2 and s = 1 + ρ, and the sum of their residues is (1/2)X 2 − H(X), which coincides with the explicit terms on the right-hand side of (2.8). In particular, we find that the properties of H(X) are closely connected with the behaviour of Φ2 (s) on the line <s = 3/2.

May 11, 2007

15:20


ws-procs9x6


7

Next we consider the behaviour of Φ2 (s) on the line <s = 1. We propose the following: Conjecture 2.1. The line <s = 1 is the natural boundary of Φ2 (s). In the present paper we will show an evidence which supports the above conjecture. Let I be the set of all imaginary parts of non-trivial zeros of ζ(s). A well-known conjecture speculates that the positive elements of I would be linearly independent over the rationals. The following statement is a special case of this conjecture: (A) If γj ∈ I (1 ≤ j ≤ 4) and γ1 + γ2 = γ3 + γ4 (6= 0), then (γ3 , γ4 ) equals (γ1 , γ2 ) or (γ2 , γ1 ). These conjectures were mentioned on p.50 of Fujii [18]. In that paper Fujii made an extensive study on additive properties of the zeros of ζ(s). For instance he proved that the set {γ1 + γ2 | γ1 , γ2 ∈ I, γ1 > 0, γ2 > 0} is uniformly distributed mod 1 (Corollary 3 of [18]). Here we introduce the following quantitative version of (A): (B) There exists a constant α, with 0 < α < π/2, such that if γj ∈ I (1 ≤ j ≤ 4), γ1 + γ2 6= 0, and (γ3 , γ4 ) is neither equal to (γ1 , γ2 ) nor to (γ2 , γ1 ), then |(γ1 + γ2 ) − (γ3 + γ4 )| ≥ exp (−α(|γ1 | + |γ2 | + |γ3 | + |γ4 |)) .

(2.13)

Clearly (B) implies (A). In §4 of the present paper we will prove that, under RH, the set K = {κ | κ = γ1 + γ2 for some γ1 , γ2 ∈ I} \ {0}

(2.14)

is dense in the whole set of real numbers R. This result will yield the following theorem. Theorem 2.2 (under RH). If we assume that (B) is true, then Conjecture 1 is true. Hence the continuation achieved by Theorem 1.1 seems to be bestpossible. It is therefore not rash to propose the following Conjecture 2.2. The error term on the right-hand side of (2.8) is to be O(X 1+ε ) and Ω(X), where Ω(X) means that it is not o(X).

May 11, 2007

15:20

8


ws-procs9x6


3. Proof of Theorem 2.1 In this section we prove Theorem 2.1. First we assume <s > 2 + 2ε. Then we have Φ2 (s) = =

∞ ∞ X X Λ(k)Λ(m) (k + m)s m=1

k=1 ∞ ∞ X X k=1

Λ(k)Λ(m) ³ m ´−s . 1 + ks k m=1

(3.1)

We apply the Mellin-Barnes formula (1.4) with λ = m/k to (3.1) to obtain Z ∞ ∞ X X Λ(k)Λ(m) 1 Γ(s − z)Γ(z) ³ m ´−z Φ2 (s) = dz ks 2πi (c) Γ(s) k k=1 m=1 (3.2) Z ∞ ∞ X 1 Γ(s − z)Γ(z) X −s+z −z = Λ(k)k Λ(m)m dz. 2πi (c) Γ(s) m=1 k=1

Two infinite series in the integrand are convergent when σ−c > 1 and c > 1. These conditions, and also the condition 0 < c < σ (which is necessary to apply (1.4)), are satisfied by the choice c = 1 + ε. Under this choice of c, we have Z Γ(s − z)Γ(z) 1 Φ2 (s) = M (s − z)M (z)dz. (3.3) 2πi (c) Γ(s) The next step is to shift the path of integration from 1. The residue of Φ2 (s) at s = 2 is 1, and at s = 1 + ρ is −

n(ρ) n(ρ) 2n(ρ) − =− . ρ ρ ρ

Now the proof of Theorem 2.1 is complete.

4. Proof of Theorem 2.2 To prove Theorem 2.2, we use the classical explicit formula ¶ ´ Xµ 1 1 1 Γ0 ³ s 1 M (s) = b + + +1 − + , s−1 2 Γ 2 s−ρ ρ ρ

(4.1)

where b = 1 + (C0 /2) − log 2π and C0 is Euler’s constant (formula (2.12.7) of [36]). Substituting this into (3.10), for <s > 1 we obtain µ ¶¾ X Γ(s − ρ)Γ(ρ) ½ 1 1 Γ0 s − ρ B2 (s) = − b+ + +1 Γ(s) s−ρ−1 2 Γ 2 ρ µ ¶ X X Γ(s − ρ)Γ(ρ) 1 1 (4.2) + + 0 0 Γ(s) s − ρ − ρ ρ 0 ρ ρ

= B21 (s) + B22 (s), say. Clearly B21 (s) is meromorphic on the whole plane, and has no pole on the line <s = 1. To investigate B22 (s), we assume RH (to the end of this section), and rewrite ρ = ρ1 = 1/2 + iγ1 and ρ0 = ρ2 = 1/2 + iγ2 to obtain 1 X X Γ(s + 1 − ρ1 )Γ(ρ1 ) B22 (s) = , <s > 1. (4.3) Γ(s) ρ ρ (s − ρ1 − ρ2 )ρ2 1

2

Therefore B22 (s) may behave singularly as s tends to ρ1 + ρ2 , that is, any point of the form 1 + iκ with κ ∈ K (where K is the set defined by (2.14)). Before studying this phenomenon closely, we first prove Lemma 4.1 (under RH). The set K is dense in R.

May 11, 2007

15:20


ws-procs9x6


11

Proof. It is classically known that N (T ) =

1 T log T − C1 T + O(log T ), 2π

C1 =

1 + log 2π 2π

(Theorem 9.4 of [36]), and, under RH, the error term in the above formula can be replaced by O(log T / log log T ) (Theorem 14.13 of [36]). Therefore, for any fixed h ∈ R, the number of zeros on the interval (1/2 + iT, 1/2 + i(T + h)] is 1 (T + h) log(T + h) − C1 (T + h) (4.4) 2π µ ¶ log T 1 T log T + C1 T + O − 2π log log T ½ µ ½ µ ¶¾ ¶¾ 1 h h 1 = T log T + log 1 + h log T + log 1 + + 2π T 2π T µ ¶ log T 1 T log T + O − C1 h − 2π log log T ¶ µ h log T = . log T + O 2π log log T There exists a sufficiently large T0 = T0 (h), such that the right-hand side of (4.4) is positive for any T ≥ T0 . Let α be any non-zero real number, and ε be arbitrarily small. Then, by using this positivity, we can find a sufficiently large T = T (α, ε) and γ1 , γ2 ∈ I, satisfying γ1 ∈ (T + α − ε/2, T + α + ε/2],

γ2 ∈ (−T − ε/2, −T + ε/2].

Hence |α−(γ1 +γ2 )| < ε. Moreover, if ε < |α|, then γ2 6= −γ1 , so γ1 +γ2 ∈ K. Thus we conclude the assertion of the lemma. In view of the above lemma we now know that the points of the form 1 + iκ (κ ∈ K) are dense on the line <s = 1. Now we assume (B), and prove the following Lemma 4.2 (under RH and (B)). For any κ ∈ K, the function B22 (s) tends to infinity as s tends to 1 + iκ from the right. Proof. By (A) we see that there is only one pair (γ10 , γ20 ) (and its reverseordered pair (γ20 , γ10 ) ) satisfying γ10 + γ20 = κ. Put ρ01 = (1/2) + iγ10 , ρ02 =

May 11, 2007

15:20

12


ws-procs9x6


(1/2) + iγ20 . Then B22 (s) =

n(ρ01 )n(ρ02 ) Γ(s)

½

Γ(s + (1/2) − iγ10 )Γ((1/2) + iγ10 ) (s − 1 − iγ10 − iγ20 )((1/2) + iγ20 ) ¾ Γ(s + (1/2) − iγ20 )Γ((1/2) + iγ20 ) + (s − 1 − iγ10 − iγ20 )((1/2) + iγ10 ) 1 X X∗ Γ(s + 1 − ρ1 )Γ(ρ1 ) + Γ(s) γ γ (s − ρ1 − ρ2 )ρ2 1

=

∗ B22 (s)

2

∗∗ B22 (s),

+ P P∗

say, where the symbol means the sum over all (γ1 , γ2 ) satisfying 0 0 0 0 ∗ (γ1 , γ2 ) 6= (γ1 , γ2 ), (γ2 , γ1 ). Then B22 (s) is meromorphic on the whole plane, and its residue at s = 1 + iκ = 1 + i(γ10 + γ20 ) is ½ n(ρ01 )n(ρ02 ) Γ((3/2) + i(κ − γ10 ))Γ((1/2) + iγ10 ) (4.5) Γ(1 + iκ) (1/2) + iγ20 ¾ Γ((3/2) + i(κ − γ20 ))Γ((1/2) + iγ20 ) + (1/2) + iγ10 2n(ρ01 )n(ρ02 ) = Γ(ρ01 )Γ(ρ02 ), Γ(1 + iκ) ∗ (s) → ∞ as s → 1 + iκ. Therefore the which does not vanish. That is, B22 ∗∗ remaining task is to show that B22 (s) remains finite as s → 1 + iκ. Putting s = 1 + η + iκ (η ≥ 0, small), we have

1 Γ(1 + η + iκ) X X∗ Γ((3/2) + η + i(κ − γ1 ))Γ((1/2) + iγ1 ) × . (η + i(κ − γ1 − γ2 ))((1/2) + iγ2 ) γ γ

∗∗ B22 (1 + η + iκ) =

1

(4.6)

2

To prove the lemma, it is enough to show that the right-hand side of (4.6) is absolutely convergent, uniformly in η. By using Stirling’s formula we have X 1 ∗∗ B22 (1 + η + iκ) ¿ (|κ − γ1 | + 1)1+η Γ(1 + η + iκ) γ 1 (4.7) X∗ 1 . ×e−(π/2)(|κ−γ1 |+|γ1 |) |κ − γ1 − γ2 |(1 + |γ2 |) γ 2

The inner sum on the right-hand side of (4.7) can be divided into X X + = Σ 1 + Σ2 , 01

May 11, 2007

15:20


ws-procs9x6


13

say, where λ = κ − γ1 . If λ = 0, then obviously Σ2 = O(1). If λ > 0, we divide Σ2 as X X X + = Σ21 + Σ22 + Σ23 , + Σ2 = γ2 >λ+1

o r −1, and holomorphic there except for the simple poles at s = r and s = r − 1 + ρ for all non-trivial zeros ρ of ζ(s). The residues at s = r and s = r − 1 + ρ are 1 , (r − 1)!

−

r · n(ρ) , ρ(1 + ρ) · · · (r − 2 + ρ)

respectively. Proof. We prove this theorem by induction on r. When r = 2, this theorem is exactly Theorem 2.1. Assume that the theorem is true for r −1. Applying (1.4) to (6.2), we obtain Z 1 Γ(s − z)Γ(z) Φr (s) = Φr−1 (s − z)M (z)dz (6.4) 2πi (c) Γ(s) for <s > r, where 1 < c < <s − (r − 1). Shift the path of integration to 1 and p1 , · · · , pt are distinct odd prime numbers. We define a set of prime divisors of the rational number

May 11, 2007

15:20


ws-procs9x6

CONSTRUCTING NEW NON-CONGRUENT NUMBERS BY GRAPH THEORY

27

field Q by S = {∞, 2, p1 , · · · , pt }, and a subgroup M of the multiplicative group Q∗ /(Q∗ )2 generated by −1, 2, p1 , · · · , pt M = h−1, 2, p1 , · · · , pt i ⊆ Q∗ /(Q∗ )2 . For each d ∈ M we have the homogenous spaces Cd and Cˆd of En and its 2-dual curve Eˆn : y 2 = x3 + 4n2 x defined by Cd : dw2 = d2 t4 + 4n2 z 4 , Cˆd : dw2 = d2 t4 − n2 z 4 . For each prime divisor v ∈ S, we denote Cd (Qv ) and Cˆd (Qv ) the set of non-trivial solutions (w, t, z) 6= (0, 0, 0) of Cd and Cˆd in the local field Qv respectively. The Selmer groups Sn and Sˆn of En and Eˆn are defined by locally solvability of Cd and Cˆd : Sn = {d ∈ M : Cd (Qv ) 6= ∅ for all v ∈ S}, Sˆn = {d ∈ M : Cˆd (Qv ) 6= ∅ for all v ∈ S}. It is proved that Sn and Sˆn are subgroups of M , and 1 ∈ Sn ,

{±1, ±n} ⊆ Sˆn ,

since C1 and Cˆd for d = ±1, ±n have global non-trivial solutions in Q. The following result is a special consequence of 2-descent method. Lemma 2.1. If Sn and Sˆn have minimal sizes: Sn = {1} and Sˆn = {±1, ±n}, then rank(En (Q)) = 0, so that n is a non-congruent number. Now the problem is reduced to finding an explicit criterion to describe Sn = {1} and Sˆn = {±1, ±n}. By the definition of Selmer groups, Sn = {1} if and only if for all d ∈ M and d 6= 1, there exists v ∈ S such that Cd (Qv ) = ∅. Similarly, Sˆn = {±1, ±n} can also be described by such kind of local solvabilities of Cˆd . It is not difficult to give the following result by Hensel lemma and careful computation. Lemma 2.2 ([3, Lemma 3.1, 3.2, 5.1, 5.2]). Let p1 , · · · , pt (t > 1) be distinct odd prime numbers, d ∈ M = h−1, 2, p1 , · · · , pt i ⊂ Q∗ /(Q∗ )2 , and p denotes an odd prime number. (A) If n = p1 · · · pt , then (A1) Cd (Q∞ ) = ∅ ⇔ d < 0.

May 11, 2007

15:20

28


ws-procs9x6

KEQIN FENG AND YAN XUE

n/d −1 (A2) For p|d, Cd (Qp ) = ∅ ⇔ ( −1 p ) = −1 or “( p ) = 1 and ( p ) = −1”. d (A3) For p| 2n d , Cd (Qp ) = ∅ ⇔ ( p ) = −1. (A4) If n ≡ ±3 (mod 8) and 2|d, then Cd (Q2 ) = ∅. (A5) d ≡ 1 (mod 4) ⇒ Cd (Q2 ) 6= ∅. (A6) If n ≡ ±1 (mod 8), d = 2d0 where d0 |n and d0 ≡ 1 (mod 4), then Cd (Q2 ) 6= ∅.

(A10 ) 2|d ⇒ Cˆd (Q2 ) = ∅. (A20 ) If 2 - d, then Cˆd (Q2 ) = ∅ ⇔ d ≡ ±3 (mod 8) and ±3 (mod 8). n/d (A30 ) If p|d, then Cˆd (Qp ) = ∅ ⇔ ( −1 p ) = 1 and ( p ) = −1. (A40 ) If p| 2n , then Cˆd (Qp ) = ∅ ⇔ ( −1 ) = 1 and ( d ) = −1. d

p

n d

≡

p

(B) If n = 2p1 · · · pt , then (B1) Cd (Q∞ ) = ∅ ⇔ d < 0. (B2) 2|d ⇒ Cd (Q2 ) = ∅. 2n/d −1 −1 (B3) For p|d, if ( −1 p ) = −1 or “( p ) = 1 and ( p )4 ( p ) = −1”, then Cd (Qp ) = ∅. (B4) For p| nd , then ( dp ) = −1 ⇒ Cd (Qp ) = ∅. n/d (B10 ) For p|d, Cˆd (Qp ) = ∅ ⇔ ( −1 p ) = 1 and ( p ) = −1. d (B20 ) For p| nd , Cˆd (Qp ) = ∅ ⇔ ( −1 p ) = 1 and ( p ) = −1. (B30 ) 2 - d ⇒ Cˆd (Q2 ) 6= ∅.

For the Genocchi cases in Lemma 1.1 (1), it can be seen by Lemma 2.2 that Sn = {1} and Sˆn = {±1, ±n} so that n is a non-congruent number. For the first two cases of Lemma 1.1 (2), it can be seen that Sn = {1} and Sˆn = {±1, ±n} if and only if ( pq ) = −1. But in general cases, it seems no simple way to write down a necessary and sufficient condition for Sn = {1} and Sˆn = {±1, ±n} if n has large number of prime divisors. What we did in next step is to find proper graphs such that the condition can be described by a specific property of graphs which we introduce in next section. 3. Oddness of graphs We use standard terminology in graph theory (see [8] for example). Let G = (V, A) be a (simple) directed graph where V = V (G) = {v1 , · · · , vm } is the set of vertices of G, and A = A(G) is the set of arcs in G. We denote → −−→ −−→ an arc (vi , vj ) ∈ A by − v− i vj . If both of vi vj and vj vi belong to A, we have

May 11, 2007

15:20


ws-procs9x6


29

a two-direction arc vi vj in G and call it an edge. If all arcs in A(G) are two-directed, the graph G is called non-directed. The adjacency matrix of G is defined by M (G) = (aij )16i,j6m where aij =

½

1 0

→ if − v− i vj ∈ A(G), otherwise.

1 6 i 6= j 6 m,

Let di =

m X

aij (the outdegree of vertex vi ),

1 6 i 6 m.

j=1

The Laplace matrix of G is defined by L(G) = diag(d1 , · · · , dm ) − M (G). Since the sum of each row of L(G) is zero, we know that rankQ (L(G)) 6 m − 1 and Lij = (−1)j+k Lik where Lij is the co-factor of L(G) at the position (i, j). For non-directed graph G, the matrices M (G) and L(G) are symmetric and L11 = (−1)i+k Lik ,

1 6 i, k 6 m.

In this case, it is well known that the absolute value of |L11 | is the number of spanning trees of the non-directed graph G (see [2] Section 1.2.4). Definition 3.1. Let G = (V, A) be a directed graph. A partition {V1 , V2 } of V is called odd if either there exists a vertex v1 ∈ V1 such that #{v1 → V2 } (the total number of arcs from v1 to vertices in V2 ) is odd, or there exists v2 ∈ V2 such that #{v2 → V1 } is odd. Otherwise the partition {V1 , V2 } is called even. The graph G is called odd if all non-trivial partitions {V1 , V2 } 6= {V, ∅} of V are odd. The following result presents a simple criterion for oddness of a graph G in terms of the rank of the Laplace matrix L(G) over finite field F2 . Remark that rankF2 (L(G)) 6 rankQ (L(G)) 6 m − 1 and the total number of partitions of V is 2m−1 (m = |V |) since we view {V1 , V2 }={V2 , V1 }.

May 11, 2007

15:20

30


ws-procs9x6


Lemma 3.1 ([2, Lemma 2.2]). Let G = (V, A) be a directed graph, m = |V | and r = rankF2 (L(G)) (6 m − 1). Then the total number of even partitions of V is 2m−r−1 . In particular, the graph G is odd if and only if r = m − 1. For non-directed graph G, G is odd if and only if the number t(G) = |L11 (G)| of spanning trees of G is odd. An odd graph should be connected. There exists plenty of odd graphs as shown in following examples: 0 (1) All directed cycles Cm with V = {v1 , · · · , vm } and A = − − → − − − − − → − − − → {v1 v2 , · · · , vm−1 vm , vm v1 }. For non-directed graphs: (2) All trees T , since t(T ) = 1. (3) All complete graphs Km with odd integer m > 3 defined by V = {v1 , · · · , vm } and A = {vi vj : 1 6 i 6= j 6 m} since we have Cayley formula t(Km ) = mm−2 . (4) All cycles Cm with odd integer m > 3 defined by V = {v1 , · · · , vm } and A = {v1 v2 , · · · , vm−1 vm , vm v1 }. The concept of odd graph has been used in number theory to determine the 4-rank of the class group of imaginary quadratic number fields in 1930’s by L. Rédei and H. Reichardt and to present a sufficient condition for the Pell’s equation x2 − ny 2 = −1 having no integral solution in 1970’s. In the next section we show its new application in number theory to present series of new non-congruent numbers. 4. New non-congruent numbers Let n = p1 · · · pt (t > 1) be a product of distinct odd primes. We define a graph G(n) = (V, A) by ½ µ ¶ ¾ pj − − → V = {p1 , · · · , pt }, A = pi pj : = −1, 1 6 i 6= j 6 t . pi In 1996, the first author found that for specific n, the oddness of the graph G(n) is a sufficient condition for Sn = {1} and Sˆn = {±1, ±n} as described in Lemma 4.1. Lemma 4.1 ([2, Theorem 3.1]). (1) Suppose that n = p1 · · · pt (t > 1), p1 ≡ 3 (mod 8) and pi ≡ 1 (mod 8) when i > 2. If G(n) is an odd graph, then Sn = {1} and Sˆn = {±1, ±n}. (2) Suppose that n = 2p1 · · · pt (t > 1), p1 ≡ 5 (mod 8) and pi ≡ 1 (mod 8) when i > 2. If G( n2 ) is an odd graph, then Sn = {1} and Sˆn = {±1, ±n}.

May 11, 2007

15:20


ws-procs9x6


31

This result presents series of non-congruent number n such that n can have arbitrarily lager number of prime divisors since it is easy to show by the Dirichlet theorem on primes in arithmetic progressions that for each nondirected graph G there exist infinitely many of n in form (1) of Lemma 4.1 and 2n in form (2) of Lemma 4.1 such that G(n) = G and G( n2 ) = G respectively. Later, we find suitable graphs to do this for all cases of n with more careful consideration. Now we describe our results and omit technique in proofs. Case 2|n. Let n = 2n0 , where n0 = p1 · · · pt q1 · · · qs ,

pi ≡ 1 (mod 4),

qj ≡ 3 (mod 4),

1 6 i 6 t,

1 6 j 6 s,

is a product of distinct prime numbers (t + s > 1). Let P = {p1 , · · · , pt }, ˆ Q = {q1 , · · · , qs }. We define a graph G(n) = (V, A) by V = {2, p1 , · · · , pt , q1 , · · · , qs }, ½ ¾ µ ¶ pj A = pi pj : = −1, pi , pj ∈ P pi µ ¶ ½ ¾ q − → ∪ pq : = −1, p ∈ P, q ∈ Q p µ ¶ ½ ¾ 2 − → ∪ p2 : = −1 (⇔ p ≡ 5 (mod 8)), p ∈ P . p From Lemma 2.2 (B) we obtain the following result. Theorem 4.1 ([3, Lemma 5.3, 5.4]). For n = 2n0 , we have ˆ Sˆn = {±1, ±n} ⇔ G(n)is an odd graph ⇒ Sn = {1}. Then by the matrix characterization of odd graphs in Lemma 3.2, we get the following result. Theorem 4.2 ([3, Theorem 2.6]). Let n = 2n0 and n0 has decomposition (4.1). Then Sn = {1} and Sˆn = {±1, ±n} (so that rank(En (Q)) = 0 and n is a non-congruent number) if and only if the following two conditions are satisfied. (1) s = 0 so that n0 = p1 · · · pt (t > 1) and pi ≡ 1 (mod 4).

May 11, 2007

15:20

32


ws-procs9x6


(2) Define the following numbers ( p 1 if ( pji ) = −1, aij = 1 6 i 6= j 6 t, p 0 if ( pji ) = 1, ½ 1 if pi ≡ 5 (mod 8), ci = 1 6 i 6 t, 0 otherwise, a∗ii =

t X

1 6 i 6 t.

aij + ci ,

j=1,j6=i

Then ¯ ∗ ¯a11 ¯ ¯a21 ¯ ¯ . ¯ .. ¯ ¯a t1

¯ a12 · · · a1t ¯¯ a∗22 · · · a2t ¯¯ .. .. ¯¯ = 1 ∈ F2 . . . ¯ a · · · a∗ ¯ t2

tt

In particular, there exists at least one i (1 6 i 6 t) such that pi ≡ 5 (mod 8). As an example of new consequences, the following result can be derived from Theorem 4.3. Corollary 4.1. If n = 2p1 · · · pt (t > 1), pi ≡ 5 (mod 8) (1 6 i 6 t) and p ( pji ) = 1 for all 1 6 i 6= j 6 t, then Sn = {1} and Sˆn = {±1, ±n} so that rank(En (Q)) = 0 and n is a non-congruent number. Case 2 - n. For n = p1 · · · pt ≡ ±3 (mod 8) we have the following result where G(n) is the (non-directed) graph G(n) = (V, E) defined by V = {p1 , · · · , pt }, µ ¶ ½ ¾ pj E = pi pj : = −1, 1 6 i 6= j 6 t . pi Theorem 4.3 ([3, Theorem 2.4]). For n ≡ ±3 (mod 8), Sn = {1} and Sˆn = {±1, ±n} (so that rank(En (Q)) = 0 and n is a non-congruent number) if and only if the following three conditions are satisfied. (1) n ≡ 3 (mod 8). (2) n = p1 · · · pt , p1 ≡ 3 (mod 4) and pi ≡ 1 (mod 4) for 2 6 i 6 t. (3) G(n) is an odd graph. For the case n ≡ ±1 (mod 8), we need to generalize the concept of odd graph a little more. Here we state the final result. Let n = p1 · · · pt q1 · · · qs be a product of distinct prime numbers, where pi ≡ 1 (mod 4), qj ≡ 3 (mod 4),

May 11, 2007

15:20


ws-procs9x6


33

(1 6 i 6 t, 1 6 j 6 s), (t + s > 1). Let P = {p1 , · · · , pt }, Q = {q1 , · · · , qs }. We define a graph G∗ (n) = (V, A) by V = {2, p1 , · · · , pt , q1 , · · · , qs }, ½ µ ¶ ¾ pj A = pi pj : = −1, pi , pj ∈ P pi µ ¶ ½ ¾ q → pq : ∪ − = −1, p ∈ P, q ∈ Q p o n− → ∪ 2r : r ≡ ±3 (mod 8), r ∈ P ∪ Q .

Theorem 4.4 ([3, Theorem 2.5]). For n ≡ ±1 (mod 8), Sn = {1} and Sˆn = {±1, ±n} if and only if the following three conditions are satisfied. (1) n ≡ 1 (mod 8). (2) The decomposition of n has one of the following forms: (2.1) n = p1 · · · pr P1 · · · Ps Q1 Q2 ; (2.2) n = p1 · · · pr P1 · · · Pt q1 q2 ; (2.3) n = p1 · · · pr P1 · · · Pl Q1 q1 where pi ≡ 1, Pj ≡ 5, Qλ ≡ 3, qµ ≡ 7 (mod 8) and r > 0,

2|s > 0,

2|t > 2,

2 - l > 1.

(3) There exists only one non-trivial even partition V1 = {2} and V2 = V \V1 for the graph G∗ (n). Namely, the rank of L(G∗ (n)) over F2 is |V | − 2 where L(G∗ (n)) is the Laplace matrix of G∗ (n) defined in §3. Many knowing results on non-congruent numbers in Lemma 1.1 are special cases of Theorem 4.2-6. Now under the change of variable, the elliptic curve En : y 2 = x3 − n2 x transforms into the elliptic curve En0 : y 2 = x3 − 3nx2 + 2n2 x.

It is obvious that rank(En (Q)) = rank(En0 (Q)). The homogenous spaces of En0 and its dual curve Eˆn0 : y 2 = x3 + 6nx2 + n2 x are Cd0 : dw2 = d2 t4 + 6ndt2 z 2 + n2 z 4 , Cˆd0 : dw2 = d2 t4 − 3ndt2 z 2 + 2n2 z 4 = (dt2 − 2nz 2 )(dt2 − nz 2 ). Let Sn0 and Sˆn0 be the Selmer groups of En0 and Eˆn0 respectively. Then 1 ∈ Sn0 and {1, 2, n, 2n} ⊂ Sˆn0 . As a consequence of 2-descent method, we also have the following fact. Lemma 2.10 . If Sn0 = {1} and Sˆn0 = {1, 2, n, 2n}, then rank(En0 (Q)) = rank(En (Q)) = 0, so that n is a non-congruent number.

May 11, 2007

15:20

34


ws-procs9x6


In 2002, Goto [6] obtained new non-congruent numbers n for n having at most 4 prime divisors by using Lemma 2.10 . With helping of odd graphs, we obtain following general results which present more non-congruent numbers. Case 2 - n.

Let

n = p1 · · · pt q1 · · · qs ,

t + s > 1,

pi ≡ ±1 (mod 8), qj ≡ ±3 (mod 8),

1 6 i 6 t, 1 6 j 6 s.

(4.1)

Theorem 4.5 ([4, Theorem 3.1]). Assume that n ≡ 3 (mod 4) with decomposition (4.2). Then Sn0 = {1} and Sˆn0 = {1, 2, n, 2n} if and only if the following two conditions are satisfied. (1) n ≡ 3 (mod 8) and s = 1, so that n = p1 · · · pt q (t > 0) where pi ≡ ±1 (mod 8) (1 6 i 6 t), q ≡ ±3 (mod 8). ˜ ˜ defined by (2) The graph G(n) = (V˜ , A) V˜ = {p1 , · · · , pt , q}, ¯µ ¶ ½ ¾ ½ ¯µ ¶ ¾ ¯ pj → −→q ¯¯ q = −1, 1 6 i 6 t ¯ p− p A˜ = − p = −1, 1 6 i = 6 j 6 t ∪ i j¯ i ¯ pi pi

is odd.

Theorem 4.6 ([4, Theorem 3.2]). Assume that n ≡ 1 (mod 4) with decomposition (4.2). Then Sn0 = {1} and Sˆn0 = {1, 2, n, 2n} if and only if the following two conditions are satisfied. (1) s = 2 and n ≡ 1 (mod 8) so that n = p1 · · · pt q1 q2 . (2) ¯ ∗ ¯ ¯m11 m12 · · · m1t b11 ¯ ¯ ¯ ¯ .. .. .. .. ¯ ¯ . . . . ¯¯ = 1 ∈ F2 , ¯ ¯ mt1 mt2 · · · m∗ bt1 ¯ tt ¯ ¯ ¯ l l2 · · · lt k1 ¯ 1

where

mij = biλ =

(

(

½

1 0

1 0 ½ 1 k1 = 0 li =

1 0

p

if ( pji ) = −1, otherwise,

1 6 i 6= j 6 t,

if ( qpλi ) = −1, otherwise,

1 6 i 6 t, 1 6 λ 6 2,

if pi ≡ 7 (mod 8), if pi ≡ 1 (mod 8),

if q1 ≡ 3 (mod 8), if q1 ≡ 5 (mod 8),

1 6 i 6 t,

May 11, 2007

15:20


ws-procs9x6


35

and m∗ii =

t X

mij + bi1 + bi2 ,

1 6 i 6 t.

j=1,j6=i

Theorem 4.7 and 4.8 present series of explicit non-congruent numbers as following. Corollary 4.2 ([4, Corollary 3.3]). Suppose that n = p1 · · · pt q (t > 1) and pi ≡ 1 (mod 8), 1 6 i 6 t − 1, µ

q pi

¶

= −1,

pt ≡ 7 (mod 8), q ≡ 5 (mod 8), 1 6 i 6 t.

Then n is a non-congruent number provided one of the following conditions is satisfied. ³ ´ (1) ppji = 1 for all 1 6 i 6= j 6 t. ³ ´ (2) ppji = −1 for all 1 6 i 6= j 6 t and t is even.

Corollary 4.3 ([4, Corollary 3.4]). Suppose that n = p1 · · · pt q (t > 1) and pi ≡ 1 (mod 8), 1 6 i 6 t − 1, pt ≡ 7 (mod 8),

q ≡ 5 (mod 8).

Then n is a non-congruent number if the following two conditions are satisfied. (1) There is exactly one i (1 6 i 6 t) such that ( pqi ) = −1. (2) The (non-directed) graph G = (V, A) defined by ¯µ ¶ ¾ ½ ¯ pj ¯ = −1, 1 6 i 6= j 6 t V = {p1 , · · · pt }, A = pi pj ¯ pi is odd.

Corollary 4.4 ([4, Corollary 3.5]). Suppose that n = p1 · · · pt q1 q2 (t > 0) and (1) pi ≡ 1 (mod 8), q1 ≡ q2 ≡ 3 (mod 8), ( qp1i )( qp2i ) = −1, (1 6 i 6 t). (2) ( ppji ) = 1 (1 6 i 6= j 6 t) or “ ( ppji ) = −1 (1 6 i 6= j 6 t) and t is even”. Then n is a non-congruent number. Corollary 4.5 ([4, Corollary 3.6]). Suppose that n = p1 · · · pt q1 q2 (t > 1) and (1) pi ≡ 1 (mod 8) (1 6 i 6 t − 1), (pt , q1 , q2 ) ≡ (7, 5, 3) (mod 8);

May 11, 2007

15:20

36


ws-procs9x6


(2) All ( qpλi ) = 1, (1 6 i 6 t, 1 6 λ 6 2) except ( qp1t ) = −1; (3) The non-directed graph G = (V, A) defined in Corollary 4.10 is odd. Then n is a non-congruent number. Case 2|n = 2n0 . We proved (see [5]) that there is no n0 ≡ 7 (mod 8) such that Sn0 = {1} and Sˆn0 = {1, 2, n0 , n}. We have not completed the case n0 ≡ 1 or 3 (mod 8), but for n0 ≡ 5 (mod 8) we get the following result. Theorem 4.7 ([5, Theorem 3.1]). Suppose that n = 2n0 and n0 = p1 · · · pt q1 · · · qs ≡ 5 (mod 8) where t, s > 0, t + s > 1, pi ≡ ±1 (mod 8) and qj ≡ ±3 (mod 8), (1 6 i 6 t, 1 6 j 6 s). Then the following two conditions are equivalent. (1) Sn0 = {1} and Sˆn0 = {1, 2, n0 , n} so that rank(En0 (Q)) = 0 and n is a non-congruent number; (2) s = 1 so that n0 = p1 · · · pt q, q ≡ ±3 (mod 8); and ¯ ∗ ¯ ¯m11 m12 · · · m1t ¯ ¯ ¯ ¯ .. .. ¯ = 1 ∈ F , D = ¯ ... 2 . . ¯¯ ¯ ¯ m m · · · m∗ ¯ t1 t2 tt

where

mij = bi =

(

(

1 0

1 0

p

if ( pji ) = −1, otherwise, if ( pqi ) = −1, otherwise,

1 6 i 6= j 6 t, 1 6 i 6 t,

and m∗ii =

t X

mij + bi ,

1 6 i 6 t.

j=1,j6=i

(We assume D = 1 for t = 0.) From simple computations, we can derive the following consequences of Theorem 4.13. Corollary 4.6 ([5, Corollary 3.2]). Suppose that n = 2n0 and n0 satisfies one of following conditions where p, q, p1 , p2 are prime numbers and p1 6= p2 . (1) n0 = q ≡ 5 (mod 8); (2) n0 = pq, ( qp ) = −1 and (p, q) ≡ (1, 5) or (7, 3) (mod 8);

May 11, 2007

15:20


ws-procs9x6


37

(3) n0 = p1 p2 q, (p1 , p2 , q) ≡ (1, 1, 5) or (1, 7, 3) (mod 8) and there exists one of p1 , p2 , q which is quadratic non-residue of the other two prime numbers; (4) n0 = p1 p2 q, (p1 , p2 , q) ≡ (7, 7, 5) (mod 8) and ( pp21 ) = ( pq2 ) = −( pq1 ). Then Sn0 = {1} and Sˆn0 = {1, 2, n0 , n} so that rank(En0 (Q)) = 0 and n is a non-congruent number.

Corollary 4.7 ([5, Corollary 3.3]). Let n = 2n0 , n0 = p1 · · · pt q ≡ 5 (mod 8) where p1 , · · · , pt are distinct prime numbers, pi ≡ ±1 (mod 8) (1 6 i 6 t) and q ≡ ±3 (mod 8). Let r1 , · · · , rl be distinct prime numbers, rλ ≡ ±1 (mod 8) (1 6 λ 6 l), ( rrji ) = 1 (1 6 i, j 6 l), r1 · · · rl ≡ 1 (mod 8) and µ ¶ µ ¶ pi rλ = = 1, 1 6 i 6 s, 1 6 λ 6 l, rλ pi µ ¶ q = −1, 1 6 λ 6 l. rλ If D = 1 ∈ F2 where D is given by Theorem 4.13 (2) (so that n is a non-congruent number), then N = r1 · · · rl n is a non-congruent number.

5. Birch and Swinnerton-dyer conjecture for En The Birch and Swinnerton-Dyer conjecture says that for each elliptic curve E over Q, (BSD1) The order of zero of L-function L(E, s) at s = 1 is equal to rank(E(Q)). (BSD2) If rank(E(Q)) = 0 (so that L(E, 1) 6= 0 by (BSD1)), then L(E, 1) is equal to a certain conjectured value. For several cases of En such that rank(En (Q)) = 0, Chunlai Zhao [18,19] calculated L(En , 1) by using Eisenstein series and odd-graph language and then verified conjecture (BSD1) and (BSD2). For the case that n has at most 2 odd prime divisors, this can be done by using Tunnell’s elementary criterion, see [2]. References 1. N. Aoki, On the 2-Selmer groups of elliptic curves arising from the congruent number problems, Comment. Math. Univ. St. Paul., 48 (1999), 77–101. 2. K. Feng, Non-congruent numbers, odd graphs and the Birch-Swinnerton-Dyer conjecture, Acta Arith., 80 (1996), 71–83. 3. K. Feng and M. Xiong, On elliptic curves y 2 = x3 − n2 x with rank zero, Jour. of Number Theory, 109 (2004), 1–26.

May 11, 2007

15:20

38


ws-procs9x6


4. K. Feng and Y. Xue, New series of odd non-congruent numbers, to appear in Science in China (A), 2006. 5. K. Feng and Y. Xue, New series of non-congruent numbers n ≡ 10 (mod 16), preprint, 2006. 6. A. Genocchi, Sur l’impossibilité de quelques égalités doubles, C.R. Acad. Sci. Paris, 78 (1874), 423–436. 7. T. Goto, A study on the Selmer groups of elliptic curves with a rational 2-torsion, Kyushu University, Doctoral thesis, 2002. 8. J. M. Harris, J. L. Hirst, M. J. Mossignhoff, Combinatorics and Graph Theory, Springer-Verlag, Berlin, 2000. 9. B. Iskra, Non-congruent numbers with arbitrarily many prime factors congruent to 3 modulo 8, Proc. Japan Acad., 72 (1996), 168–169. 10. N. Koblitz, Introduction to Elliptic Curves and Modular Forms, GTM 97, 2nd ed. Springer-Verlag, 1993. 11. J. Lagrange, Construction d’une table de nombres congruents, Bull. Soc. Math. France, Suppl. Mem., 49–50 (1977), 125–130. 12. J. Lagrange, Nombres congruents et courbes elliptiques, Sémin. DelangePisot-Poitou, 1974/75, Fasc. 1, Exposé 16,17pp. 13. F. Lemmermeyer, Some families of non-congruent numbers, Acta Arith., 110 (2003), 15–36. 14. F. R. Nemenzo, All congruent number less than 40000, Proc. Japan Acad., 74 (1998) 29–31. 15. P. Serf, Congruent numbers and elliptic curves, in Computational Number Theory (Debrecen, 1989), de Gruyter, 1991, 227–238. 16. J. Silverman, The Arithmetic of Elliptic Curves, GTM 106, Springer-Verlag, 1986. 17. J. B. Tunnell, A classical Diophantine problem and modular forms of weight 3/2, Invent. Math., 72 (1983), 323–334. 18. C. Zhao, A criterion for elliptic curves with lowest 2-power in L(1), Math. Proc. Cambridge Philos. Soc., 121 (1997), 385–400. 19. C. Zhao, A criterion for elliptic curves with lowest 2-power in L(1) II, Acta Math. Sinica (English ser.), 21 (2005), 961–976.

May 11, 2007

15:20


ws-procs9x6

39

DISTRIBUTION OF UNITS OF AN ALGEBRAIC NUMBER FIELD MODULO AN IDEAL YOSHIYUKI KITAOKA Department of Mathematics, Meijo University, Tenpaku, Nagoya, 468-8502, Japan E-mail: [email protected] Let F be an algebraic number field and oF the maximal order of F . We are interested in how units of F distribute in (oF /n)× , where n is an integral ideal. When n is a prime ideal, we give the upper bound of the order of the subgroup represented by units in (oF /n)× , using new invariants. Prime ideals are ruled by an automorphism of an overfield of F , which is a Galois extension of the rationals. We give the expected density of the set of prime ideals which attain the upper bound, taking account of Chebotarev’s density theorem. In the third section, we try to generalize the above to principal ideals generated by rational primes. On the contrary to the prime ideal case, there remain much to do even in order to complete the algebraic framework.

1. Introduction Let F be an algebraic number field and oF the ring of algebraic integers in F . The structure of the group o× F of units in F is well described by Dirichlet’s Theorem, which says that there exist a primitive w-th root ζw of unity and units ²1 , · · · , ²r so that they generate o× F and the equality Q ai a0 ζw i ²i = 1 implies a0 ≡ 0 mod w, a1 = · · · = ar = 0. In this paper, we are interested in the distribution of units modulo an integral ideal. For an integral ideal n, we put ¯ ¢ © ª ¡ E(n) = ² mod n ¯ ² ∈ o× ⊂ (oF /n)× . F

This is a finite group and therefore infinitely many multiplicative relations modulo n arise among units. We would like to know these relations, the structures of E(n) and (oF /n)× /E(n). However, these are heavily dependent on the modulus ideal n, and we are to extract a property common to some appropriate set of ideals.

May 11, 2007

15:20

40


ws-procs9x6

YOSHIYUKI KITAOKA

In §2, we take up the case that n is a prime ideal. In this case, (oF /n)× is cyclic and the structure being determined by the order, this case is easier, as already studied in [7]. Let us briefly explain its outline (see the text for details). Let K be a subsidiary extension field of F , and assume that K is a Galois extension of the rational number field Q. We take an element η ∈ Gal(K/Q) to control prime ideals of F . g(x) ∈ Z[x] is the monic polynomial of minimal degree such that ¯ n o ¯ W1 (g(x)) := ²g(η) ¯ ² ∈ o× F

is a finite group, whose order we denote by δ1 (cf. (2.1)) and put (cf. (2.3)) n ¯ √ o δ g(ρ) ¯ δ0 = max m ¯ m ² 1 = 1 for ∀² ∈ o× F , ∀ρ|K = η ,

and we say that a prime ideal p of F corresponds to η if there is a prime ideal of K lying above p whose Frobenius automorphism is η. Then, for every prime ideal p of F corresponding to η, we see that #E(p) divides δ1 g(p)/δ0 , where p denotes a rational prime number lying below p, and we conjectured in [7] n ¯ o ¯ # p ¯ p < x, p - 2DK , #E(p) = δ1 g(p)/δ0 and p corresponds to η ∼ den(η)Li(x),

where ¯ £© ª ¤−1 σ ∈ Gal(K/F ) ¯ ση = ησ : Gal(K/F ) ∩ hηi ∞ X µ(m)#Hδ0 m (η) × . [Kδ0 m : Kη ] m=1 ³q ´ Here, µ(m) denotes the Möbius function, Km = K m o× K , Kη is the fixed subfield of K by η and ¯ o n √ δ1 g(ρ) ¯ = 1 for ∀² ∈ o× . Hm (η) = ρ ∈ Gal(Km /Q) ¯ ρ|K = η and m ² F den(η) =

We showed that the expected density den(η) is indeed finite and positive. The conjecture is true under Generalized Riemann Hypothesis in a few cases [2,6,12–14]. We know the arithmetic frame-work, but as Artin’s conjecture on primitive roots, the remaining problem is the estimation of the accumulation of error terms when we apply Chebotarev’s density theorem to infinitely many algebraic number fields. In §3, we go on to study the case where n is a principal ideal generated by a rational prime number. We have already studied a few cases ([8,9]). In

May 11, 2007

15:20


ws-procs9x6

DISTRIBUTION OF UNITS

41

this paper, we deal with slightly wider classes; let F be a Galois extension of Q and η an element of the center of Gal(F/Q). These two assumptions play the essential role at present, although they should be loosened. The automorphism η controls rational primes through the Frobenius automorphism. Denote the group of roots of unity in F by WF . Then, we see, as η-modules ¡ ¢ M ∼ Q ⊗Z o× Q[di ], F /WF = i

where Q[di ] denotes the cyclotomic field Q(ζdi ) with η action given by αη = ζdi α for α ∈ Q(ζdi ), and di is a divisor of the order d of η. Then, writing E(p) for E((p)), we will see in Corollary 3.3 that .£ Y η−p ¤ #E(p) = #WF |Φdi (p)| ker ιp : WF o× F i

for a rational prime p ( - 2DF ) whose Frobenius automorphism is η. Here, Φm (x) is the cyclotomic polynomial of index m, and a canonical mapping ιp : o× F → E(p)/WF is defined by ² 7→ ² mod p. Putting £ η−p ¤ Relη = gcd ker ιp : WF o× , F p

where p corresponds to η as above and is sufficiently large (cf. (3.7)), we have ¯ . Y ¯ |Φdi (p)| Relη #E(p) ¯ #WF i

and hence

¯ . Y ¯ |Φdi (p)| #E(p). Relη ¯ #WF i

Experimentally, we expect that there are infinitely many prime numbers p Q which correspond to η and satisfy Relη = #WF i |Φdi (p)|/#E(p), replacing “|”by “=”. We do not know how to evaluate Relη . But there is a plausible description for it with supporting experimental data, which we will explain below. Putting together subgroups corresponding to the same di , we put, for a divisor m of d ¯ n o ¯ Φm (η) U (m) = u ∈ o× u ∈ W . ¯ F F

May 11, 2007

15:20

42


ws-procs9x6

YOSHIYUKI KITAOKA

Let g(x) be the polynomial defined in the case K = F above, and define ˜ and τm (˜ natural numbers ∆ η ) for any extension η˜ of η as follows: o n ¯ ˜ = max t ¯¯ ζtg(ρ) = 1 for ∀ρ ∈ Gal(F (ζt )/Q) satisfying ρ|F = η , ∆ n ¯ o ¯ Φ (˜η) ˜ . τm = τm (˜ η ) := max t ¯ ζt m = 1, t|∆

³ ³q ´. ´ ˜ And for a prime number p whose Frobenius class in Gal F ∆ o× Q F contains η˜, we put ¯   ¯ Y  ¯ (i) vm ∈ U (m), Q vm ¯¯ R(˜ η) = . Φm (p)/τm  ≡ ζ mod p for ∃ζ ∈ WF  ¯ (ii) m|d vm m|d

Here Φm (p)/τm is an integer, and the group R(˜ η ) depends only on η˜ in spite of its definition. Obviously, it induces a subgroup of ker ιp ¯ ) ( ¯Y Y η−p Φm (p)/τm ¯ vm ∈ R(˜ η ) WF o× , R(˜ η , p) = vm ¯ F ¯ m|d

m|d

η−p WF o× ] F

and hence [ker ιp : is divisible by the index [R(˜ η , p) : WF o× F which depends only on η˜. Now we have ¯ £ η−p ¤ ¯ κ(η) := gcd R(˜ η , p) : WF o× ¯ Relη . F

η−p

],

η ˜

After such preparations, we give κ(η) explicitly for several types of algebraic number fields of low degree in §4, and making use of it, we confirm η−p the existence of a prime number p satisfying κ(η) = [ker ιp : WF o× ] by F computer experiment, which yields the expectation Relη = κ(η). As referred to above, we have already studied several cases [8] where the rank of o× F is one. There, we have given the value κ(η) by experiments and showed that the expected density of the set of primes p satisfying κ(η) = Q #WF |Φdi (p)|/#E(p) is indeed positive. Our argument here elucidates the theoretical background of their values. In the appendix, we give the structure of the Galois group of the field extended by roots of units, which is necessary to consider all extensions η˜ of η explicitly. Notations : For an algebraic number field L, we denote by oL , o× L , WL , DL , Lm the ring of algebraic integers in L, the group of units in³q L, the ´

group of roots of unity in L, the discriminant of L, and the field L m o× L extended by all m-th roots of units in L, respectively. Assume that L is a

May 11, 2007

15:20


ws-procs9x6


43

Galois extension over Q. σL/Q (p) denotes the Frobenius automorphism of a prime ideal of p of L, and for a prime number p lying below p, σL/Q (p) denotes a conjugacy class {ρσL/Q (p)ρ−1 | ρ ∈ Gal(L/Q)}. For integers a, b we denote their greatest common divisor by (a, b) or by gcd(a, b). For a polynomial f (x) = a0 + a1 x + · · · + an xn ∈ Z[x], ρ ∈ Gal(L/Q) and u ∈ L× , we write n Y t uf (ρ) = uat ρ . t=0

We denote by F an algebraic number field, with which we are mainly concerned in this article, and for an integral ideal n of F , we put ¯ © ª¡ ¢ E(n) = ² mod n ¯ ² ∈ o× ⊂ (oF /n)× . F

We denote #WF by w. For a natural number n, ζn is a primitive n-th root of unity and the polynomial Y Φn (x) = (x − ζna ) (a,n)=1

is the cyclotomic polynomial of index n. For a polynomial h(x), we put h(x, y) =

h(x) − h(y) . x−y

2. Case of prime ideals Throughout this section, fields K ⊃ F are fixed algebraic number fields and we assume that #o× F = ∞ and that K is a Galois extension of the rational number field Q. We choose and fix an element η ∈ Gal(K/Q) to control prime ideals of F through the Frobenius automorphism. 2.1. Polynomial g(x) First, we introduce a key polynomial g(x), which plays a central role. Lemma 2.1. Let g(x) be a non-zero polynomial in Z[x] such that ¯ n o ¯ W1 (g(x)) := ²g(η) ¯ ² ∈ o× F

is a finite group. We fix a primitive polynomial g(x) of minimal degree among them. Then it divides xd − 1 in Z[x] for £ ¤ d := hηi : hηi ∩ Gal(K/F ) .

May 11, 2007

15:20

44


ws-procs9x6

YOSHIYUKI KITAOKA

Proof. By virtue of η d ∈ Gal(K/F ), W1 (xd − 1) = {1} is clear and we may take a primitive polynomial g(x) of minimal degree satisfying #W1 (g(x)) < ∞. Then there exist an integer a and polynomials q(x), r(x) ∈ Z[x] so that a(xd −1) = q(x)g(x)+r(x) and deg r(x) < deg g(x). The assumption #o× F = r(η) a(η d −1)−q(η)g(η) ∞ implies deg g(x) ≥ 1. For ² ∈ o× , we have ² = ² = F g(η) −q(η) (² ) and hence W1 (r(x)) is a finite group. Hence the minimality of deg g(x) implies r(x) = 0 and then the primitiveness of both xd − 1 and g(x) entails that g(x) divides xd − 1. Since the polynomial g(x) divides xd − 1, we may assume that g(x) is monic. Hereafter the monic polynomial g(x) means the one defined in Lemma 2.1 and put δ1 := #W1 (g(x)).

(2.1)

Example 2.1. If η ∈ Gal(K/F ) holds, then obviously ²η = ² for any ² ∈ o× F , and so we have g(x) = x−1 and δ1 = 1. Although the determination of g(x) in general is complicated, we know the following [7]: Suppose that K = F is a Galois extension of Q; then the polynomial g(x) is given as follows: (R) The case where F is real. (R1) g(x) = xd−1 + xd−2 + · · · + 1 if Gal(F/Q) = hηi. (R2) g(x) = xd − 1 otherwise. (I) The case where F is imaginary. We denote the complex conjugation by J. (I1) g(x) = xd−1 + xd−2 + · · · + 1 if [Gal(F/Q) : hηi] = 2 and J 6∈ hηi. (I2) g(x) = xd − 1 if [Gal(F/Q) : hηi] > 2 and J 6∈ hηi. (I3) g(x) = xd/2−1 + xd/2−2 + · · · + 1 if Gal(F/Q) = hηi. (I4) The case of J ∈ hηi 6= Gal(F/Q).

(i) If there is an element u ∈ Gal(F/Q) such that JuJ −1 u−1 6∈ hηi, then g(x) = xd − 1. (ii) If JuJ −1 u−1 ∈ hηi holds for every element u ∈ Gal(F/Q), then g(x) = xd/2 − 1. P Remark. In the case of (ii) in (I4), g(x) is (xd/2 − 1)( i xai − P bi d/2 − 1 in virtue of i x ) in [7], but it turns out that it must be x d/2 J =η ∈ Z(Gal(F/Q)).

May 11, 2007

15:20


ws-procs9x6


45

In the general case, suppose that there is a real infinite place of F ; then we can show ( xd−1 + xd−2 + · · · + 1 if [F : Q] = d, g(x) = d x −1 otherwise. But in the case of F being totally imaginary, the evaluation of g(x) is not easy. 2.2. Upper bound for #E(p) Let P (- 2DK ) be an unramified prime ideal of K whose Frobenius automorphism σK/Q (P) is η; then we say a prime number p and a prime ideal p of F lying below P correspond to η. Note that the assumption yields that the condition ζ ≡ 1 mod P for a root of unity ζ in K implies ζ = 1. By ramification theory, in particular, applying the assertion (3) for i = 1 in the following theorem to L = K, M = F, N = Q and Q = P with H = Gal(K/F ) and Z = hηi, we derive that £ ¤ d := hηi : hηi ∩ Gal(K/F ) = deg(P ∩ F ), (2.2)

where pdeg p signifies the number of elements of the residue class field modulo a prime ideal p. Hilbert’s ramification theory for intermediate fields : Let L ⊃ M ⊃ N be algebraic number fields, and suppose that L/N is a Galois extension with Galois group G, and that H is the subgroup corresponding to M. For a prime ideal Q of L, the decomposition group and the inertia group of Q with respect to L/N are denoted by Z, T respectively. Then we have (1) For σ, τ ∈ G, Qσ ∩ M = Qτ ∩ M if and only if ZσH = Zτ H. (2) Let G = Zσ1 H + · · · + Zσs H

(σ1 = id)

be the double coset decomposition. Then the ideals Qσ1 ∩ M, · · · , Qσs ∩ M are all distinct prime ideals of M lying above Q ∩ N. (3) Let ei , fi be the ramification index and the relative degree of Qσi ∩ M with respect to M/N respectively. Then we have £ ¤ £ ¤ ei fi = σi−1 Zσi : σi−1 Zσi ∩ H , ei = σi−1 T σi : σi−1 T σi ∩ H .

May 11, 2007

15:20

46


ws-procs9x6

YOSHIYUKI KITAOKA

Lemma 2.2. We put h(x) := (xd − 1)/g(x) (∈ Z[x]).

If a prime number p ( - 2DK ) corresponds to η, then δ1 divides h(p). g(η) Proof. Take a unit ² ∈ o× is a primitive δ1 -th root of F such that ² unity, and let P be an unramified prime ideal of K lying above p such that σK/Q (P) = η, and put p = P ∩ F . For a generator α ∈ oF of (oF /p)× , we put ² ≡ αa mod p (a ∈ Z). Then we have

1 = ²δ1 g(η) ≡ ²δ1 g(p) ≡α

mod P

aδ1 g(p)

mod P,

which implies 1 ≡ αaδ1 g(p) mod p. Since by (2.2) d = deg p, there is an integer b such that ag(p)δ1 = (pd − 1)b, or aδ1 = h(p)b. We have only to show that (δ1 , b) = 1. Suppose that q is a prime number dividing (δ1 , b); then we have ²g(p)δ1 /q ≡ αag(p)δ1 /q ≡ α(p g(η)δ1 /q

d

−1)b/q

≡ 1 mod p,

g(η)δ1 /q

which implies ² ≡ 1 mod P. Since ² is a root of unity in K g(η)δ1 /q and P - 2DK , we have ² = 1. This contradicts the fact that ²g(η) is a primitive δ1 -th root of unity. Lemma 2.3. Let m be a natural number and p (- m) a prime ideal of F corresponding to η. Let Pm (| p) be a prime ideal of Km whose Frobenius automorphism ρ is an extension of η. Then we have √ δ1 g(ρ) m#E(p) | δ1 g(p) ⇐⇒ m ² = 1 for ∀² ∈ o× F, √ where p is a prime number lying below p and m ² means all m-th roots of ². Proof. The left-hand side assertion is equivalent to m | δ1 g(p) and √ × m δ1 g(ρ) ²δ1 g(p)/m ≡ 1 mod p for ∀² ∈ o× ² is an F as (oF /p) is cyclic. Since δ1 g(p)/m m-th root of unity in Km for ² ∈ o× , the congruence ² ≡ 1 mod Pm F √ m δ1 g(ρ) ² = 1 by p - 2mDK . Therefore the left-hand side is equivalent to √ δ g(ρ) assertion is equivalent to m | δ1 g(p) and m ² 1 = 1 for ∀² ∈ o× F . Noting that the condition m | δ1 g(p) is contained in the second condition, taking 1 as ², we complete the proof. In the lemma, the right-hand side assertion holds for m = 1 and therefore #E(p) | δ1 g(p).

May 11, 2007

15:20


ws-procs9x6


47

We note that m#E(p) | δ1 g(p) ⇐⇒ m · h(p)/δ1 | [(oF /p)× : E(p)], where h(p)/δ1 is an integer by Lemma 2.2. We put for a natural number m ¯ n o √ δ g(ρ) ¯ Hm (η) := ρ ∈ Gal(Km /Q) ¯ ρ|K = η and m ² 1 = 1 for ∀² ∈ o× . F

√ δ g(ρ) Here m ² means all m-th roots of ² and so ζm1 = 1 for ρ ∈ Hm (η). Now we introduce another constant o n ¯ √ δ1 g(ρ) ¯ = 1 for ∀² ∈ o× , ∀ρ ∈ Gal(K /Q) with ρ = η . δ0 = max m ¯ m ² m |K F (2.3) The maximum is assured to exist, by applying Proposition 5.1 in the appendix to L = K, f (x) = δ1 g(x) with ² = 1. Then, taking m = δ0 in Lemma 2.3, we have ¯ #E(p) ¯ δ1 g(p)/δ0

for all prime ideals p corresponding to η. The evaluation of δ0 is not easy in general. Proposition 2.1. We have (δ0 , δ1 ) = 1 and δ0 | g(p) for a prime number p corresponding to η.

Proof. Let m be a divisor of (δ0 , δ1 ). Take ² = ²0 ∈ o× F so that the order of √ g(η) (δ /m)g(η) ²0 is δ1 ; then δ0 ²0 δ1 g(ρ) = 1 for any extension ρ of η implies ²0 1 = 1, which yields m = 1, i.e., (δ0 , δ1 ) = 1. Then, Lemma 2.3 implies δ0 | g(p). Proposition 2.2. Let p be a prime ideal corresponding to η. For a natural number m, which is not divisible by p, the condition m | δ1 g(p)/#E(p) holds if and only if ρ := σKm /Q (Pm ) ∈ Hm (η), where Pm is a prime ideal of Km lying above p and satisfies σK/Q (Pm ∩ K) = η. Proof. This is an immediate consequence of Lemma 2.3. 2.3. Conjecture The previous proposition means that for any given natural number m, the condition on p that δ1 g(p)/#E(p) is a multiple of m is characterized in terms of Frobenius automorphisms. Therefore, after some transformations, we can apply Chebotarev’s density theorem (see [7] for details).

May 11, 2007

15:20

48


ws-procs9x6

YOSHIYUKI KITAOKA

Theorem 2.1. Let m be a natural number. If p is a prime ideal of F and p is a prime number lying below it, then the density of the set n ¯ o ¯ p ¯ p6 | 2mδ0 DK , m#E(p) | g(p)δ1 /δ0 , and p corresponds to η

is equal to ¯ £© ª ¤−1 #Hmδ0 (η) σ ∈ Gal(K/F ) ¯ ση = ησ : Gal(K/F ) ∩ hηi . [Kmδ0 : Kη ] Here Kη is a subfield of K fixed by hηi. Then the usual procedure X p :#E(p)=g(p)δ1 /δ0

1=

X

µ(m)

m

X

1

p :m#E(p)|g(p)δ1 /δ0

suggests Conjecture 2.1. Denoting by den(η) ∞ ¯ £© ª ¤−1 X µ(m)#Hδ0 m (η) ¯ σ ∈ Gal(K/F ) ση = ησ : Gal(K/F ) ∩ hηi , [Kδ0 m : Kη ] m=1

and denoting a prime number and a prime ideal of F by p, p (p | p), we have o n ¯ ¯ # p ¯ p < x, p6 | 2DK , #E(p) = g(p)δ1 /δ0 and p corresponds to η ∼ den(η)Li(x).

That the infinite sum den(η) is convergent to a positive number is shown in [7]. We note that the condition p < x is used instead of NF/Q (p) < x, and so this is a modification of the usual natural density. This conjecture is a generalization of [2,6,12–14] and hence the conjecture for a real quadratic field K = F is true under the Generalized Riemann Hypothesis. When η ∈ Gal(K/F ), we know that d = 1 and g(x) = x − 1 in Lemma 2.1 and hence both σK/Q (P) = σK/F (P) and h(x) = 1 hold. Therefore the conjecture is true under G.R.H. by a result of [12]. The situation of [12] is as follows: Let K/F be a finite Galois extension and let C be a union of conjugacy classes of Gal(K/F ), and W is a finitely generated subgroup of F × of finite rank (≥ 1) modulo its torsion subgroup, and k is an integer (> 0). In [12], under G.R.H. it is shown that the density of the set M (F, K, C, W, k) of prime ideals p of F exists. Here p is in M (F, K, C, W, k) if and only if for a prime ideal P of K lying above p, the Frobenius automorphism σK/F (P) is in C, ordp (w) = 0 for all w ∈ W and the index [(oF /p)× : {w

May 11, 2007

15:20


ws-procs9x6


49

mod p | w ∈ W }] divides k. Hence the index is bounded. In contrast to this, our case allows that [(oF /p)× : E(p)] tends to infinity. 3. Case of rational primes Hereafter, we study the distribution of units modulo (p), writing E(p) for E((p)), where p is a rational prime, and we restrict ourselves to the case where K = F is a Galois extension of Q, and we let η ∈ Gal(F/Q). From Corollary 3.3 to the end of this section, we will assume η ∈ Z(Gal(F/Q)). Because, this yields that for ² ∈ o× F , we have ²η ≡ ²p mod p if a prime number p corresponds to η. 3.1. Structure of o× F as an η-module Lemma 3.1. Let d be a natural number. For a divisor m of d, we put Θm (x) =

d−1 µ X X

k=0

Then we have X

Θm (x) = d,

m|d

a mod m (a,m)=1

¶ ak ζm xk ∈ Z[x].

¯ ¯ xd − 1 ¯ Θm (x)Φm (x).

Proof. Let ζ be a d-th root of unity; then there exist a divisor m of d a and an integer a so that ζ = ζm , where m and a mod m ((a, m) = 1) are uniquely determined, and hence we have ¶ X jk ½ 0 X µ X if k 6≡ 0 mod d, ak ζm = ζd = d if k ≡ 0 mod d, a mod m m|d

(a,m)=1

j mod d

which yields X

Θm (x) = d.

m|d

Next, let us show that (xd − 1)/Φm (x) | Θm (x). Since a root of (xd − 1)/Φm (x) = 0 is not a primitive m-th root of unity, we have only to show that Θm (ζdb ) = 0 for every integer b so that ζdb , being a d-th root of unity, is

May 11, 2007

15:20


ws-procs9x6

YOSHIYUKI KITAOKA

50

not a primitive m-th root of unity. Let b be an integer; then for an integer a satisfying (a, m) = 1, we have da/m+b

ζd

= 1 ⇒ ad/m + b ≡ 0 mod d

⇒ am1 + b ≡ 0 mod mm1

( putting d = mm1 ) ( for ∃m2 ∈ Z)

⇒ b = m1 m2 , m2 ≡ −a mod m

⇒

ζdb

=

m2 ζm

is a primitive m-th root of unity.

This shows for (a, m) = 1 that if ζdb is not a primitive m-th root of unity, ad/m+b then ζd 6= 1 and so we have Θm (ζdb ) =

d−1 X X

a mod m (a,m)=1

ad/m+b k

(ζd

) = 0.

k=0

This completes the proof of (xd − 1)/Φm (x) | Θm (x). Lemma 3.2. For a divisor m of d, decompose xd − 1 as Φm (x)Ψm (x) = xd − 1. Then there exist polynomials um (x), vm (x) in Z[x] satisfying um (x)Φm (x) + vm (x)Ψm (x) = d.

(3.1)

Proof. We put directly as follows : um (x) = xΨ0m (x) − deg Ψm (x) · Ψm (x) ∈ Z[x], vm (x) = xΦ0m (x) − deg Φm (x) · Φm (x) ∈ Z[x]. Then we have um (x)Φm (x) + vm (x)Ψm (x) ¡ ¢ = xΨ0m (x) − deg Ψm (x) · Ψm (x) Φm (x) ¡ ¢ + xΦ0m (x) − deg Φm (x) · Φm (x) Ψm (x) ¡ ¢ = x Ψ0m (x)Φm (x) + Φ0m (x)Ψm (x) ¡ ¢ − deg Ψm (x) + deg Φm (x) Φm (x)Ψm (x)

= x(xd − 1)0 − d(xd − 1)

= d.

We fix η ∈ Gal(F/Q) and denote the order of η by d : #hηi = d.

(3.2)

May 11, 2007

15:20


ws-procs9x6


Proposition 3.1. Let m be a positive divisor of d. Then ¯ n o ¯ Φm (η) U (m) = u ∈ o× ∈ WF F ¯u

51

(3.3)

is an η-stable subgroup of o× F , and we have o× F

Θm (η)

, o× F

Ψm (η)

⊂ U (m),

d

o× F ⊂

Y

m|d

U (m) ⊂ o× F.

If η is in the center of Gal(F/Q), then U (m) is Gal(F/Q)-stable. Proof. It is easy to see that U (m) is η-stable, and if we assume that η is in the center of Gal(F/Q), uρΦm (η) = uΦm (η)ρ holds for ρ ∈ Gal(F/Q) and u ∈ o× F , and so U (m) is a Gal(F/Q)-stable subgroup. By previous lemmas, we know that Θm (x)Φm (x) ≡ Ψm (x)Φm (x) ≡ 0 mod xd − 1, whence Θm (η)Φm (η) = Ψm (η)Φm (η) = 0, which implies the left-hand side inclusion. Then Lemma 3.1 yields P Y ud = u m|d Θm (η) = uΘm (η) , m|d

which implies the right-hand side inclusion. Proposition 3.2. (i) Let um , vm be elements in U (m) and ζ ∈ WF . Then Y Y um = ζ vm m|d

m|d

implies um /vm ∈ WF ,

∀m | d.

(ii) Let q be a natural number and um ∈ U (m), ζ ∈ WF . If Y um ≡ ζ mod q, m|d

then there are roots κm ’s of unity in WF such that udm ≡ κm mod q,

∀m | d.

May 11, 2007

15:20

52


ws-procs9x6

YOSHIYUKI KITAOKA

Proof. To prove the assertions, we may assume ζ = vm = 1, taking the quotient of both sides and absorbing ζ −1 into u1 . Let um (x), vm (x), Ψm (x) be those in Lemma 3.2. The assertion (i) is proved as follows. Noting that Q −1 um = n|d un , we have by (3.1) n6=m

udm =

Y

un−um (η)Φm (η)−vm (η)Ψm (η)

n|d n6=m

=

µY

n|d n6=m

un

¶−vm (η)Ψm (η)

um (η)Φm (η) · um ,

which we rewrite as ¶ µY Φm (η)um (η) (unΦn (η) )−vm (η)(Ψm /Φn )(η) · um , udm = n|d n6=m

where we note that Φn (x) divides Ψm (x) if n 6= m. Hence, recalling (3.3), Φ (η) un n ∈ WF implies udm ∈ WF and so um ∈ WF . Q Next, we assume um ≡ 1 mod q; then similarly as above we have Y m (η)um (η) (unΦn (η) )−vm (η)(Ψm /Φn )(η) · uΦ mod q, udm ≡ m n|d n6=m

and the right-hand side is in WF and denoted by κm . Remark 3.1. In (ii), a stronger conclusion um ≡ κm mod q does not hold in general. Considering U (m)/WF as a Z-lattice, we put V (m) = U (m)/WF ⊗Z Q. f (x) ∈ Z[x] acts on U (m) by u 7→ uf (η) , and so U (m)/WF is a Z[x]-module annihilated by Φm (x). Hence Q[x]/(Φm (x)) acts on V (m). Thus V (m) is a vector space over Q(ζm ), and thus the following Lemma 3.3 (Exercise 2 on p.282 in [3]) is clear. Note that f (x) ∈ Q[x]/(Φm (x)) acts on Q(ζm ) by α 7→ f (ζm )α (α ∈ Q(ζm )). Lemma 3.3. As η-modules, we have ¡ ¢ M ∼ Q ⊗Z o× Q[di ], F /WF = i

where Q[di ] is Q(ζdi ) viewed as a representation space of η, on which η acts by αη = ζdi α for α ∈ Q(ζdi ), and di is a divisor of the order d of η.

May 11, 2007

15:20


ws-procs9x6

DISTRIBUTION OF UNITS ϕ(di )−1

Now let 1, ζdi , · · · , ζdi

53

be a basis of Z[ζdi ] ( ⊂ Q[di ] ) and put

Φdi (x) = a0 + a1 x + · · · + aϕ(di )−1 xϕ(di )−1 + xϕ(di ) . Then we have 1η = ζdi , ζdηi = ζd2i , · · · , ³ ´ n oη ϕ(d ) ϕ(d )−1 ϕ(d )−1 = ζdi i = − a0 + a1 ζdi + · · · + aϕ(di )−1 ζdi i . ζdi i

Hence denoting by Ui the subgroup of o× F corresponding to nZ[ζdi ] for an appropriate natural number n in Lemma 3.3 where n is sufficiently large Q to kill the ambiguity of WF , Ui is a subgroup of finite index of o× F , and each U = Ui has a basis U = h²0 , ²1 , · · · , ²ϕ(di )−1 i (²j ↔ ζdji ) such that ²ηi = ²i+1 (i = 0, 1, · · · , ϕ(di ) − 2),

aϕ(d

²a0 0 ²a1 1 · · · ²ϕ(dii)−1 ²ηϕ(di )−1 = 1. )−1

Lemma 3.4. For the subgroup U = Ui above, and h(x) ∈ Z[x], we have ¯ U h(η) ⊂ WF ⇔ Φdi (x) ¯ h(x)

Proof. The assertion follows from

¯ U h(η) ⊂ WF ⇔ h(ζdi )Z[ζdi ] = 0 ⇔ h(ζdi ) = 0 ⇔ Φdi (x) ¯ h(x).

Corollary 3.1. Let g(x) be the polynomial defined in the previous section for K = F and η, i.e. the monic polynomial in Z[x] of minimal degree such that ¯ n o ¯ ²g(η) ¯ ² ∈ o× F

is a finite group. Then g(x) is equal to lcmi Φdi (x) =

Y

Φm (x).

m|d,U (m)6=WF

Proof. By Lemma 3.4, the following equivalence holds for h(x) ∈ Z[x] ¯ n o ¯ h(η) ²h(η) ¯ ² ∈ o× ⊂ WF ⇔ Ui ⊂ WF for ∀i ⇔ Φdi | h for ∀i. F

Thus we have g(x) = lcmi Φdi (x). Similarly for U (m) in (3.3), it is easy to see ¯ n o ¯ ²h(η) ¯ ² ∈ o× ⊂ WF ⇔ U (m)h(η) ⊂ WF for ∀m ⇔ Φm | h for ∀m, F

where m should satisfy the condition U (m) 6= WF . Because, the first equivalence is obvious, and the right-hand side divisibility implies the middle

May 11, 2007

15:20

54


ws-procs9x6

YOSHIYUKI KITAOKA

inclusion. Assume the middle inclusion. If Φm (x) - h(x), then there are polynomials f1 (x), f2 (x) ∈ Z[x] such that f1 (x)Φm (x) + f2 (x)h(x) = e ∈ Z (e 6= 0), and hence U (m)e ⊂ WF , which yields U (m) ⊂ WF . This contradicts U (m) 6= WF and hence we obtain the right-hand side divisibility. Q Thus we have g(x) = m|d,U (m)6=WF Φm (x). Theorem 3.1. For an integer p (6= ±1), we have Y £ × η−p ¤ oF : WF o× = |Φdi (p)|, F i

where di ’s are those in Lemma 3.3.

To prove the theorem, we need some lemmas. η−p Lemma 3.5. For ² ∈ o× ∈ F and for an integer p (6= ±1), the inclusion ² × WF implies ² ∈ WF . Moreover, let oF ⊃ U ⊃ V ⊃ WF be η-groups; then the mapping φ : ² 7→ ²η−p from U to WF U η−p induces an isomorphism

U/V ∼ = WF U η−p /WF V η−p . Proof. Suppose ²η−p ∈ WF for ² ∈ o× F . Inductively, it is easy to see that there is an element κn ∈ WF such that n

n

²η = κn ²p . d

d

The assumption η d = id yields ² = κd ²p . Hence we have ²1−p = κd ∈ WF , which implies ² ∈ WF by 1 − pd 6= 0. Next, suppose φ(²) ∈ WF V η−p for ² ∈ U ; then ²η−p = ζv η−p (ζ ∈ WF , v ∈ V ) holds. Thus (²/v)η−p = ζ implies ²/v ∈ WF and ² ∈ V , which completes the proof. Lemma 3.6. Let U1 , U2 , U be η-subgroups of o× F and suppose U1 U2 ⊂ U,

U1 ∩ U2 = WF ,

[U : U1 U2 ] < ∞.

Then we have [U : WF U η−p ] = [U1 : WF U1η−p ][U2 : WF U2η−p ]. Proof. A canonical mapping (u1 , u2 ) 7→ u1 u2 from U1 ×U2 to U1 U2 induces a surjective homomorphism η−p

f : U1 × U2 → U1 U2 /WF (U1 U2 )

,

May 11, 2007

15:20


ws-procs9x6


55

and it is easy to see ker f ⊃ WF U1η−p × WF U2η−p and η−p

(u1 , u2 ) ∈ ker f ⇒ u1 u2 ∈ WF (U1 U2 )

η−p

⇒ u1 u2 = ζ(v1 v2 )

⇒ ζ 0 :=

u1

v1η−p

=ζ

v2η−p u2

(ζ ∈ WF , vi ∈ Ui ) ∈ U1 ∩ U2 = WF

⇒ u1 = ζ 0 v1η−p , u2 = (ζ/ζ 0 )v2η−p

Hence we have ker f ⊂ WF U1η−p × WF U2η−p and so ker f = WF U1η−p × WF U2η−p , which implies η−p

[U1 U2 : WF (U1 U2 )

] = [U1 : WF U1η−p ][U2 : WF U2η−p ].

(3.4)

Lemma 3.5 yields η−p

[U : U1 U2 ] = [WF U η−p : WF (U1 U2 )

].

(3.5)

From (3.4) and (3.5) we have η−p

[U : WF U η−p ] =

[U : U1 U2 ][U1 U2 : WF (U1 U2 ) η−p [WF U η−p : WF (U1 U2 ) ]

]

= [U1 : WF U1η−p ][U2 : WF U2η−p ]. Lemma 3.7. Suppose for an η-subgroup U we have ¯ n o ¯ U = WF ²f (η) ¯ f (x) ∈ Z[x]

for some ² ∈ o× F . Let h(x) ∈ Z[x] be a primitive polynomial of minimal degree such that U h(η) ⊂ WF . Then U/WF U η−p is a cyclic group generated by a coset ²WF U η−p and the following holds: £ ¤ U : WF U η−p = |h(p)|, ¯ ½ ¾ ¯ η−p A(η) ¯ A(x) ∈ Z[x] with deg A(x) < deg h(x) and WF U = WF ² . ¯ A(p) ≡ 0 mod h(p) d

Proof. By the assumption η d = id, we have U η −1 = {1} ⊂ WF and so the polynomial h(x) referred to in the lemma exists. Dividing xd − 1 by h(x), we write xd − 1 = q(x)h(x) + r(x) (q(x), r(x) ∈ Q[x], deg r(x) < deg h(x)),

and choose a non-zero integer a such that aq(x), ar(x) ∈ Z[x]. Then by virtue of ²ar(η) = ²a(η

d

−1)−aq(η)h(η)

= (²h(η) )−aq(η) ∈ WF ,

May 11, 2007

15:20

56


ws-procs9x6

YOSHIYUKI KITAOKA

we have r(x) = 0 by the choice of h(x). Hence xd − 1 = q(x)h(x), and we may assume that h(x) is monic. We let its degree be n. Because of ² ∈ U , ²η−p ∈ U η−p is clear and hence we have ²η WF U η−p = p ² WF U η−p , and so U/WF U η−p is a cyclic subgroup generated by ²WF U η−p . Since h(x) is a monic polynomial of degree n, we have n−1 ® U = WF ², ²η , · · · , ²η .

We note that ²A(η) ∈ WF for a polynomial A(x) ∈ Z[x] with deg A(x) < deg h(x) implies A(x) = 0. Because, ²A(η) ∈ WF yields U A(η) ⊂ WF and therefore the definition of h(x) implies A(x) = 0. Now, let us show the second assertion; put A(x) = a0 + a1 x + · · · + an−1 xn−1 ∈ Z[x].

v = ²A(η) ∈ U,

We shall show that v ∈ WF U η−p is equivalent to A(p) ≡ 0 mod h(p). To this end, write h(x) =

n X

hi xi ,

hn = 1.

i=0

First, assume v = κuη−p ∈ WF U η−p and put u = ²b0 +b1 η+···+bn−1 η we have v = κ²(b0 +b1 η+···+bn−1 η = κ²b0 η+b1 η

2

n−1

n−1

; then

)(η−p)

n

+···+bn−1 η −p(b0 +b1 η+···+bn−1 η n−1 )

= κ²bn−1 h(η) ×²b0 η+b1 η

2

+···+bn−2 η n−1 −bn−1 (h0 +···+hn−1 η n−1 )−p(b0 +b1 η+···+bn−1 η n−1 )

.

By the choice of h(x), ²bn−1 h(η) ∈ WF , whence comparing the exponent of ², we obtain a0 = −bn−1 h0 − pb0 , ak = bk−1 − bn−1 hk − pbk , Pn Hence, putting B(x) = k=1 bk−1 xk−1 , we get B(x) =

n−1 X

1 ≤ k ≤ n − 1.

(bn−1 hk + pbk + ak )xk−1 + bn−1 xn−1 ,

k=1

which we may rewrite as bn−1 (h(x) − h0 )/x + p(B(x) − b0 )/x +

n−1 X k=1

ak xk−1 ,

May 11, 2007

15:20


ws-procs9x6


57

whence (x − p)B(x) = bn−1 h(x) − bn−1 h0 − pb0 +

n−1 X

ak xk = bn−1 h(x) + A(x).

k=1

Substituting x = p, we have A(p) = −bn−1 h(p), i.e., h(p) | A(p). If, conversely h(p) | A(p) holds, then we define bn−1 ∈ Z by A(p) = −bn−1 h(p). Then x − p divides bn−1 h(x) + A(x) and we may put bn−1 h(x) + A(x) = (x − p)B(x),

B(x) ∈ Z[x].

The leading coefficient of B(x) is bn−1 and so we may put B(x) = Pn−1 k A(η) = k=0 bk x for some integers b0 , · · · , bn−2 . Then we have v = ² h(η) −bn−1 B(η) η−p h(η) (² ) (² ) . Since by the choice of h(x), ² ∈ WF , we obtain v ∈ WF U η−p . Thus we have shown the equivalence and the last assertion in the lemma. Since U/WF U η−p is generated by ²WF U η−p , the index [U : WF U η−p ] is equal to the order of ²WF U η−p . Applying the last assertion to A(x) = m ∈ Z, we conclude that the condition ²m ∈ WF U η−p is equivalent to m ≡ 0 mod h(p). Hence the second assertion [U : WF U η−p ] = |h(p)| follows. Proof of Theorem 3.1. By Lemma 3.3, there are η-subgroups Ui of o× F such that Ui /WF ∼ /W . = Z[ζdi ] and Ui /WF ’s form a direct product in o× F F [Ui : WF Uiη−p ] = |Φdi (p)| follows from Lemma 3.7, and then Lemma 3.6 completes the proof of the theorem. Corollary 3.2. Suppose that p(6= ±1) is an integer; then we have for U (m) defined in (3.3) £ ¤ U (m) : WF U (m)η−p = |Φm (p)|r , U (m)Φm (p) ⊂ WF U (m)η−p ,

where r is defined by rϕ(m) = rankZ U (m). Proof. Recalling that Q ⊗Z (U (m)/WF ) is a vector space over Q(ζm ), we denote its dimension by r. Therefore U (m) contains a subgroup which is isomorphic to a direct product of r copies of Z[ζm ] as η-modules. Then the first equation follows from Lemmas 3.6 and 3.7. Let u ∈ U (m); then uΦm (η)−Φm (p) = uΦm (η,p)(η−p) ∈ U (m)η−p (cf. Notation) and U (m)Φm (η) ⊂ WF (cf. (3.3)) together imply uΦm (p) ∈ WF U (m)η−p . From now on, we assume η ∈ Z(Gal(F/Q)).

May 11, 2007

15:20

58


ws-procs9x6

YOSHIYUKI KITAOKA

Corollary 3.3. Suppose that η be in the center of Gal(F/Q), and a prime number p ( - 2DF ) satisfies η = σF/Q (p) (cf. Notation). Then for a canonical surjective mapping ιp : o× F → E(p)/WF defined by ² 7→ ² mod p we have #E(p) = w

× [o× F : WF oF

[ker ιp :

η−p

]

η−p WF o× ] F

=

w

Q

i

|Φdi (p)|

[ker ιp : WF o× F

η−p

,

(3.6)

]

where w = #WF . Proof. Since η is in the center of Gal(F/Q), it follows from η = σF/Q (p) × η−p that ²η−p ≡ 1 mod p holds for ² ∈ o× ⊂ ker ιp , F , and so we have WF (oF ) whence by the homomorphism theorem #(E(p)/WF ) = #E(p)/w =

× [o× F : WF oF

[ker ιp :

η−p

]

η−p WF o× ] F

=

Q

i

|Φdi (p)|

[ker ιp : WF o× F

η−p

]

by Theorem 3.1. In regard to this, under the assumption η ∈ Z(Gal(F/Q)), we put £ η−p ¤ Relη = gcd ker ιp : WF o× , F

(3.7)

p

˜ where prime numbers p satisfy σF/Q (p) = η and p - 2DF∆˜ for a constant ∆ defined in the next subsection. Then we have ¯ Q ¯ w i |Φdi (p)| #E(p) ¯¯ . Relη

This upper bound seems to be the best one. Although we do not know how to evaluate Relη , there is a candidate κ(η) for it, which is a divisor of Relη by definition. We will explain it in the next subsection, and in §4, we describe κ(η) explicitly for several types of algebraic number fields.

May 11, 2007

15:20


ws-procs9x6


59

3.2. Relη and κ(η) In this subsection, we define a candidate κ(η) for Relη and in §3.3, we rewrite it to evaluate easily it, and in §4, we write it down explicitly for several types of algebraic number fields. Computer experiments convince us of the truth of the conjecture. As before, let η ∈ Z(Gal(F/Q)) and let the polynomial g(x) be as in Corollary 3.1. We put ¯ n o ˜ = max t ∈ N ¯¯ ζtg(ρ) = 1 for ∀ρ ∈ Gal(F (ζt )/Q) with ρ|F = η ∆ (3.8)

and for a divisor m of d (cf. (3.2)) and an extension η˜ ∈ Gal(F∆ ˜ /Q) of η, put n ¯ o ¯ Φ (˜η) ˜ , τm = τm (˜ η ) = max t ¯ ζt m = 1, t|∆ ³q ´ ˜ ∆ ˜ where F∆ o× ˜ = F F . The existence of ∆ is guaranteed by Proposition 5.1. By defining an integer a by η ˜ a ζ∆ ˜, ˜ = ζ∆

it is easy to see that ˜ τm = (Φm (a), ∆),

(3.9)

˜ and if o× F = U (m), then we have g(x) = Φm (x) and τm = ∆ by Corollary 3.1. Note that for a prime number p ( - 2DF∆˜ ) with η˜ ∈ σF∆/Q (p), τm ˜ Φ (p)

Φ (˜ η)

= 1 mod p for a prime ideal p ≡ ζτmm divides Φm (p) because of ζτmm lying above p, and we may put ¯   ¯ Y  ¯ (i) vm ∈ U (m), Q vm ¯¯ . (3.10) R(˜ η) = Φm (p)/τm  ≡ ζ mod p for ∃ζ ∈ WF  ¯ (ii) m|d vm m|d

This is well-defined by Proposition 3.2 and forms a group. Moreover it is independent of the choice of a prime p, which follows from the following proposition. Proposition 3.3. Let η˜ ∈ Gal(F∆ ˜ /Q) be an extension of η. Suppose that a prime number p ( - 2DF∆˜ ) satisfies σF∆˜ /Q (p) 3 η˜, and vm ∈ U (m), ζ ∈ WF ; then we have Y Φm (p)/τm vm ≡ ζ mod p m|d

⇔

Y √ τm

m|d

vm

Φm (ρ˜ η ρ−1 )

= ζ for ∀ρ ∈ Gal(F∆ ˜ /Q).

May 11, 2007

15:20

60


ws-procs9x6

YOSHIYUKI KITAOKA

Proof. Suppose a prime ideal p of F∆ ˜ = σF∆˜ /Q (p); ˜ lying above p satisfy η then we have, for ρ ∈ Gal(F∆ /Q) ˜ Y Φm (p)/τm vm ≡ ζ mod p m|d

⇒ζ≡ ⇒ζ=

Y √ τm

vm

Φm (p)

m|d

Y √ τm

vm

≡

Y √ τm

vm

Φm (ρ˜ η ρ−1 )

−1

mod pρ

m|d

Φm (ρ˜ η ρ−1 )

,

m|d

on noting that the right-hand side is a root of unity in F∆ ˜ by η ∈ Φ (η) Z(Gal(F/Q)) and vmm ∈ WF . We may trace the above argument in the reverse way to prove the converse. (p) 3 η˜, we define a For a prime number p ( - 2DF∆˜ ) satisfying σF∆/Q ˜ mapping Y φp : U (m) → o× F /WF m|d

by φp

µY

vm

m|d

¶

=

Y

Φm (p)/τm . vm

(3.11)

m|d

It is well-defined in view of Φm (p)/τm ∈ Z and Proposition 3.2 and we see that ιp ◦ φp (R(˜ η )) = {1},

(3.12)

by the definition of R(˜ η ) and ιp in Corollary 3.3. Proposition 3.4. For vm ∈ U (m) and an integer p (6= ±1), we have ³Y ´ Y ˜ η−p ∆ ˜ m Φm (η,p)∆/τ φp vm ∈ WF o× ∈ WF o× ⇔ vm F F ,

where Φm (x, y) = (Φm (x) − Φm (y))/(x − y) as in the notation. Proof. It is easy to see by (3.11) ³Y ´ Y η−p Φm (p)/τm φp vm ∈ WF o× ⇔ vm · ²−(η−p) ∈ WF , F

which is equivalent to Y

˜

˜

Φm (p)∆/τm vm · ²−(η−p)∆ ∈ WF ,

∃² ∈ o× F, (3.13)

May 11, 2007

15:20


ws-procs9x6

DISTRIBUTION OF UNITS ˜ m Φ (η)∆/τ

˜

m ∆ noting that for u ∈ o× F , u ∈ WF if and only if u ∈ WF . Since vm WF holds by (3.9) and (3.3), (3.13) is equivalent to Y ˜ m ˜ (Φm (η)−Φm (p))∆/τ vm · ²(η−p)∆ ∈ WF ³Y ´ ˜ m ˜ η−p Φm (η,p)∆/τ ⇔ vm · ²∆ ∈ WF Y ˜ m ˜ Φm (η,p)∆/τ ⇔ vm · ²∆ ∈ WF , (by Lemma 3.5)

61

∈

which completes the proof.

Proposition 3.5. For an extension η˜ ∈ Gal(F∆ ˜ /Q) of η and a prime number p ( - 2DF∆˜ ) satisfying η˜ ∈ σF∆˜ /Q (p), we put R(˜ η , p) = φp (R(˜ η ))WF o× F

η−p

(⊂ o× F ),

η ˜ a where the image of φp is viewed in o× ˜. ˜ = ζ∆ F and define an integer a by ζ∆ Then, we have £ η−p ¤ R(˜ η , p) : WF o× F ¯ ¾¸ · ½Y Y ¯ ˜ ∆ ˜ m Φm (η,a)∆/τ vm ¯¯ vm ∈ U (m), vm ∈ WF o× , = R(˜ η) : F m|d

m|d

which is independent of the choice of p. η−p

× Proof. Let us see first φ−1 ) ⊂ R(˜ η ). Let vm ∈ U (m) and supp (WF oF Q Q η−p × pose φp ( vm ) ∈ WF oF ; we must show that vm ∈ R(˜ η ). The supposition yields ³Y ´ η−p φp vm ∈ WF o× F Y ˜ ∆ ˜ m Φm (η,p)∆/τ ⇒ vm ∈ WF o× ( by Proposition 3.4) F Y ˜ ∆(η−p) ˜ m (Φm (η)−Φm (p))∆/τ ⇒ vm ∈ WF o× F Y ˜ m ˜ Φm (p)∆/τ = ζ²∆(η−p) (ζ ∈ WF , ² ∈ o× ⇒ vm F) Y Φm (p)/τm ⇒ vm = ζ 0 ²η−p . Q Φ (p)/τm η−p Here ζ 0 is a root of unity and lies in WF , because vmm , ² ∈ F. Therefore, we have Y Φm (p)/τm vm = ζ 0 ²η−p ≡ ζ 0 mod p Q and so vm ∈ R(˜ η ). Now we have by the second homomorphism theorem £ £ η−p ¤ η−p ¤ R(˜ η , p) : WF o× = φp (R(˜ η )) : φp (R(˜ η )) ∩ WF o× , F F

May 11, 2007

15:20


ws-procs9x6

YOSHIYUKI KITAOKA

62

and it is equal to £ ¤ × η−p × η−p R(˜ η ) : φ−1 ) ( by φ−1 ) ⊂ R(˜ η )) p (WF oF p (WF oF ¯ · ½Y ¾¸ Y ¯ ˜ ∆ ˜ m Φm (η,p)∆/τ = R(˜ η) : vm ¯¯ vm ∈ U (m), vm ∈ WF o× , F

˜ and therefore by Proposition 3.4. The definition of a implies a ≡ p mod ∆ Φ (η,p)−Φm (η,a)

vmm

˜ ∆

∈ o× F , which completes the proof.

Since by (3.12), R(˜ η , p) ⊂ ker ιp holds, we have ¯ £ η−p ¤ η−p ¤ ¯ £ , R(˜ η , p) : WF o× ¯ ker ιp : WF o× F F

and

¯ £ ¤¯ × η−p ¯ R(˜ η , p) : WF oF ¯

gcd σF

(p) 3 η, ˜ ˜ /Q ∆ p-2DF ˜ ∆

£

ker ιp : WF o× F

η−p ¤

,

since the left index is independent of the choice of p( - 2DF∆˜ ) by Proposition 3.5. Therefore, putting £ η−p ¤ κ(η) = gcd R(˜ η , p) : WF o× (3.14) F η ˜|F =η

we have

¯ ¯ κ(η) ¯¯

gcd σF /Q (p) = η, p-2DF ˜ ∆

£

ker ιp : WF o× F

η−p ¤

,

where the right-hand side is Relη by definition (cf.(3.7)). Hence we have ¯ ¯£ η−p ¤ ¯ ¯ κ(η) ¯ Relη ¯ ker ιp : WF o× F

for prime numbers p which satisfies η ∈ σF/Q (p) and p - 2DF∆˜ . Thus, we have shown with (3.6), Theorem 3.2.

¯ Q ¯ w i |Φdi (p)| . #E(p) ¯¯ κ(η)

(3.15)

We expect κ(η) = Relη , and we conjecture that for infinitely many primes p, “|” is replaced by “=” in (3.15). Note that if there is at least one prime p such that . Y £ η−p ¤ κ(η) = w |Φdi (p)| #E(p) (= ker ιp : WF o× ), F

May 11, 2007

15:20


ws-procs9x6


63

then κ(η) = Relη holds. The computer experiment supports this in all the examples in §4. To proceed to the next step, we need to know in terms of Frobenius η−p automorphisms the condition on p for which [ker ιp : WF o× ]/κ(η) is a F multiple of a natural number m (cf. Proposition 2.2). Successful cases are some number fields with rank o× F = 1 [8], and cubic abelian fields [9]. Remark 3.2. It is desirable to generalize the prime number case to more general situation in case of “modulo prime ideal” in the previous section. 3.3. Evaluation of κ(η) In this subsection, we give another description of the index [R(˜ η , p) : × η−p WF oF ] and κ(η) convenient for evaluation. 3.3.1. Action of automorphisms √ First, we study the explicit action of η˜ on ∆ ² as a preparation. Let ∆ be a natural number and U a Gal(F/Q)-stable subgroup of o× F such that ® U = ζw , u1 , · · · , us , (3.16) where ζw is a primitive w-th root of unity and ui ’s are multiplicatively independent. Therefore {u1 , · · · , us } is a basis of U/WF as a Z-module. For a polynomial with integral coefficients h(x) = hn xn + hn−1 xn−1 + · · · + h0 , we assume U h(η) ⊂ WF

(3.17)

and write, as in the introduction h(x, y) = (h(x) − h(y))/(x − y) =

n X t=1

ht

t−1 X

xt−k−1 y k .

k=0

We suppose η ∈ Z(Gal(F/Q)) as before, and let η˜ be an extension of η to √ Gal(F∆ /Q), and fix a ∆-th root ∆ uj ∈ F∆ once and for all. Write Y √ a √ η˜ η ˜ ai a ij ∆ u ζ∆w = ζ∆w , ∆ ui = ζ∆w , (3.18) j j

and similarly for ρ ∈ Gal(F∆ /Q) ρ b ζ∆w = ζ∆w ,

√ ∆

ρ

bi ui = ζ∆w

Y √ ∆ j

uj bij ,

(3.19)

May 11, 2007

15:20

64

and


ws-procs9x6

YOSHIYUKI KITAOKA

 b1   b =  ...  ,

 a1   a =  ...  ,





A = (aij ), B = (bij ).

bs

as

Lemma 3.8. We have

ρη = ηρ on U ⇔ ba + Ab ≡ ab + Ba mod w, and AB = BA. Proof. The assertion follows, comparing P P ³ Y ´ρ Y n Y b oaij bai + j aij bj Y aij j aij bjk jk ai bai bj uηρ = ζ = ζ u u ζ u = ζ w w w w i j k k j

k

k

and P P ³ Y ´η Y a obij Yn abi + j bij aj Y bij j bij ajk jk bi aj abi . u uρη = ζ = ζ u u ζ = ζ w w w w i j k k j

k

k

Lemma 3.9. Putting Ak = (aij (k)) for each non-negative integer k, we have Y √ a (k) √ η ˜k αi (k) ij ∆ ∆ u ui = ζ∆w , (3.20) j j

where αi (k) is defined by  if k = 0,  0 t t (α1 (k), · · · , αs (k)) = (a1 , a2 , · · · , as ) if k = 1, (3.21)   k−1 k−2 k−1 (a +a A + ··· + A )a if k > 1.

Proof. The case of k = 0, 1 is clear. Inductively, we see the assertion, using Y n a Y √ a oaij (k) √ η˜k+1 αi (k)a j ∆ ∆ = ζ∆w ζ∆w ui uk jk =

αi (k)a+ ζ∆w

j P

k

j

aij (k)aj

Y √ ∆

uk

P

k

Lemma 3.10. We have h(η,a)

ui

∈ WF

Y

h(a,A)(i,j)

uj

j

where h(a, A)(i,j) is the (i, j)-entry of h(a, A).

,

j

aij (k)ajk

.

May 11, 2007

15:20


ws-procs9x6


65

Proof. The assertion follows from h(η,a)

ui

Pn

= ui

t=1

∈ WF = WF

Pt−1

k=0

s Y

ht at−k−1 η k

Pn

uj

t=1

Pt−1

k=0

ht at−k−1 aij (k)

(by Lemma 3.9)

j=1

Y

h(a,A)(i,j)

uj

.

j

Lemma 3.11. For an integral vector x = (x1 , . . . , xs ), we put Y √ x √ ∆ ∆ ²= ui i .

Then we have

√ ∆

h(˜ η)

²

=

Y √ ∆

ui

h(˜ η )xi

xh(a,A)a

= ζ∆w

i

and

h(A) = 0. Proof. We have by (3.20) √ ∆

ui

η) h(˜

=

n Y √ ∆

ui

hk η ˜k

P

= ζ∆wk

hk αi (k)

Y √ ∆

uj

P

k

aij (k)hk

.

j

k=0

P h(η) The assumption ui ∈ WF (cf. (3.17)) yields k aij (k)hk = 0, i.e., h(A) = P 0, and k hk αi (k) is the i-th component of h(a, A)a by (3.21), from which the first assertion follows. Lemma 3.12. For ρ−1 , we put Y √ b0 √ ρ−1 b0i ρ−1 b0 ij ∆ u , ∆ ui ζ∆w = ζ∆w = ζ∆w , j j

b0 = t (b01 , · · · , b0s ).

(3.22)

(b0ij ) = B −1 .

(3.23)

Then we have bb0 ≡ 1 mod ∆w,

b0 b ≡ −Bb0 mod ∆w,

Proof. By (3.19), we have −1

0

ρρ bb ζ∆w = ζ∆w = ζ∆w ,

and the equation P P √ √ ρρ−1 bi b0 + j bij b0j Y √ b b0 ∆ ∆ ui = ∆ ui = ζ∆w uk j ij jk . k

May 11, 2007

15:20

66


ws-procs9x6

YOSHIYUKI KITAOKA

The first equation implies the first congruence in (3.23) and together with multiplicative independence of ui ’s the second equation implies both (b0ij ) = B −1 and the second congruence b0 b + Bb0 ≡ 0 mod ∆w. Lemma 3.13. Putting Y √ q √ ρ˜ η ρ−1 qi ij ∆ ∆ u ui = ζ∆w , j

q = t (q1 , · · · , qs ),

(3.24)

we have

q ≡ b0 {(a − A)b + Ba} mod ∆w.

qij = aij , −1

Proof. By uρηρ = uηi , we have qij = aij . Since we have i √ ρ˜ η ρ−1 ∆ ui n Y √ b oη˜ρ−1 bi ij ∆ u ( by (3.19) ) = ζ∆w j =

n

bi a+ ζ∆w

j P

=

bij aj

YnY √ ∆ j

b0 (bi a+

= ζ∆w

j

P

j

bij aj )

uk

ajk

k

obij oρ−1

( by (3.18) )

Y n b0 Y √ b0 obij ajk k ∆ ζ∆w u` kl

j,k ` P P b0 (bi a+ j bij aj )+ j,k b0k bij ajk ζ∆w

Y √ ∆

u`

ai`

,

( by (3.22) ) ( by Lemma 3.8 )

`

it is easy to see by comparing this with (3.24) q ≡ b0 (ab + Ba) + BAb0 ≡ b0 (ab + Ba) + ABb0 0

0

≡ b (ab + Ba) − Ab b

( by Lemma 3.8) ( by Lemma 3.12)

0

≡ b {(a − A)b + Ba} mod ∆w. Corollary 3.4. For √ ∆

²=

we have ³√ ∆

h(ρ˜ η ρ−1 )

²

´b

Y √ ∆

x

ui i ,

x{h(a)b+h(a,A)Ba}

= ζ∆w

.

Proof. Using Lemmas 3.11 and 3.13, we have Y √ h(ρ˜ηρ−1 )x √ η ρ−1 ) xh(a,A)q xh(a,A)b0 {(a−A)b+Ba} i ∆ h(ρ˜ ∆ ² = ui = ζ∆w = ζ∆w . i

May 11, 2007

15:20


ws-procs9x6


67

Noting that h(a, A)(a − A) = h(a) − h(A) = h(a), we have h(a, A){(a − A)b + Ba} ≡ h(a)b + h(a, A)Ba mod ∆w, which completes the proof. 3.3.2. Evaluation of κ(η) With the preparation in the previous subsubsection, we may now give a η−p formula for the index [R(˜ η , p) : WF o× ], which is easier to evaluate. For F η˜ ∈ Gal(F∆ /Q) with η ˜ = η, we recall (3.10) on the form ˜ |F ¯   ¯ (i) vm ∈ U (m), Y  ¯ Q √ Φm (˜η) √ Φm (ρ˜ηρ−1 ) vm ¯¯ (ii) Q τm R(˜ η) = τ m vm = vm ∈ WF for ∀ρ ,  ¯ m|d m|d m|d by Proposition 3.3.

Lemma 3.14. Recalling (3.16),(3.18),(3.19), we put ® U (m) = ζw , um,1 , · · · , um,sm , Y √ (m) √ am,j η ˜ a ˜ ˜ ∆ ∆ um,j η˜ = ζ∆w um,k ajk , ζ∆w = ζ∆w ˜ , ˜ ˜ k

√ ˜ ∆

ρ

um,i =

bm,i ζ∆w ˜

Y √ ˜ ∆

(m)

um,j bij ,

ρ b = ζ∆w ζ∆w ˜ , ˜

j

(m)

t

am = (am,1 , · · · , am,sm ),

A(m) = (aij ),

t

bm = (bm,1 , · · · , bm,sm ),

B (m) = (bij ).

(m)

Then for vm =

Y

y

m,j , um,j

j

ym = (ym,1 , · · · , ym,sm ),

(3.25)

Q the condition m vm ∈ R(˜ η ) is equivalent to (P ˜ m )ym Φm (a, A(m) )am ≡ 0 mod ∆, ˜ (∆/τ (#) Pm ˜ m )ym {Φm (a)bm + Φm (a, A(m) )(B (m) − b)am } ≡ 0 mod ∆w ˜ (∆/τ m

for every ρ ∈ Gal(F∆ ˜ /Q). Proof. By putting

˜ m, xm,j = ym,j ∆/τ

xm = (xm,1 , · · · , xm,sm ),

May 11, 2007

15:20


ws-procs9x6

YOSHIYUKI KITAOKA

68

the condition

Q

m

Y³Y √ ˜ ∆ m

vm ∈ R(˜ η ) amounts to clearly

um,j xm,j

j

´Φm (ρ˜ηρ−1 )

=

Y³Y √ ˜ ∆ m

um,j xm,j

j

´Φm (˜η)

∈ WF .

By Lemma 3.11, we have ´Φm (˜η) ³Y √ xm Φm (a,A(m) )am ˜ ∆ = ζ∆w um,j xm,j , ˜ j

while by Corollary 3.4 ³Y √ ´Φm (ρ˜ηρ−1 ) b0 xm {Φm (a)bm +Φm (a,A(m) )B (m) am } ˜ ∆ um,j xm,j = ζ∆w , ˜ j

Q ρ−1 b0 = ζ∆w on putting ζ∆w η ) is equivalent ˜ . Hence the condition ˜ m vm ∈ R(˜ to Y b0 x {Φ (a)b +Φ (a,A(m) )B (m) a } Y x Φ (a,A(m) )a m m m m m m m m = ζ∆w ζ∆w ∈ WF . (3.26) ˜ ˜ m

m

It is easy to see that Q ⇔ ⇔ ⇔

xm Φm (a,A(m) )am ∈ WF ˜ m ζ∆w Q xm Φm (a,A(m) )am ζ˜ =1 Pm ∆ (m) ˜ x Φ (a, A )am ≡ 0 mod ∆ Pm ˜m m (m) )am ≡ 0 m (∆/τm )ym Φm (a, A

and the equality in (3.26) is equivalent to X b0 xm {Φm (a)bm + Φm (a, A(m) )B (m) am } m

≡

X

˜ mod ∆,

˜ xm Φm (a, A(m) )am mod ∆w,

m

which completes the proof. Remark 3.3. The condition (#) depends only on (i) ym mod τm , (ii) b, bm mod w, i.e., on ρ|F , (iii) am mod wτm . Further, (iv) am mod w is uniquely determined by η.

May 11, 2007

15:20


ws-procs9x6


69

With respect to the assertion (i), we have only to note that Φm (a)bm + Φm (a, A(m) )(B (m) − b)am

= Φm (a, A(m) ){(a − A(m) )bm + (B (m) − b)am }

≡ 0 mod w by Lemma 3.8.

(3.9) implies Φm (a) ≡ 0 mod τm , which implies the assertion on bm . The assertion on b follows from the first equation of (#). The statements (iii),(iv) are obvious. Lemma 3.15. Let vm ∈ U (m) and ym be as in the previous lemma; then the condition Y ˜ ∆ ˜ m Φm (η,a)∆/τ vm ∈ WF o× F m|d

is equivalent to (\)

YY

P

um,ji

˜ m ym,i Φm (a,A(m) )(i,j) ∆/τ

m|d j

If a stronger condition o× F =

Q

˜ ∆

∈ WF o× F .

U (m) holds, then it is equivalent to

ym Φm (a, A(m) ) ≡ 0 mod τm . Q Φm (a,A(m) )(i,j) Φm (η,a) Proof. By Lemma 3.10, we know that um,i ∈ WF j um,j , which yields Q ˜ m Φm (η,a)∆/τ m|d vm ˜ m Q Q ym,i Φm (η,a)∆/τ = m|d i um,i ( by (3.25) ) ˜ m Q Q Q ym,i Φm (a,A(m) )(i,j) ∆/τ ∈ WF m|d i j um,j ˜ m Q Q P ym,i Φm (a,A(m) )(i,j) ∆/τ , = WF m|d j um,ji Q whence follows the first assertion. If o× U (m) holds, then {um,j } is a F = basis of o× /W , and so the first equivalence implies the second one. F F Proposition 3.6. Let um,i , ym,i , ym be as in Lemma 3.14, and let η˜ be an extension of η, and let p ( - 2DF∆˜ ) be a prime number satisfying η˜ ∈ σF∆˜ /Q (p); then we have £ £ ¤ η−p ¤ R(˜ η , p) : WF o× = V1 (˜ η ) : V2 (˜ η) , F

May 11, 2007

15:20

70


YOSHIYUKI KITAOKA

where

¯ ) ¯ ¯ V1 (˜ η ) = WF ¯ ym satisfies (#) in Lemma 3.14 , ¯ m j ¯ ) ( Y Y y ¯¯ m,j V2 (˜ η ) = WF um,j ¯ ym satisfies ( \ ) in Lemma 3.15 . ¯ (

YY m

If

ws-procs9x6

o× F

=

ym,j um,j

j

Q

U (m) holds, then we have ¯ ) ( Y Y y ¯¯ m,j (m) V2 (˜ η ) = WF um,j ¯ ym Φm (a, A ) ≡ 0 mod τm for ∀m|d . ¯ m

j

Proof. The assertion follows easily from Proposition 3.5 and the previous two lemmas. Q Suppose o× U (m); then {um,i } is a basis of o× F = F /WF , whence comparing exponents, we may assume ¯ n o ¯ V1 (˜ η ) = {ym mod τm } ¯ ym ’s satisfy (#) in Lemma 3.14 , (3.27) ¯ n o ¯ V2 (˜ η ) = {ym mod τm } ¯ ym Φm (a, A(m) ) ≡ 0 mod τm for ∀m|d . (3.28)

The inclusion V2 (˜ η ) ⊂ V1 (˜ η ) follows from their original definitions, but Q we can check it directly when o× U (m) holds, as follows: Suppose F = {ym } ∈ V2 (˜ η ); then the first equality of (#) is obvious. Noting that Φm (a) = Φm (a) − Φm (A(m) ) = Φm (a, A(m) )(a − A(m) ), we have Φm (a)bm + Φm (a, A(m) )(B (m) − b)am

= Φm (a, A(m) )(abm − A(m) bm + B (m) am − bam )

and then Lemma 3.8 yields the second equality of (#). 4. Examples 4.1. Case of η = id We assume η = id throughout this subsection. Then obviously, we have d (= the order of η) = 1, o× F = U (1), and the polynomial g(x) defined in Corollary 3.1 is equal to g(x) = x − 1.

May 11, 2007

15:20


ws-procs9x6


71

Corollary 5.1 in the appendix yields ˜ = τ1 = w. ∆ Let η˜ be an extension of η. Since g(x, y) = 1 yields V2 (˜ η ) = 0, we have for r = rankZ o× , (3.27), (3.28) read F ¯½ ½ ¾ ¯ ya ≡ 0 mod w, V1 (˜ η )/V2 (˜ η ) = y ∈ (Z/wZ)r ¯¯ y{(a − 1)b + (B − b)a)} ≡ 0 mod w2

where we put, as in §3.3.1 with (ii) in Remark 3.3 ® o× F = ζw , u1 , · · · , ur , √ η ˜ η ˜ ai √ a w w ζw ui = ζw ui , 2 = ζw 2 , 2 t

a = (a1 , · · · , ar ), Y b ρ b bi ujij , ζw = ζw , uρi = ζw

A = 1r ,

j

t

b = (b1 , · · · , br ),

B = (bij ).

Now, we note that the assumption η = id yields in the above a ≡ 1 mod w,

a ≡ 0 mod w

and so a = 1 + wa,

a = wa,

say. Then we have ¯ © ª V1 (˜ η )/V2 (˜ η ) = y mod w ¯ y(ab + (B − b)a) ≡ 0 mod w .

Then, putting

R(ρ) = (B − b1r , b),

(4.1)

and replacing a, a by a, a we have V (˜ η ) := V1 (˜ η )/V2 (˜ η) ¯ ½ µ ¶ ¾ ¯ a = y mod w ¯¯ yR(ρ) ≡ 0 mod w for ∀ρ ∈ Gal(F/Q) , a

where redefining a, a as above √ η ˜ η ˜ a ai √ w w ζw ui = ζw ui , t a = (a1 , · · · , ar ) 2 = ζw 2 · ζw , Y ρ b bi ζw = ζw , ui ρ = ζw uj bij , t b = (b1 , · · · , br ), B = (bij ). j

(4.2) (4.3)

May 11, 2007

15:20

72


ws-procs9x6

YOSHIYUKI KITAOKA

We note that if ρ|F = id, then (4.3) implies b ≡ 1 mod w, b ≡ 0 mod w and B is the identity matrix, and hence R(ρ) ≡ 0 mod w. By denoting B, b corresponding to ρ by B(ρ), b(ρ), respectively, it is easy to see that R(ρ1 ρ2 ) = B(ρ1 )R(ρ2 ) + b(ρ2 )R(ρ1 ).

(4.4)

In the following, we evaluate κ(η) = gcd #V (˜ η ) (cf. (3.14)) for several types of algebraic number fields, and furthermore we show that for η˜ ∈ Gal(Fw /F ), there is η˜0 such that R(˜ η ) ⊃ R(˜ η0 ) and κ(η) = #V (˜ η0 ). This is not necessarily true if η 6= id. Once we find a prime number p such that σF/Q (p) = η and w(p − 1)r /#E(p) = κ(η), we have κ(η) = Relη . 4.1.1. Case of real quadratic fields Let F be a real quadratic field and let ² (> 1) be the fundamental unit ˜ = w = 2. We take ² as u1 ; then for with N (²) = (−1)s ; then clearly ∆ ρ(6= id) ∈ Gal(F/Q), ²ρ = (−1)s ²−1

(−1)ρ = −1, imply B = (−1), b = 1, b = (s) and so

R(ρ) = (−2, s) ≡ (0, s) mod 2. Therefore V (˜ η) =

¯ ½ µ ¶ ¾ ¯ a x mod 2 ¯¯ x(0, s) = sax ≡ 0 mod 2 . a

Here a is defined by ζ4η˜ = (−1)a ζ4 as in (4.2). Let us see that κ(η) = gcd #V (˜ η) =

(

2

if N (²) = 1,

1

if N (²) = −1.

The first is obvious because of s = 0, and for the second, we have only to take η˜0 so that a = 1. This is compatible with [8], where we have shown that the expected density of the set (cf. (3.15))

is positive.

© ¯ ª p ¯ #E(p) = 2(p − 1)/κ(η), σF/Q (p) = id

May 11, 2007

15:20


ws-procs9x6


73

4.1.2. Case of real cubic abelian fields Let F be a real cubic abelian field and σ a generator of Gal(F/Q); then we ˜ = w = 2 and as a set of fundamental units, we can take u1 , u2 so have ∆ that (−1)σ = (−1)1 ,

uσ1 = u2 ,

uσ2 = (u1 u2 )−1

and NF/Q (u1 ) = NF/Q (u2 ) = 1 [9]. Thus we have (cf. (4.1)) R(σ) =

µµ

0 1 −1 −1

2

¶

− 12 ,

R(σ ) ≡

µ

¶ µ ¶¶ µ 0 110 ≡ mod 2, 100 0

010 110

¶

mod 2,

which yield V (˜ η) ¯ n o ¯ = (x1 , x2 ) mod 2 ¯ x1 (a1 + a2 ) + x2 a1 ≡ x1 a2 + x2 (a1 + a2 ) ≡ 0 mod 2 .

√ √ Here a1 , a2 are defined by ui η˜ = (−1)ai ui in (4.2). We can choose η˜0 which corresponds to a1 = a2 = 1 and then #V (˜ η0 ) = 1, i.e. κ(η) = gcd V (˜ η ) = 1. This is compatible with [9], where the expected density of the set © ¯ p ¯ #E(p) = 2(p − 1)2 ,

is explicitly given.

ª σF/Q (p) = id

4.1.3. Case of non-cyclic abelian fields of degree 4 √ √ Let F = Q( d1 , d2 ), where d1 , d2 (> 1) are natural numbers and let F1 , F2 , F3 be three real quadratic subfields of F . Let ²i (> 1) be the fundamental unit of Fi , NFi /Q ²i = (−1)si , si = 0, 1. Put £ ¤ Q = o× F : h−1, ²1 , ²2 , ²3 i ;

May 11, 2007

15:20

74


ws-procs9x6

YOSHIYUKI KITAOKA

then the type of a set {u1 , u2 , u3 } of fundamental units of F is given as follows [10]: (i) u1 (ii) u1 (iii) u1 (iv) u1 (v) u1 (vi) u1 (vii) u1

= ²1 , u2 √ = ²1 , u2 √ = ²1 , u2 √ = ²1 ²2 , u2 √ = ²1 ²2 , u2 √ = ²1 ²2 , u2 √ = ²1 ²2 ²3 , u2

= ²2 , u3 = ²2 , u3 √ = ²2 , u3 = ²2 , u3 √ = ²3 , u3 √ = ²2 ²3 , u3 = ²2 , u3

= ²3 = ²3 = ²3 = ²3 = ²2 √ = ²3 ²1 = ²3

(Q = 1) (Q = 2) (Q = 4) (Q = 2) (Q = 4) (Q = 4) (Q = 2).

√ In the case (ii) – (vi), si = 0 is supposed if ²i appears in the symbol , and s1 = s2 = s3 is supposed for the case (vii). We denote by σi the nontrivial automorphism fixing ²i and so Gal(F/Q) = {σ1 , σ2 , σ3 = σ1 σ2 , id}. b = b(ρ) = 1 in (4.3) is equal to 1 because of w = 2 and hence we have by (4.4) R(σ3 ) = R(σ1 σ2 ) = B(σ1 )R(σ2 ) + R(σ1 ). Proposition 4.1. Let η be the identity; then the value of κ(η) = gcd #V (˜ η) is given as follows: Case (i)  if s1 + s2 + s3 = 0, 8 κ(η) = 4 if s1 + s2 + s3 = 1,  2 otherwise,

Case (ii)

κ(η) =

Case (iii)

   4   

2

  s2 = s3 = 0 or if s = 0, s3 = 1,  2 s2 = 1, s3 = 0, otherwise,

κ(η) =

½

4 2

u1 uσ1 2 = −1 or u1 uσ1 3 = −1,

if u1 uσ1 2 = u2 uσ2 1 = −1, otherwise,

Case (iv) κ(η) =

½

2 4

if u1σ1 uσ1 2 = −1 and s3 = 1, otherwise,

Case (v), (vi) κ(η) = 2,

May 11, 2007

15:20


ws-procs9x6


75

Case (vii) κ(η) =

½

4 1

if s1 = 0, if s1 = 1.

Proof. We prove the case (vii). Proofs of the other cases are similar. √ For u1 = ²1 ²2 ²3 , u2 = ²2 , u3 = ²3 , we have (−1)σ1 = (−1)σ2 = −1, and −1 uσ1 1 = (−1)κ1 u1 u−1 2 u3 , σ2 κ2 −1 u1 = (−1) u1 u2 ,

uσ2 1 = (−1)s2 u−1 2 , uσ2 2 = u2 ,

uσ3 1 = (−1)s3 u−1 3 , uσ3 2 = (−1)s3 u−1 3 ,

for some κ1 , κ2 = 0, 1, and put s1 = s2 = s3 = s. Then it is easy to see that   0 1 1 κ1 R(σ1 ) ≡  0 0 0 s  mod 2, 000 s   0 1 0 κ2 R(σ2 ) ≡  0 0 0 0  mod 2, 000 s   0 0 1 κ1 + κ2 + s  mod 2, R(σ1 σ2 ) ≡  0 0 0 s 000 0

and hence, putting t a = (a1 , a2 , a3 , a), we have in due order

(x1 , x2 , x3 ) ∈ V (˜ η)   (0, x1 , x1 , x1 κ1 + x2 s + x3 s)a ≡ 0 mod 2 ⇔ (0, x1 , 0, x1 κ2 + x3 s)a ≡ 0 mod 2  (0, 0, x1 , x1 (κ1 + κ2 + s) + x2 s)a ≡ 0 mod 2   x1 (a2 + a3 + κ1 a) + x2 sa + x3 sa ≡ 0 mod 2 ⇔ x1 (a2 + κ2 a) + x3 sa ≡ 0 mod 2  x1 (a3 + κ1 a + κ2 a + sa) + x2 sa ≡ 0 mod 2.

We divide the proof into two cases. For s = 0 we get

(x1 , x2 , x3 ) ∈ V (˜ η)  x (a + a + κ  1 2 3 1 a) ≡ 0 mod 2 ⇔ x1 (a2 + κ2 a) ≡ 0 mod 2  x1 (a3 + κ1 a + κ2 a) ≡ 0 mod 2

⇒ {(0, x2 , x3 ) | x2 , x3 mod 2} ⊂ V (˜ η ),

May 11, 2007

15:20

76


ws-procs9x6

YOSHIYUKI KITAOKA

where the inclusion becomes the equality for a = 0, a2 = 1. Therefore κ(η) = 4 holds. For s = 1, we have   x1 (a2 + a3 + κ1 a) + x2 a + x3 a ≡ 0 mod 2, (x1 , x2 , x3 ) ∈ V (˜ η ) ⇔ x1 (a2 + κ2 a) + x3 a ≡ 0 mod 2,  x1 (a3 + κ1 a + κ2 a + a) + x2 a ≡ 0 mod 2

and since the coefficient matrix is regular for a = 1, we have V (˜ η ) = {(0, 0, 0)} and so κ(η) = 1.

√ √ Remark 4.1. Suppose F = Q( d1 , d2 ) (2 ≤ d1 , d2 ≤ 500); then κ(η) = Relη is confirmed by finding a prime number p satisfying #E(p) = 2(p − 1)3 /κ(η) by computer. 4.1.4. Case of imaginary abelian fields of degree 4 Let F be an imaginary abelian field of degree 4 and let F0 be the real quadratic subfield in F , and ²0 (> 1) the fundamental unit of F0 . Put £ ¤ × Q = o× F : WF oF0 .

We define a fundamental unit ² of F as follows: In case of Q = 1, we put ² = ²0 . Next, we assume Q = 2; let us see then that we can choose a fundamental unit ² of F so that ²0 = ζw ²2 ,

²J = ζw ²,

where J means the complex conjugation. We agree as follows. We may a 2 suppose ²0 = ζw ² with a = 0, 1 without loss of generality. Assume a = 1; n 2n−1 J ² ²² ∈ F0 implies ²²J = ²n0 , and so ²²J = (ζw ²2 )n . Thus we have ²J = ζw J and comparing the absolute values, n = 1, which yields ² = ζw ², and ²0 = ²²J = ζw ²2 . If a = 0, then ²0 = ²2 follows, which implies ²J = ²2n−1 by ²²J = ²n0 for an integer n, whence yields n = 1 and ²J = ², contradicting Q = 2. Proposition 4.2. We have   either Q = 1 and NF0 /Q (²0 ) = 1 2 if √ κ(η) = or Q = 1 and −1 ∈ F,   1 otherwise.

May 11, 2007

15:20


ws-procs9x6


77

Proof. Putting η ˜ a ζw 2 = ζw 2 ζw ,

√ w

η ˜

a1 ² = ζw

√ w

²,

ρ b ζw = ζw ,

b1 b11 ²ρ = ζw ² ,

we have V (˜ η ) = {x mod w | x((b11 − b)a1 + b1 a) ≡ 0 mod w for ∀ρ ∈ Gal(F/Q)}. • Case of Q = 1, NF0 /Q (²0 ) = 1: In this case, we show that V (˜ η ) ⊃ V (˜ η0 ) = {x mod w | x ≡ 0 mod w/2} (˜ η0 ↔ a1 = 1), from which we have κ(η) = 2. We note that ²ρ = ² or ²−1 by virtue of ² = ²0 , and so b1 = 0 for every ρ and so V (˜ η ) = {x mod w | x(b11 − b)a1 ≡ 0 mod w for ∀ρ ∈ Gal(F/Q)}. If w = 2, 4, 6, then the possibilities for b, b11 are w = 2 ⇒ b = 1, b11 = ±1 w = 4, 6 ⇒ b = ±1, b11 = ±1 and hence the assertion above is true. √ If w = 8, then we have F = Q(ζ8 ) and ²0 = 2 + 1, NF0 /Q (²0 ) = −1, which contradicts the assumption. √ √ If w = 12, then F = Q( −1, 3) holds, and the possibilities are either b = ±1, b11 = 1, or b = ±5, b11 = −1. The automorphism ρ corresponding to b = −1, b11 = 1 implies 2x ≡ 0 mod 12, i.e. x ≡ 0 mod 6 and so V (˜ η0 ) = {x mod 12 | x ≡ 0 mod 6}. Therefore #V (˜ η0 ) = 2 holds. √ • Case of Q = 1, NF0 /Q (²0 ) = −1, −1 ∈ F√ and ζ8 ∈ F : In this case, we have F = Q(ζ8 ) and ²0 = 2 − 1, and the possibilities are b b11 b1 (b11 − b)a1 + b1 a

1 3 5 7 1 −1 −1 1 0 4 4 0 0 −4a1 + 4a −6a1 + 4a −6a1

which also implies V (˜ η ) ⊃ V (˜ η0 ) = {x mod w | x ≡ 0 mod w/2} (˜ η0 ↔ a = a1 = 1). This means κ(η) = 2.

May 11, 2007

15:20

78


ws-procs9x6

YOSHIYUKI KITAOKA

√ • Case of Q = 1, NF0 /Q (²0 ) = −1, −1 ∈ F and ζ8 6∈ F : √ We note that w = 4 and F is the composite of Q( −1) and F0 . Then we have the table: ½ ½ ½ ½ ½ ρ|FF0 = id ρ|FF0 = id ρ|FF0 6= id ρ|FF0 6= id ρ b 1 3 1 3 b11 b1 (b11 − b)a1 + b1 a

1 0 0

1 0 −2a1

−1 2 −2a1 + 2a

−1 2 −4a1 + 2a

Therefore we have V (˜ η ) ⊃ V (˜ η0 ) = {x mod w | x ≡ 0 mod w/2} (˜ η0 ↔ a1 = 1, a = 0) and κ(η) = 2. √ • Case of Q = 1, NF0 /Q (²0 ) = −1, −1 6∈ F : In case of w = 2, we take η˜0 corresponding to a1 = 0, a = 1, so that b1 = 1 for ρ|F0 6= id implies V (˜ η ) ⊃ V (˜ η0 ) = {0}, i.e. κ(η) = 1. In case of w = 6, F = F0 (ζ3 ) holds, and we take η˜0 corresponding to a = a1 = 1. Then we have V (˜ η ) ⊃ V (˜ η0 ) = {0} and so κ(η) = 1, considering ρ corresponding to ρ ζw = ζw , ²ρ0 = −²−1 0 , for which we get b = 1, b1 = 3, b11 = −1.

• Case of Q = 2 : Let ρ be the complex conjugation; then b = −1, b1 = 1, b11 = 1 hold. Therefore η˜0 corresponding to a1 = 0, a = 1 gives V (˜ η ) ⊃ V (˜ η0 ) = {0} and κ(η) = 1.

The proposition explains the theoretical background of the constant ∆ in [8], which is our κ(η) where the positivity of the expected density of {p | #E(p) = w(p − 1)/κ(η), σF/Q (p) = id} is shown. 4.1.5. Case where F is the Galois closure of a real cubic field F0 with negative discriminant We note that F is an S3 -extension of Q, and so w = 2, 4, 6. Let ² ( > 1) be the fundamental unit of F0 , and σ an automorphism of order 3 in Gal(F/Q); σ then ζw = ζw holds, and putting ²0 = ²σ , we see J

2

σ

²0 = ²σ = ²0 = ²−1−σ , 0 where J denotes the complex conjugation. That [o× F : hζw , ², ² i] = 1 or 3 is known [4]. We still suppose η ∈ Gal(F/Q) is the identity. Then we have

Proposition 4.3. ( 3 κ(η) = 1

0 if F0 is pure cubic and [o× F : hζw , ², ² i] = 1,

otherwise.

May 11, 2007

15:20


ws-procs9x6


79

Proof. For an extension η˜ of η, we write as (4.2), (4.3), √ η ˜ aw+1 ai √ w u , ζw , w ui η˜ = ζw 2 = ζw 2 i ρ b ζw = ζw ,

b1 u1 ρ = ζw u1 b11 u2 b12 ,

b2 u2 ρ = ζw u1 b21 u2 b22 ,

where o× F = hζw , u1 , u2 i. 0 0 Suppose [o× F : hζw , ², ² i] = 1; then we have, on putting u1 = ², u2 = ² , σ ζw σ2 ζw J ζw σJ ζw σ2 J ζw

= ζw , = ζw , −1 = ζw , −1 = ζw , −1 = ζw ,

uσ1 2 uσ1 uJ1 uσJ 1 2 uσ1 J

= u2 , −1 = u−1 1 u2 , = u1 , −1 = u−1 1 u2 , = u2 ,


−1 = u−1 1 u2 , = u1 , −1 = u−1 1 u2 , = u2 , −1 = u−1 1 u2 .

Therefore we have b1 = b2 = 0 for ∀ρ ∈ Gal(F/Q), and ⇔

(x1 , x2 ) mod w ∈ V (˜ η) (x1 , x2 )

⇔

µ

b11 − b b12 b21 b22 − b

¶µ

a1 a2

¶

≡ 0 mod w for ∀ρ

 x1 (−a1 + a2 ) + x2 (−a1 − 2a2 ) ≡ 0 mod w      x1 (−2a1 − a2 ) + x2 (a1 − a2 ) ≡ 0 mod w 2x1 a1 − x2 a1 ≡ 0 mod w    −x a + 2x2 a2 ≡ 0 mod w   1 2 x1 (a1 + a2 ) + x2 (a1 + a2 ) ≡ 0 mod w

(ρ = σ) (ρ = σ 2 ) (4.5) (ρ = J) (ρ = σJ) (ρ = σ 2 J).

If F0 is pure cubic, then we have w = 6, and taking η˜0 corresponding to a1 = a2 = 1, we get by (4.5)  −3x2 ≡ 0 mod 6      −3x1 ≡ 0 mod 6 (x1 , x2 ) mod 6 ∈ V (˜ η0 ) ⇔ 2x1 − x2 ≡ 0 mod 6    −x + 2x2 ≡ 0 mod 6   1 2x1 + 2x2 ≡ 0 mod 6 ½ xj ≡ 0 mod 2, ⇔ x1 + x2 ≡ 0 mod 3. It is easy to see V (˜ η ) ⊃ V (˜ η0 ) for any extension η˜, and thereforep κ(η) = 3. Next, we suppose that F0 is not pure cubic, which implies Q( DF0 ) 6= √ Q( −3) and w = 2 or 4. For η˜0 corresponding to a1 = a2 = 1, we have (cf. (4.5)) (x1 , x2 ) mod w ∈ V (˜ η0 ) ⇔ x1 ≡ x2 ≡ 0 mod w.

May 11, 2007

15:20

80


ws-procs9x6

YOSHIYUKI KITAOKA

Therefore we have κ(η) = 1. 0 Now suppose [o× F : hζw , ², ² i] = 3. First we show that there exist ²0 ∈ × oF , e ∈ Z so that σ o× F = hζw , ²0 , ²0 i, 2

e −1−σ ²0 ²σ0 = ζw ,

e ²/²0 , ²30 = ζw −e 1+σ ²0 , ²J0 = ζw

(4.6)

−σ ²σJ 0 = ²0 .

0 3 e b 0c Take a unit ²0 ∈ o× for e, b, c ∈ Z. If F \ hζw , ², ² i and let ²0 = ζw ² ² b ≡ c ≡ 0 mod 3, then we may assume b = c = 0, i.e. that ²0 is a root of unity. This contradicts ²0 6∈ hζw , ², ²0 i. e 0b e −c 0 b−c ² (²²0 )−c = ζw If b ≡ 0 mod 3, then c 6≡ 0 mod 3 and (²σ0 )3 = ζw ² ² allows us to assume b 6≡ 0 mod 3, taking ²σ0 instead of ²0 . Thus we may e 0c ²² , taking ²−1 assume ²30 = ζw 0 instead, if necessary. If c ≡ 0 mod 3 holds, −c/3 3 −e then ² = (ζ3w ²0 ²0 ) ∈ F (ζ9 )3 , which contradicts Lemma 1.2 in [6]. e −σ 2 e −1 If c = 1 holds, then ²30 = ζw ² and ²0 3σ = ζw ² , which yields the −σ e ²0 )3 ∈ F (ζ9 )3 as above. Therefore we may assume contradiction ² = (ζ3w e ²30 = ζw ²/²0 . e 0 0 e 02 Then we have ²3σ = (²0 ²0 )3 . Hence there is a third 0 = ζw ² (²² ) = ζw ²² root ω of unity so that

²σ0 = ω²0 ²0 ,

(4.7)

which implies ²0 = ω −1 ²σ0 /²0 ,

−e 3 0 −e −1 2 σ ² = ζw ²0 ² = ζw ω ²0 ²0 .

This yields σ o× F = hζw , ²0 , ²0 i

−1 e −1−σ and ²σ0 = ζw ²0 in (4.6) follows from ²σ0 = (ω²0 ²0 )σ = ω(ω²0 ²0 )(²−1 ²0 ) e −1−σ e −1−σ = ω 3 ζw ²0 = ζw ²0 . ²σ+σJ = 1 in (4.6) follows from ²σ+σJ = 0 0 σ+σJ σ 1+J 3 > 0 and the fact that ²0 (²0 ) is a root of unity, since (²σ+σJ ) = 0 2 2 2 2 J e (ζw ²/²0 )σ+σJ = ²σ+σJ−σ −σ J = 1 by ²σ = ²σJ , ²σ J = {²0 }J = ²σ . By (4.7), we have 2

2

²J0 = (ω −1 ²0

−1 σ J ²0 )

2

−e −1 2 σ −e −1 2σ σ = ω²1+σ ²−σ ²0 ²0 )(ζw ω ²0 ²0 )²−σ 0 = ω(ζw ω 0 2

−2e 2+2σ+σ −e 1+σ = ω −1 ζw ²0 = ω −1 ζw ²0 2

e by ²01+σ+σ = ζw . We have only to show ω = 1 to complete the proof of (4.6). It follows from

²σ0 = ²0Jσ

2

J

−e 1+σ σ = (ω −1 ζw ²0 )

2

J

e σ = ωζw ²0

2

J+J

e e −1−σ J J = ωζw (ζw ²0 ) ²0 = ω²σ0 .

May 11, 2007

15:20


ws-procs9x6


81

Now, putting u1 = ²0 , u2 = ²σ0 , we have by (4.6) σ ζw σ2 ζw J ζw σJ ζw σ2 J ζw

= ζw , = ζw , −1 = ζw , −1 = ζw , −1 = ζw ,

uσ1 2 uσ1 uJ1 uσJ 1 2 u1σ J

= u2 , e −1 −1 = ζw u1 u2 , −e = ζw u1 u2 , = u−1 2 , = u−1 1 ,


e −1 −1 = ζw u 1 u2 , = u1 , = u−1 2 , −1 = u1 , −e = ζw u 1 u2 ,

which yield

⇔ ⇔

(x1 , x2 ) mod w ∈ V (˜ η) x1 ((b11 − b)a1 + b12 a2 + b1 a) + x2 (b21 a1 + (b22 − b)a2 + b2 a) ≡ 0 mod w,

 x1 (−a1 + a2 ) + x2 (−a1 − 2a2 + ea) ≡ 0 mod w      x1 (−2a1 − a2 + ea) + x2 (a1 − a2 ) ≡ 0 mod w x1 (2a1 + a2 − ea) ≡ 0 mod w    x (a − a2 ) + x2 (−a1 + a2 ) ≡ 0 mod w   1 1 x2 (a1 + 2a2 − ea) ≡ 0 mod w ½ x1 (a1 − a2 ) ≡ 0 mod w, ⇒ x2 (a1 − a2 ) ≡ 0 mod w,

(ρ = σ) (ρ = σ 2 ) (ρ = J) (ρ = σJ) (ρ = σ 2 J)

⇒ x1 ≡ x2 ≡ 0 mod w for η˜0 (↔ a1 − a2 = 1).

0 Hence we have κ(η) = 1 under the assumption [o× F : hζw , ², ² i] = 3. This completes the proof.

When F0 is defined by x3 + a1 x + a0 = 0 with 0 ≤ a1 , |a0 | ≤ 100, we have checked κ(η) = Relη , by finding a prime number p satisfying #E(p) = w(p − 1)2 /κ(η) by computer. 4.2. Case of complex conjugation In this subsection, let F be an imaginary abelian extension of the rational number field Q with [F : Q] = 2n(≥ 4), and we assume that η is the complex conjugation J. Denote the maximal real subfield by F0 ; then d = 2 and g(x) = x − 1 are obvious, and it is known that £ ¤ × Q = o× F : oF0

is 1 or 2. ˜ Therefore, we have o× F = U (1) and so ∆ = τ1 = 2 by Corollary 5.1. Now Proposition 3.6 reads as follows:

May 11, 2007

15:20

82


ws-procs9x6

YOSHIYUKI KITAOKA

For an extension η˜ ∈ Gal(F2 /Q) of η, put ® o× F = ζw , u1 , · · · , ur , η ˜ aw−1 ζ2w = ζ2w , Y√ a √ η˜ ai ui = ζ2w uj ij , j

t

a = (a1 , · · · , ar ),

ρ b ζw = ζw , ui ρ

A = (aij ), Y bi = ζw uj bij , j

t

b = (b1 , · · · , br ),

B = (bij ).

Then we have (cf. (3.27),(3.28)) ¯ ½ ¾ ¯ r r ¯ xa ≡ 0 mod 2, and for ∀ρ ∈ Gal(F/Q) , V1 (˜ η ) = x ∈ Z /2Z ¯ x((aw − 2)b + (B − b)a) ≡ 0 mod 2w V2 (˜ η ) = {0},

ai and we note that uJi = ζw

4.2.1. Case of [F : Q] = 4

Q

(4.8)

a

j

uj ij determines ai mod w uniquely.

Let ²0 (> 1) be the fundamental unit of F0 . Proposition 4.4. We have the following: ( 2 if NF0 /Q (²0 ) = 1 and Q = 1, κ(η) = 1 otherwise. Proof. Since r = rank o× F = 1, (4.8) amounts to ¯ ½ ¾ ¯ x a ≡ 0 mod 2, for ∀ρ ∈ Gal(F/Q) V1 (˜ η ) = x1 ∈ Z/2Z ¯¯ 1 1 . (4.9) x1 {(aw − 2)b1 + (b11 − b)a1 } ≡ 0 mod 2w

First, we assume Q = 1; then ²0 being a fundamental unit of F , we can take ²0 as the fundamental unit u1 of F and a1 ≡ 0 mod w is clear and so the first congruence x1 a1 ≡ 0 mod 2 is satisfied for any x1 ∈ Z. If ρ = id on F0 , then we have ρ = id or J, and hence b = ±1, b1 ≡ 0 mod w, and b11 = 1. Therefore, the above equation for this ρ is satisfied for all x1 in this case. Suppose ρ 6= id on F0 and put NF0 /Q (²0 ) = (−1)s ; then noting b1 ≡ sw/2 mod w, b11 = −1, b ≡ 1 mod 2, the second equation in (4.9) becomes x1 (aw − 2)b1 ≡ x1 (aw − 2)sw/2 ≡ 0 mod 2w.

May 11, 2007

15:20


ws-procs9x6


83

Hence, if s = 0, this is satisfied for all x1 , and so κ(η) = 2. If s = 1, then it is equivalent to x1 (aw − 2)w/2 ≡ 0 mod 2w. Taking a = 0, we have x1 ≡ 0 mod 2, and so κ(η) = 1. Next, we assume Q = 2; then we can choose a fundamental unit ² of F as in §4.1.4 so that ²0 = ζw ²2 ,

²J = ζw ².

Let u1 = ²; then a1 is odd, and then the first congruence implies x1 ≡ 0 mod 2 and so κ(η) = 1. We remark that this is also compatible with [8] and explains the theoretical background of the constant ∆ there, which is κ(η) here. 4.2.2. Case of [F : Q] = 6 Proposition 4.5. In this case, we have κ(η) = 1. Proof. Let σ be an element in Gal(F/Q) of order 3. Let us show that there is a system {u1 , u2 } of fundamental units so that uσ1 = u2 ,

uσ2 = (u1 u2 )−1 ,

uJi = ui .

(4.10)

Because of ranko× F = 2, there is a system u1 , u2 of fundamental units uσ1 = u2 ,

c uσ2 = ζw (u1 u2 )−1 ,

using the theory of integral representation of the cyclic group of prime order di (the theorem on p. 508 [3]). Put uJi = ζw ui ; then defining an integer e by σ e ζw = ζw , we have J d2 uσJ 1 = u2 = ζw u2 ,

d1 σ ed1 uJσ 1 = (ζw u1 ) = ζw u2 ,

and so Gal(F/Q) being abelian, we may assume d2 = ed1 . The equality 2 2 (1+σ+σ 2 )J J(1+σ+σ 2 ) c −c d1 u11+σ+σ = ζw yields u1 = ζw and u1 = (ζw u1 )1+σ+σ = (1+e+e2 )d +c

(1+e+e2 )d +2c

1 1 ζw , and hence ζw = 1. Therefore we have (1 + e + d /2 2 e )d1 + 2c ≡ 0 mod w, which implies d1 is even. Thus we have (ζw1 u1 )J = d1 /2 ζw u1 , and so we may assume d1 = 0. This necessitates c ≡ 0 mod w/2, c c c i.e. ζw = ±1. If ζw = −1, taking −ui as ui , we can assume ζw = 1, which completes the proof of the above assertion (4.10). Hence we have

Jσ −e ζw = ζw , 2 −e2 Jσ ζw = ζw ,

uJσ 1 = u2 , −1 Jσ 2 u1 = u−1 1 u2 ,

−1 −1 uJσ 2 = u1 u2 , 2 = u1 , uJσ 2

May 11, 2007

15:20

84


ws-procs9x6

YOSHIYUKI KITAOKA

whence ρ = Jσ ⇒ b ≡ 1 mod 2, ρ = Jσ 2 ⇒ b ≡ 1 mod 2,

µ

¶ 0 1 , −1 −1 µ ¶ −1 −1 , B= 1 0 B=

b ≡ 0 mod w, b ≡ 0 mod w

and this implies, for an extension η˜0 corresponding to a1 = a2 = 1 (x1 , x2 ) ∈ V1 (˜ η0 ) ½ xa ≡ 0 mod 2, ⇔ x((aw − 2)b + (B − b)a) ≡ 0 mod 2w µ ¶ 1 ⇒ (x1 , x2 )(B + 12 ) ≡ 0 mod 2 (ρ = Jσ, Jσ 2 ) 1 µµ ¶ ¶µ ¶  0 1 1   + 12 ≡ 0 mod 2, (ρ = Jσ)  (x1 , x2 ) −1 −1 1 µµ ¶ ¶µ ¶ ⇒  −1 −1 1   (x1 , x2 ) + 12 ≡ 0 mod 2 (ρ = Jσ 2 ) 1 0 1 ⇒ x1 ≡ x2 ≡ 0 mod 2. This yields V1 (˜ η0 ) = V2 (˜ η0 ) = 2Z, and so κ(η) = 1. Remark 4.2. When equations y 3 − ay + b = 0 and x2 + c = 0 (0 < a, b < 1000, 0 < c < 100, a, b, c ∈ Z), define a real cubic abelian subfield and an imaginary quadratic subfield of F , respectively, the equality κ(η) = Relη is confirmed by finding a prime number p so that #E(p) = w(p − 1)2 with the aid of computer. 4.3. Case where F is an imaginary abelian field with [F : Q] = 6 and the order of η ∈ Gal(F/Q) is 3 Proposition 4.6. In this case, we have κ(η) = 1. Proof. As in §4.2.2 (cf. (4.10)), we may assume o× F = hζw , u1 , u2 i,

uη1 = u2 ,

uη2 = (u1 u2 )−1 (u1 , u2 ∈ F0 ),

(4.11)

where F0 is the maximal real subfield of F. It is easy to see that o× F = U (3), × g(η) 2 i.e. o× = {² ∈ o | ² ∈ W }, on putting g(x) = Φ (x) = x + x + 1. F 3 F F ˜ = τ3 for every extension η˜ of η (cf. the remark just after Hence we have ∆ (3.9)).

May 11, 2007

15:20


ws-procs9x6


Lemma 4.1. We have

 7 ˜ = 3 ∆  1

85

if F = Q(ζ7 ), if ζ3 ∈ F, otherwise.

˜ and let pn || ∆. ˜ Then ζpg(ρ) Proof. Let p be a prime divisor of ∆ = 1 for n every extension ρ ∈ Gal(F (ζpn )/Q) of η by definition (cf. (3.8)). Suppose that σa ∈ Gal(Q(ζpn )/Q) with ζpσna = ζpan coincides with η on F ∩ Q(ζpn ); then it is extended to an element σã ∈ Gal(F (ζpn )/Q) with σã|F = η and g(˜ σ )

so we have a2 + a + 1 ≡ 0 mod pn by ζpn a = 1. In particular, p is an odd prime (6= 5), and ¯ ª £ ¤ © Q(ζpn ) : F ∩ Q(ζpn ) ≤ # a mod pn ¯ a2 + a + 1 ≡ 0 mod pn .

Let us check that the right-hand side is ≤ 2. In case of p = 3, this is obvious, since there is no solution of x2 + x + 1 ≡ 0 mod 9. Suppose p 6= 3; then Lemma 5.2 with f (x) = x2 + x + 1, A(x) = 4, B(x) = −(2x + 1), n = 3 yields #{a mod pn | a2 + a + 1 ≡ 0 mod pn } ≤ 2. Now the inequality [Q(ζpn ) : F ∩ Q(ζpn )] ≤ 2 yields pn−1 (p − 1) = [Q(ζpn ) : F ∩ Q(ζpn )][F ∩ Q(ζpn ) : Q] | 12.

(4.12)

Therefore the possibilities of p, n are p = 13, n = 1; p = 7, n = 1; p = 3, n ≤ 2.

• Case of p = 13, n = 1 (4.12) implies [F ∩ Q(ζ13 ) : Q] = 6, and so F ⊂ Q(ζ13 ). Since the subgroup corresponding to F in Gal(Q(ζ13 )/Q) is of order 2, it is generated by the complex conjugation. Hence F is a real subfield, which is a contradiction. • Case of p = 7, n = 1 (4.12) implies 6 ≤ 2[F ∩ Q(ζ7 ) : Q], and then [F ∩ Q(ζ7 ) : Q] = 3, 6. Suppose [F ∩ Q(ζ7 ) : Q] = 6; then F = Q(ζ7 ). Therefore we have η = σ2 g(η) ˜ in case of or = σ4 and they satisfy ζ7 = 1. Thus we conclude that 7 | ∆ F = Q(ζ7 ). Suppose [F ∩ Q(ζ7 ) : Q] = 3; then F0 and F ∩ Q(ζ7 ) coincides with the maximal real subfield of Q(ζ7 ). σa (a = 3, 5) induces an automorphism of order 3 in Gal(F ∩ Q(ζ7 )/Q), and one of them coincides with η on F ∩ Q(ζ7 ) = F0 but neither of them satisfies a2 + a + 1 ≡ 0 mod 7. Thus this case does not occur. • Case of p = 3, n = 2 In this case, pn = 9, and there is no integer a which satisfies a2 + a + 1 ≡ 0 mod 9. Hence this case does not happen.

May 11, 2007

15:20

86


ws-procs9x6

YOSHIYUKI KITAOKA

• Case of p = 3, n = 1 In case of F 3 ζ3 , an automorphism ρ ∈ Gal(F (ζ3 )/Q) = Gal(F/Q), which is an extension of η fixes ζ3 (∈ F ∩ Q(ζ3 )) because the order of η is three, g(ρ) ˜ In case of ζ3 6∈ F , F ∩ Q(ζ3 ) = Q holds, and so and so ζ3 = 1, i.e. 3 | ∆. g(ρ) ρ ˜ extending η to ρ by ζ = ζ −1 , we have ζ 6= 1, i.e. 3 - ∆. 3

3

3

˜ = 1; then τ3 = 1 and PropoNow we distinguish three cases. Suppose ∆ × η−p sition 3.5 implies [R(˜ η , p) : WF oF ] = 1. Hence we get κ(η) = 1. ˜ = 3; then ζ3 ∈ F implies 3 | w. As in Lemma 3.14, we put Suppose ∆ √ η ˜ ai Q √ a 3 u aij ζ3w , 3 ui η˜ = ζ3w = ζ3w j j Q ρ b ρ bi bij ζw = ζw , ui = ζw j uj ,

which yields a ≡ b ≡ 0 mod w by (4.11), and since the quadratic subfield of F is Q(ζ3 ), we have a ≡ 1 mod 3 and so Φ3 (a) ≡ 0 mod 3. Hence by ˜ and then (3.27) means V1 (˜ (3.9), we have τ3 = 3 = ∆ η ) = {y mod 3 | yΦ3 (a, A)(B − b)a ≡ 0 mod 3w for ∀ρ}. It is easy to see that ¶ µ 20   if ρ = J,  02 ¶ B−b= µ  −a 1   if ρ = η, −1 −a − 1 µ ¶ w whence choosing η˜ with a = , we have, by a ≡ 1 mod 3 2w µ ¶ µ ¶ 2w w (B − b)a ≡ , mod 3w. w w Since 2x + y ≡ x + y ≡ 0 mod 3 has only a trivial solution, y ∈ V1 (˜ η) satisfies yΦ3 (a, A) ≡ 0 mod 3. Thus V1 (˜ η ) ⊂ V2 (˜ η ) (cf. (3.27),(3.28)) holds, which means κ(η) = 1. ˜ = 7, i.e. F = Q(ζ7 ) as above. As in Lemma 3.14, we put Suppose ∆ √ η ˜ ai Q √ a 7 u aij ζ7w , 7 ui η˜ = ζ7w = ζ7w j j Q ρ b ρ bi bij ζw = ζw , ui = ζw j uj .

Since the order of η is 3, we have a ≡ 2, 4 mod 7, and a ≡ b ≡ 0 mod w ˜ (cf. (4.11)). Therefore we have Φ3 (a) ≡ 0 mod 7, from which τ3 = 7 = ∆ follows by (3.9) and hence y ∈ V1 (˜ η ) (cf. (3.27)) yields ˜ yΦ3 (a, A)(B − b)a ≡ 0 mod ∆w.

May 11, 2007

15:20


ws-procs9x6


87

Here, since we have

taking a =

µ

¶ µ 2 0    02 ¶ B−b= µ  −a 1   −1 −a − 1

¶ w , we obtain w

if ρ = J, if ρ = η,

µ

¶ µ ¶ 2w (−a + 1)w (B − b)a = , . (−a − 2)w 2w µ ¶ 2 −a + 1 The determinant of is not 0 mod 7, and so y ∈ V1 (˜ η ) yields 2 −a − 2 yΦ3 (a, A) ≡ 0 mod 7 and so y ∈ V2 (˜ η ). Therefore we conclude that κ(η) = 1 as above. Remark 4.3. In all the examples given here, we have o× F = U (m) for a single m. If F is a real cyclic extension of degree 4, then we see that there is a system of fundamental units {u1 , u2 , u3 } such that uσ1 = ζu−1 1 ,

uσ1

=

ζu−1 1 ,

uσ2 = u−1 3 ,

uσ2

=

u−1 3 ,

uσ3 = ζ 0 u2

uσ3

=

u−1 1 u2

(ζ, ζ 0 = ±1), (ζ = ±1),

(4.13) (4.14)

where σ is a generator of Gal(F/Q). Let η = σ 2 ; then we have U (1) = h−1, u1 i,

U (1) = h−1, u1 i,

U (2) = h−1, u2 , u3 i

U (2) =

−1 h−1, u1 u−2 2 , u1 u2 u3 i

for (4.13), for (4.14),

and so o× F 6= U (1)U (2) in case of (4.14). We can see that ½ ½ 2 if ζ 0 = −1 1 if ζ = −1 κ(η) = for (4.13), = for (4.14), 0 4 if ζ = 1 2 if ζ = 1 and as far as we have checked, κ(η) = Relη is true. 5. Appendix 5.1. Divisors of f (p) Proposition 5.1. Let L be a Galois extension of Q and η ∈ Gal(L/Q), and let f (x) ∈ Z[x] be a polynomial in Q[x] with (f (x), f 0 (x)) = 1. Then there exists the maximum δ of natural numbers m such that f (˜ η) if η˜ ∈ Gal(L(ζm )/Q) and η˜|L = η, then ζm = 1 holds.

(5.1)

May 11, 2007

15:20

88


ws-procs9x6

YOSHIYUKI KITAOKA

We have the following expression for δ: δ=

gcd η∈σL/Q (p),p-2DL δ

f (p) = lim

x→∞ η∈σ

gcd

f (p).

L/Q (p),p>x

We need a few lemmas to prove Proposition 5.1. Lemma 5.1 (Newton Approximation). Let q be a prime number and f (x) ∈ Zq [x]. If a ∈ Zq satisfies |f (a)|q < |f 0 (a)|2q , then there is a solution α ∈ Zq of f (x) = 0 such that |α − a|q ≤ |f (a)/f 0 (a)|q . Proof. See p.83 in [1]. Lemma 5.2. Let q be a prime number and let f (x) ∈ Z[x] be the polynomial in the proposition. Taking integral polynomials A(x), B(x) ∈ Z[x] and a natural number n such that A(x)f (x) + B(x)f 0 (x) = n, we define the integer s by q s ||n. Then for any natural number t ≥ 2s + 1 #{a mod q t | f (a) ≡ 0 mod q t } ≤ deg f (x) · q s holds. Proof. If t ≥ 2s + 1 and f (a) ≡ 0 mod q t , then we have q s+1 - f 0 (a) and hence |f (a)|q < |f 0 (a)|2q . Hence, by Lemma 5.1, there is an element α ∈ Zq such that f (α) = 0 and |α − a|q ≤ |f (a)/f 0 (a)|q . q t−s | f (a)/f 0 (a) implies a ≡ α mod q t−s . Since the number of roots α is less than or equal to deg f (x), we obtain the assertion. Lemma 5.3. The maximal integer δ in Proposition 5.1 exists. Proof. For relatively prime natural numbers m1 and m2 , the condition (5.1) holds for m = m1 m2 if and only if it holds for m = m1 , m2 . Hence, assuming that m is a power q t of a prime q, we have only to show that it holds for a finitely many such integers m. Suppose that η 0 ∈ Gal(Q(ζqt )/Q) coincides η on L ∩ Q(ζqt ); the number of such η 0 ’s is equal to [Q(ζqt ) : L ∩ Q(ζqt )]. Since η 0 is extended to an element of Gal(L(ζqt )/Q) whose f (a) restriction on L is η, the condition (5.1) yields ζqt = 1, where a is defined 0

by ζqηt = ζqat . Hence a mod q t corresponding to η 0 satisfies f (a) ≡ 0 mod q t . Let n, s be those in Lemma 5.2. If, then t ≥ 2s + 1 holds, then Lemma 5.2

May 11, 2007

15:20


ws-procs9x6


89

implies [Q(ζqt ) : L ∩ Q(ζqt )] ≤ deg f (x) · q s and so ϕ(q t ) ≤ deg f (x) · q s [L ∩ Q(ζqt ) : Q] ≤ deg f (x) · n[L : Q]. Hence q t is bounded. Proof of Proposition 5.1. Put G=

gcd

f (p)

η∈σL/Q (p),p>x

for a large number x (> 2DL δ). Take any extension η˜ of η in Gal(L(ζG )/Q); f (˜ η) f (q) then we have ζG ≡ ζG ≡ 1 mod q if q (> xG) is a prime number such f (˜ η) that σL(ζG )/Q (q) 3 η˜. If ζG 6= 1, then for a prime divisor ` of the order of f (˜ η) ζG , we have ` | G and ζ` − 1 ∈ q. Hence we get ` = q and so q | G. This f (˜ η) contradicts q > G. Thus we obtain ζG = 1 and so G | δ. Conversely, take a prime p so that η ∈ σL/Q (p) and p - 2DL δ. For η˜ ∈ f (˜ η)

f (p)

f (p)

σLδ /Q (p), ζδ = 1 holds, whence ζδ ≡ 1 mod p follows. Then ζδ should occur and δ divides f (p). Thus we have δ | G. In general, δ = gcdη∈σL/Q (p),p-2DL f (p) does not hold.

=1

Corollary 5.1. Suppose f (x) = x−1 in the proposition. If η is the identity (resp. the complex conjugation), then we have δ = w (resp. δ = 2). Proof. Suppose δ satisfies the condition (5.1). By the Galois theory, there are [Q(ζδ ) : L ∩ Q(ζδ )] extensions η˜ of η to Gal(L(ζδ )/Q), and then the supposition f (x) = x − 1 implies ζδη˜−1 = 1, i.e. ζδη˜ = ζδ . Thus the extension to Gal(L(ζδ )/Q) is uniquely determined as the identity. This means [Q(ζδ ) : L ∩ Q(ζδ )] = 1, that is Q(ζδ ) ⊂ L and hence δ|w. Hence, in case that η is the identity, w divides δ clearly and so δ = w, and if η is the complex conjugation, then ζδ−1 = ζδη˜ = ζδ yields δ = 2. 5.2. Structure of Galois group extended by roots of units The aim of this subsection is to study the structure of µ ³ q ´. ³ p ´¶ n pn Gal L p o× W L L L for an algebraic number field L. Let us recall [11]

Theorem 5.1. Let L be a field of characteristic 0 and let p be a prime and a ∈ L \ Lp . Then we have n

(i) If p 6= 2, then xp − a is irreducible over L for every natural number n,

May 11, 2007

15:20

90


ws-procs9x6

YOSHIYUKI KITAOKA

(ii) If p = 2, then x2 −a is irreducible over L, and a 6∈ −4L4 if and n only if x2 − a is irreducible over L for any integer n (≥ 2). Proposition 5.2. Let L be an algebraic number field. Then the following hold for any natural number n: (i) For ² ∈ o× / WL L2 , we have −4² ∈ / L(ζ2n )4 . L with ² ∈ × 2 2n (ii) For ² ∈ oL with ² ∈ / WL L , x − ² is reducible over L(ζ2n ) if and only √ n if ² ∈ L(ζ2 ). √ ²i ∈ L(ζ2n ) and ²i ∈ / WL L2 hold for i = 1 (iii) If, for ²i ∈ o× L (i = 1, 2) 2 and 2, then ²1 ²2 ∈ WL L . Proof. Proof of (i): Suppose −4² ∈ L(ζ2n )4 ; then there is an element α ∈ L(ζ2n ) such that α4 = −4². Putting M = L(α), we see that L ⊂ M ⊂ L(ζ2n ). Since L(ζ2n ) is abelian over L, M is a Galois extension of L. The assumption on ² and (ii) in Theorem 5.1 imply that x4 + 4² is irreducible over L and so [M : L] = 4 is valid. Since M is a Galois extension of L, M √ √ contains a conjugate −1α of α and so −1. √ √ √ √ In case −1 ∈ / L( −²), we have L( −²)( −1) = M = √ of √ √ √ L( −²)( α2 ) (α2 = ±2 −² ∈ L( −²)), which yields √ α2 /(−1) ∈ L( −²)2 . √ √ Then −α2 = ∓2 −² = (c + d −²)2 holds for ∃ c, ∃ d ∈ L, and this implies √ √ ∓2 −² = c2 − ²d2 + 2cd −², which yields a contradiction ² = (c/d)2 . Thus √ √ −1 ∈ L( −²) holds. √ √ √ √ √ If −1 ∈ / L, then L( −1) = L( −²) and so −1/ −² ∈ L follows, which implies the contradiction ² ∈ L2 . √ √ Suppose −1 ∈ L. We note that Q(ζ2n ) = Q( −1)Q(ζ2n + ζ2−1 n ) and √ n −1 of Q(ζ Q(ζ2n + ζ2−1 )/Q is cyclic, and so a subfield containing n 2 ) coin√ m cides with Q(ζ2 ) for some integer m. Hence by −1 ∈ L ⊂ M ⊂ L(ζ2n ) there is an integer such that L ∩ Q(ζ2n ) = Q(ζ2m ), M ∩ Q(ζ2n ) = Q(ζ2m+2 ). Hence x4 − ζ2m is irreducible over L by (ii) in Theorem 5.1. Thus M = √ √ √ √ a L( 4 −4²) = L( 4 ζ2m ) holds. By Kummer’s theory, we have 4 −4²/ 4 ζ2m ∈ × L for ∃ a ∈ Z, which implies a contradiction ² ∈ −4ζ2am L4 ⊂ WL (oL )2 . Thus we have completed the proof of (i). Proof of (ii): We know n

x2 − ² is irreducible over L(ζ2n )

⇔ x2 − ² is irreducible over L(ζ2n ) and −4² ∈ / L(ζ2n )4 if n ≥ 2

⇔ x2 − ² is irreducible over L(ζ2n ).

May 11, 2007

15:20


ws-procs9x6


91

The first equivalence follows from Theorem 5.1. The second follows from (i). This completes the proof of the case (ii). √ √ Proof of (iii): If L( ²1 ) = L( ²2 ), then ²1 /²2 ∈ L2 holds and the assertion √ √ (iii) is clear. We assume L( ²1 ) 6= L( ²2 ) hereafter. We need the following: For a natural number n, the subfields of Q(ζ2n ) are Na = Q(ζ2a ), Na,+ = Q(ζ2a + ζ2−1 a ), −1 Na,− = Q(ζ2a − ζ2a ),

[Na : Q] = 2a−1 (a = 1, 2, · · · , n), [Na,+ : Q] = 2a−2 (a = 3, 4, · · · , n), [Na,− : Q] = 2a−2 (a = 3, 4, · · · , n).

To show this, we have only to verify that subfields of Nn = Q(ζ2n ) not contained in Nn−1 are Nn,+ and Nn,− for n ≥ 3. Since Gal(Nn /Q) ∼ = Z/2Z ⊕ Z/2n−2 Z and the subgroup corresponding to Nn−1 is of order 2 and generated by g := (0 mod 2) ⊕ (2n−3 mod 2n−2 ) ∈ Z/2Z ⊕ Z/2n−2 Z, the assertion above follows from the fact that subgroups of Gal(Nn /Q) which do not contain g is (0 mod 2) ⊕ (0 mod 2n−2 ), h(1 mod 2) ⊕ (0 mod 2n−2 )i, h(1 mod 2) ⊕ (2n−3 mod 2n−2 )i. They correspond to Nn , Nn,+ , Nn,− respectively, since (1 mod 2) ⊕ (0 mod 2n−2 ) corresponds to the complex conjugation and (0 mod 2) ⊕ (1 mod 2n−2 ) n−3 ≡ 1 + 2n−1 mod 2n . corresponds to ζ2n → ζ25n , and 52 By virtue of Gal(L(ζ2n )/L) ∼ = Gal(Q(ζ2n )/L ∩ Q(ζ2n )), we have √ [L( ²i ) ∩ Q(ζ2n ) : L ∩ Q(ζ2n )] √ = [Q(ζ2n ) : L ∩ Q(ζ2n )]/[Q(ζ2n ) : L( ²i ) ∩ Q(ζ2n )] √ √ = [L(ζ2n ) : L]/[L( ²i , ζ2n ) : L( ²i )] √ √ = [L(ζ2n ) : L]/[L(ζ2n ) : L( ²i )] = [L( ²i ) : L] = 2. √ √ √ √ Since L ⊂ L( ²i ) ⊂ L(ζ2n ) and L( ²1 ) 6= L( ²2 ), fields L( ²1 ) ∩ Q(ζ2n ) √ and L( ²2 ) ∩ Q(ζ2n ) are different quadratic extensions of L ∩ Q(ζ2n ). Using the classification above, we get L ∩ Q(ζ2n ) = Q or Na,+ (a = 3, 4, · · · , n − 1), on noting that the quadratic extensions of Na (2 ≤ a ≤ n − 1) in Nn are only Na+1 , the quadratic extensions of Na,+ (3 ≤ a ≤ n − 1) in Nn are Na , Na+1,+ , Na+1,− , the quadratic extensions of Na,− (3 ≤ a ≤ n) in Nn are only Na .

May 11, 2007

15:20

92


ws-procs9x6

YOSHIYUKI KITAOKA

(iii.1) Suppose L ∩ Q(ζ2n ) = Q. √ √ √ We note that L( ²1 ), L( ²2 ), L( ²1 ²2 ) are quadratic√extensions of L √ √ contained in L(ζ2n ) and they are equal to L( −1), L( 2), L( −2). If √ √ √ √ L( ²j ) = L( −1) (j = 1 or 2), then ²j / −1 ∈ L and −²j ∈ L2 fol√ √ lows, which is a contradiction. Hence we have L( ²1 ²2 ) = L( −1), whence −²1 ²2 ∈ L2 follows. √ √ √ For the remaining cases, we may assume L( 2) = L( ²1 ), L( −2) = √ L( ²2 ); then ²1 ∈ 2L2 , ²2 ∈ −2L2 yield ²1 ²2 ∈ −L2 .

(iii.2) Suppose L ∩ Q(ζ2n ) = Na,+ for a = 3, 4, · · · , n − 1. √ κ + 2) and Put κ = ζ2a + ζ2−1 a ; then Na,+ = Q(κ), Na+1,+ = Q( √ √ √ Na+1,− = Q( κ − 2) hold, and Q( κ + 2), Q( κ − 2) and Q(ζ2a ) are √ √ √ quadratic extensions of Na,+ in Q(ζ2n ). Also L( ²1 ), L( ²2 ), L( ²1 ²2 ) √ are quadratic extensions of L in L(ζ2n ) and should be equal to L( κ + 2), √ √ L( κ − 2), L(ζ2n ). Since −1(ζ2a − ζ2−1 a ) is real, it is in Na,+ and it follows √ 2 2 that (κ + 2)(κ − 2) = κ2 − 4 = (ζ2a − ζ2−1 = −( −1(ζ2a − ζ2−1 ∈ a ) a )) 2 2 2 −Na,+ ⊂ −L . Hence we have ²1 ²2 , ²1 (²1 ²2 ) or ²2 (²1 ²2 ) ∈ −L . The assumption ²i ∈ / WL L2 now implies −²1 ²2 ∈ L2 . Corollary 5.2. Let L be an algebraic number field and suppose ² ∈ o× L √ √ m satisfies ² ∈ / WL L2 . If ² ∈ L(ζ2m ), then x2 − ² is irreducible over L(ζ2m ). √ Proof. The assumption ² ∈ L(ζ2m ) implies m ≥ 2. By Theorem 5.1, √ √ √ m / L(ζ2m ) and −4 ² ∈ / x2 − ² is irreducible over L(ζ2m ) if and only if 4 ² ∈ √ m m L(ζ2m )4 . Suppose that x2 − ² is reducible over L(ζ ); first, assume 2 √ √ m ≥ 3. If f := 4 ² ∈ L(ζ2m ), then −4² = (ζ8 2f )4 ∈ L(ζ2m )4 , which √ contradicts the assertion (i) of Proposition 5.2. If −4 ² √∈ L(ζ2m )4 , then √ putting −4 ² = f14 (f1 ∈ L(ζ2m )), we have −4² = (f12 /(ζ8 2))4 ∈ L(ζ2m )4 , √ m which is also a contradiction. Therefore x2 − ² is irreducible over L(ζ2m ) in case of m ≥ 3. √ √ Now, applying the above to m = 3, x8 − ² = (x2 )4 − ² is irreducible √ over L(ζ8 ). Hence x4 − ² is irreducible over L(ζ4 ), which completes the proof of the case m = 2. Corollary 5.3. Let L be an algebraic number field and let ²1 , ²2 ∈ o× L √ √ satisfy ²1 ∈ / WL L2 . If ²1 ∈ L(ζ2m ) for a natural number m, then ²1 ²2 ∈ / 2 m L(ζ2 ) . m √ Proof. By applying Corollary 5.2 to ² = ²1 ²22 , x2 − ²1 ²2 is irreducible √ √ over L(ζ2m ) and so is x2 − ²1 ²2 . Therefore ²1 ²2 ∈ / L(ζ2m )2 .

May 11, 2007

15:20


ws-procs9x6


93

The following is the main result of this subsection. Theorem 5.2. Let L be an algebraic number field. Denote by r the rank of o× L . Let p be a prime number and n a natural number. Then we have the following: √ 2n 2 (i) Suppose either p 6= 2 or that p = 2 and o× WL )2 ⊂ WL · (o× L ∩ L( L) . Then we have µ ³ q ´. ³ p ´¶ n r pn ∼ W Gal L p o× L = (Z/pn Z) . L L

√ 2n 2 (ii) Suppose that p = 2 and o× WL )2 6⊂ WL · (o× L ∩ L( L ) . Then we have n ≥ 2 and µ ³ q ´. ³ p ´¶ pn pn × ∼ Gal L oL WL L = Z/2n−1 Z × (Z/2n Z)r−1 . We need more lemmas.

Lemma 5.4. Suppose that p is an odd prime number and ² ∈ o× L is not in p p n WL (o× ) . Then ² ∈ / L(ζ ) for ∀n ≥ 1. p L √ Proof. Suppose ² ∈ L(ζpn )p ; then L ⊂ L( p ²) ⊂ L(ζpn ) clearly and ¡ ± ¢ ¡ ± ¢ Gal L(ζpn ) L ∼ = Gal Q(ζpn ) L ∩ Q(ζpn ) . √ Since L(ζpn )/L is an abelian extension, L( p ²)/L is a Galois extension. √ / L and p 6= 2, xp − ² is irreducible over L. Thus we Hence in view of p ² ∈ √ √ √ p have [L( ²) : L] = p and so the conjugate ζp p ² is in L( p ²). Therefore √ √ √ ζp ∈ L( p ²) and L ⊂ L(ζp ) ⊂ L( p ²) follows. [L( p ²) : L] = p and [L(ζp ) : L] | p − 1 imply L(ζp ) = L. Therefore we have L ∩ Q(ζpn ) ⊃ Q(ζp ) and √ hence L ∩ Q(ζpn ) = Q(ζpm ) and L( p ²) ∩ Q(ζpn ) = Q(ζpm+1 ) hold for √ 1 ≤ ∃ m < n by p 6= 2. Since L( p ²) (⊂ L(ζpn )) is the composite of L √ √ and L( p ²)p∩ Q(ζpn ) = Q(ζpm+1 ), we have L( p ²) = L(ζpm+1 ) and hence √ a f := p ²/ p ζpm ∈ L for ∃ a ∈ Z by virtue of ζpm ∈ L. Therefore ² = × p a p ζpm f ∈ WL (oL ) and this contradicts the assumption on ². × p Lemma 5.5. Suppose ²1 ∈ o× n (≥ 2) be a L is not in WL (oL ) and let √ n natural number. Under the further assumption of ²1 ∈ / L( 2 WL )2 in case of p = 2, we have ³ ¡ p ¢. ¡ p ¢´ √ n n n Gal L p WL , p ²1 L p WL ∼ = Z/pn Z.

May 11, 2007

15:20

94


ws-procs9x6

YOSHIYUKI KITAOKA

√ n Proof. We note that L( p WL ) = L(ζpm ) for some integer m (≥ n) and n by Kummer’s theory, it suffices to prove that xp − ²1 is irreducible over √ n L( p WL ). √ n n In the case of p 6= 2, xp − ²1 is irreducible over L( p WL ) if and only √ n if xp − ²1 is so over L( p WL ), which is true by virtue of Lemma 5.4. √ n n Suppose that p = 2 and x2 − ²1 is reducible over L( 2 WL ); then either √ √ √ n n ²1 ∈ L( 2 WL ) or −4²1 ∈ L( 2 WL )4 occurs. However, neither of them n can not occur by the assumption or (i) in Proposition 5.2. Thus x2 − ²1 is √ n irreducible over L( 2 WL ). Lemma 5.6. Under the assumption in (ii) in Theorem 5.2, n ≥ 2 holds ` and there is an element ²1 ∈ o× / WL (o× L such that ²1 ∈ L ) for ∀` ≥ 2, √ n ²1 ∈ L( 2 WL )2 and ³ ¡p ¢. ¡ p ¢´ √ n n n Gal L 2 WL , 2 ²1 L 2 WL ∼ = Z/2n−1 Z.

2 Proof. Suppose ² ∈ o× L ∩ L(ζ2m ) for m := #WL ; then we have ² = 2 ∃ ∃ (a + bζ2m ) for a, b ∈ L, which implies ² = a2 + b2 ζm , ab = 0 and hence √ × 2 × 2 2 ² ∈ WL (o× L ) . Thus we have oL ∩ L( WL ) ⊂ WL (oL ) , and hence n ≥ 2. 2 By the assumption in (ii), there is an element ² ∈ o× L such that ² = α √ × 2 2n / WL (oL ) . Write ² = ζ²k1 where ζ ∈ WL and (α ∈ L( WL )) and ² ∈ × × ` 2 ²1 ∈ oL with ²1 ∈ / WL (oL ) for ∀` ≥ 2. The condition ² ∈ / WL (o× L ) implies √ √ √ (k−1)/2 √ 2n ∈ L( WL ). Therefore 2 - k. Then we have α = ² = ζ ²1 ²1 √ √ n ²1 ∈ L( 2 WL ) holds. Defining the integer a by #WL = 2a b (2 - b), a+1 n−1 n+a √ √ − ²1 is irreducible Corollary 5.2 implies that x2 − ²1 = (x2 )2 √ n−1 √ n over L(ζ2n+a ) = L( 2 WL ). Therefore x2 − ²1 is also irreducible over √ n L( 2 WL ).

Lemma 5.7. Let ²1 , · · · , ²r be a system of fundamental units of L. Suppose the assumptions of (i), (ii) in Theorem 5.2 in each case, with one extra√ √ n condition ²1 ∈ L( 2 WL ) in case of (ii). Then we have ³p ´ √ √ n √ √ n n pa+1 ²s+1 ∈ / L p WL , p ²1 , · · · , p ²s , pa ²s+1 for 0 ≤ ∀a < n and 1 ≤ ∀s < r.

√ √ √ √ √ n Proof. Suppose pa+1 ²s+1 ∈ L( p WL , pn ²1 , · · · , pn ²s , pa ²s+1 ); then we have, for some integers a1 , a2 , · · · , as+1 p √ √ n √ a a √ n n f := p ²1 1 · · · p ²s s pa ²s+1 as+1 / pa+1 ²s+1 ∈ L( p WL ), √ √ √ √ n n since L( p WL , pn ²1 · · · , pa ²s+1 ) is a Kummer extension of L( p WL ).

May 11, 2007

15:20


ws-procs9x6


95

In case of (i): Define the integer b by pb k(a1 , · · · , as , (as+1 p − 1)pn−a−1 ),

0 ≤ b ≤ n − a − 1.

Then we have a /pb

² := ²1 1

b

(a

s+1 · · · ²sas /p ²s+1

p−1)pn−a−1−b

= fp

n−b

n−b−1

= (f p

p n )p ∈ L( p WL )p .

p By noting that ² is not in WL (o× L ) , the equation above contradicts Lemma 2 5.4 if p 6= 2. Suppose p = 2; the assumption of (i) implies ² ∈ WL (o× L) , which contradicts the choice of the integer b.

In case of (ii): Define the integer b by 2b k(2a1 , a2 , · · · , as , (2as+1 − 1)2n−a−1 ),

0 ≤ b ≤ n − a − 1.

Then we have 2a1 /2b a2 /2b ²2

² := ²1

b

(2a

· · · ²sas /2 ²s+1s+1

p n ∈ L( 2 WL )2 .

−1)2n−a−1−b

√ 2a /2b n−b−1 2 = ( ²1 1 f 2 )

Suppose 2b k2a1 ; then put

(2a /2b −1)/2 a /2b

b

(2a

−1)2n−a−1−b

. η1 = ²1 and η2 = ²1 1 ²2 2 · · · ²sas /2 ²s+1s+1 √ √ √ √ n n We have η1 , η2 ∈ o× η1 ∈ L( 2 WL ) and η1 η2 = ² ∈ L( 2 WL )2 . This L, √ n contradicts Corollary 5.3, since L( 2 WL ) = L(ζ2m ) for some m. √ 2n b 2 Suppose 2 | a1 ; then ² ∈ L( WL ) as above and one of A2 := a2 /2b , · · · , b As := as /2b , As+1 := (2as+1 − 1)2n−a−1−b is odd, and ²1 2a1 /2 = √ b n (²1 a1 /2 )2 ∈ L( 2 WL )2 . Hence we have ´2 ³p As+1 −2a /2b 2n 2 . · · · ² = ²A ²²1 1 W ∈ L L 2 s+1 A

s+1 Applying (iii) of Proposition 5.2 to ²1 and ²2A2 · · · ²s+1 , we have the incluAs+1 A2 sion ²1 ²2 · · · ²s+1 ∈ WL L2 , which is a contradiction.

Proof of Theorem 5.2. Let ²1 , · · · , ²r be a system of fundamental units of L, and we may suppose that ²1 is a unit given in Lemma 5.6 in the case (ii). Then Lemmas 5.5, 5.6, 5.7 imply ( · ³q ´ ´¸ ³p prn in the case (i), pn pn × L oL : L WL = n−1+(r−1)n 2 in the case (ii). ³q ´. ¡√ ¢ n n Since L p o× L p WL is a Kummer extension, this completes the L proof.

May 11, 2007

15:20

96


ws-procs9x6

YOSHIYUKI KITAOKA

Acknowledgments I thank Professor S. Kanemitsu for many helpful suggestions, and this work was partially supported by Grant-in-Aid for Scientific Research (C), The Ministry of Education, Culture, Sports, Science and Technology of Japan. References 1. J.W.S. Cassels and A. Fr¨ ohlich, Algebraic Number Theory, Academic Press, 1967. 2. Y-M. J. Chen, Y. Kitaoka and J. Yu, Distribution of units of real quadratic number fields, Nagoya Math. J., 158 (2000), 167–184. 3. C.W. Curtis and I. Reiner, Representation theory of finite groups and associative algebras, Interscience, 1962. 4. T. Honda, Pure cubic fields whose class numbers are multiple of three, J. Number Theory, 3 (1971), 7–12. 5. M. Ishikawa and Y. Kitaoka, On the distribution of units modulo prime ideals in real quadratic fields, J. reine angew. Math., 494 (1998), 65–72. 6. Y. Kitaoka, Distribution of units of a cubic field with negative discriminant, J. Number Theory, 91 (2001), 318–355. 7. Y. Kitaoka, Distribution of units of an algebraic number field, in Galois Theory and Modular Forms, (2003), 287–303. Developments in Mathematics, Kluwer Academic Publishers. 8. Y. Kitaoka, Distribution of units of an algebraic number fields with only one fundamental unit, Proc. Japan Acad., 80A (2004), 86–89. 9. Y. Kitaoka, Distribution of units of a cubic abelian field modulo prime numbers, J. Math. Soc. Japan, (2)58 (2006), 563–584. ¨ 10. T. Kubota, Uber den bizyklischen biquadratischen Zahlk¨ orper, Nagoya Math. J., 10 (1955), 65–85. 11. S. Lang, Algebra, Springer-Verlag, 2002. 12. H.W. Lenstra, Jr., On Artin’s conjecture and Euclid’ algorithm in global fields, Inventiones math., 42 (1977), 201–224. 13. K. Masima, On the distribution of units in the residue class field of real quadratic fields and Artin’s conjecture (in Japanese), RIMS Kokyuroku, 1026 (1998), 156–166. 14. H. Roskam, A quadratic analogue of Artin’s conjecture on primitive roots, J. Number Theory, 81 (2000), 93–109.

May 11, 2007

15:20


ws-procs9x6

97

SIGN CHANGES OF FOURIER COEFFICIENTS AND EIGENVALUES OF CUSP FORMS WINFRIED KOHNEN Universit¨ at Heidelberg, Mathematisches Institut, INF 288, D-69120 Heidelberg, Germany E-mail: [email protected] We give a survey about recent results on sign changes of Fourier coefficients and eigenvalues of cusp forms, both in the elliptic case and in the case of Siegel modular forms.

1. Introduction Fourier coefficients of elliptic cusp forms are mysterious objects and in general no simple arithmetical formulas are known for them. If one checks tables, one finds e.g. that quite often sign changes of those coefficients occur and it seems a natural assignment to try to understand them. For example, one may ask if there are infinitely many sign changes or when the first sign change occurs, or one may study sign changes in short intervals. This might be particularly interesting when the cusp form is a normalized Hecke eigenform and so the Fourier coefficients are equal to the Hecke eigenvalues. In this article we would like to give a survey on recent results obtained in this direction. In the last section we will also address the case of Siegel modular forms of genus two, where the situation gets more involved.

2. The starting point The result in the following Theorem seems to be well-known. However, we are not able to give a precise reference where it appeared first. As a substitute, we refer to the joint paper with M. Knopp and W. Pribitkin [10] for an extension to quite general subgroups of SL2 (R) and a discussion of related topics.

May 11, 2007

15:20

98


ws-procs9x6

WINFRIED KOHNEN

As usual, we define Γ0 (N ) :=

½µ

ab cd

¶

¯ ¯ ∈ Γ1 ¯¯ c ≡ 0

¾ (mod N ) ,

where of course Γ1 := SL2 (Z) denotes the full modular group. Theorem 2.1. Let f be a non-zero cusp form of even integral weight k on Γ0 (N ) and suppose that its Fourier coefficients a(n) are real for all n ≥ 1. Then the sequence (a(n))n∈N has infinitely many sign changes, i.e. there are infinitely many n such that a(n) > 0 and there are infinitely many n such that a(n) < 0. Proof. It is sufficient to assume that a(n) ≥ 0 for all but finitely many n and to derive a contradiction. Let X a(n)n−s , 2 and the constant implied in ¿ is absolute.

Note that it is reasonable to assume that (n, N ) = 1, since the eigenvalues a(p) with p|N are explicitly known by Atkin-Lehner theory. The proof of the above result uses techniques from analytic number theory (e.g. Perron’s formula and a strong convexity principle) and properties of the symmetric square L-function of f , notably the fact that the value 1 of the latter at s = 1 is universally bounded from below by À log(kN ) , an important result by D. Goldfeld, J. Hoffstein and D. Lieman [8]. Recently, the above result was improved in a joint paper with H. Iwaniec and J. Sengupta, as follows. Theorem 3.2 ([9]). Suppose that f is a normalized Hecke eigenform of even integral weight k and level N (not necessarily squarefree) that is a newform. Then one has a(n) < 0 for some n with √ n ¿ k N · log8+² (kN ), (n, N ) = 1, ² > 0. Indeed, this immediately follows from Theorem 1 in [9]. The proof is “elementary” in the sense that it completely avoids the use of the symmetric square L-function. Instead, the Hecke relations for the eigenvalues are exploited. Let us be a bit more precise. One proves the following two Propositions. Proposition 3.1. One has ³x´ X √ λ(n) log2 ¿² (k 2 N )1/4 log2+² (kN ) x, n n≤x,(n,N )=1

x ≥ 1; ² > 0.

The proof follows in a standard way from the convexity principle in combination with Perron’s formula. Proposition 3.2. Suppose that λ(n) ≥ 0 for 1 ≤ n ≤ x, (n, N ) = 1. Then ³x´ X √ x λ(n) log2 À , x À N. 2 n log x n≤x,(n,N )=1

May 11, 2007

15:20


ws-procs9x6

SIGN CHANGES OF FOURIER COEFFICIENTS AND EIGENVALUES OF CUSP FORMS

101

We indicate the proof in the case N = 1 (the general case, of course, is similar). We clearly have ³x´ X X λ(n) log2 À λ(n). n n≤x

≤

n≤x/2

We now restrict the summation to n = p`, where p and ` are primes p x/2. We then find X

λ(n) log2

n≤x

³x´ n

À

³ X √

p≤

x/2

´2 ³ X λ(p) − √ p≤

x/2

´ 1

(since λ(p`) = λ(p)λ(`) if p and ` are different and λ(p)2 = λ(p2 ) + 1)) À

³ X p≤

√

x/2

´2 ³ X 1 − √ p≤

x/2

1

´

(since λ(p) ≥ 0 in the given range) À

x log2 x

(by the Prime Number Theorem). It is easy to see that Propositions 3.1 and 3.2 imply Theorem 3.2. Using the same ideas, but working a bit harder one can obtain in a similar way Theorem 3.3 ([9]). Suppose that f is a normalized Hecke eigenform of level N (not necessarily squarefree) and even integral weight k. Then a(n) < 0 for some n with 29

n ¿ (k 2 N ) 60 ,

(n, N ) = 1.

Note that the bound in Theorem 3.3 in weight aspect is better than the one obtained by convexity, although no sub-convexity bounds for Lfunctions have been used. We remark that using the recent sub-convexity bound in the case of the full modular group ¯ µ ¶¯ ¯ ¯ ¯Lf 1 + it ¯ ¿² (|t| + k)1/3+² , ² > 0, ¯ ¯ 2

due to Jutila and Motohashi (2006, to appear) —the proof is much more difficult and involved—, one can improve the bound in Theorem 3.3 in weight aspect to k 2/3+² if N = 1.

May 11, 2007

15:20

102


ws-procs9x6

WINFRIED KOHNEN

The method used in [12] can be extended in various directions. First, one can study sign changes in short intervals. More precisely, denote by Sf+ (x) and Sf− (x) the number of positive integers n ≤ x with (n, N ) = 1 for which a(n) > 0 and a(n) < 0, respectively. The following result was proved in joint work with I. Shparlinski. Theorem 3.4 ([13]). Suppose that f is a normalized Hecke eigenform of even integral weight k and squarefree level N that is a newform. Then there are absolute constants η < 1 and A > 0 such that for y = xη one has Sf±1 (x + y) − Sf±1 (x) > 0 whenever x ≥ (kN )A . In another way, one can generalize Theorem 3.1 and its method of proof to arbitrary non-zero cusp forms with real Fourier coefficients. The following result was obtained in joint work with Y.J. Choie. Theorem 3.5 ([4]). Let f be a non-zero cusp form of even integral weight k and squarefree level N with real Fourier coefficients a(n). Then there exist n1 , n2 ∈ N with µ ¶ log(N + 1) n1 , n2 ¿ k 3 N 4 log10 (kN ) · exp c log log(N + 2) · max{ψk (N ), k 2 N 1/2 log16 (kN )}

such that a(n1 ) > 0, a(n2 ) < 0. Here c > 0 is an absolute constant and ψk (N ) :=

Y log(kN ) . log p

p|N

The proof of Theorem 3.5, being a bit more technically involved, proceeds as follows. One writes f as a linear combination of a special orthogonal basis {Fν } of Hecke eigenforms of weight k and level N and carries over to the Rankin-Selberg zeta functions RFν ,Fµ (s) estimates partially already proved in [12] in the context of L(sym2 Fν , s). To obtain final corresponding statements for f itself one applies Chebyshev’s inequality in conjunction with uniform lower bounds for the Petersson scalar products hFν , Fν i. The bounds obtained in this way are somewhat weaker than those in [12], being partially due to the fact that one averages over a basis of Hecke eigenforms and in this way some extra factors depending on k and N are introduced. Somewhat better bounds (using similar methods) can be obtained if one restricts to forms f , e.g. in the subspace of newforms.

May 11, 2007

15:20


ws-procs9x6

SIGN CHANGES OF FOURIER COEFFICIENTS AND EIGENVALUES OF CUSP FORMS

103

We also note that in Theorem 3.1 the additional assumption (n, N ) = 1 was made, since for Hecke eigenforms the eigenvalues a(p) (p a prime, p|N ) are explicitly known as already stated above. For arbitrary cusp forms, however, it seems unnatural to enforce this condition. 4. Siegel modular forms of genus two Let Hg := {Z ∈ Cg,g | Z = Z 0 , =(Z) > 0} be the Siegel upper half-space of genus g and recall that the real symplectic group Spg (R) ⊂ GL2g (R) operates on Hg by µ ¶ AB ◦ Z = (AZ + B)(CZ + D)−1 . CD Let Γg := Spg (Z) be the group of integral symplectic matrices of size 2g, also called the Siegel modular group of genus g. Let F be a Siegel cusp form of integral weight k and genus g, i.e. F is a complex-valued holomorphic function on Hg satisfying the transformation law µ ¶ AB k F (M ◦ Z) = det(CZ + D) F (Z), ∀M = ∈ Γg CD and having a Fourier expansion of the form X F (Z) = a(T )e2πitr(T Z) , T >0

Z ∈ Hg ,

where T runs over all positive definite, symmetric half-integral matrices of size g. For basic facts on Siegel modular forms we refer e.g. to [7]. Note that a(T [U ]) = (−1)k a(T ),

∀ U ∈ GLg (Z)

(where GLg (Z) operates on T > 0 as above by T [U ] = U 0 T U ). This easily follows from the transformation formula for F applied with µ 0 ¶ U 0 M= . 0 U −1 Here as usual, for a matrix U we denote by U 0 its transpose. Using the analytic properties of the Koecher-Maass Dirichlet series attached to F (cf. e.g. [11] and the literature given there) and of the RankinSelberg Dirichlet zeta function attached to F (for g = 1 cf. p. 2, l. 6; cf.

May 11, 2007

15:20

104


ws-procs9x6

WINFRIED KOHNEN

e.g. [2] in the general case), it should not be difficult to generalize the Theorem 2.1 to the situation here, i.e. if F has real Fourier coefficients and is not identically zero, then there should exist infinitely many T > 0 (modulo GLg (Z)) such that a(T ) > 0 and there should be infinitely many T > 0 (modulo GLg (Z)) such that a(T ) < 0. However, we have not checked this in detail. Now suppose that F is an eigenfunction of all Hecke operators. Note that eigenvalues and Fourier coefficients for g > 1 are no longer “proportional”, in any reasonable sense, and properties of the former ones in general cannot be deduced from the other ones and conversely, in an easy way. Although the Fourier coefficients remain rather mysterious and not much is known about them, the situation is a bit better for the eigenvalues, since the latter can be studied with the help of representation theory and algebraic geometry. The situation is particularly good if g = 2, the easiest case after the elliptic case, and for the rest of this section we will stick to this case. Thus in the following F will denote a cuspidal Hecke eigenform of weight k and genus 2. We will denote the linear space of all cusp forms of weight k on Γ2 by Sk (Γ2 ). Recall that the spinor zeta function attached to F is given by Y ZF (s) = ZF,p (p−s )−1 , −1/2, passing through all poles from Laplace eigenvalues.

∗ Supported in part by the 973 Program, by NSFC Grant # 10531060, and by a Ministry of Education Major Grant Program in Sciences and Technology # 305009. † Supported in part by the USA National Security Agency under Grant Number H9823006-1-0075. The United States Government is authorized to reproduce and distribute reprints notwithstanding any copyright notation herein.

May 11, 2007

15:20


ws-procs9x6

SHIFTED CONVOLUTION SUMS OF FOURIER COEFFICIENTS OF CUSP FORMS

109

1. Automorphic L-functions and subconvexity problems 1.1. The classical case: the Riemann zeta-function and Dirichlet L-functions In his 1859 memoir, Riemann introduced the approach of using an analytic object — Riemann zeta-function — to study the arithmetic problem of distribution of primes. Nowadays this approach has been exploited in various scopes with fruitful results. The associated artificial analytic objects are known as L-functions. They are functions defined on the complex plane under analytic/meromorphic continuation, sharing common features and conjectures with the Riemann zeta-function. There are two important open conjectures for L-functions: Generalized Riemann Hypothesis (GRH) and Generalized Lindelöf Hypothesis (GLH). The former concerns the location of nontrivial zeros and the latter is about the size of an L-function on the critical line <s = 1/2. By standard complex analysis, it is seen that GLH follows from GRH. Though being weaker, progress towards GLH is rather slow, even for the Riemann zeta-function ζ(s). In the case of ζ(s), GLH is the assertion α = 0 in the order estimate ζ(1/2 + it) ¿ε |t|α+ε

for |t| ≥ 1.

(1.1)

The upper estimate (1.1) holds true for α = 1/4 by the Phragmén– Lindel¨ of convexity principle, a robust method in complex analysis. The record to date is α = 32/205 due to Huxley [14], but it is still far from the anticipation in GLH. Amazingly, Weyl was able to show α = 1/6 about eighty years ago. Note that 32/205 = 1/6 − 13/1230. The progress meanwhile is small, and it seems that a kind of obstruction at Weyl’s bound is present. Below, we shall find such an obstruction occurred in other cases. The method of convexity principle applies well to other L-functions. Naturally, the bound resulted from this principle is called a convexity bound, and we refer any improvement (usually on the exponent of the convexity bound) as a subconvexity bound. Besides, we call a bound Weyl-like if it is the 2/3-th power of the convexity bound up to an arbitrarily small ε > 0. For instance, the convexity bound of ζ(s) is |t|1/4+ε and its Weyl-like bound is |t|1/6+ε . The Dirichlet L-function L(s, χ) was introduced to study the primes in an arithmetic progression. In addition to the t-aspect on the critical line s = 1/2+it, we are interested in the aspect of conductor, that is the modulus of the character χ. For either aspect, the exponent of the convexity bound is 1/4. The best known exponent for t-aspect is 1/6 which is Weyl-like. Unlike the Riemann zeta-function, nobody can break the Weyl bound so

May 11, 2007

15:20

110


ws-procs9x6

YUK-KAM LAU, JIANYA LIU AND YANGBO YE

far, though it was proven quite long time ago. On the conductor aspect, the Weyl-like bound is just achieved recently by Conrey and Iwaniec [6] for real characters. Before this, we only have 3/16 due to Burgess [4], which also remains the best for all characters. Both ζ(s) and L(s, χ) are L-functions of degree one, referring to the degree of a generic polynomial factor in p−s of their Euler product factorizations. Next, we turn to higher degree examples. 1.2. L-functions of degree two The L-function associated to a holomorphic Hecke eigenform or Hecke Maass eigenform is a typical example of degree two. Let Γ0 (N ) be the congruence subgroup that contains matrices in SL2 (Z) whose lower left entry is a multiple of N . The upper half plane H is identified with G/K where G = GL(2, R) and K = O(2, R) and hence the quotient space Γ0 (N ) \ H ∼ = Γ0 (N ) \ G/K. But instead, we consider the space Γ0 (N ) \ G which is regarded as the unit tangent bundle of Γ0 (N ) \ H. The Haar measure on Γ0 (N ) \ G is descended from dg =

dxdy dϕ , y 2 2π

where an element g ∈ G is expressed via Iwasawa decomposition as µ ¶ µ 1/2 ¶µ ¶ 1x y cos ϕ sin ϕ g= , 1 y −1/2 − sin ϕ cos ϕ mapped under the natural projection to z = x + iy ∈ H. Consider the Laplace operator ¶ µ 2 ∂2 ∂2 ∂ 2 e + + y ∆ = −y ∂x2 ∂y 2 ∂x∂ϕ

on the Hilbert space L2 (Γ0 (N ) \ G). A Maass eigenform with eigenvalue e with eigen1/4 + k 2 is a square-integrable K-invariant eigenfunction of ∆ 2 value 1/4 + k . A holomorphic cusp form of weight k is a holomorphic function f on H such that the function in L2 (Γ0 (N ) \ G) corresponding e with eigenvalue (k/2)(k/2 − 1). to y k/2 f (z)eikϕ is an eigenfunction of ∆ When these forms are invariant under the Hecke operators Tn with n ≥ 1, we call them Hecke Maass eigenforms and holomorphic Hecke eigenforms, respectively. Their associated L-functions will involve three parameters t, k and N , and the convexity bound is (|t| + k)1/2 N 1/4 (|t|kN )ε .

May 11, 2007

15:20


ws-procs9x6


111

The current best subconvexity bounds are accordingly |t|1/3+ε by Good [11] and Meurman [28], k 1/3+ε by Peng [31] and Ivić [15], and N 1/6+ε for certain forms by Conrey and Iwaniec [6]. Amazingly, all of them are only Weyl-like, that is, no further advance is achieved for L-functions of degree two. Perhaps there is a barrier behind which we can break through merely in the very special case of ζ(s). 1.3. Rankin-Selberg L-functions The subconvexity problem of L-functions of degree ≥ 3 is mostly unsolved. One accessible case is the Rankin-Selberg L-function which is of degree 4. Let f be a holomorphic Hecke eigenform for Γ0 (N ) of weight k or Hecke Maass eigenform with eigenvalue 1/4 + k 2 . Suppose g a fixed holomorphic or Maass cusp form of weight l or eigenvalue 1/4 + l2 and level D. The Rankin-Selberg L-function L(s, f × g) satisfies the convexity bound ¡ ¢1/2+ε . L(1/2 + it, f × g) ¿ N D(|t| + k + l)(|t| + |k − l|)

(1.2)

We fix the level N , the form g, and t, and study the subconvexity estimate of L(1/2 + it, f × g) in the k-aspect. Thus, we are seeking bounds like L(1/2 + it, f × g) ¿N,g,t,ε k β+ε

(1.3)

for some 0 ≤ β < 1. This was firstly achieved by Sarnak [34] for holomorphic f , and by Liu and Ye [25,26] for f being Maass. Progress in this direction is summarized in the following table. Throughout the paper, θ denotes a bound towards the Generalized Ramanujan Conjecture (GRC) for GL2 , for which θ = 1/2 is trivial, and the best bound known to date is θ = 7/64 due to Kim and Sarnak [20]. GRC actually predicts that θ = 0. β

author(s)

the shifted convolution sum is treated by

18 19−2θ 15+2θ 16 6−2θ 7−4θ

Sarnak [34] Liu and Ye [25,26] Blomer [2] Lau, Liu, and Ye [23] Lau, Liu, and Ye [24] Jutila and Motohashi [19]

spectral method spectral method circle method spectral method spectral method spectral method

1− 2 3 2 3

1 8+4θ

May 11, 2007

15:20

112


ws-procs9x6


The Weyl-like bound achieved in [24] is as follows. Theorem 1.1. Let f be a holomorphic Hecke eigenform for Γ0 (N ) of weight k, or a Maass Hecke eigenform for Γ0 (N ) with Laplace eigenvalue 1/4 + k 2 , and correspondingly let g be a fixed holomorphic or Maass cusp form for Γ0 (N ), or for Γ0 (N 0 ) with (N, N 0 ) = 1. Then, for any small ε > 0, L(1/2 + it, f × g) ¿N,t,g,ε k 2/3+ε ,

(1.4)

where the implied constant grows at most polynomially in t and N , with the degree of the polynomial growth depending on ε. The same bound is obtained by Jutila and Motohashi [19] but for the full modular group SL2 (Z). The result in [19] also provides a subconvexity bound in the t-aspect, when |t| is suitably smaller than k. For the RankinSelberg L-function in question, the Weyl-like bound is only attained in the weight/spectral amongst the various aspects. The subconvexity bound is available on the level aspect N , see [29] and [13], but remains unsettled on t-aspect. 1.4. Plan of the article In this article, we try to give some historical developments and recent progress on estimation and analytic continuation of a type of shifted convolution sums, and indicate some of their applications to subconvexity bounds for automorphic L-functions. In view of the huge amount of materials in these areas at hand, we will mainly mention applications to the RankinSelberg L-function L(s, f × g) in the weight/spectral aspect. §2 presents some fundamentals of the shifted convolution sums. Basically, there are two methods to treat the shifted convolution sums, the circle method, and the spectral method. In §3, we describe two variants of the circle method, and their consequences in subconvexity bounds L(s, f × g). §§4–6 are devoted to the spectral method and its recent developments. The materials are organized not always in historical order, but in logical order. For example, some results in §§4–6 are actually obtained earlier then those in §3. 1.5. Notations As usual, τ (n), ϕ(n) denote, respectively, the divisor function and the Euler quotient function. For z ∈ C, 1. It is well known that g(z) admits a Fourier expansion, X ag (n)e(nz). (2.1) g(z) = n≥1

By the invariance under Γ, the integral is unfolded to give Z Z l y g(z)g(z)E(z, s) dµ(z) = y l+s |g(z)|2 dµ(z)

(2.2)

Γ∞ \H

Γ\H

= G(s)Dg (s),

where G(s) is a product of some Gamma factors, and Dg (s) =

X |ag (n)|2 . ns

n≥1

A classical method with Perron’s formula will yield an asymptotic formula for the summatory function X |ag (n)|2 n≤x

from Dg (s), provided that Dg (s) can be analytically continued to the left beyond σ = 1. With the available information on E(z, s), Dg (s) is meromorphically continued to the whole complex plane, and is regular on σ ≥ 1/2 except for a finite number of poles lying on the segment 1/2 < s ≤ 1. This is the basic principle of the Rankin-Selberg method. Prior to the works of Rankin and Selberg, Petersson developed an explicit formula, namely the Petersson trace formula, for the Fourier coefficients of a modular form. This formula involves the Kloosterman sum

May 11, 2007

15:20


ws-procs9x6


115

S(m, n, c) and Bessel functions, and is derived from the Poincaré series X Pm (z, s) = =(γz)s e(mγz). γ∈Γ∞ \Γ

Apparently a good understanding of the Kloosterman sum will result in better knowledge on the Fourier coefficients. To this end, Selberg [35] investigated the series X S(m, n, c) Z(s, m, n) = , c2s c≥1

which is a crucial component in the Fourier coefficient of Pm (z, s). His method is to give Pm (z, s) a spectral decomposition, regarding Pm (·, s) as a function in L2 (Γ \ H). By the aforementioned spectral theory, Pm (·, s) is a linear combination a series of Maass cusp forms and spectral integrals of Eisenstein series. The coefficients of the discrete part, i.e. the series of Maass cusp forms, are products of gamma functions, which amount to the analytic properties of the function Pm (z, s) in s. The continuous part is similar but, for simplicity, will not be further discussed here. As a result, Pm (z, s) is regular for σ > 1/2 except possibly for a finite number of simple poles on (1/2, 1]. Replacing the Eisenstein series E(z, s) in (2.2) by a Poincare series Pm (z, s), the two methods can be combined to study the shifted convolution sum X ag (n)ag (n + h) . (n + h/2)s n≥1

This idea was pointed out by Selberg in the last section of [35], but at that time, he did not find an application for this shifted convolution sum. During the past decades, the uses of the shifted convolution sum came up in the study of L-functions. Indeed for the classical example of degree one - the Riemann zeta-function ζ(s), the investigation of its fourth moment already leads naturally to the shifted convolution sum for the divisor function d(n), which was considered by Heath-Brown [7]. One needs to handle this or similar type of sums for higher degree automorphic L-functions. 3. Variants of the circle method Let g be a holomorphic Hecke eigenform for Γ0 (N ) of even weight l or Hecke Maass eigenform with eigenvalue 1/4 + l2 . Then g admits the following Fourier expansions: X λg (n)n(l−1)/2 e(nz) (3.1) g(z) = n≥1

May 11, 2007

15:20

116


ws-procs9x6


when g is holomorphic, and g(z) = y 1/2

X

λg (n)Kil (2π|n|y)e(nx)

(3.2)

n6=0

when g is Maass, where Kil is the modified Bessel function of the third kind, and z = x + iy. We normalize λg (1) = 1 in (3.1) and (3.2). In this section, we describe variants of the circle method to treat the shifted convolution sums like X Dg (ν1 , ν2 , h) = λg (m)λg (n)W (m, n) (3.3) ν1 m−ν2 n=h

uniformly in positive integers ν1 , ν2 , h, where W : R × R → R is a nice test function. For example, one may suppose that W is smooth, supported on [M1 , 2M1 ] × [M2 , 2M2 ], and satisfies kW (ij) k∞ ¿i,j M1−i M2−j

for all i ≥ 0, j ≥ 0,

(3.4)

where M1 , M2 are real numbers greater than 1. 3.1. The δ-symbol method To attack Dg (ν1 , ν2 , h) in (3.3), Duke, Friedlander, and Iwaniec [9,10] developed the δ-symbol method, which can be viewed as a variant of the circle method. This δ-symbol method has also been used in many occasions; see for example the DFI paper series, Kowalski, Michel, and Vanderkam [21], and Michel [29]. The following description is based on [9] and Michel [30]. Let ½ 1 if n = 0, (3.5) δ(n) = 0 if n 6= 0, be the Dirac symbol at 0 restricted to integers n; the basic idea of the δ-symbol method is to express δ(n) in terms of additive characters. One starts with a smooth, compactly supported, even function ω(x) with X ω(r) = 1. ω(0) = 0, r≥1

Put δd (n) = ω(d) − ω then we have δ(n) =

X d|n

³n´ d

δd (n).

;

May 11, 2007

15:20


ws-procs9x6


117

Now the condition d|n can be detected by additive characters. Thus, µ ¶ X1 X hn e δ(n) = δd (n) d d d≥1 h mod d X 1 X ∗ ³ an ´ e ∆c (n), (3.6) = c c c≥1

a mod c

where r = (h, d), a = h/r, c = d/r, and ∆c (n) =

X1 r≥1

r

δcr (n).

In practice, one applies the above identity to integers |n| < U/2, say, with the text function ω(x) supported on [K/2, K] and whose derivative satisfy kω (j) k∞ ¿ K −j−1

for all j ≥ 0.

Then δd (n) vanishes save for 1 ≤ d < max(K, U/K) = K by choosing K = U 1/2 . Hence ∆c (n) vanishes save for 1 ≤ c < K and ∆c (n) ¿ K −1 . Now applying (3.6) to the Dirac symbol δ(ν1 m − ν2 n − h) in (3.3), one therefore gets rid of the condition ν1 m − ν2 n − h = 0. For technical reasons, one introduces a localization factor φ(ν1 x − ν2 y − h) in Dg (ν1 , ν2 , h), where φ is a smooth function compactly supported on [−U/2, U/2], satisfying φ(0) = 1 and kφ(j) k∞ ¿ U −j

for all j ≥ 0.

Hence µ ¶ ah X e − Dg (ν1 , ν2 , h) = λg (m)λg (n) c m,n 1≤c≤K a mod c µ ¶ ν1 ma − ν2 na ×e Ec (m, n, h), c X

X∗

(3.7)

where 1 Ec (x, y, h) = W (x, y)φ(ν1 x − ν2 y − h) ∆c (ν1 x − ν2 y − h). c It turns out that the derivatives of Ec (x, y, h) are well controlled; in fact µ ¶i+j 1 ν1i ν2j K kEc(ij) k∞ ¿i,j . (3.8) (cK + |ν1 x − ν2 y − h|) min(M1 , M2 )i+j c

May 11, 2007

15:20

118


ws-procs9x6


Next one applies the Voronoi summation formula to both variables m and n, and the shifted convolution sum in question is transformed to Dg (ν1 , ν2 , h) =

X (ν1 ν2 , c) X λg (m)λg (n)S(−ν10 m + ν20 n, −h, c) c2 (3.9) m,n c≤K × Ic (m, n, h),

where S(a, b, c) is the classical Kloosterman sum, and µ √ ¶ Z ∞Z ∞ 4π mx Ic (m, n, h) =(2πik )2 Ec (x, y, h)Jk−1 c/(ν1 , c) 0 µ0 √ ¶ 4π ny × Jk−1 dxdy c/(ν2 , c)

(3.10)

with νj0 = νj /(νj , c). Integrating the Bessel functions in (3.10) by parts many times, one shows that Ic (m, n, h) is very small unless m and n lie in certain short ranges, and one can therefore restrict the summations of m and n in (3.9) to these short ranges. Applying Weil’s bound for Kloosterman sums p |S(a, b, r)| ≤ τ (r) (a, b, r)r, one gets the following result.

Theorem 3.1. Let g be a holomorphic cusp form for Γ0 (N ) of even weight l, or a Maass cusp form for Γ0 (N ) with eigenvalue 1/4 + l2 . Then Dg (ν1 , ν2 , h) ¿N,l,ε (ν1 M1 + ν2 M2 )3/4+ε .

(3.11)

This is proved by Duke, Friedlander, and Iwaniec [9] for the full modular group, and by Kowalski, Michel, and Vanderkam [21] for Γ0 (N ). From Theorem 3.1, one can get a subconvexity bound for L(1/2 + it, f × g). Theorem 3.2. Let f be a holomorphic Hecke eigenform for Γ0 (N ) of weight k, or a Maass Hecke eigenform for Γ0 (N ) with Laplace eigenvalue 1/4 + k 2 , and let g be a fixed holomorphic or Maass cusp form for Γ0 (N ), or for Γ0 (N 0 ) with (N, N 0 ) = 1. Then L(1/2 + it, f × g) ¿N,t,g,ε k 11/12+ε .

(3.12)

Theorem 3.2 does not appear in literatures. However it can be compared with Iwaniec’s bound k 5/12+ε for single automorphic L-functions [16].

May 11, 2007

15:20


ws-procs9x6


119

3.2. Jutila’s variant Let a0 /q 0 < a/q < a00 /q 00 be three consecutive Farey fractions with denominators ≤ Q, and µ ¶ µ ¸ a a + a0 a + a00 M = , . q q + q 0 q + q 00 Then (0, 1] is a disjoint union of these M(a/q), µ ¶ G G∗ a M . (0, 1] = q q≤Q a mod q

Let δ(n) function defined as in (3.5). Then the circle method of Hardy and Littlewood actually starts with the following decomposition of the δ(n): X X∗ Z δ(n) = e(nα)dα. (3.13) q≤Q a mod q

M(a/q)

Note that the length of the M(a/q) depends on a and q, and therefore in general one cannot invert the order of the summation and the integration above. This is known as the leveling problem. Jutila introduced another variant of the circle method in [17] and [18] to attack this leveling problem. This variant has also been used in many occasions like Harcos [12], Harcos and Michel [13], Blomer [1,2], and Blomer, Harcos, and Michel [3]. Theorem 3.3. Let Q ≥ 1 and Q−2 ≤ δ ≤ Q−1 be two parameters. Let ω be a non-negative function supported in [Q, 2Q] satisfying X kωk∞ ≤ 1, ω(q) > 0.

For r ∈ Q, let Ir (α) be the characteristic function of the interval [r−δ, r+δ], and define Λ=

X q

ω(q)ϕ(q),

X∗ 1 X ˜ I(α) = Id/q (α). ω(q) 2δΛ q d mod q

˜ Then I(α) is a good approximation to the characteristic function of [0, 1] in the sense that Z 1 Q2+ε 2 ˜ |1 − I(α)| dα ¿ε . (3.14) δΛ2 0

May 11, 2007

15:20

120


ws-procs9x6


To transform the sum in question by Jutila’s variant of the circle method, we let Q > N ν1 ν2 , and δ = Q−1 . Let ω ˜ be a function supported in [Q, 2Q] satisfying k˜ ω k∞ ³ Q−j

for all j ≥ 0,

and let ω(q) = ω ˜ (q)χ[N ν1 ν2 |q] (q), where χ[N ν1 ν2 |q] (q) is the characteristic function of N ν1 ν2 |q. Then Λ³ For simplicity, put T (α) =

X

Q2 . N ν1 ν2

λg (m)λg (n)e(ν1 mα)e(−ν2 nα)W (m, n).

m,n

Then the shifted convolution sum in (3.3) can be written as Z 1 Dg (ν1 , ν2 , h) = T (α)e(−αh)dα =

Z

0

1

˜ I(α)T (α)e(−αh)dα + 0 mt

=: D

+ Det ,

Z

1

0

˜ (1 − I(α))T (α)e(−αh)dα (3.15)

say. The error term Det is, by Cauchy’s inequality and Theorem 3.3, ˜ 2 · kT k2 Det ¿ k1 − Ik ¯ ¯ ¯ ¯X Q1+ε ¯ ¯ ¿ 1/2 max ¯ λg (m)λg (n)e(α1 m)e(−α2 n)W (m, n)¯ . ¯ δ Λ α1 ,α2 ¯

(3.16)

m,n

And this last quantity is acceptable by applying the estimate X λg (n)e(mα) ¿ε N k 5/4 x1/2 (N kx)ε n≤x

uniformly in α. This is due to Wilton, but the explicit dependence on N and k is shown in [13]. The main term Dmt in (3.15) can be computed as X 1 Dmt = ω ˜ (q) 2δΛ N ν1 ν2 |q (3.17) ¶ µ µ ¶¶ X∗ Z δ µd d T × + η e −h +η dη. q q −δ d mod q

May 11, 2007

15:20


ws-procs9x6


121

Applying Voronoi’s summation formula, we find that the double sums over m, n in (3.17) is for N ν1 ν2 |q, µ ¶ µ¯ ¶ X d(ν2 n − ν1 m) d ∗ T ωq,ν (m, n), (3.18) λg (m)λg (n)e +η = 1 ,ν2 ,η q q m,n where ∗ ωq,ν (x1 , x2 ) 1 ,ν2 ,η

4π 2 ν1 ν2 = q2

Z

∞ 0

×Jk−1

µ

Z

∞

W (t1 , t2 )e(ν1 t1 η − ν2 t2 η) √ √ ¶ µ ¶ 4πν2 x2 t2 4πν1 x1 t1 Jk−1 dt1 dt2 . q q 0

Inserting (3.18) into (3.17), we get ¶ µ µ ¶¶ X X∗ Z δ µd d T + η e −h +η dη q q N ν1 ν2 |q d mod q −δ Z δ X ω ˜ (q) = e(−ηh) −δ

× =:

Z

δ

X m,n

N ν1 ν2 |q

∗ S(−h, ν2 n − ν1 m, q)λg (m)λg (n)ωq,ν (m, n)dη 1 ,ν2 ,η

e(−ηh) −δ

X

ω ˜ (q)Y (m, n)dη,

(3.19)

N ν1 ν2 |q

say. This is where interchange of orders is needed, and this is guaranteed by the fact that the length of the intervals [−δ, δ] is independent of the variables. The quantity Y (m, n) above can be transformed as X X ∗ (m, n), λg (m)λg (n)ωq,ν Y (m, n) = S(−h, r, q) 1 ,ν2 ,η r∈Z

ν2 n−ν1 m=r

which is similar to the inner sums in (3.9). Arguing similarly, and invoking the spectral large sieve inequality, one gets Theorem 3.4. Let g be a holomorphic cusp form for Γ0 (N ) of even weight l, or a Maass cusp form for Γ0 (N ) with eigenvalue 1/4 + l2 . Then Dg (ν1 , ν2 , h) ¿N,l,ε (ν1 M1 + ν2 M2 )1/2+θ+ε .

(3.20)

The estimate above leads to a subconvexity bound for Rankin-Selberg L-functions. Theorem 3.5. Let f be a holomorphic Hecke eigenform for Γ0 (N ) of weight k, or a Maass Hecke eigenform for Γ0 (N ) with Laplace eigenvalue

May 11, 2007

15:20

122


ws-procs9x6


1/4 + k 2 , and correspondingly let g be a fixed holomorphic or Maass cusp form for Γ0 (N ), or for Γ0 (N 0 ) with (N, N 0 ) = 1. Then for any small ε > 0, we have L(1/2 + it, f × g) ¿N,t,g,ε k (6−2θ)/(7−4θ)+ε .

(3.21)

Theorems 3.4 and 3.5 are proved by Blomer [1,2]. 4. The spectral method In 2001, Sarnak [34] considered the subconvexity problem for RankinSelberg L-functions associated to two cusp forms with one varying weight and one fixed weight, in which the shifted convolution sum for the cusp form of fixed weight came into play. Sarnak applied Selberg’s approach but made a modification of replacing Pm (z, s) by X =(γz)s e(−h 1, we define µ√ ¶ X ν1 ν2 mn l−1 λg (n)λg (m) Dg (s, ν1 , ν2 , h) = ν1 m + ν2 n m,n>0 ν1 m−ν2 n=h

× (ν1 m + ν2 n)−s

(4.1)

when g is a holomorphic cusp form, and Dg (s, ν1 , ν2 , h) =

X

m,n6=0 ν1 m−ν2 n=h

Ã p !2il ν1 ν2 |mn| λg (n)λg (m) ν1 |m| + ν2 |n|

(4.2)

× (ν1 |m| + ν2 |n|)−s when g is a Maass form. To illustrate the ideas, let us consider the case of g being a holomorphic cusp form on Γ0 (N ) of weight l. Write Γ = Γ0 (N ν1 ν2 ) and V (z) = y l g(ν1 z)g(ν2 z).

May 11, 2007

15:20


ws-procs9x6


123

Then V is a Γ-invariant function rapidly decreasing at the cusps of Γ, and V ∈ L2 (Γ \ H). By the standard unfolding method, Dg (s, ν1 , ν2 , h) can be expressed in terms of the inner product (see [34, p.444], (A7)-(A9)) Dg (s, ν1 , ν2 , h) = (2π)s+l−1 (ν1 ν2 )(l−1)/2

hUh (·, s), V i . Γ(s + l − 1)

(4.3)

Note that V is square-integrable on Γ\H, because it is built from a cusp form. On the other hand, as a Poincaré series, Uh is not square integrable on Γ\H. However, since Γ\H is of finite volume, Parseval’s identity applies. Therefore X hUh (·, s), V i = hUh (·, s), φj ihV, φj i j≥1

+

Z 1 X ∞ hUh (·, s), Ea (·, 1/2 + iτ )i 4π a −∞ ×hV, Ea (·, 1/2 + iτ )i dτ,

(4.4)

where a runs over all the cusps. Note that hUh , φ0 i = 0. In view of (4.3), one may investigate the right-side of (4.4) for the properties of Dg (s, ν1 , ν2 , h). These inner products can be computed as follows. Theorem 4.1. We have hUh (·, s), φj i =

π 1/2−s ρj (−h) Γ 4|h|s−1/2

µ

s − 1/2 + itj 2

¶ µ ¶ s − 1/2 − itj Γ , 2

and hUh (·, s), Ea (·, 1/2 + iτ )i =

π 1−s−iτ ρa (1/2 + iτ, −h) Γ(1/2 − iτ ) 2|h|s−1/2+iτ ¶ µ ¶ µ s − 1/2 − iτ s − 1/2 + iτ Γ . ×Γ 2 2

Recall that by the Maass-Selberg theory (see Deshouillers and Iwaniec [8, p.227]), L2 (Γ\H) admits a spectral decomposition with respect to ∆. The spectrum of ∆ consists of two components: the discrete spectrum 0 = λ0 < λ1 ≤ λ2 ≤ · · · , and the continuous spectrum covering the segment [1/4, ∞). Each eigenvalue in the discrete spectrum has finite order, and λj → ∞ as j → ∞. Moreover, there are two types of eigenvalues: 0 < λj < 1/4 which are called exceptional, and λj ≥ 1/4. The famous Selberg conjecture asserts that there is no exceptional eigenvalue for congruence groups, but the currently best known result is λ1 ≥ 1/4 − θ2 , where θ = 7/64 is the exponent of the best known bound toward the Generalized

May 11, 2007

15:20

124


ws-procs9x6


Ramanujan Conjecture for Maass forms, due to Kim and Sarnak [20]. Write λj = sj (1 − sj ) and sj = 1/2 + itj where 0 < itj ≤ θ if λj is exceptional, and tj ∈ [0, ∞) otherwise.

(4.5)

Theorem 4.1 with (4.5) implies immediately that each summand on the right-side of (4.4) is holomorphic in σ > 1/2 + θ. Using the estimate of individual hV, φj i developed in [33], Sarnak [34, Theorem A.1] concluded that Dg (s, ν1 , ν2 , h) extends to a holomorphic function on σ > 1/2 + θ and has the following upper bound estimate. Theorem 4.2. Let g be a holomorphic cusp form for Γ0 (N ) of even weight l, or a Maass cusp form for Γ0 (N ) of Laplace eigenvalue 1/4 + l2 . Then Dg (s, ν1 , ν2 , h) extends to a holomorphic function for σ ≥ 1/2 + θ + ε, for any ε > 0. Moreover, in this region it satisfies Dg (s, ν1 , ν2 , h) ¿N,g,ε (ν1 ν2 )1/2+ε |h|1/2+θ+ε−σ (1 + |t|)3 + χ(g)|h|1−σ , where χ(g) = 0 or 1 according as g is holomorphic or Maass form. From this, Sarnak [33] deduced the following subconvexity bound for holomorphic Hecke eigenform f . Note that it is the first subconvexity bound in the k-aspect for L(1/2 + it, f × g). Theorem 4.3. Let f be a holomorphic Hecke eigenform for Γ0 (N ) of weight k, and let g be a fixed holomorphic or Maass cusp form for Γ0 (N ), or for Γ0 (N 0 ) with (N, N 0 ) = 1. Then for any small ε > 0, L(1/2 + it, f × g) ¿N,t,g,ε k 18/(19−2θ)+ε .

(4.6)

Theorem 4.2 also enables Liu and Ye [25,26] to derive a subconvexity bound for L(s, f × g) with Maass eigenforms f . Theorem 4.4. Let f be a Maass Hecke eigenform for Γ0 (N ) with Laplace eigenvalue 1/4 + k 2 , and let g be a fixed holomorphic or Maass cusp form for Γ0 (N ), or for Γ0 (N 0 ) with (N, N 0 ) = 1. Then for any small ε > 0, L(1/2 + it, f × g) ¿N,t,g,ε k (15+2θ)/16+ε .

(4.7)

May 11, 2007

15:20


ws-procs9x6


125

5. The spectral method: meromorphic continuation to σ > 1/2 If we allow the occurrence of poles, Dg (s, ν1 , ν2 , h) can indeed be meromorphically continued to a wider region. According to (4.5), if we continue Dg (s, ν1 , ν2 , h) to σ > 1/2, the possible poles are those at sj = 1/2 + itj , where 0 < itj ≤ θ with λj = sj (1 − sj ) being exceptional Laplace eigenvalues. As predicted by the GRC, these poles should not exist. Since we do not assume GRC, we will have to control the residues of these possible poles. Furthermore, we may refine Sarnak’s Theorem 4.2 in the t-aspect via the mean square estimate in Good [11] rather than the term-wise bound. Good’s result was proved originally for holomorphic cusp forms of weight l ≥ 4. In other cases, it was generalized recently by Krötz and Stanton [22]. As we will see, switching from individual bound for hV, φj i to a mean square estimate provides a significant saving. In view of (4.3), (4.4), and Theorem 4.1, we introduce the following functions Bj (h, s) = (2π)s+l−1 (ν1 ν2 )(l−1)/2

hUh (·, s), φj i Γ(s + l − 1)

ρj (−h) 2s+l−3 π l−1/2 = (ν1 ν2 )(l−1)/2 s−1/2 Γ(s + l − 1) |h| µ ¶ µ ¶ s − 1/2 + itj s − 1/2 − itj ×Γ Γ , 2 2 hUh (·, s), Ea (·, 1/2 + iτ )i Ca (h, s, τ ) = (2π)s+l−1 (ν1 ν2 )(l−1)/2 Γ(s + l − 1)

(5.1)

ρa (1/2 + iτ, −h) 2s+l−2 π l−iτ = (ν1 ν2 )(l−1)/2 s−1/2+iτ Γ(s + l − 1) Γ(1/2 − iτ )|h| µ ¶ µ ¶ s − 1/2 + iτ s − 1/2 − iτ ×Γ Γ , (5.2) 2 2

and denote by Rh (s) the following sum over the exceptional eigenvalues, Rh (s) =

X (ν1 ν2 )(l−1)/2 2s+l−3 π l−1/2 ρj (−h) Γ(s + l − 1) |h|s−1/2 1/2≤sj ≤1/2+θ µ ¶ µ ¶ s − sj s − (1 − sj ) ×Γ Γ hV, φj i. 2 2

(5.3)

Note here that we include the possible nonexceptional eigenvalue λj = 1/4 with sj = 1/2 and ti = 0 in Rh (s) just for technical simplicity. Then, for

May 11, 2007

15:20

126


ws-procs9x6


σ > 1, Dg (s, ν1 , ν2 , h)−Rh (s) = +

1 4π

X

j: tj >0 XZ ∞ a

Bj (h, s)hV, φj i (5.4) Ca (h, s, τ )hV, Ea (·, 1/2 + iτ )idτ.

−∞

Since Rh (s) is a finite sum and hV, φj i ¿ kV kkφj k ¿ν1 ,ν2 ,g 1, it follows that Rh (s) is analytic in the half-plane σ > 0 except for poles at sj and 1 − sj . By Sarnak [34, (A.16)], we can choose {φj } to be Hecke eigenforms such that µ ¶ (mN tj )ε πtj ρj (m) ¿ε √ cosh mθ . (5.5) 2 N Inserting (5.5) into (5.3), and then applying Stirling’s formula, we deduce, for 1/2 ≤ σ ≤ 2 and |t| ≥ 1, Rh (s) ¿ν1 ,ν2 ,g |h|1/2+θ−σ+ε .

(5.6)

However, the above estimate is not true in the region 1/2 ≤ σ ≤ 2 and |t| ≤ 1, since the factor Γ((s−sj )/2) in (5.3) has a pole at s = sj = 1/2+itj with 0 < itj ≤ θ as in (4.5). Obviously, these poles lie in the interval [1/2, 1/2 + θ] ⊂ [1/2, 1]. This is why we require |t| ≥ 1 in Theorem 5.1 below. By Theorem 4.1, Bj (h, s) (when tj ≥ 0) and Ca (h, s, τ ) are holomorphic in σ > 1/2. The right-side of (5.4) is analytically continued to a holomorphic function on σ > 1/2, provided that uniform convergence on compact sets is justified. From (5.5), we infer that for 1/2 + ε ≤ σ ≤ 3/2, (1 + ||t| − tj |)σ/2−3/4 (1 + |t|)σ/2+l−3/4

e−πtj /2 Bj (h, s) ¿l,N |h|1/2−σ+θ+ε tεj

−π(|t−tj |+|t+tj |−2|t|)/4

×e

(5.7) ,

and, with the spectral large sieve in place of (5.5), e−π|τ |/2 Ca (h, s, τ ) ¿l,N |h|1/2−σ+ε (1 + |τ |)ε

(1 + ||t| − τ |)σ/2−3/4 (1 + |t|)σ/2+l−3/4

−π(|t−τ |+|t+τ |−2|t|)/4

×e

(5.8)

.

To verify the uniform convergence of (5.4) on compact sets, we assume for instance l ≥ 4 and invoke Good [11, Theorem 1]. The function V is of

May 11, 2007

15:20


ws-procs9x6


127

different form from that of f there; nonetheless, Good’s result still covers our case. This is because his proof applies to fl (z) = y k F (z)Pl (z) where F and Pl are a cusp form and a Poincaré series for Γ, respectively; see [11, (3.2)] and [11, §4]. Note that g(ν1 z) and g(ν2 z) are cusp forms for Γ, and therefore g(ν2 z) can be written as a linear combination of the Poincaré series. Hence, Z X 1 X T |hV, φj i|2 eπtj + |hV, Ea (·, 1/2 + iτ )i|2 eπ|τ | dτ ¿ T 2l . (5.9) 4π a −T tj ≤T

The estimate (5.9) is also valid for other cases, by Krötz and Stanton [22]. Plainly |t − τ | + |t + τ | − 2|t| ≥ |τ | if |τ | ≥ 2|t|. Thus, by (5.7) and Weyl’s law #{j : tj ≤ T } = cT 2 + O(T log T )

(5.10)

for T ≥ 2|t|, we have X X e−πtj /4 e−πtj |Bj (h, s)|2 ¿ |h|1+2θ−2σ+ε (1 + |t|)3/2−σ−2l tj ≥T

tj ≥T

1+2θ−2σ+ε −3T /4

¿ |h|

e

Also, by (5.8), we have, for T ≥ 2|t|, Z e−π|τ | |Ca (h, s, τ )|2 dτ ¿ |h|1−2σ+ε e−3T /4 |τ |≥T

(5.11)

.

(5.12)

¿ |h|1+2θ−2σ+ε e−3T /4 .

Now assume T0 ≥ 2|t|. Dividing dyadically and applying the CauchySchwarz inequality, we obtain X |Bj (h, s)hV, φj i| j: T0 −1/2 To reach the Weyl bound as in (1.4), we need to meromorphically continue Dg (s, ν1 , ν2 , h) further to the left. 6.1. Further meromorphic continuation to σ > −1/2 First, let us look at Rh (s) in (5.3). As Rh (s) is a finite sum and hV, φj i ¿ kV kkφj k ¿ν1 ,ν2 ,g 1, Rh (s) is analytic in the complex plane except for poles lying on the real axis, which arise from the two gamma functions. In particular, on the halfplane σ > 0, there are only finitely many poles at sj and 1 − sj lying in the interval [1/2 − θ, 1/2 + θ] ⊂ [0, 1]. Using Stirling’s formula, we deduce from

May 11, 2007

15:20


ws-procs9x6


131

(5.5) in the same way as we deduce (5.6) that, for |σ| ≤ A0 and |t| ≥ 1, Rh (σ + it) ¿A0

|ρj (−h)| σ−1/2 |h| |Γ(σ + l −

1 + it)| ¯ µ ¶ µ ¶¯ ¯ s − sj ¯ s − (1 − sj ) ¯¯¯¯ × ¯¯Γ hV, φj i¯ Γ ¯ 2 2

¿ |h|1/2−σ+θ+ε |t|−l ¿ |h|1/2−σ+θ+ε .

(6.1)

Now let us turn to the first sum on the right side of (5.4). Recall (5.1) and (5.2) and write µ ¶ 2s+l−3 π l−1/2 s − 1/2 + itj Bj (s) = (ν1 ν2 )(l−1)/2 Γ Γ(s + l − 1) 2 (6.2) µ ¶ s − 1/2 − itj ×Γ , 2 µ ¶ s − 1/2 + iτ 2s+l−2 π l−iτ Γ Ca (s, τ ) = (ν1 ν2 )(l−1)/2 Γ(s + l − 1) 2 µ ¶ s − 1/2 − iτ ×Γ . 2

(6.3)

Then from (5.4), (5.1), (5.2), (6.2), and (6.3) we have Dg (s, ν1 , ν2 , h) − Rh (s) X ρj (−h) = Bj (s)hV, φj i |h|s−1/2 j:tj >0 Z 1 X ∞ ρa (1/2 + iτ, −h) Ca (s, τ ) + hV, Ea (·, 1/2 + iτ )i dτ. (6.4) 4π a −∞ Γ(1/2 − iτ ) |h|s−1/2+iτ We deduce from (6.2) that Bj (s) ¿l,ν1 ,ν2 ,ε T

(6.5)

for 0 ≤ tj ≤ 2T and −1/2 ≤ σ ≤ 3/2. Similarly, from (6.3) we derive that Ca (s, τ ) ¿l,ν1 ,ν2 ,ε T for |τ | ≤ 2T and |s − (1/2 ± itj )| ≥ ε or |s − (1/2 ± iτ )| ≥ ε. Besides, we may deduce that ¯ µ ¯ µ ¶¯2 ¶¯2 Z Z ¯ ¯ ¯ ¯ ¯Ca 1 + ε + it, τ ¯ dt ¯Bj 1 + ε + it ¯ dt and ¯ ¯ ¯ ¯ 2 2 (6.6) |t|³T |t|³T ¿l,ν1 ,ν2 ,ε T 1−2l

May 11, 2007

15:20

132


ws-procs9x6


and Z

|t|³T

¯ µ ¶¯2 Z ¯ ¯ ¯Bj − 1 + it ¯ dt, ¯ ¯ 2 |t|³T

¯ ¶¯2 ¯ ¯ ¯Ca (− 1 + it,τ ¯ dt ¯ ¯ 2

¿l,ν1 ,ν2 T

(6.7) 2−2l

.

6.2. Illustration for the proof of Theorem 1.1 The proof of Theorem 1.1 follows the line of arguments in [34], and our salient point is a delicate study on the Mellin transform of the shifted convolution sum against an oscillatory function. We need to give it a good upper estimate. To do so, we decompose spectrally the shifted convolution sum. The oscillatory function is given by an exponential integral, to which we apply the stationary phase method to extract the main part. Our desired estimate then follows from the spectral large sieve inequality and an estimate of Good on inner products of eigenfunctions. The spectral decomposition of shifted convolution sum is powerful and interesting on its own. It plays a key role in [34] as well, but there, Sarnak considered only for his purpose the analytic continuation to the plane σ > 1/2 + θ. We need a more precise form so that the meromorphic continuation is carried out to the wider region σ > −1/2. To illustrate the crucial roles played by the meromorphic continuation to σ > −1/2 and bounds in (6.7), let us look at [24, (9.25)]: Σ00d (C, T )`0 =

1 2πi

Z

X

`00 j: 0

Number Theory: Sailing on the Sea of Number Theory Proceedings of the 4th China-Japan Seminar, Weihai, China 30 August - 3 September 2006 (Series on Number Theory and Its Applications)

Number Theory: Sailing on the Sea of Number Theory: Proceedings of the 4th China-Japan Seminar

Number theory and its applications

Number Theory

Number Theory: Dreaming in Dreams: Proceedings of the 5th China-Japan Seminar, Higashi-Osaka, Japan, 27-31 August 2008 (Series on Number Theory and Its Applications)

Number Theory: Dreaming in Dreams: Proceedings of the 5th China-Japan Seminar, Higashi-Osaka, Japan, 27-31 August 2008 (Series on Number Theory and Its Applications)

Number Theory

Number Theory

Number Theory

Number Theory

Number theory

Number Theory

Number Theory

Number Theory

Number theory

Number theory

Handbook Of Number Theory

Number theory and its history

Number Theory and Its History

Lectures on Elementary Number Theory

Elements of Number Theory

Handbook of number theory

Elements of number theory

Handbook of number theory

Elementary Number Theory and Its Applications, 1986

Number theory and cryptography

Physics and number theory

Number theory and polynomials

Algebra and number theory

Number theory: Paris 1992-3

Number theory 3: Diophantine geometry

Number Theory: Sailing on the Sea of Number Theory Proceedings of the 4th China-Japan Seminar, Weihai, China 30 August - 3 September 2006 (Series on Number Theory and Its Applications)