Lecture 2: What is Proof?

Similar documents
The Limit of Humanly Knowable Mathematical Truth

Axiomatic set theory. Chapter Why axiomatic set theory?

CM10196 Topic 2: Sets, Predicates, Boolean algebras

Gödel s Incompleteness Theorems

With Question/Answer Animations. Chapter 2

Hilbert s problems, Gödel, and the limits of computation

Geometry I (CM122A, 5CCM122B, 4CCM122A)

Linear Algebra Fall mathx.kaist.ac.kr/~schoi/teaching.html.

MAT 115H Mathematics: An Historical Perspective Fall 2015

Beyond Newton and Leibniz: The Making of Modern Calculus. Anthony V. Piccolino, Ed. D. Palm Beach State College Palm Beach Gardens, Florida

MthEd/Math 300 Williams Fall 2011 Midterm Exam 3

Hilbert s problems, Gödel, and the limits of computation

Handout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte

Affine Planes: An Introduction to Axiomatic Geometry

Contents Part A Number Theory Highlights in the History of Number Theory: 1700 BC 2008

Introduction to Logic and Axiomatic Set Theory

MAGIC Set theory. lecture 1

The Search for the Perfect Language

INCOMPLETENESS I by Harvey M. Friedman Distinguished University Professor Mathematics, Philosophy, Computer Science Ohio State University Invitation

Euclid Geometry And Non-Euclid Geometry. Have you ever asked yourself why is it that if you walk to a specific place from

ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS

CHAPTER 11. Introduction to Intuitionistic Logic

MAT 417, Fall 2017, CRN: 1766 Real Analysis: A First Course

n Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B

A Brief History of Algebra

Chapter 4. Basic Set Theory. 4.1 The Language of Set Theory

Philosophies of Mathematics. The Search for Foundations

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION

CHAPTER 0: BACKGROUND (SPRING 2009 DRAFT)

cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018

CSE 20 DISCRETE MATH WINTER

CSE 20 DISCRETE MATH SPRING

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Introduction to Set Operations

EUCLID S AXIOMS A-1 A-2 A-3 A-4 A-5 CN-1 CN-2 CN-3 CN-4 CN-5

Complex Analysis: A Round-Up

Infinity and Infinite Series

Informal Statement Calculus

SOME TRANSFINITE INDUCTION DEDUCTIONS

Sets. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing Spring, Outline Sets An Algebra on Sets Summary

CSE 20 DISCRETE MATH. Winter

This section will take the very naive point of view that a set is a collection of objects, the collection being regarded as a single object.

Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

History of Mathematics

Russell s logicism. Jeff Speaks. September 26, 2007

In N we can do addition, but in order to do subtraction we need to extend N to the integers

Tutorial on Axiomatic Set Theory. Javier R. Movellan

English and L A TEX for Mathematicians

Set Theory History. Martin Bunder. September 2015

Equivalent Forms of the Axiom of Infinity

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Review 1. Andreas Klappenecker

Automata Theory. Definition. Computational Complexity Theory. Computability Theory

Hence, the sequence of triangular numbers is given by., the. n th square number, is the sum of the first. S n

Chapter 0. Introduction. An Overview of the Course

CS2742 midterm test 2 study sheet. Boolean circuits: Predicate logic:

HANDOUT AND SET THEORY. Ariyadi Wijaya

Victoria Gitman and Thomas Johnstone. New York City College of Technology, CUNY

Honors 213 / Math 300. Second Hour Exam. Name

Workshop 1- Building on the Axioms. The First Proofs

In today s world, people with basic calculus knowledge take the subject for granted. As

MTH 299 In Class and Recitation Problems SUMMER 2016

MATH10040: Chapter 0 Mathematics, Logic and Reasoning

Unit 3: Definitions, Theorems and Proofs

Some Background Material

(1.3.1) and in English one says a is an element of M. The statement that a is not an element of M is written as a M

Zermelo-Fraenkel Set Theory

CHAPTER 1. Preliminaries. 1 Set Theory

MAGIC Set theory. lecture 2

Classical Propositional Logic

In N we can do addition, but in order to do subtraction we need to extend N to the integers

Section V.3.Appendix. The Fundamental Theorem of Algebra

The roots of computability theory. September 5, 2016

586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

MATH2206 Prob Stat/20.Jan Weekly Review 1-2

Boolean algebra. Values

CISC-102 Fall 2018 Week 11

Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 15 Propositional Calculus (PC)

MA651 Topology. Lecture 9. Compactness 2.

CITS2211 Discrete Structures Proofs

Part IA Numbers and Sets

