DOCSLIB.ORG

Quadratic and Hilbert Reciprocity

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Quadratic and Hilbert Reciprocity Quadratic and Hilbert Reciprocity Timothy Curry B.S., Mathematics B.S., Biological Sciences An Undergraduate Honors Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Bachelor of Science at the University of Connecticut May 2014 i Copyright by Timothy Curry May 2014 ii APPROVAL PAGE Bachelor of Science Honors Thesis Quadratic and Hilbert Reciprocity Presented by Timothy Curry, B.S. Math, B.S., Biology Honors Major Advisor William Abikoff Honors Thesis Advisor Keith Conrad Honors Thesis Advisor Alvaro´ Lozano-Robledo University of Connecticut May 2014 iii ACKNOWLEDGMENTS My most sincere appreciation and gratitude goes to both Keith Conrad and Alvaro´ Lozano-Robledo. Without their constant guidance and patience, this thesis would never have been completed. iv Quadratic and Hilbert Reciprocity Timothy Curry, B.S. University of Connecticut, May 2014 v Contents Ch. 1. Introduction 1 Ch. 2. The p-adic numbers 2 2.1 Useful Definitions and Properties . 2 Ch. 3. The Hilbert Symbol 6 3.1 Definition and Basic Properties . 6 3.2 Square Classes . 9 3.3 Bimultiplicativity of the Hilbert Symbol . 11 3.4 Formula for the Hilbert Symbol . 17 3.5 Hilbert Reciprocity Law on Q ...................... 24 Ch. 4. The Hilbert Symbol on Q(i)π 28 4.1 Primes in Z[i] and completions of Q(i) . 28 4.2 Hilbert Symbol on Q(i)π ......................... 32 4.3 Square Classes . 33 4.4 Bimultiplicativity of the Hilbert Symbol over Q(i)v . 39 4.5 Q(i)τ = Q2(i)............................... 47 4.6 Hilbert Reciprocity on Q(i) ....................... 52 Bibliography 63 vi Chapter 1 Introduction The law of quadratic reciprocity provides conditions that tell whether an integer is a quadratic residue modulo primes. However, it does not treat 2 in the same manner as other primes. There is a supplementary law for 2 which details the conditions needed for it to be a quadratic residue. In this thesis, we will recall a completion of the rational numbers Q, called the p- adic numbers Qp. After exploring Qp, we will consider the Hilbert symbol, a particular × × pairing on Qp ×Qp . The Hilbert symbol satisfies the Hilbert reciprocity law, which we will show is equivalent to the law of quadratic reciprocity. However, unlike quadratic reciprocity, the Hilbert reciprocity law puts all primes on an equal footing, including 2. For a Gaussian integer prime π, we will also discuss the π-adic completion of Q(i), × denoted Q(i)π. Then we will examine the Hilbert symbol on Q(i)π and show that the Hilbert reciprocity law on Q(i) is equivalent to quadratic reciprocity in the Gaussian integers. 1 Chapter 2 The p-adic numbers 2.1 Useful Definitions and Properties In this thesis, we will assume prior knowledge of the p-adic numbers Qp. However, in this section we will recall several important definitions and properties regarding Qp that will be used frequently in this thesis. Definition 2.1.1. Let p 2 Z be prime. Define the p-adic valuation on Z to be the function vp : Z − f0g −! R such that for each n 2 Z − f0g, vp(n) is the unique vp(n) 0 0 positive integer satisfying n = p n where p - n . Furthermore, we extend vp so a × that for x = b 2 Q with a; b 2 Z − f0g, we have vp(x) = vp(a) − vp(b). Lastly, we set vp(0) = 1. 2 3 Definition 2.1.2. Let x 2 Q. We define the p-adic absolute value of x by 8 > 1 ; if x 6= 0; < pvp(x) jxjp := > :>0; if x = 0: The field Qp is defined as the completion of Q with respect to the p-adic absolute value, and we have the following theorem about the form of each element in Qp. × Theorem 2.1.3. Let x 2 Qp . Then x can be written uniquely in the form −n0 2 n X n x = b−n0 p + ··· + b0 + b1p + b2p + ··· + bnp + ··· = bnp n≥−n0 with 0 ≤ bn ≤ p − 1 and −n0 = vp(x). Proof. For a proof, see [3, p. 68, Corollary 3.3.11]. Definition 2.1.4. The ring of p-adic integers is Zp = fx 2 Qp : jxjp ≤ 1g. In × particular, the units of Zp are Zp = fx 2 Qp : jxjp = 1g. Theorem 2.1.5. Let n 2 Z such that n ≥ 1. Then the inclusion Z ,! Zp induces a n n ring isomorphism Z=p Z ! Zp=p Zp. Proof. See [3, p. 63, Corollary 3.3.6]. n Theorem 2.1.6 (Hensel's Lemma). Let f(x) = a0+a1x+···+anx be a polynomial in Zp[x]. Suppose that there exists a p-adic integer α0 2 Zp such that f(α0) ≡ 0 mod pZp and 0 f (α0) 6≡ 0 mod pZp: 4 Then there exists a unique p-adic integer α 2 Zp such that α ≡ α0 mod pZp and f(α) = 0: Proof. See [3, p. 70, Theorem 3.4.1]. × × Corollary 2.1.7. Let p be an odd prime and let u 2 Zp . Then u = in Zp if and only if u ≡ mod p. × × Proof. Let u 2 Zp (in particular, u 6≡ 0 mod p). First, if u = in Zp , then obviously u ≡ mod p. On the other hand, let u ≡ mod p. Then there exists some a 2 (Z=pZ)× such that a2 ≡ u mod p. Now consider the polynomial f(x) = x2 − u. We have that f(a) ≡ a2 − u ≡ 0 mod p and f 0(a) = 2a 6≡ 0 mod p. Thus, by Hensel's 2 lemma there exists α 2 Zp such that f(α) = 0. So α = u, meaning u = in Zp and 2 × × jαjp = jujp = 1, so α 2 Zp . Thus, u = in Zp . × Lemma 2.1.8. Let p be an odd prime and let a; b; c 2 Zp . Then there exist x; y 2 Z=pZ such that ax2 + by2 ≡ c mod p. 2 2 p+1 Proof. Rewrite the congruence as ax ≡ c − by mod p. Since there are 2 squares 2 p+1 in Z=pZ (including 0 mod p here), ax mod p has 2 values as x varies mod p, and 2 p+1 p+1 p+1 likewise c − by mod p has 2 values as y varies mod p. Since 2 + 2 = p + 1 > p = jZ=pZj, by the pigeonhole principle ax2 mod p : x 2 Z=pZ \ c − by2 mod p : y 2 Z=pZ 6= ;: 2 2 So there exist x0; y0 2 Z=pZ such that ax0 ≡ c − by0 mod p. × Corollary 2.1.9. Let p be an odd prime and let a; b; c 2 Zp . Then the equation 2 2 ax + by = c has a solution with x; y 2 Zp. 5 2 2 Proof. By Lemma 2.1.8 there are x0; y0 2 Zp such that ax0 + by0 ≡ c mod p and either x0 6≡ 0 mod p or y0 6≡ 0 mod p. The congruence is symmetric in the roles of 2 c−by0 x0 and y0, so without loss of generality, let x0 6≡ 0 mod p. Then a is congruent 2 mod p to a nonzero square x0, so by Hensel's lemma there exists x 2 Zp such that 2 2 c−by0 x = a and x ≡ x0 mod p. Now let y = y0. Then (x; y) is a solution to the equation ax2 + by2 = c. Chapter 3 The Hilbert Symbol 3.1 Definition and Basic Properties The completions of Q are Q2; Q3; Q5; :::; and R. To describe these with a uniform notation, let v be a place, either a prime or the symbol 1, and define Q1 = R. × Definition 3.1.1. For any a; b 2 Qv , the Hilbert symbol of a and b relative to Qv is defined as 8 > 2 2 2 3 <> 1; if ax + by = z has a solution in (x; y; z) 2 Qv − f(0; 0; 0)g; (a; b)v := > :>−1; otherwise. × 2 2 2 For a; b; c 2 Qv , we will often refer to ax + by = cz having a solution when we mean having a solution besides (0; 0; 0). Remark 3.1.2. Since we can multiply the equation ax2 + by2 = z2 by any nonzero square without changing the existence of a solution, if v is a finite place and there is a 6 7 2 2 2 solution to ax + by = z with x; y; z 2 Qp, then there is a solution with x; y; z 2 Zp × and x, y, or z in Zp . Example 3.1.3. We will evaluate (2; 3)3. This means that we are trying to find out 2 2 2 whether there is a solution to 2x +3y = z with x; y; z 2 Q3 besides (0; 0; 0). If such a solution does exist, we know that one exists with x; y; z 2 Z3 where at least one of them is a unit. With this knowledge, we can now reduce 2x2 + 3y2 = z2 mod 3 and obtain 2x2 ≡ z2 mod 3. Here, if x ≡ 0 mod 3 then we would have that z ≡ 0 mod 3. Then 3jx and 3jz, so 32jx2 and 32jz2. This means that 32j(z2 − 2x2). So 32j3y2, meaning 3jy2, which implies that 3jy. Now we have that x; y, and z are not units, which is a contradiction as we had at least one of them being a unit. Thus it must be that x 6≡ 0 mod 3.
Load more

Recommended publications
  • Number Theoretic Symbols in K-Theory and Motivic Homotopy Theory
    Number Theoretic Symbols in K-theory and Motivic Homotopy Theory Håkon Kolderup Master’s Thesis, Spring 2016 Abstract We start out by reviewing the theory of symbols over number fields, emphasizing how this notion relates to classical reciprocity lawsp and algebraic pK-theory. Then we compute the second algebraic K-group of the fields pQ( −1) and Q( −3) based on Tate’s technique for K2(Q), and relate the result for Q( −1) to the law of biquadratic reciprocity. We then move into the realm of motivic homotopy theory, aiming to explain how symbols in number theory and relations in K-theory and Witt theory can be described as certain operations in stable motivic homotopy theory. We discuss Hu and Kriz’ proof of the fact that the Steinberg relation holds in the ring π∗α1 of stable motivic homotopy groups of the sphere spectrum 1. Based on this result, Morel identified the ring π∗α1 as MW the Milnor-Witt K-theory K∗ (F ) of the ground field F . Our last aim is to compute this ring in a few basic examples. i Contents Introduction iii 1 Results from Algebraic Number Theory 1 1.1 Reciprocity laws . 1 1.2 Preliminary results on quadratic fields . 4 1.3 The Gaussian integers . 6 1.3.1 Local structure . 8 1.4 The Eisenstein integers . 9 1.5 Class field theory . 11 1.5.1 On the higher unit groups . 12 1.5.2 Frobenius . 13 1.5.3 Local and global class field theory . 14 1.6 Symbols over number fields .
    [Show full text]
  • Local-Global Methods in Algebraic Number Theory
    LOCAL-GLOBAL METHODS IN ALGEBRAIC NUMBER THEORY ZACHARY KIRSCHE Abstract. This paper seeks to develop the key ideas behind some local-global methods in algebraic number theory. To this end, we first develop the theory of local fields associated to an algebraic number field. We then describe the Hilbert reciprocity law and show how it can be used to develop a proof of the classical Hasse-Minkowski theorem about quadratic forms over algebraic number fields. We also discuss the ramification theory of places and develop the theory of quaternion algebras to show how local-global methods can also be applied in this case. Contents 1. Local fields 1 1.1. Absolute values and completions 2 1.2. Classifying absolute values 3 1.3. Global fields 4 2. The p-adic numbers 5 2.1. The Chevalley-Warning theorem 5 2.2. The p-adic integers 6 2.3. Hensel's lemma 7 3. The Hasse-Minkowski theorem 8 3.1. The Hilbert symbol 8 3.2. The Hasse-Minkowski theorem 9 3.3. Applications and further results 9 4. Other local-global principles 10 4.1. The ramification theory of places 10 4.2. Quaternion algebras 12 Acknowledgments 13 References 13 1. Local fields In this section, we will develop the theory of local fields. We will first introduce local fields in the special case of algebraic number fields. This special case will be the main focus of the remainder of the paper, though at the end of this section we will include some remarks about more general global fields and connections to algebraic geometry.
    [Show full text]
  • Cubic and Biquadratic Reciprocity
    Rational (!) Cubic and Biquadratic Reciprocity Paul Pollack 2005 Ross Summer Mathematics Program It is ordinary rational arithmetic which attracts the ordinary man ... G.H. Hardy, An Introduction to the Theory of Numbers, Bulletin of the AMS 35, 1929 1 Quadratic Reciprocity Law (Gauss). If p and q are distinct odd primes, then q p 1 q 1 p = ( 1) −2 −2 . p − q We also have the supplementary laws: 1 (p 1)/2 − = ( 1) − , p − 2 (p2 1)/8 and = ( 1) − . p − These laws enable us to completely character- ize the primes p for which a given prime q is a square. Question: Can we characterize the primes p for which a given prime q is a cube? a fourth power? We will focus on cubes in this talk. 2 QR in Action: From the supplementary law we know that 2 is a square modulo an odd prime p if and only if p 1 (mod 8). ≡± Or take q = 11. We have 11 = p for p 1 p 11 ≡ (mod 4), and 11 = p for p 1 (mod 4). p − 11 6≡ So solve the system of congruences p 1 (mod 4), p (mod 11). ≡ ≡ OR p 1 (mod 4), p (mod 11). ≡− 6≡ Computing which nonzero elements mod p are squares and nonsquares, we find that 11 is a square modulo a prime p = 2, 11 if and only if 6 p 1, 5, 7, 9, 19, 25, 35, 37, 39, 43 (mod 44). ≡ q Observe that the p with p = 1 are exactly the primes in certain arithmetic progressions.
    [Show full text]
  • The Eleventh Power Residue Symbol
    The Eleventh Power Residue Symbol Marc Joye1, Oleksandra Lapiha2, Ky Nguyen2, and David Naccache2 1 OneSpan, Brussels, Belgium [email protected] 2 DIENS, Ecole´ normale sup´erieure,Paris, France foleksandra.lapiha,ky.nguyen,[email protected] Abstract. This paper presents an efficient algorithm for computing 11th-power residue symbols in the th cyclotomic field Q(ζ11), where ζ11 is a primitive 11 root of unity. It extends an earlier algorithm due to Caranay and Scheidler (Int. J. Number Theory, 2010) for the 7th-power residue symbol. The new algorithm finds applications in the implementation of certain cryptographic schemes. Keywords: Power residue symbol · Cyclotomic field · Reciprocity law · Cryptography 1 Introduction Quadratic and higher-order residuosity is a useful tool that finds applications in several cryptographic con- structions. Examples include [6, 19, 14, 13] for encryption schemes and [1, 12,2] for authentication schemes hαi and digital signatures. A central operation therein is the evaluation of a residue symbol of the form λ th without factoring the modulus λ in the cyclotomic field Q(ζp), where ζp is a primitive p root of unity. For the case p = 2, it is well known that the Jacobi symbol can be computed by combining Euclid's algorithm with quadratic reciprocity and the complementary laws for −1 and 2; see e.g. [10, Chapter 1]. a This eliminates the necessity to factor the modulus. In a nutshell, the computation of the Jacobi symbol n 2 proceeds by repeatedly performing 3 steps: (i) reduce a modulo n so that the result (in absolute value) is smaller than n=2, (ii) extract the sign and the powers of 2 for which the symbol is calculated explicitly with the complementary laws, and (iii) apply the reciprocity law resulting in the `numerator' and `denominator' of the symbol being flipped.
    [Show full text]
  • Reciprocity Laws Through Formal Groups
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 141, Number 5, May 2013, Pages 1591–1596 S 0002-9939(2012)11632-6 Article electronically published on November 8, 2012 RECIPROCITY LAWS THROUGH FORMAL GROUPS OLEG DEMCHENKO AND ALEXANDER GUREVICH (Communicated by Matthew A. Papanikolas) Abstract. A relation between formal groups and reciprocity laws is studied following the approach initiated by Honda. Let ξ denote an mth primitive root of unity. For a character χ of order m, we define two one-dimensional formal groups over Z[ξ] and prove the existence of an integral homomorphism between them with linear coefficient equal to the Gauss sum of χ. This allows us to deduce a reciprocity formula for the mth residue symbol which, in particular, implies the cubic reciprocity law. Introduction In the pioneering work [H2], Honda related the quadratic reciprocity law to an isomorphism between certain formal groups. More precisely, he showed that the multiplicative formal group twisted by the Gauss sum of a quadratic character is strongly isomorphic to a formal group corresponding to the L-series attached to this character (the so-called L-series of Hecke type). From this result, Honda deduced a reciprocity formula which implies the quadratic reciprocity law. Moreover he explained that the idea of this proof comes from the fact that the Gauss sum generates a quadratic extension of Q, and hence, the twist of the multiplicative formal group corresponds to the L-series of this quadratic extension (the so-called L-series of Artin type). Proving the existence of the strong isomorphism, Honda, in fact, shows that these two L-series coincide, which gives the reciprocity law.
    [Show full text]
  • Identifying the Matrix Ring: Algorithms for Quaternion Algebras And
    IDENTIFYING THE MATRIX RING: ALGORITHMS FOR QUATERNION ALGEBRAS AND QUADRATIC FORMS JOHN VOIGHT Abstract. We discuss the relationship between quaternion algebras and qua- dratic forms with a focus on computational aspects. Our basic motivating problem is to determine if a given algebra of rank 4 over a commutative ring R embeds in the 2 × 2-matrix ring M2(R) and, if so, to compute such an embedding. We discuss many variants of this problem, including algorithmic recognition of quaternion algebras among algebras of rank 4, computation of the Hilbert symbol, and computation of maximal orders. Contents 1. Rings and algebras 3 Computable rings and algebras 3 Quaternion algebras 5 Modules over Dedekind domains 6 2. Standard involutions and degree 6 Degree 7 Standard involutions 7 Quaternion orders 8 Algorithmically identifying a standard involution 9 3. Algebras with a standard involution and quadratic forms 10 Quadratic forms over rings 10 Quadratic forms over DVRs 11 Identifying quaternion algebras 14 Identifying quaternion orders 15 4. Identifying the matrix ring 16 Zerodivisors 16 arXiv:1004.0994v2 [math.NT] 30 Apr 2012 Conics 17 5. Splitting fields and the Hilbert symbol 19 Hilbert symbol 19 Local Hilbert symbol 20 Representing local fields 22 Computing the local Hilbert symbol 22 6. The even local Hilbert symbol 23 Computing the Jacobi symbol 26 Relationship to conics 28 Date: May 28, 2018. 1991 Mathematics Subject Classification. Primary 11R52; Secondary 11E12. Key words and phrases. Quadratic forms, quaternion algebras, maximal orders, algorithms, matrix ring, number theory. 1 2 JOHN VOIGHT 7. Maximal orders 28 Computing maximal orders, generally 28 Discriminants 29 Computing maximal orders 29 Complexity analysis 32 Relationship to conics 34 8.
    [Show full text]
  • 4 Patterns in Prime Numbers: the Quadratic Reciprocity Law
    4 Patterns in Prime Numbers: The Quadratic Reciprocity Law 4.1 Introduction The ancient Greek philosopher Empedocles (c. 495–c. 435 b.c.e.) postulated that all known substances are composed of four basic elements: air, earth, fire, and water. Leucippus (fifth century b.c.e.) thought that these four were indecomposable. And Aristotle (384–322 b.c.e.) introduced four properties that characterize, in various combinations, these four elements: for example, fire possessed dryness and heat. The properties of compound substances were aggregates of these. This classical Greek concept of an element was upheld for almost two thousand years. But by the end of the nineteenth century, 83 chem- ical elements were known to exist, and these formed the basic building blocks of more complex substances. The European chemists Dmitry I. Mendeleyev (1834–1907) and Julius L. Meyer (1830–1895) arranged the elements approx- imately in the order of increasing atomic weight (now known to be the order of increasing atomic numbers), which exhibited a periodic recurrence of their chemical properties [205, 248]. This pattern in properties became known as the periodic law of chemical elements, and the arrangement as the periodic table. The periodic table is now at the center of every introductory chemistry course, and was a major breakthrough into the laws governing elements, the basic building blocks of all chemical compounds in the universe (Exercise 4.1). The prime numbers can be considered numerical analogues of the chemical elements. Recall that these are the numbers that are multiplicatively indecom- posable, i.e., divisible only by 1 and by themselves.
    [Show full text]
  • Casting Retrospective Glances of David Hilbert in the History of Pure Mathematics
    British Journal of Science 157 February 2012, Vol. 4 (1) Casting Retrospective Glances of David Hilbert in the History of Pure Mathematics W. Obeng-Denteh and S.K. Manu Department of Mathematics, Kwame Nkrumah University of Science and Technology, Kumasi, Ghana Abstract This study was conducted with the view of reconfirming the historical contributions of David Hilbert in the form of a review in the area of mathematics. It emerged that he contributed to the growth of especially the Nullstellensatz and was the first person to prove it. The implications and conclusions are that the current trend in the said area of mathematics could be appreciated owing to contributions and motivations of such a mathematician. Keywords: David Hilbert, Nullstellensatz, affine variety, natural number, general contribution 1.0 Introduction The term history came from the Greek word ἱστορία - historia, which means "inquiry, knowledge acquired by investigation‖( Santayana, …….) and it is the study of the human past. History can also mean the period of time after writing was invented. David Hilbert was a German mathematician who was born on 23rd January, 1862 and his demise occurred on 14th February, 1943. His parents were Otto and Maria Therese. He was born in the Province of Prussia, Wahlau and was the first of two children and only son. As far as the 19th and early 20th centuries are concerned he is deemed as one of the most influential and universal mathematicians. He reduced geometry to a series of axioms and contributed substantially to the establishment of the formalistic foundations of mathematics. His work in 1909 on integral equations led to 20th-century research in functional analysis.
    [Show full text]
  • Computing the Power Residue Symbol
    Radboud University Master Thesis Computing the power residue symbol Koen de Boer supervised by dr. W. Bosma dr. H.W. Lenstra Jr. August 28, 2016 ii Foreword Introduction In this thesis, an algorithm is proposed to compute the power residue symbol α b m in arbitrary number rings containing a primitive m-th root of unity. The algorithm consists of three parts: principalization, reduction and evaluation, where the reduction part is optional. The evaluation part is a probabilistic algorithm of which the expected running time might be polynomially bounded by the input size, a presumption made plausible by prime density results from analytic number theory and timing experiments. The principalization part is also probabilistic, but it is not tested in this thesis. The reduction algorithm is deterministic, but might not be a polynomial- time algorithm in its present form. Despite the fact that this reduction part is apparently not effective, it speeds up the overall process significantly in practice, which is the reason why it is incorporated in the main algorithm. When I started writing this thesis, I only had the reduction algorithm; the two other parts, principalization and evaluation, were invented much later. This is the main reason why this thesis concentrates primarily on the reduction al- gorithm by covering subjects like lattices and lattice reduction. Results about the density of prime numbers and other topics from analytic number theory, on which the presumed effectiveness of the principalization and evaluation al- gorithm is based, are not as extensively treated as I would have liked to. Since, in the beginning, I only had the reduction algorithm, I tried hard to prove that its running time is polynomially bounded.
    [Show full text]
  • GENERALIZED EXPLICIT RECIPROCITY LAWS Contents 1
    GENERALIZED EXPLICIT RECIPROCITY LAWS KAZUYA KATO Contents 1. Review on the classical explicit reciprocity law 4 2. Review on BdR 6 3. p-divisible groups and norm compatible systems in K-groups 16 4. Generalized explicit reciprocity law 19 5. Proof of the generalized explicit reciprocity law 27 6. Another generalized explicit reciprocity law 57 References 64 Introduction 0.1. In this paper, we give generalizations of the explicit reciprocity law to p-adically complete discrete valuation fields whose residue fields are not necessarily perfect. The main theorems are 4.3.1, 4.3.4, and 6.1.9. In subsequent papers, we will apply our gen- eralized explicit reciprocity laws to p-adic completions of the function fields of modular curves, whose residue fields are function fields in one variable over finite fields and hence imperfect, and will study the Iwasawa theory of modular forms. I outline in 0.3 what is done in this paper in the case of p-adic completions of the function fields of modular curves, comparing it with the case of classical explicit reciprocity law outlined in 0.2. I then explain in 0.4 how the results of this paper will be applied in the Iwasawa theory of modular forms, for these applications are the motivations of this paper, comparing it with the role of the classical explicit reciprocity laws in the classical Iwasawa theory and in related known theories. 0.2. The classical explicit reciprocity law established by Artin, Hasse, Iwasawa, and many other people is the theory to give explicit descriptions of Hilbert symbols.
    [Show full text]
  • Quaternion Algebras and Q 1.1. What Are Quaternion Algebras?
    INTRODUCTION TO THE LOCAL-GLOBAL PRINCIPLE LIANG XIAO Abstract. This is the notes of a series lectures on local-global principle and quaternion algebras, given at Connecticut Summer School in Number Theory. 1. Day I: Quaternion Algebras and Qp 1.1. What are Quaternion Algebras? 1.1.1. Hamiltonian H. Recall that we setup mathematics in such a way starting with positive integers N and integers Z to build Q as its quotient field, and then defining R using several equivalent axioms, e.g. Dedekind cut, or as certain completions. After that, we introduced the field of complex numbers as C = R ⊕ Ri, satisfying i2 = −1. One of the most important theorem for complex numbers is the Fundamental Theorem of Algebra: all complex coefficients non-constant polynomials f(x) 2 C[x] has a zero. In other words, C is an algebraically closed field; so there is no bigger field than C that is finite dimensional as an R-vector space. (With the development of physics), Hamilton discovered that there is an \associative-but- non-commutative field” (called a skew field or a division algebra) H which is 4-dimensional over R: H = R ⊕ Ri ⊕ Rj ⊕ Rk = ai + bj + cj + dk a; b; c; d 2 R ; where the multiplication is R-linear and subject to the following rules: i2 = j2 = k2 = −1; ij = −ji = k; jk = −kj = i; and ki = −ik = j: This particular H is called the Hamiltonian quaternion. One simple presentation of H is: 2 2 H := Chi; ji i + 1; j + 1; ij + ji : Question 1.1.2.
    [Show full text]
  • Algebraic K-Theory and Quadratic Forms
    Inventiones math. 9, 318-344 (1970) Algebraic K-Theory and Quadratic Forms JOHN MILNOR (Cambridge, Massachusetts) The first section of this paper defines and studies a graded ring K. F associated to any field F. By definition, K~F is the target group of the universal n-linear function from F ~ x ... • F ~ to an additive group, satisfy- ing the condition that al • "' x a, should map to zero whenever a i -q-ai + ~= 1. Here F ~ denotes the multiplicative group F-0. Section 2 constructs a homomorphism ~: K,F---, K~__I_~ associated with a discrete valuation on F with residue class field F. These homo- morphisms ~ are used to compute the ring K, F(t) of a rational function field, using a technique due to John Tate. Section 3 relates K.F to the theory of quadratic modules by defining certain " Stiefel-Whitney invariants" of a quadratic module over a field F of characteristic .2. The definition is closely related to Delzant [-5]. Let W be the Witt ring of anisotropic quadratic modules over F, and let I c W be the maximal ideal, consisting of modules of even rank. Section 4 studies the conjecture that the associated graded ring (W/I, 1/12, 12/13.... ) is canonically isomorphic to K,F/2K, F. Section 5 computes the Witt ring of a field F(t) of rational functions. Section 6 describes the conjecture that K,F/2K, F is canonically isomorphic to the cohomology ring H*(GF; Z/2Z); where Gr denotes the Galois group of the separable closure of F.
    [Show full text]