Mathematical thinking

Slides:



Advertisements
Similar presentations
Nature and Construction of Knowledge in Mathematics
Advertisements

Gödel’s Incompletness Theorem By Njegos Nincic. Overview  Set theory: Background, History Naïve Set Theory  Axiomatic Set Theory  Icompleteness Theorem.
Limitations. Limitations of Computation Hardware precision Hardware precision Software - we’re human Software - we’re human Problems Problems –complex.
Conditional Statements Geometry Chapter 2, Section 1.
David Evans CS655: Programming Languages University of Virginia Computer Science Lecture 19: Minding Ps & Qs: Axiomatic.
CS1001 Lecture 22. Overview Mechanizing Reasoning Mechanizing Reasoning G ö del ’ s Incompleteness Theorem G ö del ’ s Incompleteness Theorem.
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.
CSRU 1100 Logic. Logic is concerned with determining: Is it True? Is it False?
So far we have learned about:
Today’s Topics Using CP and RAA Things to watch for, things to avoid Strategic hints for using CP and RAA A Little Metalogic and some History of Logic.
Computability Thank you for staying close to me!! Learning and thinking More algorithms... computability.
Introduction to Computer Science. A Quick Puzzle Well-Formed Formula  any formula that is structurally correct  may be meaningless Axiom  A statement.
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
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
Class 36: Proofs about Unprovability David Evans University of Virginia cs1120.
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?
CSCI 2110 Discrete Mathematics Tutorial 10 Chin 1.
‘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.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
David Evans CS200: Computer Science University of Virginia Computer Science Class 24: Gödel’s Theorem.
Discrete Mathematics, Part II CSE 2353 Fall 2007 Margaret H. Dunham Department of Computer Science and Engineering Southern Methodist University Some slides.
MATH 224 – Discrete Mathematics
About Math and related topics About Math 1. The Unreasonable Effectiveness The Unreasonable Effectiveness of Mathematics in the Natural Sciences by Eugene.
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.
1 CO Games Development 2 Week 21 Turing Machines & Computability Gareth Bellaby.
Methods of Proof Lecture 3: Sep 9. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical.
Hilbert’s Progamme Early in C20, the mathematician Hilbert led a programme to formalise maths; to reduce it to a clear set of axioms and show that all.
First Order Logic Lecture 2: Sep 9. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about.
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.
Lecture 18. Unsolvability Before the 1930’s, mathematics was not like today. Then people believed that “everything true must be provable”. (More formally,
Course Overview and Road Map Computability and Logic.
TOK: Mathematics Unit 1 Day 1. Introduction Opening Question Is math discovered or is it invented? Think about it. Think real hard. Then discuss.
Mathematics. From last week Mathematics can be defined as ‘the science of rigorous proof” begins with axioms and used deductive reason to derive theorems.
Activity 1-19: The Propositional Calculus
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
Great Theoretical Ideas in Computer Science.
Godel’s proof Danny Brown. Outline of godel’s proof 1.Create a statement that says of itself that it is not provable 2.Show that this statement is provable.
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.
Thinking in Methodologies Class Notes. Gödel’s Theorem.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
Russell’s Paradox and the Halting Problem Lecture 24 Section 5.4 Wed, Feb 23, 2005.
Incompleteness. System Relativity Soundness and completeness are properties of particular logical systems. There’s no sense to be made of the claim that.
Computation Motivating questions: What does “computation” mean? What are the similarities and differences between computation in computers and in natural.
“If John studies then he will get an A.” s a s a F F T F T T T T T T F F.
CSE 311: Foundations of Computing Fall 2013 Lecture 26: Pattern matching, cardinality.
Lesson Objective Understand what maths is Understand some of the common notation attached to mathematics.
CSE 311: Foundations of Computing Fall 2014 Lecture 27: Cardinality.
 Founded in 1884 by Gottlob Frege and Richard Dedekind  Math can be reduced to 9 simple logical axioms  2 axioms are not logical  Axiom of infinity.
Multiple Choice Test Tips PowerPoint® by Mr. Brown – Info Source:
Conjectures/Justification Session 5. Outcomes for Conjectures/Justifications When you want the students to take informal knowledge and make it formal.
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.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–10: Soundness of Propositional Calculus 12 th August, 2010.
MA/CSSE 474 Theory of Computation Universal Turing Machine Church-Turing Thesis (Winter 2016, these slides were also used for Day 33)
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.
Theory of Computation. Introduction We study this course in order to answer the following questions: What are the fundamental capabilities and limitations.
What is Mathematics? The science (or art?) that deals with numbers, quantities, shapes, patterns and measurement An abstract symbolic communication system.
The subject of language, logic and proofs…
Discrete Mathematics for Computer Science
Great Theoretical Ideas in Computer Science
Mathematics and Knowledge
Lecture 22: Gödel’s Theorem CS200: Computer Science
Class 24: Computability Halting Problems Hockey Team Logo
Topic Past Papers –Proofs
Philosophy of Mathematics: a sneak peek
Chapter 2 Sets Active Learning Lecture Slides
CO Games Development 2 Week 21 Turing Machines & Computability
Lecture 23: Computability CS200: Computer Science
Presentation transcript:

Mathematical thinking A guest lecture by Mr. Chase

Is mathematics invented or discovered? Aristotle Plato

Is mathematics invented or discovered? Options: Invented Discovered Unresolvable I don’t know Poll!

𝑥 long division 𝑎+𝑏 ℝ ∫𝑓 𝑥 𝑑𝑥 𝑓(𝑥) conventions and symbols 𝑚 “Newton and Leibniz invented Calculus.” ℝ 𝑥 conventions and symbols log 2 64 invented! 𝑓(𝑥) our number system And if you think mathematics is discovered: if a mathematical theory goes undiscovered, does it truly exist? 𝑎+𝑏 long division

𝑥 air-tight logic 𝑎+𝑏 ℝ arbitrary notation ∫𝑓 𝑥 𝑑𝑥 no contradictions 𝑚 Is 2 67 −1 prime or composite? 𝑥 Are there an infinite number of “twin primes”? ∫𝑓 𝑥 𝑑𝑥 𝑚 discovered! no contradictions math is like science—it’s true, regardless of whether we discover it or not. 𝑎+𝑏 air-tight logic

Correct answer… discovered!

Is this always true? Aren’t you dying for a proof? Is 9 𝑛 −1 always divisible by 8? There exist two people in DC with the exact same number of hairs on their heads. Why?

“ ” Mathematics is a queen of science. Carl Friedrich Gauss

“ ” what mathematicians have to say… Wherever there is number, there is beauty. Proclus It is impossible to be a mathematician without being a poet in soul. Sofia Kovalevskaya ” The mathematician does not study pure mathematics because it is useful; he studies it because he delights in it and he delights in it because it is beautiful. Jules Henri Poincaré

𝑥 FORMALISM the symbols and conventions we choose are arbitrary. what mathematics are we free to invent? the symbols and conventions we choose are arbitrary. FORMALISM Mathematics is a game played according to certain simple rules with meaningless marks on paper. David Hilbert

See handout for some proofs based on these axioms the field axioms. Closure of 𝑭 under addition and multiplication For all a, b in F, both 𝑎+𝑏 and 𝑎 ·𝑏 are in 𝐹 (or more formally, + and − are binary operations on 𝐹). Associativity of addition and multiplication For all 𝑎, 𝑏, and 𝑐 in 𝐹, the following equalities hold: 𝑎+(𝑏+𝑐)=(𝑎+𝑏)+𝑐 and 𝑎·(𝑏·𝑐)=(𝑎·𝑏)𝑐. Commutativity of addition and multiplication For all 𝑎 and 𝑏 in 𝐹, the following equalities hold: 𝑎+𝑏=𝑏+𝑎 and 𝑎·𝑏=𝑏·𝑎. Existence of additive and multiplicative identity elements There exists an element of 𝐹, called the additive identity element and denoted by 0, such that for all 𝑎 in 𝐹, 𝑎+0=𝑎. Likewise, there is an element, called the multiplicative identity element and denoted by 1, such that for all 𝑎 in 𝐹, 𝑎·1=𝑎. To exclude the trivial ring, the additive identity and the multiplicative identity are required to be distinct. Existence of additive inverses and multiplicative inverses For every 𝑎 in 𝐹, there exists an element −𝑎 in 𝐹, such that 𝑎+(−𝑎)=0. Similarly, for any 𝑎 in 𝐹 other than 0, there exists an element 𝑎 −1 in 𝐹, such that 𝑎· 𝑎 −1 =1. (The elements 𝑎+(−𝑏) and 𝑎· 𝑏 −1 are also denoted 𝑎−𝑏 and 𝑎/𝑏, respectively.) In other words, subtraction and division operations exist. Distributivity of multiplication over addition For all 𝑎, 𝑏 and 𝑐 in 𝐹, the following equality holds: 𝑎·(𝑏+𝑐)=(𝑎·𝑏)+(𝑎·𝑐). See handout for some proofs based on these axioms

YES. Can we break or change the rules? domain group ring skew field Abelian group

You can’t prove the thing! Epic math battles You can’t prove the thing! In every formal system, there must be unprovable statements. Prove the thing! I want to create a formal system in which we can prove all statements. David Hilbert Kurt Gödel

Silly example Axioms: it is raining outside. if it is raining, I will take an umbrella. Statements: I will take an umbrella. It is not raining outside. I will take my pet hamster as well. Provably true. Provably false. Undecidable

It’s like a gorgeous painting that also functions as a dishwasher! Math is useful It’s like a gorgeous painting that also functions as a dishwasher! Ben Orlin But…WHY is it useful?

Why study math? Liberal Education Glimpsing the mind of God

In summary… Math is different. It allows certain knowledge.

Questions?