Transcription

1 MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take proofs seriously the subject matter is so abstract that you can no longer rely on drawings and intuition; you simply have to be able to understand, create and write proofs. Fortunately, this is not as difficult as it may sound if you have never tried to take proofs seriously before. The purpose of this note is to give you the necessary background to understand the notation and terminology of the textbook and to appreciate the proofs. Proofs There is nothing mysterious about mathematical proofs; they are just chains of logically irrefutable arguments that bring you from things you already know to whatever you want to prove. Still there are a few tricks of the trade that are useful to know about. Many mathematical statements are of the form If A, then B. This simply means that whenever statement A holds, statement B also holds, but not necessarily vice versa. A typical example is: If n N is divisible by 14, then n is divisible by 7. This is a true statement since any natural number that is divisible by 14, is also divisible by 7. The opposite statement is not true as there are numbers that are divisible by 7, but not by 14 (e.g. 7 and 21). Instead of If A, then B, we often say that A implies B and write A = B. As already observed, A = B and B = A mean two different things. If they are both true, A and B hold in exactly the same cases, and we say that A and B are equivalent. In words, we say A if and only if B, and in symbols, we write A B. A typical example is: A triangle is equilateral if and only if all three angels are 60 When we want to prove that A B, it is often convenient to prove A = B and B = A separately. If you think a little, you will realize that A = B and not-b = not-a mean exactly the same thing they both say that whenever A happens, so does B. This means that instead of proving A = B, we might just a well prove not-b = not-a. This is called a contrapositive proof, and is convenient when the hypothesis not-b gives us more to work on than the hypothesis A. Here is a typical example. Proposition 1 If n 2 is an even number, so is n. 1

2 Proof: We prove the contrapositive statement: If n is odd, so is n 2 : If n is odd, it can be written as n = 2k + 1 for a nonnegative integer k. But then n 2 = (2k + 1) 2 = 4k 2 + 4k + 1 = 2(2k 2 + 2k) + 1 which is clearly odd. It should be clear why a contrapositive proof is best in this case: The hypothesis n is odd is much easier to work with than the original hypothesis n 2 is even. A related method of proof is proof by contradiction or reductio ad absurdum. In these proofs, we assume the opposite of what we want to show, and prove that this leads to a contradiction. Hence our assumption must be false, and the original claim is established. Here is a well-known example. Proposition 2 2 is an irrational number. Proof: We assume for contradiction that 2 is rational. This means that 2 = m n for natural numbers m and n. By cancelling as much as possible, we may assume that m and n have no common factors. If we square the equality above and multiply by n 2 on both sides, we get 2n 2 = m 2 This means that m 2 is even, and by the previous proposition, so is m. Hence m = 2k for some natural number k, an if we substitute this into the last formula above and cancel a factor 2, we see that n 2 = 2k 2 This means that n 2 is even, and by the previous proposition n is even. Thus we have proved that both m and n are even, which is impossible as we assumed that they have no common factors. This means that the assumption that 2 is rational leads to a contradiction, and hence 2 must be irrational. Sets and boolean operations For us, a set will just be a (finite or infinite) collection of mathematical objects. We shall write x A to say that x is an element of the set A, and x / A to say that x is not an element of A. Two sets are equal if they have exactly the same elements, and we say that A is subset of B (and write A B) if all elements of A are elements of B, but not necessarily vice versa. Note that there is no requirement that A is strictly included in B, and hence it is correct to write A B when A = B (in fact, a standard technique for showing that A = B is 2

3 first to show that A B and then that B A). By we shall mean the empty set, i.e. the set with no elements (you may feel that a set with no elements is a contradiction in terms, but mathematical life would be much less convenient without the empty set). To specify a set, we shall often use expressions of the kind A = {a P (a)} which means the set of all objects satisfying condition P. convenient to write A = {a B P (a)} Often it is more which means the set of all elements in B satisfyng the condition P. If A 1, A 2,..., A n are sets, their union and intersection are given by A 1 A 2... A n = {a a belongs to at least one of the sets A 1, A 2,..., A n } and A 1 A 2... A n = {a a belongs to all the sets A 1, A 2,..., A n }, respectively. Remember that two sets are called disjoint if they do not have elements in common, i.e. if A B =. Unions and intersections are distributive both ways, i.e. we have: Proposition 3 For all sets B, A 1, A 2,..., A n and B (A 1 A 2... A n ) = (B A 1 ) (B A 2 )... (B A n ) (1) B (A 1 A 2... A n ) = (B A 1 ) (B A 2 )... (B A n ) (2) Proof: We prove (1) and leave (2) as an exercise. The proof is in two steps: first we prove that the set on the left is a subset of the one on the right, and then we prove that the set on the right is a subset of the one on the left. Assume first that x is an element of the set on the left, i.e. x B (A 1 A 2... A n ). Then x must be in B and at least one of the sets A i. But then x B A i, and hence x (B A 1 ) (B A 2 )... (B A n ). This proves that B (A 1 A 2... A n ) (B A 1 ) (B A 2 )... (B A n ) To prove the opposite inclusion, assume that x (B A 1 ) (B A 2 )... (B A n ). Then x B A i for at least one i, an hence x B and x A i. But if x A i for some i, then x A 1 A 2... A n, and hence x B (A 1 A 2... A n ). This proves that B (A 1 A 2... A n ) (B A 1 ) (B A 2 )... (B A n ) 3

