Philosophy of Mathematics: a sneak peek

Slides:



Advertisements
Similar presentations
Nature and Construction of Knowledge in Mathematics
Advertisements

Discrete Math Methods of proof 1.
Introduction to Proofs
Axiomatic systems and Incidence Geometry
Elementary Number Theory and Methods of Proof
This is not the Title of our Seminar
Chapter 1 Using Geogebra Exploration and Conjecture.
Math 333 – Euclidean and Non-Euclidean Geometry Dr. Hamblin.
Exploring the Areas of Knowledge
The Axiomatic Method. The axiomatic method I: Mathematical Proofs Why do we need to prove things? How do we resolve paradoxes?
So far we have learned about:
First Order Logic (chapter 2 of the book) Lecture 3: Sep 14.
TR1413: Discrete Mathematics For Computer Science Lecture 1: Mathematical System.
Computability Thank you for staying close to me!! Learning and thinking More algorithms... computability.
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
WARM UP EXERCSE Consider the right triangle below with M the midpoint of the hypotenuse. Is MA = MC? Why or why not? MC B A 1.
Copyright © Cengage Learning. All rights reserved.
Geometry: Points, Lines, Planes, and Angles
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.
MAT 333 Fall  As we discovered with the Pythagorean Theorem examples, we need a system of geometry to convince ourselves why theorems are true.
Michelle Huchette Block 2. * Greek * From Alexandria, taught mathematics there * Worked with prepositions and proofs * Created the basis for teachings.
Models and Incidence geometry
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?
Mathematics What is it? What is it about?. Terminology: Definition Axiom – a proposition that is assumed without proof for the sake of studying the consequences.
Course Overview and Road Map Computability and Logic.
1.1 Introduction to Inductive and Deductive Reasoning
TOK: Mathematics Unit 1 Day 1. Introduction Opening Question Is math discovered or is it invented? Think about it. Think real hard. Then discuss.
Euclid and the “elements”. Euclid (300 BC, 265 BC (?) ) was a Greek mathematician, often referred to as the "Father of Geometry”. Of course this is not.
Great Theoretical Ideas in Computer Science.
Copyright © Cengage Learning. All rights reserved.
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
Great Theoretical Ideas in Computer Science.
Naïve Set Theory. Basic Definitions Naïve set theory is the non-axiomatic treatment of set theory. In the axiomatic treatment, which we will only allude.
Thinking in Methodologies Class Notes. Gödel’s Theorem.
Friday 8 Sept 2006Math 3621 Axiomatic Systems Also called Axiom Systems.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
Geometry The Van Hiele Levels of Geometric Thought.
The Parallel Postulate
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.
Geometry: Axiomatic System. MA.912.G Analyze the structure of Euclidean geometry as an axiomatic system. Distinguish between undefined terms, definitions,
Foundations of Geometry
CS151: Mathematical Foundations of Computing Mathematical Induction.
Chapter 2 Sets and Functions.
What is Mathematics? The science (or art?) that deals with numbers, quantities, shapes, patterns and measurement An abstract symbolic communication system.
Gödel's Legacy: The Limits Of Logics
Axiomatic Number Theory and Gödel’s Incompleteness Theorems
Mathematics and Certainty
Discrete Mathematics for Computer Science
Chapter 4 (Part 1): Induction & Recursion
POSTULATES AND PROOFS ★Postulates are statements that are assumed to be true without proof. ★ Postulates serve two purposes - to explain undefined terms,
Chapter 3 The Real Numbers.
Great Theoretical Ideas in Computer Science
MATHEMATICS.
CS201: Data Structures and Discrete Mathematics I
CS201: Data Structures and Discrete Mathematics I
Lecture 22: Gödel’s Theorem CS200: Computer Science
2.4 Use Postulates & Diagrams
CS 220: Discrete Structures and their Applications
First Order Logic Rosen Lecture 3: Sept 11, 12.
Elementary Number Theory & Proofs
Great Theoretical Ideas in Computer Science
Foundations of Discrete Mathematics
1.1 Introduction to Inductive and Deductive Reasoning
An example of the “axiomatic approach” from geometry
CS201: Data Structures and Discrete Mathematics I
Mathematics Michael Lacewing.
Section 1.7 and 1.8- Deductive Structure / Statements of Logic
Presentation transcript:

Philosophy of Mathematics: a sneak peek

Mathematics exists independently of the human mind. REALISM Mathematics exists independently of the human mind. Humans and “aliens” did not invent mathematics. Math is discovered. Math is physically real.

REALISM One type is Mathematical Platonism: mathematics is abstract, eternal and unchanging.

Mathematics is “invented” by the human mind (e.g., Formalism). ANTI-REALISM Mathematics is “invented” by the human mind (e.g., Formalism). Math is not physically real.

NON-PLATONISTIC SCHOOLS OF THOUGHT Logicism Intuitionism Formalism

