Mathematical Writing chapter 7 Roozbeh Izadian Fall 2015.

Slides:



Advertisements
Similar presentations
Notes 6.6 Fundamental Theorem of Algebra
Advertisements

Tutorial 2: First Order Logic and Methods of Proofs
2.5 complex 0’s & the fundamental theorem of algebra
Sequences and Mathematical Induction
Rational Root Theorem.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
Week 5 - Friday.  What did we talk about last time?  Sequences  Summation and production notation  Proof by induction.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved. CHAPTER 1 SPEAKING MATHEMATICALLY SPEAKING MATHEMATICALLY.
Mathematics1 Mathematics 1 Applied Informatics Štefan BEREŽNÝ.
Cardinality of a Set “The number of elements in a set.” Let A be a set. a.If A =  (the empty set), then the cardinality of A is 0. b. If A has exactly.
Mathematics By: Damarlyn Chivers Equations Definitions An equation is two things are the same, using mathematics symbols.
Objectives Evaluate expressions containing square roots.
EXAMPLE 5 Rewrite a conditional statement in if-then form
Chapter 6 Mathematical Induction
Mathematical Induction. F(1) = 1; F(n+1) = F(n) + (2n+1) for n≥ F(n) n F(n) =n 2 for all n ≥ 1 Prove it!
Methods of Proof. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical theorems. Direct.
Chapter 2 Mathematical preliminaries 2.1 Set, Relation and Functions 2.2 Proof Methods 2.3 Logarithms 2.4 Floor and Ceiling Functions 2.5 Factorial and.
Chapter 5 Existence and Proof by contradiction
Methods of Proof Lecture 3: Sep 9. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Chapter 3 Polynomial and Rational Functions Copyright © 2014, 2010, 2007 Pearson Education, Inc Zeros of Polynomial Functions.
Number systems TWSSP Thursday.
Section 4.3 Zeros of Polynomials. Approximate the Zeros.
P.1 Real Numbers. 2 What You Should Learn Represent and classify real numbers. Order real numbers and use inequalities. Find the absolute values of real.
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
3.4 Zeros of Polynomial Functions. The Fundamental Theorem of Algebra If f(x) is a polynomial of degree n, where n>0, then f has at least one zero in.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
CHAPTER 5 SIGNAL SPACE ANALYSIS
Copyright © 2009 Pearson Education, Inc. CHAPTER 4: Polynomial and Rational Functions 4.1 Polynomial Functions and Models 4.2 Graphing Polynomial Functions.
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 07 Chapter 7: Eigenvalues, Eigenvectors.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
UNIT 2, LESSON 5 DESCARTES LAW OF SIGNS. FINDING POLYNOMIALS WITH GIVEN ZEROS If we are given the zeros of a polynomial, we can generate the polynomial.
The Fundamental Theorem of Algebra It’s in Sec. 2.6a!!! Homework: p odd, all.
Chapter 3 Polynomial and Rational Functions Copyright © 2014, 2010, 2007 Pearson Education, Inc Zeros of Polynomial Functions.
1 CMSC 250 Chapter 3, Number Theory. 2 CMSC 250 Introductory number theory l A good proof should have: –a statement of what is to be proven –"Proof:"
Prime Numbers and composite numbers
4.5: The Dimension of a Vector Space. Theorem 9 If a vector space V has a basis, then any set in V containing more than n vectors must be linearly dependent.
The main study of Field Theory By: Valerie Toothman
Section 1.8. Proof by Cases Example: Let b = max{a, b} = a if a ≥ b, otherwise b = max{a, b} = b. Show that for all real numbers a, b, c
Methods of Proof Lecture 4: Sep 20 (chapter 3 of the book, except 3.5 and 3.8)
CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.
Algebra 2 Properties of Real Numbers Lesson 1-2 Goals Goal To graph and order real numbers. To Identity properties of real numbers. Rubric Level 1 –
Chapter 2 Sets and Functions.
Computation of the solutions of nonlinear polynomial systems
Elementary Linear Algebra Anton & Rorres, 9th Edition
College Algebra Chapter 3 Polynomial and Rational Functions
Chapter 3: Polynomial Functions
Chapter 3 The Real Numbers.
Real Zeros Intro - Chapter 4.2.
7.5 Zeros of Polynomial Functions
Rational Root Theorem Pt.2
3.8 Complex Zeros; Fundamental Theorem of Algebra
Chapter P Prerequisites. Chapter P Prerequisites.
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Zeros of a Polynomial Function
4.6: Rank.
Applied Discrete Mathematics Week 2: Proofs
Rational Root Theorem.
Lecture 43 Section 10.1 Wed, Apr 6, 2005
Elementary Number Theory & Proofs
Chapter 3: Polynomial Functions
Copyright © Cengage Learning. All rights reserved.
Foundations of Discrete Mathematics
College Algebra Chapter 3 Polynomial and Rational Functions
MA5242 Wavelets Lecture 1 Numbers and Vector Spaces
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
From the last time: gcd(a, b) can be characterized in two different ways: It is the least positive value of ax + by where x and y range over integers.
Presentation transcript:

Mathematical Writing chapter 7 Roozbeh Izadian Fall 2015

Topics  Proof by Cases  Implications  Direct Proof  Proof by Contrapositive

Proof by Cases

The cases

Proof by Cases

Implications

 Implications may appear in disguise, without the ‘if…then’ construct:  A is a subset of B.  Every repeating decimal is rational.  The determinant of an invertible matrix is non-zero.  When we rewrite these sentences as explicit implications, we note that it is necessary to introduce an auxiliary quantity.

Implications A is a subset of B. Every repeating decimal is rational. The determinant of an invertible matrix is non-zero

Implications If r is a repeating decimal, then r is rational. For all real numbers r, if the decimal digits of r are repeating, then r is rational.

Direct Proof

 Considerations suggest what should be the opening sentence of a direct proof of an implication

Implications Theorem. If p > 3 is a prime and p+2 is also prime, then p+4 is composite. Proof. Suppose p is a prime number greater than 3, such that p +2 is prime. RTP: p + 4 is composite.

Direct Proof  Often you can work out how the proof of an implication must start even if you haven’t the faintest idea of what the mathematics is about

Implications Theorem. A closed subset of a compact set is compact. Proof. Let X be a compact set, and let C be a subset of X. Assume that C is closed. RTP: C is compact.

Implications Theorem. If λ ∈ C is a root of a monic polynomial whose coefficients are algebraic integers, then λ is an algebraic integer Proof. Let p be a monic polynomial whose coefficients are algebraic integers, and let λ ∈ C be a root of p. RTP: λ is an algebraic integer.

Implications Theorem. Every basis of a finite- dimensional linear space has the same number of elements. Proof. Let V be a finite-dimensional linear space, and let B1 and B2 be two bases for V. Suppose B1 has n1 elements and B2 has n2 elements. RTP: n1 = n2.

Direct Proof  In all the examples above, the proof begins by giving names to things  Some authors make this unnecessary by including names in the theorem  others obscure the statement of a theorem by putting too many names in it

Direct Proof  Let us rewrite the last theorem in such away as to establish some notation within the statement itself.

Implications Theorem. Let V be a finite- dimensional linear space. Then every basis for V has the same number of elements. Theorem 1. Let V be a finite- dimensional linear space, and let B1 and B2 be two bases for V. Then #B1 = #B2.

Direct Proof  Let us compare the three formulations of this theorem  The first is plain and effective.  The second contains a minimum of notation which does no harm but is unnecessary.  The last version establishes some useful notation

Proof by Contrapositive

 Example. Consider the statement If the average of four distinct integers is equal to 10, then one of the integers is greater than 11

Proof by Contrapositive  The direct implication involves an assumption on an average value, which entails lots of information. the contrapositive implication involves four integers of bounded size  Given four distinct integers not greater than 11 their average is not equal to 10

Proof by Contrapositive

Thank’s