Dedekind Cuts. Rich Schwartz. September 17, 2014

Save this PDF as:

Size: px
Start display at page:

Transcription

1 Dedekind Cuts Rich Schwartz September 17, Decimal Expansions How would you define a real number? It would seem that the easiest way is to say that a real number is a decimal expansion of the form N.d 1 d 2 d 3..., where N is one of 0,1,2,3,... and each digit d k is one of 0,...,9. You could then say that the above decimal expansion represents the number N + d d d However, this is circular! What does this infinite sum mean in terms of the supposed definition? You have to define the reals before you can make sense of these kinds of sums. Alternatively, you could define the reals in terms of decimal expansions, forget about the sum, and just work out all their properties from the crazy algorithms you ve already learned about adding and multiplying decimal expansions. This is kind of a nightmare. A better approach is to define the reals in some other way and then use the decimal expansion as a way of naming one of the real numbers. The sum then explains which real number the decimal expansion names. The question remains: how do you define a real number? That is what these notes are about. In the first part of the notes, I ll explain what we d want out of real numbers, and then in the second part, I ll explain how you get what you want using something called Dedekind cuts. The basic problem with the rational numbers is that the rational number system has holes in it missing numbers. The beauty of Dedekind cuts is that it gives a formal way to talk about these holes purely in terms of rational numbers. 1

2 2 What do We Want First of all, we want the real numbers to retain all the basic arithmetic operations defined on rational numbers. Precisely, the rationals satisfy the following properties. There are operations + and defined on the set of rational numbers. a+b = b+a and a b = b a. a+(b+c) = (a+b)+c and (a b) c = a (b c). a (b+c) = a b+a c. The 0 element has the property that a+0 = a for all a. The 1 element has the property that a 1 = a for all a. For any a there is some b such that a+b = 0. For any nonzero a there is some b such that a b = 1. We could also list properties of subtraction and division, but these are consequences of what we ve already listed. For instance, you could define a b to be a+b where b is such that b+b = 0. A set which satisfies the above properties is called a field. So, basically everything you learn in math until middle school, more or less, can be summarized in the sentence that the rational numbers form a field. We want the real numbers to form a field. The rational numbers have their usual ordering on them, and it satisfies two properties. For any rationals a and b we have either a < b or a = b or b < a. If a < b and b < c then a < c. The ordering on the rationals is compatible with the field operations. For instance if a < b then a+c < b+c. Likewise if a < b and c > 0 then ac < bc. All these properties make the rationals into an ordered field. We want the reals to be an ordered field. The one additional property that we want out of the real numbers is that therealnumbersystemshouldnothaveanyholesinit. BelowI lldefinewhat this means, in terms of something called the least upper bound property. 2

3 3 A First Pass Suppose that we already know about some real number x. When we could define a pair of sets (A x,b x ), where A x is the set of all rational numbers y such that y < x, and B x is the set of all rational numbers y such that y > x. The way to think about this is that you are cutting the number line by an infinitely thin knife, at x, and A x is all the numbers to the left of the knife and B x is all the numbers to the right. Part of this definition is very good: The sets A x and B x are both subsets of rationals, so they do not directly refer to real numbers. However, the problem with this definition is that it depends on us already knowing about the number x. The idea behind Dedekind cuts is to just work with the pairs (A,B), without direct reference to any real number. Basically, we just look at all the properties that (A x,b x ) has and then make these axioms for what we mean by a Dedekind cut. 4 The Main Definition A Dedekind cut is a pair (A,B), where A and B are both subsets of rationals. This pair has to satisfy the following properties. 1. A is nonempty. 2. B is nonempty. 3. If a A and c < a then c A. 4. If b B and c > b then c B. 5. If b B and a < b, then a A. 6. If a A and b > a, then b B. 7. For each a A there is some b > a so that b A. 8. For each b B there is some a < b so that a B. That s the definition. A real number is defined to be a Dedekind cut. 3

