10 - Theorems Introduction and Proofs Discrete Mathematics...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
Introduction Theorems and Proofs Discrete Mathematics Andrei Bulatov
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Discrete Mathematics – Theorems and Proofs 10-2 Previous Lecture Equivalent predicates Equivalent quantified statements Quantifiers and conjunction/disjunction Quantifiers and logic connectives Equivalence and multiple quantifiers
Background image of page 2
Discrete Mathematics – Theorems and Proofs 10-3 What is a Theorem? The word `theorem’ is understood in two ways First, a theorem is a mathematical statement of certain importance ``A quadratic equation has at most 2 solutions’’ 0 2 = + + c bx ax ``Every statement is equivalent to a certain CNF’’ Second, a theorem is any statement inferred within an axiomatic theory ``Prove that the computer chip design is correct’’
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Discrete Mathematics – Theorems and Proofs 10-4 Axioms In both cases, to infer a theorem we need to start with something. Such starting point is a collection of axioms Two understandings of axioms: - self evident truth ``Two non-parallel lines intersect’’ ``There is something outside me’’ - statements we assume as true, facts from experiment or observation, something we suggest and want to see implications
Background image of page 4
Discrete Mathematics – Theorems and Proofs 10-5 Axioms (cntd) Self evident truths are usually not quite truths, so we are left with the second meaning of axioms For any two points there is only one line that goes through them
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Discrete Mathematics – Theorems and Proofs 10-6 Proving Theorems To prove theorems we use rules of inference. Usually implicitly In axiomatic theories it is done explicitly: Specify axioms Specify rules of inference Elementary geometry is an axiomatic theory. Axioms are Euclid’s postulates
Background image of page 6
Discrete Mathematics – Theorems and Proofs 10-7 Proving Theorems We know rules of inference to reason about propositional statements. What about predicates and quantified statements? The simplest method is the method of exhaustion: To prove that 2200 x P(x), just verify that P(a) is true for all values a from the universe. To prove that 5 x P(x), by checking all the values in the universe find a value a such that P(a) is true ``Every car in lot C is red’’ ``There is a blue car in lot C’’
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Discrete Mathematics – Theorems and Proofs 10-8 Rule of Universal Specification Reconsider the argument Every man is mortal. Socrates is a man.
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/14/2011 for the course MACM 101 taught by Professor Pearce during the Spring '08 term at Simon Fraser.

Page1 / 25

10 - Theorems Introduction and Proofs Discrete Mathematics...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online