Symbols. How do you unpack it? What do you need to know in order to do so? How could it hurt, rather than help, understanding?

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC

Week 2: Sequences and Series

Massachusetts Institute of Technology 6.042J/18.062J, Fall 02: Mathematics for Computer Science Professor Albert Meyer and Dr. Radhika Nagpal.

Gödel s Proof. Henrik Jeldtoft Jensen Dept. of Mathematics Imperial College. Kurt Gödel

The Reflection Theorem

Continuous mathematics as an approximation of the discrete one.

Exclusive Disjunction

Sequence convergence, the weak T-axioms, and first countability

Theory of Computation CS3102 Spring 2014

Introduction to Metalogic

Lecture 11: Measuring the Complexity of Proofs

Proofs. Joe Patten August 10, 2018

Introduction to Proofs

Dominoes and Counting

CS 301. Lecture 17 Church Turing thesis. Stephen Checkoway. March 19, 2018

INFINITY: CARDINAL NUMBERS

We have been going places in the car of calculus for years, but this analysis course is about how the car actually works.

Transcription:

Lecture 2: What is Proof? Math 295 08/26/16 Webster Proof and Its History 8/2016 1 / 1

Evolution of Proof Proof, a relatively new idea Modern mathematics could not be supported at its foundation, nor construct the top floor without precise statements Intuition works up to a point Webster Proof and Its History 8/2016 2 / 1

Evolution of Proof Proof, a relatively new idea Modern mathematics could not be supported at its foundation, nor construct the top floor without precise statements Intuition works up to a point Four Stages : Webster Proof and Its History 8/2016 2 / 1

Evolution of Proof Proof, a relatively new idea Modern mathematics could not be supported at its foundation, nor construct the top floor without precise statements Intuition works up to a point Four Stages : just answers volumes, areas, lengths, angles, relationships; practical demonstration (intuition) that it works, calculation, formulae verification/justification plausible picture, description, analogy, invoke the gods modern proof Webster Proof and Its History 8/2016 2 / 1

Egyptians: Practical Questions Right pyramidal frustum Webster Proof and Its History 8/2016 3 / 1

Egyptians: Practical Questions Right pyramidal frustum Known in 1850 BCE. Requires calculus for proof of derivation V = h 3 (a2 + ab + b 2 ) Webster Proof and Its History 8/2016 3 / 1

Egyptians: Practical Questions Right pyramidal frustum V = h 3 (a2 + ab + b 2 ) Known in 1850 BCE. Requires calculus for proof of derivation Answer : No record of derivation or proof. Webster Proof and Its History 8/2016 3 / 1

Euclid: The Outlier Greeks: Geometry, trigonometry, forms, idealizations Webster Proof and Its History 8/2016 4 / 1

Euclid: The Outlier Greeks: Geometry, trigonometry, forms, idealizations Triangles, rectangles, circles (building/construction) Webster Proof and Its History 8/2016 4 / 1

Euclid: The Outlier Greeks: Geometry, trigonometry, forms, idealizations Triangles, rectangles, circles (building/construction) The father of rigor (300 BCE): Euclid Precursors: Thales (600 BCE), Pythagoras and Pythagoreans (550 BCE), Eudoxus (400 BCE) calculations and declarations, theorems Webster Proof and Its History 8/2016 4 / 1

Euclid: The Outlier Greeks: Geometry, trigonometry, forms, idealizations Triangles, rectangles, circles (building/construction) The father of rigor (300 BCE): Euclid Precursors: Thales (600 BCE), Pythagoras and Pythagoreans (550 BCE), Eudoxus (400 BCE) calculations and declarations, theorems Who was Euclid? Webster Proof and Its History 8/2016 4 / 1

Euclid: The Outlier Greeks: Geometry, trigonometry, forms, idealizations Triangles, rectangles, circles (building/construction) The father of rigor (300 BCE): Euclid Precursors: Thales (600 BCE), Pythagoras and Pythagoreans (550 BCE), Eudoxus (400 BCE) calculations and declarations, theorems Who was Euclid? geometer, archivist, organizer Webster Proof and Its History 8/2016 4 / 1

Euclid: The Outlier Greeks: Geometry, trigonometry, forms, idealizations Triangles, rectangles, circles (building/construction) The father of rigor (300 BCE): Euclid Precursors: Thales (600 BCE), Pythagoras and Pythagoreans (550 BCE), Eudoxus (400 BCE) calculations and declarations, theorems Who was Euclid? The Elements planar geometry geometer, archivist, organizer Axioms, definitions, theorem, proof Webster Proof and Its History 8/2016 4 / 1