reduce mathematics to logic 1. LOGICISM reduce mathematics to logic

mathematical knowledge is acquired by deduction from basic principles DEDUCTIVE LOGIC mathematical knowledge is acquired by deduction from basic principles

2. INTUITIONISM mathematics is an activity of construction “The real numbers are mental constructions, proofs and theorems are mental constructions, mathematical meaning is a mental construction”

3. FORMALISM “higher mathematics is no more than a formal game” proving mathematical statements is a game in which symbols (abstract objects) are manipulated according to fixed rules

3. FORMALISM a necessary requirement of a formal system (e.g., axiomatic system) is that it should be at least consistent [Hilbert] An axiomatic system is consistent if there is no statement such that both the statement and its negation are axioms or theorems of the axiomatic system. Contradictory axioms or theorems are not desired in an axiomatic system.

AXIOMATIC SYSTEM MATH 10

AXIOMATIC (POSTULATE) SYSTEM consists of some undefined terms and a list of statements, called axioms, concerning the undefined terms one obtains a mathematical theory by proving new statements, called theorems, using only the axioms, logic system, and previous theorems definitions are made in the process in order to be more concise

INGREDIENTS Undefined terms/primitive terms Defined terms Axioms/postulates - accepted unproved statements Theorems - proved statements

A theory consists of an axiomatic system and all its derived theorems.

“THEORY” Examples: Approximation theory Automata theory Chaos theory Coding theory Game theory Graph theory Group theory Information theory Knot theory Number theory Probability theory Queueing theory Set theory

ENGLISH LANGUAGE Here, we will use the English language as an auxiliary language. Note: “2+2=6.” is a sentence.

ENGLISH LANGUAGE Here, we will use the English language to as an auxiliary language.

UNDEFINED TERMS Undefined terms are of two types: objects or elements (e.g., point, line, plane) relationships between objects, called relations (e.g., on, between) “A point is on a line.”

UNDEFINED TERMS Undefined terms are not anymore defined to eliminate infinite regress of defining terms.

UNDEFINED TERMS A model of an axiomatic system is obtained if we can assign meaning to the undefined terms of the axiomatic system which convert the axioms into true statements about the assigned concepts.

UNDEFINED TERMS Two types of models: Concrete model: meanings assigned to the undefined terms are objects and relations adapted from the real world. Abstract model: meanings assigned to the undefined terms are objects and relations adapted from another axiomatic development.

THEOREMS As we prove a “new” statement to be true, it becomes a theorem. Proof should be based only on the axioms, logic system, and previous theorems.

NOTE ON MATHEMATICAL PROOF WARNING! The word “obvious” is not acceptable as a proof. Do not make an additional assumption outside the system being studied. Do not depend on any preconceived idea or picture. Pictures should only be used as an intuitive aid in developing the proof.

Conjecture A statement formed without proof (not yet proved or disproved) Fermat’s Last Theorem (already proven by Andrew Wiles after 350 years death of Fermat): “No three positive integers a, b, and c satisfy the equation an + bn = cn for any integer value of n greater than 2."

Example 1 Axiom 1. Every dog has at least two human owners. http://www.edmontonjournal.com/Michelle+Cook+husband+Brent+Harris+their+dogs+their+house+Fort+John+couple+sold+their+single+family+home+Kelowna+take+jobs+Fort+John+were+surprised+competition+property+Photo+Russell+Eggleston+Special+Vancouver/9128090/story.html Axiom 1. Every dog has at least two human owners. Axiom 2. Every human owner has at least two dogs. Axiom 3. There exists at least one dog.

Example 1 Suppose the real number system holds. What are the undefined terms in this axiom set? Elements: dog; human owner Relation: has

Example 1 Axiom 3 guarantees the existence of a dog, but no axiom explicitly states that there exists a human owner. Theorem 1. There exists at least one human owner. Proof: By Axiom 3, there exists a dog. Now since each dog must have at least two human owners by Axiom 1, there exists at least one human owner. QED

IDEAL AXIOMATIC SYSTEM Consistent: the system lacks contradiction, that is, we cannot derive both a statement and its negation from the system's axioms (a necessary requirement) Independent: an axiom is independent if it is not a theorem that follows from the other axioms (not a necessary requirement) Complete: every statement containing the undefined and defined terms of the system can be proved valid or invalid

NOTE ON CONSISTENCY “Inconsistent theories prove everything, including their consistency.”

NOTE ON INDEPENDENT AXIOMS In some high school geometry courses, theorems which are long and difficult to prove are usually taken as axioms/postulates. Hence in most high school geometry courses, the axiom sets are usually not independent.

Example 1 Axiom 1. Every dog has at least two human owners. Axiom 2. Every human owner has at least two dogs. Axiom 3. There exists at least one dog. Axiom 4. There exists at least one human owner. (dependent)

Mathematician's worst nightmare Kurt Gödel with his Incompleteness Theorem (1931) demonstrated that even in elementary parts of arithmetic there exist propositions which cannot be proved or disproved within the system.

