Teaching Students to Prove Theorems Session for 2007-2008 Project NExT Fellows Presenter: Carol S. Schumacher Kenyon College and.

Slides:



Advertisements
Similar presentations
The ‘Big A’ Peer Support Pack Using the Resource
Advertisements

Lecture 3 – February 17, 2003.
P.M van Hiele Mathematics Learning Theorist Rebecca Bonk Math 610 Fall 2009.
Introduction The concept of transform appears often in the literature of image processing and data compression. Indeed a suitable discrete representation.
Chapter 3 Direct Proof and Proof by Contrapositive
Lecture 7 Surreal Numbers. Lecture 7 Surreal Numbers.
6.1 Vector Spaces-Basic Properties. Euclidean n-space Just like we have ordered pairs (n=2), and ordered triples (n=3), we also have ordered n-tuples.
Discrete Mathematics I Lectures Chapter 6
Sets Lecture 11: Oct 24 AB C. This Lecture We will first introduce some basic set theory before we do counting. Basic Definitions Operations on Sets Set.
Instructor: Hayk Melikya
Examples of life goals: 1.Live on my own or with a family of my own. If I have this, I can use my non-working time how I see fit. FREE TIME! 2.Keep a job.
Session for Project NExT Fellows Mathfest, 2013 Portland, OR Presenter: Carol S. Schumacher Kenyon College.
Project NExT Workshop Mathfest, 2010 Pittsburgh, PA What is the Definition of Definition? What is the Definition of Definition? And other mathematical.
Elementary Linear Algebra Anton & Rorres, 9th Edition
1 Introduction to Computability Theory Lecture12: Reductions Prof. Amos Israeli.
          . Geoff Birky, Jim Fey, Tim Fukawa-Connelly, Kadian Howell, and Carolina Napp-Avelli University of Maryland Abstract Algebra for.