Euclid: The Outlier Greeks: Geometry, trigonometry, forms, idealizations Triangles, rectangles, circles (building/construction) The father of rigor (300 BCE): Euclid Precursors: Thales (600 BCE), Pythagoras and Pythagoreans (550 BCE), Eudoxus (400 BCE) calculations and declarations, theorems Who was Euclid? The Elements planar geometry geometer, archivist, organizer Axioms, definitions, theorem, proof Demonstration and Justification But where did the proofs come from? Webster Proof and Its History 8/2016 4 / 1

Dark Ages Webster Proof and Its History 8/2016 5 / 1

Renaissance Number Theorists Gerolamo Cardano (1501 1557) and Niccolo Tartaglia (1500 1576) Era of the master Webster Proof and Its History 8/2016 6 / 1

Renaissance Number Theorists Gerolamo Cardano (1501 1557) and Niccolo Tartaglia (1500 1576) Era of the master Solving the cubic equation Forms of solution, authorship, conflict Webster Proof and Its History 8/2016 6 / 1

Renaissance Number Theorists Gerolamo Cardano (1501 1557) and Niccolo Tartaglia (1500 1576) Era of the master Solving the cubic equation Forms of solution, authorship, conflict Public challenge matches (Tartaglia v. Ferrari) Webster Proof and Its History 8/2016 6 / 1

Renaissance Number Theorists Gerolamo Cardano (1501 1557) and Niccolo Tartaglia (1500 1576) Era of the master Solving the cubic equation Forms of solution, authorship, conflict Public challenge matches (Tartaglia v. Ferrari) Demonstration and Verification : I have the answer, I can check these cases. Webster Proof and Its History 8/2016 6 / 1

Calculus Era I Johannes Kepler (1571 1630): Proof, statistical methods Isaac Barrow (1630 1667): Tangent problem, discovered the fundamental theorem of calculus, derive solutions to physical problems Isaac Newton (1642 1727): Student of Barrow s, sloppily axiomatize some ideas in calculus to derive equations and solutions to difficult problems; motivated by infinitesimal change in physical problems Gottfried Leibniz (1646 1716): Philosopher and polymath, looser notation and better intuition provided the backbone of modern analysis Webster Proof and Its History 8/2016 7 / 1

Calculus Era II Ideas Webster Proof and Its History 8/2016 8 / 1

Calculus Era II Ideas infinitely small infinitely big infinitesimals, limits Webster Proof and Its History 8/2016 8 / 1

Calculus Era II Ideas infinitely small infinitely big infinitesimals, limits Big equations/formulae...on shaky footing; Justification and explication Webster Proof and Its History 8/2016 8 / 1

Calculus Era II Ideas infinitely small infinitely big infinitesimals, limits Big equations/formulae...on shaky footing; Justification and explication Solutions to big problems (e.g., the area problem, the tangent problem, calculus of variations) Not without critics George Berkeley (1685 1753) Transition: Webster Proof and Its History 8/2016 8 / 1

Calculus Era II Ideas infinitely small infinitely big infinitesimals, limits Big equations/formulae...on shaky footing; Justification and explication Solutions to big problems (e.g., the area problem, the tangent problem, calculus of variations) Not without critics George Berkeley (1685 1753) Transition: Leonhard Euler (1707 1783): Prolific, pioneering...sloppy; intuitive arguments, formal manipulation Webster Proof and Its History 8/2016 8 / 1

Calculus Era II Ideas infinitely small infinitely big infinitesimals, limits Big equations/formulae...on shaky footing; Justification and explication Solutions to big problems (e.g., the area problem, the tangent problem, calculus of variations) Not without critics George Berkeley (1685 1753) Transition: Leonhard Euler (1707 1783): Prolific, pioneering...sloppy; intuitive arguments, formal manipulation Example: The Basel problem Webster Proof and Its History 8/2016 8 / 1

Golden Era: 18th and 19th Century Moving towards modern proof Webster Proof and Its History 8/2016 9 / 1

Golden Era: 18th and 19th Century Moving towards modern proof Joseph Louis Lagrange (1736 1813): Move from blind formal manipulation and intuition, Taylor polynomials Karl Friedrich Gauss (1777 1855): Adequate (modern) analysis of series August Louis Cauchy (1789 1857): French counterpart to Gauss; limits, continuity, differentiation, and definite integral (modern), complex calculus Karl Weierstrass (1815 1897): Topology, foundations, real numbers, real analysis including ε δ Webster Proof and Its History 8/2016 9 / 1