4 As we now have inclusion in both directions, (1) follows. Remark: It is possible to prove formula (1) in one sweep by noticing that all steps in the argument are equivalences and not only implications, but most people are more prone to making mistakes when they work with chains of equivalences than with chains of implications. There are also other algebraic rules for unions and intersections, but most of them are so obvious that we do not need to state them here (an exception is De Morgan s laws which we shall return to in a moment). The set theoretic difference A \ B (also written A B) is defined by A \ B = {a a A, a / B} In many situations we are only interested in subsets of a given set U (often referred to as the universe). The complement A c of a set A with respect to U is defined by A c = U \ A = {a U a / A} We can now formulate De Morgan s laws: Proposition 4 (De Morgan s laws) Assume that A 1, A 2,..., A n are subsets of a universe U. Then (A 1 A 2... A n ) c = A c 1 A c 2... A c n and (A 1 A 2... A n ) c = A c 1 A c 2... A c n (These rules are easy to remember if you observe that you can distribute the c outside the parentheses on the individual sets provided you turn all s into s and all s into s). Proof of De Morgan s laws: We prove the first part and leave the second as an exercise. The strategy is as indicated above; we first show that any element of the set on the left must also be an elment of the set on the right, and then vice versa. Assume that x (A 1 A 2... A n ) c. Then x / A 1 A 2... A n, and hence for all i, x / A i. This means that for all i, x A c i, and hence x A c 1 A c 2... A c n. Assume next that x A c 1 A c 2... A c n. This means that x A c i for all i, in other words: for all i, x / A i. Thus x / A 1 A 2... A n which means that x (A 1 A 2... A n ) c. We end this section with a brief look at cartesian products. If we have two sets, A and B, the cartesian product A B consists of all pairs (a, b) where a A and b B. If we have more sets A 1, A 2,..., A n, the cartesian product A 1 A 2 A n consists of all n-tuples (a 1, a 2,..., a n ) where a 1 A 1, a 2 4

5 A 2,..., a n A n. If all the sets are the same (i.e. A i = A for all i), we usually write A n instead of A A A. Hence R n is the set of all n-tuples of real numbers, just as you are used to, and C n is the set of all n-tuples of complex numbers. Families A collection of sets is usually called a family. An example is the family A = {[a, b] a, b R} of all closed and bounded intervals on the real line. Families may seem abstract, but you have to get used to them as they appear in all parts of higher mathematics. We can extend the notions of union and intersection to families in the following way: If A is a family of sets, we define A = {a a belongs to at least one set A A} and A = {a a belongs to all sets A A} The distributive laws and the laws of De Morgan extend to this case in the obvious way e.g., ( A) c = A c Families are often given as indexed sets. This means we we have one basic set I, and that the family consists of one set A i for each element in I. We then write the family as A = {A i i I}, and use notation such as i I A i and for unions and intersections A rather typical example of an indexed set is A = {B r r [0, )} where B r = {(x, y) R 2 x 2 + y 2 = r 2 }. This is the family of all circles in the plane with centre at the origin. Functions Functions can be defined in terms of sets, but for our purposes it suffices to think of a function f : X Y from X to Y as a rule which to each element x X assigns an element y = f(x) in Y. If f(x) f(y) whenever x y, we call the function injective (or one-to-one). If there for each y Y is an x X i I A i 5

