The natural numbers. Definition. Let X be any inductive set. We define the set of natural numbers as N = C(X).
|
|
- Clemence Wiggins
- 6 years ago
- Views:
Transcription
1 The natural numbers As mentioned earlier in the course, the natural numbers can be constructed using the axioms of set theory. In this note we want to discuss the necessary details of this construction. Recall that Axiom VII, often called the axiom of infinity, guarantees the existence of at least one inductive set that is, a set X with the property that (i) X, and (ii) A {A} X whenever A X. Notice that such an inductive set X must contain the sets, { }, {, { }}, {, { }, {, { }}},. However, it may also contain a lot of other elements. In order to get rid of all conceivable extraneous elements in X we can form the smallest possible subset of X which is still inductive, called its inductive core: C(X) {I I X and I is and inductive set} {A X A I for every inductive set I with I X}. We would like to define the natural numbers N to be this inductive core C(X). For this definition to be meaningful, however, we need to check if one arrives at the same inductive core regardless of the inductive set one starts out with. To this end, suppose that Y is also an inductive set. We wish to show that C(X) C(Y ). First, observe that X Y is an inductive set, too. Also, since the sets involved in the intersection defining C(X Y ) are all those sets involved in the intersection defining C(X) plus possibly more, we conclude that C(X Y ) C(X). Conversely, let A C(X). In order to show that A C(X Y ), we let I be an arbitrary inductive subset of X Y and argue that A I. But that follows immediately upon observing that I X is an inductive subset of X and must therefore contain A. We have now shown that C(X Y ) C(X). Similarly, C(X Y ) C(Y ). Hence C(X) C(Y ). This little discussion enables us to make our definition: Definition. Let X be any inductive set. We define the set of natural numbers as N C(X). Next, let us give the elements of N shorter names. We shall write 0, 1, 2, 3, for the sets, { }, {, { }}, {, { }, {, { }}},. That is to say, we write 0 for, 1 for {0}, 2 for {0, 1}, 3 for {0, 1, 2}, and so on. We will also use the convenient abbreviation A + 1 A {A}. Hence, , , , and so on. This does not mean, however, that we already know how to add natural numbers. We will define addition and multiplication of natural numbers later. At this point, A + 1 simply stands for A {A}. Notice that the principle of mathematical induction follows immediately from the definition of N: Theorem [Mathematical induction]. Let a predicate P (n) be given. Suppose that P (0) is true and that P (n + 1) is true whenever P (n) is true. Then P (n) is true for all n N. 1
2 Proof. Let A {n N P (n) is true }. Then 0 A and n + 1 A whenever n A. Hence, A is an inductive set, so that N C(A) A N. That is A N. We now put an ordering on the natural numbers: Definition. For m, n N we define m < n to mean m n. For example, 3 < 5 since 3 5 {0, 1, 2, 3, 4}. Exercises. Use mathematical induction to prove the following statements for all m, n, k N. [Solutions are sketched at the end of this note.] 1. m < n + 1 if and only if either m < n or m n. 2. m n if and only if either m < n or m n. 3. If m < n, then m n. 4. Writing m n for m < n or m n, we get: (i) n n. (ii) If m n and n m, then m n. (iii) If m n and n k, then m k. (iv) If m < n and n < k, then m < k. 5. If m < n, then m + 1 < n Exactly one of the following must be true: m < n, m n, or n < m. 7. If m + 1 n + 1, then m n. Theorem [Recursion Theorem]. Let A be a set, a A, and r : N A A any function. Then there exists a function f : N A such that (i) f(0) a, and (ii) f(n + 1) r(n, f(n)) for all n N. We say that the rule r together with the initial value a recursively define the sequence f. Proof. Put f {S N A (0, a) S n x[(n, x) S (n+1, r(n, x)) S]} N A. Then (i) (0, a) f and (ii) n x[(n, x) f (n + 1, r(n, x)) f]. Therefore, once we have shown that f is a function it will automatically have properties (i) and (ii) of the theorem. (A quick induction argument shows that the domain of f is N.) We 2
3 will prove by induction on m that f passes the vertical line test and is therefore a function: (m, x 1 ), (m, x 2 ) f x 1 x 2. Basic Step: Suppose there are (0, x 1 ), (0, x 2 ) f with x 1 x 2. Then either x 1 a or x 2 a. Say, x 1 a. Form the set S f \ {(0, x 1 )} N A. Observe that (i) (0, a) S, and (ii) that if (n, x) S, then (n, x) f so that (n + 1, r(n, x)) f. Hence, (n + 1, r(n, x)) S, because (n + 1, r(n, x)) (0, x 1 ) (since n + 1 0). So, by definition of f, f S. This contradicts the definition of S. Inductive Step: Suppose that (m + 1, x 1 ), (m + 1, x 2 ) f with x 1 x 2. If both x 1 r(m, z 1 ) for some (m, z 1 ) f and x 2 r(m, z 2 ) for some (m, z 2 ) f, then z 1 z 2 by inductive hypothesis, so that x 1 x 2 which is not the case. We can therefore assume, without loss of generality, that x 1 r(m, z) for all (m, z) f. Form the set S f \ {(m + 1, x 1 )} N A. As before, observe that (i) (0, a) S (since 0 m+1) and (ii) that if (n, x) S, then (n, x) f so that (n+1, r(n, x)) f. Hence, (n + 1, r(n, x)) S (otherwise m + 1 n + 1 and x 1 r(n, x) r(m, x) with (m, x) (n, x) f, which is not allowed). The definition of f implies now that f S, which in turn contradicts the definition of S. This completes the proof. We now use the recursion theorem to introduce addition and multiplication into our set of natural numbers. First we want to define what it means to add a natural number to a fixed m N. We do this by recursively defining a function f m : N N. We require that (i) f m (0) m; and (ii) f m (n + 1) f m (n) + 1. The recursion theorem guarantees the existence of such a function f m. We will of course write m + n for f m (n). (Notice that f m (1) f m (0) + 1 m + 1 so that there is no ambiguity in using m + 1 for both m {m} and f m (1).) In this more suggestive notation, the above two items read: (i) m + 0 m; and (ii) m + (n + 1) (m + n) + 1. Exercises. 8. Show that (m + n) + k m + (n + k) for all m, n, k N. 9. Show that m + n n + m for all m, n N. 3
4 We also define multiplication of a fixed m N by a natural number via the recursion theorem by way of a function g m : N N with the properties (i) g m (0) 0; and (ii) g m (n + 1) g m (n) + m. Writing m n for g m (n), this recursive definition can be written as (i) m 0 0; and (ii) m (n + 1) m n + m. Here, we make the usual convention that multiplication is carried out before addition, unless specified otherwise. Exercises. Prove the following for all m, n, k N. 10. m 1 1 m m. 11. (m + n) k m k + n k. 12. m n n m. 13. (m n) k m (n k). 14. If m < n, then m + k < n + k. 15. If m < n and k 0, then m k < n k. 16. If m k n k and k 0, then m n. 17. If m + k n + k then m n. 18. If m n 0, then either m 0 or n If m n, then there is exactly one d N such that m + d n. 4
5 Solutions. 1. This follows straight from the definition of n + 1 n {n} and the meaning of the symbol <. 2. We will prove, by induction on n, that m < n implies m n. The case n 0 is vacuously true. Now suppose that m < n + 1. Then either m < n or m n, by Exercise 1. Hence, by the inductive hypothesis, m n, so that m n {n} n + 1. Once more, we induct on n. If n 0, then m n. Inductively, suppose that m n + 1 n {n}. If n m, then m n, so that by inductive hypothesis either m n or m < n. Either way, this case implies that m n {n}, i.e. m < n+1. On the other hand, if n m, then n m by the first part of this proof. So, m n {n} n We show by induction on n that n n for all n N. Clearly, 0 0, so that the statement is true for n 0. Next, assuming that n n, we wish to prove that n + 1 n + 1. Suppose to the contrary that n + 1 n + 1. Then n + 1 < n or n + 1 n by Exercise 1. If n + 1 < n, then n {n} n + 1 n by Exercise 2. This implies n n; a contradiction. The alternative, n + 1 n, implies the same contradiction. 4. By Exercise 2, m n if and only if m n. 5. We induct on n. The basic step is vacuously true. Now suppose that m < n+1. We need to show that m + 1 < (n + 1) + 1. By Exercise 1, either m n or m < n. In the first case, m + 1 n + 1 < (n + 1) + 1. In the second case, the inductive hypothesis implies that m + 1 < n + 1 < (n + 1) + 1. Hence, m + 1 < (n + 1) + 1 by Exercise 4 (iv). 6. By Exercises 2 and 3, at most one of the three alternatives is possible. To show that at least one of them occurs, we induct on n. If n 0, then n m. (A quick induction shows that 0 k for all k N.) Our inductive hypothesis is now that either m < n, m n, or n < m. We need to show that either m < n + 1, m n + 1, or n + 1 < m. If m n, then m < n + 1. If m < n, then m < n < n + 1. Lastly, if n < m, then n + 1 < m + 1 by Exercise 5. So, by Exercise 1, either n + 1 < m or n + 1 m. 7. Follows from Exercises 5 and We induct on k. If k 0, then (m+n)+0 m+n m+(n+0). Assuming that the statement holds for k, we compute (m + n) + (k + 1) def [(m + n) + k] + 1 I.H. [m + (n + k)] + 1 def m + [(n + k) + 1] def m + (n + (k + 1)). 9. (a) First we prove, by induction on m, that m m. The basic step is a triviality: Here is the inductive step: (m + 1) + 0 m + 1 (m + 0) + 1 I.H. (0 + m) + 1 #8 0 + (m + 1). 5
6 (b) Next we show, by induction on m, that m+1 1+m. We can use Part (a) for the basic step: (although this also follows straight from the definitions). The inductive step is as follows: (m + 1) + 1 I.H. (1 + m) + 1 def 1 + (m + 1). (c) Now we prove, by induction on n, that m + n n + m. We did the basic step in Part (a). The inductive step is as follows: m + (n + 1) def (m + n) + 1 I.H. (n + m) + 1 def n + (m + 1) (b) n + (1 + m) #8 (n + 1) + m. 10. First notice that m 1 m (0 + 1) def m 0 + m def 0 + m #9 m + 0 m. So we only have to show that 1 m m also. One shows this by induction on m. The basic step follows from the definition: The inductive step is as follows: 1 (m + 1) def 1 m + 1 I.H. m + 1. def 11. Induct on k. Here is the inductive step: (m + n) (k + 1) (m+n) k +(m+n) #10+I.H. m k +n k +m 1+n 1 #9+def m (k +1)+n (k +1). 12. Induct on n. Here is the inductive step: m (n + 1) def m n + m I.H.+#10 n m + 1 m #11 (n + 1) m. 13. Induct on k. Here is the induction step: (m n) (k + 1) def (m n) k + m n I.H. m (n k) + m n #11,12 m (n k + n) def m (n (k + 1)). 14. Induct on k, using Exercise # Using the previous exercises, this is an easy induction on k. 16. The contrapositive of this statement follows immediately from Exercises #6 and # In conjunction with Exercise #7, this is a straight forward induction on k. 18. We prove the contrapositive: suppose m 0 and n 0. Since n < 0 (i.e. n ) is impossible, then, by Exercise #6, 0 < n. Hence, by Exercises #15 and #12, 0 m 0 0 m < n m m n, so that m n 0 (again by Exercise #6). 19. We only have to show the existence of such a d, uniqueness follows from Exercise #17. This is most easily done with an induction on n. If n 0, then m 0 and we can take d 0. Now suppose that m (n + 1). We will show that there is a d N such that m + d n + 1. If m n + 1, we take d 0. If m < n + 1, then m n by Exercise #1. We then use the inductive hypothesis to get a c N with m + c n and take d c
5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationa. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0.
For some problems, several sample proofs are given here. Problem 1. a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0.
More informationADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS
ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements
More informationMathematics 114L Spring 2018 D.A. Martin. Mathematical Logic
Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More informationn n P} is a bounded subset Proof. Let A be a nonempty subset of Z, bounded above. Define the set
1 Mathematical Induction We assume that the set Z of integers are well defined, and we are familiar with the addition, subtraction, multiplication, and division. In particular, we assume the following
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationMath 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10
Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10 Inductive sets (used to define the natural numbers as a subset of R) (1) Definition: A set S R is an inductive
More informationConvexity in R N Supplemental Notes 1
John Nachbar Washington University November 1, 2014 Convexity in R N Supplemental Notes 1 1 Introduction. These notes provide exact characterizations of support and separation in R N. The statement of
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationThe Arithmetical Hierarchy
Chapter 11 The Arithmetical Hierarchy Think of K as posing the problem of induction for computational devices, for it is impossible to tell for sure whether a given computation will never halt. Thus, K
More information2 Truth Tables, Equivalences and the Contrapositive
2 Truth Tables, Equivalences and the Contrapositive 12 2 Truth Tables, Equivalences and the Contrapositive 2.1 Truth Tables In a mathematical system, true and false statements are the statements of the
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationR(p, k) = the near regular complete k-partite graph of order p. Let p = sk+r, where s and r are positive integers such that 0 r < k.
MATH3301 EXTREMAL GRAPH THEORY Definition: A near regular complete multipartite graph is a complete multipartite graph with orders of its partite sets differing by at most 1. R(p, k) = the near regular
More informationSystems of modal logic
499 Modal and Temporal Logic Systems of modal logic Marek Sergot Department of Computing Imperial College, London utumn 2008 Further reading: B.F. Chellas, Modal logic: an introduction. Cambridge University
More informationMath 4603: Advanced Calculus I, Summer 2016 University of Minnesota Notes on Cardinality of Sets
Math 4603: Advanced Calculus I, Summer 2016 University of Minnesota Notes on Cardinality of Sets Introduction In this short article, we will describe some basic notions on cardinality of sets. Given two
More informationNumerical Sequences and Series
Numerical Sequences and Series Written by Men-Gen Tsai email: b89902089@ntu.edu.tw. Prove that the convergence of {s n } implies convergence of { s n }. Is the converse true? Solution: Since {s n } is
More informationMath 104: Homework 1 solutions
Math 10: Homework 1 solutions 1. The basis for induction, P 1, is true, since 1 3 = 1. Now consider the induction step, assuming P n is true and examining P n+1. By making use of the result (1 + +... +
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationThis chapter contains a very bare summary of some basic facts from topology.
Chapter 2 Topological Spaces This chapter contains a very bare summary of some basic facts from topology. 2.1 Definition of Topology A topology O on a set X is a collection of subsets of X satisfying the
More informationCardinality and ordinal numbers
Cardinality and ordinal numbers The cardinality A of a finite set A is simply the number of elements in it. When it comes to infinite sets, we no longer can speak of the number of elements in such a set.
More informationMathematical Reasoning & Proofs
Mathematical Reasoning & Proofs MAT 1362 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0
More informationHW Graph Theory SOLUTIONS (hbovik) - Q
1, Diestel 3.5: Deduce the k = 2 case of Menger s theorem (3.3.1) from Proposition 3.1.1. Let G be 2-connected, and let A and B be 2-sets. We handle some special cases (thus later in the induction if these
More informationDR.RUPNATHJI( DR.RUPAK NATH )
Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology
More informationThe constructible universe
The constructible universe In this set of notes I want to sketch Gödel s proof that CH is consistent with the other axioms of set theory. Gödel s argument goes well beyond this result; his identification
More informationThe Importance of Being Formal. Martin Henz. February 5, Propositional Logic
The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets
More informationIntroduction to Metalogic 1
Philosophy 135 Spring 2012 Tony Martin Introduction to Metalogic 1 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: (i) sentence letters p 0, p 1, p 2,... (ii) connectives,
More informationCONSTRUCTION OF THE REAL NUMBERS.
CONSTRUCTION OF THE REAL NUMBERS. IAN KIMING 1. Motivation. It will not come as a big surprise to anyone when I say that we need the real numbers in mathematics. More to the point, we need to be able to
More informationSupremum and Infimum
Supremum and Infimum UBC M0 Lecture Notes by Philip D. Loewen The Real Number System. Work hard to construct from the axioms a set R with special elements O and I, and a subset P R, and mappings A: R R
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationInduction 1 = 1(1+1) = 2(2+1) = 3(3+1) 2
Induction 0-8-08 Induction is used to prove a sequence of statements P(), P(), P(3),... There may be finitely many statements, but often there are infinitely many. For example, consider the statement ++3+
More information2. Introduction to commutative rings (continued)
2. Introduction to commutative rings (continued) 2.1. New examples of commutative rings. Recall that in the first lecture we defined the notions of commutative rings and field and gave some examples of
More information10 Propositional logic
10 The study of how the truth value of compound statements depends on those of simple statements. A reminder of truth-tables. and A B A B F T F F F F or A B A B T F T F T T F F F not A A T F F T material
More informationSuppose R is an ordered ring with positive elements P.
1. The real numbers. 1.1. Ordered rings. Definition 1.1. By an ordered commutative ring with unity we mean an ordered sextuple (R, +, 0,, 1, P ) such that (R, +, 0,, 1) is a commutative ring with unity
More informationAxioms for Set Theory
Axioms for Set Theory The following is a subset of the Zermelo-Fraenkel axioms for set theory. In this setting, all objects are sets which are denoted by letters, e.g. x, y, X, Y. Equality is logical identity:
More informationIntroduction to Basic Proof Techniques Mathew A. Johnson
Introduction to Basic Proof Techniques Mathew A. Johnson Throughout this class, you will be asked to rigorously prove various mathematical statements. Since there is no prerequisite of a formal proof class,
More informationThe Integers. Peter J. Kahn
Math 3040: Spring 2009 The Integers Peter J. Kahn Contents 1. The Basic Construction 1 2. Adding integers 6 3. Ordering integers 16 4. Multiplying integers 18 Before we begin the mathematics of this section,
More informationLecture 3 - Tuesday July 5th
Lecture 3 - Tuesday July 5th jacques@ucsd.edu Key words: Identities, geometric series, arithmetic series, difference of powers, binomial series Key concepts: Induction, proofs of identities 3. Identities
More informationExercises 1 - Solutions
Exercises 1 - Solutions SAV 2013 1 PL validity For each of the following propositional logic formulae determine whether it is valid or not. If it is valid prove it, otherwise give a counterexample. Note
More informationSolution. 1 Solutions of Homework 1. 2 Homework 2. Sangchul Lee. February 19, Problem 1.2
Solution Sangchul Lee February 19, 2018 1 Solutions of Homework 1 Problem 1.2 Let A and B be nonempty subsets of R + :: {x R : x > 0} which are bounded above. Let us define C = {xy : x A and y B} Show
More informationChapter 1 The Real Numbers
Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus
More informationA NEW SET THEORY FOR ANALYSIS
Article A NEW SET THEORY FOR ANALYSIS Juan Pablo Ramírez 0000-0002-4912-2952 Abstract: We present the real number system as a generalization of the natural numbers. First, we prove the co-finite topology,
More informationPacket #1: Logic & Proofs. Applied Discrete Mathematics
Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should
More informationSOME TRANSFINITE INDUCTION DEDUCTIONS
SOME TRANSFINITE INDUCTION DEDUCTIONS SYLVIA DURIAN Abstract. This paper develops the ordinal numbers and transfinite induction, then demonstrates some interesting applications of transfinite induction.
More informationThe Integers. Math 3040: Spring Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers Multiplying integers 12
Math 3040: Spring 2011 The Integers Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers 11 4. Multiplying integers 12 Before we begin the mathematics of this section, it is worth
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationCHAPTER 4 SOME METHODS OF PROOF
CHAPTER 4 SOME METHODS OF PROOF In all sciences, general theories usually arise from a number of observations. In the experimental sciences, the validity of the theories can only be tested by carefully
More informationAxiomatic set theory. Chapter Why axiomatic set theory?
Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its
More informationAnnouncements. Read Section 2.1 (Sets), 2.2 (Set Operations) and 5.1 (Mathematical Induction) Existence Proofs. Non-constructive
Announcements Homework 2 Due Homework 3 Posted Due next Monday Quiz 2 on Wednesday Read Section 2.1 (Sets), 2.2 (Set Operations) and 5.1 (Mathematical Induction) Exam 1 in two weeks Monday, February 19
More informationMath 421, Homework #6 Solutions. (1) Let E R n Show that = (E c ) o, i.e. the complement of the closure is the interior of the complement.
Math 421, Homework #6 Solutions (1) Let E R n Show that (Ē) c = (E c ) o, i.e. the complement of the closure is the interior of the complement. 1 Proof. Before giving the proof we recall characterizations
More informationA Guide to Proof-Writing
A Guide to Proof-Writing 437 A Guide to Proof-Writing by Ron Morash, University of Michigan Dearborn Toward the end of Section 1.5, the text states that there is no algorithm for proving theorems.... Such
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More informationIntroduction to Real Analysis Alternative Chapter 1
Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces
More informationMetainduction in Operational Set Theory
Metainduction in Operational Set Theory Luis E. Sanchis Department of Electrical Engineering and Computer Science Syracuse University Syracuse, NY 13244-4100 Sanchis@top.cis.syr.edu http://www.cis.syr.edu/
More informationMEETING 9 - INDUCTION AND RECURSION
MEETING 9 - INDUCTION AND RECURSION We do some initial Peer Instruction... Predicates Before we get into mathematical induction we will repeat the concept of a predicate. A predicate is a mathematical
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 3
EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 3 Induction Induction is an extremely powerful tool in mathematics. It is a way of proving propositions that hold for all
More informationProof Techniques (Review of Math 271)
Chapter 2 Proof Techniques (Review of Math 271) 2.1 Overview This chapter reviews proof techniques that were probably introduced in Math 271 and that may also have been used in a different way in Phil
More informationWUCT121. Discrete Mathematics. Numbers
WUCT121 Discrete Mathematics Numbers 1. Natural Numbers 2. Integers and Real Numbers 3. The Principle of Mathematical Induction 4. Elementary Number Theory 5. Congruence Arithmetic WUCT121 Numbers 1 Section
More informationNOTES (1) FOR MATH 375, FALL 2012
NOTES 1) FOR MATH 375, FALL 2012 1 Vector Spaces 11 Axioms Linear algebra grows out of the problem of solving simultaneous systems of linear equations such as 3x + 2y = 5, 111) x 3y = 9, or 2x + 3y z =
More informationMath 10850, fall 2017, University of Notre Dame
Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need
More informationLecture 14 Rosser s Theorem, the length of proofs, Robinson s Arithmetic, and Church s theorem. Michael Beeson
Lecture 14 Rosser s Theorem, the length of proofs, Robinson s Arithmetic, and Church s theorem Michael Beeson The hypotheses needed to prove incompleteness The question immediate arises whether the incompleteness
More informationPeano Arithmetic. CSC 438F/2404F Notes (S. Cook) Fall, Goals Now
CSC 438F/2404F Notes (S. Cook) Fall, 2008 Peano Arithmetic Goals Now 1) We will introduce a standard set of axioms for the language L A. The theory generated by these axioms is denoted PA and called Peano
More informationT (s, xa) = T (T (s, x), a). The language recognized by M, denoted L(M), is the set of strings accepted by M. That is,
Recall A deterministic finite automaton is a five-tuple where S is a finite set of states, M = (S, Σ, T, s 0, F ) Σ is an alphabet the input alphabet, T : S Σ S is the transition function, s 0 S is the
More informationand this makes M into an R-module by (1.2). 2
1. Modules Definition 1.1. Let R be a commutative ring. A module over R is set M together with a binary operation, denoted +, which makes M into an abelian group, with 0 as the identity element, together
More informationCmSc 250 Intro to Algorithms. Mathematical Review. 1. Basic Algebra. (a + b) 2 = a 2 + 2ab + b 2 (a - b) 2 = a 2-2ab + b 2 a 2 - b 2 = (a + b)(a - b)
CmSc 250 Intro to Algorithms Mathematical Review 1. Basic Algebra (a + b) 2 = a 2 + 2ab + b 2 (a - b) 2 = a 2-2ab + b 2 a 2 - b 2 = (a + b)(a - b) a/x + b/y = (ay + bx)/xy 2. Exponents X n = XXX..X, n
More informationMath 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008
Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together
More informationCHAPTER 3: THE INTEGERS Z
CHAPTER 3: THE INTEGERS Z MATH 378, CSUSM. SPRING 2009. AITKEN 1. Introduction The natural numbers are designed for measuring the size of finite sets, but what if you want to compare the sizes of two sets?
More informationMATH 54 - TOPOLOGY SUMMER 2015 FINAL EXAMINATION. Problem 1
MATH 54 - TOPOLOGY SUMMER 2015 FINAL EXAMINATION ELEMENTS OF SOLUTION Problem 1 1. Let X be a Hausdorff space and K 1, K 2 disjoint compact subsets of X. Prove that there exist disjoint open sets U 1 and
More informationConsequences of Continuity
Consequences of Continuity James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University October 4, 2017 Outline 1 Domains of Continuous Functions 2 The
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
More informationCHAPTEER - TWO SUBGROUPS. ( Z, + ) is subgroup of ( R, + ). 1) Find all subgroups of the group ( Z 8, + 8 ).
CHAPTEER - TWO SUBGROUPS Definition 2-1. Let (G, ) be a group and H G be a nonempty subset of G. The pair ( H, ) is said to be a SUBGROUP of (G, ) if ( H, ) is group. Example. ( Z, + ) is subgroup of (
More informationNOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty.
EXAM 2 solutions (COT3100, Sitharam, Spring 2017) NAME:last first: UF-ID Section NOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty. (1) Are the following functions one-to-one
More informationA BRIEF INTRODUCTION TO ZFC. Contents. 1. Motivation and Russel s Paradox
A BRIEF INTRODUCTION TO ZFC CHRISTOPHER WILSON Abstract. We present a basic axiomatic development of Zermelo-Fraenkel and Choice set theory, commonly abbreviated ZFC. This paper is aimed in particular
More information1 Differentiability at a point
Notes by David Groisser, Copyright c 2012 What does mean? These notes are intended as a supplement (not a textbook-replacement) for a class at the level of Calculus 3, but can be used in a higher-level
More informationCHAPTER 8: EXPLORING R
CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed
More informationThe natural numbers. The natural numbers come with an addition +, a multiplication and an order < p < q, q < p, p = q.
The natural numbers N = {0, 1,, 3, } The natural numbers come with an addition +, a multiplication and an order < p, q N, p + q N. p, q N, p q N. p, q N, exactly one of the following holds: p < q, q
More informationz -FILTERS AND RELATED IDEALS IN C(X) Communicated by B. Davvaz
Algebraic Structures and Their Applications Vol. 2 No. 2 ( 2015 ), pp 57-66. z -FILTERS AND RELATED IDEALS IN C(X) R. MOHAMADIAN Communicated by B. Davvaz Abstract. In this article we introduce the concept
More informationPeter Kahn. Spring 2007
MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 1 The Natural Numbers 1 1.1 The Peano Axioms............................ 2 1.2 Proof by induction............................ 4 1.3
More informationCHAPTER 1. Relations. 1. Relations and Their Properties. Discussion
CHAPTER 1 Relations 1. Relations and Their Properties 1.1. Definition of a Relation. Definition 1.1.1. A binary relation from a set A to a set B is a subset R A B. If (a, b) R we say a is Related to b
More informationTutorial on Axiomatic Set Theory. Javier R. Movellan
Tutorial on Axiomatic Set Theory Javier R. Movellan Intuitively we think of sets as collections of elements. The crucial part of this intuitive concept is that we are willing to treat sets as entities
More informationExercises Chapter II.
Page 64 Exercises Chapter II. 5. Let A = (1, 2) and B = ( 2, 6). Sketch vectors of the form X = c 1 A + c 2 B for various values of c 1 and c 2. Which vectors in R 2 can be written in this manner? B y
More informationHOW TO CREATE A PROOF. Writing proofs is typically not a straightforward, algorithmic process such as calculating
HOW TO CREATE A PROOF ALLAN YASHINSKI Abstract We discuss how to structure a proof based on the statement being proved Writing proofs is typically not a straightforward, algorithmic process such as calculating
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More information18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015)
18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015) 1. Introduction The goal for this course is to provide a quick, and hopefully somewhat gentle, introduction to the task of formulating
More information1 Sequences and Summation
1 Sequences and Summation A sequence is a function whose domain is either all the integers between two given integers or all the integers greater than or equal to a given integer. For example, a m, a m+1,...,
More informationModule 7 D and Equivalent Systems
Module 7 D and Equivalent Systems G J Mattey May 2, 2007 Contents 1 he Semantical System DI 1 2 he Derivational System DD 4 3 he Axiom System D 6 4 Applications of the D-Systems 6 In this and subsequent
More informationPrinciples of Real Analysis I Fall I. The Real Number System
21-355 Principles of Real Analysis I Fall 2004 I. The Real Number System The main goal of this course is to develop the theory of real-valued functions of one real variable in a systematic and rigorous
More informationThe Real Number System
MATH 337 The Real Number System Sets of Numbers Dr. Neal, WKU A set S is a well-defined collection of objects, with well-defined meaning that there is a specific description from which we can tell precisely
More informationCountable Menger s theorem with finitary matroid constraints on the ingoing edges
Countable Menger s theorem with finitary matroid constraints on the ingoing edges Attila Joó Alfréd Rényi Institute of Mathematics, MTA-ELTE Egerváry Research Group. Budapest, Hungary jooattila@renyi.hu
More informationBOREL SETS ARE RAMSEY
BOREL SETS ARE RAMSEY Yuval Khachatryan January 23, 2012 1 INTRODUCTION This paper is my rewrite of the first part of the paper which was published in the Journal of Symbold Logic in 1973 by Fred Galvin
More informationSome Basic Notations Of Set Theory
Some Basic Notations Of Set Theory References There are some good books about set theory; we write them down. We wish the reader can get more. 1. Set Theory and Related Topics by Seymour Lipschutz. 2.
More informationPreference, Choice and Utility
Preference, Choice and Utility Eric Pacuit January 2, 205 Relations Suppose that X is a non-empty set. The set X X is the cross-product of X with itself. That is, it is the set of all pairs of elements
More informationPropositional Logic, Predicates, and Equivalence
Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If
More informationMAGIC Set theory. lecture 6
MAGIC Set theory lecture 6 David Asperó Delivered by Jonathan Kirby University of East Anglia 19 November 2014 Recall: We defined (V : 2 Ord) by recursion on Ord: V 0 = ; V +1 = P(V ) V = S {V : < } if
More informationRamsey Theory. May 24, 2015
Ramsey Theory May 24, 2015 1 König s Lemma König s Lemma is a basic tool to move between finite and infinite combinatorics. To be concise, we use the notation [k] = {1, 2,..., k}, and [X] r will denote
More informationThus, X is connected by Problem 4. Case 3: X = (a, b]. This case is analogous to Case 2. Case 4: X = (a, b). Choose ε < b a
Solutions to Homework #6 1. Complete the proof of the backwards direction of Theorem 12.2 from class (which asserts the any interval in R is connected). Solution: Let X R be a closed interval. Case 1:
More informationSyntactic Conditions for Antichain Property in CR-Prolog
This version: 2017/05/21 Revising my paper before submitting for publication. Syntactic Conditions for Antichain Property in CR-Prolog Vu Phan Texas Tech University Abstract We study syntactic conditions
More information