Vector Spaces (10/27/04) The spaces R n which we have been studying are examples of mathematical objects which have addition and scalar multiplication.
Discrete Mathematics Lecture 4 Harper Langston New York University.
INFINITE SEQUENCES AND SERIES
Chapter Two: Vector Spaces I.Definition of Vector Space II.Linear Independence III.Basis and Dimension Topic: Fields Topic: Crystals Topic: Voting Paradoxes.
1 Foundations of Interval Computation Trong Wu Phone: Department of Computer Science Southern Illinois University Edwardsville.
Mathematics1 Mathematics 1 Applied Informatics Štefan BEREŽNÝ.
T he Separability Problem and its Variants in Quantum Entanglement Theory Nathaniel Johnston Institute for Quantum Computing University of Waterloo.
Lecture II.  Using the example from Birenens Chapter 1: Assume we are interested in the game Texas lotto (similar to Florida lotto).  In this game,
Set Theory A B C.
Linear Algebra Chapter 4 Vector Spaces.
Session for Project NExT Fellows Mathfest, 2013 Portland, OR Presenter: Carol S. Schumacher Kenyon College.
Reading and Writing Mathematical Proofs
The importance of sequences and infinite series in calculus stems from Newton’s idea of representing functions as sums of infinite series.  For instance,
Elementary School Science: Emphasizing the Basics Presented by Frank H. Osborne, Ph. D. © 2015 EMSE 3123 Math and Science in Elem. Ed.
Copyright © Cengage Learning. All rights reserved. CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF ELEMENTARY NUMBER THEORY AND METHODS OF PROOF.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
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.
Chapter 3 Vector Spaces. The operations of addition and scalar multiplication are used in many contexts in mathematics. Regardless of the context, however,
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.
Copyright © Cengage Learning. All rights reserved.
Week 6 - Friday.  What did we talk about last time?  Solving recurrence relations.
Great Theoretical Ideas in Computer Science.
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.
{ What is a Number? Philosophy of Mathematics.  In philosophy and maths we like our definitions to give necessary and sufficient conditions.  This means.
Quantum Two 1. 2 Angular Momentum and Rotations 3.
Types and Programming Languages Lecture 3 Simon Gay Department of Computing Science University of Glasgow 2006/07.
© 2015 albert-learning.com How to talk to your boss How to talk to your boss!!
Direct Proof and Counterexample I Lecture 11 Section 3.1 Fri, Jan 28, 2005.
4 4.1 © 2016 Pearson Education, Ltd. Vector Spaces VECTOR SPACES AND SUBSPACES.
Summary of the Last Lecture This is our second lecture. In our first lecture, we discussed The vector spaces briefly and proved some basic inequalities.
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.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
Math 307 Spring, 2003 Hentzel Time: 1:10-2:00 MWF Room: 1324 Howe Hall Instructor: Irvin Roy Hentzel Office 432 Carver Phone
Week 8 - Monday.  What did we talk about last time?  Properties of functions  One-to-one  Onto  Inverses  Cardinality.
Week 8 - Wednesday.  What did we talk about last time?  Relations  Properties of relations  Reflexive  Symmetric  Transitive.
Primbs, MS&E345 1 Measure Theory in a Lecture. Primbs, MS&E345 2 Perspective  -Algebras Measurable Functions Measure and Integration Radon-Nikodym Theorem.
Sporadic and Related groups Lecture 15 Introduction to Fusion.
What is IBL? A pedagogical strategy in which students are led to develop mathematical concepts and discover mathematical connections for themselves. In.
Chapter 2 Sets and Functions.
Chapter 3 The Real Numbers.
VECTOR SPACES AND SUBSPACES
Section 4.1: Vector Spaces and Subspaces
Section 4.1: Vector Spaces and Subspaces
Quantum One.
VECTOR SPACES AND SUBSPACES
Exploratory Exercises
Linear Algebra Chapter 4 Vector Spaces.
Applied Discrete Mathematics Week 9: Integer Properties
Carol Putting in her 2¢ Worth
Linear Algebra Lecture 20.
ABASAHEB KAKADE ARTS COLLEGE BODHEGAON
          .
VECTOR SPACES AND SUBSPACES
Presentation transcript:

Teaching Students to Prove Theorems Session for Project NExT Fellows Presenter: Carol S. Schumacher Kenyon College and The Legacy of R. L. Moore Project Mathfest, 2007 San Jose, CA

Some Things I Learned the Hard Way

“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, if I give them the field axioms, and then ask them to prove that they are very likely to wonder why I am asking them to prove this, since it is “obvious.”

What is a definition? To a mathematician, it is the tool that is used to make an intuitive idea subject to rigorous analysis. To anyone else in the world, including most of your students, it is a phrase or sentence that is used to help understand what a word means.

For every  >0, there exists a  >0 such that if... ? ??

What does it mean to say that two partially ordered sets are order isomorphic? The student’s first instinct is not going to be to say that there exists a function between them that preserves order!

As if this were not bad enough we mathematicians sometimes do some very weird things with definitions. Definition: Let  be a collection of non-empty sets. We say that the elements of  are pairwise disjoint if given A, B in , either A  B=  or A = B. WHY NOT.... ??? Definition: Let  be a collection of non-empty sets. We say that the elements of  are pairwise disjoint if given any two distinct elements A, B in , A  B= .

Great Versatility is Required We have to be able to take an intuitive statement and write it in precise mathematical terms. Conversely, we have to be able to take a (sometimes abstruse) mathematical statement and “reconstruct” the intuitive idea that it is trying to capture. We have to be able to take a definition and see how it applies to an example or the hypothesis of a theorem we are trying to prove. We have to be able to take an abstract definition and use it to construct concrete examples. And these are different skills that have to be learned.

Cultural Elements We have skills and practices that make it easier to function in our mathematical culture. We hold presuppositions and assumptions that may not be shared by someone new to mathematical culture. We know where to focus of our attention and what can be safely ignored.

What?... Where?

It is not what I do, but what happens to them that is important. Whenever possible, I substitute something that the students do for something that I do. Total Immersion

Small scale stuff to enhance lectures. Activities that help students become familiar with a with a new definition. Students work on proving theorems in small groups while you circulate around the classroom helping out. Have students present results of their work to each other. Projects and Activities instead of lectures. GAP projects in abstract algebra: conjugating permutations. (Google: Judy Holdener Gap) There are many ways to do this

Sorting out the Issues Equivalence Relations Partitions Equivalence Relations We want our students to understand the duality between partitions and equivalence relations. We may want them to prove, say, that every equivalence relation naturally leads to a partitioning of the set, and vice versa.

Relation on A Collection of subsets of A. The usual practice is to define an equivalence relation first and only then to talk about partitions. Furthermore, there is a lot going on. Many students are overwhelmed. They don’t know how to focus their attention on one piece at a time. Are we directing our students’ attention in the wrong direction?

a n  L means that   > 0  n    d(a n, L) < . a n  L means that   > 0  N    for some n > N, d(a n, L) < . a n  L means that  N  ,   > 0   n > N, d(a n, L) < . a n  L means that  N   and   > 0  n > N  d(a n, L) < . Students are asked to think of these as “alternatives” to the definition of sequence convergence. 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. I usually have the students work on this exercise in class, perhaps with a partner.

Scenario 1: You are teaching a real analysis class and have just defined continuity. Your students have been assigned the following problem: Problem: K is a fixed real number, x is a fixed element of the metric space X and f: X  R 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 do you do?

Scenario 2: You have just defined subspace (of a vector space) in your linear algebra class: The obvious thing to do is to try to see what the definition means in  2 and  3. You could show your students, but you would rather let them play with the definition and discover the ideas themselves. Design a class activity that will help the students classify the linear subspaces of 2 and 3 dimensional Euclidean space. (You might think about "separating out the distinct issues.”) Definition: Let V be a vector space. A subset S of V is called a subspace of V if S is closed under vector addition and scalar multiplication.

... closure under scalar multiplication and closure under vector addition...

Scenario 3: Your students are studying some basic set theory. They have already proved De Morgan's laws for two sets. (And they really didn't have too much trouble with them.) You now want to generalize the proof to an arbitrary collection of sets. That is..... The argument is the same, but your students are really having trouble. What's at the root of the problem? What should you do?

Scenario 4: A very good student walks into your office. She has been asked to prove that the function is one to one on the interval (-1,  ). She says that she has tried, but can't do the problem. This baffles you because you know that just the other day she gave a lovely presentation in class showing that the composition of two one-to-one functions is one-to-one. What is going on? What should you do?

Scenario 5: Your students are studying partially ordered sets. You have just introduced the following definitions: Definitions: Let (A,  ) be a partially ordered set. Let x be an element of A. We say that x is a maximal element of A if there is no y in A such that y  x. We say that x is the greatest element of A if x  y for all y in A. Anecdotal evidence suggests that about 71.8% of students think these definitions say the same thing. (Why do you think this is?) Design a class activity that will help the students differentiate between the two concepts. While you are at it, build in a way for them to see why we use “a” when defining maximal elements and “the” when defining greatest elements.