Modernity I David Hilbert (1862 1943): Last conversant mathematician of entire subject Wanted axiomatic and consistent formulation of set theory Formalism: mathematics is manipulation of symbols according to agreed upon formal rules Hilbert s Program: Formal system which is complete, consistent, decidable Hilbert s 23 Problems at the International Congress in 1900 Axiomatic and consistent construction of the integers What are the rules? and What is the context? Webster Proof and Its History 8/2016 10 / 1

Modernity II Henri Poincare (1854 1912): Great mathematician; intuition opposite Hilbert and Russell; mathematics fundamentally distinct from logic; proof has intuitive steps, not purely mechanical Nicolas Bourbaki (1930 s): pseudonym for French mathematicians; encyclopedists: consistent, rigorous treatment of all common mathematics; no pictures, no intuition Bertrand Russell (1872 1970): foundations; reducing mathematics to its most elementary grains ; logicism; constructing the integers Kurt Godel (1906 1978): Incompleteness; destruction of Hilbert s Program and Russell/Whitehead Foundationalism/logicism Webster Proof and Its History 8/2016 11 / 1

Incompleteness In 1931 he proved: For any computable axiomatic system that is powerful enough to describe the the natural numbers/arithmetic (e.g. the Peano axioms or ZFC set theory), that: Webster Proof and Its History 8/2016 12 / 1

Incompleteness In 1931 he proved: For any computable axiomatic system that is powerful enough to describe the the natural numbers/arithmetic (e.g. the Peano axioms or ZFC set theory), that: If the formal system is consistent, it cannot be complete. Webster Proof and Its History 8/2016 12 / 1

Incompleteness In 1931 he proved: For any computable axiomatic system that is powerful enough to describe the the natural numbers/arithmetic (e.g. the Peano axioms or ZFC set theory), that: If the formal system is consistent, it cannot be complete. The consistency of the axioms cannot be proven within the system. Webster Proof and Its History 8/2016 12 / 1

Incompleteness In 1931 he proved: For any computable axiomatic system that is powerful enough to describe the the natural numbers/arithmetic (e.g. the Peano axioms or ZFC set theory), that: If the formal system is consistent, it cannot be complete. The consistency of the axioms cannot be proven within the system. These theorems ended attempts by many of those above to find a small set of consistent axioms sufficient for all of modern mathematics. Webster Proof and Its History 8/2016 12 / 1

Russell s Two Directions and Weirdness WEIRDNESS Foundations Seemingly Self-Evident Mathematical Facts The Infinite WEIRDNESS Webster Proof and Its History 8/2016 13 / 1

Russell s Two Directions and Weirdness WEIRDNESS Foundations Seemingly Self-Evident Mathematical Facts The Infinite WEIRDNESS Modern Mathematics: walking on egg shells Webster Proof and Its History 8/2016 13 / 1

Russell s Two Directions and Weirdness WEIRDNESS Foundations Seemingly Self-Evident Mathematical Facts The Infinite WEIRDNESS Modern Mathematics: walking on egg shells Proof in this class: Pretty axiomatic, basic We will not prove everything, and we will define many things intuitively Take many basic mathematical facts as given May take somethings for granted and come back and prove them later Webster Proof and Its History 8/2016 13 / 1

Fundamental Terms I Axiom 1 Definition versus Theorem Webster Proof and Its History 8/2016 14 / 1

Fundamental Terms I Axiom Fundamental building block of a theory, stated in terms outside of the theory; should be consistent with one another 1 Definition versus Theorem Webster Proof and Its History 8/2016 14 / 1

Fundamental Terms I Axiom Fundamental building block of a theory, stated in terms outside of the theory; should be consistent with one another Definition 1 1 Definition versus Theorem Webster Proof and Its History 8/2016 14 / 1

Fundamental Terms I Axiom Fundamental building block of a theory, stated in terms outside of the theory; should be consistent with one another Definition 1 Declaration of the properties of a new object, written only in terms of other well-defined objects and axioms 1 Definition versus Theorem Webster Proof and Its History 8/2016 14 / 1

Fundamental Terms I Axiom Fundamental building block of a theory, stated in terms outside of the theory; should be consistent with one another Definition 1 Declaration of the properties of a new object, written only in terms of other well-defined objects and axioms Theorem 1 Definition versus Theorem Webster Proof and Its History 8/2016 14 / 1

Fundamental Terms I Axiom Fundamental building block of a theory, stated in terms outside of the theory; should be consistent with one another Definition 1 Declaration of the properties of a new object, written only in terms of other well-defined objects and axioms Theorem A true statement in a theory which relates defined terms and other statements within the theory; 1 Definition versus Theorem Webster Proof and Its History 8/2016 14 / 1