6 such that f(x) = y, the function is called surjective (or onto). A function which is both injective and surjective, is called bijective it establishes a one-to-one correspondence between the elements of X and Y. If A is subset of X, the set f(a) Y defined by f(a) = {f(a) a A} is called the image of A under f. If B is subset of Y, the set f 1 (B) X defined by f 1 (B) = {x X f(x) B} is called the inverse image of B under f. In analysis, images and inverse images of sets play important parts, and it is useful to know how these operations relate to the boolean operations of union and intersection. Let us begin with the good news. Proposition 5 Let B be a family of subset of Y. Then for all functions f : X Y we have f 1 ( B) = f 1 (B) and f 1 ( B) = f 1 (B) B B B B We say that inverse images commute with arbitrary unions and intersections. Proof: I prove the first part; the second part is proved similarly. Assume first that x f 1 ( B B B). This means that f(x) B B B, and consequently there must be at least one B B such that f(x) B. But then x f 1 (B), and hence x B B f 1 (B). This proves that f 1 ( B B B) B B f 1 (B). To prove the opposite inclusion, assume that x B B f 1 (B). There must be at least one B B such that x f 1 (B), and hence f(x) B. This implies that f(x) B B B, and hence x f 1 ( B B B). B B For forward images the situation is more complicated: Proposition 6 Let A be a family of subset of X. Then for all functions f : X Y we have f( A) = f(a) and f( A) f(a) In general, we do not have equality in the last case. Hence forward images commute with unions, but not always with intersections. Proof: To prove the statement about unions, we first observe that since A A for all A A, we have f(a) f( )A for all such A. Since this inclusion holds for all A, we must also have f(a) f( ). To prove the opposite inclusion, assume that y f( A). This means that there exists an x A such that f(x) = y. This x has to belong to at least one A A, and hence y f(a) f(a). B B 6

7 To prove the inclusion for intersections, just observe that since A A for all A A, we must have f( A) f(a) for all such A. Since this inclusion holds for all A, it follows that f( A) f(a). The example below shows that the opposite inclusion does not always hold. Example 1: Let X = {x 1, x 2 } and Y = {y}. Define f : X Y by f(x 1 ) = f(x 2 ) = y, and let A 1 = {x 1 }, A 2 = {x 2 }. Then A 1 A 2 = and consequently f(a 1 A 2 ) =. On the other hand f(a 1 ) = f(a 2 ) = {y}, and hence f(a 1 ) f(a 2 ) = {y}. This means that f(a 1 A 2 ) f(a 1 ) f(a 2 ).. The problem in this example stems from the fact that y belongs to both f(a 1 ) and f(a 2 ), but only as the image of two different elements x 1 A 1 og x 2 A 2 ; there is no common element x A 1 A 2 which is mapped to y. This problem disappears if f is injective: Corollary 7 Let A be a family of subset of X. Then for all injective functions f : X Y we have f( A) = f(a) Proof: The easiest way to show this is probably to apply Proposition 2 to the inverse function of f, but I choose instead to prove the missing inclusion f( A) f(a) directly. Assume y f(a). For each A A there must be an element x A A such that f(x A ) = y. Since f is injective, all these x A A must be the same element x, and hence x A for all A A. This means that x A, and since y = f(x), we have proved that y f( A). Taking complements is another operation that commutes with inverse images, but not (in general) with forward images. Proposition 8 Assume that f : X Y is a function and that B Y. Then f 1 (B c )) = (f 1 (B)) c. (Here, of course, B c = Y \ B is the complement with respect to the universe Y, while (f 1 (B)) c = X \ f 1 (B) is the complemet with respect to the universe X). Proof: An element x X belongs to f 1 (B c ) iff f(x) B c. On the other hand, it belongs to (f 1 (B)) c iff f(x) / B, i.e. iff f(x) B c. Finally, let us just observe that being disjoint is also a property that is conserved under inverse images; if A B =, then f 1 (A) f 1 (B) =. Again the corresponding property for forward images does not hold in general. Countability A set A is called countable if it possible to make a list a 1, a 2,..., a n,... which contains all elements of A. This is the same as saying that A is countable if 7