4 5 Commentary Here is some commentary on the definition: Property 3 informally says that A is a ray pointing to the left. Property 4 informally says that B is a ray poonting to the right. Properties 5 and 6 informally say that the the two rays come together in some sense. Proerties 7 and 8 say that the rays do not include their endpoints. This commentary is just meant to give you an intuitive feel for what is going on. Notice that the 8 properties above do not mention real numbers. 6 Examples We already know what rational numbers are. If x is any rational number, then the sets A x and B x defined above make sense. Problem 1: Prove that the pair (A x,b x ) is a Dedekind cut. I ll start you off with a proof of the first property. Certainly there is some a < x. By definition a A x. Therefore A x is nonempty. That takes care of the first property. The other 7 properties are similar. You might wonder if there are any other examples of Dedekind cuts. Here s an example. Let A denote the set of rational numbers x such that either x < 0 or x 2 < 2. Let B denote the set of rational numbers x such that x > 0 and x 2 > 2. Here s a partial check that (A,B) is a Dedekind cut. Property 1: 0 A, so A is nonempty. Property 2: 2 B, because 2 2 = 4 > 2. So B is nonempty. Property 3: Suppose that a A and c < a. There are two cases: If c < 0 then c A by definition. If c 0 then a 0 as well, and c 2 < a 2 < 2. So, again c A. 4

5 Property 7: Suppose that a A. If a < 0 then we could take b = 0 and get b A. If a 0 then we have a 2 < 2. Let s write a = p/q. We can take p > 0 and q > 0. We know that p 2 < 2q 2. Consider the new rational number b = Np+1 Nq = p q + 1 Nq. Here N is some positive integer. Note that a < b. (Intuitively, b is just a little larger than a.) We win the game if b 2 < 2. This is the same as (Np+1) 2 2(Nq) 2 < 0 Let s call this number Z N. So, we want to choose N so that Z N < 0. Since N is positive, the numbers Z N and Z N /N have the same sign. So, we want to choose N so that Z N /N < 0. We compute Z N N = N(p2 2q 2 )+2p+1/N. The number p 2 2q 2 is an integer less than 0. Therefore Also 1/N 1. Therefore N(p 2 2q 2 ) N. Z N N < N +2p+1. If we choose N = 2p+2 then we get Z N /N < 0. That s it. Problem 2: Check the rest of the properties for the pair (A,B). Property 7 turned out to be something of a nightmare, but I hope that you can use this as a template for establishing the other properties. Since you ve already got Properties 1,2,3,7, you can get Properties 4 and 8 pretty easily. Then you just have to get Properties 5 and 6. These two properties have the same kind of proof, so really the main new input is that you need an idea for Property 5. 5

6 7 Arithmetic with Dedekind Cuts The Dedekind cut from Problem 2 is the real number 2. Notice that we managed to define 2 without reference to any real numbers. The number 2 is really just a certain pair of subsets of rational numbers. To really make sense of the statement that our pair (A,B) from problem has the property that (A,B) (A,B) = 2 (the Dedekind cut representing 2) we have to define the basic arithmetic operations with Dedekind cuts. Addition: Suppose that (A 1,B 1 ) and (A 2,B 2 ) are both Dedekind cuts. Then (A 1,B 1 )+(A 2,B 2 ) is defined to be the pair (A 3,B 3 ) where A 3 is the set of all rationals of the form a 1 + a 2 where a 1 A 1 and a 2 A 2. Likewise B 3 is the set of all rationals of the form b 1 +b 2 with b 1 B 1 and b 2 B 2. Problem 3: Prove that (A 1,B 1 )+(A 2,B 2 ) is a Dedekind cut. Negation: Given any set X of rational numbers, let X denote the set of the negatives of those rational numbers. That is x X if and only if x X. If (A,B) is a Dedekind cut, then (A,B) is defined to be ( B, A). This is pretty clearly a Dedekind cut. The Sign: A Dedekind cut (A,B) is called positive if 0 A and negative if 0 B. If (A,B) is neither positive nor negative, then (A,B) is the cut representing 0. If (A,B) is positive, then (A,B) is negative. Likewise, if (A,B) is negative, then (A,B) is positive. The cut (A,B) is non-negative if it is either positive or 0. Positive Multiplication: If (A 1,B 1 ) and (A 2,B 2 ) are both non-negative, then we define (A 1,B 1 ) (A 2,B 2 ) to be the pair (A 3,B 3 ) where A 3 is the set of all products a 1 a 2 where a 1 A 1 and a 2 A 2 and at least one of the two numbers is non-negative. B 3 is the set of all products of the form b 1 b 2 where b 1 B 1 and b 2 B 2. Let s take an example to see why we need the more complicated definition for A 3. Suppose that (A 1,B 1 ) and (A 2,B 2 ) both represent the number 1. Then we have 2 A 1 and 2 A 2. But ( 2)( 2) = 4 and we don t want 4 A 3. 6

