Exploratory Exercises

Slides:



Advertisements
Similar presentations
Geometry 2.2 Big Idea: Analyze Conditional Statements
Advertisements

Chapter 3 Elementary Number Theory and Methods of Proof.
1 In this lecture  Number Theory ● Rational numbers ● Divisibility  Proofs ● Direct proofs (cont.) ● Common mistakes in proofs ● Disproof by counterexample.
Conditional Statements Geometry Chapter 2, Section 1.
Session for Project NExT Fellows Mathfest, 2013 Portland, OR Presenter: Carol S. Schumacher Kenyon College.
3.3 Divisibility Definition If n and d are integers, then n is divisible by d if, and only if, n = dk for some integer k. d | n  There exists an integer.
Elementary Number Theory and Methods of Proof
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.
CSE115/ENGR160 Discrete Mathematics 02/07/12
TR1413: INTRO TO DISCRETE MATHEMATICS LECTURE 2: MATHEMATICAL INDUCTION.
Copyright © Zeph Grunschlag,
1 Set Theory. Notation S={a, b, c} refers to the set whose elements are a, b and c. a  S means “a is an element of set S”. d  S means “d is not an element.
EXAMPLE 5 Rewrite a conditional statement in if-then form
Find opposites of numbers EXAMPLE 4 a. If a = – 2.5, then – a = – ( – 2.5 ) = 2.5. b. If a =, then – a = –
Chapter 4: Elementary Number Theory and Methods of Proof 4.2 Direct Proof and Counter Example II: Rational Numbers 1 Such, then, is the whole art of convincing.
Session for Project NExT Fellows Mathfest, 2013 Portland, OR Presenter: Carol S. Schumacher Kenyon College.
Chapter 6 Mathematical Induction
Teaching Students to Prove Theorems Session for Project NExT Fellows Presenter: Carol S. Schumacher Kenyon College and.
Copyright © Cengage Learning. All rights reserved. CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF ELEMENTARY NUMBER THEORY AND METHODS OF PROOF.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
CHAPTER 1: Points, Lines, Planes, and Angles
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
Thinking Mathematically Problem Solving and Critical Thinking.
Methods of Proof Dr. Yasir Ali. Proof A (logical) proof of a statement is a finite sequence of statements (called the steps of the proof) leading from.
4.1 Proofs and Counterexamples. Even Odd Numbers Find a property that describes each of the following sets E={…, -4, -2, 0, 2, 4, 6, …} O={…, -3, -1,
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 10/7/2008.
Conditional Statements Geometry Chapter 2, Section 1.
Section 2-2: Biconditionals and Definitions. Conditional: If two angles have the same measure, then the angles are congruent. Converse: If two angles.
– Phillip J. Davis and Reuben Hersh
2-6 Proving Angles Congruent. Theorem: a conjecture or statement that you prove true.
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.
Functions (Mappings). Definitions A function (or mapping)  from a set A to a set B is a rule that assigns to each element a of A exactly one element.
Sum of Arithmetic Sequences. Definitions Sequence Series.
Direct Proof and Counterexample I Lecture 11 Section 3.1 Fri, Jan 28, 2005.
Expectation: You will: 1. Write proofs in “If, then…” form. 2. Write the negations of “all,” “every” “no” and “there exists” statements. 3/7/ :
5-5 Indirect Proof. Indirect Reasoning: all possibilities are considered and then all but one are proved false. The remaining possibility must be true.
1 Formal Proofs. 2 Deductive Proofs From the given statement(s) to a conclusion statement (what we want to prove) Logical progression by direct implications.
Introduction to Proofs. The use of Reasoning and Logic in proofs Inductive Reasoning- “reasoning from detailed facts to general principles” – Specific.
Do Now Look at each pattern or conjecture and determine whether each conjecture is valid. 1.2, 6, 14, 30, 62, 126 Conjecture: Each element is two more.
Section 2.5. Cardinality Definition: A set that is either finite or has the same cardinality as the set of positive integers (Z + ) is called countable.
EXAMPLE 3 Write an indirect proof Write an indirect proof that an odd number is not divisible by 4. GIVEN : x is an odd number. PROVE : x is not divisible.
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.
2.2 Definitions and Biconditional Statements GOAL 1 Recognize and use definitionsGOAL 2 Recognize and use biconditional statements. What you should learn.
Holt McDougal Geometry 2-1 Using Inductive Reasoning to Make Conjectures 2-1 Using Inductive Reasoning to Make Conjectures Holt Geometry Warm Up Warm Up.
Chapter 5 1. Chapter Summary  Mathematical Induction  Strong Induction  Recursive Definitions  Structural Induction  Recursive Algorithms.
1-1 Copyright © 2013, 2005, 2001 Pearson Education, Inc. Section 2.4, Slide 1 Chapter 2 Sets and Functions.
11.7 – Proof by Mathematical Induction
Conditional Statements
Chapter 3 The Real Numbers.
CST 24 – Logic.
Introduction to Real Analysis
Proving Statements About Angles
2-1 Conditional Statements
Set includes rational numbers and irrational numbers.
Chapter 8.2 Geometric Series Wednesday, December 05, 2018
Propositional Logic.
Warmup State whether each sentence is true or false.
Copyright © Cengage Learning. All rights reserved.
Topic Past Papers –Proofs
Wednesday, April 10, 2019.
Sullivan Algebra and Trigonometry: Section 13.4
Copyright © Cengage Learning. All rights reserved.
Advanced Analysis of Algorithms
Using Inductive Reasoning to Make Conjectures 2-1
2-1 Inductive Reasoning and Conjecture
Conditional Statements
Presentation transcript:

Exploratory Exercises Suppose that f : A B and g: B C are functions. For each of the following statements decide whether the statement is true (if so, give a proof) or false (if so, give a counterexample). In the cases where the statement is false, decide what additional hypothesis will make the conclusion hold: If g f is one-to-one, then f is one-to-one. If g f is one-to-one, then g is one-to-one. If g f is onto, then f is onto. If g f is onto, then g is onto.

Making sense of a new definition an  L means that   > 0  n   d(an , L) < . an  L means that   > 0  N   for some n > N, d(an , L) <  . an  L means that  N  ,   > 0   n > N, d(an , L) <  . an  L means that  N   and   > 0  n > N  d(an , 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 an  L is false. I usually have the students work on this exercise in class, perhaps with a partner.

Intuition and Abstraction Let X be a metric space, and let A be a subset of X. Suppose that there exist elements a and b of A such that d(a,b) = diam(A). Prove by giving a counterexample that A need not be closed. Prove by giving a counterexample that a and be need not lie on the boundary of A. Prove that if X = n, then a and b must lie on the boundary of A.