8 there exists a surjective function f : N A. Finite sets are obviously countable (you may list the same elements many times) and so is the set N of all natural numbers. Observe further that the set Z of all integers is countable we just use the list 0, 1, 1, 2, 2, 3, 3... It is also easy to see that a subset of a countable set must be countable, and that the image f(a) of a countable set is countable (if {a n } is a listing of A, then {f(a n )} is a listing of f(a)). The next result is perhaps more surprising: Proposition 9 If the sets A, B are countable, so is the cartesian product A B. Proof: Since A and B are countable, there are lists {a n }, {b n } containing all the elements of A and B, respectively. But then {(a 1, b 1 ), (a 2, b 1 ), (a 1, b 2 ), (a 3, b 1 ), (a 2, b 2 ), (a 1, b 3 ), (a 4, b 1 ), (a 3, b 2 ),..., } is a list containing all elements of A B (observe how the list is made; first we list the (only) element (a 1, b 1 ) where the indicies sum to 2, then we list the elements (a 2, b 1 ), (a 1, b 2 ) where the indicies sum to 3, then the elements (a 3, b 1 ), (a 2, b 2 ), (a 1, b 3 ) where the indicies sum to 4 etc.) Remark If A 1, A 2,..., A n is a finite collection of countable sets, then the cartesian product A 1 A 2 A n is countable. This can be proved by induction from the proposition above, using that A 1 A k A k+1 is essentially the same set as (A 1 A k ) A k+1. The same trick we used to prove Proposition 9, can also be used to prove the next result: Proposition 10 If the sets A 1, A 2,..., A n,... are countable, so is their union n N A n. Hence a countable union of countable sets is itself countable. Proof: Let A i = {a i1, a i2,..., a in,...} be a listing of the i-th set. Then is a listing of i N A i. {a 11, a 21, a 12, a 31, a 22, a 13, a 41, a 32,...} Proposition 9 can also be used to prove that the rational numbers are countable: Proposition 11 The set Q of all rational numbers is countable. Proof: According to proposition 9, the set Z N is countable and can be listed (a 1, b 1 ), (a 2, b 2 ), (a 3, b 3 ),.... But then a1 b 1, a2 b 2, a3 b 3,... is a list of all the elements in Q (due to cancellations, all rational numbers will appear infinitely many times in this list, but that doesn t matter). Finally, we prove an important result in the opposite direction: 8

9 Theorem 12 The set R of all real numbers is not countable. Proof: (Cantor s diagonal argument) Assume for contradiction that R is countable and can be listed r 1, r 2, r 3,.... Let us write down the decimal expansions of the numbers on the list: r 1 = w 1.a 11 a 12 a 13 a r 2 = w 2.a 21 a 22 a 23 a r 3 = w 3.a 31 a 32 a 33 a r 4 = w 4.a 41 a 42 a 43 a (w i is the integer part of r i, and a i1, a i2, a i3,... are the decimals). To get our contradiction, we introduce a new decimal number c = 0.c 1 c 2 c 3 c 4... where the decimals are defined by: 1 if a ii 1 c i = 2 if a ii = 1 This number has to be different from the i-th number r i on the list as the decimal expansions disagree on the i-th place (as c has only 1 and 2 as decimals, there are no problems with nonuniqueness of decimal expansions). This is a contradiction as we assumed that all real numbers were on the list. Problems 1. Assume that the product of two integers x and y is even. Show that at least one the numbers is even. 2. Assume that the sum of two integers x and y is even. Show that x and y are either both even or both odd. 3. Show that if n is a natural number such that n 2 is divisible by 3, then n is divisible by 3. Use this to show that 3 is irrational. 4. Prove formula (2). 5. Show that A \ B = A B c, 6. Prove formula (4). 7. Prove that A 1 A 2... A n = U if and only if A c 1 A c 2... A c n =. 8. Prove that (A B) C = (A C) (B C) and (A B) C = (A C) (B C). 9. Prove the second part of Proposition 5. 9

