0% found this document useful (0 votes)
351 views28 pages

Chapter 10 The Topology of R

The document defines key topological concepts in real numbers including open sets, closed sets, neighborhoods, and compact sets. It provides examples and properties of open and closed sets in R. The document also introduces metric spaces and defines metrics, convergence of sequences, Cauchy sequences, completeness, and examples of complete and incomplete metric spaces.

Uploaded by

Susilo Wati
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
351 views28 pages

Chapter 10 The Topology of R

The document defines key topological concepts in real numbers including open sets, closed sets, neighborhoods, and compact sets. It provides examples and properties of open and closed sets in R. The document also introduces metric spaces and defines metrics, convergence of sequences, Cauchy sequences, completeness, and examples of complete and incomplete metric spaces.

Uploaded by

Susilo Wati
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 28

The Topology of R

By:
Mardiyana
Mathematics Education
Sebelas Maret University
Open and Closed Set in R
Definition
A neighborhood of a point x R is any
set V that containts an -neigborhood
V(x) = (x - , x + ) of x for some > 0.
Definition
(i) A subset G of R is open in R if for each
x G there exists a neighborhood V of
x such that V G.
(ii). A subset F of R is closed in R if the
complement Fc = R\F is open in R.
Example
(a) The entire set R is open
(b) The set G = {x R : 0 < x < 1} is open
(c) Any open interval (a, b) is an open set.
(d) The set I = [0, 1] is not open
(e) The set H = {x : 0 x < 1} is neither open
nor closed.
(f) The empty set is open in R.
Open Set Properties
(a) The union of an arbitrary collection of
open subsets in R is open.
(b) The intersection of any finite collection of
open sets in R is open.
Closed Set Properties
(a) The intersection of an arbitrary
collection of closed sets in R is closed.
(b) The union of any finite collection of a
closed sets in R is closed
The Characterization of Closed Sets

Let F R. The following assertions are


equivalent:
(i)F is a closed subset of R
(ii)If X = (xn) is any convergents sequence of
elements in F, then lim X belongs to F
Theorem
A subset of R is closed if and only if it
containts all of its cluster points
The Characterization of Open Sets

Theorem
A subset of R is open if and only if it is the
union of countably many disjoint open
intervals in R.
Compact Set
Definition
Let A be a subset of R. An open cover of A
is a collection C = {G} of open set in R
whose union contains A, that is
Definition
A subset K of R is said to be compact if
every open cover of K has a finite subcover.
Example 1
Let K be a finite subset of R. Then K is a
compact set.
Example 2
Let J = (0, 1). Then J is not compact set.
Metric Spaces
Definition
A metric on a set S is a function d : S x S R
that satisfies the following properties:
(a)d(x, y) 0 for all x, y S (Positivity)
(b)d(x, y) = 0 if and only if x = y (Definiteness)
(c)d(x, y) = d(y, x) for all x, y S (Symmetry)
(d)d(x, y) d(x, z) + d(z, y) for all x, y, z S
(Triangle Inequality)
A metric space (S, d) is a set S together with a
metric d on S.
Example 1
A familiar metric on R is defined by
d(x, y) := |x y| for x, y R
Example 2
We define the matric d on R2 as follows:
P = (x, y) and Q = (s, t) are points in R2 then

d(P, Q) =
Example 3
Let S be any nonempty set. For s, t S, we
define
d(s, t) := 0 if s = t
:=1 if s t
This metric is called the discrete metric on
the set S.
Definition
Let (S, d) be a metric space. Then for > 0 the
-neighborhood of c in S is the set
V (c) := {x S : d(c,x) < }
A neighborhood of c is any set U that contains an
-neighborhood of c for some > 0.
Definition
Let (xn) be a sequence in the metric space (S, d).
The sequence (xn) is said to converge to x in S if
for any > 0 there exists K N such that xn
V(x) for all n K
Definition
A sequence xn is said to be Cauchy in case
d(xm,xn) 0 as m, n .
Theorem
Every convergent sequence is Cauchy. But,
not every Cauchy sequence is convergent
Example
Let S be the interval (0,1) with d(x, y) = |x y|. Let
un = 1/n, n = 1, 2, 3, ... Then (un) is Cauchy, but the
only posible limit (namely 0) lies outside of S.
Definition
A metric space X is said to be complete in
case every Cauchy sequence is convergent.
Otherwise, X is said to be incomplete.
Example
In the metric space of all real numbers, with
d(x, y) = |x y|, every Cauchy sequence is
convergent. This is an example of complete
metric space.
Example
Let P be set of all continuous functions on a
closed interval [-1, 1]. Distances/metrices
are defined as follows:

It is clear that P is an incomplete metric space.


Theorem
In any metric space
(i) |d(x,z) d(y,z)| d(x, y)
(ii) If xn x and yn y, then d(xn,yn) d(x,y)
(iii) If (xn) and (yn) are Cauchy sequences, then
d(xn,yn) is a convergent sequence of real
numbers.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy