1 Absolute Values and Valuations

Total Page:16

File Type:pdf, Size:1020Kb

1 Absolute Values and Valuations Algebra in positive Characteristic Fr¨uhjahrssemester 08 Lecturer: Prof. R. Pink Organizer: P. Hubschmid Absolute values, valuations and completion F. Crivelli ([email protected]) April 21, 2008 Introduction During this talk I’ll introduce the basic definitions and some results about valuations, absolute values of fields and completions. These notions will give two basic examples: the rational function field Fq(T ) and the field Qp of the p-adic numbers. 1 Absolute values and valuations All along this section, K denote a field. 1.1 Absolute values We begin with a well-known Definition 1. An absolute value of K is a function | | : K → R satisfying these properties, ∀ x, y ∈ K: 1. |x| = 0 ⇔ x = 0, 2. |x| ≥ 0, 3. |xy| = |x| |y|, 4. |x + y| ≤ |x| + |y|. (Triangle inequality) Note that if we set |x| = 1 for all 0 6= x ∈ K and |0| = 0, we have an absolute value on K, called the trivial absolute value. From now on, when we speak about an absolute value | |, we assume that | | is non-trivial. Moreover, if we define d : K × K → R by d(x, y) = |x − y|, x, y ∈ K, d is a metric on K and we have a topological structure on K. We have also some basic properties that we can deduce directly from the definition of an absolute value. 1 Lemma 1. Let | | be an absolute value on K. We have 1. |1| = 1, 2. |ζ| = 1, for all ζ ∈ K with ζd = 1 for some 0 6= d ∈ N (ζ is a root of unity), 3. |x−1| = |x|−1, 4. ||x| − |y|| ≤ |x − y|. Proof: 1. |1|2 = |12| = |1| ⇒ |1| = 1. d 2. |ζ| = ζd = |1| = 1 ⇒ |ζ| = 1. 3. 1 = |xx−1| = |x| |x−1| ⇒ |x−1| = |x|−1, 4. Set a := x − y, b := y. We have |a + b| ≤ |a| + |b|, therefore |x| − |y| = |a + b| − |b| ≤ |a| = |x − y|. Another definition about absolute values. Definition 2. Two absolute values on K are equivalent if they define the same topology on K. The next theorem and its corollary give us other conditions to verify if two absolute values are equivalent. Theorem 1. Let | |1 and | |2 be two absolute values on K. They are equivalent if, and only if, there exists s ≥ 0 real such that s |x|1 = |x|2 , ∀x ∈ K. s Proof: If we have |x|1 = |x|2, s > 0, clearly the two absolute values are equivalent since they define the same open sets. If | |1 and | |2 are equivalent, a series converging to 0 with respect to | |1 will converge to 0 with respect to | |2. Moreover, for all K field and | | on K, the n inequality |x| < 1 is equivalent to saying that the sequence {x }n∈N converges to 0. Therefore if | |1 and | |2 are equivalent, we have |x|1 < 1 ⇔ |x|2 < 1. 2 Let y ∈ K be an element such that |y| > 1 and let x ∈ K, x 6= 0. Then there exists n o1 α ∈ such that |x| = |y|α. Let mi be a sequence of rational numbers R 1 1 ni i∈N mi ∗ α ni (mi ∈ Z, ni ∈ N ) converging to α from above. Then |x|1 = |y|1 < |y|1 and hence xni xni < 1 ⇒ < 1. mi mi y 1 y 2 mi n o ni α mi This gives |x|2 < |y|2 and consequently |x|2 ≤ |y|2 . Taking a sequence n i i∈ α α N converging to α from below will give |x|2 ≥ |y|2 and therefore |x|2 = |y|2 . So, for all 0 6= x ∈ K, we have log |x| log |y| 1 = 1 =: s log |x|2 log |y|2 s and hence |x|1 = |x|2. Finally, |y|1 > 1 implies |y|2 > 1 and so s > 0. Corollary. Two absolute values | |1 and | |2 on K are equivalent if, and only if, |x|1 < 1 ⇐⇒ |x|2 < 1. We continue with this important Definition 3. An absolute value is called non-Archimedean if we have |x + y| ≤ max{|x| , |y|}, ∀x, y ∈ K. Otherwise the absolute value is called Archimedean. Note that if | | is non-Archimedean, for x, y ∈ K we have |x|= 6 |y| =⇒ |x + y| = max{|x| , |y|}. Indeed: w.l.o.g we can assume |x| > |y|, then obviously |x + y| ≤ max{|x| , |y|} = |x|. On the other side, |x| = |x − y + y| ≤ max{|x + y| , |y|}. Assume that max{|x + y| , |y|} = |y|, then |x| ≤ |y| < |x|. This contradicts the hypothesis |x| > |y|, hence max{|x + y| , |y|} = |x + y| and so |x| ≤ |x + y|. 1.2 Valuations We introduce the symbol ∞ with the convention that for all a ∈ R we have a < ∞, a + ∞ = ∞ and ∞ + ∞ = ∞. As for absolute values, we start with a basic Definition 4. A valuation on K is a function v : K → R ∪ {∞} satisfying these properties, for all x, y ∈ K: 3 1. v(x) = ∞ ⇔ x = 0, 2. v(xy) = v(x) + v(y), 3. v(x + y) ≥ min{v(x), v(y)}. Note that if we set v(x) = 0 for all 0 6= x ∈ K and v(0) = ∞, we have a valuation on K, called the trivial valuation. From now on, when we speak about a valuation v, we assume that v is non-trivial. Now, a lemma with some basic properties induced by the definition of valuation Lemma 2. Let v be a valuation on K. We have 1. v(1) = 0, 2. v(ζ) = 0, for all ζ ∈ K root of unity, 3. v(x−1) = −v(x), ∀ x ∈ K∗, 4. if x, y ∈ K and v(x) 6= v(y), v(x + y) = min{v(x), v(y)}. Proof: 1. v(1) = v(12) = v(1) + v(1) ⇒ v(1) = 0. 2. Let ζ ∈ K with ζd = 1 for some 0 6= d ∈ N. We have dv(ζ) = v(ζd) = v(1) = 0, therefore v(ζ) = 0. 3. 0 = v(1) = v(xx−1) = v(x) + v(x−1) ⇒ v(x−1) = −v(x). 4. W.l.o.g. we can assume that v(x) > v(y) and so y 6= 0. If x = 0, obvious. Assume x 6= 0. Then v(x + y) ≥ min{v(x), v(y)} = v(y). We have also v(y) = v(y + x − x) ≥ min{v(x + y), v(x)}. Assume that min{v(x + y), v(x)} = v(x), then v(x) > v(y) ≥ v(x) and we get a contradiction. So, min{v(x + y), v(x)} = v(x + y) and finally v(y) ≥ v(x + y). Some further terminology regarding valuations. Definition 5. A valuation v on K is called discrete if v(K∗) = sZ, for a real s > 0. Moreover, v is normalized if s = 1. We introduce now the equivalence between valuations. Definition 6. Two valuations v1 and v2 on K are equivalent if there exists a real s > 0 such that v1 = sv2. Note that if we have a discrete valuation on K with v(K∗) = sZ, dividing it by s we obtain an equivalent normalized valuation. 4 1.3 Relations between non-Archimedean absolute values and valuations The following theorem provides a relation between the non-Archimedean absolute values and the valuations on K. Theorem 2. Let | | be a non-Archimedean absolute value on K and s ∈ R, s > 0, then the function vs : K −→ R ∪ {∞} −s log |x| if x 6= 0 x 7→ ∞ if x = 0 0 0 0 is a valuation on K. Furthermore, if s, s ∈ R, s, s > 0 and s 6= s , vs is equivalent to vs0 . Conversely, if v is a valuation on K and q ∈ R, q > 1, the function | |q : K −→ R q−v(x) if x 6= 0 x 7→ 0 if x = 0 0 0 0 is an absolute value on K. Besides, if q, q ∈ R, q, q > 1 and q 6= q , | |q is equivalent to | |q0 . Proof: We just need the check the definitions of an absolute value and a valuation. We start with vs. Clearly we have that vs(x) = ∞ if, and only if, x = 0. Let x, y ∈ K, if x = 0 or y = 0, xy = 0 and ∞ = vs(xy) = v(x) + v(y) = ∞. Assume x, y 6= 0, then vs(xy) = −s log |xy| = −s log (|x| |y|) = −s log |x| − s log |y| = vs(x) + vs(y). Let again be x, y ∈ K. If x = y = 0, then ∞ = vs(x + y) = min {vs(x), vs(y)} = ∞. If x = 0, y 6= 0 (or y = 0, x 6= 0), vs(x + y) = vs(y) = min {vs(x), vs(y)} (or vs(x + y) = vs(x) = min {vs(x), vs(y)}). Assume now x, y 6= 0. We have vs(x + y) = −s log |x + y| ≥ −s log (max {|x| , |y|}) = min {−s log |x| , −s log |y|} = min {vs(x), vs(y)} . 0 0 Therefore vs is a valuation on K. Assume now s, s > 0, s 6= s . For all 0 6= x ∈ K, we have s 0 s v (x) = −s log |x| = (−s log |x|) = v 0 (x). s s0 s0 s This means that vs and vs0 are equivalent. We continue with | |q. Clearly we have that |x| = 0 if, and only if, x = 0 and since q > 1 > 0 that |x|q ≥ 0 for all x ∈ K. Let x, y ∈ K, if x = 0 or y = 0, xy = 0 and 0 = |xy|q = |x|q |y|q = 0. Assume x, y 6= 0, then −v(xy) −v(x)−v(y) −v(x) −v(y) |xy|q = q = q = q q = |x|q |y|q .
Recommended publications
  • Field Theory Pete L. Clark
    Field Theory Pete L. Clark Thanks to Asvin Gothandaraman and David Krumm for pointing out errors in these notes. Contents About These Notes 7 Some Conventions 9 Chapter 1. Introduction to Fields 11 Chapter 2. Some Examples of Fields 13 1. Examples From Undergraduate Mathematics 13 2. Fields of Fractions 14 3. Fields of Functions 17 4. Completion 18 Chapter 3. Field Extensions 23 1. Introduction 23 2. Some Impossible Constructions 26 3. Subfields of Algebraic Numbers 27 4. Distinguished Classes 29 Chapter 4. Normal Extensions 31 1. Algebraically closed fields 31 2. Existence of algebraic closures 32 3. The Magic Mapping Theorem 35 4. Conjugates 36 5. Splitting Fields 37 6. Normal Extensions 37 7. The Extension Theorem 40 8. Isaacs' Theorem 40 Chapter 5. Separable Algebraic Extensions 41 1. Separable Polynomials 41 2. Separable Algebraic Field Extensions 44 3. Purely Inseparable Extensions 46 4. Structural Results on Algebraic Extensions 47 Chapter 6. Norms, Traces and Discriminants 51 1. Dedekind's Lemma on Linear Independence of Characters 51 2. The Characteristic Polynomial, the Trace and the Norm 51 3. The Trace Form and the Discriminant 54 Chapter 7. The Primitive Element Theorem 57 1. The Alon-Tarsi Lemma 57 2. The Primitive Element Theorem and its Corollary 57 3 4 CONTENTS Chapter 8. Galois Extensions 61 1. Introduction 61 2. Finite Galois Extensions 63 3. An Abstract Galois Correspondence 65 4. The Finite Galois Correspondence 68 5. The Normal Basis Theorem 70 6. Hilbert's Theorem 90 72 7. Infinite Algebraic Galois Theory 74 8. A Characterization of Normal Extensions 75 Chapter 9.
    [Show full text]
  • OSTROWSKI for NUMBER FIELDS 1. Introduction in 1916, Ostrowski [6] Classified the Nontrivial Absolute Values on Q: up to Equival
    OSTROWSKI FOR NUMBER FIELDS KEITH CONRAD 1. Introduction In 1916, Ostrowski [6] classified the nontrivial absolute values on Q: up to equivalence, they are the usual (archimedean) absolute value and the p-adic absolute values for different primes p, with none of these being equivalent to each other. We will see how this theorem extends to a number field K, giving a list of all the nontrivial absolute values on K up to equivalence: for each nonzero prime ideal p in OK there is a p-adic absolute value, real embeddings of K and complex embeddings of K up to conjugation lead to archimedean absolute values on K, and every nontrivial absolute value on K is equivalent to a p-adic, real, or complex absolute value. 2. Defining nontrivial absolute values on K For each nonzero prime ideal p in OK , a p-adic absolute value on K is defined in terms × of a p-adic valuation ordp that is first defined on OK − f0g and extended to K by taking ratios. m Definition 2.1. For x 2 OK − f0g, define ordp(x) := m where xOK = p a with m ≥ 0 and p - a. We have ordp(xy) = ordp(x)+ordp(y) for nonzero x and y in OK by unique factorization of × ideals in OK . This lets us extend ordp to K by using ratios of nonzero numbers in OK : for × α 2 K , write α = x=y for nonzero x and y in OK and set ordp(α) := ordp(x) − ordp(y). To 0 0 0 0 0 0 see this is well-defined, if x=y = x =y for nonzero x; y; x , and y in OK then xy = x y 0 0 in OK , which implies ordp(x) + ordp(y ) = ordp(x ) + ordp(y), so ordp(x) − ordp(y) = 0 0 × × ordp(x ) − ordp(y ).
    [Show full text]
  • Complex Number
    Nature and Science, 4(2), 2006, Wikipedia, Complex number Complex Number From Wikipedia, the free encyclopedia, http://en.wikipedia.org/wiki/Complex_number Editor: Ma Hongbao Department of Medicine, Michigan State University, East Lansing, Michigan, USA. [email protected] Abstract: For the recent issues of Nature and Science, there are several articles that discussed the numbers. To offer the references to readers on this discussion, we got the information from the free encyclopedia Wikipedia and introduce it here. Briefly, complex numbers are added, subtracted, and multiplied by formally applying the associative, commutative and distributive laws of algebra. The set of complex numbers forms a field which, in contrast to the real numbers, is algebraically closed. In mathematics, the adjective "complex" means that the field of complex numbers is the underlying number field considered, for example complex analysis, complex matrix, complex polynomial and complex Lie algebra. The formally correct definition using pairs of real numbers was given in the 19th century. A complex number can be viewed as a point or a position vector on a two-dimensional Cartesian coordinate system called the complex plane or Argand diagram. The complex number is expressed in this article. [Nature and Science. 2006;4(2):71-78]. Keywords: add; complex number; multiply; subtract Editor: For the recnet issues of Nature and Science, field considered, for example complex analysis, there are several articles that discussed the numbers. To complex matrix, complex polynomial and complex Lie offer the references to readers on this discussion, we got algebra. the information from the free encyclopedia Wikipedia and introduce it here (Wikimedia Foundation, Inc.
    [Show full text]
  • 4.3 Absolute Value Equations 373
    Section 4.3 Absolute Value Equations 373 4.3 Absolute Value Equations In the previous section, we defined −x, if x < 0. |x| = (1) x, if x ≥ 0, and we saw that the graph of the absolute value function defined by f(x) = |x| has the “V-shape” shown in Figure 1. y 10 x 10 Figure 1. The graph of the absolute value function f(x) = |x|. It is important to note that the equation of the left-hand branch of the “V” is y = −x. Typical points on this branch are (−1, 1), (−2, 2), (−3, 3), etc. It is equally important to note that the right-hand branch of the “V” has equation y = x. Typical points on this branch are (1, 1), (2, 2), (3, 3), etc. Solving |x| = a We will now discuss the solutions of the equation |x| = a. There are three distinct cases to discuss, each of which depends upon the value and sign of the number a. • Case I: a < 0 If a < 0, then the graph of y = a is a horizontal line that lies strictly below the x-axis, as shown in Figure 2(a). In this case, the equation |x| = a has no solutions because the graphs of y = a and y = |x| do not intersect. 1 Copyrighted material. See: http://msenux.redwoods.edu/IntAlgText/ Version: Fall 2007 374 Chapter 4 Absolute Value Functions • Case II: a = 0 If a = 0, then the graph of y = 0 is a horizontal line that coincides with the x-axis, as shown in Figure 2(b).
    [Show full text]
  • Absolute Values and Discrete Valuations
    18.785 Number theory I Fall 2015 Lecture #1 09/10/2015 1 Absolute values and discrete valuations 1.1 Introduction At its core, number theory is the study of the ring Z and its fraction field Q. Many questions about Z and Q naturally lead one to consider finite extensions K=Q, known as number fields, and their rings of integers OK , which are finitely generated extensions of Z (the integral closure of Z in K, as we shall see). There is an analogous relationship between the ring Fq[t] of polynomials over a finite field Fq, its fraction field Fq(t), and the finite extensions of Fq(t), which are known as (global) function fields; these fields play an important role in arithmetic geometry, as they are are categorically equivalent to nice (smooth, projective, geometrically integral) curves over finite fields. Number fields and function fields are collectively known as global fields. Associated to each global field k is an infinite collection of local fields corresponding to the completions of k with respect to its absolute values; for the field of rational numbers Q, these are the field of real numbers R and the p-adic fields Qp (as you will prove on Problem Set 1). The ring Z is a principal ideal domain (PID), as is Fq[t]. These rings have dimension one, which means that every nonzero prime ideal is maximal; thus each nonzero prime ideal has an associated residue field, and for both Z and Fq[t] these residue fields are finite. In the case of Z we have residue fields Z=pZ ' Fp for each prime p, and for Fq[t] we have residue fields Fqd associated to each irreducible polynomial of degree d.
    [Show full text]
  • Lectures on Complete Discrete Valuation Fields
    Lectures on Complete Discrete Valuation Fields 1: Discrete Valuation Fields (1.1). Valuations. One can generalize the properties of the -adic valuation ¡£¢ and proceed to the concept of valuation. Let Γ be an additively written totally ordered abelian group. Add Γ ¥§¦ ¤ ¤¨¦ ¤ ¥ ¤ ¤ to a formal element + ¤ with the properties + , + + , + (+ ) = + , Γ Γ Γ ¤ ¤ ¥ © ¤ (+ ¤ ) + (+ ) = + , for each ; denote = + . Γ A map ¡ : with the properties ¤ ¡ ( ) = + = 0 ¡ ¡ ¡ ( ) = ( ) + ( ) ¡ ¡ ¡ ( + ) min( ( ) ( )) ¡ is said to be a valuation on ; in this case is said to be a valuation field. The map induces Γ Γ ¡ a homomorphism of to and its value group ( ) is a totally ordered subgroup of . ¡ ¡ If ¡ ( ) = 0 , then is called the trivial valuation. It is easy to show that ( 1) = 0, and if !¡ ¡ ( ) ( ), then ¡ "¡ # ¡ "¡ ¡ ¡ ( ) min( ( + ) ( )) min( ( ) ( )) = ( ); $ ¡ ¡ ¡ ¡ thus, if ¡ ( ) = ( ) then ( + ) = min( ( ) ( )). %'& £(©) ¡ * £(©+ ¡ , * & (1.2). Basic Objects. Let = : ( ) 0 , & = : ( ) 0 . Then %'& coincides with the set of non-invertible elements of %-& . Therefore, is a local ring with the * % ¡ & unique maximal ideal & ; is called the ring of integers (with respect to ), and the field .& %-&0/1* 2©)%'& = & is called the residue field, or residue class field. The image of an element .& in .& is denoted by , it is called the residue of in . The set of invertible elements of %'& 34& %-&56* is a multiplicative group = & , it is called the group of units. 798;:-:-<= $ , & Assume that char( ) = char( & ). Then char( ) = 0 and char( ) = 0. $ .& Proof. Suppose that char( ) = = 0. Then = 0 in and therefore in . Hence = char( .& ). <A:'BDCE8;FHGAIKJ0<LC£MN<PORQSGATAFU<LTNVWJ0<LC£MN<PORQSGAT+I1QS8;C£VLFE= (1.3). >@? ¡ 1. A valuation ¡ on is said to be discrete if the totally ordered group ( ) is isomorphic to the naturally ordered group X .
    [Show full text]
  • An Introduction to the P-Adic Numbers Charles I
    Union College Union | Digital Works Honors Theses Student Work 6-2011 An Introduction to the p-adic Numbers Charles I. Harrington Union College - Schenectady, NY Follow this and additional works at: https://digitalworks.union.edu/theses Part of the Logic and Foundations of Mathematics Commons Recommended Citation Harrington, Charles I., "An Introduction to the p-adic Numbers" (2011). Honors Theses. 992. https://digitalworks.union.edu/theses/992 This Open Access is brought to you for free and open access by the Student Work at Union | Digital Works. It has been accepted for inclusion in Honors Theses by an authorized administrator of Union | Digital Works. For more information, please contact [email protected]. AN INTRODUCTION TO THE p-adic NUMBERS By Charles Irving Harrington ********* Submitted in partial fulllment of the requirements for Honors in the Department of Mathematics UNION COLLEGE June, 2011 i Abstract HARRINGTON, CHARLES An Introduction to the p-adic Numbers. Department of Mathematics, June 2011. ADVISOR: DR. KARL ZIMMERMANN One way to construct the real numbers involves creating equivalence classes of Cauchy sequences of rational numbers with respect to the usual absolute value. But, with a dierent absolute value we construct a completely dierent set of numbers called the p-adic numbers, and denoted Qp. First, we take p an intuitive approach to discussing Qp by building the p-adic version of 7. Then, we take a more rigorous approach and introduce this unusual p-adic absolute value, j jp, on the rationals to the lay the foundations for rigor in Qp. Before starting the construction of Qp, we arrive at the surprising result that all triangles are isosceles under j jp.
    [Show full text]
  • MAT 240 - Algebra I Fields Definition
    MAT 240 - Algebra I Fields Definition. A field is a set F , containing at least two elements, on which two operations + and · (called addition and multiplication, respectively) are defined so that for each pair of elements x, y in F there are unique elements x + y and x · y (often written xy) in F for which the following conditions hold for all elements x, y, z in F : (i) x + y = y + x (commutativity of addition) (ii) (x + y) + z = x + (y + z) (associativity of addition) (iii) There is an element 0 ∈ F , called zero, such that x+0 = x. (existence of an additive identity) (iv) For each x, there is an element −x ∈ F such that x+(−x) = 0. (existence of additive inverses) (v) xy = yx (commutativity of multiplication) (vi) (x · y) · z = x · (y · z) (associativity of multiplication) (vii) (x + y) · z = x · z + y · z and x · (y + z) = x · y + x · z (distributivity) (viii) There is an element 1 ∈ F , such that 1 6= 0 and x·1 = x. (existence of a multiplicative identity) (ix) If x 6= 0, then there is an element x−1 ∈ F such that x · x−1 = 1. (existence of multiplicative inverses) Remark: The axioms (F1)–(F-5) listed in the appendix to Friedberg, Insel and Spence are the same as those above, but are listed in a different way. Axiom (F1) is (i) and (v), (F2) is (ii) and (vi), (F3) is (iii) and (vii), (F4) is (iv) and (ix), and (F5) is (vii). Proposition. Let F be a field.
    [Show full text]
  • The Algebraic Closure of a $ P $-Adic Number Field Is a Complete
    Mathematica Slovaca José E. Marcos The algebraic closure of a p-adic number field is a complete topological field Mathematica Slovaca, Vol. 56 (2006), No. 3, 317--331 Persistent URL: http://dml.cz/dmlcz/136929 Terms of use: © Mathematical Institute of the Slovak Academy of Sciences, 2006 Institute of Mathematics of the Academy of Sciences of the Czech Republic provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use. This paper has been digitized, optimized for electronic delivery and stamped with digital signature within the project DML-CZ: The Czech Digital Mathematics Library http://project.dml.cz Mathematíca Slovaca ©20106 .. -. c/. ,~r\r\c\ M -> ->•,-- 001 Mathematical Institute Math. SlOVaCa, 56 (2006), NO. 3, 317-331 Slovák Academy of Sciences THE ALGEBRAIC CLOSURE OF A p-ADIC NUMBER FIELD IS A COMPLETE TOPOLOGICAL FIELD JosÉ E. MARCOS (Communicated by Stanislav Jakubec) ABSTRACT. The algebraic closure of a p-adic field is not a complete field with the p-adic topology. We define another field topology on this algebraic closure so that it is a complete field. This new topology is finer than the p-adic topology and is not provided by any absolute value. Our topological field is a complete, not locally bounded and not first countable field extension of the p-adic number field, which answers a question of Mutylin. 1. Introduction A topological ring (R,T) is a ring R provided with a topology T such that the algebraic operations (x,y) i-> x ± y and (x,y) \-> xy are continuous.
    [Show full text]
  • Motivation for the Theory of Perfectoid Spaces
    Motivation for the theory of Perfectoid Spaces Bruno Chiarellotto August 27, 2015 Contents 1 Introduction 1 2 The first case 6 3 The Construction 8 4 From ch.0 to ch.p 11 5 Galois Correspondance 14 6 The non perfect fields 16 7 How to justify the iso of Galois extensions 18 8 Other motivations 20 1 Introduction Perfectoid spaces are a in one sense a tool. It is just a relatively new method to translate problems from ch. 0 to ch.p, where one may expect to get a solution... Before starting to deal with the very definition of such a spaces we would like to give some motivation on the study. The motivations are mainly connected with Galois representations. We will give in this paragraph a primary motivations, at the end we will open the landscape. This in order to answer to the following question: why to study Galois representations? First of all we would like to say what we mean about Galois representations. Some notation. We indicate as usual Q the field of rational numbers, by Q the algebraic closure and by GQ = Gal(Q=Q) the Absolute Galois Group. It is naturally a topological group. A basis of open neighborhood of the identity automorphism is 1 given by the subgroups of finite index i.e. Gal(Q=K), where K is a finite extension of Q in Q. In fact it is a profinite group (at level of topology); it is given by lim Gal(K= ) Q where the limit is taken all over the normal finite extensions K as before (seen as discrete sets).
    [Show full text]
  • Physics from Archimedes to Rutherford
    1 1 Physics from Archimedes to Rutherford 1.1 Mathematics and Physics in Antiquity In the 3rd millennium BC, the descendants of the Sumerians in Mesopotamia already used a sexagesimal (base 60) place-value numeral system of symbols to represent numbers, in which the position of a symbol determines its value. They also knew how to solve rhetorical algebraic equations (written in words, rather than symbols). By the 2nd millenium BC, Mesopotamians had com- piled tables of numbers representing the length of the sides of a right triangle.1 Their astronomers catalogued the motion of the stars and planets, as well as the occurrence of lunar eclipses. The day was divided into 24 hours, each hour into 60 minutes, each minute into 60 seconds. A decisive step in the development of mathematics was made by the Egyp- tians, who introduced special signs (hieratic numerals) for the numbers 1 to 9 and multiples of powers of 10. They devised methods of multiplication and division which only involved addition. However, their decimal number sys- tem did not include a zero symbol, nor did it use the principle of place value. The roots of modern science grew in the city-states of Ancient Greece scat- tered across the Eastern Mediterranean. The Greeks established physics as a science, greatly advanced astronomy, and made seminal contributions to mathematics, including the idea of formal mathematical proof, the basic rules of geometry, discoveries in number theory, and the rudiments of symbolic al- gebra and calculus. A remarkable testament to their ingenuity is the Antikythera mechanism, the oldest known complex scientific calculator, which was discovered in a wreck off the Greek island of Antikythera and is dated to about 100 BC (see Fig.
    [Show full text]
  • What Are P-Adic Numbers?
    Asia Pacific Mathematics Newsletter 1 WhatWhat are arep-Adic p-Adic Numbers? Numbers? What are What areThey They Used Used for? for? U A Rozikov U A Rozikov Abstract. In this short paper we give a popular intro- rational numbers, such that 2 < 1. This is done | |∗ duction to the theory of p-adic numbers. We give some as follows. Let Q be the field of rational numbers. properties of p-adic numbers distinguishing them to Every rational number x 0 can be represented “good” and “bad”. Some remarks about applications in the form x = pr n , where r, n Z, m is a positive of p-adic numbers to mathematics, biology and physics m ∈ are given. integer, ( p, n) = 1, ( p, m) = 1 and p is a fixed prime number. The p-adic absolute value (norm) of x is 1. p-Adic Numbers given by r p− , for x 0, p-adic numbers were introduced in 1904 by the x = | |p = German mathematician K Hensel. They are used 0, for x 0. intensively in number theory. p-adic analysis was The p-adic norm satisfies the so called strong developed (mainly for needs of number theory) triangle inequality in many directions, see, for example, [20, 50]. x + y max x , y , (2) When we write a number in decimal, we can | |p ≤ {| |p | |p} only have finitely many digits on the left of the and this is a non-Archimedean norm. decimal, but we can have infinitely many on the This definition of x has the effect that high | |p right of the decimal.
    [Show full text]