7 General Multiplication: This is a bit painful. If (A 1,B 1 ) is the 0 cut, then (A 1,B 1 ) (A 2,B 2 ) = (A 1,B 1 ). If (A 2,B 2 ) is the 0 cut, then (A 1,B 1 ) (A 2,B 2 ) = (A 2,B 2 ). If (A 1,B 1 ) is negative and (A 2,B 2 ) is positive then (A 1,B 1 ) (A 2,B 2 ) = ( (A 1,B 1 ) (A 2,B 2 ) ). If (A 1,B 1 ) is positive and (A 2,B 2 ) is negative then (A 1,B 1 ) (A 2,B 2 ) = ( (A 1,B 1 ) (A 2,B 2 ) ). If (A 1,B 1 ) is negative and (A 2,B 2 ) is negative then (A 1,B 1 ) (A 2,B 2 ) = ( (A 1,B 1 ) (A 2,B 2 ) ). That takes care of all the cases. This is kind of a crazy scheme, and I guess that there is probably a more efficient definition. But, this does the job. Field Axioms: Now that we ve defined addition and multiplication of Dedekind cuts (i.e., real numbers), it is a tedious but routine matter to check that these things satisfy all the field axioms. I m not going to work this out in these notes, but if you have a day to kill you can probably do it yourself. The Ordering: Now we re doing to change notation. Since real numbers are Dedekind cuts, we re going to denote them with variables in the usual way. As I mentioned above, once you have the field axioms, you can define subtraction and negation. So, we write a < b if and only if a b is negative. It is again a routine but tedious matter to check that this makes the reals into an ordered field. Notation: The set of real numbers is usually denoted by R. In summary, R is the ordered field of Dedekind cuts, and R contains Q (the rationals) as a subset. 7

8 8 Least Upper Bound Property Now I m going to explain why R doesn t have any holes in it. Call a set S R bounded from above if there is some N such that s < N for all s S. For instance, the set of numbers less than 25 is bounded from above. In any Dedekind cut (A,B), the set A is bounded from above. Supposing that S is a set which is bounded from above, an upper bound for S is some real number x such that s x for all x S. For instance 17 is an upper bound for the set of negative numbers. But 0 is also an upper bound for the set of negative numbers. A number x is called a least upper bound for S if x is an upper bound for S but no y < x is an upper bound for S. You might say that the set S creeps right up to its least upper bound. Now let s prove that every set S R which is bounded from above has a least upper bound. Define a Dedekind cut (A,B) like this: A consists of all rationals x such that x < s for some s S. B consits of all rationals of the form x+y where s < x for all s S and y > 0. This definition is designed to cut the endpoint off B. It is a tedious but not difficult exercise to check that (A,B) really is a Dedekind cut, and that (A,B) is the least upper bound for S. This is the sense in which R has no holes: So, if you define a real number to be a Dedekind cut then the set R of real numbers is a complete ordered field with the least upper bound property. 9 Final Word Why are the reals better than the rationals. They are both ordered fields and we can make the least upper bound definition for the rationals. However, there are sets of rationals which are bounded from above but do not have a least upper bound (in the rationals). Let s take the set S of rationals x such that x 2 < 2. We d like that 2 is the least upper bound for S but 2 is not a rational number. So, if we choose a rational upper bound, it must be greater than 2. But then we can find some smaller upper bound. So, in the rationals, there is no least upper bound to S. 8