Fundamental Terms I Axiom Fundamental building block of a theory, stated in terms outside of the theory; should be consistent with one another Definition 1 Declaration of the properties of a new object, written only in terms of other well-defined objects and axioms Theorem A true statement in a theory which relates defined terms and other statements within the theory; Often stated in the form: If p, then q where p and q are statements which are true or false; 1 Definition versus Theorem Webster Proof and Its History 8/2016 14 / 1

Fundamental Terms I Axiom Fundamental building block of a theory, stated in terms outside of the theory; should be consistent with one another Definition 1 Declaration of the properties of a new object, written only in terms of other well-defined objects and axioms Theorem A true statement in a theory which relates defined terms and other statements within the theory; Often stated in the form: If p, then q where p and q are statements which are true or false; Hypothesis(es)/ Conclusion 1 Definition versus Theorem Webster Proof and Its History 8/2016 14 / 1

Fundamental Terms II Proof Webster Proof and Its History 8/2016 15 / 1

Fundamental Terms II Proof A sequence of logically permissible steps connecting the hypothesis to the conclusion uses rules of inference and logic Webster Proof and Its History 8/2016 15 / 1

Fundamental Terms II Proof A sequence of logically permissible steps connecting the hypothesis to the conclusion uses rules of inference and logic Many types of proof, many proof techniques Webster Proof and Its History 8/2016 15 / 1

Fundamental Terms II Proof A sequence of logically permissible steps connecting the hypothesis to the conclusion uses rules of inference and logic Many types of proof, many proof techniques Lemma, Corollary, Proposition Webster Proof and Its History 8/2016 15 / 1

Fundamental Terms II Proof A sequence of logically permissible steps connecting the hypothesis to the conclusion uses rules of inference and logic Many types of proof, many proof techniques Lemma, Corollary, Proposition A Lemma is a small statement which only requires a small proof; usually a lemma and its proof are part of a larger proof of a theorem Webster Proof and Its History 8/2016 15 / 1

Fundamental Terms II Proof A sequence of logically permissible steps connecting the hypothesis to the conclusion uses rules of inference and logic Many types of proof, many proof techniques Lemma, Corollary, Proposition A Lemma is a small statement which only requires a small proof; usually a lemma and its proof are part of a larger proof of a theorem A Corollary is a small proposition which follows rather immediately from a theorem or its proof. Webster Proof and Its History 8/2016 15 / 1

Fundamental Terms II Proof A sequence of logically permissible steps connecting the hypothesis to the conclusion uses rules of inference and logic Many types of proof, many proof techniques Lemma, Corollary, Proposition A Lemma is a small statement which only requires a small proof; usually a lemma and its proof are part of a larger proof of a theorem A Corollary is a small proposition which follows rather immediately from a theorem or its proof. A Proposition is just a (quantifiable) statement which is true or false; usually does not require much proof Webster Proof and Its History 8/2016 15 / 1

Fundamental Notions I Modus ponens: Webster Proof and Its History 8/2016 16 / 1

Fundamental Notions I Modus ponens: If the statement p implies q is true, and the hypothesis p holds, then we know q must hold. Webster Proof and Its History 8/2016 16 / 1

Fundamental Notions I Modus ponens: If the statement p implies q is true, and the hypothesis p holds, then we know q must hold. Proofs generally take the form: Assume p (which may not always hold), derive the conclusion q. Webster Proof and Its History 8/2016 16 / 1

Fundamental Notions I Modus ponens: If the statement p implies q is true, and the hypothesis p holds, then we know q must hold. Proofs generally take the form: Assume p (which may not always hold), derive the conclusion q. Whenever p, then q. Webster Proof and Its History 8/2016 16 / 1

Fundamental Notions I Modus ponens: If the statement p implies q is true, and the hypothesis p holds, then we know q must hold. Proofs generally take the form: Assume p (which may not always hold), derive the conclusion q. Whenever p, then q. p is sufficient for q; Webster Proof and Its History 8/2016 16 / 1

Fundamental Notions I Modus ponens: If the statement p implies q is true, and the hypothesis p holds, then we know q must hold. Proofs generally take the form: Assume p (which may not always hold), derive the conclusion q. Whenever p, then q. p is sufficient for q; q is necessary for p. Webster Proof and Its History 8/2016 16 / 1

Fundamental Notions I Modus ponens: If the statement p implies q is true, and the hypothesis p holds, then we know q must hold. Proofs generally take the form: Assume p (which may not always hold), derive the conclusion q. Whenever p, then q. p is sufficient for q; q is necessary for p. Sets A set is any (unordered) collection of (mathematical) objects; Webster Proof and Its History 8/2016 16 / 1

