LECTURE 3. RATIONAL NUMBERS: AN EXAMPLE OF MATHEMATICAL CONSTRUCT

Similar documents
1.1.1 Algebraic Operations

1. Introduction to commutative rings and fields

1. Introduction to commutative rings and fields

Practical Algebra. A Step-by-step Approach. Brought to you by Softmath, producers of Algebrator Software

Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur

Math Precalculus I University of Hawai i at Mānoa Spring

FACTORIZATION AND THE PRIMES

The natural numbers. The natural numbers come with an addition +, a multiplication and an order < p < q, q < p, p = q.

Finite Fields: An introduction through exercises Jonathan Buss Spring 2014

The Integers. Peter J. Kahn

CHAPTER 1: Functions

Mathematical Reasoning & Proofs

Constructions with ruler and compass.

Study Guide for Math 095

A NEW SET THEORY FOR ANALYSIS

Outline. We will now investigate the structure of this important set.

2. Introduction to commutative rings (continued)

AQA Level 2 Further mathematics Further algebra. Section 4: Proof and sequences

Basic counting techniques. Periklis A. Papakonstantinou Rutgers Business School

Math Precalculus I University of Hawai i at Mānoa Spring

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models

Lecture 6: Finite Fields

Comparison of Virginia s College and Career Ready Mathematics Performance Expectations with the Common Core State Standards for Mathematics

Math 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution

Section 3.1 Quadratic Functions

CHAPTER 1. REVIEW: NUMBERS

1 Introduction. 2 Solving Linear Equations. Charlotte Teacher Institute, Modular Arithmetic

n n P} is a bounded subset Proof. Let A be a nonempty subset of Z, bounded above. Define the set

Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur. Lecture 1 Real Numbers

CHAPTER 3: THE INTEGERS Z

What can you prove by induction?

Seunghee Ye Ma 8: Week 2 Oct 6

Studying Rudin s Principles of Mathematical Analysis Through Questions. August 4, 2008

Math 123, Week 2: Matrix Operations, Inverses

Math 1302 Notes 2. How many solutions? What type of solution in the real number system? What kind of equation is it?

CHAPTER 1: Review (See also the Precalculus notes at

Complex Numbers. Rich Schwartz. September 25, 2014

0.Axioms for the Integers 1

A Guide to Proof-Writing

Chapter 1. Sets and Numbers

All About Numbers Definitions and Properties

CHMC: Finite Fields 9/23/17

R1: Sets A set is a collection of objects sets are written using set brackets each object in onset is called an element or member

Symmetries and Polynomials

Fundamentals of Pure Mathematics - Problem Sheet

The Integers. Math 3040: Spring Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers Multiplying integers 12

SOME AMAZING PROPERTIES OF THE FUNCTION f(x) = x 2 * David M. Goldschmidt University of California, Berkeley U.S.A.

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Checking Consistency. Chapter Introduction Support of a Consistent Family

Chapter One Complex Numbers

Chapter 1 Review of Equations and Inequalities

Weekly Activities Ma 110

Chapter 7 Quadratic Equations

Lecture 4: Constructing the Integers, Rationals and Reals

PHIL 422 Advanced Logic Inductive Proof

Math Review. for the Quantitative Reasoning measure of the GRE General Test

PEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION. The Peano axioms

Proof Techniques (Review of Math 271)

Coach Stones Expanded Standard Pre-Calculus Algorithm Packet Page 1 Section: P.1 Algebraic Expressions, Mathematical Models and Real Numbers

0. Introduction 1 0. INTRODUCTION

CONSTRUCTION OF sequence of rational approximations to sets of rational approximating sequences, all with the same tail behaviour Definition 1.

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 5

At the start of the term, we saw the following formula for computing the sum of the first n integers:

CM10196 Topic 2: Sets, Predicates, Boolean algebras

ALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS.

3 The language of proof

MCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof

Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 5 December 2010

CISC-102 Fall 2017 Week 3. Principle of Mathematical Induction

Part 2 Number and Quantity

CHAPTER 0: BACKGROUND (SPRING 2009 DRAFT)

The Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018)

West Windsor-Plainsboro Regional School District Algebra Grade 8

ELLIPTIC CURVES BJORN POONEN

MATH 426, TOPOLOGY. p 1.

Why write proofs? Why not just test and repeat enough examples to confirm a theory?

1.1 Basic Algebra. 1.2 Equations and Inequalities. 1.3 Systems of Equations

8.5 Taylor Polynomials and Taylor Series

A Harvard Sampler. Evan Chen. February 23, I crashed a few math classes at Harvard on February 21, Here are notes from the classes.