So let us begin our quest to find the holy grail of real analysis.

1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers

MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

Student Outcomes. Lesson Notes. Classwork. Discussion (10 minutes)

NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 5 8 Student Outcomes Students know the definition of a number raised to a negative exponent. Students simplify and write equivalent expressions that contain

Activity 1: Using base ten blocks to model operations on decimals

Rational Numbers 9: Decimal Form of Rational Numbers Objectives To use base ten blocks to model operations on decimal numbers To review the algorithms for addition, subtraction, multiplication and division

Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

Factoring Trinomials of the Form x 2 bx c

4.2 Factoring Trinomials of the Form x 2 bx c 4.2 OBJECTIVES 1. Factor a trinomial of the form x 2 bx c 2. Factor a trinomial containing a common factor NOTE The process used to factor here is frequently

Lesson 6: Proofs of Laws of Exponents

NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 6 8 Student Outcomes Students extend the previous laws of exponents to include all integer exponents. Students base symbolic proofs on concrete examples to

Corinne: I m thinking of a number between 220 and 20. What s my number? Benjamin: Is it 25?

Walk the Line Adding Integers, Part I Learning Goals In this lesson, you will: Model the addition of integers on a number line. Develop a rule for adding integers. Corinne: I m thinking of a number between

God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

Properties of Real Numbers

16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should

Pigeonhole Principle Solutions

Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such

Homework 5 Solutions

Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which

Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

Fractions and Decimals

Fractions and Decimals Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles December 1, 2005 1 Introduction If you divide 1 by 81, you will find that 1/81 =.012345679012345679... The first

CHAPTER 3 Numbers and Numeral Systems

CHAPTER 3 Numbers and Numeral Systems Numbers play an important role in almost all areas of mathematics, not least in calculus. Virtually all calculus books contain a thorough description of the natural,

6 Proportion: Fractions, Direct and Inverse Variation, and Percent

6 Proportion: Fractions, Direct and Inverse Variation, and Percent 6.1 Fractions Every rational number can be written as a fraction, that is a quotient of two integers, where the divisor of course cannot

Math Workshop October 2010 Fractions and Repeating Decimals

Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,

An Interesting Way to Combine Numbers

An Interesting Way to Combine Numbers Joshua Zucker and Tom Davis November 28, 2007 Abstract This exercise can be used for middle school students and older. The original problem seems almost impossibly

Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition

Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing

Session 7 Fractions and Decimals

Key Terms in This Session Session 7 Fractions and Decimals Previously Introduced prime number rational numbers New in This Session period repeating decimal terminating decimal Introduction In this session,

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

CONTENTS 1. Peter Kahn. Spring 2007

CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................

3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

Permutation Groups. Rubik s Cube

Permutation Groups and Rubik s Cube Tom Davis tomrdavis@earthlink.net May 6, 2000 Abstract In this paper we ll discuss permutations (rearrangements of objects), how to combine them, and how to construct

Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.

Algebra 2 - Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers - {1,2,3,4,...}

Set theory as a foundation for mathematics

Set theory as a foundation for mathematics Waffle Mathcamp 2011 In school we are taught about numbers, but we never learn what numbers really are. We learn rules of arithmetic, but we never learn why these

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

1. The algebra of exponents 1.1. Natural Number Powers. It is easy to say what is meant by a n a (raised to) to the (power) n if n N.

CHAPTER 3: EXPONENTS AND POWER FUNCTIONS 1. The algebra of exponents 1.1. Natural Number Powers. It is easy to say what is meant by a n a (raised to) to the (power) n if n N. For example: In general, if

Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

