TRANSCENDENTAL NUMBERS AND PERIODS. Contents
|
|
- Egbert Bridges
- 5 years ago
- Views:
Transcription
1 TRANSCENDENTAL NUMBERS AND PERIODS JAMES CARLSON Contents. Introduction.. Diophantine approximation I: upper bounds 2.2. Diophantine approximation II: lower bounds 4.3. Proof of the lower bound 5 2. Periods Periods 6 3. Computable numbers 8 4. References. Introduction These are notes for a talk given at Colorado State University on February 2, 205. The numbers we are familiar with fall into a hierarchy of sets of ever greater scope: N Z Q Q C These are the natural numbers, the integers, the rationals, the field of algebraic numbers, and complex numbers, respectively. The field Q is the set of all possible solutions of polynomial equations with rational coefficients. Such equations can be enumerated, so Q, like the field of rational numbers itself, is countable. Nonetheless, the Q is considerably larger than Q in the sense that it infinite dimensional rational vector space. For example, Date:
2 2 JAMES CARLSON the numbers p, where p is prime, are linearly independent. These reults have their roots in the Greek mathematics of around 500 BC. Consider now the field of complex numbers. By the work of Georg Cantor, it is an uncountable field a remarkable fact that rests on the Cantor s famous diagonal argument. It follows that most numbers are transcendental. That is, they satisfy no polynomial equation with rational coefficients. Consequently, there is a decomposition C = Q (C Q) where the first term is countable and the second is uncountable. Note also that the first is of measure zero while the second is of infinite measure. The same considerations apply to the deomposition [0, ] = ( Q [0, ]) (C Q) [0, ], except that [0, ] and the second term on the right have measure one. We are now faced with a paradox. The set of algebraic numbers is small both in cardinality and measure relative to the set of all complex numbers. A number chosen at random is transcendental with probability one. Despite this fact, finding explicit transcendental numbers is quite hard. Specific transcendental numbers were exhibted first exhibited in 844 by Liouville. Theorem. The Liouville number is transcendental. In what follows we discuss λ = n=0 0 n!. () The proof of Theorem (2) The definition and properties of a countable class of transcendental numbers, the periods (3) The Konsevich-Zagier philosophy that almost all known transcendental numbers are periods. (4) Yoshinaga s solution of the problem of exhibiting an explicit non-period, analogous to Liouville s construction of λ. (5) The K-Z conjecture that e is not a period. The first item depends on arguments in Diophantine approximation,which we take up now.
3 TRANSCENDENTAL NUMBERS AND PERIODS 3.. Diophantine approximation I: upper bounds. The first numbers known to be transcendental are the so-called Liouville numbers. To understand them, we must consider the task of approximating an arbitrary real number by rational numbers. If we divide the number line at the rational numbers with denominator q, we divide it into intervals of length /q. Consequently, for any real number α and any integer q > 0, there is an integer p such that α p q < 2q. It turns out, however, that there are specially good ways of approximating a real number by a rational number. These are the continued fractions. Suppose given a real number α > 0. Write it as the sum of an integer and a fractional part, where 0 < α <. Thus for α = π we have α = [α] + { α }, π = Let α = /{ α }, and treat α in the same way as we treated α: In the case of π, α = [α ] + { α }, α = Putting together what we have done s far gives us π = This is the beginning of the continued fraction expansion of π. You are urged to work out more terms. The next step is + where ϵ = π = ϵ
4 4 JAMES CARLSON Convergents. Truncate the continued fraction expansion at any stage, discarding the fractional part if necessary. The resulting compound fractions are called convergents, and can be notated as c 0, c, etc. They satisfy In the case of π, c 0 = 3, and lim c n = α n c = For the second convergent, set ϵ = 0 to get then c 2 = , 5 c = , and finally + c = Thus π c 2 < By contrast, /5 < These popular ancient values of π give especially good approximations, e.g., π 22 7 Indeed, we have the following general result: = π < << 2 7 The convergents p/q of a real number α satisfy α p q < q 2.
5 TRANSCENDENTAL NUMBERS AND PERIODS 5.2. Diophantine approximation II: lower bounds. The key to showing that λ is transcendental is the following lower bound on approximation of algebraic numbers by rational numbers: Theorem 2. Let α is an irrational number which is a root of an a polynomial of degree n with integer coefficients. Then there is a constant c(α) such that α p q > c(α) q n Since the partial sums of the series in Theorem converge exponentailly fast, we conclude the following: Corollary. Liouville s number λ is transcendental. Much more sophisticated arguments in Diophantine approximation soon came. Theorem 3. (Hermite 873) e is transcendental. Theorem 4. (Lindemann 882) π is transcendental. Theorem 5. (Weierstrass-Lindemann) The exponential of a nonzero algebraic number is transcendental. The transcendence of e is an immediate consequence of the Weierstrass-Lindemann theorem. That theorem also implies the transcendence of π: observe that e 2π = If π is algebraic, then so is 2π. Therefore the expression above is transcendental, a contradiction..3. Proof of the lower bound. Let α be a simple root of a polynomial f(x) with integer coefficients. By the mean value theorem, We can rewrite this as ( ) ( ) ( ) p f(α) f = p q f = p q f a p q q a p q = f ( p q ) ( ) p f q
6 6 JAMES CARLSON The interval a p q is bounded. Since α is a simple root of f, the derivative of f is nonzero near α and so is bounded below by some non-zero constant c(α). Thus we have Now write where a p q c(α) f f ( ) p = a q q n a = q n f ( ) p q ( p q ) is a a polynomial with integer coefficients evaluated on an integer. Since a 0, a. This observation yields the result. 2. Periods Kontsevich and Zagier posit that almost all transcendental numbers we know are in fact members of a countable set P, the periods. Let us take as a provisional definition of period the length, area, or n-dimensional volume of a set defined by polynomial inequalities with rational coefficients. This set is clearly countable, and it includes where p and q are integers, the roots p p/q q = dx, 0 n a = { 0 x n a } and all algebraic numbers. It also includes the special transcendental numbers dx, log p q = p/q dx x
7 TRANSCENDENTAL NUMBERS AND PERIODS 7 π = Thus our hierarchy of numbers now reads x 2 +y 2 dx dy N Z Q Q P C Remark. Let a be real number in the interval (0, ) that has infinitiely many nonzero binary digits a i. The Liouville number λ(a) = n= a n 0 n! is transcendental. Thus there is an uncountable set of explicit transcendental numbers which are not periods. 2.. Periods. in algebraic geometry A seemingly much larger class of interesting numbers comes from algebraic geometry. Let X be an algebraic variety defined over the rational numbers, and let ω be any rational differential k-form on X with rational coefficients. Let γ be a homology cycle of dimension k. Then we an form the integral α = This gives a seemingly much more general class of periods. However, Kontsevich and Zagier remark that γ can be approximated by a homologous cycle whose pieces are of the first kind in suitable coordinates. Thus there is no real gain in generality. As an example, consider the form ω = dz/z on the punctured complex line C = { z C z 0 }. Let γ be the unit circle centered a the origin taken with some parameterization. Then γ ω. γ dz z = 2π is a period in the second sense. Replacing γ by a polygon which encircles the origin, we see that it is a period in the seemingly more restricted sense.
8 8 JAMES CARLSON For another example, consider the elliptic curve E defined by the equation y 2 = x(x )(x a) A homology basis { δ, γ } for E is given in Homology basis A. Figure. Homology basis A The cycle δ encircles the branch points 0 and, winding once around the branch cut from 0 to. The cycle γ starts from a point p on a branch cut from a to infinity, travels in one sheet of E to a point q on the he branch cut, and from there back p in the other sheet. By deforming contours, one sees that γ ω = Such integrals, classically known as elliptic integral, are transcendental the result of deep and difficult theorems of Siegel, Schneider, and Gelfond. a Remark. The periods of an elliptic curve defined over Q generates a field K per called the field of periods. This field has transcendence degree at most four and at least two. For the elliptic curves that have complex multiplication a kind of symmetry which generic elliptic curves do not have, the transcendence degree is exactly two. For more on this topic, see the exposition at Special periods of cubic surfaces. dx y.
9 TRANSCENDENTAL NUMBERS AND PERIODS 9 Figure 2. Homology basis B 3. Computable numbers A real number is computable if the n-th digit of its decimal expansion is the contents of the n-the square on a tape produced by a Turing machine. Grouping squares into pairs, one has a definition of computability for complex numbers. Let us denote the class of computable numbers by C. Since the set of Turing machines is countable, so is the set C. An alternative definition of computability the following definitions. Definition. A computable function f : N N is a function given by a Turing machine that produces output f(n) on input n. Definition 2. A real number ρ is computable if there are computable functions a(n) and b(n) such that Of course we have ρ a(n) b(n) + < n + lim n but Definition 2 makes a stronger statement. Theorem 6. Periods are computable a(n) b(n) + = ρ, Sketch of proof. Let A be a subset of R n defined by polynomial inequalities with rational coefficients. Let B be a box defined by inequalities b x i b. Let B[n] be the set of
10 0 JAMES CARLSON subcubes of B[n] of side length /n with vertices of the form a/n, where a is an integer. Let B [n] be the set of subcubes which have a vertex in A. This is is a computable set, since one can determine membership be evaluating polynomial functions with rational coefficients on vertices. Consequently the volume of this set for each n is given by a computable function. Therefore the volume of A is the limit of values a(n)/(b(n) + ), where a and b are computable. To prove computability, however, we must show that the estimate of Definition 2 is satisfied. To this end, note that the volume of the small cubes is O((/n) d ), where A R d. The key point is that the boundary of A is not wild, so that it is covered by O(n d ) small cubes. Thus the error is O(/n). Given this result, our hierarchy is N Z Q Q P C C Example. The number e is computable since we may devise a program for computing the n-th digit from computations of partial sums of the infinite series e = +! + 2! + 3! + Theorem 7. (Yoshinaga) There is a computable number which is not a period. ψ = Yoshinaga s proof relies yet another set, the elementary computable numbers, EC. He shows that the hierarchy is N Z Q Q P EC C C Using an explicit enumeration of the elementary computable numbers and a knd of Cantor diagonal argument, he exhibits a computable number which is not elementary computable and which is therefore not a period. Yoshinaga defines the elementary computable numbers by defining a class of elementary computable functions. To this end, define rhe operation (x y) to be x y if x y 0 and 0 otherwise. Define bounded summation by by BS : { f : N d N } { g : N d N }
11 TRANSCENDENTAL NUMBERS AND PERIODS If f(x) is a function of one variable, then x d BSf(x,..., x d ) = f(x,..., x d, k) k=0 BSf(n) = f(0) + f() + + f(n) is a kind of discrete indefinite integral. Bounded product is defined in the same way: BP f(x,..., x d ) = x d k=0 f(x,..., x d, k) Definition 3. The set of elementary computable functions is the smallest set which (a) contains the zero function, the successor functions, and the functions (x, y) x + y, (x, y) (x y) 0, (x, y) xy, and which (b) is closed under composition, bounded summation, and bounded product of functions. Yoshinaga then shows Sets defined by rational polynomial inequalities are elementary computable. The elementary computable functions have an explicit enumeration. By a Cantor diagonal argument, there is a computable number which is not elementary computable. () History: Wikipedia (2) Kontsevich and Zagier 4. References
NOTES ON IRRATIONALITY AND TRANSCENDENCE
NOTES ON IRRATIONALITY AND TRANSCENDENCE Frits Beukers September, 27 Introduction. Irrationality Definition.. Let α C. We call α irrational when α Q. Proving irrationality and transcendence of numbers
More informationINTRODUCTION TO TRANSCENDENTAL NUMBERS
INTRODUCTION TO TRANSCENDENTAL NUBERS VO THANH HUAN Abstract. The study of transcendental numbers has developed into an enriching theory and constitutes an important part of mathematics. This report aims
More informationLECTURE 22: COUNTABLE AND UNCOUNTABLE SETS
LECTURE 22: COUNTABLE AND UNCOUNTABLE SETS 1. Introduction To end the course we will investigate various notions of size associated to subsets of R. The simplest example is that of cardinality - a very
More informationChapter One Hilbert s 7th Problem: It s statement and origins
Chapter One Hilbert s 7th Problem: It s statement and origins At the second International Congress of athematicians in Paris, 900, the mathematician David Hilbert was invited to deliver a keynote address,
More informationTest 2. Monday, November 12, 2018
Test 2 Monday, November 12, 2018 Instructions. The only aids allowed are a hand-held calculator and one cheat sheet, i.e. an 8.5 11 sheet with information written on one side in your own handwriting. No
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 27
CS 70 Discrete Mathematics for CS Spring 007 Luca Trevisan Lecture 7 Infinity and Countability Consider a function f that maps elements of a set A (called the domain of f ) to elements of set B (called
More informationINFINITY: CARDINAL NUMBERS
INFINITY: CARDINAL NUMBERS BJORN POONEN 1 Some terminology of set theory N := {0, 1, 2, 3, } Z := {, 2, 1, 0, 1, 2, } Q := the set of rational numbers R := the set of real numbers C := the set of complex
More informationCONSEQUENCES OF POWER SERIES REPRESENTATION
CONSEQUENCES OF POWER SERIES REPRESENTATION 1. The Uniqueness Theorem Theorem 1.1 (Uniqueness). Let Ω C be a region, and consider two analytic functions f, g : Ω C. Suppose that S is a subset of Ω that
More informationZero estimates for polynomials inspired by Hilbert s seventh problem
Radboud University Faculty of Science Institute for Mathematics, Astrophysics and Particle Physics Zero estimates for polynomials inspired by Hilbert s seventh problem Author: Janet Flikkema s4457242 Supervisor:
More informationFunctions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B.
Chapter 4 Functions Definition 1 Let A and B be sets. A relation between A and B is any subset of A B. Definition 2 Let A and B be sets. A function from A to B is a relation f between A and B such that
More informationOne-to-one functions and onto functions
MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are
More informationAnnouncements. CS243: Discrete Structures. Sequences, Summations, and Cardinality of Infinite Sets. More on Midterm. Midterm.
Announcements CS43: Discrete Structures Sequences, Summations, and Cardinality of Infinite Sets Işıl Dillig Homework is graded, scores on Blackboard Graded HW and sample solutions given at end of this
More informationSome Background Material
Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important
More informationMath.3336: Discrete Mathematics. Cardinality of Sets
Math.3336: Discrete Mathematics Cardinality of Sets Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall 2018
More informationUniversity of Toronto Faculty of Arts and Science Solutions to Final Examination, April 2017 MAT246H1S - Concepts in Abstract Mathematics
University of Toronto Faculty of Arts and Science Solutions to Final Examination, April 2017 MAT246H1S - Concepts in Abstract Mathematics Examiners: D. Burbulla, P. Glynn-Adey, S. Homayouni Time: 7-10
More informationAutomatic Sequences and Transcendence of Real Numbers
Automatic Sequences and Transcendence of Real Numbers Wu Guohua School of Physical and Mathematical Sciences Nanyang Technological University Sendai Logic School, Tohoku University 28 Jan, 2016 Numbers
More informationChapter Two The transcendence of e and π.
Chapter Two The transcendence of e and π. The fantasy calculation at the end of the last lecture, a fantasy because the linear combination of the intermediate series I n did not vanish it is a positive
More informationFURTHER NUMBER THEORY
FURTHER NUMBER THEORY SANJU VELANI. Dirichlet s Theorem and Continued Fractions Recall a fundamental theorem in the theory of Diophantine approximation. Theorem. (Dirichlet 842). For any real number x
More informationSets and Infinity. James Emery. Edited: 2/25/ Cardinal Numbers 1. 2 Ordinal Numbers 6. 3 The Peano Postulates for the Natural Numbers 7
Sets and Infinity James Emery Edited: 2/25/2017 Contents 1 Cardinal Numbers 1 2 Ordinal Numbers 6 3 The Peano Postulates for the Natural Numbers 7 4 Metric Spaces 8 5 Complete Metric Spaces 8 6 The Real
More informationELLIPSES AND ELLIPTIC CURVES. M. Ram Murty Queen s University
ELLIPSES AND ELLIPTIC CURVES M. Ram Murty Queen s University Planetary orbits are elliptical What is an ellipse? x 2 a 2 + y2 b 2 = 1 An ellipse has two foci From: gomath.com/geometry/ellipse.php Metric
More informationThe cardinal comparison of sets
(B) The cardinal comparison of sets I think we can agree that there is some kind of fundamental difference between finite sets and infinite sets. For a finite set we can count its members and so give it
More informationMATH 3300 Test 1. Name: Student Id:
Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your
More informationSequences are ordered lists of elements
Sequences are ordered lists of elements Definition: A sequence is a function from the set of integers, either set {0,1,2,3, } or set {1,2,3,4,..}, to a set S. We use the notation a n to denote the image
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationREVIEW OF ESSENTIAL MATH 346 TOPICS
REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations
More information1 Functions and Graphs
1 Functions and Graphs 1.1 Functions Cartesian Coordinate System A Cartesian or rectangular coordinate system is formed by the intersection of a horizontal real number line, usually called the x axis,
More informationStandard forms for writing numbers
Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,
More information1 of 8 7/15/2009 3:43 PM Virtual Laboratories > 1. Foundations > 1 2 3 4 5 6 7 8 9 6. Cardinality Definitions and Preliminary Examples Suppose that S is a non-empty collection of sets. We define a relation
More informationLINEAR FORMS IN LOGARITHMS
LINEAR FORMS IN LOGARITHMS JAN-HENDRIK EVERTSE April 2011 Literature: T.N. Shorey, R. Tijdeman, Exponential Diophantine equations, Cambridge University Press, 1986; reprinted 2008. 1. Linear forms in logarithms
More informationCSE 311: Foundations of Computing. Lecture 26: Cardinality
CSE 311: Foundations of Computing Lecture 26: Cardinality Cardinality and Computability Computers as we know them grew out of a desire to avoid bugs in mathematical reasoning A brief history of reasoning
More informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 2 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 2 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 1.4.2, 1.4.4, 1.4.9, 1.4.11,
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationMA 301 Test 4, Spring 2007
MA 0 Test 4, Spring 007 hours, calculator allowed, no notes. Provide paper for the students to do work on. Students should not write answers on test sheet. TA Grades, 5, 6, 7 All answers must be justified.
More information2. Two binary operations (addition, denoted + and multiplication, denoted
Chapter 2 The Structure of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference between
More informationMath 3361-Modern Algebra Lecture 08 9/26/ Cardinality
Math 336-Modern Algebra Lecture 08 9/26/4. Cardinality I started talking about cardinality last time, and you did some stuff with it in the Homework, so let s continue. I said that two sets have the same
More informationMath 200 University of Connecticut
IRRATIONALITY OF π AND e KEITH CONRAD Math 2 University of Connecticut Date: Aug. 3, 25. Contents. Introduction 2. Irrationality of π 2 3. Irrationality of e 3 4. General Ideas 4 5. Irrationality of rational
More informationFundamentals of Pure Mathematics - Problem Sheet
Fundamentals of Pure Mathematics - Problem Sheet ( ) = Straightforward but illustrates a basic idea (*) = Harder Note: R, Z denote the real numbers, integers, etc. assumed to be real numbers. In questions
More informationSection 7.5: Cardinality
Section 7: Cardinality In this section, we shall consider extend some of the ideas we have developed to infinite sets One interesting consequence of this discussion is that we shall see there are as many
More informationLAURENT SERIES AND SINGULARITIES
LAURENT SERIES AND SINGULARITIES Introduction So far we have studied analytic functions Locally, such functions are represented by power series Globally, the bounded ones are constant, the ones that get
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #10: Sequences and Summations Based on materials developed by Dr. Adam Lee Today s Topics Sequences
More informationADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS
ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationNOTES ON DIOPHANTINE APPROXIMATION
NOTES ON DIOPHANTINE APPROXIMATION Jan-Hendrik Evertse January 29, 200 9 p-adic Numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics
More informationIRRATIONALITY OF π AND e
IRRATIONALITY OF π AND e KEITH CONRAD. Introduction Numerical estimates for π have been found in records of several ancient civilizations. These estimates were all based on inscribing and circumscribing
More informationJust like the ring of Gaussian integers, the ring of Eisenstein integers is a Unique Factorization Domain.
Fermat s Infinite Descent PMATH 340 Assignment 6 (Due Monday April 3rd at noon). (0 marks) Use Femtat s method of infinite descent to prove that the Diophantine equation x 3 + y 3 = 4z 3 has no solutions
More information(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define
Homework, Real Analysis I, Fall, 2010. (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define ρ(f, g) = 1 0 f(x) g(x) dx. Show that
More informationLet π and e be trancendental numbers and consider the case:
Jonathan Henderson Abstract: The proposed question, Is π + e an irrational number is a pressing point in modern mathematics. With the first definition of transcendental numbers coming in the 1700 s there
More informationIn Exercises 1 12, list the all of the elements of the given set. 2. The set of all positive integers whose square roots are less than or equal to 3
APPENDIX A EXERCISES In Exercises 1 12, list the all of the elements of the given set. 1. The set of all prime numbers less than 20 2. The set of all positive integers whose square roots are less than
More informationDIFFERENTIABILITY OF A PATHOLOGICAL FUNCTION, DIOPHANTINE APPROXIMATION, AND A REFORMULATION OF THE THUE-SIEGEL-ROTH THEOREM
DIFFERENTIABILITY OF A PATHOLOGICAL FUNCTION, DIOPHANTINE APPROXIMATION, AND A REFORMULATION OF THE THUE-SIEGEL-ROTH THEOREM JUAN LUIS VARONA Abstract. We study the differentiability of the real function
More informationOutline Goals and Assumptions Real Numbers Rational and Irrational. L11: Numbers. Alice E. Fischer
L11: Numbers Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing March 5-8, 2018 1 Goals and Assumptions 2 Real Numbers 3 Rational and Irrational Assumptions We rely the following assumptions:
More informationAuxiliary functions in transcendence proofs
AWS Lecture 4 Tucson, Monday, March 17, 2008 Auxiliary functions in transcendence proofs Abstract Transcendence proofs most often involve an auxiliary function. Such functions can take several forms. Historically,
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
More informationA Readable Introduction to Real Mathematics
Solutions to selected problems in the book A Readable Introduction to Real Mathematics D. Rosenthal, D. Rosenthal, P. Rosenthal Chapter 10: Sizes of Infinite Sets 1. Show that the set of all polynomials
More information4th Preparation Sheet - Solutions
Prof. Dr. Rainer Dahlhaus Probability Theory Summer term 017 4th Preparation Sheet - Solutions Remark: Throughout the exercise sheet we use the two equivalent definitions of separability of a metric space
More informationAn Invitation to Modern Number Theory. Steven J. Miller and Ramin Takloo-Bighash PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD
An Invitation to Modern Number Theory Steven J. Miller and Ramin Takloo-Bighash PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Contents Foreword Preface Notation xi xiii xix PART 1. BASIC NUMBER THEORY
More informationDiscrete Mathematics 2007: Lecture 5 Infinite sets
Discrete Mathematics 2007: Lecture 5 Infinite sets Debrup Chakraborty 1 Countability The natural numbers originally arose from counting elements in sets. There are two very different possible sizes for
More information1 Sequences and Summation
1 Sequences and Summation A sequence is a function whose domain is either all the integers between two given integers or all the integers greater than or equal to a given integer. For example, a m, a m+1,...,
More informationA Primer on Intuitive Set Theory
A Primer on Intuitive Set Theory Sam Smith January 2005 No one shall expel us from the paradise which Cantor has created for us. David Hilbert Introduction. In these notes, we give highlights of the theory
More informationMathematics 324 Riemann Zeta Function August 5, 2005
Mathematics 324 Riemann Zeta Function August 5, 25 In this note we give an introduction to the Riemann zeta function, which connects the ideas of real analysis with the arithmetic of the integers. Define
More informationPrime Numbers and Irrational Numbers
Chapter 4 Prime Numbers and Irrational Numbers Abstract The question of the existence of prime numbers in intervals is treated using the approximation of cardinal of the primes π(x) given by Lagrange.
More informationChapter Four Gelfond s Solution of Hilbert s Seventh Problem (Revised January 2, 2011)
Chapter Four Gelfond s Solution of Hilbert s Seventh Problem (Revised January 2, 2011) Before we consider Gelfond s, and then Schneider s, complete solutions to Hilbert s seventh problem let s look back
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationBjorn Poonen. MSRI Introductory Workshop on Rational and Integral Points on Higher-dimensional Varieties. January 18, 2006
University of California at Berkeley MSRI Introductory Workshop on Rational and Integral Points on Higher-dimensional Varieties January 18, 2006 The original problem H10: Find an algorithm that solves
More informationLebesgue Measure on R n
CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationNotes on Equidistribution
otes on Equidistribution Jacques Verstraëte Department of Mathematics University of California, San Diego La Jolla, CA, 92093. E-mail: jacques@ucsd.edu. Introduction For a real number a we write {a} for
More informationStanford University CS366: Graph Partitioning and Expanders Handout 13 Luca Trevisan March 4, 2013
Stanford University CS366: Graph Partitioning and Expanders Handout 13 Luca Trevisan March 4, 2013 Lecture 13 In which we construct a family of expander graphs. The problem of constructing expander graphs
More informationAlgebra II Vocabulary Word Wall Cards
Algebra II Vocabulary Word Wall Cards Mathematics vocabulary word wall cards provide a display of mathematics content words and associated visual cues to assist in vocabulary development. The cards should
More informationNotes on Complex Analysis
Michael Papadimitrakis Notes on Complex Analysis Department of Mathematics University of Crete Contents The complex plane.. The complex plane...................................2 Argument and polar representation.........................
More informationThe Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018)
The Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018) From the webpage of Timithy Kohl, Boston University INTRODUCTION Note. We will consider infinity from two different perspectives:
More information8. Dirichlet s Theorem and Farey Fractions
8 Dirichlet s Theorem and Farey Fractions We are concerned here with the approximation of real numbers by rational numbers, generalizations of this concept and various applications to problems in number
More informationMORE CONSEQUENCES OF CAUCHY S THEOREM
MOE CONSEQUENCES OF CAUCHY S THEOEM Contents. The Mean Value Property and the Maximum-Modulus Principle 2. Morera s Theorem and some applications 3 3. The Schwarz eflection Principle 6 We have stated Cauchy
More informationHMMT February 2018 February 10, 2018
HMMT February 018 February 10, 018 Algebra and Number Theory 1. For some real number c, the graphs of the equation y = x 0 + x + 18 and the line y = x + c intersect at exactly one point. What is c? 18
More informationNumbers 1. 1 Overview. 2 The Integers, Z. John Nachbar Washington University in St. Louis September 22, 2017
John Nachbar Washington University in St. Louis September 22, 2017 1 Overview. Numbers 1 The Set Theory notes show how to construct the set of natural numbers N out of nothing (more accurately, out of
More informationExistence of a Limit on a Dense Set, and. Construction of Continuous Functions on Special Sets
Existence of a Limit on a Dense Set, and Construction of Continuous Functions on Special Sets REU 2012 Recap: Definitions Definition Given a real-valued function f, the limit of f exists at a point c R
More informationKolmogorov complexity
Kolmogorov complexity In this section we study how we can define the amount of information in a bitstring. Consider the following strings: 00000000000000000000000000000000000 0000000000000000000000000000000000000000
More informationSolutions to Assignment 1
Solutions to Assignment 1 Question 1. [Exercises 1.1, # 6] Use the division algorithm to prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k. For each positive
More informationReal Analysis - Notes and After Notes Fall 2008
Real Analysis - Notes and After Notes Fall 2008 October 29, 2008 1 Introduction into proof August 20, 2008 First we will go through some simple proofs to learn how one writes a rigorous proof. Let start
More information1 Partitions and Equivalence Relations
Today we re going to talk about partitions of sets, equivalence relations and how they are equivalent. Then we are going to talk about the size of a set and will see our first example of a diagonalisation
More informationMath Topics in Algebra Course Notes: A Proof of Fermat s Last Theorem. Spring 2013
Math 847 - Topics in Algebra Course Notes: A Proof of Fermat s Last Theorem Spring 013 January 6, 013 Chapter 1 Background and History 1.1 Pythagorean triples Consider Pythagorean triples (x, y, z) so
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014 1. Please write your 1- or 2-digit exam number on
More informationCHAPTER 8: EXPLORING R
CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed
More informationMATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 2: Countability and Cantor Sets
MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION Chapter 2: Countability and Cantor Sets Countable and Uncountable Sets The concept of countability will be important in this course
More informationDIOPHANTINE APPROXIMATION AND CONTINUED FRACTIONS IN POWER SERIES FIELDS
DIOPHANTINE APPROXIMATION AND CONTINUED FRACTIONS IN POWER SERIES FIELDS A. LASJAUNIAS Avec admiration pour Klaus Roth 1. Introduction and Notation 1.1. The Fields of Power Series F(q) or F(K). Let p be
More informationA Universal Turing Machine
A Universal Turing Machine A limitation of Turing Machines: Turing Machines are hardwired they execute only one program Real Computers are re-programmable Solution: Universal Turing Machine Attributes:
More informationCSE 4111/5111/6111 Computability Jeff Edmonds Assignment 3: Diagonalization & Halting Problem Due: One week after shown in slides
CSE 4111/5111/6111 Computability Jeff Edmonds Assignment 3: Diagonalization & Halting Problem Due: One week after shown in slides First Person: Second Person: Family Name: Family Name: Given Name: Given
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 20. To Infinity And Beyond: Countability and Computability
EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 0 To Infinity And Beyond: Countability and Computability This note ties together two topics that might seem like they have
More informationContinued fractions for complex numbers and values of binary quadratic forms
arxiv:110.3754v1 [math.nt] 18 Feb 011 Continued fractions for complex numbers and values of binary quadratic forms S.G. Dani and Arnaldo Nogueira February 1, 011 Abstract We describe various properties
More informationPrinciples of Real Analysis I Fall I. The Real Number System
21-355 Principles of Real Analysis I Fall 2004 I. The Real Number System The main goal of this course is to develop the theory of real-valued functions of one real variable in a systematic and rigorous
More informationA Short Review of Cardinality
Christopher Heil A Short Review of Cardinality November 14, 2017 c 2017 Christopher Heil Chapter 1 Cardinality We will give a short review of the definition of cardinality and prove some facts about the
More informationIowa State University. Instructor: Alex Roitershtein Summer Exam #1. Solutions. x u = 2 x v
Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 Exam #1 Solutions This is a take-home examination. The exam includes 8 questions.
More informationCarnegie Learning High School Math Series: Algebra I Indiana Standards Worktext Correlations
Real Numbers and Expressions AI.RNE.1 Understand the hierarchy and relationships of numbers and sets of numbers within the real number system. 14 Real Number Systems AI.RNE.2 Explain why the sum or product
More informationECS 120 Lesson 18 Decidable Problems, the Halting Problem
ECS 120 Lesson 18 Decidable Problems, the Halting Problem Oliver Kreylos Friday, May 11th, 2001 In the last lecture, we had a look at a problem that we claimed was not solvable by an algorithm the problem
More informationThe ABC Conjecture and its Consequences on Curves
The ABC Conjecture and its Consequences on Curves Sachi Hashimoto University of Michigan Fall 2014 1 Introduction 1.1 Pythagorean Triples We begin with a problem that most high school students have seen
More informationZair Ibragimov CSUF. Talk at Fullerton College July 14, Geometry of p-adic numbers. Zair Ibragimov CSUF. Valuations on Rational Numbers
integers Talk at Fullerton College July 14, 2011 integers Let Z = {..., 2, 1, 0, 1, 2,... } denote the integers. Let Q = {a/b : a, b Z and b > 0} denote the rational. We can add and multiply rational :
More information8th Grade The Number System and Mathematical Operations Part
Slide 1 / 157 Slide 2 / 157 8th Grade The Number System and Mathematical Operations Part 2 2015-11-20 www.njctl.org Slide 3 / 157 Table of Contents Squares of Numbers Greater than 20 Simplifying Perfect
More informationAlgebra I Unit 1: Data & Functions
Unit 1: Data & Functions equations, graphs, and tables; translate fluently among these representations. AI.DS.6: Understand that statistics and data are non-neutral and designed to serve a particular interest.
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationMATH 2400: PRACTICE PROBLEMS FOR EXAM 1
MATH 2400: PRACTICE PROBLEMS FOR EXAM 1 PETE L. CLARK 1) Find all real numbers x such that x 3 = x. Prove your answer! Solution: If x 3 = x, then 0 = x 3 x = x(x + 1)(x 1). Earlier we showed using the
More informationCSE 311: Foundations of Computing. Lecture 26: More on Limits of FSMs, Cardinality
CSE 311: Foundations of Computing Lecture 26: More on Limits of FSMs, Cardinality Last time: Languages and Representations All Context-Free??? Prove there is Regular a context-free DFA language 0* NFA
More information