Session for 2014-2015 Project NExT Fellows Mathfest, 2013 Portland, OR Presenter: Carol S. Schumacher Kenyon College.

Slides:



Advertisements
Similar presentations
Copyright © Cengage Learning. All rights reserved.
Advertisements

Identifying a research question or hypothesis
Artificial Intelligence
Boyce/DiPrima 9th ed, Ch 2.8: The Existence and Uniqueness Theorem Elementary Differential Equations and Boundary Value Problems, 9th edition, by William.
Situation Calculus for Action Descriptions We talked about STRIPS representations for actions. Another common representation is called the Situation Calculus.
Hoare’s Correctness Triplets Dijkstra’s Predicate Transformers
Deduction In addition to being able to represent facts, or real- world statements, as formulas, we want to be able to manipulate facts, e.g., derive new.
Copyright © Cengage Learning. All rights reserved.
Managing Your Tinnitus: Changing Your Thoughts and Feelings (Session 3 of 3) Version date: June 5, 2012.
MAT 3751 Analysis II Winter 2014
SEQUENCES and INFINITE SERIES
Session for Project NExT Fellows Mathfest, 2013 Portland, OR Presenter: Carol S. Schumacher Kenyon College.
Homework 7 –Average: 70Median: 75 – Homework 8 –Average: 74Median:
Project NExT Workshop Mathfest, 2010 Pittsburgh, PA What is the Definition of Definition? What is the Definition of Definition? And other mathematical.
Copyright © Cengage Learning. All rights reserved.
Logic and Set Theory.
INFINITE SEQUENCES AND SERIES
2, , and Beyond Debra S. Carney Mathematics Department University of Denver April 11, 2008 Sonya Kovalevsky Day - CCA.
INFINITE SEQUENCES AND SERIES
CIS 197 Computers in Society Professor John Peterson Philosophy Week!
Math 105: Problem Solving in Mathematics. Course Description This course introduces students to the true nature mathematics, what mathematicians really.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
APPLICATIONS OF DIFFERENTIATION 4. In Sections 2.2 and 2.4, we investigated infinite limits and vertical asymptotes.  There, we let x approach a number.
THE TRANSITION FROM ARITHMETIC TO ALGEBRA: WHAT WE KNOW AND WHAT WE DO NOT KNOW (Some ways of asking questions about this transition)‏
Non-Euclidean Geometries
Survey of Mathematical Ideas Math 100 Chapter 1 John Rosson Thursday January 18.
 Limit Cycle Isolated closed trajectories Analysis is, in general, quite difficult. For nonlinear systems, two simple results exist. Limit Cycle
Section 1.3: Predicates and Quantifiers
The Game of Algebra or The Other Side of Arithmetic The Game of Algebra or The Other Side of Arithmetic © 2007 Herbert I. Gross by Herbert I. Gross & Richard.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
What it is? Why is it a legitimate proof method? How to use it?
Methods of Proof & Proof Strategies
Jon Piperato Calculus Grades 11-12
OBJECTIVE: 1. DEFINE LIMITS INVOLVING INFINITY. 2. USE PROPERTIES OF LIMITS INVOLVING INFINITY. 3. USE THE LIMIT THEOREM. 14.5Limits Involving Infinity.
Chapter 6 Mathematical Induction
Discrete Mathematics, 1st Edition Kevin Ferland
College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson.
The importance of sequences and infinite series in calculus stems from Newton’s idea of representing functions as sums of infinite series.  For instance,
Teaching Students to Prove Theorems Session for Project NExT Fellows Presenter: Carol S. Schumacher Kenyon College and.
 Predicate: A sentence that contains a finite number of variables and becomes a statement when values are substituted for the variables. ◦ Domain: the.