CHATER. RIGHT TRIANGLE AND UADRILATERAL 18 1 5 11 Choose always the way that seems the best, however rough it may be; custom will soon render it easy and agreeable. ythagoras CHATER Right Triangles and

Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important

Solution to Homework 2

Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if

Absolute Value of Reasoning

About Illustrations: Illustrations of the Standards for Mathematical Practice (SMP) consist of several pieces, including a mathematics task, student dialogue, mathematical overview, teacher reflection

We now explore a third method of proof: proof by contradiction.

CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement

Today. Binary addition Representing negative numbers. Andrew H. Fagg: Embedded Real- Time Systems: Binary Arithmetic

Today Binary addition Representing negative numbers 2 Binary Addition Consider the following binary numbers: 0 0 1 0 0 1 1 0 0 0 1 0 1 0 1 1 How do we add these numbers? 3 Binary Addition 0 0 1 0 0 1 1

Integers are positive and negative whole numbers, that is they are; {... 3, 2, 1,0,1,2,3...}. The dots mean they continue in that pattern.

INTEGERS Integers are positive and negative whole numbers, that is they are; {... 3, 2, 1,0,1,2,3...}. The dots mean they continue in that pattern. Like all number sets, integers were invented to describe

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 11

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

5544 = 2 2772 = 2 2 1386 = 2 2 2 693. Now we have to find a divisor of 693. We can try 3, and 693 = 3 231,and we keep dividing by 3 to get: 1

MATH 13150: Freshman Seminar Unit 8 1. Prime numbers 1.1. Primes. A number bigger than 1 is called prime if its only divisors are 1 and itself. For example, 3 is prime because the only numbers dividing

Section 4.1 Rules of Exponents

Section 4.1 Rules of Exponents THE MEANING OF THE EXPONENT The exponent is an abbreviation for repeated multiplication. The repeated number is called a factor. x n means n factors of x. The exponent tells

8 Primes and Modular Arithmetic

8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

Rational Exponents. Squaring both sides of the equation yields. and to be consistent, we must have

8.6 Rational Exponents 8.6 OBJECTIVES 1. Define rational exponents 2. Simplify expressions containing rational exponents 3. Use a calculator to estimate the value of an expression containing rational exponents

MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

(2 4 + 9)+( 7 4) + 4 + 2

5.2 Polynomial Operations At times we ll need to perform operations with polynomials. At this level we ll just be adding, subtracting, or multiplying polynomials. Dividing polynomials will happen in future

MATH 13150: Freshman Seminar Unit 10

MATH 13150: Freshman Seminar Unit 10 1. Relatively prime numbers and Euler s function In this chapter, we are going to discuss when two numbers are relatively prime, and learn how to count the numbers

6 3 4 9 = 6 10 + 3 10 + 4 10 + 9 10

Lesson The Binary Number System. Why Binary? The number system that you are familiar with, that you use every day, is the decimal number system, also commonly referred to as the base- system. When you

Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.

Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole

OSTROWSKI FOR NUMBER FIELDS

OSTROWSKI FOR NUMBER FIELDS KEITH CONRAD Ostrowski classified the nontrivial absolute values on Q: up to equivalence, they are the usual (archimedean) absolute value and the p-adic absolute values for

2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

Square Roots. Learning Objectives. Pre-Activity

Section 1. Pre-Activity Preparation Square Roots Our number system has two important sets of numbers: rational and irrational. The most common irrational numbers result from taking the square root of non-perfect

Pythagorean Triples. Chapter 2. a 2 + b 2 = c 2

Chapter Pythagorean Triples The Pythagorean Theorem, that beloved formula of all high school geometry students, says that the sum of the squares of the sides of a right triangle equals the square of the

Computer Science 281 Binary and Hexadecimal Review

Computer Science 281 Binary and Hexadecimal Review 1 The Binary Number System Computers store everything, both instructions and data, by using many, many transistors, each of which can be in one of two

Equations, Inequalities, Solving. and Problem AN APPLICATION