10 10. Find a function f : X Y and a set A X such that we have neither f(a c ) f(a) c nor f(a) c f(a c ). 11. Show that if f : X Y and g : Y Z are injective, then g f : X Z is injective. 12. Show that if f : X Y and g : Y Z are sujective, then g f : X Z is surjective. 13. Show that if A 1, A 2,... A n are countable, then A 1 A 2 A n is countable. 14. Show that the set of all finite sequences (q 1, q 2,..., q k ), k N, of rational numbers is countable. 15. Show that the set of all subsets of N is not countable (Hint: Try to modify the proof of Theorem 12.) 10

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

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

CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

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

Discrete Mathematics: Solutions to Homework 2 1. (12%) For each of the following sets, determine whether {2} is an element of that set. (a) {x R x is an integer greater than 1} (b) {x R x is the square

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,

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

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The set-theoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are

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

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

Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document

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

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,

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,

APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and

Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence

222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted

Lecture 8 2.1 Sets, power sets. Cartesian Products. Set is an unordered collection of objects. - used to group objects together, - often the objects with similar properties This description of a set (without

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

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

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using

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

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,

1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of

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

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: 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

SETS Sections 2.1, 2.2 and 2.4 Chapter Summary Sets The Language of Sets Set Operations Set Identities Introduction Sets are one of the basic building blocks for the types of objects considered in discrete

Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some

Chapter 3 Distribution Problems 3.1 The idea of a distribution Many of the problems we solved in Chapter 1 may be thought of as problems of distributing objects (such as pieces of fruit or ping-pong balls)

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

CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

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

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

Georg Cantor and Set Theory. Life Father, Georg Waldemar Cantor, born in Denmark, successful merchant, and stock broker in St Petersburg. Mother, Maria Anna Böhm, was Russian. In 856, because of father

CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.

SETS Chapter 1 In these days of conflict between ancient and modern studies; there must surely be something to be said for a study which did not begin with Pythagoras and will not end with Einstein; but

Pythagorean Triples One of the most far-reaching problems to appear in Diophantus Arithmetica was his Problem II-8: To divide a given square into two squares. Namely, find integers x, y, z, so that x 2

Real Numbers and Monotone Sequences. Introduction. Real numbers. Mathematical analysis depends on the properties of the set R of real numbers, so we should begin by saying something about it. There are

Chapter 3 Foundations of Geometry 1: Points, Lines, Segments, Angles 3.1 An Introduction to Proof Syllogism: The abstract form is: 1. All A is B. 2. X is A 3. X is B Example: Let s think about an example.

Math212a1010 Lebesgue measure. October 19, 2010 Today s lecture will be devoted to Lebesgue measure, a creation of Henri Lebesgue, in his thesis, one of the most famous theses in the history of mathematics.

CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

Chapter Basic Set Theory A set is a Many that allows itself to be thought of as a One. - Georg Cantor This chapter introduces set theory, mathematical induction, and formalizes the notion of mathematical

Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.

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

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

Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the

Section 2.5 Cardinality (another) Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a bijection from A to B. If there is an injection

Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted

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

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

1 Review of complex numbers 1.1 Complex numbers: algebra The set C of complex numbers is formed by adding a square root i of 1 to the set of real numbers: i = 1. Every complex number can be written uniquely

Polynomial Invariants Dylan Wilson October 9, 2014 (1) Today we will be interested in the following Question 1.1. What are all the possible polynomials in two variables f(x, y) such that f(x, y) = f(y,