Nonstandard Mathematics and New Zeta and L-Functions
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Integers, Rational Numbers, and Algebraic Numbers
LECTURE 9 Integers, Rational Numbers, and Algebraic Numbers In the set N of natural numbers only the operations of addition and multiplication can be defined. For allowing the operations of subtraction and division quickly take us out of the set N; 2 ∈ N and3 ∈ N but2 − 3=−1 ∈/ N 1 1 ∈ N and2 ∈ N but1 ÷ 2= = N 2 The set Z of integers is formed by expanding N to obtain a set that is closed under subtraction as well as addition. Z = {0, −1, +1, −2, +2, −3, +3,...} . The new set Z is not closed under division, however. One therefore expands Z to include fractions as well and arrives at the number field Q, the rational numbers. More formally, the set Q of rational numbers is the set of all ratios of integers: p Q = | p, q ∈ Z ,q=0 q The rational numbers appear to be a very satisfactory algebraic system until one begins to tries to solve equations like x2 =2 . It turns out that there is no rational number that satisfies this equation. To see this, suppose there exists integers p, q such that p 2 2= . q p We can without loss of generality assume that p and q have no common divisors (i.e., that the fraction q is reduced as far as possible). We have 2q2 = p2 so p2 is even. Hence p is even. Therefore, p is of the form p =2k for some k ∈ Z.Butthen 2q2 =4k2 or q2 =2k2 so q is even, so p and q have a common divisor - a contradiction since p and q are can be assumed to be relatively prime. -
Algebraic Number Theory
Algebraic Number Theory William B. Hart Warwick Mathematics Institute Abstract. We give a short introduction to algebraic number theory. Algebraic number theory is the study of extension fields Q(α1; α2; : : : ; αn) of the rational numbers, known as algebraic number fields (sometimes number fields for short), in which each of the adjoined complex numbers αi is algebraic, i.e. the root of a polynomial with rational coefficients. Throughout this set of notes we use the notation Z[α1; α2; : : : ; αn] to denote the ring generated by the values αi. It is the smallest ring containing the integers Z and each of the αi. It can be described as the ring of all polynomial expressions in the αi with integer coefficients, i.e. the ring of all expressions built up from elements of Z and the complex numbers αi by finitely many applications of the arithmetic operations of addition and multiplication. The notation Q(α1; α2; : : : ; αn) denotes the field of all quotients of elements of Z[α1; α2; : : : ; αn] with nonzero denominator, i.e. the field of rational functions in the αi, with rational coefficients. It is the smallest field containing the rational numbers Q and all of the αi. It can be thought of as the field of all expressions built up from elements of Z and the numbers αi by finitely many applications of the arithmetic operations of addition, multiplication and division (excepting of course, divide by zero). 1 Algebraic numbers and integers A number α 2 C is called algebraic if it is the root of a monic polynomial n n−1 n−2 f(x) = x + an−1x + an−2x + ::: + a1x + a0 = 0 with rational coefficients ai. -
A List of Arithmetical Structures Complete with Respect to the First
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Theoretical Computer Science 257 (2001) 115–151 www.elsevier.com/locate/tcs A list of arithmetical structures complete with respect to the ÿrst-order deÿnability Ivan Korec∗;X Slovak Academy of Sciences, Mathematical Institute, Stefanikovaà 49, 814 73 Bratislava, Slovak Republic Abstract A structure with base set N is complete with respect to the ÿrst-order deÿnability in the class of arithmetical structures if and only if the operations +; × are deÿnable in it. A list of such structures is presented. Although structures with Pascal’s triangles modulo n are preferred a little, an e,ort was made to collect as many simply formulated results as possible. c 2001 Elsevier Science B.V. All rights reserved. MSC: primary 03B10; 03C07; secondary 11B65; 11U07 Keywords: Elementary deÿnability; Pascal’s triangle modulo n; Arithmetical structures; Undecid- able theories 1. Introduction A list of (arithmetical) structures complete with respect of the ÿrst-order deÿnability power (shortly: def-complete structures) will be presented. (The term “def-strongest” was used in the previous versions.) Most of them have the base set N but also structures with some other universes are considered. (Formal deÿnitions are given below.) The class of arithmetical structures can be quasi-ordered by ÿrst-order deÿnability power. After the usual factorization we obtain a partially ordered set, and def-complete struc- tures will form its greatest element. Of course, there are stronger structures (with respect to the ÿrst-order deÿnability) outside of the class of arithmetical structures. -
The Infinite and Contradiction: a History of Mathematical Physics By
The infinite and contradiction: A history of mathematical physics by dialectical approach Ichiro Ueki January 18, 2021 Abstract The following hypothesis is proposed: \In mathematics, the contradiction involved in the de- velopment of human knowledge is included in the form of the infinite.” To prove this hypothesis, the author tries to find what sorts of the infinite in mathematics were used to represent the con- tradictions involved in some revolutions in mathematical physics, and concludes \the contradiction involved in mathematical description of motion was represented with the infinite within recursive (computable) set level by early Newtonian mechanics; and then the contradiction to describe discon- tinuous phenomena with continuous functions and contradictions about \ether" were represented with the infinite higher than the recursive set level, namely of arithmetical set level in second or- der arithmetic (ordinary mathematics), by mechanics of continuous bodies and field theory; and subsequently the contradiction appeared in macroscopic physics applied to microscopic phenomena were represented with the further higher infinite in third or higher order arithmetic (set-theoretic mathematics), by quantum mechanics". 1 Introduction Contradictions found in set theory from the end of the 19th century to the beginning of the 20th, gave a shock called \a crisis of mathematics" to the world of mathematicians. One of the contradictions was reported by B. Russel: \Let w be the class [set]1 of all classes which are not members of themselves. Then whatever class x may be, 'x is a w' is equivalent to 'x is not an x'. Hence, giving to x the value w, 'w is a w' is equivalent to 'w is not a w'."[52] Russel described the crisis in 1959: I was led to this contradiction by Cantor's proof that there is no greatest cardinal number. -
Many More Names of (7, 3, 1)
VOL. 88, NO. 2, APRIL 2015 103 Many More Names of (7, 3, 1) EZRA BROWN Virginia Polytechnic Institute and State University Blacksburg, VA 24061-0123 [email protected] Combinatorial designs are collections of subsets of a finite set that satisfy specified conditions, usually involving regularity or symmetry. As the scope of the 984-page Handbook of Combinatorial Designs [7] suggests, this field of study is vast and far reaching. Here is a picture of the very first design to appear in “Opening the Door,” the first of the Handbook’s 109 chapters: Figure 1 The design that opens the door This design, which we call the (7, 3, 1) design, makes appearances in many areas of mathematics. It seems to turn up again and again in unexpected places. An earlier paper in this MAGAZINE [4] described (7, 3, 1)’s appearance in a number of different areas, including finite projective planes, as the Fano plane (FIGURE 1); graph theory, as the Heawood graph and the doubly regular round-robin tournament of order 7; topology, as an arrangement of six mutually adjacent hexagons on the torus; (−1, 1) matrices, as a skew-Hadamard matrix of order 8; and algebraic number theory, as the splitting field of the polynomial (x 2 − 2)(x 2 − 3)(x 2 − 5). In this paper, we show how (7, 3, 1) makes appearances in three areas, namely (1) Hamming’s error-correcting codes, (2) Singer designs and difference sets based on n-dimensional finite projective geometries, and (3) normed algebras. We begin with an overview of block designs, including two descriptions of (7, 3, 1). -
The Reverse Mathematics of Cousin's Lemma
VICTORIAUNIVERSITYOFWELLINGTON Te Herenga Waka School of Mathematics and Statistics Te Kura Matai Tatauranga PO Box 600 Tel: +64 4 463 5341 Wellington 6140 Fax: +64 4 463 5045 New Zealand Email: sms-offi[email protected] The reverse mathematics of Cousin’s lemma Jordan Mitchell Barrett Supervisors: Rod Downey, Noam Greenberg Friday 30th October 2020 Submitted in partial fulfilment of the requirements for the Bachelor of Science with Honours in Mathematics. Abstract Cousin’s lemma is a compactness principle that naturally arises when study- ing the gauge integral, a generalisation of the Lebesgue integral. We study the ax- iomatic strength of Cousin’s lemma for various classes of functions, using Fried- arXiv:2011.13060v1 [math.LO] 25 Nov 2020 man and Simpson’s reverse mathematics in second-order arithmetic. We prove that, over RCA0: (i) Cousin’s lemma for continuous functions is equivalent to the system WKL0; (ii) Cousin’s lemma for Baire 1 functions is at least as strong as ACA0; (iii) Cousin’s lemma for Baire 2 functions is at least as strong as ATR0. Contents 1 Introduction 1 2 Integration and Cousin’s lemma 5 2.1 Riemann integration . .5 2.2 Gauge integration . .6 2.3 Cousin’s lemma . .7 3 Logical prerequisites 9 3.1 Computability . .9 3.2 Second-order arithmetic . 12 3.3 The arithmetical and analytical hierarchies . 13 4 Subsystems of second-order arithmetic 17 4.1 Formal systems . 17 4.2 RCA0 .......................................... 18 4.3 WKL0 .......................................... 19 4.4 ACA0 .......................................... 21 4.5 ATR0 .......................................... 22 1 4.6 P1-CA0 ......................................... 23 5 Analysis in second-order arithmetic 25 5.1 Number systems . -
Algebraic Number Theory Summary of Notes
Algebraic Number Theory summary of notes Robin Chapman 3 May 2000, revised 28 March 2004, corrected 4 January 2005 This is a summary of the 1999–2000 course on algebraic number the- ory. Proofs will generally be sketched rather than presented in detail. Also, examples will be very thin on the ground. I first learnt algebraic number theory from Stewart and Tall’s textbook Algebraic Number Theory (Chapman & Hall, 1979) (latest edition retitled Algebraic Number Theory and Fermat’s Last Theorem (A. K. Peters, 2002)) and these notes owe much to this book. I am indebted to Artur Costa Steiner for pointing out an error in an earlier version. 1 Algebraic numbers and integers We say that α ∈ C is an algebraic number if f(α) = 0 for some monic polynomial f ∈ Q[X]. We say that β ∈ C is an algebraic integer if g(α) = 0 for some monic polynomial g ∈ Z[X]. We let A and B denote the sets of algebraic numbers and algebraic integers respectively. Clearly B ⊆ A, Z ⊆ B and Q ⊆ A. Lemma 1.1 Let α ∈ A. Then there is β ∈ B and a nonzero m ∈ Z with α = β/m. Proof There is a monic polynomial f ∈ Q[X] with f(α) = 0. Let m be the product of the denominators of the coefficients of f. Then g = mf ∈ Z[X]. Pn j Write g = j=0 ajX . Then an = m. Now n n−1 X n−1+j j h(X) = m g(X/m) = m ajX j=0 1 is monic with integer coefficients (the only slightly problematical coefficient n −1 n−1 is that of X which equals m Am = 1). -
Approximation to Real Numbers by Algebraic Numbers of Bounded Degree
Approximation to real numbers by algebraic numbers of bounded degree (Review of existing results) Vladislav Frank University Bordeaux 1 ALGANT Master program May,2007 Contents 1 Approximation by rational numbers. 2 2 Wirsing conjecture and Wirsing theorem 4 3 Mahler and Koksma functions and original Wirsing idea 6 4 Davenport-Schmidt method for the case d = 2 8 5 Linear forms and the subspace theorem 10 6 Hopeless approach and Schmidt counterexample 12 7 Modern approach to Wirsing conjecture 12 8 Integral approximation 18 9 Extremal numbers due to Damien Roy 22 10 Exactness of Schmidt result 27 1 1 Approximation by rational numbers. It seems, that the problem of approximation of given number by numbers of given class was firstly stated by Dirichlet. So, we may call his theorem as ”the beginning of diophantine approximation”. Theorem 1.1. (Dirichlet, 1842) For every irrational number ζ there are in- p finetely many rational numbers q , such that p 1 0 < ζ − < . q q2 Proof. Take a natural number N and consider numbers {qζ} for all q, 1 ≤ q ≤ N. They all are in the interval (0, 1), hence, there are two of them with distance 1 not exceeding q . Denote the corresponding q’s as q1 and q2. So, we know, that 1 there are integers p1, p2 ≤ N such that |(q2ζ − p2) − (q1ζ − p1)| < N . Hence, 1 for q = q2 − q1 and p = p2 − p1 we have |qζ − p| < . Division by q gives N ζ − p < 1 ≤ 1 . So, for every N we have an approximation with precision q qN q2 1 1 qN < N . -
Infinitesimals
Infinitesimals: History & Application Joel A. Tropp Plan II Honors Program, WCH 4.104, The University of Texas at Austin, Austin, TX 78712 Abstract. An infinitesimal is a number whose magnitude ex- ceeds zero but somehow fails to exceed any finite, positive num- ber. Although logically problematic, infinitesimals are extremely appealing for investigating continuous phenomena. They were used extensively by mathematicians until the late 19th century, at which point they were purged because they lacked a rigorous founda- tion. In 1960, the logician Abraham Robinson revived them by constructing a number system, the hyperreals, which contains in- finitesimals and infinitely large quantities. This thesis introduces Nonstandard Analysis (NSA), the set of techniques which Robinson invented. It contains a rigorous de- velopment of the hyperreals and shows how they can be used to prove the fundamental theorems of real analysis in a direct, natural way. (Incredibly, a great deal of the presentation echoes the work of Leibniz, which was performed in the 17th century.) NSA has also extended mathematics in directions which exceed the scope of this thesis. These investigations may eventually result in fruitful discoveries. Contents Introduction: Why Infinitesimals? vi Chapter 1. Historical Background 1 1.1. Overview 1 1.2. Origins 1 1.3. Continuity 3 1.4. Eudoxus and Archimedes 5 1.5. Apply when Necessary 7 1.6. Banished 10 1.7. Regained 12 1.8. The Future 13 Chapter 2. Rigorous Infinitesimals 15 2.1. Developing Nonstandard Analysis 15 2.2. Direct Ultrapower Construction of ∗R 17 2.3. Principles of NSA 28 2.4. Working with Hyperreals 32 Chapter 3. -
Arxiv:1103.4922V1 [Math.NT] 25 Mar 2011 Hoyo Udai Om.Let Forms
QUATERNION ORDERS AND TERNARY QUADRATIC FORMS STEFAN LEMURELL Introduction The main purpose of this paper is to provide an introduction to the arith- metic theory of quaternion algebras. However, it also contains some new results, most notably in Section 5. We will emphasise on the connection between quaternion algebras and quadratic forms. This connection will pro- vide us with an efficient tool to consider arbitrary orders instead of having to restrict to special classes of them. The existing results are mostly restricted to special classes of orders, most notably to so called Eichler orders. The paper is organised as follows. Some notations and background are provided in Section 1, especially on the theory of quadratic forms. Section 2 contains the basic theory of quaternion algebras. Moreover at the end of that section, we give a quite general solution to the problem of representing a quaternion algebra with given discriminant. Such a general description seems to be lacking in the literature. Section 3 gives the basic definitions concerning orders in quaternion alge- bras. In Section 4, we prove an important correspondence between ternary quadratic forms and quaternion orders. Section 5 deals with orders in quaternion algebras over p-adic fields. The major part is an investigation of the isomorphism classes in the non-dyadic and 2-adic cases. The starting- point is the correspondence with ternary quadratic forms and known classi- fications of such forms. From this, we derive representatives of the isomor- phism classes of quaternion orders. These new results are complements to arXiv:1103.4922v1 [math.NT] 25 Mar 2011 existing more ring-theoretic descriptions of orders. -
Subforms of Norm Forms of Octonion Fields Stuttgarter Mathematische
Subforms of Norm Forms of Octonion Fields Norbert Knarr, Markus J. Stroppel Stuttgarter Mathematische Berichte 2017-005 Fachbereich Mathematik Fakultat¨ Mathematik und Physik Universitat¨ Stuttgart Pfaffenwaldring 57 D-70 569 Stuttgart E-Mail: [email protected] WWW: http://www.mathematik.uni-stuttgart.de/preprints ISSN 1613-8309 c Alle Rechte vorbehalten. Nachdruck nur mit Genehmigung des Autors. LATEX-Style: Winfried Geis, Thomas Merkle, Jurgen¨ Dippon Subforms of Norm Forms of Octonion Fields Norbert Knarr, Markus J. Stroppel Abstract We characterize the forms that occur as restrictions of norm forms of octonion fields. The results are applied to forms of types E6,E7, and E8, and to positive definite forms over fields that allow a unique octonion field. Mathematics Subject Classification (MSC 2000): 11E04, 17A75. Keywords: quadratic form, octonion, quaternion, division algebra, composition algebra, similitude, form of type E6, form of type E7, form of type E8 1 Introduction Let F be a commutative field. An octonion field over F is a non-split composition algebra of dimension 8 over F . Thus there exists an anisotropic multiplicative form (the norm of the algebra) with non-degenerate polar form. It is known that such an algebra is not associative (but alternative). A good source for general properties of composition algebras is [9]. In [1], the group ΛV generated by all left multiplications by non-zero elements is studied for various subspaces V of a given octonion field. In that paper, it is proved that ΛV has a representation by similitudes of V (with respect to the restriction of the norm to V ), and these representations are used to study exceptional homomorphisms between classical groups (in [1, 6.1, 6.3, or 6.5]). -
The Hyperreals
THE HYPERREALS LARRY SUSANKA Abstract. In this article we define the hyperreal numbers, an ordered field containing the real numbers as well as infinitesimal numbers. These infinites- imals have magnitude smaller than that of any nonzero real number and have intuitively appealing properties, harkening back to the thoughts of the inven- tors of analysis. We use the ultrafilter construction of the hyperreal numbers which employs common properties of sets, rather than the original approach (see A. Robinson Non-Standard Analysis [5]) which used model theory. A few of the properties of the hyperreals are explored and proofs of some results from real topology and calculus are created using hyperreal arithmetic in place of the standard limit techniques. Contents The Hyperreal Numbers 1. Historical Remarks and Overview 2 2. The Construction 3 3. Vocabulary 6 4. A Collection of Exercises 7 5. Transfer 10 6. The Rearrangement and Hypertail Lemmas 14 Applications 7. Open, Closed and Boundary For Subsets of R 15 8. The Hyperreal Approach to Real Convergent Sequences 16 9. Series 18 10. More on Limits 20 11. Continuity and Uniform Continuity 22 12. Derivatives 26 13. Results Related to the Mean Value Theorem 28 14. Riemann Integral Preliminaries 32 15. The Infinitesimal Approach to Integration 36 16. An Example of Euler, Revisited 37 References 40 Index 41 Date: June 27, 2018. 1 2 LARRY SUSANKA 1. Historical Remarks and Overview The historical Euclid-derived conception of a line was as an object possessing \the quality of length without breadth" and which satisfies the various axioms of Euclid's geometric structure.