Revision lecture MA30041: Metric Spaces. Just to become familiar with the clicker: What day of the week is today? 1.Sunday 2.Monday 3.Tuesday 4.Wednesday.

Slides:



Advertisements
Similar presentations
Complex Analysis Exercise sheet 7 (Avoiding mistakes in Questions 1 & 2)
Advertisements

The proof is quite similar to that of a previous result: a compact subspace of a Hausdorff is closed. Theorem: If topological X  space is compact and.
PARADOXES IN MATHEMATICS
(CSC 102) Discrete Structures Lecture 14.
Week 7 - Wednesday.  What did we talk about last time?  Set proofs and disproofs  Russell’s paradox.
Lecture 6 Hyperreal Numbers (Nonstandard Analysis)
Programming Language Semantics Denotational Semantics Chapter 5 Based on a lecture by Martin Abadi.
LIMITS 2. LIMITS 2.4 The Precise Definition of a Limit In this section, we will: Define a limit precisely.
Saturday May 02 PST 4 PM. Saturday May 02 PST 10:00 PM.
Programming Language Semantics Denotational Semantics Chapter 5 Part III Based on a lecture by Martin Abadi.
Week 8 - Wednesday.  What did we talk about last time?  Cardinality  Countability  Relations.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Functions A B f( ) =. This Lecture We will define a function formally, and then in the next lecture we will use this concept in counting. We will also.
Preperiodic Points and Unlikely Intersections joint work with Laura DeMarco Matthew Baker Georgia Institute of Technology AMS Southeastern Section Meeting.
Baire Spaces and the Wijsman Topology Jiling Cao Auckland University of Technology New Zealand This is joint work with Artur H. Tomita São Paulo University,
Department of Mathematics
T. Mhamdi, O. Hasan and S. Tahar, HVG, Concordia University Montreal, Canada July 2010 On the Formalization of the Lebesgue Integration Theory in HOL On.
Section 1 A sequence(of real numbers) is  a list of infinitely many real numbers arranged in such a manner that it has a beginning but no end such as:
1 Reproducing Kernel Exponential Manifold: Estimation and Geometry Kenji Fukumizu Institute of Statistical Mathematics, ROIS Graduate University of Advanced.
Discrete Mathematics, 1st Edition Kevin Ferland
MATH 224 – Discrete Mathematics
Network Systems Lab. Korea Advanced Institute of Science and Technology No.1 Appendix A. Mathematical Background EE692 Parallel and Distribution Computation.
General (point-set) topology Jundong Liu Ohio Univ.
استاد : دکتر گلبابایی In detail this means three conditions:  1. f has to be defined at c.  2. the limit on the left hand side of that equation has.
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.
1 Lecture 3 (part 3) Functions – Cardinality Reading: Epp Chp 7.6.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Discrete Math for CS Binary Relation: A binary relation between sets A and B is a subset of the Cartesian Product A x B. If A = B we say that the relation.
Chapter 2 Mathematical preliminaries 2.1 Set, Relation and Functions 2.2 Proof Methods 2.3 Logarithms 2.4 Floor and Ceiling Functions 2.5 Factorial and.
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.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
K. Shum Lecture 14 Continuous sample space, Special case of the law of large numbers, and Probability density function.
Copyright © 2005 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 5 Integration.
Week 11 - Monday.  What did we talk about last time?  Binomial theorem and Pascal's triangle  Conditional probability  Bayes’ theorem.
DE Weak Form Linear System
MA5241 Lecture 1 TO BE COMPLETED
MA4266 Topology Wayne Lawton Department of Mathematics S ,
COMPSCI 102 Introduction to Discrete Mathematics.
Week 6 - Friday.  What did we talk about last time?  Solving recurrence relations.
March 24, 2006 Fixed Point Theory in Fréchet Space D. P. Dwiggins Systems Support Office of Admissions Department of Mathematical Sciences Analysis Seminar.
Copyright © Cengage Learning. All rights reserved.
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.
CompSci 102 Discrete Math for Computer Science March 1, 2012 Prof. Rodger Slides modified from Rosen.
Rules of the game  You will work with your Unit 3 group  We will have 4 rounds of 6 questions each. Most are multiple choice; some are fill in the blank.
Discrete Structures Li Tak Sing ( 李德成 ) Lectures
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/27/2009.
Basic Structures: Sets, Functions, Sequences, and Sums.
Mathematical Induction Section 5.1. Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If.
Mathematical Induction
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
Let X be a metric space. A subset M of X is said to be  Rare(Nowhere Dense) in X if its closure M has no interior points,  Meager(of First Category)
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.
Week 7 - Wednesday.  What did we talk about last time?  Proving the subset relationship  Proving set equality  Set counterexamples  Laws of set algebra.
Introduction to Predicates and Quantified Statements I Lecture 9 Section 2.1 Wed, Jan 31, 2007.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Sums of Random Variables and Long-Term Averages Sums of R.V. ‘s S n = X 1 + X X n of course.
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.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Discrete Mathematics CS 2610
Department of Mathematics
Chapter 3 The Real Numbers.
Continuity of Darboux functions Nikita Shekutkovski, Beti Andonovic
Introduction to Real Analysis
Compactness in Metric space
Complex Variables. Complex Variables Open Disks or Neighborhoods Definition. The set of all points z which satisfy the inequality |z – z0|
Chapter 3 The Real Numbers.
Exploratory Exercises
Chapter 5 Limits and Continuity.
Presentation transcript:

Revision lecture MA30041: Metric Spaces