Equations, Inequalities, and Problem Solving. Solving Equations. Using the Principles Together AN APPLICATION To cater a party, Curtis Barbeque charges a \$0 setup fee plus \$ per person. The cost of Hotel

Chapter 4 -- Decimals

Chapter 4 -- Decimals \$34.99 decimal notation ex. The cost of an object. ex. The balance of your bank account ex The amount owed ex. The tax on a purchase. Just like Whole Numbers Place Value - 1.23456789

1 Number System. Introduction. Face Value and Place Value of a Digit. Categories of Numbers

RMAT Success Master 3 1 Number System Introduction In the decimal number system, numbers are expressed by means of symbols 0, 1,, 3, 4, 5, 6, 7, 8, 9, called digits. Here, 0 is called an insignificant

8 Square matrices continued: Determinants

8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You

Section 5.4 The Quadratic Formula 481 5.4 The Quadratic Formula Consider the general quadratic function f(x) = ax + bx + c. In the previous section, we learned that we can find the zeros of this function

1. The Fly In The Ointment

Arithmetic Revisited Lesson 5: Decimal Fractions or Place Value Extended Part 5: Dividing Decimal Fractions, Part 2. The Fly In The Ointment The meaning of, say, ƒ 2 doesn't depend on whether we represent

This Unit: Floating Point Arithmetic. CIS 371 Computer Organization and Design. Readings. Floating Point (FP) Numbers

This Unit: Floating Point Arithmetic CIS 371 Computer Organization and Design Unit 7: Floating Point App App App System software Mem CPU I/O Formats Precision and range IEEE 754 standard Operations Addition

INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

Playing with Numbers

PLAYING WITH NUMBERS 249 Playing with Numbers CHAPTER 16 16.1 Introduction You have studied various types of numbers such as natural numbers, whole numbers, integers and rational numbers. You have also

An Innocent Investigation

An Innocent Investigation D. Joyce, Clark University January 2006 The beginning. Have you ever wondered why every number is either even or odd? I don t mean to ask if you ever wondered whether every number

4.1. Definitions. A set may be viewed as any well defined collection of objects, called elements or members of the set.

Section 4. Set Theory 4.1. Definitions A set may be viewed as any well defined collection of objects, called elements or members of the set. Sets are usually denoted with upper case letters, A, B, X, Y,

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation

COMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012

Binary numbers The reason humans represent numbers using decimal (the ten digits from 0,1,... 9) is that we have ten fingers. There is no other reason than that. There is nothing special otherwise about

13 Infinite Sets. 13.1 Injections, Surjections, and Bijections. mcs-ftl 2010/9/8 0:40 page 379 #385

mcs-ftl 2010/9/8 0:40 page 379 #385 13 Infinite Sets So you might be wondering how much is there to say about an infinite set other than, well, it has an infinite number of elements. Of course, an infinite

11 Ideals. 11.1 Revisiting Z

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

Solutions of Linear Equations in One Variable

2. Solutions of Linear Equations in One Variable 2. OBJECTIVES. Identify a linear equation 2. Combine like terms to solve an equation We begin this chapter by considering one of the most important tools

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

2. THE x-y PLANE 7 C7

2. THE x-y PLANE 2.1. The Real Line When we plot quantities on a graph we can plot not only integer values like 1, 2 and 3 but also fractions, like 3½ or 4¾. In fact we can, in principle, plot any real

Application. Outline. 3-1 Polynomial Functions 3-2 Finding Rational Zeros of. Polynomial. 3-3 Approximating Real Zeros of.

Polynomial and Rational Functions Outline 3-1 Polynomial Functions 3-2 Finding Rational Zeros of Polynomials 3-3 Approximating Real Zeros of Polynomials 3-4 Rational Functions Chapter 3 Group Activity:

CLASS 3, GIVEN ON 9/27/2010, FOR MATH 25, FALL 2010