LIMITS AND DERIVATIVES 2. In Sections 2.2 and 2.4, we investigated infinite limits and vertical asymptotes.  There, we let x approach a number.  The.
Methods of Proofs PREDICATE LOGIC The “Quantifiers” and are known as predicate quantifiers. " means for all and means there exists. Example 1: If we.
INTEGRALS The Fundamental Theorem of Calculus INTEGRALS In this section, we will learn about: The Fundamental Theorem of Calculus and its significance.
What we say / what they hear Culture shock in the classroom.
Number Theory Project The Interpretation of the definition Andre (JianYou) Wang Joint with JingYi Xue.
9.4 Mathematical Induction
Math 1304 Calculus I 2.4 – Definition for Limits.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
30 November 2010 English 104 – 18 & 27 CRAPS: Principles of Design for your Multimodal Report.
Activity 1-19: The Propositional Calculus
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.
English Language Services
Section 3.3: Mathematical Induction Mathematical induction is a proof technique that can be used to prove theorems of the form:  n  Z +,P(n) We have.
Method of proofs.  Consider the statements: “Humans have two eyes”  It implies the “universal quantification”  If a is a Human then a has two eyes.
Copyright © Cengage Learning. All rights reserved. Sequences and Series.
Types and Programming Languages Lecture 3 Simon Gay Department of Computing Science University of Glasgow 2006/07.
Expectation: You will: 1. Write proofs in “If, then…” form. 2. Write the negations of “all,” “every” “no” and “there exists” statements. 3/7/ :
Mathematical Induction Thinking Skill: Develop Confidence in Reason Warm Up: Find the k+1 term (P k+1 ) 1) 2)
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Analyze Conditional Statements Objectives: 1.To write a conditional statement in if-then form 2.To write the negation, converse, inverse, and contrapositive.
SEQUENCES A function whose domain is the set of all integers greater than or equal to some integer n 0 is called a sequence. Usually the initial number.
Mathematical Induction What it is? Why is it a legitimate proof method? How to use it?
What is IBL? A pedagogical strategy in which students are led to develop mathematical concepts and discover mathematical connections for themselves. In.
Direct Proof and Counterexample I: Introduction
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
Copyright © Cengage Learning. All rights reserved.
Exploratory Exercises
Copyright © Cengage Learning. All rights reserved.
Foundations of Discrete Mathematics
Presentation transcript:

Session for Project NExT Fellows Mathfest, 2013 Portland, OR Presenter: Carol S. Schumacher Kenyon College

Real Analysis or Advanced Calculus? Real Analysis is the branch of mathematics that allows us to describe limiting processes precisely. It is crucial that our students be able to make direct connections between the ideas they are studying in their real analysis course and the intuition they developed about limiting processes in their calculus courses. At the same time, it is important that the course not be simply a re-tread of calculus that appears to do no more than “cross t’s and dot i’s.”

Definition: a n  L means that for every  > 0, there exists N   such that for all n > N, d(a n, L) < . First Definitions Given any tolerance there is some fixed position beyond which a n is within that tolerance of L In beginning real analysis, we typically begin with sequence convergence.

First Definitions Definition: a n  L means that for every  > 0, there exists N   such that for all n > N, d(a n, L) < . In beginning real analysis, we typically begin with sequence convergence:

Intuition: the sequence (a n ) converges to a limit L provided that, as we go farther and farther out in the sequence, the terms of the sequence get closer and closer to L. We start where the students are Why isn’t this a definition (in the mathematical sense)?

Intuition: the sequence (a n ) converges to a limit L provided that, as we go farther and farther out in the sequence, the terms of the sequence get closer and closer to L. Intuition First

Intuition: the sequence (a n ) converges to a limit L provided that, as we go farther and farther out in the sequence, the terms of the sequence get closer and closer to L. Intuition First The key sticking points are the phrases “farther and farther out” and “closer and closer.” Any mathematically sound definition requires a rigorous understanding of what these phrases mean and how they fit together to give us the behavior that we want. It took people like Gauss and Cauchy and Riemann and Weierstrass most of a century to get a handle on this; we shouldn’t be surprised if our students don’t pick it up immediately.

Definition: a n  L means that for every  > 0, there exists N   such that for all n > N, d(a n, L) < . First Definitions Back to the mathematical definition of sequence convergence.

a n  L means that for all  > 0 there exists n  ℕ such that d(a n, L) < . a n  L means that for all  > 0 there exists N  ℕ such that for some n > N, d(a n, L) < . a n  L means that for all N  ℕ, there exists  > 0 such that for all n > N, d(a n, L) < . a n  L means that for all N  ℕ and for all  > 0, there exists n > N such that d(a n, L) < . Don’t just stand there! Do something. Students are asked to think of these as “alternatives” to the definition. Then they are challenged to come up with examples of real number sequences and limits that satisfy the “alternate” definitions but for which a n  L is false.

a n  L means that for all  > 0 there exists n  ℕ such that d(a n, L) < . a n  L means that for all  > 0 there exists N  ℕ such that for some n > N, d(a n, L) < . a n  L means that for all N  ℕ, there exists  > 0 such that for all n > N, d(a n, L) < . a n  L means that for all N  ℕ and for all  > 0, there exists n > N such that d(a n, L) < . Don’t just stand there! Do something. Students are asked to think of these as “alternatives” to the definition. Then they are challenged to come up with examples of real number sequences and limits that satisfy the “alternate” definitions but for which a n  L is false. First Activity!

Second “epsilonics” definition Your students have been thinking about sequence convergence for a while now and they are beginning to get the hang of this new way of thinking. You are ready to tackle continuity. How do you start with your students’ previous understanding of continuity (from calculus) and end up with the standard  -  definition of continuity? Second Activity!

“That’s obvious.” To a mathematician it means “this can easily be deduced from previously established facts.” Many of my students will say that something they already “know” is “obvious.” For instance, they will readily agree that it is “obvious” that the sequence 1, 0, 1, 0, 1, 0,... fails to converge. We must be sensitive to some students’ (natural) reaction that it is a waste of time to put any work into proving such a thing.

First: people don’t begin by proving deep theorems. They have to start by proving straightforward facts. Second: this is a sort of ‘test’ of the definition. It is so fundamental, that if the definition did not allow us to prove it, we would have to change the definition. I Stipulate Two Things

First: people don’t begin by proving deep theorems. They have to start by proving straightforward facts. Second: this is a sort of ‘test’ of the definition. It is so fundamental, that if the definition did not allow us to prove it, we would have to change the definition. I Stipulate Two Things Third Activity!

(a n ) converges to L if for every  > 0, there exists N   such that for all n > N, d(a n, L) < . (a n ) fails to converge provided that for all L it is not true that “for every  > 0, there exists N   such that for all n > N, d(a n, L) < .” Negating Statements

(a n ) converges to L if for every  > 0, there exists N   such that for all n > N, d(a n, L) < . (a n ) fails to converge provided that such that d(a n, L) . there exists  > 0 such that for all N   there exists n > N for all L

Thinking like an Analyst We have skills and practices that we use when we think like analysts. We hold presuppositions and assumptions that are unlikely to be shared by a student who is new to real analysis. We know where to focus of our attention and what can be safely ignored.

Thinking like an Analyst We have skills and practices that we use when we think like analysts. We hold presuppositions and assumptions that are unlikely to be shared by a student who is new to real analysis. We know where to focus of our attention and what can be safely ignored. How do we get our students to think like analysts?

Great Versatility is Required Students must be able to understand and interpret the meaning of statements involving stacked quantifiers They must be able to prove a theorem in which they establish the truth of a statement involving stacked quantifiers. Students must be able to use a hypothesis that involves stacked quantifiers. Students must be able to negate a statement involving stacked quantifiers and then prove it or use it in a theorem. And these are all different skills that have to be learned!

Great Versatility is Required Students must be able to understand and interpret the meaning of statements involving stacked quantifiers They must be able to prove a theorem in which they establish the truth of a statement involving stacked quantifiers. Students must be able to use a hypothesis that involves stacked quantifiers. Students must be able to negate a statement involving stacked quantifiers and then prove it or use it in a theorem. And these are all different skills that have to be learned! Note: statements that begin with “there exists  > 0 such that for all...” are handled differently than statements that start with “for all  > 0, there exists...”

Great Versatility is Required Students must be able to understand and interpret the meaning of statements involving stacked quantifiers They must be able to prove a theorem in which they establish the truth of a statement involving stacked quantifiers. Students must be able to use a hypothesis that involves stacked quantifiers. Students must be able to negate a statement involving stacked quantifier and then prove it or use it in a theorem. And these are all different skills that have to be learned! I am not suggesting that we categorize all these things for our students, but if we aren’t aware of the differences, we can’t foresee the myriad ways in which our students can get in trouble.

Some standard problems Fourth Activity!

“Epsilonics” “Organizing principle” for final proof Spare and stylized if for every  > 0, there exists  > 0 such that if, then. = Kabuki dance

if for every  > 0, there exists  > 0 such that if, then. o Existence theorems  Start the proof by thinking about what you want to prove rather than what you are assuming.  You rig the game so you are guaranteed to win. o The desired conclusion is the “organizing principle” for the write-up. “Epsilonics”--- Some general principles “Organizing principle” for proof Proofs are written backwards!

“Epsilonics” proofs General rules of thumb To get started, calculate the quantity that you want to make “small.” Must find a relationship between it and the quantity (or quantities) that you know to be “small.”

“Epsilonics” proofs General rules of thumb To get started, calculate the quantity that you want to make “small.” Must find a relationship between it and the quantity (or quantities) that you know to be “small.” “The sum of small things is small”---the triangle inequality. “The product of something small and something bounded is small” The “multi-task” delta.

“Epsilonics” proofs General rules of thumb To get started, calculate the quantity that you want to make “small.” Must find a relationship between it and the quantity (or quantities) that you know to be “small.”

f fails to be uniformly continuous provided that f is uniformly continuous if For all  > 0, there exists  > 0 such that if d(x,y) < , then d(f (x), f (y)) < . For all x, y such that d(x,y) <  and d(f (x), f (y)) . there exists  > 0such that for all  > 0 there exist x, y

Activity 5: You are teaching a real analysis class and have just defined continuity. Your students have been assigned the following Problem: K is a fixed real number, x is a fixed element of the metric space X and f : X   is a continuous function. Prove that if f (x) > K, then there exists an open ball about x such that f maps every element of the open ball to some number greater than K. One of your students comes into your office saying that he has “tried everything” but cannot make any headway on this problem. When you ask him what exactly he has tried, he simply reiterates that he has tried “everything.” What is happening? What do you do?