Set Topology MTH 251 Lecture # 8.

Slides:



Advertisements
Similar presentations
Is it rational or irrational?
Advertisements

Some important properties Lectures of Prof. Doron Peled, Bar Ilan University.
Review for CS1050. Review Questions Without using truth tables, prove that  (p  q)   q is a tautology. Prove that the sum of an even integer and an.
More Functions and Sets
DEFINITION Let f : A  B and let X  A and Y  B. The image (set) of X is f(X) = {y  B : y = f(x) for some x  X} and the inverse image of Y is f –1 (Y)
Equivalence Relations
More Set Definitions and Proofs 1.6, 1.7. Ordered n-tuple The ordered n-tuple (a1,a2,…an) is the ordered collection that has a1 as its first element,
(CSC 102) Discrete Structures Lecture 14.
1 Section 1.7 Set Operations. 2 Union The union of 2 sets A and B is the set containing elements found either in A, or in B, or in both The denotation.
Boolean Algebra cont’ The digital abstraction Graphs and Topological Sort מבנה המחשב + מבוא למחשבים ספרתיים תרגול 2#
SET.   A set is a collection of elements.   Sets are usually denoted by capital letters A, B, Ω, etc.   Elements are usually denoted by lower case.
1 Introduction to Computability Theory Lecture4: Non Regular Languages Prof. Amos Israeli.
Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.
Topological Nets and Filters Mark Hunnell. Outline 1.Motivations for Nets and Filters 2.Basic Definitions 3.Construction of Equivalence 4.Comparison and.
Chapter 6 Mathematical Induction
Mathematical Induction. F(1) = 1; F(n+1) = F(n) + (2n+1) for n≥ F(n) n F(n) =n 2 for all n ≥ 1 Prove it!
1 Strings and Languages. 2 Review Sets and sequences Functions and relations Graphs Boolean logic:      Proof techniques: – Construction, Contradiction,
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/21/2008.
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.
1 Introduction to Abstract Mathematics Sets Section 2.1 Basic Notions of Sets Section 2.2 Operations with sets Section 2.3 Indexed Sets Instructor: Hayk.
Chapter SETS DEFINITION OF SET METHODS FOR SPECIFYING SET SUBSETS VENN DIAGRAM SET IDENTITIES SET OPERATIONS.
2.2 Set Operations. The Union DEFINITION 1 Let A and B be sets. The union of the sets A and B, denoted by A U B, is the set that contains those elements.
Defining Liveness by Bowen Alpern and Fred B. Schneider Presented by Joe Melnyk.
Sixth lecture Concepts of Probabilities. Random Experiment Can be repeated (theoretically) an infinite number of times Has a well-defined set of possible.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/27/2009.
Snick  snack Supplement: Worked Set Proofs Based on work by Meghan Allen.
Lecture 21 Reducibility. Many-one reducibility For two sets A c Σ* and B c Γ*, A ≤ m B if there exists a Turing-computable function f: Σ* → Γ* such that.
8.4 Closures of Relations Definition: The closure of a relation R with respect to property P is the relation obtained by adding the minimum number of.
Chapter Three SEQUENCES
Equivalence Relations Lecture 45 Section 10.3 Fri, Apr 8, 2005.
Set Operations Section 2.2.
1 Set Theory Second Part. 2 Disjoint Set let A and B be a set. the two sets are called disjoint if their intersection is an empty set. Intersection of.
Discrete Mathematics Lecture # 10 Venn Diagram. Union  Let A and B be subsets of a universal set U. The union of sets A and B is the set of all elements.
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)
Thinking Mathematically Venn Diagrams and Subsets.
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.
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.
Equivalence Relations
Equivalence Relations: Selected Exercises
The set of whole numbers less than 7 is {1, 2, 3, 4, 5, 6}
Chapter 2 Sets and Functions.
A Universal Turing Machine
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
The Language of Sets If S is a set, then
Copyright © Cengage Learning. All rights reserved.
CSNB 143 Discrete Mathematical Structures
CSE322 PUMPING LEMMA FOR REGULAR SETS AND ITS APPLICATIONS
Chapter 3 The Real Numbers.
Great Theoretical Ideas In Computer Science
Chapter 3 The Real Numbers.
Chapter 3 The Real Numbers.
Chapter 3 The Real Numbers.
Indirect Argument: Contradiction and Contraposition
Definition: Let G = (V, T, P, S) be a CFL
Deterministic PDAs - DPDAs
Properties of Context-Free Languages
Subspaces and Spanning Sets
Proposed in Turing’s 1936 paper
Lecture 43 Section 10.1 Wed, Apr 6, 2005
Chapter 3 The Real Numbers.
Chapter 7 Logic, Sets, and Counting
Affine Spaces Def: Suppose
Equivalence Relations
Equivalence Relations: Selected Exercises

