Axioms and Theorems. Remember syllogisms? The Socrates Syllogism All human beings are mortal Socrates is a human being Therefore Socrates is mortal premises.

Slides:



Advertisements
Similar presentations
Introduction to Proofs
Advertisements

Whiteboardmaths.com © 2004 All rights reserved
Simplifying, Multiplying, & Rationalizing Radicals
Induction and recursion
Vocabulary and Properties. Determine the word or phrase described in each slide.
More Number Theory Proofs Rosen 1.5, 3.1. Prove or Disprove If m and n are even integers, then mn is divisible by 4. The sum of two odd integers is odd.
CSE115/ENGR160 Discrete Mathematics 02/07/12
CSE115/ENGR160 Discrete Mathematics 02/01/11
Homework Solution lesson 8.5
Complex Numbers. Once upon a time… Reals Rationals (Can be written as fractions) Integers (…, -1, -2, 0, 1, 2, …) Whole (0, 1, 2, …) Natural (1, 2, …)
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
9.1 Multiplying and Dividing Rational Expressions
CS 2210 (22C:019) Discrete Structures Logic and Proof Spring 2015 Sukumar Ghosh.
C OURSE : D ISCRETE STRUCTURE CODE : ICS 252 Lecturer: Shamiel Hashim 1 lecturer:Shamiel Hashim second semester Prepared by: amani Omer.
Methods of Proof & Proof Strategies
Algebra Review Number Sense. These subgroups of numbers are often represented visually using a Venn Diagram.
MATH 224 – Discrete Mathematics
BIRKDALE HIGH SCHOOL MATHEMATICS DEPARTMENT
Introduction to Proofs
Introduction to Proofs
1 Methods of Proof CS/APMA 202 Epp, chapter 3 Aaron Bloomfield.
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.
Section 1.8. Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness Proofs.
10/17/2015 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(1) Dr.Saad Alabbad Department of Computer Science
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Theorems and conjectures
TOK: Mathematics Unit 1 Day 1. Introduction Opening Question Is math discovered or is it invented? Think about it. Think real hard. Then discuss.
 Here are a few review concepts before we start solving equations!
Lesson 3-4 Solving Multi-Step Inequalities August 20, 2014.
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
CompSci 102 Discrete Math for Computer Science March 1, 2012 Prof. Rodger Slides modified from Rosen.
(Finite) Mathematical Induction In our first lesson on sequences and series, you were told that How can we be certain that this will be true for all counting.
Vocabulary Unit 4 Section 1:
Mathematical Induction
CS104:Discrete Structures Chapter 2: Proof Techniques.
Can a and b both be whole numbers? similar triangles so.
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
Section 1.7. Definitions A theorem is a statement that can be shown to be true using: definitions other theorems axioms (statements which are given as.
Theory of Knowledge: Mathematics. What is maths? In order to discuss what maths is, it is helpful to look back at how maths as a discipline developed.
Mathematical Proof A domino and chessboard problem.
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
EXAMPLE 3 Write an indirect proof Write an indirect proof that an odd number is not divisible by 4. GIVEN : x is an odd number. PROVE : x is not divisible.
Week 1 Real Numbers and Their Properties (Section 1.6, 1.7, 1.8)
TOK: Mathematics Unit 1 Day 1. 2 – B 2 = AB – B 2 Factorize both sides: (A+B)(A-B) = B(A-B) Divide both sides by (A-B): A = B = B Since A = B, B+B=B Add.
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
Imaginary & Complex Numbers
The Foundations: Logic and Proofs
CS 2210:0001 Discrete Structures Logic and Proof
Algebra.
Chapter 4 (Part 1): Induction & Recursion
Square Roots and Irrational Numbers.
Imaginary & Complex Numbers
Methods of Proof CS 202 Epp, chapter 3.
Simplifying Square Root Expressions
Algebra Review Radical Expressions page 280
Estimating Irrational Numbers
The Foundations: Logic and Proofs
Imaginary & Complex Numbers
Solving Quadratic Equations
Brief Review of Proof Techniques
Induction and recursion
CS 220: Discrete Structures and their Applications
Rational and Irrational Numbers
Warmup Find the exact value. 1. √27 2. –√
Square Roots and Irrational Numbers.
11.1 Square Roots and Irrational Numbers
Multiplication Race Start with the 1’s, 2’s Then, 12’s,
Examples of Mathematical Proof
Introduction to Complex Numbers
Presentation transcript:

Axioms and Theorems

Remember syllogisms?

The Socrates Syllogism All human beings are mortal Socrates is a human being Therefore Socrates is mortal premises conclusion

Mathematical proof Mathematical proof is similar in structure to a syllogism. In maths we start with axioms (“premises”). These are the starting points and basic assumptions. We then use deductive reasoning to reach a conclusion, known in maths as a theorem.

For example, the axioms of arithmetic For any numbers m, n m + n = n + mand mn = nm For any numbers m, n and k (m + n) + k = m + (n + k) and (mn)k = m(nk) For any numbers m, n and k m(n + k) = mn + mk There is a number 0, which has the property that for any number n n + 0 = n There is a number 1 which has the property that for any number n n x 1 = n For every number n, there is a number k such that n + k = 0 For any numbers m, n and k if k ≠ 0 and kn = km, then n = m

A proof

A domino and chessboard problem

Imagine a chessboard has had two opposing corners removed. Can you cover the remaining squares with dominoes? (whose size is equal to two squares)

Impossible? Trial and error seems to show it can’t be done. How can we be sure without trying every possible combination (of millions)?

Mathematical proof Mathematical proof aims to show using axioms and logic that something is true in all circumstances, even if all circumstances cannot be tried. Once proved mathematically, something is true for all time.

Proving that the domino problem is impossible.

A domino can only cover two adjoining squares, so these two adjoining squares MUST be of different colours as no two adjoining squares are the same colour. Covering a black and a white square

Proving that the domino problem is impossible. Therefore the first 30 dominoes (wherever they are put) must cover 30 white squares and 30 black. This MUST leave two black squares uncovered. And since these can’t be together, they cannot be covered by one domino. Therefore it is impossible.

Proof Note we have proved this without having to try every combination, and our logic shows that the proof has to be true for any arrangement of dominoes. Science can NEVER be this certain

Another example The square root of 2 is an irrational number (cannot be written as a fraction) This is a proof by Euclid who used the method of proof by contradiction.

Proof by contradiction This starts by assuming by something is true, and then showing that this cannot be so.

Euclid’s proof that √2 is irrational Euclid started by assuming that √2 is rational i.e. √2 = p/q

Euclid’s proof that √2 is irrational √2 = p/q square both sides 2 = p 2 /q 2 and rearrange 2q 2 = p 2

Euclid’s proof that √2 is irrational 2q 2 = p 2 If you take any number and multiply it by 2 it must be even, this means that p 2 is an even number. If a square is an even number, the original number (p) itself must be even. Therefore p can be written as p= 2m where m is a whole number.

Euclid’s proof that √2 is irrational 2q 2 = p 2 If p= 2m where m is a whole number, 2q 2 = (2m) 2 = 4m 2 Divide both sides by 2 and we get q 2 = 2m 2

Euclid’s proof that √2 is irrational q 2 = 2m 2 By the same argument as before, we know q 2 is even and so q must also be even so can be written as q = 2n where n is a whole number. Going back to the start √2 = p/q = 2m/2n

Euclid’s proof that √2 is irrational √2 = p/q = 2m/2n This can be simplified to √2 = m/n And we are back where we started!

Euclid’s proof that √2 is irrational √2 = m/n This process can be repeated over and over again infinitely and we never get nearer to the simplest fraction. This means that the simplest fraction does not exist, i.e. our original assumption that √2 = p/q is untrue! This shows that √2 is indeed irrational.

Andrew Wiles Euclid’s proof is a very simple one. When Andrew Wiles proved that there are no whole number solutions for the following equation y n + x n = z n for n > 2 his proof was over 100 pages long and only 6 other mathematicians in the world could understand it! YouTube - Proof that Girls are Evil

Homework Find the shortest proof of Pythagoras' theorem (or any other mathematical proof) that you can find and copy it into your TOK books. For Wednesday.