Fundamental Notions I Modus ponens: If the statement p implies q is true, and the hypothesis p holds, then we know q must hold. Proofs generally take the form: Assume p (which may not always hold), derive the conclusion q. Whenever p, then q. p is sufficient for q; q is necessary for p. Sets A set is any (unordered) collection of (mathematical) objects; note one can have sets of sets (examples to follow) Webster Proof and Its History 8/2016 16 / 1

Fundamental Notions I Modus ponens: If the statement p implies q is true, and the hypothesis p holds, then we know q must hold. Proofs generally take the form: Assume p (which may not always hold), derive the conclusion q. Whenever p, then q. p is sufficient for q; q is necessary for p. Sets A set is any (unordered) collection of (mathematical) objects; note one can have sets of sets (examples to follow) Statements: An (open) statement: any mathematical statement; not necessarily true or false. Webster Proof and Its History 8/2016 16 / 1

Fundamental Notions I Modus ponens: If the statement p implies q is true, and the hypothesis p holds, then we know q must hold. Proofs generally take the form: Assume p (which may not always hold), derive the conclusion q. Whenever p, then q. p is sufficient for q; q is necessary for p. Sets A set is any (unordered) collection of (mathematical) objects; note one can have sets of sets (examples to follow) Statements: An (open) statement: any mathematical statement; not necessarily true or false. Propositions: A statement which is true or false, and can be proved or disproved. Webster Proof and Its History 8/2016 16 / 1

Fundamental Notions I Modus ponens: If the statement p implies q is true, and the hypothesis p holds, then we know q must hold. Proofs generally take the form: Assume p (which may not always hold), derive the conclusion q. Whenever p, then q. p is sufficient for q; q is necessary for p. Sets A set is any (unordered) collection of (mathematical) objects; note one can have sets of sets (examples to follow) Statements: An (open) statement: any mathematical statement; not necessarily true or false. Propositions: A statement which is true or false, and can be proved or disproved. Remember Godel... Webster Proof and Its History 8/2016 16 / 1

Sets I The empty set: Webster Proof and Its History 8/2016 17 / 1

Sets I The empty set: Lists Webster Proof and Its History 8/2016 17 / 1

Sets I The empty set: Lists {1, 2, 3} Webster Proof and Its History 8/2016 17 / 1

Sets I The empty set: Lists {1, 2, 3} {x, y, z, p, q, r} Webster Proof and Its History 8/2016 17 / 1

Sets I The empty set: Lists {1, 2, 3} {x, y, z, p, q, r} {+,,, /} Webster Proof and Its History 8/2016 17 / 1

Sets I The empty set: Lists {1, 2, 3} {x, y, z, p, q, r} {+,,, /} {sin(θ), cos(θ), tan(θ)} Webster Proof and Its History 8/2016 17 / 1

Sets I The empty set: Lists {1, 2, 3} {x, y, z, p, q, r} {+,,, /} {sin(θ), cos(θ), tan(θ)} Ellipses Webster Proof and Its History 8/2016 17 / 1

Sets I The empty set: Lists {1, 2, 3} {x, y, z, p, q, r} {+,,, /} {sin(θ), cos(θ), tan(θ)} Ellipses {1, 2, 3,...} {a, b, c,..., z} {1, 3, 5, 7,...} Webster Proof and Its History 8/2016 17 / 1

Sets I The empty set: Lists {1, 2, 3} {x, y, z, p, q, r} {+,,, /} {sin(θ), cos(θ), tan(θ)} Ellipses {1, 2, 3,...} {a, b, c,..., z} {1, 3, 5, 7,...} {2, 4,...} Webster Proof and Its History 8/2016 17 / 1

Sets I The empty set: Lists {1, 2, 3} {x, y, z, p, q, r} {+,,, /} {sin(θ), cos(θ), tan(θ)} Ellipses {1, 2, 3,...} {a, b, c,..., z} {1, 3, 5, 7,...} {2, 4,...} BAD Webster Proof and Its History 8/2016 17 / 1

Sets I The empty set: Lists {1, 2, 3} {x, y, z, p, q, r} {+,,, /} {sin(θ), cos(θ), tan(θ)} Ellipses {1, 2, 3,...} {a, b, c,..., z} {1, 3, 5, 7,...} {2, 4,...} BAD Set builder Webster Proof and Its History 8/2016 17 / 1

