1. Trang chủ
  2. » Khoa Học Tự Nhiên

Advanced topics in computational number theory

599 10 0

Đang tải... (xem toàn văn)

Tài liệu hạn chế xem trước, để xem đầy đủ mời bạn chọn Tải xuống

THÔNG TIN TÀI LIỆU

Thông tin cơ bản

Tiêu đề Advanced Topics in Computational Number Theory
Tác giả Henri Cohen
Trường học Universite de Bordeaux 1
Chuyên ngành Mathematics
Thể loại book
Thành phố Talence
Định dạng
Số trang 599
Dung lượng 21,4 MB

Cấu trúc

  • 1. Fundamental Results and Algorithms in Dedekind Domains 1 (18)
    • 1.1 Introduction (18)
    • 1.2 Finitely Generated Modules Over Dedekind Domains 2 (19)
      • 1.2.1 Finitely Generated Torsion-Free and Projective Modules 6 (23)
      • 1.2.2 Torsion Modules 13 (30)
    • 1.3 Basic Algorithms in Dedekind Domains 17 (34)
      • 1.3.1 Extended Euclidean Algorithms in Dedekind Domains 17 (34)
      • 1.3.2 Deterministic Algorithms for the Approximation The- (37)
  • orem 20 (0)
    • 1.3.3 Probabilistic Algorithms 23 (40)
    • 1.4 The Hermite Normal Form Algorithm in Dedekind Domains. 25 (42)
      • 1.4.1 Pseudo-Objects (43)
      • 1.4.2 The Hermite Normal Form in Dedekind Domains (45)
      • 1.4.3 Reduction Modulo an Ideal (49)
    • 1.5 Applications of the HNF Algorithm (51)
      • 1.5.1 Modifications to the HNF Pseudo-Basis (51)
      • 1.5.2 Operations on Modules and Maps (52)
      • 1.5.3 Reduction Modulo p of a Pseudo-Basis (54)
    • 1.6 The Modular HNF Algorithm in Dedekind Domains 38 (55)
      • 1.6.1 Introduction (55)
      • 1.6.2 The Modular HNF Algorithm (55)
      • 1.6.3 Computing the Transformation Matrix (58)
    • 1.7 The Smith Normal Form Algorithm in Dedekind Domains (60)
    • 1.8 Exercises for Chapter 1 46 2. Basic Relative Number Field Algorithms (63)
    • 2.1 Compositum of Number Fields and Relative and Absolute (66)
  • Equations 49 (0)
    • 2.1.1 Introduction (66)
    • 2.1.2 Etale Algebras (67)
    • 2.1.3 Compositum of Two Number Fields................ 56 2.1.4 Computing fh and (J2 •••••••••.•••••.•••••.••••••• 59 (73)
    • 2.1.5 Relative and Absolute Defining Polynomials (79)
    • 2.1.6 Compositum with Normal Extensions (83)
    • 2.2 Arithmetic of Relative Extensions (89)
      • 2.2.1 Relative Signatures (89)
      • 2.2.2 Relative Norm, Trace, and Characteristic Polynomial. 76 (93)
      • 2.2.3 Integral Pseudo-Bases (93)
      • 2.2.4 Discriminants (95)
      • 2.2.5 Norms of Ideals in Relative Extensions (97)
    • 2.3 Representation and Operations on Ideals (100)
      • 2.3.1 Representation ofldeals (0)
      • 2.3.2 Representation of Prime Ideals (106)
      • 2.3.3 Computing Valuations (109)
      • 2.3.4 Operations on Ideals (111)
      • 2.3.5 Ideal Factorization and Ideal Lists (116)
    • 2.4 The Relative Round 2 Algorithm and Related Algorithms 102 (119)
      • 2.4.1 The Relative Round 2 Algorithm 102 (119)
      • 2.4.2 Relative Polynomial Reduction 110 (127)
      • 2.4.3 Prime Ideal Decomposition 111 (128)
    • 2.5 Relative and Absolute Representations 114 (131)
      • 2.5.1 Relative and Absolute Discriminants 114 (131)
      • 2.5.2 Relative and Absolute Bases 115 (132)
      • 2.5.3 Ups and Downs for Ideals 116 (133)
    • 2.6 Relative Quadratic Extensions and Quadratic Forms 118 (135)
      • 2.6.1 Integral Pseudo-Basis, Discriminant 118 (135)
      • 2.6.2 Representation of Ideals 121 (138)
      • 2.6.3 Representation of Prime Ideals 123 (140)
      • 2.6.4 Composition of Pseudo-Quadratic Forms 125 (142)
      • 2.6.5 Reduction of Pseudo-Quadratic Forms 127 (144)
    • 2.7 Exercises for Chapter 2 129 3. The Fundamental Theorems of Global Class Field Theory 133 (146)
    • 3.1 Prologue: Hilbert Class Fields 133 (150)
    • 3.2 Ray Class Groups 135 (152)
      • 3.2.1 Basic Definitions and Notation 135 (152)
    • 3.3 Congruence Subgroups: One Side of Class Field Theory 138 (155)
      • 3.3.1 Motivation for the Equivalence Relation (155)
      • 3.3.2 Study of the Equivalence Relation 139 (156)
      • 3.3.3 Characters of Congruence Subgroups 145 (162)
      • 3.3.4 Conditions on the Conductor and Examples 147 (164)
    • 3.4 Abelian Extensions: The Other Side of Class Field Theory. .. 150 .1 The Conductor of an Abelian Extension 150 (167)
      • 4.1.10 Enumeration of Subgroups (196)
      • 4.1.11 Application to the Solution of Linear Equations (199)
    • 4.2 Computing the Structure of (ZK/m)* 185 (0)
      • 4.2.1 Standard Reductions of the Problem 186 (0)
      • 4.2.2 The Use of p-adic Logarithms 190 (0)
      • 4.2.3 Computing (ZK/pk)* by Induction 198 (0)
      • 4.2.4 Representation of Elements of (ZK/m)* 204 (0)
      • 4.2.5 Computing (ZK/m)* 206 (0)
    • 4.3 Computing Ray Class Groups (0)
      • 4.3.1 The Basic Ray Class Group Algorithm 209 (0)
      • 4.3.2 Size Reduction of Elements and Ideals 211 (0)
    • 4.4 Computations in Class Field Theory 213 (0)
      • 4.4.1 Computations on Congruence Subgroups 213 (0)
      • 4.4.2 Computations on Abelian Extensions 214 (0)
      • 4.4.3 Conductors of Characters 218 (0)
    • 4.5 Exercises for Chapter 4 219 5. Computing Defining Polynomials Using Kummer Theory. 223 (0)
    • 5.1 General Strategy for Using Kummer Theory 223 (0)
      • 5.1.1 Reduction to Cyclic Extensions of Prime Power Degree 223 (0)
      • 5.1.2 The Four Methods 226 (0)
    • 5.2 Kummer Theory Using Heeke's Theorem When (l E K 227 (0)
      • 5.2.1 Characterization of Cyclic Extensions of Conductor m (0)
      • 5.2.2 Virtual Units and the i-Selmer Group 229 (0)
      • 5.2.3 Construction of Cyclic Extensions of Prime Degree (0)

Nội dung

Fundamental Results and Algorithms in Dedekind Domains 1

Introduction

The easiest way to start studying number fields is to consider them per se, as absolute extensions ofQ;this is, for example, what we have done in [CohO].

In practice, number fields are often presented as relative extensions, represented as an algebra L/K over a base field K that is not limited to Q Consequently, fundamental algebraic structures, including the ring of integers ZL and its ideals, function not only as Z-modules but also as ZK-modules This ZK-module structure is significantly more complex and must be carefully maintained.

Regardless of the methods used to compute ZL, representing the result poses a significant challenge A key issue arises because Z-modules, including ZL and its ideals, are free and can be represented by Z-bases, such as through the Hermite normal form (HNF) This concept is further explored in [CohO, Chapter 2], and the theory can be easily generalized by making appropriate substitutions.

In the context of explicitly computable Euclidean domains, Z can be associated with a principal ideal domain (PID) under specific conditions However, ZK is generally not classified as a PID, which means that ZL does not necessarily function as a free module over ZK A straightforward example illustrating this concept is when K is defined as Q(√-10) and L is a subset of K.

Recent research by various authors, including Bos-Poh and Cohl, reveals that the challenges associated with Z-modules can be effectively addressed Most linear algebra algorithms applicable to Z-modules, as outlined in Chapter 2 of [CohO], can be seamlessly generalized to ZK-modules This chapter serves as an expanded exploration of these findings, building on the work presented in [Cohl].

This chapter focuses on finitely generated modules over Dedekind domains, providing a comprehensive overview of the key results related to these modules For additional insights, readers are encouraged to consult the works of Frobenius-Taylor or Boul.

Many theoretical results can often be demonstrated through alternative algorithmic methods Upon completing this chapter, especially the sections on the Hermite and Smith normal form algorithms in Dedekind domains, readers are encouraged to apply these algorithms to prove the results in the following section.

Finitely Generated Modules Over Dedekind Domains 2

I would like to thank J Martinet for his help in writing this section For the sake of completeness, we first recall the following definitions.

Definition 1.2.1 Let R be a domain, in other words a nonzero, commuta- tive ring with unit, and no zero divisors.

(1) We say that R is Noetherian if every ascending chain of ideals of R is finite or, equivalently, if every ideal of R is finitely generated.

(2) We say that R is integrally closed if any x belonging to the ring of frac- tions of R which is a root of amonic polynomial in R[X] belongs in fact to R.

(3) We say that R is aDedekind domain if it is Noetherian, integrally closed, and if every nonzero prime ideal of R is a maximal ideal.

Definition 1.2.2 Let R be an integral domain and K its field of fractions.

A fractional ideal is defined as a finitely generated, nonzero sub-R-module of K, or alternatively, as an R-module represented as L[d for a nonzero ideal I of R and a nonzero element d in R When d is set to 1, the fractional ideal corresponds to an ordinary ideal, which is referred to as an integral ideal.

Unless explicitly mentioned otherwise, we will always assume that ideals and fractional ideals are nonzero.

We recall the following basic facts about Dedekind domains, which explain their importance.

Proposition 1.2.3 Let R be a Dedekind domain and K its field of fractions.

(1) Every fractional ideal of R is invertible and is equal in a unique way to a product of powers of prime ideals.

(2) Every fractional ideal is generated by at most two elements, and the first one can be an arbitrarily chosen nonzero element of the ideal.

(3) (Weak Approximation Theorem) Let S be a finite set of prime ideals of

R, let (ep)pEs be a set of integers, and let (Xp)pES be a set of elements of K both indexed by 5 There exists an element x E K such that for all p E 5, vp(x - xl') = ep, while for all p ¢ 5, vp(x) ~ 0, where vp(x) denotes the p-adic valuation.

(4) If K is a number field, the ring of integersZ K of K is a Dedekind domain.

In the context of number fields, we recall the following definitions and results.

Definition 1.2.4 Let I I be a map from K to the set of nonnegative real numbers.

1.2 Finitely Generated Modules Over Dedekind Domains 3

(1) We say that I I is afield norm on K if[z]= 0 ~ x = 0, Ix+yl ::; Ixl+IYI, and Ixyl= Ixllyl for allx and y inK.

(2) We say that the norm isnon-Archimedeanif we have the stronger condi- tion Ix+yl ::; max(lxl , Iyl)for allx and y in K; otherwise, we say that the norm isArchimedean.

(3) We say that the norm istrivial ifIxl= 1 for all x =I O.

(4) We say that two norms areequivalent if they define the same topology onK.

Theorem 1.2.5 (Ostrowsky) Let K be a number field and let a, be the n = Tl + 2T2 embeddings of K into C ordered in the usual way.

(1) Let p be a prime ideal of K Set

Ixlp=N(p)-vp(:t j if x =I 0, and [O], = 0 otherwise Then Ixlp is a non-Archimedean field norm.

(2) Any nontrivial, non-Archimedean field norm is equivalent to Ixlp for a unique prime idealp.

(3) If(1 is an embedding of K into C and if we set

Ixl"= 1(1(x)1 , where I Iis the usual absolute value onC, then Ixl" is an Archimedean field norm.

(4) Any Archimedean field norm is equivalent to Ixl" for a unique a, with

1 ::;i ::;Tl + T2ã (Note that Ixl"o+r2 is equivalent to Ixl", for Tl < i ::;

Definition 1.2.6 A place of a number field K is an equivalence class of nontrivial field norms Thus, thanks to the above theorem, the places of K can be identified with the prime ideals of K together with the embeddingsa, for 1 ::;i ::;Tl + T2 •

Finally, we note the importantproduct formula (see Exercise1).

Proposition 1.2.7 Let ni = 1 for 1 ::;i ::;Tl' ni = 2 if Tl

Ngày đăng: 24/05/2022, 14:14