Abstract. 2. We construct several transcendental numbers.

CSE 1400 Applied Discrete Mathematics Proofs

What is proof? Lesson 1

New York Tutorials are designed specifically for the New York State Learning Standards to prepare your students for the Regents and state exams.

Math Circle: Recursion and Induction

Chapter 1A -- Real Numbers. iff. Math Symbols: Sets of Numbers

Chapter P. Prerequisites. Slide P- 1. Copyright 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

PUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.

Algebra II Vocabulary Alphabetical Listing. Absolute Maximum: The highest point over the entire domain of a function or relation.

GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS

Math From Scratch Lesson 24: The Rational Numbers

DR.RUPNATHJI( DR.RUPAK NATH )

Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10

Algebra 2 Early 1 st Quarter

Incompatibility Paradoxes

Boolean Algebras. Chapter 2

CALC 2 CONCEPT PACKET Complete

Analysis of California Mathematics standards to Common Core standards Algebra I

ACCUPLACER MATH 0311 OR MATH 0120

THE TEACHER UNDERSTANDS THE REAL NUMBER SYSTEM AND ITS STRUCTURE, OPERATIONS, ALGORITHMS, AND REPRESENTATIONS

Transcription:

ANALYSIS FOR HIGH SCHOOL TEACHERS LECTURE 3. RATIONAL NUMBERS: AN EXAMPLE OF MATHEMATICAL CONSTRUCT ROTHSCHILD CAESARIA COURSE, 2011/2 1. Rational numbers: how to define them? Rational numbers were discovered because not all equations were solvable in the set of the natural numbers, and adding negative integers did not solve the problem completely. The equation qx = p, p, q Z can be solved in x Z if and only if p is divisible by q. In particular, for p = 1 it never has a solution (unless q = ±1). Meanwhile, solving was required by practical purposes: we know that somehow we need to add fractions to whole numbers to describe the world. But what is a fraction? We can split an apple or divide a segment into equal parts, but how about dividing the indivisible? The solution is straightforward. What we need is to construct a larger set containing all integer numbers Z, adding some new numbers which we want to obey the same rules as the usual integers. This includes arithmetic operations ±,, /, the order properties (possibility to use meaningfully the inequalities >, < and the derived non-strict inequalities,. In addition we want only one thing: solvability of all equations qx = p with integer p, q. Can we do that? Back to the childhood. Note that unlike apples or segments, which we can cut into equal pieces, the natural numbers have no intrinsic structure, they are indivisible just like atoms. The only things that we know about them is that they can be counted, i.e., each number n has a unique successor, denoted by n + 1, which follows n in the natural row. Knowing what is the successor, we at the same time know how to add one to any number. How to add 2? Take successor to successor. How to add an arbitrary number m? By induction: if we know how to add m 1, then to add m just take the successor to the previous result. Knowing the successor, we know the order: n is bigger than m, if n appears after m, i.e., among the successors to m, and not vice versa. This is, staying on one leg, the idea behind the Peano axiomatic theory of natural numbers. Date: November 8, 2011. 1

2 ROTHSCHILD CAESARIA COURSE, 2011/2 Problem 1. In this axiomatic system, the rule n+m = m+n is not an axiom, but a theorem! Indeed, the left hand side is the mth consecutive successor to the number n, and the right hand side is the nth successor to m. Such obvious theorems still need formal demonstration... In most cases such demonstrations can be easily done by induction. Start with the identity n + 1 = 1 + n, prove it by induction in n, and then prove the general case by induction in m. Of course, usually you don t need to go that close to the axiom, yet the possibility of theoretically doing that is the cornerstone of our confidence in the foundations of mathematics. Negative integers as solutions to the equation x + n = m. This equation means the following: how many times we need to count (compute successors) starting from n to reach m. This equation has a solution if m > n but no solution (at least, no natural solution) when m n. To make the equation solvable, we can proceed by two different ways. One is to introduce the operation precursor, inverse for the successor whenever possible, and then add infinitely many numbers 0=precursor(1), 1=precursor(0), 2=precursor( 1) etc. Here the notation n stands for the new imaginary numbers which are different from all what we had before. Then you need to develop the rules of arithmetics on these numbers, using the established rules for N and the new rule precursor(successor(x))=successor(precursor(x)) for any number, natural or imaginary. Alternatively, we can add new numbers simply as solutions to the nonsolvable equations. Let us formally introduce 1 the symbols D n,m for the solutions of the equations x + n = m, n, m N. What we know is that when m > n, these symbols are well-defined numbers: D n,m = m n if m, n N, m > n. Do we know anything else about these numbers? Well, we know that some of them are equal to each other. For instance, D n,n = D m,m for any two n, m N. Why? Assume that m > n, so that the number p = m n is well-defined, p N. Consider the equation x + n = n (definition of D n,n ) and add the same p to both sides. We conclude that the same x which solves this equation, solves also the equation x+m = m, thus proving that D n,n = D m,m. Denote (surprise!) this new number by the new symbol 0, absent in the natural row N. By construction, 0 + n = n for any natural n N. Reasoning the same way, we see that for any p N we have D n+p,m+p = D n,m and, more generally, that D p,q = D m,n if and only if n + q = m + p. (1) This allows us to identify different numbers D n,m between themselves. How one can define the addition/subtraction for these numbers? Again, by considering the equations. Let x = D n,m and y = D p,q be two new numbers, 1 Was it difficult to guess that D n,m stands for the difference m n in this specified order?

solving the respective equations ANALYSIS FOR HIGH SCHOOL TEACHERS 3 x + n = m, y + p = q, n, m, p, q N. Adding these equations together, we see that x + y formally solves the equation (x + y) + (n + p) = m + q, that is, can be written as D n+p,m+q, which gives us the addition rule D n,m + D p,q = D n+p,m+q. (2) One can (and should indeed) verify that this operation of addition on the new symbols is commutative and associative in the same way as the usual addition of natural numbers is. What about solvability of equations in the new number set? Well, by definition all equations with old (natural) coefficients are solvable. But what if we consider equations with the new coefficients? Can one solve the equation x+d n,m = D p,q? It turns out that we can solve all such equations! Indeed, we can always replace D p,q by the same new number D p+n,q+n with a very large number N. Yet if N is large enough, we will have both inequalities p + N > n, q + N > m. Then the difference D p+n n,q+n m is well-defined (both indices are natural!) and clearly satisfies the required equation by the (2). To conclude our reasoning, we summarize the achievements. Starting from the natural number N, we introduced formal bi-index symbols D n,m, n, m N, with the following properties: (1) They can be added between themselves by application of the rule (2); (2) They are equal if and only if the identities (1) are satisfied; (3) The old natural numbers correspond to a proper subset of these symbols (those D n,m with m > n correspond to m n N); (4) Any equation x + D n,m = D p,q is always solvable by a suitable symbol; (5) There is the operation on these symbols, defined by the rule D n,m D p,q = D n,m + D q,p ; this operation is inverse to the addition, meaning that (x + y) y = (x y) + y = x for any symbol x. From now one we could operate with these symbols exactly as we operated with the natural numbers, however, it would lead to a too heavy notation and lots of redundancy because of the non-uniqueness of such notation. Instead we can denote 0 = D 1,1 = D 2,2 =..., 1 = D 2,1 = D 3,2 =..., 2 = D 3,1 = D 4,2 =..., etc., and have a unique representation. Any number would be either n N, 0 or m, m N, with the obvious rules of summation across the groups, m n if m > n, m + n = 0 if m = n, n + m = n + m. n m if m < n, Note finally that any number n is the root of equation x + n = 0 and hence can be formally written as 0 n (note that the subtraction is already understood in the new sense and hence is completely legal!) This leads to the familiar notation if we drop the zeros from all additive formulas.

4 ROTHSCHILD CAESARIA COURSE, 2011/2 2. Rational numbers as roots of equations In the same way as before, we can try to introduce non-integer numbers via the equations they satisfy. One can start with the general linear equations of the form ax+b = c with a, b, c N, but since the task of building the negative integers is already completed and the subtraction is well defined, we can restrict the specter by the equations of the form qx = p, q, p Z. (3) As before, we denote by the symbol R pq the new number denoting the root of the equation (3). Clearly, if p is divisible by q, we can identify the corresponding symbol R pq with the integer number p/q Z. Apriori, we do not exclude the symbols R p0 from consideration: we will have to do that on a later stage, when trying to define the arithmetic operations with the symbols R pq. One obvious exception at this moment is R 00 : the corresponding equation clearly has non-unique solution even over Z. For any p, q Z, the symbols R pq and R sp,sq should be declared equal for s Z (and of course, s 0). In particular, we have 0 = R 0q for all q 0. Conversely, we still can consider the element = R 10 = R p0 for any p 0. The standard argument similar to (2) shows that the multiplication rule should be defined as follows, R nm R pq = R pn,mq, n, m, p, q Z, (4) and in order to avoid equations of the sort 0 = 0, we have to assume that pn 0 and mq 0 simultaneously. In particular, =, but 0 is undefined. The inverse operation of division is defined using the same trick: the linear equation is always explicitly solvable, R nm x = R pq x = R pm,qn, n, m, p, q Z, with the constraint that the ratios R 01 : R 01 = 0 : 0 and R 10 : R 10 = : are both undefined. Finally, we can define the addition/subtraction of the new numbers x = R mn and y = R pq by transforming their defining equations as follows: mx = n, qy = p qmx = qn, qmy = pm (5) qm(x ± y) = qn ± pm = x ± y = R qn±pm,nq (6) This, of course, corresponds to the usual rule of addition/subtraction of fractions, with the newly found number = R 10 behaving somewhat wildly: a = R pq =, ± a = R q0 =, ± undefined. In other words, introducing the new number will make the new numbers inconsistent with the structure of the old operations + and : they may cease to be defined!

ANALYSIS FOR HIGH SCHOOL TEACHERS 5 At this moment we need to make a critical choice: to keep the bullet or to drop it from the new number system. In fact, both options are possible, but the choice determines the watershed between Algebra and Geometry (Analysis). (Projective) Geometry. Allowing means (eventually) adding the infinite point to the real line. After this addition the line becomes more like a circle: if you move along the real line in the positive direction, then you reach the point after passing by all positive numbers, but if you continue beyond, you suddenly find yourself deep into the negative part (think of the behavior of the function 1/x as x moves from 1 to zero and then continues to the negative side). The corresponding object, denoted by QP 1, is called the projective (rational) line, and is important for algebraic geometry. If instead of the real numbers you add to the complex plane (of the numbers of the form x + iy, x, y R), then the result will be like a sphere (the Riemann sphere), called the complex projective line and denoted by CP 1. The idea of adding ideal elements at infinity is enormously rich: in particular, in geometry it allows to add a precise meaning to the statement that two parallel lines intersect at infinity. Moreover, it allows to greatly unify many statements, excluding from them the degenerate particular cases. Geometry without parallels is in many respects more natural! Algebra: the traditionalist approach. The other way is to explicitly exclude and stick to the statement that the equation of the form 0x = 1 has no solution under any circumstances. The immediate plus is that for the corresponding numbers, denoted by Q and identified with the symbols R pq with q 0, the addition/substraction always make sense, whereas the multiplication can be inverted only for nonzero elements. In this world there is no actual infinity, thus a substitute for it has to be constructed on a different way. 3. Exercises Example 1. Prove that in any number system there can be only one zero. Here by any number system we mean a set of elements with the associative operation + always defined and always invertible, meaning that any equation of the form a + x = b is always solvable. Zero, denoted by 0, is any element whose addition (subtraction) does not change anything, and it exists in any number system as the solution of the equation a + x = a. Mathematics refers to such number system as a commutative group (in the additive notation). Do you know what a group is? What is commutativity? Solution. Assume that there are two such elements, 0 and 0. Then 0 = 0 + 0 = 0.

6 ROTHSCHILD CAESARIA COURSE, 2011/2 Example 2. Prove that in any number system the product 0 a is always zero. Here by any number system we mean a set with two operations, + and, related by the usual rules, with the addition being always invertible. Mathematics call such number system as a commutative ring with unit. Solution. By definition, 0 = 0 + 0. Thus for any numbers a in our system (ring), 0 = a 0 a 0 = a (0 + 0) a 0 = a 0 + (a 0 a 0) = a 0. Thus the equation 0x = b has no solution in any ring. We can (and will) live with that. Finally, the meaning of Q. Now we can give the definition. Definition 1. The rational numbers Q is the set of all symbols R pq with p, q Z, q 0, with the symbols R pq and R sp,sq considered equal ( equivalent ). The set Z is identified with a subset of Q by the formula p = R p1, in particular, 0 = R 01 = R 0q, q 0. The arithmetic operations ±,, / on rational numbers are defined using the rules (4) (5). Addition is always invertible, while the division is allowed only by nonzero rational numbers. In the future we will revert to the traditional notation and replace the symbol R ab by the fractional notation, R ab = a/b = a b = a : b (all three notations are equally legal). 4. Irrational numbers All linear equations of the form ax + b = 0 with a 0, a, b Q, are solvable in the rational numbers. However, algebraic equations of a higher degree can be without rational solutions. Consider two following examples: x 2 2 = 0, (7) x 2 + 1 = 0. (8) In both cases we can proceed in a similar way, adding formally the missing elements and then learning how to operate with them. Adjoining the square root of 2. Denote the root of the equation x 2 = 2 by. Formally this means that we add a new element / Q to the set of rational numbers and see what other elements will have to be added then, if we want the enlarged (extended) set to form again the field (i.e., the set closed by addition/subtraction, multiplication and division by a nonzero number). Obviously, all numbers of the form r + s, r, s Q, have to be added. Moreover, no two such representations can be the same number. Indeed, the only number representing 0 must necessarily be of the form 0 + 0, since the element is not in Q and cannot be a ratio of two numbers s/r Q.

ANALYSIS FOR HIGH SCHOOL TEACHERS 7 The identity 2 = 2, resulting from the definition of, means that no higher powers of are required: 2 = 2, 3 = 2, 4 = 4,..., 2n = 2 n, 2n+1 = 2 n,... Thus the minimal ring containing both Q and, denoted usually by Q[ ], coincides with the set of combinations Q + Q (how do you understand this notation?) This ring in fact is a field, i.e., any nonzero element r + s, has an (unique) inverse. To see this, look at the identity (r + s ) (r s ) = r 2 s 2 2 = r 2 2s 2. The right hand side is zero only if r = 0 and s = 0, since the equation (7) has no rational solutions. Besides, this is a genuine ( original ) rational number, by which we can divide both sides of the equality: 1 r + s = r r 2 2s 2 s r 2 2s 2 = r + s. Thus any nonzero combination is invertible, and we proved that Q[ ] is in fact a field. In this case a more traditional notation is Q( ) or, avoiding the esoteric symbol, Q( 2). Remark 1 (First encounter with the Galois group). An attentive reader may note that the construction of the extended field Q( 2) is slightly ambivalent. Informally this comes from the fact that the equation x 2 = 2 has two solutions. Whatever of them we denote by, its negative is also a solution which could be used to build the extension in exactly the same way. Thus there are two different ways to adjoin the root of the equation (7) (which is not surprising, after all: we have only the equation in our disposal, and all its roots should enjoy the equal rights). To formalize this observation, we say, following Évariste Galois, that there is a map S : Q( ) Q( ), which sends each element into its conjugate, r + s S r s. This map is: a mirror reflection S S = id, i.e., S(S(z)) = z for all z Q( ), respects both field operations, S(zw) = S(z) S(w), S(z ± w) = S(z) ± S(w) for any two elements z, w Q( ), preserves the old (original) rational numbers, S(r) = r for any r Q. All such maps obviously form a group, which is called the Galois group of the extension Q( ) (over Q, to be precise). Adjoining roots of more complicated equations to the field Q results in different fields with different Galois groups. It turns out that the combinatorial (algebraic) structure of the Galois group allows to decide, whether the initial equation is solvable in the radicals or not.

8 ROTHSCHILD CAESARIA COURSE, 2011/2 Complexification of rational numbers. In a completely similar way we may add a number as a root of the equation (8). Adjoining to Q immediately leads us to consideration of the numbers of the form r + s with r, s Q. Addition and subtraction of such numbers follows the obvious rules. The multiplication is also possible because of the identities 2 = 1, 3 =,, 4 = 1,... (the sequence is periodic with period 4). The conjugate r s satisfies the identity (r + s )(r s ) = r 2 ( s 2 ) = r 2 + s 2 Q, nonzero if r 0, s 0. Thus all nonzero elements are invertible, 1 r + s = r r 2 + s 2 s r 2 + s 2, and Q( ) is indeed a field, more traditionally denoted as Q( 1). As in the case of Q( 2), the field is defined uniquely modulo the mirror symmetry which sends each number into its conjugate. On the level of abstract algebraic manipulations, the two fields are very similar, although one feels that the numbers from Q( 2) are real, whereas the numbers from Q( 1) are unreal. The explanation of the difference comes from consideration of the order, see the next lecture. Remark 2. Adjoining = 2 or even = 1 does not imply automatically that other quadratic equations will be solvable. For instance, the equation x 2 = 3 has no solutions in Q( 2), and the equation x 2 = 2 is not solvable in Q( 1), though the equation x 2 = 4 is. One can adjoin roots of all quadratic equations simultaneously and consider numbers of the form a + b c with a, b, c Q. This representation is already non-unique (in the same way as different fractions can be reducible to the same rational number), yet clearly numbers of such form constitute a field (prove that!). Yet the equation x 2 = p+q r with p, q, r Q may well be non-solvable in the numbers of the form a+b c with a, b, c Q (can you give an example?), thus the process of constructing a field closed by the root extraction is not a simple task. Problem 2. Prove that x 2 = 3 is not solvable in Q( 2). Hint: assume that x = r + s 2 is a solution. Then 3 = x 2 = (r 2 + 2s 2 ) + 2rs 2. Prove that this is impossible for any rational r, s.