Sets I The empty set: Lists {1, 2, 3} {x, y, z, p, q, r} {+,,, /} {sin(θ), cos(θ), tan(θ)} Ellipses {1, 2, 3,...} {a, b, c,..., z} {1, 3, 5, 7,...} {2, 4,...} BAD Set builder {x : x > 0} {x x 2 + 5x + 6 = 0} {z z = 2 m + 1, where m is an integer} Webster Proof and Its History 8/2016 17 / 1

Sets II Subset/superset: Webster Proof and Its History 8/2016 18 / 1

Sets II Subset/superset: S R if all members of S are also present in R (proper subset: S R or S R) Webster Proof and Its History 8/2016 18 / 1

Sets II Subset/superset: S R if all members of S are also present in R (proper subset: S R or S R) Universe: Webster Proof and Its History 8/2016 18 / 1

Sets II Subset/superset: S R if all members of S are also present in R (proper subset: S R or S R) Universe: U is the set from which all sets in considerations are drawn; Webster Proof and Its History 8/2016 18 / 1

Sets II Subset/superset: S R if all members of S are also present in R (proper subset: S R or S R) Universe: U is the set from which all sets in considerations are drawn; if we are interested in a set S then S U (context dependent) Webster Proof and Its History 8/2016 18 / 1

Sets II Subset/superset: S R if all members of S are also present in R (proper subset: S R or S R) Universe: U is the set from which all sets in considerations are drawn; if we are interested in a set S then S U (context dependent) When talking about numbers, U usually equals C, R, Z or N Webster Proof and Its History 8/2016 18 / 1

Sets II Subset/superset: S R if all members of S are also present in R (proper subset: S R or S R) Universe: U is the set from which all sets in considerations are drawn; if we are interested in a set S then S U (context dependent) When talking about numbers, U usually equals C, R, Z or N Complement: For a set S U its complement is everything in U not in S Webster Proof and Its History 8/2016 18 / 1

Sets II Subset/superset: S R if all members of S are also present in R (proper subset: S R or S R) Universe: U is the set from which all sets in considerations are drawn; if we are interested in a set S then S U (context dependent) When talking about numbers, U usually equals C, R, Z or N Complement: For a set S U its complement is everything in U not in S S = U S = U \ S, where and \ are set minus (more later) Webster Proof and Its History 8/2016 18 / 1

Sets II Subset/superset: S R if all members of S are also present in R (proper subset: S R or S R) Universe: U is the set from which all sets in considerations are drawn; if we are interested in a set S then S U (context dependent) When talking about numbers, U usually equals C, R, Z or N Complement: For a set S U its complement is everything in U not in S S = U S = U \ S, where and \ are set minus (more later) Sometimes this is written as S C Webster Proof and Its History 8/2016 18 / 1

Sets II Subset/superset: S R if all members of S are also present in R (proper subset: S R or S R) Universe: U is the set from which all sets in considerations are drawn; if we are interested in a set S then S U (context dependent) When talking about numbers, U usually equals C, R, Z or N Complement: For a set S U its complement is everything in U not in S S = U S = U \ S, where and \ are set minus (more later) Sometimes this is written as S C x is an element of S is written x S, Webster Proof and Its History 8/2016 18 / 1

Sets II Subset/superset: S R if all members of S are also present in R (proper subset: S R or S R) Universe: U is the set from which all sets in considerations are drawn; if we are interested in a set S then S U (context dependent) When talking about numbers, U usually equals C, R, Z or N Complement: For a set S U its complement is everything in U not in S S = U S = U \ S, where and \ are set minus (more later) Sometimes this is written as S C x is an element of S is written x S, if x / S, then x S. Webster Proof and Its History 8/2016 18 / 1

Sets III Let S, R U. Set Equality: S = R if Webster Proof and Its History 8/2016 19 / 1

Sets III Let S, R U. Set Equality: S = R if S R and R S Webster Proof and Its History 8/2016 19 / 1

Sets III Let S, R U. Set Equality: S = R if S R and R S S and R have exactly the same elements Webster Proof and Its History 8/2016 19 / 1

Sets III Let S, R U. Set Equality: S = R if S R and R S S and R have exactly the same elements Union: Webster Proof and Its History 8/2016 19 / 1

Sets III Let S, R U. Set Equality: S = R if S R and R S S and R have exactly the same elements Union: S R {x U : x S or x R} Webster Proof and Its History 8/2016 19 / 1

Sets III Let S, R U. Set Equality: S = R if S R and R S S and R have exactly the same elements Union: S R {x U : x S or x R} Intersection: Webster Proof and Its History 8/2016 19 / 1

Sets III Let S, R U. Set Equality: S = R if S R and R S S and R have exactly the same elements Union: S R {x U : x S or x R} Intersection: S R {x U : x S and x R} Webster Proof and Its History 8/2016 19 / 1

