Basic properties of the Integers
|
|
- Robert Hawkins
- 5 years ago
- Views:
Transcription
1 Basic properties of the Integers Branko Ćurgus May 2, Axioms for the Integers In the axioms below we use the standard logical operators: conjunction, disjunction, exclusive disjunction, implication, universal quantifier, existential quantifier. We also use the standard set notation: set membership, subset, equality =, negation of equality, the empty set, Cartesian product. For singleton sets instead of writing {a} = {b} we write a = b. The notation f : A B stands for a function f which is defined on a set A with the values in B. Axiom 1 below establishes the existence of the addition function defined on Z Z with the values in Z. It is common to denote the value of + at a pair a,b Z Z by a+b. Axiom 6 establishes the existence of the function multiplication function defined on Z Z with the values in Z. It is common to denote the valueof this function at a pair a,b Z Z by a b which is almost always abbreviated as ab. Axiom 12 introduces a strict total order < on Z. In Axiom 16 we use the abbreviation a b for the proposition a < b a = b. This axiom is the subtlest of all the axioms. Axiom 0 ZE. Z is a nonempty set. Axiom 1 AE. There exists a function + : Z Z Z. Axiom 2 AA. a Z b Z c Z a+b+c = a+b+c Axiom 3 AC. a Z b Z a+b = b+a Axiom 4 AZ. 0 Z a Z 0+a = a 1
2 Axiom 5 AO. a Z x Z a+x = 0 Axiom 6 ME. There exists a function : Z Z Z. Axiom 7 MA. a Z b Z c Z abc = abc Axiom 8 MC. a Z b Z ab = ba Axiom 9 MO. 1 Z 1 0 a Z 1 a = a Axiom 10 MZ. a Z b Z ab = 0 a = 0 b = 0 Axiom 11 DL. a Z b Z c Z ab+c = ab+ac Axiom 12 OE. a Z b Z a < b a = b b < a Axiom 13 OT. a Z b Z c Z a < b b < c a < c Axiom 14 OA. a Z b Z c Z a < b a+c < b+c Axiom 15 OM. a Z b Z c Z a < b 0 < c ac < bc Axiom 16 WO. S Z S x S 0 < x m S x S m x Explanation of abbreviations: ZE - integers exists, AE - addition exists, AA - addition is associative, AC - addition is commutative, AZ - addition has zero, AO - addition has opposites, ME - multiplication exists, MA - multiplication is associative, MC - multiplication is commutative, MO - multiplication has one, MZ - multiplication respects zero, DL - distributive law, OE - order exists, OT - order is transitive, OA - order respects addition, OM - order respects multiplication, WO - the well-ordering axiom. The following implications will be used in the proofs without being mentioned explicitly: a Z b Z c Z a = b b = c a = c 1.1 a Z b Z c Z a = b b < c a < c 1.2 a Z b Z c Z d Z a = b c = d a+c = b+d 1.3 a Z b Z c Z d Z a = b c = d ac = bd 1.4 Implication 1.1 follows from the implication A = B B = C A = C which is easily proved for sets A,B,C. Implication 1.2 is proved by contradiction. First we form the negation of 1.2: a Z b Z c Z a = b b < c c = a c < a. 1.5 Next we prove that 1.5 implies a false proposition. Since the conjunction is distributive with respect to the exclusive disjunction, 1.5 is equivalent to the quantifiers are dropped to save the space a = b b < c c = a a = b b < c c < a
3 Using the commutativity of conjunction and 1.1, the proposition 1.6 implies b = c b < c a = b b < c c < a. By Axiom OT the last proposition implies b = c b < c a = b b < a. 1.7 Further, Axiom OE implies that both b = c b < c and a = b b < a are false. Thus 1.7 is false. Since we proved that 1.5 implies 1.7 is true, we must have that 1.5 is false. This proves that 1.2, the negation of 1.5, is true. The implications 1.3 and 1.4 follow from the fact that the addition and the multiplication are functions. 2 Basic algebraic properties of the integers In this section we list properties of the integers which involve the axioms related to the addition and the multiplication, but not the order. Proposition 2.1. The element 0 Z introduced in AxiomAZ is unique. Proof. Assume that there exist 0 Z such that 0 + a = a for all a Z. Since 0 Z universal instantiation yields, = 0. Applying universal instantiation with 0 Z to AxiomAZ we get = 0. Since by AxiomAC and universal instantiation, we have 0 +0 = 0+0. The last three equalities yield 0 = 0. Proposition 2.2. For every a Z the equation a+x = 0 has a unique solution. Proof. Let a Z be arbitrary. By Axiom AO the equation a + x = 0 has a solution. Assume that a + x = 0 and a + x = 0. Since addition is a function, a + x = 0 implies x +a+x = x +0. Using AxiomsAA andaz we deduce x +a+x = x. By assumption a+x = 0, hence 0+x = x, and by AxiomAZ x = x. Definition 2.3. Let a Z. The unique solution of the equation a+x = 0 is denoted by a and called the opposite of a. For b Z we write b a instead of b+ a. Proposition = 0. Proof. By Definition is the unique solution of the equation 0 + x = 0. Since by AxiomAZ we have 0+0 = 0, we deduce 0 = 0. Proposition 2.5. For every a Z we have a0 = 0a = 0. 3
4 Proof. Let a Z be arbitrary. By AxiomAZ and universal instantiation we have 0+0 = 0. Since the multiplication is a function a0 + 0 = a0. By Axiom DL a0 + a0 = a0. By Axiom ME a0 Z. Hence a0 Z exists by Axiom AO. Now a0 + a0 = a0 yields a0+a0 a0 = a0 a0. By AxiomAA andao we obtain a0 = 0. AxiomAC now yields a0 = 0a = 0. Proposition 2.6. Let a,b and c be integers. Then a+c = b+c implies a = b. Proof. Exercise. Proposition 2.7. For every a Z we have a = a. Proof. Let a Z be arbitrary. By definition a is the unique solution of the equation a + x = 0. Since by definition of a we have a + a = 0 and since by Axiom AC a+a = a+ a = 0, we see that a is a solution of a+x = 0. By Proposition2.2 we conclude that a = a. Proposition 2.8. For every a Z and for every b Z we have ab = b a = ab. Proof. Let a and b be be arbitrary integers. Then by AxiomAO we have a+ a = 0. By AxiomsME, we have a+ a b = 0b. Now, AxiomsMC anddl and Proposition2.5 yield ab + ab = 0. Thus, ab is a solution of ab + x = 0. By Definition2.3, this implies ab = ab and AxiomMC yields ab = b a = ab. Proposition 2.9. For every a Z and for every b Z we have a b = ab. Proof. Let a and b be arbitrary integers. By Proposition2.8 we have a b = a b. Applying Proposition2.8 yields a b = ab. Hence a b = ab. Now, Proposition2.7 implies ab = ab, and consequently a b = ab. 3 Basic properties of the integers involving the order Proposition 3.1. Let a and b be integers. Then a < b if and only if b < a. Proof. Let a and b be arbitrary integers. Assume a < b. Since a+ b is an integer, by AxiomOA we deduce a+ a+ b < b+ a+ b. By AxiomsAA and AC we conclude a+ a + b < b+ b + a. Now, by the definition of an opposite and AxiomsAZ we conclude b < a. The converse b < a a < b is proved similarly. Proposition 3.2. Let a,b and c be integers. Then a < b and c < 0 imply bc < ac. 4
5 Proof. Let a,b and c be arbitrary integers. Assume a < b and c < 0. Then by Propositions 3.1 and < c. Now, a < b, 0 < c and AxiomOM imply a c < b c. By Proposition 2.8, the lase inequality can be rewritten as ac < bc. By Propositions 3.1 the last inequality implies bc < ac. Proposition 3.3. Let a,b and c be integers. Then ac < bc and 0 < c imply a < b. Proof. Leta,bandcbearbitraryintegers. Noticethatthispropositionhastheformp q r which is equivalent to r q p. Therefore we will prove a b 0 < c ac bc. since a b means a > b or a = b we will proceed with two cases. If a > b, then, since 0 < c, by AxiomOM we conclude ac > bc and thus also ac bc. In the second case, if a = b, then AxiomME, that is the fact that the multiplication is a function, implies that ac = bc. So, ac bc in this case as well. Proposition 3.4. Let a and b be integers. Assume 0 < a. Then 0 < b if and only if 0 < ab. Proof. Let a and b be arbitrary integers. Throughout this proof we assume that 0 < a. We first prove 0 < b 0 < ab. Assume 0 < b. Since 0 < a and 0 < b, AxiomOM implies 0b < ab. Since by Proposition 2.5 0b = 0, we have 0 < ab. To prove the converse assume that 0 < ab. Proposition 2.5 and AxiomMC yield 0a < ba. Since 0 < a, Proposition 3.3 implies 0 < b. Definition 3.5. For a Z the product aa is called the square of a and it is denoted by a 2. Proposition 3.6. For every nonzero integer a we have 0 < a 2. Proof. Let a be an arbitrary nonzero integer. By Axiom OE we have two possibilities for a: either 0 < a or a < 0. Case 1. Assume 0 < a. By Propositions 3.1 and 2.4 we have that a < 0. Since 0 < a, Axiom OM yields a a < 0 a. By Propositions 2.5 and 2.8 we deduce a a < 0. By Propositions 3.1 and 2.4 we deduce 0 < a 2. Case 2. Assume a < 0. By Propositions 3.1 and 2.4 we have that 0 < a. Since 0 < a, Axiom OM yields 0 a a < 0 a. By Propositions 2.5 and 2.8 we deduce a a < 0. By Propositions 3.1 and 2.4 we deduce 0 < a 2. Corollary < 1. Proof. By Axiom MO we have 1 0. By Proposition 3.6 we deduce 0 < 1 2. By Axiom OM 1 2 = 1. Thus, 0 < 1. A different proof proceeds by contradicting. Assume 1 < 0. Then, by Propositions 2.4 and 2.7, we have 0 < 1. Since 1 < 0 and 0 < 1, Axiom OM implies 1 1 < 0 1. By Axiom AO and Proposition 2.5 we deduce 1 < 0. By Propositions 2.4 and 2.7 the last inequality yields 0 < 1. Thus, we proved that 1 < 0 implies 0 < 1 is true. The implication p p can be true only if p is false. Hence 1 < 0 is false. That is 0 < 1 is true. 5
6 Corollary 3.8. For every a Z we have a < a+1. Proof. Let a Z be arbitrary. Since 0 < 1, Axiom OA implies 0+a < 1+a. By Axioms AZ and AC we have a < a+1. By Corollary 3.8, 1 < 1+1. Therefore we define Definition = 1+1. By Corollary 3.8, 2 < 2+1. Therefore we define Definition = 2+1, 4 = 3+1, 5 = 4+1, 6 = 5+1, 7 = 6+1, 8 = 7+1, 9 = 8+1. By Corollary 3.8, 0 < 1 < 2 < 3 < 4 < 5 < 6 < 7 < 8 < 9. Exercise Prove 2+2 = 4. Exercise Prove 2 2 = 4. Definition Let a Z. If a > 0, then a is said to be positive. If a < 0, then a is said to be negative. We define Z + = { y Z 0 < y } and Z = { x Z x < 0 }. 4 The Well Ordering Axiom Definition 4.1. Let S be a nonempty subset of Z. We say that S has a minimum if there exists m S such that for every x S we have m x. Formally, S has a minimum m S x S m x. 4.1 The integer m S satisfying the proposition on the right-hand side of 4.1 is called the minimum of S. It is denoted by mins. With this definition the well ordering AxiomWO can be restated as S Z + S S has a minimum 4.2 Recall that the propositions p q r and p r q are equivalent. Consequently, the well ordering AxiomWO, as stated in 4.2, is equivalent to S Z + S does not have a minimum S = 4.3 At this point it is useful to note the formal meaning of the phrase S does not have a minimum. Negating 4.1 we get: S does not have a minimum x S y S y < x. I will illustrate how to use 4.3 in the following proposition. 6
7 Proposition 4.2. There are no integers between 0 and 1. Proof. Define a set S by S = {x Z 0 < x x < 1}. Clearly S Z +. Next we will prove that S does not have a minimum. Let x S be arbitrary. Then 0 < x and x < 1. The last two inequalities and AxiomOM imply x 2 < x. Since x 0, Proposition 3.6 implies 0 < x 2. Since x 2 < x and x < 1, AxiomOT imply x 2 < 1. Now we have, x 2 Z and 0 < x 2 and x < 1. Thus, x 2 S and also x 2 < x. Hence we have proved that for every x S there exists y = x 2 S such that y = x 2 < x. That is, S does not have a minimum. By 4.3, we deduce S =. The next proposition can be deduced from the previous one. However, I will give a direct proof. Proposition 4.3. The minimum of Z + is 1. Proof. Since 1 Z + the set Z + is not empty. Since clearly Z + Z +, AxiomWO implies that Z + has a minimum. Denote by m the minimum of Z + ; that is, set m = minz +. Recall that m has the following properties: m Z + and x Z + m x. 4.4 Since 1 Z + we have m 1. Since m > 0, Axiom OM yields m 2 m. Since 0 < m by Axiom OM 0 < m 2. Thus m 2 Z +. Since m = minz + we conclude m m 2. Since both m 2 m and m m 2, we have m = m 2, that is mm 1 = 0. Now Axiom MZ implies m = 0 or m 1 = 0. Since m > 0, disjunctive syllogism yields m 1 = 0. That is m = 1 is proved. Definition 4.4. An integer a is a square if there exists an integer b such that a = b 2. Proposition 4.5. Let s be an integer. If s and 2s are both square, then s = 0. Proof. In this proof we shall use the fact that an integer x is even if and only if x 2 is even. Consider the set Clearly S Z +. S = { s Z s > 0, s and 2s are squares }. Next we shall prove that S does not have a minimum. Let s S be arbitrary. Then s > 0 and there exist positive integers j and k such that s = j 2 and 2s = k 2. Since k 2 is even, the integer k is even. Therefore there exist a positive integer m such that k = 2m. Thus, 2s = 4m 2, or, equivalently s = 2m 2. Clearly, m 2 < 2m 2 = s. Since m is positive, m 2 > 0. Now we have that m 2 > 0 and both integers m 2 and 2m 2 = s are square. Therefore m 2 S and m 2 < s. Consequently s is not a minimum of S. Since s S was arbitrary element in S, we have proved that S does not have a minimum. By AxiomWO, see 4.3, 7
8 S =. Thus, there are no positive integers s such that both s and 2s are squares. Therefore, if s and s 2 are both square, then s 0. Since for each square number s by Proposition 3.6 we have s 0, we conclude that s = 0. Proposition 4.6. If p Z and q Z +, then p 2 2q 2. Proof. Let p Z and q Z +. Proposition 4.5 is equivalent to: If s is a square and s 0, then 2s is not a square. Applying this to q 2 we conclude that 2q 2 is not a square. Since p 2 is a square, we conclude p 2 2q 2. The preceding proposition implies that a square of a rational number cannot equal 2. In other words, 2 is irrational. 5 Proof of the principle of mathematical induction In the next theorem the universe of discourse is the set Z + of positive integers. Theorem 5.1. Let Pn be a propositional function involving a positive integer n. Then P1 k Pk Pk+1 n Pn Proof. Recall that the implications p q r and p r q are equivalent. Therefore we will prove: P1 j Pj k Pk Pk Assume P1 and j Pj. That is, assume that there exists j 0 Z + such that Pj 0. Now consider the set S = { n Z + Pn } = { n n Z + Pn }. Clearly S Z + and j 0 S. Hence S Z + S is true. This and AxiomWO, via modus ponens, yield that the set S has a minimum, that is, m S x S m x
9 Since m S we have m Z + and Pm. Since P1 is true we have m > 1. Consequently, by Axiom OA and the definition of 1, we have m 1 > 0. Thus, m 1 Z +. Next we rewrite the proposition 5.2. First, we notice that the proposition x S m x is equivalent to which is further equivalent to Thus 5.2 is equivalent to x x S m x, x x < m x S. m S x x < m x S. 5.3 Define k = m 1. Then k Z +. Further, since k < m, 5.3 implies k S. Since n S is equivalent to n Z + Pn, k S is equivalent to k Z + Pk. Since k Z +, by disjunctive syllogism we deduce Pk is true. Recall that k +1 = m S. Hence Pk +1 is true. Thus, by setting k = m 1, we just proved that k Pk Pk +1 is true. This completes the proof. 6 Even and Odd Integers First recall the definitions of even and odd integers. The set of all even integers we denote by E and the set of all odd integers we denote by O. For n Z we define Proposition 6.1. E O =. n E k Z n = 2k, 6.1 n O k Z n = 2k Proof. We prove this by contradiction. Assume that E O is a nonempty set. Let n E O. Then there exist k,j Z such that n = 2k = 2j+1. Hence, there exists m = k j Z such that 1 = 2m. Recall that we proved 0 < 1 < 2. Substituting 1 = 2m, we get 0 < 2m < 2. Since 0 < 2, Proposition 3.3 applied to 2 0 < 2m, yields 0 < m. Proposition 3.3 applied to 2m < 2 1, yields m < 1. Thus, we have 0 < m and m < 1 and m Z. By Proposition 4.2 the statement 0 < m and m < 1 and m Z is false. Since the assumption that E O leads to a false statement, we proved E O =. 9
10 Proposition 6.2. E O = Z. Proof. First we prove that Z + E O. In other words we prove n Z + n E n O The last displayed statement can be proved by Mathematical Induction. Set Pn to be n E n O. Since 1 = we have 1 O. Therefore, 1 E 1 O is true. So, the base step P1 is true. Next we prove the inductive step. Let n Z + be arbitrary and prove the implication Pn Pn + 1. Assume that Pn is true. That is, assume that n E n O. Consider two cases. For Case 1, assume n E. Clearly n E implies n+1 O. Therefore, n + 1 E n + 1 O is true. Thus Pn+1 holds in this case. For Case 2, assume n O. Clearly n O implies n+1 E. Therefore, n+1 E n+1 O is true. Thus Pn+1 holds in this case as well. Thus, for every n Z + we proved that Pn Pn+1. By Mathematical induction, this proves that n Z + we have n E n O. In other words, Z + E O. Since 0 = 2 0, we have 0 E. Hence, 0 E O. Finally we prove that Z E O. Let n Z be such that n < 0. Then n > 0 and thus, n E O. Now consider two cases. Case 1: if n E, then n = 2k for some k Z. Hence, n = 2 k with k Z. Consequently, n E. Case 2: if n O, then n = 2j + 1 for some j Z. Hence, n = 2 j 1 = 2 j with j 1 Z. Consequently, n O. In either case, n E O. In conclusion, we have proved that for every n Z we have n E O. That is E O = Z. 7 The division algorithm The following theorem is called the division algorithm. Proposition 7.1. Let n be an integer and let d be a positive integer. Then there exist unique integers q and r such that n = dq +r and 0 r < d. Proof. Let n Z and let d Z +. Define the set { S = k Z k 0 j Z k = n dj }. By the definition of S we have S Z and S is bounded below by 0. 10
11 Next we prove that S is a nonempty set. We distinguish two cases for n: n 0 and n < 0. If n 0, then n S since n = n d 0 0. Now assume that n < 0. Then n > 0. Now n > 0 and d 1, imply nd n. Adding n to both sides of nd n we get n dn n n = 0. Since with j = n k = n dj = n dn S we have proved that S in this case. Thus, in each case we identified an integer in S, so S is a nonempty set. Since S is both bounded below and nonempty, Proposition?? implies that S has a minimum. Denote that minimum by r. The integer r has the following two properties: r S and r k for all k S. Since r S, we have r 0 and there exists q Z such that r = n dq. Hence we proved that there exist integers r and q such that n = dq + r and r 0. It remains to prove that r < d. Consider the integer r d. As d > 0 we have r d < r. Since x S implies r x, the contrapositive of the last implication yields r d S. Since x S x 0 j Z x = n dj r d S means r d < 0 j Z r d n dj. 7.1 However, we know that the following is true Thus r d = n dq d = n dq +1. j Z r d = n dj. 7.2 By disjunctive syllogism, 7.1 and 7.2 yield r d < 0. That is r < d. It remains to prove the uniqueness of r and q. Assume that q,r,q,r are integers such that n = dq+r 0 r < d and n = dq +r 0 r < d. Then dq +r = dq +r and 0 r < d and d < r 0. Simplifying the first equality and adding the last two inequalities we get Hence Since 0 < d, Proposition 3.3 implies r r = dq q and d < r r < d. d < dq q < d. 1 < q q < 1. In Proposition 4.2 we proved that there are no integers between 0 and 1. Since q q is an integer we must have 1 < q q 0. Multiplying by 1 < 0 and using Proposition 3.2 we conclude 0 q + q < 1. Now Proposition 4.2 yields q +q = 0. That is q = q. Since r r = dq q we also conclude that r = r. 11
12 Definition 7.2. The integer r in Proposition 7.1 is called the remainder left by n when divided by m. Example 7.3. When divided by 5, the integer 17 leaves a remainders of 2: 17 = When divided by 5, the integer 17 leaves a remainder of 3: 17 = Definition 7.4. Let n be an integer. Let r be the remainder left by n when divided by 2. Then r = 0 or r = 1. We say that n is even if r = 0 and that n is odd if r = 1. Remark 7.5. In Proposition 7.1 we proved that for every n Z and every d Z + there exist unique q Z and unique r Z such that Dividing both relations in 7.3 by d > 0 we get Therefore we have n = dq +r and 0 r < d. 7.3 n d = q + r d and 0 r d < 1. q Z and q n d < q +1. The last displayed line is exactly the definition of the floor of n. Thus, in the division d algorithm n n q = and r = n d d d 12
COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called
More informationPacket #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics
CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus
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 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 informationMATH 271 Summer 2016 Practice problem solutions Week 1
Part I MATH 271 Summer 2016 Practice problem solutions Week 1 For each of the following statements, determine whether the statement is true or false. Prove the true statements. For the false statement,
More informationChapter 1 Elementary Logic
2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help
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 Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationMAT 243 Test 1 SOLUTIONS, FORM A
t MAT 243 Test 1 SOLUTIONS, FORM A 1. [10 points] Rewrite the statement below in positive form (i.e., so that all negation symbols immediately precede a predicate). ( x IR)( y IR)((T (x, y) Q(x, y)) R(x,
More informationProofs. Joe Patten August 10, 2018
Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital
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 informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Solution Guide Marcel B. Finan c All Rights Reserved 2015 Edition Contents
More informationProofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.
Proofs A mathematical system consists of axioms, definitions and undefined terms. An axiom is assumed true. Definitions are used to create new concepts in terms of existing ones. Undefined terms are only
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More informationa + 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 and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationDiscrete Mathematical Structures: Theory and Applications
Chapter 1: Foundations: Sets, Logic, and Algorithms Discrete Mathematical Structures: Theory and Applications Learning Objectives Learn about sets Explore various operations on sets Become familiar with
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 informationContradiction MATH Contradiction. Benjamin V.C. Collins, James A. Swenson MATH 2730
MATH 2730 Contradiction Benjamin V.C. Collins James A. Swenson Contrapositive The contrapositive of the statement If A, then B is the statement If not B, then not A. A statement and its contrapositive
More informationTopics in Logic and Proofs
Chapter 2 Topics in Logic and Proofs Some mathematical statements carry a logical value of being true or false, while some do not. For example, the statement 4 + 5 = 9 is true, whereas the statement 2
More informationMat 243 Exam 1 Review
OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for
More informationProofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction
Introduction I Proofs Computer Science & Engineering 235 Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu A proof is a proof. What kind of a proof? It s a proof. A proof is a proof. And when
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 informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationCSE 20 DISCRETE MATH SPRING
CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationSteinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)
Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning Terminology, Notations, Definitions, & Principles: Mathematical Proof and Proving (MPP) 1. A statement
More informationConjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.
Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is
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 informationIntro to Logic and Proofs
Intro to Logic and Proofs Propositions A proposition is a declarative sentence (that is, a sentence that declares a fact) that is either true or false, but not both. Examples: It is raining today. Washington
More informationMCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof
MCS-36: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, 010 Methods of Proof Consider a set of mathematical objects having a certain number of operations and relations
More informationTools for reasoning: Logic. Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications:
Tools for reasoning: Logic Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications: 1 Why study propositional logic? A formal mathematical language for precise
More informationLogic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.
Math 0413 Appendix A.0 Logic Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another. This type of logic is called propositional.
More informationBASES. Throughout this note V is a vector space over a scalar field F. N denotes the set of positive integers and i,j,k,l,m,n,p N.
BASES BRANKO ĆURGUS Throughout this note V is a vector space over a scalar field F. N denotes the set of positive integers and i,j,k,l,m,n,p N. 1. Linear independence Definition 1.1. If m N, α 1,...,α
More informationLogic and Proof. Aiichiro Nakano
Logic and Proof Aiichiro Nakano Collaboratory for Advanced Computing & Simulations Department of Computer Science Department of Physics & Astronomy Department of Chemical Engineering & Materials Science
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More informationSample Problems for all sections of CMSC250, Midterm 1 Fall 2014
Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical
More informationLogic Overview, I. and T T T T F F F T F F F F
Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical
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 information1 The Foundation: Logic and Proofs
1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( 명제 ) a declarative sentence that is either true or false, but not both nor neither letters denoting propositions p, q, r, s, T:
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
More informationREVIEW Chapter 1 The Real Number System
REVIEW Chapter The Real Number System In class work: Complete all statements. Solve all exercises. (Section.4) A set is a collection of objects (elements). The Set of Natural Numbers N N = {,,, 4, 5, }
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 32 Proofs Proofs
More information2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31
Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15
More informationProofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007
Proofs Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.5, 1.6, and 1.7 of Rosen cse235@cse.unl.edu
More information5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.
Statements Compounds and Truth Tables. Statements, Negations, Compounds, Conjunctions, Disjunctions, Truth Tables, Logical Equivalence, De Morgan s Law, Tautology, Contradictions, Proofs with Logical Equivalent
More informationReadings: Conjecture. Theorem. Rosen Section 1.5
Readings: Conjecture Theorem Lemma Lemma Step 1 Step 2 Step 3 : Step n-1 Step n a rule of inference an axiom a rule of inference Rosen Section 1.5 Provide justification of the steps used to show that a
More informationSection 1.1 Propositions
Set Theory & Logic Section 1.1 Propositions Fall, 2009 Section 1.1 Propositions In Chapter 1, our main goals are to prove sentences about numbers, equations or functions and to write the proofs. Definition.
More information1 Predicates and Quantifiers
1 Predicates and Quantifiers We have seen how to represent properties of objects. For example, B(x) may represent that x is a student at Bryn Mawr College. Here B stands for is a student at Bryn Mawr College
More informationWhat is the decimal (base 10) representation of the binary number ? Show your work and place your final answer in the box.
Question 1. [10 marks] Part (a) [2 marks] What is the decimal (base 10) representation of the binary number 110101? Show your work and place your final answer in the box. 2 0 + 2 2 + 2 4 + 2 5 = 1 + 4
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
More informationDiscrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University
Discrete Mathematics Logics and Proofs Liangfeng Zhang School of Information Science and Technology ShanghaiTech University Resolution Theorem: p q p r (q r) p q p r q r p q r p q p p r q r T T T T F T
More informationFoundations of Discrete Mathematics
Foundations of Discrete Mathematics Chapter 0 By Dr. Dalia M. Gil, Ph.D. Statement Statement is an ordinary English statement of fact. It has a subject, a verb, and a predicate. It can be assigned a true
More informationChapter 2: The Logic of Quantified Statements
Chapter 2: The Logic of Quantified Statements Topics include 2.1, 2.2 Predicates and Quantified Statements, 2.3 Statements with Multiple Quantifiers, and 2.4 Arguments with Quantified Statements. cs1231y
More informationCHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic
CHAPER 1 MAHEMAICAL LOGIC 1.1 undamentals of Mathematical Logic Logic is commonly known as the science of reasoning. Some of the reasons to study logic are the following: At the hardware level the design
More informationDiscrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques
Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques Colin Stirling Informatics Some slides based on ones by Myrto Arapinis Colin Stirling (Informatics) Discrete Mathematics
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 informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More informationBoolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012
March 5, 2012 Webwork Homework. The handout on Logic is Chapter 4 from Mary Attenborough s book Mathematics for Electrical Engineering and Computing. Proving Propositions We combine basic propositions
More informationPractice Test III, Math 314, Spring 2016
Practice Test III, Math 314, Spring 2016 Dr. Holmes April 26, 2016 This is the 2014 test reorganized to be more readable. I like it as a review test. The students who took this test had to do four sections
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationUNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK
UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) (2011 Admission Onwards) I Semester Core Course FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK 1) If A and B are two sets
More information1 The Foundation: Logic and Proofs
1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( ) a declarative sentence that is either true or false, but not both nor neither letters denoting propostions p, q, r, s, T: true
More informationBefore you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here.
Chapter 2 Mathematics and Logic Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here. 2.1 A Taste of Number Theory In this section, we will
More informationNote that r = 0 gives the simple principle of induction. Also it can be shown that the principle of strong induction follows from simple induction.
Proof by mathematical induction using a strong hypothesis Occasionally a proof by mathematical induction is made easier by using a strong hypothesis: To show P(n) [a statement form that depends on variable
More informationMATH10040: Chapter 0 Mathematics, Logic and Reasoning
MATH10040: Chapter 0 Mathematics, Logic and Reasoning 1. What is Mathematics? There is no definitive answer to this question. 1 Indeed, the answer given by a 21st-century mathematician would differ greatly
More information2. Two binary operations (addition, denoted + and multiplication, denoted
Chapter 2 The Structure of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference between
More informationFirst order Logic ( Predicate Logic) and Methods of Proof
First order Logic ( Predicate Logic) and Methods of Proof 1 Outline Introduction Terminology: Propositional functions; arguments; arity; universe of discourse Quantifiers Definition; using, mixing, negating
More informationMathematical Induction. Section 5.1
Mathematical Induction Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction
More informationChapter 2. Divisibility. 2.1 Common Divisors
Chapter 2 Divisibility 2.1 Common Divisors Definition 2.1.1. Let a and b be integers. A common divisor of a and b is any integer that divides both a and b. Suppose that a and b are not both zero. By Proposition
More information2. The Logic of Compound Statements Summary. Aaron Tan August 2017
2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional
More informationA. Propositional Logic
CmSc 175 Discrete Mathematics A. Propositional Logic 1. Statements (Propositions ): Statements are sentences that claim certain things. Can be either true or false, but not both. Propositional logic deals
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationSome Review Problems for Exam 1: Solutions
Math 3355 Fall 2018 Some Review Problems for Exam 1: Solutions Here is my quick review of proof techniques. I will focus exclusively on propositions of the form p q, or more properly, x P (x) Q(x) or x
More information3.6. Disproving Quantified Statements Disproving Existential Statements
36 Dproving Quantified Statements 361 Dproving Extential Statements A statement of the form x D, P( if P ( false for all x D false if and only To dprove th kind of statement, we need to show the for all
More informationLecture 2: Proof Techniques Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 2: Proof Techniques Lecturer: Lale Özkahya Resources: Kenneth Rosen, Discrete Mathematics and App. cs.colostate.edu/
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 informationBasic Logic and Proof Techniques
Chapter 3 Basic Logic and Proof Techniques Now that we have introduced a number of mathematical objects to study and have a few proof techniques at our disposal, we pause to look a little more closely
More informationThe theory of numbers
1 AXIOMS FOR THE INTEGERS 1 The theory of numbers UCU Foundations of Mathematics course 2017 Author: F. Beukers 1 Axioms for the integers Roughly speaking, number theory is the mathematics of the integers.
More informationChapter 3: Propositional Calculus: Deductive Systems. September 19, 2008
Chapter 3: Propositional Calculus: Deductive Systems September 19, 2008 Outline 1 3.1 Deductive (Proof) System 2 3.2 Gentzen System G 3 3.3 Hilbert System H 4 3.4 Soundness and Completeness; Consistency
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 10: Proofs by Contradiction and Contraposition 1. Prove the following statement
More information3 The language of proof
3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;
More informationWe want to show P (n) is true for all integers
Generalized Induction Proof: Let P (n) be the proposition 1 + 2 + 2 2 + + 2 n = 2 n+1 1. We want to show P (n) is true for all integers n 0. Generalized Induction Example: Use generalized induction to
More information1. Propositions: Contrapositives and Converses
Preliminaries 1 1. Propositions: Contrapositives and Converses Given two propositions P and Q, the statement If P, then Q is interpreted as the statement that if the proposition P is true, then the statement
More informationIt rains now. (true) The followings are not propositions.
Chapter 8 Fuzzy Logic Formal language is a language in which the syntax is precisely given and thus is different from informal language like English and French. The study of the formal languages is the
More informationLogic, Proof, Axiom Systems
Logic, Proof, Axiom Systems MA 341 Topics in Geometry Lecture 03 29-Aug-2011 MA 341 001 2 Rules of Reasoning A tautology is a sentence which is true no matter what the truth value of its constituent parts.
More informationAnalysis I. Classroom Notes. H.-D. Alber
Analysis I Classroom Notes H-D Alber Contents 1 Fundamental notions 1 11 Sets 1 12 Product sets, relations 5 13 Composition of statements 7 14 Quantifiers, negation of statements 9 2 Real numbers 11 21
More information586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws
Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,
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 informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder
More informationFor all For every For each For any There exists at least one There exists There is Some
Section 1.3 Predicates and Quantifiers Assume universe of discourse is all the people who are participating in this course. Also let us assume that we know each person in the course. Consider the following
More information2.2: Logical Equivalence: The Laws of Logic
Example (2.7) For primitive statement p and q, construct a truth table for each of the following compound statements. a) p q b) p q Here we see that the corresponding truth tables for two statement p q
More informationManual of Logical Style
Manual of Logical Style Dr. Holmes January 9, 2015 Contents 1 Introduction 2 2 Conjunction 3 2.1 Proving a conjunction...................... 3 2.2 Using a conjunction........................ 3 3 Implication
More informationGROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION
Chapter-1 GROUPS 1.1. INTRODUCTION The theory of groups arose from the theory of equations, during the nineteenth century. Originally, groups consisted only of transformations. The group of transformations
More informationThe Process of Mathematical Proof
1 The Process of Mathematical Proof Introduction. Mathematical proofs use the rules of logical deduction that grew out of the work of Aristotle around 350 BC. In previous courses, there was probably an
More informationAnalysis 1. Lecture Notes 2013/2014. The original version of these Notes was written by. Vitali Liskevich
Analysis 1 Lecture Notes 2013/2014 The original version of these Notes was written by Vitali Liskevich followed by minor adjustments by many Successors, and presently taught by Misha Rudnev University
More informationLogic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
More informationCSE 1400 Applied Discrete Mathematics Proofs
CSE 1400 Applied Discrete Mathematics Proofs Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Axioms 1 Logical Axioms 2 Models 2 Number Theory 3 Graph Theory 4 Set Theory 4
More information