Just to become familiar with the clicker: What day of the week is today? 1.Sunday 2.Monday 3.Tuesday 4.Wednesday 5.Thursday 6.Friday 7.Saturday

Just to become familiar with the clicker: The concept “Metric Space” was introduced by whom? 1.G. Cantor (1872) 2.M.R. Fréchet (1906) 3.F. Hausdorff (1914) 4.S. Banach (1922) 5.I have to phone a friend!

Just to become familiar with the clicker: Have you used the Audience Response Systems (ARS) previously? 1.Yes 2.No

The function dist(Y,Z)=inf{d(y,z)|y in Y, z in Z} for nonempty subsets Y,Z of a metric space (X,d) (where dist(Y,Z)=∞ otherwise), defines a metric. 1.True 2.False

A pseudometric differs from a metric by 1.(MS1): A pseudometric might not be nonnegative 2.(MS2): A pseudometric might not be 0 iff x=y 3.(MS3): A pseudometric might not be symmetric 4.(MS4): Only a modified form weak form of the triangle inequality has to hold.

Let A be a subset of a metric space (X,d). What is the relationship between diam(int A), diam(A) and diam(cl A)? 1.diam(int A)≤diam(A)= diam(cl A) 2.diam(cl A)≤diam(A)≤ diam(int A) 3.diam(int A)=diam(A)= diam(cl A)

Let (X,d) be a metric space and (x n ) be a sequence in X. Set A={x n |n in N}. Is the following statement true or false: If (x n ) is Cauchy, then the subspace A is totally bounded. 1.True 2.False

Let (X,d) be a metric space and (x n ) be a sequence in X. Set A={x n |n in N}. Is the following statement true or false: If (x n ) converges to x, then the union of A and {x} is a compact set. 1.True 2.False

Let A be a subset of a metric space (X,d) s.t. ∂A=Ø. What can you say about A? 1.A=A’ 2.A has empty interior. 3.A is clopen.

Is the limit of a converging sequence (x n ) a limit point of the set {x n |n in N}? 1.Yes, the limit is a limit point. 2.Only if the sequence is not eventually constant. 3.Yes, if the set is infinite.

What is the derived set of 1.The empty set. 2.{0} 3.. {1/n} 4.It equals its derived set.

Let U,V be subsets of a metric space (X,d). If ∂U is a subset of V, and V is a subset of U, then 1.∂V is a subset of ∂U 2.∂U is a subset of ∂V 3.no general statement about the relationship between ∂U and ∂V is possible

“Quick and dirty” solution: We have ∂U=cl U ∩ cl U c = cl U ∩ cl U c ∩ cl U c =∂U ∩ cl U c. But ∂U is a subset of V and thus cl V, U c is a subset of V c, thus cl U c is a subset of cl V c ; therefore ∂U is a subset of cl V ∩ cl V c = ∂V.

The open subsets of the subspace Rx{0} of R 2 with the Euclidean metric are precisely those subsets Ux{0} where U is open in R. Thus, except the empty set, 1.none of these subsets Ux{0} is also open in R 2 2.all of these subsets Ux{0} is also open in R 2

??? interval of R is a continuous image of R itself. What can you replace ??? with? 1.Every open 2.Every closed 3.Every closed and bounded 4.Every bounded 5.Every

Some hints… sin(R) = [-1,1] arctan(R)=(-π/2,π/2) f(x) = sin(x) if x≤0 and f(x)=arctan(x) of x>0 is continuous (or f(x)=x if …)!

Is a continuous function on a complete metric space in general bounded? 1.Yes, and I know how to prove it. 2.No, I have a counterexample. 3.No, and I have an argument. 4.Not sure.

Is a continuous bijection between sequentially compact metric spaces a homeomorphism? 1.Depends on the function, however this function is automatically uniformly continuous. 2.It is false if the function is not uniformly continuous. 3.Yes, always.

Which of the following functions is not uniformly continuous on the specified domain? 1.f(x)=1/(1+x 2 ) on [-1,1] 2.f(x)=1/(1+x 2 ) on R 3.f(x)=tan(x) on [0,π/2) 4.f(x)=x+1/x on [1,∞)

Can a complete metric space be a subspace of an incomplete metric space? 1.Yes, but I don’t know any example. 2.Yes, and I have an example. 3.No. However, I forgot the appropriate theorem. 4.No, and I know a reason.

A discrete metric space is sequentially compact iff… 1.…it is finite and thus totally bounded. 2.…it is closed and complete (it is always bounded!). 3.…the Cauchy sequences are eventually constant.

Is every complete metric space sequentially compact? 1.Yes (and totally bounded). 2.No, but it is true if we replace “sequentially compact” by “compact”. 3.No, I have a non- (sequentially) compact counterexample.

Let (X,d) be a metric space with subsets U,V. Is the following statement true or false? If U, V are compact, then their union is also compact. 1.True 2.False

When is a discrete metric space connected? 1.Not possible 2.If it consists of one point only 3.If it consists of two points 4.If it consists of finitely many points 5.If it consists of infinitely but countably many points.

A ball in a connected metric space need not be connected. 1.True 2.False

Let A be a subset of a metric space (X,d). If the boundary ∂A is connected, is A itself connected? 1.Yes 2.No

The checkerboard:

Consider the set Which statement is false. 1.A is path connected and connected. 2.A is connected but not path connected. 3.cl A is connected, but not path connected.

Evaluation: Using the Audience Response Systems (ARS) for this revision session was a good idea. 1.Strongly Agree 2.Agree 3.Neutral 4.Disagree 5.Strongly Disagree