01/24/13 Strategies for Proofs Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois Landscape with House and Ploughman Van Gogh.

Slides:

Advertisements

Similar presentations

Introduction to Proofs

Advertisements

CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.

State Diagrams Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois 1.

Propositional Logic Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois School of Athens Fresco by Raphael Wikimedia Commons.

(CSC 102) Lecture 12 Discrete Structures. Previous Lecture Summary Floor and Ceiling Functions Definition of Proof Methods of Proof Direct Proof Disproving.

MA/CSSE 473/474 How (not) to do an induction proof.

Discrete Mathematics Math 6A Instructor: M. Welling.

Problem Solving How to start? from which we can logically deduce a useful result. Most mathematical problems begin with a set of given conditions, What.

CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.

Introduction to Proofs

CS 173, Lecture B September 1, 2015 Tandy Warnow.

1 Methods of Proof CS/APMA 202 Epp, chapter 3 Aaron Bloomfield.

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.

More Logic Discrete Structures (CS 173) Madhusudan Parthasarathy The arenas of Arles Van Gogh.

1 Methods of Proof. 2 Consider (p  (p→q)) → q pqp→q p  (p→q)) (p  (p→q)) → q TTTTT TFFFT FTTFT FFTFT.

The Scientific Method Defined: step by step procedure of scientific problem solving (5) Major steps are listed below.

04/09/13 Proof by Contradiction Discrete Structures (CS 173) Derek Hoiem, University of Illinois 1.

DO NOW Take a blank notecard from the front bookshelf. Explain why the following statements are false. If you live in California, you live in Watts If.

Conditional Statements Conditional Statement: “If, then” format. Converse: “Flipping the Logic” –Still “if, then” format, but we switch the hypothesis.

The ART of learning Acquire Retain Transfer Acquire new skills and knowledge from class work, books and exercises Retain them through frequent practice.

Graphs and Isomorphisms Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois Backyards of Old Houses in Antwerp in the Snow Van.

1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,

Write paragraph proofs

Relations Discrete Structures (CS 173)

Lesson 1.7/1.8 Deductive Structure and Statements of Logic Objective: Recognize that geometry is based on deductive structure, identify undefined terms,

GEOMETRIC PROOFS A Keystone Geometry Mini-Unit. Geometric Proofs – An Intro Why do we have to learn “Proofs”? A proof is an argument, a justification,

01/29/13 Number Theory: Factors and Primes Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois Boats of Saintes-Maries Van Gogh.

The Scientific Method. The scientific method is the only scientific way accepted to back up a theory or idea. This is the method on which all research.

22C:19 Discrete Structures Logic and Proof Fall 2014 Sukumar Ghosh.

CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 05 : Knowledge Base & First Order Logic.

Direct Proof and Counterexample I Lecture 12 Section 3.1 Tue, Feb 6, 2007.

2.3 Methods of Proof.

Congruence and Sets Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois Dali - “The Persistence of Memory” 1.

MAT 2720 Discrete Mathematics Section 2.1 Mathematical Systems, Direct proofs, and Counterexamples

More Induction Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois 1 A Pork-Butchers Shop Seen from a Window Van Gogh.

Direct Proof and Counterexample I Lecture 11 Section 3.1 Fri, Jan 28, 2005.

03/05/13 More Induction Discrete Structures (CS 173) Derek Hoiem, University of Illinois 1 Artist: Frank.

Section 7.3 Proving Trigonometric Identities Copyright ©2013, 2009, 2006, 2001 Pearson Education, Inc.

1 Formal Proofs. 2 Deductive Proofs From the given statement(s) to a conclusion statement (what we want to prove) Logical progression by direct implications.

Lecture 1.5: Proof Techniques CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren 1.

INDUCTION David Kauchak CS52 – Spring to-1 multiplexer control control_negate and_out1 input0 input1 and_out2 output.

Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.

CPSC 121: Models of Computation REVIEW. Course Learning Outcomes You should be able to: – model important problems so that they are easier to discuss,

INDUCTION David Kauchak CS52 – Spring to-1 multiplexer control control_negate and_out1 input0 input1 and_out2 output.

CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.

Lecture 1.5: Proof Techniques

11.7 – Proof by Mathematical Induction

Indirect Argument: Contradiction and Contraposition

Introduction to Deductive Proofs

Chapter 4 (Part 1): Induction & Recursion

The Scientific Method “..a logical approach to solving problems by observing and collecting data, developing a hypothesis, conducting experiments to test.

Formal Logic CSC 333.

Proof methods We will discuss ten proof methods: Direct proofs

Lecture 1.5: Proof Techniques

Infinitesimal Confirmation

Methods of Proof CS 202 Epp, chapter 3.

Proof by Contradiction

Methods of Proof A mathematical theorem is usually of the form pq

Discrete Math for CS CMPSC 360 LECTURE 4 Last time and recitations:

Confirmation The Raven Paradox.

The Foundations: Logic and Proofs

(1.4) An Introduction to Logic

Section 2.1 Proof Techniques Introduce proof techniques: o Exhaustive Proof: to prove all possible cases, Only if it is about a.

SCIENTIFIC METHOD -A PROCESS FOR ANSWERING QUESTIONS OR SOLVING PROBLEMS -NOT NECESSARILY DONE IN ANY ORDER -HAS 6 PARTS.

Conditional Statements

Direct Proof and Counterexample I

1.3 Propositional Equivalences

Logic and Reasoning.

Presentation transcript:

01/24/13 Strategies for Proofs Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois Landscape with House and Ploughman Van Gogh 1

Goals of this lecture Practice with proofs Become familiar with various strategies for proofs 2

Review: proving universal statements 3

Proving existential statements overhead 4

Disproving existential statements overhead 5

Disproving universal statements overhead 6

Proof by cases 7

8

Rephrasing claims 9

Proof by contrapositive 10

Proof strategies 1.Does this proof require showing that the claim holds for all cases or just an example? – Show all cases: prove universal, disprove existential – Example: disprove universal, prove existential 2.Can you figure a straightforward solution? – If so, sketch it and then write it out clearly, and you’re done 3.If not, try to find an equivalent form that is easier a)Divide into subcases that combine to account for all cases OR in hypothesis is a hint that this may be a good idea b)Try the contrapositive OR in conclusion is a hint that this may be a good idea c)More generally rephrase the claim: convert to propositional logic and manipulate into something easier to solve 11

More proof examples 12

More proof examples 13

Another proof overhead 14

More proof examples 15