12 The Weak Mordell-Weil Theorem 123 12.1 Kummer Theory of Number Fields . . . . . . . . . . . . . . . . . . . 123 12.2 Proof of the Weak Mordell-Weil Theorem . . . . . . . . . . . . . . . 125 13 Exercises
129
6
CONTENTS
Preface This book is based on notes the author created for a one-semester undergraduate course on Algebraic Number Theory, which the author taught at Harvard during Spring 2004 and Spring 2005. This book was mainly inspired by the [SD01, Ch. 1] and Cassels’s article Global Fields in [Cas67]
————————— - Copyright: William Stein, 2005, 2007.
License: Creative Commons Attribution-Share Alike 3.0 License Please send any typos or corrections to [email protected].
7
8
CONTENTS
Acknowledgement: This book closely builds on Swinnerton-Dyer’s book [SD01] and Cassels’s article [Cas67]. Many of the students of Math 129 at Harvard during Spring 2004 and 2005 made helpful comments: Jennifer Balakrishnan, Peter Behrooz, Jonathan Bloom, David Escott Jayce Getz, Michael Hamburg, Deniz Kural, Danielle li, Andrew Ostergaard, Gregory Price, Grant Schoenebeck, Jennifer Sinnott, Stephen Walker, Daniel Weissman, and Inna Zakharevich in 2004; Mauro Braunstein, Steven Byrnes, William Fithian, Frank Kelly, Alison Miller, Nizameddin Ordulu, Corina Patrascu, Anatoly Preygel, Emily Riehl, Gary Sivek, Steven Sivek, Kaloyan Slavov, Gregory Valiant, and Yan Zhang in 2005. Also the course assistants Matt Bainbridge and Andrei Jorza made many helpful comments. The mathemtical software [S+ 11], [PAR], and [BCP97] were used in writing this book.
This material is based upon work supported by the National Science Foundation under Grant No. 0400386.
Chapter 1
Introduction 1.1
Mathematical background
In addition to general mathematical maturity, this book assumes you have the following background: • • • • • •
Basics of finite group theory Commutative rings, ideals, quotient rings Some elementary number theory Basic Galois theory of fields Point set topology Basic of topological rings, groups, and measure theory
For example, if you have never worked with finite groups before, you should read another book first. If you haven’t seen much elementary ring theory, there is still hope, but you will have to do some additional reading and exercises. We will briefly review the basics of the Galois theory of number fields. Some of the homework problems involve using a computer, but there are examples which you can build on. We will not assume that you have a programming background or know much about algorithms. Most of the book uses Sage http://sagemath.org, which is free open source mathematical software. The following is an example Sage session: sage: 2 + 2 4 sage: k. = NumberField(x^2 + 1); k Number Field in a with defining polynomial x^2 + 1
Algebraic Number Theory, a Computational Approach - GitHub
Jan 16, 2013 - 2.2.1 The Ring Z is noetherian . .... This material is based upon work supported by the National Science ... A number field K is a finite degree algebraic extension of the ... How to use a computer to compute with many of the above objects ( ...... (after the first year)? Write a Sage program that creates a table ...
number theory and algebra pdf. Download now. Click here if your download doesn't start automatically. Page 1 of 1. a computational introduction to number ...
complete proofs in your own words. You do not need to answer the Bonus Question (I will mark it if you answer it, but your grade in this exam will be based only ...
complete proofs in your own words. You do not need to answer the Bonus Question (I will mark it if you answer it, but your grade in this exam will be based only on your answers to Questions 1 and 2). In the following let m â¡ 1 (mod 4) be a square-f
B201 A Computational Intelligence Approach to Alleviate Complexity Issues in Design.pdf. B201 A Computational Intelligence Approach to Alleviate Complexity ...
Dec 28, 2013 - Coding theory began in the late 1940s, together with the development of electronic commu- nication and computing. In fact, it is possible to pinpoint the moment of its birth exactly, namely the publication of Claude Shannon's landmark
and data security.] ...... Click or double-click on the Maple iconâor ask the lab assistant where it is ...... 2. f : Un â Ua à Ub is also a one-to-one, onto mapping. 3.
gorithmâ is sometimes used more loosely (and sometimes more precisely) than defined here ...... The author recently watched a TV show (not movie!) called La ...
ismp/52_griewank-andreas-b.pdf)). The general .... cheap, and us silly humans have had to repeatedly rediscover this fact. ... (https://shlens.wordpress.com/),.
Computational approach for studying biomolecular site dynamics in cell signaling systems ..... ligand-binding site, which comprises domains I and III of the EGFR ...
Jul 31, 2012 - 1+t2 .] 2. Fermat's Last Theorem for exponent 4 asserts that any solution to ... (a) Show that if the equation x2 + y4 = z4 has no integer solutions.
to Music Information and New Interpretations of An. Aesthetic Fitness ..... 1), there might be a priming effect where the main theme was memorised by the ...
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. a computational ...
List of Figures. 1.1 Elk Cloner the first known computer viruses to be spread âinto the wildâ1. 2 ..... harm to a user, a computer, or network can be considered malware [26]. 2.1 Introduction ... them to sell spam-sending services. ⢠Worm or vi
describing the group, one can encompass the transformations and their corresponding sym- metries. In fact, every symmetry has an associated group encompassing it. To make this discussion concrete, let's consider an example first and then delve into t