Mathematician's worst nightmare The liar paradox: "This sentence is false." A Gödel sentence G for a system M (truth replaced by provability): "G is not provable in the system M." Note: It is not possible to replace "not provable" with "false”.

Mathematician's worst nightmare “A complete and consistent list of axioms can never be formulated.” Each time an additional consistent statement is added as an axiom, there are other true statements that still cannot be proved. If an axiom is added that makes the system complete, it does so at the cost of making the system inconsistent. Gödel’s Incompleteness Theorem says that there will always be statements that are eternally doomed to be proven neither true or false.

Mathematician's worst nightmare “At the bottom of any logic system (such as science) are statements that must be taken on faith alone.” However, this ”incompleteness” provides opportunity for growth and improvement of mathematics/science.

Mathematician's worst nightmare Generally, an axiomatic system does not stand alone.

EXAMPLES MATH 10

Example 1 Axiom 1. Every dog has at least two human owners. Axiom 2. Every human owner has at least two dogs. Axiom 3. There exists at least one dog.

Example 1 Prove that the minimum number of dogs is two. Proof: By Theorem 1, there exists a human owner, call it H1. Then by Axiom 2, H1 must have two dogs call them D1 and D2. Hence, there are at least two dogs. By Axiom 1, D1 must have a human owner other than H1, call it H2. We form a model where H1 and H2 both are assigned to D1 and D2, then we have exactly two dogs, which demonstrates that the minimum number of dogs is two. QED

Example 1 This axiomatic system is consistent. But not complete. For example, we cannot prove or disprove: “There exist at least four dogs.”

Example 2 Axiom 1. Every heart has at least two paths. Axiom 2. Every path has at least two hearts. Axiom 3. There exists at least one heart.

Example 2 Example 1 and Example 2 are abstractly the same, only the notation is different. 

Example 2 Axiom 1. Every heart has at least two paths. Axiom 2. Every path has at least two hearts. Axiom 3. There exists at least one heart. Definition: A path P is said to connect two hearts, say Puso1 and Puso2, iff P has Puso1 and Puso2.

Example 2 Axiom 1. Every heart has at least two paths. Axiom 2. Every path has at least two hearts. Axiom 3. There exists at least one heart. Theorem: Every path connects two hearts.

Example 2 Suppose there are exactly 2 hearts.

Example 2 Suppose there are exactly 3 hearts.

Example 2 Suppose there are exactly 4 hearts.

Example 2 Suppose there are exactly 4 hearts.

Example 2 Suppose there are exactly 4 hearts.

Example 3 Axiom 1. Every heart has at least two paths. Axiom 2. Every path has at least two hearts. Axiom 3. There exists exactly two hearts. Axiom 4. Any two paths have at most one heart in common.

Example 3 This axiomatic system is inconsistent.

Example 4 Axiom 1. Every hive is a collection of bees. Axiom 2. Any two distinct hives have one and only one bee in common. Axiom 3. Every bee belongs to two and only two hives. Axiom 4. There are exactly four hives.

Example 4 Deduce the following theorems: Theorem 1. There are exactly six bees. Theorem 2. There are exactly three bees in each hive. Theorem 3. For each bee there is exactly one other bee not in the same hive with it.

Example 4 Hive 1: {A,B,C} Hive 2: {A,D,E} Hive 3: {B,D,F} Hive 4: {C,E,F}

Example 5: Peano’s Axiom Axiom 1: N is a set and 1 ∈ N. Axiom 2: Each element x of N has a unique successor in N denoted x’. Axiom 3: 1 is not the successor of any element of N. Axiom 4: If x' = y' then x = y. Axiom 5: If M ⊂ N satisfies both 1 ∈ M x ∈ M implies x' ∈ M then M = N.

Example 6: Euclid’s Postulates (restated) Axiom 1 (ruler): Given any two points, you can draw a straight line between them (making what's called a line segment). Axiom 2: Any line segment can be extended indefinitely. Axiom 3 (compass): A circle may be drawn with any given radius and an arbitrary center. Axiom 4: All right angles are equal to each other. Axiom 5: Through a given point, only one line can be drawn parallel to a given line. [Playfair]

EXERCISE Axiom 1. Every heart has at least one connection. Axiom 2. Every connection has exactly two hearts. Axiom 3. There exists at least one connection.

Prove the following theorems: Theorem 1 Prove the following theorems: Theorem 1. There exist at least two hearts. EXERCISE Theorem 2. The minimum number of hearts is two and minimum number of connections is one.

Prove the following theorems: EXERCISE Theorem 3. Suppose there are exactly three hearts. There are only two possibilities: there are two connections or there are three connections.

https://plato.stanford.edu/entries/philosophy-mathematics/ http://web.mnstate.edu/peil/geometry/index.htm https://plus.maths.org/content/maths-minute-euclids-axioms