CLASS 3, GIVEN ON 9/27/2010, FOR MATH 25, FALL 2010 1. Greatest common divisor Suppose a, b are two integers. If another integer d satisfies d a, d b, we call d a common divisor of a, b. Notice that as

WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

Permutation Groups. Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles April 2, 2003

Permutation Groups Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles April 2, 2003 Abstract This paper describes permutations (rearrangements of objects): how to combine them, and how

Mathematics for Computer Science

Mathematics for Computer Science Lecture 2: Functions and equinumerous sets Areces, Blackburn and Figueira TALARIS team INRIA Nancy Grand Est Contact: patrick.blackburn@loria.fr Course website: http://www.loria.fr/~blackbur/courses/math

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

Pick s Theorem. Tom Davis Oct 27, 2003

Part I Examples Pick s Theorem Tom Davis tomrdavis@earthlink.net Oct 27, 2003 Pick s Theorem provides a method to calculate the area of simple polygons whose vertices lie on lattice points points with

Chapter 3. if 2 a i then location: = i. Page 40

Chapter 3 1. Describe an algorithm that takes a list of n integers a 1,a 2,,a n and finds the number of integers each greater than five in the list. Ans: procedure greaterthanfive(a 1,,a n : integers)

Introduction to Diophantine Equations

Introduction to Diophantine Equations Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles September, 2006 Abstract In this article we will only touch on a few tiny parts of the field

A Prime Investigation with 7, 11, and 13

. Objective To investigate the divisibility of 7, 11, and 13, and discover the divisibility characteristics of certain six-digit numbers A c t i v i t y 3 Materials TI-73 calculator A Prime Investigation

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

2.1 The Algebra of Sets

Chapter 2 Abstract Algebra 83 part of abstract algebra, sets are fundamental to all areas of mathematics and we need to establish a precise language for sets. We also explore operations on sets and relations

0.8 Rational Expressions and Equations

96 Prerequisites 0.8 Rational Expressions and Equations We now turn our attention to rational expressions - that is, algebraic fractions - and equations which contain them. The reader is encouraged to

Taylor Polynomials and Taylor Series Math 126

Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will

Formal Languages and Automata Theory - Regular Expressions and Finite Automata -

Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March

Vector and Matrix Norms

Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty

Lesson Plan. N.RN.3: Use properties of rational and irrational numbers.

N.RN.3: Use properties of rational irrational numbers. N.RN.3: Use Properties of Rational Irrational Numbers Use properties of rational irrational numbers. 3. Explain why the sum or product of two rational

Using the ac Method to Factor

4.6 Using the ac Method to Factor 4.6 OBJECTIVES 1. Use the ac test to determine factorability 2. Use the results of the ac test 3. Completely factor a trinomial In Sections 4.2 and 4.3 we used the trial-and-error

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers

Georg Cantor (1845-1918):

Georg Cantor (845-98): The man who tamed infinity lecture by Eric Schechter Associate Professor of Mathematics Vanderbilt University http://www.math.vanderbilt.edu/ schectex/ In papers of 873 and 874,

MATH 10034 Fundamental Mathematics IV

MATH 0034 Fundamental Mathematics IV http://www.math.kent.edu/ebooks/0034/funmath4.pdf Department of Mathematical Sciences Kent State University January 2, 2009 ii Contents To the Instructor v Polynomials.

Basics of Counting. The product rule. Product rule example. 22C:19, Chapter 6 Hantao Zhang. Sample question. Total is 18 * 325 = 5850

Basics of Counting 22C:19, Chapter 6 Hantao Zhang 1 The product rule Also called the multiplication rule If there are n 1 ways to do task 1, and n 2 ways to do task 2 Then there are n 1 n 2 ways to do

Unit 1 Number Sense. In this unit, students will study repeating decimals, percents, fractions, decimals, and proportions.

Unit 1 Number Sense In this unit, students will study repeating decimals, percents, fractions, decimals, and proportions. BLM Three Types of Percent Problems (p L-34) is a summary BLM for the material