PRESENTED BY Dr.U.KARUPPIAH DEPARTMENT OF MATHEMATICS
THE WELL ORDERING PROPERTY
Terminology and Symbols
Presentation transcript:

Set Topology MTH 251 Lecture # 8

Lecture Outline In this Lecture we will define Limit point of a set. Closed set Discuss some examples related to limit points and closed sets Closure of a point Prove a theorem on closed sets

Definition # 1: (Limit point of a set) Let (X, d ) be a metric space and A  X. A pointy x  X is called a limit point of a set A if each open sphere centered at x contains at least one point of A different from x. Symbolically, x  X is a limit point of A if Sr(x) – {x}  A ≠Ф for every r >0.

Example # 1: Let A = { 1, ½ , 1/3, . . . }  R. Then 0 is the only limit point of A.  

Example # 2:   Let X = ℝ and A = [ 0, 1 ). Then every point of A is its limit point and 1 is also a limit point of A which does not belongs to A.

Example # 3: Let X = 𝑅and A =𝑍 . Then 𝐴 has no limit point.

Definition # 2:   A subset F of a metric space X is called a closed set if it contains each of its limit points.

EXAMPLE # 4: X = R, F = [a, b] is a closed set and U = (a, b) is not closed. Where as [a, b) is neither open nor closed.

