Proof – a historical perspective 27.03.2007. References 1.Harel, G., & Sowder, L (in press). Toward a comprehensive perspective on proof, In F. Lester.

Slides:



Advertisements
Similar presentations
What kind of mp3 player do mathematicians use?
Advertisements

Introduction to Proofs
Models and interpretations in the fifties: Carnap and Kemeny Pierre Wagner Université Paris 1 Panthéon-Sorbonne.
Beyond Counting Infinity and the Theory of Sets Nate Jones & Chelsea Landis.
Whiteboardmaths.com © 2004 All rights reserved
Introduction to Algorithms A History Tour Definition of Algorithms Problem solving: Problem Statement Assumptions Processes Paradoxes.
CS1001 Lecture 22. Overview Mechanizing Reasoning Mechanizing Reasoning G ö del ’ s Incompleteness Theorem G ö del ’ s Incompleteness Theorem.
Logic and Set Theory.
Logic and Proof. Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement.
So far we have learned about:
Ch. 1: Some History References Modern Geometries: Non-Euclidean, Projective, and Discrete 2 nd ed by Michael Henle Euclidean and Non-Euclidean Geometries:
First Order Logic (chapter 2 of the book) Lecture 3: Sep 14.
Copyright © Cengage Learning. All rights reserved.
TR1413: Discrete Mathematics For Computer Science Lecture 1: Mathematical System.
Computability Thank you for staying close to me!! Learning and thinking More algorithms... computability.
MATH 2306 History of Mathematics Instructor: Dr. Alexandre Karassev.
Mathematics and TOK Exploring the Areas of Knowlege.
Mathematics and the Theory of Knowledge
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
Greek Mathematics Period (600 B.C.-A.D. 500)
First Order Logic. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about first order.
Areas of knowledge – Mathematics
Mathematical Explanations and Arguments Number Theory for Elementary School Teachers: Chapter 1 by Christina Dionne Number Theory for Elementary School.
C OURSE : D ISCRETE STRUCTURE CODE : ICS 252 Lecturer: Shamiel Hashim 1 lecturer:Shamiel Hashim second semester Prepared by: amani Omer.
A Short History of Geometry,
AOK. D6 Journal (5 th entry) TWE can imagination be objective if it is derived in the mind? If it is always subjective can it lead to knowledge?
Egyptian and Babylonian Period (2000 B.C B.C.) Introduction to early numeral systems Simple arithmetic Practical geometry Decimal and Sexagesimal.
History and Role of Proofs in Secondary Mathematics Education: A Pedagogical Perspective Cheryl Clough Dr. King.
‘Pure Mathematics is, in its way, the poetry of logical ideas’ Einstein ‘Maths is like love, a simple idea but it can get very complicated.’ Unknown ‘The.
Linear Algebra Fall 2013 mathx.kaist.ac.kr/~schoi/teaching.html.
Tending the Greenhouse Vertical and Horizontal Connections within the Mathematics Curriculum Kimberly M. Childs Stephen F. Austin State University.
Introduction to Proofs
David Evans CS200: Computer Science University of Virginia Computer Science Class 24: Gödel’s Theorem.
Math 3121 Abstract Algebra I Section 0: Sets. The axiomatic approach to Mathematics The notion of definition - from the text: "It is impossible to define.
An Introduction to Chapter 9: Geometric Figures
MATH 224 – Discrete Mathematics
Logic in Computer Science - Overview Sep 1, 2011 POSTECH 박성우.
MAT 333 Fall  As we discovered with the Pythagorean Theorem examples, we need a system of geometry to convince ourselves why theorems are true.
INTRODUCTION TO Euclid’s geometry The origins of geometry.
Mathematics. We tend to think of math as an island of certainty in a vast sea of subjectivity, interpretability and chaos. What is it?
Copyright © Cengage Learning. All rights reserved. CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS THE LOGIC OF QUANTIFIED STATEMENTS.
TOK: Mathematics Unit 1 Day 1. Introduction Opening Question Is math discovered or is it invented? Think about it. Think real hard. Then discuss.
Overview.  Explores the theoretical foundations of computing  What can and cannot be done by an algorithm  Most of the material predates computers!
Great Theoretical Ideas in Computer Science.
Great Theoretical Ideas in Computer Science.
Thinking in Methodologies Class Notes. Gödel’s Theorem.
BY: LEONARDO BENEDITT Mathematics. What is Math? Mathematics is the science and study of quantity, structure, space, and change. Mathematicians.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
CSE 311 Foundations of Computing I Lecture 26 Cardinality, Countability & Computability Autumn 2011 CSE 3111.
CS104:Discrete Structures Chapter 2: Proof Techniques.
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.
5 Lecture in math Predicates Induction Combinatorics.
◙ The Ishango Bone (dated – BC)
The History Of Calculus
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.
A historical introduction to the philosophy of mathematics
What is Mathematics? The science (or art?) that deals with numbers, quantities, shapes, patterns and measurement An abstract symbolic communication system.
Discrete Mathematics for Computer Science
Indirect Argument: Two Classical Theorems
Great Theoretical Ideas in Computer Science
MATHEMATICS.
What kind of mp3 player do mathematicians use?
Lecture 22: Gödel’s Theorem CS200: Computer Science
CS 220: Discrete Structures and their Applications
First Order Logic Rosen Lecture 3: Sept 11, 12.
Great Theoretical Ideas in Computer Science
MATH 2306 History of Mathematics
Philosophy of Mathematics: a sneak peek
An example of the “axiomatic approach” from geometry
Presentation transcript:

Proof – a historical perspective

References 1.Harel, G., & Sowder, L (in press). Toward a comprehensive perspective on proof, In F. Lester (Ed.), Second Handbook of Research on Mathematics Teaching and Learning, National Council of Teachers of Mathematics Kleiner, I. & Movshovitz-Hadar, N. (1997). Proof: A many- splendoured thing, The Mathematical Intelligencer, 19 (3), Kleiner, I. (1991). Rigor and Proof in Mathematics: A Historical Perspective, Mathematics Magazine, 64 (5), pp History topics:

Some phases in development of the concept of proof Pre-Greek math Egyptian mathematics – BC Babylonian mathematics – BC (computational procedures, no symbols) Greek math – 600 BC – 200 BC (deductive reasoning) Thales (-600), Pythagoras (-500), Euclid (-300), Aristotle (-300), Apollonius (-200) Syria, Iran, India ( AC) (preservation and development of the Greek tradition of proof) Omar Khayyam (1100), Adelard and Fibonacci (1100)– brought math knowledge from Islamic countries and Greeks back to Europe Renaissance (16-17 th centuries) Vieta, Descartes, Leibnitz (symbolic algebra) The calculus of Caushi and Weierstrass (19 th century) (rigorization of calculus, “genetic definitions”) Formalism, logicism, intuisionism (20 th century) Hilbert, Zermelo, Fraenkel, Guedel, Computer-based proofs, probabilistic proofs (1970-)

Pre-Greek vs. Greek math Pre-Greek mathematics concerned actual physical entities and measurements (method: empirical or perceptual reasoning) Geeks: the entities under investigation are idealizations of experiential spatial realities (method: logical deductions, terms without definitions - primary propositions – propositions that should be proved)

Motives of Greek mathematics The “crisis” caused by Pythagoreans’ proof of incommensurability of the diagonal and side of the square The desire to decide among contradictory results from past civilizations (e.g., debate about Pi, paradox of Zeno) The nature of Greek society The need to teach

Debates on Greek math (16 th century) Proposition I.32 in Euclid’s Elements: In any triangle, if one of the sides is produces, then the exterior angle equals the sum of the two interior and opposite angles, and the sum of the three interior angles of the triangles equals two right angles. Aristotle’s definition of science: “We suppose ourselves to possess unqualified scientific knowledge of a thing,…, unless we think that we know the cause on which the fact depends as the cause of the fact and of no other”. THE IDEA OF CAUSE AND EFFECT Implications: 1) mathematics is not a science in Aristotle’s meaning 2) Proof by contradiction is meaningless and should be removed from mathematics 3) Proofs by exhaustion by Archimedes is unsatisfactory as it is not causal (Rivaltus, 1615)

Additional motives for re-conceptualization of Greek mathematics in 16 th century Greeks paid no attention to the operations underlying spatial configurations, there were many problems without solutions (e.g., trisection of an angle) Vieta and Leibniz: creation of algebraic notation; proof is a sequence of sentences beginning with identities and proceeding by a finite number of steps of logic and rules of definitional substitution “It is hardly an exaggeration to say that the calculus of Leibniz brings within the range of an ordinary student problems that once required the ingenuity of an Archimedes or a Newton” (Edwards, 1979)

An example: Leibniz “proof” of the product rule for differentiation d(xy)=(x+dx)(y+dy)-xy=xy+xdy+ydx+dxdy- xy=xdy+ydx - since “the quantity dxdy…is infinitely small in comparison with the rest, and hence can be discarded” (Leibniz, cited in Edwards, 1979)

An additional example: Euler Now let n be an infinitely large integer and z an infinitely small number The above equation becomes: Let nz=x, which is a finite since n is infinitely large and z infinitely small. Finally,

Errors were made! Example: Euler “proved” that (counterexample was given by Schwarz) Russel vs. Cantor

Motives for re-conceptualization of mathematics in 19 th century Attempts to establish a consistent foundation for mathematics – one that is free from paradoxes “In both situations [Greeks vs. 16 th century and 16 th vs. 19 th century], crises had developed which threatened the security of mathematics; and in both cases resorts was taken to explicit axiomatic statement of the foundations upon which one hoped to build without fear of further charges of inconsistency” “Like the Greek mathematicians, the modern mathematicians had only one model in mind, albeit a different model” (Wilder, 1967)

Greek vs. “modern mathematics” GreeksModern mathematics Ideal existence reference to images Constant reality Selectivity in choosing the entities for investigation Just one model (of geometry) Focus on “operation” (e.g., trisection of an angle) Proof is valid by virtue of its content, not form abstract entities images are not necessary Varying reality Entities for investigation can be of any nature Different models Focus also on “results of operation ” Proof is valid by virtue of it form alone

Logicism, formalism and intuitionism (Early 20 th century) Logicism: The notion of proof – its scope and limits – a subject of study by mathematicians. Mathematics is a part of logic (Peano). Formalism: Mathematics is a study of axiomatic systems. Mathematics is about symbols to which no meaning is to be attached! (Hilbert) Intuitionism: No formal analysis of axiomatic systems is necessary. Mathematics should not be founded on the system of axioms, the mathematician’s intuition will guide him in avoiding contradictions. Proofs must be constructive (Brouwer).

1) “Most research mathematicians do not take any course in formal logic!” The logicism is not widespread among mathematicians. 2) The debate among formalists and intuitionists is still unresolved, but “most mathematicians are untroubled, at least, in their daily work, about the debates concerning the various philosophies of mathematics” Israel Kleiner:

Computer-based and probabilistic proofs Appel and Haken (1976): computer-aided proof of the four-color theorem – verification of 1482 confiducations. Thousands of pages of computer programs that were not published Michael Rabin: is a prime number, the statement has a small probability of error “Some have argued that there is no essential difference between probabilistic and deterministic proofs. Both are convincing arguments. Both are to be believed with some probability of error” (Kleiner, 1991)