Sets III Let S, R U. Set Equality: S = R if S R and R S S and R have exactly the same elements Union: S R {x U : x S or x R} Intersection: S R {x U : x S and x R} Difference: Webster Proof and Its History 8/2016 19 / 1

Sets III Let S, R U. Set Equality: S = R if S R and R S S and R have exactly the same elements Union: S R {x U : x S or x R} Intersection: S R {x U : x S and x R} Difference: S R = {x S : s / R} = S \ R Webster Proof and Its History 8/2016 19 / 1

Sets III Let S, R U. Set Equality: S = R if S R and R S S and R have exactly the same elements Union: S R {x U : x S or x R} Intersection: S R {x U : x S and x R} Difference: S R = {x S : s / R} = S \ R If S R then S R =... Webster Proof and Its History 8/2016 19 / 1

Sets III Let S, R U. Set Equality: S = R if S R and R S S and R have exactly the same elements Union: S R {x U : x S or x R} Intersection: S R {x U : x S and x R} Difference: S R = {x S : s / R} = S \ R If S R then S R =... Symmetric Difference: Webster Proof and Its History 8/2016 19 / 1

Sets III Let S, R U. Set Equality: S = R if S R and R S S and R have exactly the same elements Union: S R {x U : x S or x R} Intersection: S R {x U : x S and x R} Difference: S R = {x S : s / R} = S \ R If S R then S R =... Symmetric Difference: S R =... Webster Proof and Its History 8/2016 19 / 1

Fundamental Notions II Quantifiers (constructs to quantify statements) Webster Proof and Its History 8/2016 20 / 1

Fundamental Notions II Quantifiers (constructs to quantify statements) For all Webster Proof and Its History 8/2016 20 / 1

Fundamental Notions II Quantifiers (constructs to quantify statements) For all Webster Proof and Its History 8/2016 20 / 1

Fundamental Notions II Quantifiers (constructs to quantify statements) For all There exists Webster Proof and Its History 8/2016 20 / 1

Fundamental Notions II Quantifiers (constructs to quantify statements) For all There exists Webster Proof and Its History 8/2016 20 / 1

Fundamental Notions II Quantifiers (constructs to quantify statements) For all There exists There exists a unique Webster Proof and Its History 8/2016 20 / 1

Fundamental Notions II Quantifiers (constructs to quantify statements) For all There exists There exists a unique! Webster Proof and Its History 8/2016 20 / 1

Fundamental Notions II Quantifiers (constructs to quantify statements) For all There exists There exists a unique! Negation: For any statement P, the negation (read: not P ) is written: Webster Proof and Its History 8/2016 20 / 1

Fundamental Notions II Quantifiers (constructs to quantify statements) For all There exists There exists a unique! Negation: For any statement P, the negation (read: not P ) is written: P Webster Proof and Its History 8/2016 20 / 1

Fundamental Notions II Quantifiers (constructs to quantify statements) For all There exists There exists a unique! Negation: For any statement P, the negation (read: not P ) is written: P Cardinality: Webster Proof and Its History 8/2016 20 / 1

Fundamental Notions II Quantifiers (constructs to quantify statements) For all There exists There exists a unique! Negation: For any statement P, the negation (read: not P ) is written: P Cardinality: S = #(S) number of elements in S. Webster Proof and Its History 8/2016 20 / 1

Fundamental Notions II Quantifiers (constructs to quantify statements) For all There exists There exists a unique! Negation: For any statement P, the negation (read: not P ) is written: P Cardinality: S = #(S) number of elements in S. Infinity: Webster Proof and Its History 8/2016 20 / 1

Fundamental Notions II Quantifiers (constructs to quantify statements) For all There exists There exists a unique! Negation: For any statement P, the negation (read: not P ) is written: P Cardinality: S = #(S) number of elements in S. Infinity: Concept (not to be treated like a number); Webster Proof and Its History 8/2016 20 / 1

Fundamental Notions II Quantifiers (constructs to quantify statements) For all There exists There exists a unique! Negation: For any statement P, the negation (read: not P ) is written: P Cardinality: S = #(S) number of elements in S. Infinity: Concept (not to be treated like a number); a class of cardinalities of certain sets; Webster Proof and Its History 8/2016 20 / 1

Fundamental Notions II Quantifiers (constructs to quantify statements) For all There exists There exists a unique! Negation: For any statement P, the negation (read: not P ) is written: P Cardinality: S = #(S) number of elements in S. Infinity: Concept (not to be treated like a number); a class of cardinalities of certain sets; not finite Webster Proof and Its History 8/2016 20 / 1