Example # 5:   The set Fx = {y  X | d( x, y )  r } is a closed set called the closed sphere, denoted by Sr [x].

  Theorem # 1: Let X be a metric space. A subset F of X is closed if and only if its complement F = X – F is open. Proof. We assume first that F is closed. We show that F is open.

  Theorem # 1: Let X be a metric space. A subset F of X is closed if and only if its complement F = X – F is open. Proof. We assume first that F is closed. We show that F is open. If F =  , then it is open. We may assume that F is non-empty .

  Theorem # 1: Let X be a metric space. A subset F of X is closed if and only if its complement F = X – F is open. Proof. We assume first that F is closed. We show that F is open. If F =  , then it is open. We may assume that F is non-empty . Let x  F . Since F is closed and x  F

  Theorem # 1: Let X be a metric space. A subset F of X is closed if and only if its complement F = X – F is open. Proof. We assume first that F is closed. We show that F is open. If F =  , then it is open. We may assume that F is non-empty . Let x  F . Since F is closed and x  F  x is not a limit point of F (as F is closed)

  Theorem # 1: Let X be a metric space. A subset F of X is closed if and only if its complement F = X – F is open. Proof. We assume first that F is closed. We show that F is open. If F =  , then it is open. We may assume that F is non-empty . Let x  F . Since F is closed and x  F  x is not a limit point of F (as F is closed)   r > 0 such that Sr(x)  F = 

  Theorem # 1: Let X be a metric space. A subset F of X is closed if and only if its complement F = X – F is open. Proof. We assume first that F is closed. We show that F is open. If F =  , then it is open. We may assume that F is non-empty . Let x  F . Since F is closed and x  F  x is not a limit point of F (as F is closed)   r > 0 such that Sr(x)  F =   Sr(x)  F.

  Theorem # 1: Let X be a metric space. A subset F of X is closed if and only if its complement F = X – F is open. Proof. We assume first that F is closed. We show that F is open. If F =  , then it is open. We may assume that F is non-empty . Let x  F . Since F is closed and x  F  x is not a limit point of F (as F is closed)   r > 0 such that Sr(x)  F =   Sr(x)  F. Since x is arbitrary point. Therefore F is open.

  Theorem # 1: Let X be a metric space. A subset F of X is closed if and only if its complement F = X – F is open. Proof. We assume first that F is closed. We show that F is open. If F =  , then it is open. We may assume that F is non-empty . Let x  F . Since F is closed and x  F  x is not a limit point of F (as F is closed)   r > 0 such that Sr(x)  F =   Sr(x)  F. Since x is arbitrary point. Therefore F is open. Now assume that F is open. We show that F is closed.

  Theorem # 1: Let X be a metric space. A subset F of X is closed if and only if its complement F = X – F is open. Proof. We assume first that F is closed. We show that F is open. If F =  , then it is open. We may assume that F is non-empty . Let x  F . Since F is closed and x  F  x is not a limit point of F (as F is closed)   r > 0 such that Sr(x)  F =   Sr(x)  F. Since x is arbitrary point. Therefore F is open. Now assume that F is open. We show that F is closed. For this, we show that every limit point of F is in F

  Theorem # 1: Let X be a metric space. A subset F of X is closed if and only if its complement F = X – F is open. Proof. We assume first that F is closed. We show that F is open. If F =  , then it is open. We may assume that F is non-empty . Let x  F . Since F is closed and x  F  x is not a limit point of F (as F is closed)   r > 0 such that Sr(x)  F =   Sr(x)  F. Since x is arbitrary point. Therefore F is open. Now assume that F is open. We show that F is closed. For this, we show that every limit point of F is in F Let x be a limit point of F.

  Theorem # 1: Let X be a metric space. A subset F of X is closed if and only if its complement F = X – F is open. Proof. We assume first that F is closed. We show that F is open. If F =  , then it is open. We may assume that F is non-empty . Let x  F . Since F is closed and x  F x is not a limit point of F (as F is closed)  r > 0 such that Sr(x)  F =   Sr(x)  F. Since x is arbitrary point. Therefore F is open. Now assume that F is open. We show that F is closed. For this, we show that every limit point of F is in F Let x be a limit point of F. Suppose that 𝑥 ∉𝐹.

  Theorem # 1: Let X be a metric space. A subset F of X is closed if and only if its complement F = X – F is open. Proof. We assume first that F is closed. We show that F is open. If F =  , then it is open. We may assume that F is non-empty . Let x  F . Since F is closed and x  F x is not a limit point of F (as F is closed)  r > 0 such that Sr(x)  F =   Sr(x)  F. Since x is arbitrary point. Therefore F is open. Now assume that F is open. We show that F is closed. For this, we show that every limit point of F is in F Let x be a limit point of F. Suppose that 𝑥 ∉𝐹. Then 𝑥∈ 𝐹 ′

  Theorem # 1: Let X be a metric space. A subset F of X is closed if and only if its complement F = X – F is open. Proof. We assume first that F is closed. We show that F is open. If F =  , then it is open. We may assume that F is non-empty . Let x  F . Since F is closed and x  F x is not a limit point of F (as F is closed)  r > 0 such that Sr(x)  F =   Sr(x)  F. Since x is arbitrary point. Therefore F is open. Now assume that F is open. We show that F is closed. For this, we show that every limit point of F is in F Let x be a limit point of F. Suppose that 𝑥 ∉𝐹. Then 𝑥∈ 𝐹 ′ Since 𝐹 ′ is open, there is an open sphere 𝑆 𝑟 (𝑥) such that 𝑥 ∈ 𝑆 𝑟 𝑥 ⊆ 𝐹 ′

  Theorem # 1: Let X be a metric space. A subset F of X is closed if and only if its complement F = X – F is open. Proof. . We assume first that F is closed. We show that F is open. If F =  , then it is open. We may assume that F is non-empty . Let x  F . Since F is closed and x  F x is not a limit point of F (as F is closed)  r > 0 such that Sr(x)  F =   Sr(x)  F. Since x is arbitrary point. Therefore F is open. Now assume that F is open. We show that F is closed. For this, we show that every limit point of F is in F Let x be a limit point of F. Suppose that 𝑥 ∉𝐹. Then 𝑥∈ 𝐹 ′ Since 𝐹 ′ is open, there is an open sphere 𝑆 𝑟 (𝑥) such that 𝑥 ∈ 𝑆 𝑟 𝑥 ⊆ 𝐹 ′ But 𝑆 𝑟 𝑥 ∩ 𝐹− 𝑥 =𝜑

  Theorem # 1: Let X be a metric space. A subset F of X is closed if and only if its complement F = X – F is open. Proof. . We assume first that F is closed. We show that F is open. If F =  , then it is open. We may assume that F is non-empty . Let x  F . Since F is closed and x  F x is not a limit point of F (as F is closed)  r > 0 such that Sr(x)  F =   Sr(x)  F. Since x is arbitrary point. Therefore F is open. Now assume that F is open. We show that F is closed. For this, we show that every limit point of F is in F Let x be a limit point of F. Suppose that 𝑥 ∉𝐹. Then 𝑥∈ 𝐹 ′ Since 𝐹 ′ is open, there is an open sphere 𝑆 𝑟 (𝑥) such that 𝑥 ∈ 𝑆 𝑟 𝑥 ⊆ 𝐹 ′ But 𝑆 𝑟 𝑥 ∩ 𝐹− 𝑥 =𝜑 A contradiction.

  Theorem # 1: Proof. We assume first that F is closed. We show that F is open. If F =  , then it is open. We may assume that F is non-empty . Let x  F . Since F is closed and x  F x is not a limit point of F (as F is closed)  r > 0 such that Sr(x)  F =   Sr(x)  F. Since x is arbitrary point. Therefore F is open. Now assume that F is open. We show that F is closed. For this, we show that every limit point of F is in F Let x be a limit point of F. Suppose that 𝑥 ∉𝐹. Then 𝑥∈ 𝐹 ′ Since 𝐹 ′ is open, there is an open sphere 𝑆 𝑟 (𝑥) such that 𝑥 ∈ 𝑆 𝑟 𝑥 ⊆ 𝐹 ′ But 𝑆 𝑟 𝑥 ∩ 𝐹− 𝑥 =𝜑 A contradiction. Hence 𝑥∈𝐹

  Theorem # 1: Proof. We assume first that F is closed. We show that F is open. If F =  , then it is open. We may assume that F is non-empty . Let x  F . Since F is closed and x  F x is not a limit point of F (as F is closed)  r > 0 such that Sr(x)  F =   Sr(x)  F. Since x is arbitrary point. Therefore F is open. Now assume that F is open. We show that F is closed. For this, we show that every limit point of F is in F Let x be a limit point of F. Suppose that 𝑥 ∉𝐹. Then 𝑥∈ 𝐹 ′ Since 𝐹 ′ is open, there is an open sphere 𝑆 𝑟 (𝑥) such that 𝑥 ∈ 𝑆 𝑟 𝑥 ⊆ 𝐹 ′ But 𝑆 𝑟 𝑥 ∩ 𝐹− 𝑥 =𝜑 A contradiction. Hence 𝑥∈𝐹 Thus F contains all its limit points. Therefore F is closed.

Definition # 3:   Let A be a subset of a metric space (X, d). Then we define closure of A ( denoted byA or Cl(A) ) as the union of A and all limit points of A. Mathematically, A = A  Ad , where Ad denotes set of limit points of A.

Example # 6: Let X = ℝ, A = ( a, b ), then A = [ a,, b ]  

Let X = R2, A = { z  R2 | | z | < 1 }, then Example # 7:   Let X = R2, A = { z  R2 | | z | < 1 }, then A = { z  R2 | | z |  1 }.

a). A is closed if and only ifA = A ; Theorem # 6: a). A is closed if and only ifA = A ; b). A is the smallest closed superset of A; c). A equals the intersection of all closed supersets of A.  

Lecture Summery In this Lecture we have discussed Limit point of a set. We have defined Closed set Discussed some examples related to limit points and closed sets We have defined Closure of a set Proved that: A subset F of X is closed if and only if its complement F = X – F is open.

Good Luck