M - SC - (Mathematics) - 311 14 - Topology - I PDF

ALAGAPPA UNIVERSITY
[Accredited with ‘A+’ Grade by NAAC (CGPA:3.64) in the Third Cycle

and Graded as Category–I University by MHRD-UGC]
(A State University Established by the Government of Tamil Nadu)
KARAIKUDI – 630 003
Directorate of Distance Education
M.Sc. [Mathematics]
I - Semester
311 14
TOPOLOGY - I
Authors:
N Ch SN Iyengar, Sr. Professor, School of Computing Sciences VIT University,Vellore, Tamilnadu, India
VM Chandrasekaran, Asst. Professor, Department of Mathematics Vellore Institute of Technology (Deemed University), Vellore
KA Venkatesh, Professor, Cognitive Science, Alliance University, Bangalore
PS Arunachalam, Senior Lecturer, Department of Mathematics SRM Engineering College, Chennai
Unit (1)
Aditi Sharma, Freelance Author
Unit (3)
Dr Pratiksha Saxena, Assistant Professor, School of Applied Sciences, Gautam Buddha University, Greater Noida
Units (4, 6, 10-14)
Dr Nitin Bhardwaj, Assistant Professor/Assistant Scientist (Statistics) Ch. Charan Singh Haryana Agricultural University
Hisar (India)
Gaurav Tyagi, Assistant Professor, Mahamana Malviya Degree College, Khekra, Baghpat in Mathematics Department
Units (5, 7-9)
"The copyright shall be vested with Alagappa University"
All rights reserved. No part of this publication which is material protected by this copyright notice
may be reproduced or transmitted or utilized or stored in any form or by any means now known or
hereinafter invented, electronic, digital or mechanical, including photocopying, scanning, recording
or by any information storage or retrieval system, without prior written permission from the Alagappa
University, Karaikudi, Tamil Nadu.
Information contained in this book has been published by VIKAS® Publishing House Pvt. Ltd. and has
been obtained by its Authors from sources believed to be reliable and are correct to the best of their
knowledge. However, the Alagappa University, Publisher and its Authors shall in no event be liable for
any errors, omissions or damages arising out of use of this information and specifically disclaim any
implied warranties or merchantability or fitness for any particular use.
Vikas® is the registered trademark of Vikas® Publishing House Pvt. Ltd.

VIKAS® PUBLISHING HOUSE PVT. LTD.
E-28, Sector-8, Noida - 201301 (UP)
Phone: 0120-4078900 x Fax: 0120-4078999
Regd. Office: 7361, Ravindra Mansion, Ram Nagar, New Delhi 110 055
x Website: www.vikaspublishing.com x Email: [email protected]
Work Order No. AU/DDE/DE1-238/Preparation and Printing of Course Materials/2018 Dated 30.08.2018 Copies - 500
SYLLABI-BOOK MAPPING TABLE
Topology - I
Syllabi Mapping in Book
BLOCK I: FUNDAMENTALS, FINITEAND INFINITE SETS

UNIT - I Set Theory and Logic : Fundamental Concepts- Functions- Unit 1: Set Theory
Relations - The Integers and the Real Numbers (Pages 1-45);
UNIT - II The Integers and the Real Numbers - Cartesian Products- Unit 2: Set Theory and
Finite Sets - Countable and Uncountable sets Number System
UNIT - III Infinite sets and the Axiom of choice- ordered sets- The (Pages 46-69);
Maximum Principle Unit 3: Infinite Sets
(Pages 70-81)
BLOCK II: TOPOLOGICAL SPACES

UNIT - IV Topological Spaces - Basis of a topology - Problems
Unit 4: Topological Spaces:
UNIT - V The order topology - The product topology on X × Y -
An Introduction
Problems
(Pages 82-93);
UNIT - VI The subspace topology - Closed sets and limit points -
Unit 5: Order Topology
Hausdorff spaces (Pages 94-107);
UNIT - VII Continuous Functions - Continuity of a Function- Unit 6: Topology: Subspace, Closed
Homomorphisms The product topology Sets and Hausdorff Spaces
UNIT - VIII Constructing continuous Functions -The metric topology (Pages 108-134);
- The quotient topology. Unit 7: Continuous Function, Product
Topology and Homeomorphism
(Pages 135-150);
Unit 8: Metric and Quotient Topology
(Pages 151-158)
BLOCK III: CONNECTED AND COMPACT SPACES

UNIT - IX Connected spaces - Connected sets in the real line - Unit 9: Connected Spaces
component and path components and Sets
UNIT - X Local connectedness - Compact spaces - Problems (Pages 159-170);
UNIT - XI Compact sets in the real line - Limit point compactness - Unit 10: Local Connectedness
Local Compactness and Compact Spaces
(Pages 171-180);
Unit 11: Compact Set and Limit Point
Compactness
(Pages 181-209)
BLOCK IV: COUNTABILITYAXIOMS AND NORMAL SPACES Unit 12: Countability and
UNIT - XII The Countability axioms - The separation axioms - Problems Separation Axioms
UNIT - XIII Normal spaces - The Urysohn's lemma (Pages 210-227);
UNIT - XIV The Uryshon's metrization theorem - Related Problems Unit 13: Normal Spaces
(Pages 228-245);
Unit 14: The Uryshon’s
Metrization Theorem
(Pages 246-254)
CONTENTS
INTRODUCTION
BLOCK I: FUNDAMENTALS, FINITE AND INFINITE SETS

UNIT 1 SET THEORY 1-45
1.0 Introduction
1.1 Objectives
1.2 Definitions and Notations
1.2.1 Roster Form; 1.2.2 Set Builder Notation
1.2.3 Representation of Sets; 1.2.4 Empty Set or Null Set
1.2.5 Equality of Sets; 1.2.6 Finite and Infinite Sets
1.2.7 Universal Set; 1.2.8 Disjoint Sets
1.2.9 Overlapping Sets; 1.2.10 Membership of a Set
1.3 Subset of Sets
1.3.1 Subsets
1.3.2 Transitivity of Subsets
1.4 Set Operators
1.4.1 Cardinality of a Set
1.4.2 Union of Sets
1.4.3 Intersection of Sets
1.4.4 Difference of Two Sets
1.4.5 Complement of a Set
1.4.6 Venn Diagram
1.4.7 Minset and Maxset
1.5 Properties of Set Operations
1.5.1 Commutative
1.5.2 Associative
1.5.3 Identity
1.5.4 Distributive
1.5.5 DeMorgan’s a Law
1.5.6 Cartesian Product of Sets
1.5.7 Laws of Idempotence
1.6 Applications of Set Theory
1.7 Relation of Sets
1.7.1 Number of Relations
1.7.2 Reflexive, Symmetric and Transitive Relations
1.7.3 Equivalence Class
1.7.4 Partitions
1.8 Functions
1.9 Formal Logic
1.9.1 Mathematical Logic
1.9.2 Logical Operators
1.9.3 Equivalence Formula
1.10 Answers to Check Your Progress Questions
1.11 Summary
1.12 Keywords
1.13 Self Assessment Questions and Exercises
1.14 Further Readings
UNIT 2 SET THEORY AND NUMBER SYSTEM 46-69
2.0 Introduction
2.1 Objectives
2.2 Construction of Number System
2.2.1 The Naive Approach
2.2.2 The Axiomatic Approach
2.3 Set of Real Numbers
2.3.1 Axioms of Real Numbers
2.3.2 Summary of Properties of Algebraic Operations on Real Numbers
2.4 Positive and Negative Real Numbers
2.4.1 Set of Integers Z
2.4.2 Section of Integers
2.4.3 Well Ordering Property
2.4.4 Strong Induction Principle
2.4.5 Archimedean Ordering Property
2.5 Cartesian Product of Sets
2.5.1 Cartesian Product of Functions
2.5.2 Cartesian Product of Two Sets
2.6 Finite and Infinite Sets
2.7 Countable and Uncountable Sets
2.9 Summary
2.10 Key Words
UNIT 3 INFINITE SETS 70-81
3.0 Introduction
3.1 Objectives
3.2 Infinite Sets
3.3 Infinite Set Theorem
3.4 Axiom of Choice
3.4.1 Existence of a Choice Function
3.5 Well Ordered Sets
3.5.1 Properties
3.6 Well-Ordering Theorem
3.7 The Maximum Principle
3.7.1 The Maximum Principle Theorem
3.7.2 Maximal Element
3.8 Zorn’s Lemma
3.10 Summary
3.11 Key Words
BLOCK II: TOPOLOGICAL SPACES
UNIT 4 TOPOLOGICAL SPACES: AN INTRODUCTION 82-93
4.0 Introduction
4.1 Objectives
4.2 Topological Spaces
4.2.1 Examples of Topological Spaces
4.2.2 Classification of Topological Spaces
4.3 Problems
4.5 Summary
4.6 Key Words
UNIT 5 ORDER TOPOLOGY 94-107
5.0 Introduction
5.1 Objectives
5.2 The Order Topology
5.3 The Product Topology on X × Y
5.3.1 Projection Mappings
5.3.2 Tychonoff Product Topology in Terms of Standard
Subbase and its Characterization
5.5 Summary
5.6 Key Words
UNIT 6 TOPOLOGY: SUBSPACE, CLOSED SETS AND
HAUSDORFF SPACES 108-134
6.0 Introduction
6.1 Objectives
6.2 The Subspace Topology
6.2.1 Subspace and Relative Topology
6.2.2 Topology in Terms of Kuratowski Closure Operator and Neighbourhood Systems
6.2.3 Dense Subsets
6.3 Closed Sets and Limit Points
6.3.1 Neighbourhoods; 6.3.2 Open Sets
6.3.3 Closed Sets
6.3.4 Accumulation Points or Limit Points: Adherent points
6.3.5 Closed Sets and Accumulation Points; 6.3.6 Closure
6.4 Hausdorff Spaces
6.6 Summary
6.7 Key Words
UNIT 7 CONTINUOUS FUNCTION, PRODUCT TOPOLOGY AND
HOMEOMORPHISM 135-150
7.0 Introduction
7.1 Objectives
7.2 Continuous Functions and Continuity of a Function
7.2.1 Characterization of Continuous Functions Using Pre-images
7.2.2 General Properties of Continuous Functions
7.2.3 Alternative Proof Using Sequences
7.3 Homeomorphism
7.4 The Product Topology
7.6 Summary
7.7 Key Words
UNIT 8 METRIC AND QUOTIENT TOPOLOGY 151-158
8.0 Introduction
8.1 Objectives
8.2 Constructing Continuous Functions
8.3 The Metric Topology
8.4 The Quotient Topology
8.6 Summary
8.7 Key Words
BLOCK III: CONNECTED AND COMPACT SPACES

UNIT 9 CONNECTED SPACES AND SETS 159-170
9.0 Introduction
9.1 Objectives
9.2 Connected Spaces
9.3 Connected Sets in the Real Line
9.5 Summary
9.6 Key Words
UNIT 10 LOCAL CONNECTEDNESS AND COMPACT SPACES 171-180
10.0 Introduction
10.1 Objectives
10.2 Local Connectedness and Compact Spaces
10.3 Compactness and Nets
10.4 Paracompact Spaces
10.6 Summary
10.7 Key Words
UNIT 11 COMPACT SET AND LIMIT POINT COMPACTNESS 181-209
11.0 Introduction
11.1 Objectives
11.2 Compact Set in the Real Line
11.2.1 The Bolzano-Weierstrass Property and Sequential Compactness
Sequential Compactness
11.2.2 Finite Intersection Property
11.2.3 Continuous Functions and Compact Sets
11.3 Limit Point Compactness
11.4 Local Compactness
11.6 Summary
11.7 Key Words
BLOCK IV: COUNTABILITY AXIOMS AND NORMAL SPACES

UNIT 12 COUNTABILITY AND SEPARATION AXIOMS 210-227
12.0 Introduction
12.1 Objectives
12.2 Axioms of Countability
12.3 The Separation Axioms
12.3.1 Hausdorff Spaces
12.3.2 Convergence to to Space
12.3.3 First and Second Countable Spaces
12.3.4 Lindelof’s Theorems
12.3.5 Separable Spaces and Separability
12.5 Summary
12.6 Key Words
UNIT 13 NORMAL SPACES 228-245
13.0 Introduction
13.1 Objectives
13.2 Normal Spaces
13.3 The Urysohn’s Lemma
13.4 Tietze Extension Theorem
13.4.1 Complete Regularity and Complete Normality
T1
13.4.2 Completely Regular Space and 3 Space
2
13.6 Summary
13.7 Key Words
UNIT 14 THE URYSHON'S METRIZATION THEOREM 246-254
14.0 Introduction
14.1 Objectives
14.2 The Uryshon’s Metrization and Embedding Theorem
14.2.1 Embedding Lemma and Tychonoff Embedding
14.2.2 Urysohn’s Metrization Theorem
14.4 Summary
14.5 Key Words
Introduction
INTRODUCTION
Topology can be defined as the study of qualitative properties of certain objects,
NOTES known as topological spaces, which are invariant under certain kind of
transformations, particularly those properties that are invariant under
homeomorphism. Topology is a major area of mathematics concerned with
properties that are preserved under continuous deformations of objects, such as
deformations that involve stretching. It emerged through the development of
concepts from geometry and set theory, such as space, dimension and
transformation. The term topology is also used to refer to a structure imposed
upon a set X, a structure that essentially distinguishes the set X as a topological
space by considering properties, such as convergence, connectedness and
continuity, upon transformation. Topological spaces appear unsurprisingly in almost
every branch of mathematics, hence this has made topology one of the great unifying
concepts of mathematics. The motivating insight behind topology is that some
geometric problems depend not on the exact shape of the objects involved, but
rather on the way they are put together.
The theory of topological spaces provides a setting for the notions of
continuity and convergence which is more general than that provided by the theory
of metric spaces. In the theory of metric spaces we can find the necessary and
sufficient conditions for convergence and continuity that do not refer explicitly to
the distance function on a metric space but instead are expressed in terms of open
sets. We can generalize the notions of convergence and continuity by introducing
the concept of a topological space as: a topological space consists of a set together
with a collection of subsets called open sets that satisfy appropriate axioms. The
axioms for open sets in a topological space are satisfied by the open sets in any
metric space. The subject of topology itself consists of several different branches,
such as point set topology, algebraic topology and differential topology.
This book, Topology - I, is divided into four blocks, which are further
divided into fourteen units which will help you understand how to distinguish spaces
by means of simple topological invariants (compactness, connectedness and the
fundamental groups). The topics discussed are set theory and logic, functions,
relations, integers and the real numbers, Cartesian products, finite sets, countable
and uncountable sets, infinite sets and the axiom of choice, topological spaces,
order topology, product topology on X × Y, subspace topology, closed sets and
limit points, Hausdorff spaces, continuous functions, homomorphisms, constructing
continuous functions, metric topology, quotient topology, connected spaces, path
components, local connectedness, compact spaces, local compactness, countability
axioms, separation axioms, normal spaces, the Urysohn’s lemma and metrization
theorem.
The book follows the self-instruction mode or the SIM format wherein
each unit begins with an ‘Introduction’ to the topic followed by an outline of the
‘Objectives’. The content is presented in a simple and structured form interspersed
with ‘Check Your Progress’ questions and answers for better understanding. A list
of ‘Key Words’ along with a ‘Summary’ and a set of ‘Self Assessment Questions
Self-Instructional
8 Material
and Exercises’ is provided at the end of the each unit for effective recapitulation.
Set Theory
BLOCK - I
FUNDAMENTALS, FINITE AND INFINITE SETS
NOTES
UNIT 1 SET THEORY

Structure
1.0 Introduction
1.1 Objectives
1.2 Definitions and Notations
1.2.1 Roster Form; 1.2.2 Set Builder Notation
1.2.3 Representation of Sets; 1.2.4 Empty Set or Null Set
1.2.5 Equality of Sets; 1.2.6 Finite and Infinite Sets
1.2.7 Universal Set; 1.2.8 Disjoint Sets
1.2.9 Overlapping Sets; 1.2.10 Membership of a Set
1.3 Subset of Sets
1.3.1 Subsets
1.4 Set Operators
1.4.2 Union of Sets
1.4.6 Venn Diagram
1.4.7 Minset and Maxset
1.5 Properties of Set Operations
1.5.1 Commutative
1.5.2 Associative
1.5.3 Identity
1.5.4 Distributive
1.6 Applications of Set Theory
1.7 Relation of Sets
1.7.4 Partitions
1.8 Functions
1.9 Formal Logic
1.11 Summary
1.12 Keywords
1.14 Further Readings Self-Instructional
Material 1
Set Theory
1.0 INTRODUCTION
The origins of set theory can be traced to late 19th century when a German
NOTES mathematician Georg Cantor (1845-1918) published a paper on, “Property of
the Collection of All Real Algebraic Numbers”. Sets and set theory are regarded
as the foundation of mathematics. In terms of mathematics, a set refers to a collection
of distinct objects and considered as an object in its own right. The constituent
members of a set are known as elements of the set. You will understand different
types of set notation forms, such as Roster form and set builder form. Sets are of
various types, such as finite and infinite sets, universal sets, disjoint sets, overlapping
sets, equivalent sets, empty and null sets, and subset of sets, etc. This unit will
introduce you to the various applications of set theory.
You will be acquainted with different types of operators, such as cardinality
of a set, union of sets, intersection of sets, difference of two sets, complement of
set, set identities, Venn diagram, minset and maxset. Properties of set operations,
such as commutative, associative, identity, distributive, laws of idempotence,
De Morgan’s law, Cartesian product of sets are also discussed.
In mathematics, a relation is used to describe certain properties of things,
i.e., a relation is a relationship between sets of values. You will understand various
types of relations, such as reflexive, symmetric and transitive relations, and
equivalence class and partitions, etc. You will learn about range of function,
composition of functions and types of functions, such as one-to-one, onto surjective,
bijective, constant, into, identity, inverse, even and odd.
The unit also discusses about mathematical logic, logical operators, the
equivalence formula and the respective logical operations for conjunction,
disjunction, negation using the conditional operator, bi-conditional operator, etc.
1.1 OBJECTIVES
After studying this unit, you will be able to:

• Know the basics of set theory and features of sets
• Understand various notations in set theory and set elements
• Comprehend set operations and properties of set operators
• Prove and understand DeMorgan’s laws
• Define relations with respect to set theory
• Analyse partitions and equivalence class
• Describe the features of various types of functions
• Interpret mathematical logic and use different logical operators
• Understand the special type of relations called functions
Self-Instructional
2 Material
Set Theory
1.2 DEFINITIONS AND NOTATIONS
Even though formal definitions have been given for a set and elements of a set, but
the meaning of a set and its elements is best comprehended intuitively. A set is a NOTES
collection or compilation of distinct entities or objects. The objects which form the
set are called the elements of the set. For example Collection of students of your
class is a set, collection of all rational numbers is a set, and collection of all whole
numbers between 10 and 20 is a set. You are an element of the set of students of
your class; the city you reside in is an element of the set of all cities in India. A set
can be an element of another set, for example a set of girls studying in a class is an
element of the set of students studying in that class.
Sets are denoted by capital letters, for example A, B, C……. and elements
of a set are denoted by small letters; a, b, c……. If ‘A’ is a set and ‘b’ is an
element of this set then we write:-
b ∈ A (and read it as b belongs to A or b is an element of A)
If ‘b’ is not an element of ‘A’ then we denote it as:
b ∉ A (and read it as b does not belong to A or is not an element of A)
Example 1: Show that A = {2, 4, 6, 8} is a set of the even numbers.
Solution: A = {2, 4, 6, 8} is a set of the even numbers 2, 4, 6, 8. You may say A
is a set of all even numbers between 1 and 9; or 2, 4, 6, 8 are elements of A.
Example 1 gives the Roster or tabulation method to describe a set. It consists of
listing of each element of the set within the braces. Another method is the descriptive
phrase method which consists of placing a phrase describing the elements of the
set within the braces. Thus,
A = {Even numbers between 1 and 9}
This method may be used when there is a large number of elements or when all the
elements cannot be named.
A third method, known as the rule method or set builder method, consists of
enclosing within the brace a general element and describing it. Thus:
A = {x: x is an even integer and 1 < x < 9}
Or, A = {x/x is even integer and 1 < x < 9}
Here, : or / is used after x.
A set is determined by its elements and not by the method of description. The set
A described in any of these three different ways remains the same.
The idea of a set is both obvious and ancient. But what looks obvious must
be proved and the proof may be either insufficient to justify the obvious or it may
lead to other possibilities including the opposite of the obvious.
Self-Instructional
Material 3
Set Theory The algebra of sets provides a student with laws which can be used to
prove important results in any science.
1.2.1 Roster Form
NOTES The standard notation to list the elements of a set and denote the set is to use
braces. For example set A having elements x, y & z is written as:
A = {a,b,c}, similarly;
B = {0, 1, 2, 3........} is set of whole numbers;
N = { 1, 2, 3, 4, 5} is a set of first 5 natural numbers.
X = { a, b, Y} is a set with elements a, b and the set Y. In this example Set
Y is an element of set X.
The above way of enumerating a set is called as Roster form. Some standard
sets we have studied earlier are:
Z = Set of integers
Q = Set of rational numbers
R = Set of real numbers.
N = Set of natural numbers
1.2.2 Set Builder Notation
Another way of describing a set is called the Set Builder Notation. In the examples
above every set has been denoted by writing its elements. However, it may not be
always possible to write all the elements of a set. In such cases the set can be
described by the property of its elements. The notation is called Set Builder
Notation. It has three parts, a variable, a separator and a rule or function that the
variable satisfies. For example:
A = {x | f(x)}
Or
A = {x : f(x)}
It implies that set A is a set of all elements x which are true for the rule or
function f(x). It is read as A is a set of all x such that x is part of f(x). Sometimes a
domain is also specified, for example:
A = { x ∈ N | x = 2k for all k ∈ N}
1.2.3 Representation of Sets
Sets can be represented by circular or similarly enclosed curves commonly known
as Venn diagrams. Every element in a set is represented by a point.
Example 2: With the help of Venn diagram show that,
V = {a, e, i, o, u}.
Self-Instructional
4 Material
Solution: The Venn diagram shows how the vowels which are the elements of the Set Theory
set V belong to the set V.
a e V NOTES
o i
You shall use symbols and diagrams to represent and understand sets.
It should be remembered that a set remains unchanged if the order of its elements
is changed. Thus, you can write:
V = {e, o, i, a, u}.
Example 3: Show that B = {1, 2, 3, 4, 5} is a set of numbers less than 6.
Solution: B = {1, 2, 3, 4, 5} is the set of counting numbers less than 6. Alternatively,
B = {x (integer) | 0 < x < 6}.
Example 4: What does the set C = {Physics, Chemistry, Sociology, Economics}
mean?
Solution: C = {Physics, Chemistry, Sociology, Economics} is a set of four sciences.
Example 5: How will you describe the set of the two smallest integers larger than
15?
Solution: {16, 17}
Example 6: How will you express the following in the set notation?
(i) The letters in the word ‘internal’.
(ii) Integers greater than 100 but less than 102.
(iii) Integers less than –5 and greater than or equal to –10.
(iv) Letters of the English alphabet.
(v) Odd numbers upto 99.
Solution: (i) {i, n, t, e, r, a, l}; (ii) {101}; (iii) {– 6, – 7, – 8, – 9, – 10};
(iv) {a, b, c, ..., z}; (v) {1, 3, 5, ..., 99}
These sets may be expressed in different forms.
Example 7: What do the following sets mean?
(i) A = {x: x is a person weighing more than 60 kg}
(ii) B = {b: b > 2}
(iii) C = {c (integer): c < 0}.
Self-Instructional
Material 5
Set Theory Solution: (i) A consists of the elements x such that x is a person weighing more
than 60 kg.
(ii) B is the set of all numbers greater than 2.
NOTES (iii) C is the set of all integers less than 0, i.e., C is the set of all negative integers.
1.2.4 Empty Set or Null Set

A set that has no elements is called a null set or an empty set. The concept of an
empty set needs to be understood since someone may argue that if a set has no
elements then how is it a set. The concept is analogous to that of zero in arithmetic.
It becomes important in many situations and is used for defining many properties.
For example if you were interested in making a set of all senior citizens living in a
society who have their children working in USA, you may have some elements or
you may not have any. Therefore, there is a possibility that this set may be an
empty set. The terms null set is more commonly used in Measure theory and
empty set is generally used in set theory.
An empty set is denoted as
A = {} or,
A= Φ
It needs to be clarified here that the following are not equal:
Φ, 0 and {0}
The first is an empty set, second is an element and the third is a set with
0(zero) as an element.
1.2.5 Equality of Sets
Two sets are said to be equal if they have the same elements. It may be noted that
the order of elements in a set does not matter.
Example 8 : If A = { a, b, c, d, 1, 2, 3} and
B = { 1, a, 2, b, 3, d, c}, then A = B.
Example 9: If N = { 1, 2, 3 .......} and

X = { x | x is a non negative real number},
then N ≠ X because 0 is an element of X but not of N.
1.2.6 Finite and Infinite Sets
A set is finite, if it has a finite number of elements. The elements of such a set can
be counted by a finite number. The number of elements in a finite set A is denoted
by n(A). Here n is a finite positive integer.
If a set has an infinite number of elements it is an infinite set. The elements of such
a set cannot be counted by a finite number.
Self-Instructional
6 Material
A set of points along a line or in a plane is called a point set. A finite set has a finite Set Theory
subset. An infinite set may have an infinite subset.

For example, F = {a, b, x, z, 0, 18, p}. Where F is a finite set. n(A) = 7.
Similarly, S = {x: x is a grain of sand on the sea shore}. Where S is a finite set. NOTES
In case, R = {x: x is a natural number}
= {1, 2, 3,...}. Then, R is an infinite set.
If, A = {x: x is a number between 2 and 3}. Then, A is an infinite set.
Example 10: Is D = {x: x is a multiple of 2} an infinite set?
Solution: Yes.
Example 11: Do the letters of the English alphabet give an infinite set?
Solution: No.
Example 12: Is m = {x: x is a currency note in India} an infinite set?
Solution: No.
The set of points between 10 and 20 is a point set. There are infinite number of
points between 10 and 20. The following is an example of an infinite set.
– 20 – 10 0 10 20
The set of all points along a line is an infinite set. There are infinite number of points
on a line. A member of the set of points along a line can be represented on the line
by a variable x.
Example 13: A point set in a plane is shown by the set of points in a plane figure.
Is it an infinite set?
Solution: Yes, it is an infinite set.
1.2.7 Universal Set
The universal set is the totality of elements under consideration as elements of any
set. It is the set of all objects relevant to a particular application. A universal set is
denoted by E. E is the universe or universal set including all possible elements and
is often drawn as a rectangle.
For example, E = {a, b, c,...z}, the set of letters of the English alphabet is a
universal set.
E = {head, tail} is a universal set obtained by the throw of a coin.
E = {rise in demand, constant demand, fall in demand} is a universal set resulting
from a change in the price of a commodity. It covers all the possibilities.
Self-Instructional
Material 7
Set Theory 1.2.8 Disjoint Sets
If two sets have no element in common, then they are disjoint sets.
If, A = {all odd numbers}
NOTES
And, B = {all even numbers}
Then, A, B are termed as disjoint sets.
If C = {0, 1, 2, 3, 4}
And, D = {5, 6}
Then, C and D are also termed as disjoint sets. The given Venn diagram illustrates
this fact.
4
1 3 2
5... 6...
A B
1 5
0
2 3
4 6
C D
Fig. 1.1 Disjoint Sets
1.2.9 Overlapping Sets

When two sets overlap, the overlapping portion will include the common points
between the two sets.
Example 14: With the help of Venn diagram show the common points in
overlapping portion of the given sets:
Where, C = {0, 2, 3, 4}
And, A = {2, 4, 6}
Solution: The following Venn diagram shows the common points 2, 4 in the
overlapping position.
C A
2
0
6
4
3
Self-Instructional
8 Material
1.2.10 Membership of a Set Set Theory
If an element x belongs to a set A, then it is written as x ∈ A.

Read as, x is an element of A.
NOTES
If an element x does not belong to a set A, then it is written as x ∉ A.
Hence, x is not an element of A.
If an element x belongs to A it does not mean that the set containing x belongs to A.
x ∈ X does not mean {x} ∈ X
x ∈ C, x ∉ D means that x belongs to C but not to D
x ∈ P, x ∈ Q means that x belongs to P and also to Q.
x ∉ A, x ∉ B means that x does not belong to A or to B.
For example, in the set X = {x: x2 – 5x + 6 = 0}, 2 ∈ X, 3 ∈ X
 2, 3 are solutions of,
x2 – 5x + 6 = 0 ∴ X = {2, 3}.
Check Your Progress

1. Define a set. What are elements of a set?
2. What do you understand by Roster form?
3. Define null set or empty set.
4. What do you mean by equality of sets?
5. Define a finite set.
6. Define an infinite set.
1.3 SUBSET OF SETS
Set A is called a subset of B if all elements of A are also the elements of B. It is

denoted as given below:
A ⊆B
In other words it can be said that A = B if and only if A ⊆ B and B ⊆ A.
Further, if A ⊆ B but A ≠ B then A is called to be a proper subset of B.
Written as A ⊂ B. The relations subset and proper subset is also called inclusion
and proper inclusion respectively.
A ⊂ Β can also be written as B ⊃ A and read as B is a superset of A or B
contains A.
It may be noted that Φ is a subset of all sets. As also each set is subset of
itself. Self-Instructional
Material 9
Set Theory Example 1 Set A = {2, 4, 6} ⊆ of set of even numbers.
Example 2 If R = {a, b, c, d, e}, and S = {b, d} then S ⊆ R
1.3.1 Subsets
NOTES
If from a set you want to select some elements having a special property, it means
you are interested in a subset of the set.
A subset of the set X is a set which consists of some or all of the elements X. The
set Y is a subset of X if and only if every element of Y is an element of X and you
write Y ⊆ X. a ∈ Y implies a ∈ X.
Fig. 1.2 Subset
This is called the inclusion relation. Every element of Y is also an element of X,

i.e., Y is a subset of X or included in X or X is a superset of Y.
A set Y is a proper subset of a set X if and only if Y ⊂ X and Y ≠ X and Y ≠ φ.
Every set is a subset of itself. Thus, X ⊆ X.
The following examples will make the concept clear.
Y = {2, 4, 6, 8, 10} is a subset of X = {1, 2, 3,..., 10}.
V = {a, e, i, o, u} is a subset of the set of English alphabets.
A = {a, b,..., z}.
The set of positive integers is a subset of the set of all real numbers.
If A, B are equal sets, then A ⊂ B and B ⊂ A.
A finite set has a finite subset. An infinite set may have an infinite subset.
If a set Y is not a subset of a set X, then it is written as:
Y ⊄X
Here, the set Y may have some points which are also in X but not all the points of
Y are in X.
If a set Y is a subset of set X, all the elements of Y must be in X. A subset can be
formed by taking a certain number of elements from the given set.
If, Y = {y: 0 ≤ y ≤ 5}
Self-Instructional
10 Material
And, X = {y: 0 ≤ y ≤ 10} Set Theory
Then, Y ⊂X
If, Y = {a, b, c}, X = {a, b, c}
NOTES
Then, Y ⊂ X and X ⊂ Y
Example 15: State whether the following are true or false.
(i) E ⊆ E (ii) φ ⊆ φ (iii) φ ∈ φ
(iv) φ ⊆ E (v) φ ⊂ E (vi) φ = {φ}
(vii) φ ⊆ {φ} (viii) φ ⊆ A (ix) φ = {0}
Solution: (i) T, (ii) T, (iii) F, (iv) T, (v) T, (vi) F, (vii) T, (viii) T, (ix) F
Example 16: If A = {a, b, c}, is A a subset of A?
Solution: Yes
If A = {Money, Banking, Public Finance}
And, B = {x: x = All subjects in Economics}
Then, A ⊆ B.
Also, the empty set is a subset of every set.
Thus, φ ⊆ A for any set A.
It means all elements of φ are elements of A. And φ has no elements at all.
The following examples will make the concept clear:
If A = {2, 4, 6, 8, 10} and B = {Even integers}, then A ⊆ B.
Set {1, 2} is a proper subset of {1, 2, 3}.

If X, Y, Z are sets and X ⊆ Y and Y ⊆ Z, then X ⊆ Z.
Check Your Progress

7. What is a subset?
8. What is a proper subset?
9. Show transitivity of subsets.
1.4 SET OPERATORS

Cardinality of a set A is the number of elements of set A and is denoted as |A|.
Self-Instructional
Material 11
Set Theory 1.4.2 Union of Sets
Union of two sets X & Y is said to be the set of all elements of set X along with all
elements of set Y. It is denoted as ‘U’. X U Y is a set containing all elements that
NOTES belong to set X, or to set Y or to both.
X U Y = { x| x ∈ X or x ∈Y}
Example 17: If A = {2, 4, 7, 8}, B = {5, 7, 8}. Then
A ∪ B = {2, 4, 5, 7, 8}.
It can be seen that for a set X, following is true for union:
(a) X ∪ ϕ = X and
(b) X ∪ X = X
Example 18 A ∪ B = {x: x ∈ A or x ∈ B}
A = {2, 4, 6, 8, 10} and B = {4, 8, 12}
A ∪ B = {2, 4, 6, 8, 10, 12}
Intersection of two sets X and Y is a set of all elements that are common to both
X and Y. It is denoted as ∩.
X ∩ Y = { x| x ∈ X and x ∈ Y}
It may be noted that if sets X and Y do not have any elements in common
then X ∩ Y = Φ.
Example 19: A = {1, f}, B = {1, b, c, d}, C = {a, c, f, 2}.
Then A ∩ B = {1} and (A ∩ B) ∪ C = {1, a, c, 2, f },
It can be seen that for a set X, following is true for intersection:
(a) X ∩ ϕ = ϕ and
(b) X ∩ X = X
Example 20:
(i) A = {x: x is an English alphabet} and B = {x: x is a vowel in English
alphabet}
A ∩ B = {a, e, i, o, u}
(ii) A = {1, 2, 3, 4}, B = {2, 4}
A ∩ B = {2, 4}
(iii) A = {a, b, c}; B = {1, 2, 3, 4}
A ∩ B = {}
Difference of two sets X & Y is the set of all elements that belong to X but do not
belong to Y.
X – Y = { x| x ∈ X, x ∉ Y}
Self-Instructional
12 Material
Example 21: If B = {1, b, c, d}, C = {a, c, f, 2}. Set Theory
Then B – C = {1, b, d} and C – B = { a, f, 2 },

Example 22:
A = {a, b, c, d, e, f, g} and B = {a, b, c, d, h, i, j} NOTES
A – B = {e, f, g} and B – A = {h, i, j} [Note that A – B ≠ B – A]
Complement of a set X in the Universal set U is defined as a set of all elements that
belong to U but do not belong to X.
Example 23: Let U = {a, b, c, d, e, f , g}, and A = {b, c}, B = {a, b, c, e}, then
Ac = {a, d, e, f, g} and Bc = {d, f, g}
Example 24: Ac ={x | x ∈ µ and x ∉ A}
µ = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
A = {1, 3, 5, 7, 9}, B = {2, 4, 6, 8, 10}, C = {3, 6, 9}
Ac = µ\A = {2, 4, 6, 8, 10}
Bc = µ\B = {1, 3, 5, 7, 9}
Cc = µ\C = {1, 2, 4, 5, 7, 8, 10}
Example 25: Let A and B be two sets. Then,
(i) (A ∩ B)c = Ac ∪ Bc
(ii) (A ∩ B)c = Ac ∪ Bc
Solution:
(i) Let x ∈ (A ∩ B)c
⇒x ∉A∩B
⇒ x ∉ A and x ∉ B
⇒ x ∈ Ac or x ∈ Bc
⇒ x ∈ Ac ∪ Bc
∴ (A ∩ B)c ⊆ Ac ∪ Bc ...(1)
(ii) Now, let y ∈ Ac ∪ Bc
⇒ y ∈ Ac or y ∈ Bc
⇒ y ∉ A and y ∉ B
⇒y∉A∩B
⇒ y ∈ (A ∩ B)c
⇒ Ac ∩ Bc ⊆ (Α ∪ B)c ...(2)
From Equations (1) and (2), (Α ∩ B)c = Ac ∪ Bc.
Similary, we can prove that the other identity (Α ∪ B)c = Ac ∩ Bc.
Self-Instructional
Material 13
Set Theory Set Identities
Table 1.1 represents the set identities.
Table 1.1 Set Identities
NOTES Identity Law
A ∪ φ = A, where φ = Null set Identity laws
A ∪ µ = A, where µ = Universal set
A ∪ µ =µ Domination laws
A ∪ φ =φ
A ∪ A =A Idempotent laws
A ∩ A =A
(Ac)c = A Complementation law
A∪B=B∪A Commutative laws
A∩B=B∩A
A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C) Distributive laws
A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ B)
(A ∩ B)c = Ac ∪ Bc De Morgan’s laws
(A ∪ B)c = Ac ∩ Bc
1.4.6 Venn Diagram

A diagrammatic representation of set operation is called Venn diagram. Now
You will learn how to represent every operation of sets as a Venn diagram.
Square or rectangle represents an universal set and circle or ellipse represent
sets.
Square or rectangle represents an universal set and circle or ellipse represent
sets.
Fig. 1.3 Set Operation on Venn Diagram
Self-Instructional
14 Material
1.4.7 Minset and Maxset Set Theory
Let U be a universal set and {A1, A2, …, An} be a set of subsets of U. Then,
the set of the form B1 ∩ B2 ∩…∩ Bn where Ai may be either the set Bi or its
complement Aci, is called a minset generated by Ai’s for all i.
NOTES
For example, let A1= {2, 5, 7} and A2 = {2, 4, 5} be two subsets of the set
U = {2, 3, 4, 5, 6, 7}. The set A may be partitioned as shown below:
B1 = A1 ∩ A′2 = {2, 5, 7} ∩ {3, 6, 7} = {7}
Similarly,
B2 = A1 ∩ A2
= {2, 5, 7} ∩ {2, 4, 5} = {2, 5}
B3 = Ac1 ∩ A2 = {3, 4, 6} ∩ {2, 4, 5) = {4}
B4 = Ac1 ∩ Ac2 = {3, 4, 6} ∩ {3, 6, 7} = {3, 6}
The following figure shows that none of the sets B1, B2, B3 and B4 contains
common elements and hence the set generated by A1 and A2 is the partition of
the set U.
Fig. 1.4 Minset on Venn Diagram

In the above Venn diagram the minsets of U are represented.
If union is used instead of intersection a maxset is defined.
B1 = A1 ∪ AC2 = {2, 5, 7} ∩ {3, 6, 7} = {2, 3, 5, 6, 7}
B2 = A1 ∪ A2 = {2, 5, 7} ∪ {2, 4, 5} = {2, 4, 5, 7}
B3 = A1C ∪ A2 = {3, 4, 6} ∪ {2, 4, 5} = {2, 3, 4, 5, 6}
And, B4 = A1C ∪ AC2 = {3, 4, 6} ∪ {3, 6, 7} = {3, 4, 6, 7}
Check Your Progress

10. What is meant by cardinality of a set?
11. What is union of sets?
12. How the two sets can be different?
13. Define complement of a set.
14. What is are disjoint sets?
Self-Instructional
Material 15
Set Theory
1.5 PROPERTIES OF SET OPERATIONS
Important laws of sets are listed as follows:

NOTES 1.5.1 Commutative
Union and intersection of sets are commutative. In other words, for any sets
x and y
X∪Y=Y∪X
X ∩Y=Y∩X
1.5.2 Associative
Union and intersection of sets are associative. It implies that, for any three
sets x, y, z
X ∪ (Y ∪ Z ) = (X ∪ Y) ∪ Z
X ∩ (Y ∩ Z ) = (X ∩ Y) ∩ Z
1.5.3 Identity
The identity under set union is the empty set Φ and the identity under intersection
is the universal set U.
X∪Φ=Φ U X=X
Y ∩ U = U ∩ Y = Y (note U denotes universal set)
1.5.4 Distributive
The union operation is distributive over intersection and intersection operation is
distributive over union.
X ∩ (Y ∪ Z ) = (X ∩ Y) ∪ (X ∩ Z )
X ∪ (Y ∩ Z ) = (X ∪ Y) ∩ (X ∪ TZ)
DeMorgan’s laws state that:
(a) (X ∪ Y)c = Xc ∩ Yc. (b) (X ∩ Y)c = Xc ∪ Yc.
Cartesian product of two sets R and S is the set
R×S = {(r, s) : (r ∈ R) and (s ∈ S)}.
For any set X,
X ∪ X = X and X ∩ X = X
Self-Instructional
16 Material
It needs to be noted that the Cartesian product of two sets results into a set. Set Theory
Elements of this set are ordered pairs, the first component of which is an element
of the first set (in this case R) and second component is an element of second set
(in this case S).
NOTES
Example 26: If A = {1,2,3}and B ={a, b}, then
A × B = {(1,a),(1,b),(2,a), (2,b), (3,a), (3,b)}.
Example 27: Let A, B, C be any three sets. Prove that,
A ∩ (B – C) = ( A ∩ B) – (A ∩ C).
Solution: (A ∩ B) – (A ∩ C) = (A ∩ B) ∩ (A ∩ C)′
= (A ∩ B) ∩ (A′ ∪ C′)(By De Morgan’s law)
= [(A ∩ B) ∩ A′] ∪ [(A ∩ B) ∩ C′] (By Distributive law)
≡ [(A ∩ A′) ∩ B] ∪ [(A ∩ B) ∩ C′] (By Associative law)
≡ [φ ∩ B] ∪ [A ∩ (B ∩ C′)]
≡ φ ∪ [A ∩ (B ∩ C′)]
≡ A ∩ (B ∩ C′)
≡ A ∩ (B – C).
Example 28: For any sets A and B, show that
(A – B) ∪ (B – A) = (A ∪ B) – (A ∩ B).
Solution: (A ∪ B) – (A ∩ B) = (A ∪ B) ∩ (A ∩ B)′
= (A ∪ B) ∩ (A′ ∪ B′) (By De Morgan’s Law)
= [(A ∪ B) ∩ A′] ∪ [(A ∪ B) ∩ B′] (By Distributive Law)
= [(A ∩ A′) ∪ (B ∩ A′)] ∪ [(A ∩ B′) ∪ (B ∩ B′)]
= [φ ∪ (B ∩ A′)] ∪ [(A ∩ B′) ∪ φ]
= (B ∩ A′) ∪ (A ∩ B′)
= (B – A) ∪ (A – B)
= (A – B) ∪ (B – A). (By Commutative Law)
Check Your Progress

15. What is the identity under set union?
16. State DeMorgan's law.
17. What is the law of idempotence?
1.6 APPLICATIONS OF SET THEORY
Set theory has applications in different branches of mathematics. This is so because

set theory is very general; rather abstract in nature. In analysis of mathematical
functions, understanding of limit points and concepts of continuity are based on
set theory. Boolean algebra can be viewed as algebric treatment of set operations.
Intersection, union and difference correspond to logical operations AND, OR and Self-Instructional
Material 17
Set Theory NOT, respectively. These logical operations are switching operations on which
entire logic circuits are based.
You also find application of set theory in principle of counting. Sum rule and
product rule are expressed in set theoretic notations. When two tasks cannot be
NOTES
performed simultaneously and a task is performed in n1 ways which is a set A
having n1 elements (ways of doing tasks), and independent of that another task is
performed in n2 ways which is a set containing n2 elements (way of doing tasks),
then both the tasks can be performed in n1+ n2 ways. Performing both the tasks
can be given in set theoretic notation as follows:
n(A ∪ B) = n(A) + n(B). Here, n(A) = n1 and n(B) = n2.
Similarly, product rule can also be given a set theoretic presentation. If a
task can be performed in n1 ways, and independent of this task, the second task
can be performed in n2 ways, so that these two tasks, when combined, can be
performed in n1n2 ways. In set theoretical notation, the rule of product can be
interpreted as follows:
n(A × B) = n(A) × n(B)
Where, n (A) (= n1) and n (B) (= n2) denotes the number of elements in the
sets A and B respectively which denotes ways of performing tasks. Set oriented
operations are also found in probability. Relation between elements of one set to
another is dealt in defining relations and functions. We know that relation is a
subset of Cartesian product of two sets. On the concept of relation design of
databases are based. A relational database has concept of Cartesian product in its
design. A database is a collection of records, having n-tuples and each tuple has a
number of fields. A database of employees records is made up of fields containing
name, empnumber, department and salary. Here, employees records are
represented as 4-tuples of the form (EMPNAME, EMPNUMBER, DEPT,
SALARY).
Consider an example of three such records.
(RAM, P001, PURCHASE, 10000)
(RAJA, M002, MARKETING, 12000)
(ASHA, G001, FRONTOFFICE, 7000)
In database, a table is a relation. An n-ary relation among the sets A1, A2,
..., An is known as table on these sets that is known as domain of the table. Primary
key is given a domain in which two n-tuples in a relation do not have same value
and in that case combinations of these domains too, in an n-ary relation, provide
unique identification for n-tuples. Cartesian product in domains of such a relation
is known as a composite key.
In general, there are many operations on such relations forming new relations.
Two important operations (i) Join and (ii) Projection are used in relational
databases. The join operation combines two tables having same domains, i.e.,
Self-Instructional
18 Material
same identical fields. The projection operations form new relations by deletion of Set Theory
same domains in each record of the relation.

The concept of sets finds its use in error detection in the field of computer
science. In hamming code this concept is used. This code can be discussed in brief
NOTES
with the help of Venn diagrams. Just to explain the concept you take only 4 bits of
data. Figure 1.1 shows the Venn diagrams having data bits, filled in the intersecting
inner compartments. Parity bits are filled for these four data bit. You use even
parity bit and hence, add parity bits in way that the total number of l’s in a circle is
even. This is shown in (b) part of Figure 1.1. In the three intersecting circle, each
circle have even number of l’s.
1 0
0 0
1 1
0 1
0 1
(a) (b)
1 0 1 0
0 0
1 1
0 0 0
0
0 0 Error correction by
complementing 0 to 1
One bit in error when transmitted (d)
(c)
Fig. 1.5 Venn Diagrams with Data Bits
When data is transferred an error has occurred which is shown in (c) part of
the figure. It is noted that error has occurred in data bit and no other bit has
been affected. To detect an error, numbers of 1’s are noted. In the figures
above, it is noted that there is an error of one bit as shown in the part (d) of
the figure and this is corrected. Much complex analysis is performed and these
are all based on set theoretic concept.
The following examples will help you understand the applications of set theory.
If A is a finite set, then you shall denote the number of elements in A by
n(A). If A and B are two finite sets, then it is very clear from the Venn diagram of
A – B that,
Self-Instructional
Material 19
Set Theory n(A – B) = n(A) – n(B ∩ A)
Suppose A and B are two finite sets such that A ∩ B = φ. Then clearly, the
number of elements in A ∪ B is the sum of number of elements in A and B the
number of elements in B.
NOTES
i.e., n(A ∪ B) = n(A) + n(B) if A ∩ B = φ
To find the number of elements in A ∪ B, in case A ∩ B ≠ φ, you have to
proceed as follows:
You know that for any two sets A and B
A ∪ B = A ∪ (B – A)
Here, A ∩ (B – A) = φ
Therefore, n(A ∪ B) = n(A) + n(B – A)
= n(A) + n(B) –n(A ∩ B)
Note: From the definition of empty set, it follows that n(φ) = 0.
So, the following has been proved.
‘If A and B are two finite sets, then
n(A ∪ B) = n(A) + n (B) –n(A ∩ B)
Similarly, if A, B, C are three finite sets, then
n(A ∪ B ∪ C) = n(A ∪ B) + n(C) – n[(A ∪ B) ∩ C]
= n(A) + n(B) – n(A ∩ B) + n(C) – n[(A ∪ B) ∩ C]
= n(A) + n(B) + n (C) – n(A ∩ B) –n[(A ∩ C) ∪ (B ∩ C)]
= n(A) + n(B) + n(C) – n(A ∩ B) – [n (A ∩ C)
+ n(B ∩ C) – n[(A ∩ C) ∩ (B ∩ C )]
= n(A) + n(B) + n(C) – n(A ∩ B) –n(A ∩ C) – n(B ∩ C)
+ n(A ∩ B ∩ C) as A ∩ C ∩ B ∩ C = A ∩ B ∩ C
Now you can use these two results in the following problems.
Example 29: In a recent survey of 400 students in a school, 100 were listed as
smokers and 150 as chewers of gum; 75 were listed as both smokers and gum
chewers. Find out how many students are neither smokers nor gum chewers.
Solution: Let U be the set of students questioned. Let A be the set of smokers,
and B the set of gum chewers.
Then, n(U) = 400, n(A) = 100, n(B) = 150, n(A ∩ B) = 75
We want to find out n(A′ ∩ B′)
Now, A′ ∩ B′ = (A ∪ B)′ = U – (A ∪ B)
Therefore,
n(A′ ∩ B′) = n [U – (A ∪ B)]
= n(U) – n[A ∪ B) ∩ U]
= n(U) – n(A ∪ B)
= n(U) – n(A) – n(B) + n(A ∩ B)
Self-Instructional
20 Material
= 400 – 100 – 150 + 75 Set Theory
= 225
Example 30: Out of 500 car owners investigated, 400 owned Fiat cars and 200
owned Ambassador cars; 50 owned both Fiat and Ambassador cars. Is this data NOTES
correct?
Solution: Let U be the set of car owners investigated. Let A be the set of those
persons who own Fiat cars, B the set of persons who own Ambassador cars; then
A ∩ B is the set of persons who own both Fiat and Ambassador cars.
n(U) = 500, n(A) = 400, n(B) = 200, n(A ∩ B) = 50
Therefore, n(A ∪ B) = n(A) + n(B) – n(A ∩ B)
= 400 + 200 – 50
= 550
This exceeds the total number of car-owners investigated.
So, the given data is not correct.
Example 31: In a certain government office there are 400 employees. There are
150 men, 276 university graduates, 212 married persons, 94 male university
graduates, 151 married university graduates, 119 married men and 72 married
male university graduates. Find the number of single women who are not university
graduates.
Solution: Let, U = Set of employees
A = Set of men
B = Set of married persons
C = Set of university graduates
Then, A ∩ B = Set of married men
A ∩ C = Set of male university graduates
B ∩ C = Set of married university graduates
A ∩ B ∩ C = Set of married male university graduates
Now n(U) = 400, n(A) = 150, n(B) = 212, n(C) = 276, n(A ∩ B) = 119,
n(A ∩ C) = 94, n(B ∩ C) = 151, n(A ∩ B ∩ C) = 72
You have to find out n(A′ ∩ B′ ∩ C′)
Now, (A′ ∩ B′ ∩ C′) = (A ∪ B ∪ C)′ = U – (A ∪ B ∪ C)
Therefore,
n(A′ ∩ B′ ∩ C′) = n(U) – n[(A ∪ B ∪ C) ∩ U]
= n(U) – n[A ∪ B ∪ C]
= n(U) – [n(A) + n(B) + n(C) – n(A ∩ B) – n(A ∩ C)
– n(B ∩ C) + n(A ∩ B ∩ C)]
= 764 – 710 = 54.
So, the number of single women who are not university graduates is 54.
Self-Instructional
Material 21
Set Theory Example 32: A market research group conducted a survey of 1000 consumers
and reported that 720 consumers liked product A and 450 consumers liked product
B. What is the least number that must have liked both products?
Solution: Let, U = Set of consumers questioned
NOTES
S = Set of consumers who liked product A
T = Set of consumers who liked product B
Then, S ∩ T = Set of consumers who liked both products
Now, n(U) = 1000, n(S) = 720, n(T) = 450
Therefore, n(S ∪ T) = n(S) + n(T) – n(S ∩ T)
= 1170 – n(S ∩ T)
So, n(S ∩ T) = 1170 – n(S ∪ T)
Now, n(S ∩ T) is least when n(S ∪ T) is maximum. But S ∪ T ⊆ U implies that
n(S ∪ T) ≤ n(U)
This implies maximum value of n( S ∪ T) is 1000.
So, least value of n(S ∩ T) = 170.
Hence, the least number of consumers who liked both products is 170.
Example 33: Out of 1000 students who appeared for C.A. Intermediate
Examination, 750 failed in Maths, 600 failed in Accounts and 600 failed in Costing,
450 failed in both Maths and Accounts, 400 failed in both Maths and Costing,
150 failed in both Accounts and Costing. The students who failed in all the three
subjects were 75. Prove that the above data is not correct.
Solution: Let, U = Set of students who appeared in the examination
A = Set of students who failed in Maths
B = Set of students who failed in Accounts
C = Set of students who failed in Costing
Then, A ∩ B = Set of students who failed in Maths and Accounts
B ∩ C = Set of students who failed in Accounts and Costing
A ∩ C = Set of students who failed in Maths and Costing
A ∩ B ∩ C = Set of students who failed in all three subjects
Now, n(U) = 1000, n(A) = 750, n(B) = 600 n(C) = 600, n(A ∩ B) = 450,
n(B ∩ C) = 150, n(A ∩ C) = 400, n(A ∩ B ∩ C) = 75.
Therefore, n(A ∪ B ∪ C) = 750 + 600 + 600 – 450 – 150 – 400 + 75
= 1025.
This exceeds the total number of students who appeared in the examination.
Hence, the given data is not correct.
Example 34: In a survey of 100 families, the number that read recent issues of a
certain monthly magazine were found to be: September only 18, September but
not August 23; September and July 8; September 26; July 48; July and August 8;
none of the three months 24. With the help of set theory, find
Self-Instructional
22 Material
(i) How many read August issue? Set Theory
(ii) How many read two Consecutive issues?

(iii) How many read the July issue, if and only if they did not read the August
issue?
NOTES
(iv) How many read the September and August issues but not the July issue?
Solution: Let, A = Set of those families that read the September issue
B = Set of those families that read the August issue
C = Set of those families that read the July issue
Then, A – B = Set of those families that read September issue but not
August
A ∩ C = Set of those families that read both September and July issue
A ∩ B = Set of those families that read both September and August
issue
A′ ∩ B′ ∩ C′ = Set of those families that read none
A – (B ∪ C) = Set of those families that read September issue only
Now n(A) = 26, n(B) = 8, n(C) = 48, n(A – B) = 23, n(A ∩ C) = 8,
n(B ∩ C) = 8, n(A′ ∩ B′ ∩ C′) = 24, n[A – (B ∪ C)] = 18
Now, n(A – B) = n(A) – n(A ∩ B)
So, 23 = 26 – n(A ∩ B)
Therefore, n(A ∩ B) = 3.
Again, n[A – (B ∪ C)] = n(A) – n[A ∩ (B ∪ C)]
So, 18 = 26 – n[(A ∩ B) ∪ (A ∩ C)]
= 26 – n(A ∩ B) – n(A ∩ C) + n(A ∩ B ∩ C)
= 26 – 3 – 8 + n(A ∩ B ∩ C)
Therefore, n(A ∩ B ∩ C) = 3
Also A′ ∩ B′ ∩ C′ = (A ∪ B ∪ C)′
= U – (A ∪ B ∪ C)
Where, U = Set of those families that are questioned and n(U) = 100.
So, n(A′ ∩ B′ ∩ C′) = n(U) – n(A ∪ B ∪ C)
24 = 100 – n(A ∪ B ∪ C)
Therefore, n(A ∪ B ∪ C) = 76.
Now, n(A ∪ B ∪ C) = n(A) + n(B) + n(C) –n(A ∩ B) – n(A ∩ C)
– n(B ∩ C) + n(A ∩ B ∩ C)
This implies that, 76 = 26 + n(B) + 48 – 3 – 8 – 8 + 3
So, n (B) = 18
This gives the number of families that read the August issue.
Now, (A ∩ B) ∪ (B ∩ C) = Set of those families that read two consecutive
issues.
Self-Instructional
Material 23
Set Theory So, n[(A ∩ B) ∪ (B ∩ C)] = n(A ∩ B) + n(B ∩ C) – n(A ∩ B ∩ C)
= 3 + 8 – 3 = 8.
Again C – B = Set of those families that read the July issue but not the August
issue.
NOTES
Then, n(C – B) = n(C) – n(B ∩ C)
= 48 – 8 = 40.
Now, (A ∩ B) – C = Set of those families that read the September and August
issues but not July.
So, n[(A ∩ B) – C] = n(A ∩ B) – n(A ∩ B ∩ C)
=3–3=0
Therefore, (A ∩ B) – C = φ.
Hence, there is no family that read both the September and August issue but
not the July issue.
Example 35: A factory inspector examined the defects in hardness, finish and
dimensions of an item. After examining 100 items he gave the following report:
All three defects 5, defects in hardness and finish 10, defects in dimension and
finish 8, defects in dimension and hardness 20. Defects in finish 30, in hardness
23, in dimension 50. The inspector was fined. Why?
Solution: Suppose H represents the set of items which have defect in hardness, F
represents the set of items which have defect in finish and D represents the set of
items which have defect in dimension.
Then, n(H ∩ F ∩ D) = 5, n(H ∩ F) = 10, n(D ∩ F) = 8
n( D ∩ H) = 20, n(F) = 30, n(H) = 23, n(D) = 50
So, n(H ∪ F ∪ D) = 30 + 23 + 50 –20 – 10 – 8 + 5 = 70
Now, n(D ∪ F) = n(D) + n(F) – n(D ∩ F)
= 50 + 30 – 8 = 72
D ∪ F ⊆ D ∪ F ∪ H implies n(D ∪ F) ≤ n(D ∪ F ∪ H) i.e., 72 ≤ 70.
Hence, there is an error in the report and for this reason inspector was fined.
Example 36: In a survey of 100 families the numbers that read the most recent
issues of various magazines were found to be as follows:
Readers Digest 28
Readers Digest and Science Today 8
Science Today 30
Readers Digest and Caravan 10
Caravan 42
Science Today and Caravan 5
All the three Magazines 3
Using set theory, find
(i) How many read none of the three magazines?
Self-Instructional
24 Material
(ii) How many read Caravan as their only magazine? Set Theory
(iii) How many read Science Today if and only if they read Caravan?
Solution: Let, S = Set of those families that read Science Today
R = Set of those families that read Readers Digest NOTES
C = Set of those families that read Caravan.
(i)You have to find n(S′ ∩ R′ ∩ C′)
Let U = Set of the families questioned.
Now, S′ ∩ R′ ∩ C′ = (S ∪ R ∪ C)′
= U – (S ∪ R ∪ C)
Therefore, n(S′ ∩ R′ ∩ C′)= n(U) – n(S ∪ R ∪ C)
= 100 – n(S ∪ R ∪ C)
Now, n(S ∪ R ∪ C) = 30 + 28 + 42 – 8 – 10 –5 + 3 = 80.
So, n(S′ ∩ R′ ∩ C′) = 100 – 80 = 20.
(ii) You have to find n[C – (R ∪ S)]
Now, n[C – (R ∪ S)] = n(C) – n[C ∩ (R ∪ S)]
= n(C) – n[(C ∩ R) ∪ (C ∩ S)]
= n(C) – n(C ∩ R) – n(C ∩ S) + n(C ∩ R ∩ S)
= 42 – 10 – 5 + 3
= 30.
(iii) You have to find n[(S ∩ C) – R]
Now, n[(S ∩ C) – R] = n(S ∩ C) – n(S ∩ C ∩ R)
= 5 – 3 = 2.
Example 37: In a survey conducted of women it was found that:
(i) There are more single than married women in South Delhi.
(ii) There are more married women who own cars than unmarried women
without them.
(iii) There are fewer single women who own cars and homes than married
women without cars and without homes.
Is the number of single women who own cars and do not own homes greater
than number of married women who do not own cars but own homes?
Solution: Let, A = Set of married women
B = Set of women who own cars
C = Set of women who own homes
Then, the given conditions are:
(i) n(A′) > n (A)
(ii) n(A ∩ B) > (A′ ∩ B′)
(iii) n(A ∩ B′ ∩ C′) > n( A′ ∩ B ∩ C)
We want to find n(A′ ∩ B ∩ C′) and n(A ∩ B′ ∩ C)
Self-Instructional
Material 25
Set Theory Let U = Set of all women questioned.
Now, A′ = A′ ∩ U = A′ ∩ (B ∪ B′) = (A′ ∩ B) ∪ (A′ ∩ B′)
A = A ∩ U = A ∩ (B ∪ B′) = (A′ ∩ B) ∪ (A ∩ B′)
NOTES So, n(A′) = n(A′ ∩ B) + n(A′ ∩ B′)
n(A) = n(A ∩ B) + n(A ∩ B′).
By condition (i), we have:
n(A′ ∩ B) + (A′ ∩ B′) > n(A ∩ B) + n (A ∩ B′)
And by the condition (ii), we have:
n(A′ ∩ B) + n (A′ ∩ B′) > n(A ∩ B) + n(A ∩ B′) > n(A′ ∩ B′) + n(A ∩ B′)
Therefore,
n(A′ ∩ B) > n (A ∩ B′).
Also, A′ ∩ B = (A′ ∩ B) ∩ (C ∩ C′)
= (A′ ∩ B ∩ C) ∪ (A′ ∩ B ∩ C′).
And, A ∩ B′ = (A ∩ B′) ∩ ( C ∪ C′)
= (A ∩ B′ ∩ C) ∪ (A ∩ B′ ∩ C′)
So, n(A′ ∩ B) = n(A′ ∩ B ∩ C) + n(A′ ∩ B ∩ C′).
n(A ∩ B′) = n(A ∩ B′ ∩ C) + n(A ∩ B′ ∩ C′).
This gives, using the condition (iii),
n(A ∩ B ∩ C) + n(A′ ∩ B ∩ C′) > n(A ∩ B′ ∩ C ) + n(A′ ∩ B ∩ C)
i.e., n(A′ ∩ B ∩ C′) > n(A ∩ B′ ∩ C).
So, the number of single women who own cars and do not own a home is
greater than the number of married women who do not own cars but own homes.
1.7 RELATION OF SETS
The concept of relation is studied between the elements of two sets. If A and B
are two sets which are not empty(non-void) sets, then the relation R from set A to
set B is represented as a R b, where a represents elements belonging to set A and
b represents elements of set B.
It may be noted that the any relation from set A to set B is a subset of the
Cartesian product of sets A and B.
It may be concluded from above that Relation from set A to set B can be
defined as a set of ordered pairs (a, b) where a represents some elements belonging
to set A and b elements of set B conforming to a rule.
Example 38
Consider set A and B as
A = {1, 2, 3}
B = {a,b,c}
Self-Instructional
26 Material
Then one of the relations between Set A and B from A to B can be: Set Theory
aRb = {(1,a),(1,c), (3,a), (3,c)}

It can be seen that it is a subset of AxB and it can also be depicted as given below:
A B
NOTES
1 a
2 b
3 c
Let us consider a different example

Example 39: A = {1, 2, 3} and B = {1, 2, 3, 4, 5, 6, 7, 8, 9}.
Let us now state a relation between set A and B as those elements of B
which are squares of elements of A; i.e. :
R = {(a,b): where b is square of a and a ∈ A & b ∈ B}. Then R is a set
which has following elements
R = {(1,1), (2,4), (3,9)}
Therefore, it can be concluded that Relation is a linear operation which
establishes relationship between the elements of two set’s in accordance with a
specific rule.
R : {(a, b) | (a, b) ∈ A x B and a R b}
Similarly it can be discussed that a relation R(A, A) is a relation between set A
with itself. In order to explain the concept, consider a set H comprising of all human
beings as its elements. A set of sons and fathers would be a relation of H on H.
Let A and B be two sets containing m and n number of elements respectively. Then
AxB contains m x n elements. Since a relation of A on B is a subset of AxB, we
can say that the number of subsets of AxB is
R1mn + R2mn + R3mn + ………..+ Rmnmn = 2mn - 1
Therefore, for A = {1, 2, 3) & B = {x, y}, the number of non-empty subsets or
maximum number of relations is equal to (26-1) = 63.
There is a very important relation called Equivalence relation. Equivalence relation
R on set A will have following three properties:-
(a) Reflexivity: A relation on a set A is reflexive if (x, x) ∈ R for all x ∈ A, i.e.
xRx for every x in A.
Self-Instructional
Material 27
Set Theory (b) Symmetry: A relation R is symmetric if whenever (x, y) ∈ R then (y, x) ∈
R, i.e. xRy then yRx for every x & y belonging to A.
(c) Transitivity: A relation is transitive if whenever (x, y) ∈ R and (y, z) ∈ R
then (x, z) ∈ R, i.e. if xRy and yRz then xRz.
NOTES
Example 40: The relation “is equal to” is an equivalence relation on the set of real
numbers since for any x,y,z ∈ R:
(a) x = x (Reflexivity)
(b) If x = y, then y = z (Symmetry)
(c) If x = y and y = z, then x = z (Transitivity).
Example 41: The relation “is greater than or equal to”, is Not an equivalence
relation on the set of real numbers since for any x,y,z R:-
(a) x ≥ x (Reflexivity)
(b) If x ≥ y then it is not necessary that y ≥ x (Symmetry not true).
(c) If x ≥ y and y ≥ z, then x ≥ z (Transitivity is true).
Since e” relation is not symmetrical it is not an equivalence relation.
Commonly used symbol for denoting equivalence relation is ~. The three properties
of equivalence relation can be writtens as given below using this notation:-
(a) x ~ x for all x belonging to A.
(b) If x ~ y then y ~ x.
(c) If x ~ y and y ~ z then x ~ z.
Now it can be stated that for an equivalence relation ~ on set A, we can define an
Equivalence Class ‘E’ for an element ‘a’ belonging to A as:-
E = {b | b ~ a}.
That is a set E of all elements are b which are related to a by the relation ~.
It is to be noted that the equivalence class E for the element ‘a’ contains ‘a’
since a ~ a.
Theorem 1: Two equivalence classes E1 and E2 are either equal or disjoint.
Proof: Let E1 be the equivalence class of element x1, and let E2 be the equivalence
class determined by x2. In order to prove that they are either disjoint or equal, let
us start by saying that they are not disjoint. Let them have a common element y.
Now, since y belongs to E1 and E2 both:-
y ~ x1 and y ~ x2.
By application of the property of symmetry we can conclude that
x1 ~ y and x2 ~ y.
Self-Instructional
28 Material
Application of property of transitivity we can conclude that Set Theory
x1 ~ x2.
Now let y be an elemnet of E1. It implies that y ~ x1. By application of property of
transitivity it can be stated that y ~ x2. Therefore, it can be concluded that E1 is a NOTES
subset of E2 and E2 is a subset of E1. Therefore
E1 = E2. Hence proved.
1.7.4 Partitions
A partition of set X is a collection of non-empty subsets of X which are disjoint
and whose union together is complete X. That is collection of subsets X1, X2,
X3...... such that
(a) Xi ≠ φ for i = 1, 2, 3 .......
(b) Xi ∩ Xj= φ for all i ≠ j
(c) X1 ∪ X2 ∪ X3 ∪ ..... = X
It can be noted that a partition, as the name suggests, divides a set X into pieces
and each subset defined above is a partition of the set X.
Theorem 2: The equivalence classes of a relation form a partition of set X.
Proof: Consider an equivalence relation R on X, and we know that equivalence
class cannot be empty and from above definition we know that if
(x,y) ∈ R and then [x]R ∩ [y]R= φ.
Further for an element x ∈ X , it has been shown that x ∈ [x] R. Therefore,
union of all such equivalence classes covers X.
Theorem 3: A partition of a set X forms the equivalence relation (x,y) Î R if and
only if there is an i such that x,y Î Xi.
Proof of the theorem is left for the reader to prove as an exercise.
(Hint: Show relation R is reflexive, symmetric, and transitive. The equivalence
classes of this relation are the sets Xi).
Above two theorems combined together indicate that partition of a set
and equivalence classes of the set are same. Therefore:-
(a) Every equivalence relation partitions its set into equivalence classes.
(b) Every partition creates an equivalence relation.
Check Your Progress

18. What do you understand by a domain and range?
19. Define a function. What are codomain and domain?
20. What do you understand by range of a function?
21. What are even and odd functions?
Self-Instructional
Material 29
Set Theory
1.8 FUNCTIONS
Functions are the special types of relations. Functions form a very basic concept
NOTES of set theory because functions are utilised to depict a given problem and solving
the function forms the solution of the problem.
A well defined gives a unique output for each input. Every function is
defined for a set of inputs called its Domain. The domain of a function corresponds
to set of possible outputs called the Range.
A function or mapping from set A to set B is a ‘method’ that pairs elements
of set A with unique elements of set B and you denote f : A → B to indicate
that f is a function from set A to set B.
B is called the codomain of the function f and A is called its domain. Also, for
each element a of A, f defines an element b of B. Write it as a f(a) or
a b, a ∈ A, b ∈ B.
For example,
(i) The relation f = {(1, d), (2, c), (3, a)} from A = {1, 2, 3} to
B = {a, c, d} is a function from A to B. The domain of f is A and the
codomain of f is B.
(ii) The relation f = {(a, b), (a, c), (b, d)} from A = {a, b} to B = {b, c, d}
is not a function.
Range of function: Let f : A → B be a function. The range of the function
R(f)={f (a : a ∈ A}. (Note that R (f ) ⊆ B).
Notes:
1. From above example: R(f ) is {d, c, a},
2. Let f : R → R+ be f(x) = x2 (R+, the set of positive real numbers). Clearly,
f is a function whose domain is the set of real numbers and the co-domain
is the set of positive real numbers.
R( f ) = {x2: x ∈ R} = {1, 4, 9,.....}
Let f : A → B be a function f is said to be:
• One-to-one (1–1) function: If x 1 ≠ x 2 then, f(x 1 )≠ f(x 2 ),
∀ x1, x2 ∈ A.
or
Whenever f(x 1) = f(x2) then, x1 = x2. This function is also known
as injective function.
• Onto surjective function: If for every element y in the codomain
B, atleast one element x in the domain A such that f (x) = Y.
or
If R( f ) = Codomain B.
• Bijective function: If f is both 1–1 and onto function.
Self-Instructional
30 Material
• Constant function: If every element of the domain is mapped to Set Theory
a unique element of the codomain or the codomain consists of only

one element.
• Into function: If atleast one element of the codomain is not mapped
by any element of the domain. NOTES
• Identify function: If f(x) = x, ∀ x ∈ B, in this case A ≤ B.
Sometimes, it is defined as f : A → A and f (x) = x, ∀ x ∈ A.
For examples,
1. Let f : R → R be a function defined as f(x) = 2(x + 2): Clearly,
f is 1 – 1 because if 2(x + 2) = 2 ( y + 2)
⇒ 2x + 4 = 2y + 4
⇒ 2x = 2y ⇒ x = y
∴ f is 1 – 1.
2. Define f : R → R+ by f (x) = ex, ∀ x ∈ R. Clearly, f is 1 – 1 because if
f(x1) = f(x2)
x x
⇒ e1 = e2
⇒ex1 – x2 = 1
⇒x1 – x2 = 0
⇒ x1 = x2
∴ f is 1 – 1.
3. Let A = {5, 6, 7} and B = {a, b}. Then the mapping f : A → B is defined
as f(5) = a; f(6) = b; f(7) = a. Clearly, f is not 1 – 1. But f is onto.
4. Consider the Example (2). If f : R → R+, defined by f(x) = ex is onto.
Let x be any element IR+, then log y ∈ IR such that f(log y) = elog y = y.
5. Define f : Z+ → Z+ as f(n) = n2, ∀ n ∈ Z+. Clearly, f is an into mapping
(not mapped by any element of Z+) and 1 – 1 mapping but f is not onto.
6. Define f : Z → Z by f(n) = n + 1 ∀ n ∈ Z. Clearly, f is 1 – 1 and onto.
For if, (i) f(n) = f(m) ⇒ n + 1, = m + 1 ⇒ n = m ∴ f is 1 – 1.
7. If n is any element of Z, then n – 1 ∈ Z such that f(n – 1) = n – 1 + 1 = n.
Hence f is onto.
Note: A one-one mapping of a set S onto itself is sometimes called a permutation
of the set S.
Even and Odd Functions
If f(x) = f(–x) f is called an even function and if
f(x) = –f(–x) it is called an odd function.
Geometrically, the graph of an even fuction is symmetric with respect
to the y-axis.
Inverse function: Let f be a bijective function from the set A to the set B.
The inverse function of f is the function that is assigned to an element b ∈ B
the unique element a in A such that f(a) = b. The inverse function of f is denoted
by f –1. Hence f –1(b) = a, when f (a) = b (see Figure 1.6). Self-Instructional
Material 31
Set Theory
f
a f b b=f a
NOTES A B
Fig. 1.6 Inverse Function

–1
The function f is the inverse function of f.
Note: A bijective function is called invertible since it can be defined as an inverse
of this function.
Example 42:
(i) Define f : Z → Z by f (n) = n + 1. Is f invertible, and if it is what is its
inverse?
Solution: The function f has an inverse, since it is a bijective function.
Let y be the image of x, so that y = x +1. Then x = y – 1, i.e., y – 1
is the unique element of Z that is sent to y by f. Hence f –1 = y – 1.
(ii) Let A = {a, b, c}, and B = {5, 6, 7}. Define F: A → B as f(a) = 5; f(b)
= 6; f(c) = 7. Is f invertible, and if it is what is its inverse?
Solution: Clearly the given function is bijective. The inverse function
f –1 of f is given as f –1(5) = a; f –1(6) = b; f –1(7) = c.
(iii) Define f : Z → Z by f(x) = x2. Is f invertible?
Solution: Since f(–2) = f(2) = 4, f is not 1–1. If an inverse function
were defined, it would have to assign two elements to 2. Hence f is not
invertible.
Compositions of functions: Let g be a function from the set A to the set B
and let f be a function from the set B to the set C. The composition of the
functions f and g denoted by (f o g) is given in Figure 2.2 in such a way a that:
(f o g) (x) = f(g(x)) ∀ x ∈ A
g f
X
y =g(x) g = f[g)x)]
A B C
g f
fog
Fig. 1.7 Composition of Function

Example 43: Let f : Z → Z be a function defined by f(x) = 2x + 3. Let
g: Z→ Z be a function defined by g(x) = 3x + 2. Find (i) f o g (ii) g o f.
Self-Instructional
32 Material
Solution: Both f o g and g o f are defined. Further, Set Theory
(i) (f o g) (x) = f(g(x)) = f(3x + 2)

= 2(3x + 2) + 3 = 6x + 7
(ii) (g o f) (x) = g(f(x)) = g(2x + 3) NOTES
= 3(2x + 3) + 2 = 6x + 11
Eventhough f o g and g o f are defined, f o g and g o f need not be equal,
i.e., the commutative law does not hold for the composition of functions.
Example 44: Let A = {1, 2, 3}, B = {x, y}, C = {a}. Let f: A → B be
defined by f(1) = x; f(2) = y; f(3) = x. Let g: B → C be defined by g(x) = a;
g(y) = a.
Find (i) f o g, if possible (ii) g o f, if possible.
Solution:
(i) (f o g) (x) = f(g(x)), but f cannot be applied on C and hence f o g is
meaningless.
(ii) (g o f) : A → C is meaningful. Now (g o f) (x) = g(f(x)), ∀ x ∈ A.
∴ (g o f) (1) = g(f(1)) = g(x) = a
(g o f) (2) = g(f(2)) = g(y) = a
(g o f) (3) = g(f(3)) = g(x) = a
Result: If f : A → B, g: B → C and h: C → D, then (h o g) o f = h o (g o f).
Proof: [(h o g) o f] (x) = (h o g) ( f(x))
= h[(g(f(x)] ...(1)
and [h o (g o f)](x) = h[(g o f) (x)]
=h[g(f(x))] ...(2)
From Equations (1) and (2), (h o g) o f = h o (g o f)
Result: Let f : A → B and g : B → C. Then,
(i) g o f is onto, if both f and g are onto.
(ii) g o f is 1 – 1, if both f and g are 1 – 1.
Proof:
(i) Let z ∈ C. Since g : B → C is onto, an element y ∈ B such that g(y) = z.
Since f : A → B is onto, for an element x ∈ B, such that f(x) = y.
∴ (g o f) (x) = g(f(x)) = g(y) = z.
∴ (g o f) is onto.
(ii) Let x1 ≠ x2 be two elements in A. Since f : A → B is one-one, and
f(x1) ≠ (x2), g(f(x1)) = g(f(x2)). Thus, g o f is one-one. In B, since
g: B → C is one-one and f(x1) ≠ (x2).
Self-Instructional
Material 33
Set Theory
1.9 FORMAL LOGIC
Formal logic is a set of rules used in deductions which are self evident. Logic
NOTES assumes something that can be True or False.
One of the main aims of mathematical logic is to provide rules. The rules of logic
give precise meaning to mathematical statements and distinguish between valid
and invalid mathematical arguments. In addition, logic has numerous applications
in computer science. These rules are used in the design of computer circuits,
construction of computer programs, verification of the correctness of programs,
and in many other ways.
Propositions: A proposition is a statement to which only one of the terms, true
or false, can be meaningfully applied.
The value of a proposition if true is denoted by 1and if false is denoted by 0.
Occasionally they are also denoted by the symbols T and F.
The following are propositions:
(i) 4 + 2 = 6
(ii) 4 is an even integer and 5 is not.
(iii) 5 is a prime number.
(iv) New Delhi is the capital of India.
(v) 2 ∈ { 1, 3, 5, 7}
(vi) 42 ≥ 51
(vii) Paris is in England.
Of the above propositions, (i)–(iv) are true whereas (v)–(vii) are false.
The following are not propositions:
(i) Where are you going? (ii) x + 2 = 5
(iii) x + y < z (iv) Beware of dogs
The expressions (i) and (iv) are not propositions since neither is true or false. The
expression (ii) and (iii) are not propositions, since the variables in these expressions
have not been assigned values and hence they are neither true or false.
Note: Letters are used to denote propositions just as letters are used to denote variables.
The conventional letters used for this purpose are p, q, r, s, …

There are several ways in which we commonly combine simple statements into
compound ones. The words or, and, not, if… then and if and only if, can be added
to one or more propositions to create a new proposition. New propositions are
called compound propositions. Logical operators are used to form new propositions
Self-Instructional
34 Material
Set Theory
or compound propositions. These logical operators are also called connectives.
Conjunction (AND): If p and q are propositions, then the proposition ‘p and q’,
denoted by p ∧ q, is true when both p and q are true and is false otherwise. The
proposition p ∧ q is called the conjunction of p and q. NOTES
Example 45: Find the conjunction of the propositions p and q where p is the
proposition ‘Today is Sunday’ and q is the proposition ‘It is raining today’.
Solution: The conjunction of these two propositions is p ∧ q, the proposition,
‘Today is Sunday and it is raining today’.
Example 46: Let p be ‘Ravi is rich’ and let q be ‘Ravi is happy’. Write each of the
following in symbolic form:
(i) Ravi is poor but happy.
(ii) Ravi is neither rich nor happy.
(iii) Ravi is rich and unhappy.
Solution:
(i) ~ p ∧ q (ii) ~ p ∧ ~ q (iii) p ∧ ~ q
Disjunction (OR): If p and q are propositions, then disjunction p or q, denoted
as p ∨ q, is false when p and q are both false and true otherwise. The proposition
p ∨ q is called the disjunction of p and q.
Note that connectives ~ and ∧ defined earlier have the same meaning as the
words ‘not’ and ‘and’ in general. However, the connective ∨ is not always the
same as the word ‘or’ because of the fact that the word ‘or’ in English is commonly
used both as an ‘exclusive or’ and as an ‘inclusive or’. For example, consider the
following statements:
(i) I shall watch the movie on TV or go to cinema.
(ii) There is something wrong with the fan or with the switch.
(iii) Ten or twenty people were killed in the fire today.
In statement (i), the connective ‘or’ is used in the exclusive sense; that is to
say, one or the other possibility exists but not both. In (ii) the intended meaning is
clearly one or the other or both. The connective ‘or’ used in (ii) is the ‘inclusive
or’. In (iii) the ‘or’ is used for indicating an approximate numbr of people, and it
is not used as a connective. From the definition of disjunction it is clear that ∨ is
‘inclusive or’.
Negation (NOT): If p is a proposition, its negation not p is another proposition
called the negation p. The negation of p is denoted by ~ p. The proposition ~ p is
read ‘not p’.
Alternate symbols used in the literature are p, p and ‘not p’.
Note that a negation is called a connective although it only modifies a statement.
In this sense, negation is the only operator that acts on a single proposition.
Self-Instructional
Material 35
Set Theory Example 47: Find the negation of the propositions:
(i) It is cold.
(ii) Today is Sunday.
NOTES (iii) Ravi is poor.
Solution: The negation of the propositions are:
(i) It is not cold.
(ii) Today is not Sunday.
(iii) Ravi is not poor.
Conditional operator (if … then): Let p and q be propositions. The implication
p → q is false when p is true and q is false and true otherwise. In the implication,
p is called the premise or hypothesis and q is called the consequence or conclusion.
Because implications arise in many places in mathematical argument, a wide variety
of terminology is used to express p → q. Some of the more common ways of
expressing this implication are:
(i) p implies q. (ii) if p, then q. (iii) q if p. (iv) p only if q.
(v) p is sufficient for q. (vi) q whenever p. (vii) q is necessary for p.
We shall avoid the word ‘implies’ since it might be used in different contexts.
Example 48: Let p denote ‘It is below freezing’ and let q denote ‘It is snowing’.
Write the following statements in a symbolic form:
(i) If it is below freezing, it is also snowing.
(ii) It is not snowing if it is below freezing.
(iii) It is below freezing is a necessary condition for it to be snowing.
Solution: Recall that p → q can be read ‘if p, then q’ or ‘p only if q’ or ‘q is
necessary for p’. Then (i) p → q (ii) p → ~ q (iii) q → p
Example 49: Let p and q be the propositions, where
p : You drive over 80 kms per hour.
q : You get a speeding ticket.
Write the following propositions in symbolic form:
(i) You will get a speeding ticket if you drive over 80 kms per hour.
(ii) If you do not drive over 80 kms per hour, then you will not get a speeding
ticket.
(iii) Driving over 80 kms per hour is sufficient for getting a speeding ticket.
(iv) Whenever you get a speeding ticket, you are driving over 80 kms per
hour.
Solution: (i) p → q (ii) ~ p → ~ q (iii) p → q (iv) q → p
Biconditional operator (if and only if): Let p and q be propositions. The
biconditional p ↔ q is true when p and q have the same truth values and is false
otherwise.
Self-Instructional
36 Material
Note that the biconditional p ↔ q is true when both the implications p → q and q Set Theory
→ p are true. So ‘p if and only if q’ is used for biconditional. Other common ways
of expressing the proposition p ↔ q or p = q are ‘p is necessary and sufficient for
q’ and ‘if p then q, and conversely’.
NOTES
Each of the following theorems is well known, and each can be symbolized in
the form p ↔ q:
(i) Two lines are parallel if and only if they have the same slope.
(ii) Two triangles are congruent if and only if all three sets of corresponding
sides are congruent.
Example 50: Let p denote ‘He is poor’ and let q denote ‘He is happy’. Write
each of the following statement in symbolic form using p and q:
(i) To be poor is to be unhappy.
(ii) He is rich if and only if he is unhappy.
(iii) Being rich is a necessary and sufficient condition to being happy.
Solution:
(i) p ↔ q (ii) ~ p ↔ q (iii) ~ p ↔ q
Two propositions are logically equivalent or simply equivalent if they have exactly
the same truth values under all circumstances. We can also define this notion as
follows:
The propositions p and q are called logically equivalent if p ↔ q is a tautology..
The equivalence of p and q is denoted by p ⇔ q.
Notes:
1. One way to determine whether two propositions are equivalent is to use a truth table.
In particular, the propositions p and q are logically equivalent if and only if the
columns giving their truth values agree.
2. Whenever we find logically equivalent statements, we can substitute one for another
as we wish, since this action will not change the truth value of any statement.
Self-Instructional
Material 37
Set Theory Table 1.2 Logical Equivalences
Equivalence Name
1. p ⇔ (p ∨ p) Idempotents of ∨
NOTES 2. p ⇔ (p ∧ p) Idempotents of ∧
3. (p ∧ q) ⇔ (q ∨ p) Commutativity of ∨
4. (p ∧ q) ⇔ (q ∧ p) Communtativity of ∧
5. (p ∨ q) ∨ r ⇔ p ∨ (q ∨ r) Associativity of ∨
6. (p ∧ q) ∧ r ⇔ p ∧ (q ∧ r) Associativity of ∧
7. ~ (p ∨ q) ⇔ ~ p ∧ ~ q De Morgan’s law 1
8. ~ (p ∧ q) ⇔ ~ p ∨ ~ q De Morgan’s law 2
9. p ∧ (q ∨ r) ⇔ (p ∧ q) ∨ (p ∧ r) Distributive of ∧ over ∨
10. p ∨ (q ∧ r) ⇔ (p ∨ q) ∧ (p ∨ r) distributive of ∨ over ∧
11. p ∨ 1 ⇔ 1 (Null) or Domination law 1
12. p ∧ 0 ⇔ 0 (Null) or Domination law 2
13. p ∧ 1 ⇔ p Identity law 1
14. p ∨ 0 ⇔ p Identity law 2
15. p ∨ ~ p ⇔ 1 Negation law 1
16. p ∧ ~ p ⇔ 0 Negation law 2
17. ~ (~ p) ⇔ p Double negation law (involution)
18. p → q ⇔ ~ p ∨ q Implication law
19. p ↔ q ⇔ (p → q) ∧ (q → p) Equivalence law
20. (p ∧ q) → r ⇔ p → (q → r) Exportation law
21. (p → q) ∧ (p → ~ q) ⇔ ~ p Absurdity law
22. p → q ⇔ ~ q → ~ p Contrapositive law
23. p ∨ (p ∧ q) ⇔ p Absorption law 1
24. p ∧ (p ∨ q) ⇔ p Absorption law 2
25. p ↔ q ⇔ (p ∧ q) ∨ (~ p ∧ ~ q) Biconditional law
Example 51: Write an equivalent formula for p ∧ (q ↔ r) ∨ (r ↔ p) which does

not contain the biconditional.
Solution: Since p ↔ q ⇔ (p → q) ∧ (q → p), p ∧ ( q ↔ r) ∨ (r ↔ p) ⇔ p ∧ ((
q → r) ∧ (r → q)) ∨ ((r → p) ∧ (p → r))
Example 52: Write an equivalent formula for p ∧ (q ↔ r) which contains neither
the biconditional nor the conditional.
Solution: Since p ↔ q ⇔ (p → q) ∧ (q → p) and p → q ⇔ ~ p ∨ q
p (q r) p ((q r) (r q ))
p ((~ q r) (~ r q))
Self-Instructional
38 Material
Set Theory
Check Your Progress

22. What is a formal logic?
23. What are propositions? NOTES
1.10 ANSWERS TO CHECK YOUR PROGRESS

QUESTIONS
1. A set is a collection or compilation of distinct entities or objects. The objects

which form the set are called the elements of the set.
2. The standard notation to list the elements of a set and denote the set is to
use braces. For example set A having elements x, y & z is written as:
A = {a,b,c}, similarly;
B = {0, 1, 2, 3........} is set of whole numbers;
N = { 1, 2, 3, 4, 5} is a set of first 5 natural numbers.
X = { a, b, Y} is a set with elements a, b and the set Y. In this example Set
Y is an element of set X.
The above way of enumerating a set is called as Roster form.
3. A set that has no elements is called a null set or an empty set.
4. Two sets are said to be equal if they have the same elements. It may be
noted that the order of elements in a set does not matter.
If A = { a, b, c, d, 1, 2, 3} and
B = { 1, a, 2, b, 3, d, c}, then A = B.
5. A set is finite, if it has a finite number of elements. The elements of such a set
can be counted by a finite number. The number of elements in a finite set A
is denoted by n(A). Here n is a finite positive integer.
6. If a set has an infinite number of elements it is an infinite set. The elements of
such a set cannot be counted by a finite number.
7. Set A is called a subset of B if all elements of A are also the elements of B.
It is denoted as given below:
A ⊆B
In other words it can be said that A = B if and only if A ⊆ B and B ⊆ A.
8. A set Y is a proper subset of a set X if and only if Y ⊂ X and Y ≠ X and
Y ≠ φ.
Every set is a subset of itself. Thus, X ⊆ X.
9. If X, Y, Z are sets and X ⊆ Y and Y ⊆ Z, then X ⊆ Z.
Self-Instructional
Material 39
Set Theory 10. Cardinality of a set A is the number of elements of set A and is denoted as
|A|.
11. Union of two sets X & Y is said to be the set of all elements of set X along
NOTES with all elements of set Y. It is denoted as ‘U’. X U Y is a set containing all
elements that belong to set X, or to set Y or to both.
X U Y = { x| x ∈ X or x ∈Y}
12. Difference of two sets X & Y is the set of all elements that belong to X but
do not belong to Y.
X – Y = { x| x ∈ X, x ∉ Y}
13. Complement of a set X in the Universal set U is defined as a set of all
elements that belong to U but do not belong to X.
14. Two sets are said to be disjoint, if AÇB = {}. As in (iii) above.
15. The identity under set union is the empty set F and the identity under
intersection is the universal set U.
X∪Φ=Φ U X=X
Y ∩ U = U ∩ Y = Y (note U denotes universal set)
16. DeMorgan’s laws state that:
(a) (X ∪ Y)c = Xc ∩ Yc. (b) (X ∩ Y)c = Xc ∪ Yc.
17. For any set X,
X ∪ X = X and X ∩ X = X
18. A well defined gives a unique output for each input. Every function is defined
for a set of inputs called its Domain. The domain of a function corresponds
to set of possible outputs called the Range.
19. A function or mapping from set A to set B is a ‘method’ that pairs elements
of set A with unique elements of set B and you denote f : A ® B to indicate
that f is a function from set A to set B.
B is called the codomain of the function f and A is called its domain.
20. Range of function: Let f : A → B be a function. The range of the function
R(f)={f (a : a ∈ A}. (Note that R (f ) ⊆ B).
21. If f(x) = f(–x) f is called an even function and if
f(x) = –f(–x) it is called an odd function.
22. Formal logic is a set of rules used in deductions which are self evident.
Logic assumes something that can be True or False.
23. A proposition is a statement to which only one of the terms, true or false,
can be meaningfully applied.
The value of a proposition if true is denoted by 1and if false is denoted by
0. Occasionally they are also denoted by the symbols T and F.
Self-Instructional
40 Material
Set Theory
1.11 SUMMARY
• A set is a collection or compilation of distinct entities or objects. The objects

which form the set are called the elements of the set. NOTES
• Two sets are said to be equal if they have same elements.
• An empty set Ô is a subset of all sets. As also each set is subset of itself.
• Cardinality of a set A is the number of elements of set A and is denoted
as |A|.
• Complement of a set X in the Universal set U is defined as a set of all
elements that belong to U but do not belong to X.
• Difference of two sets X & Y is the set of all elements that belong to X but
do not belong to Y.
• Union and intersection of sets are distributive and associative.
• The identity under set union is the empty set Ô and the identity under
intersection is the universal set U.
• The union operation is distributive over intersection and intersection operation
is distributive over union.
• Intersection, union and difference correspond to logical operations AND,
OR and NOT, respectively.
• The roster or tabulation method describes a set by listing each element of
the set within the braces.
• A set is well defined if and only if it can be decided that a given object is an
element of the set.
• A diagrammatic representation of set operation is called Venn diagram.
• Relation is a linear operation which establishes relationship between the
elements of two set’s in accordance with a specific rule.
• A relation R on a set A is called an equivalence relation, if R is reflexive,
symmetric and transitive.
• A relation R on a set A is said to be a partial order relation, if R is reflexive,
anti-symmetric and transitive.
• Equivalence relation C on set A is reflexive, symmetric and transitive.
• Two equivalence classes E1 and E2 are either equal or disjoint.
• A partition of set X is a collection of non-empty subsets of X which are
disjoint and whose union together is complete X
• Every equivalence relation partitions its set into equivalence classes.
• Every partition creates an equivalence relation.
Self-Instructional
Material 41
Set Theory • Every function is defined for a set of inputs called its Domain. The domain
of a function corresponds to set of possible outputs called the Range.
• In mathematics, a function is a relation between a set of elements called the
domain and another set of elements called the codomain.
NOTES
• The mathematical function describes the dependence between two quantities.
One of the quantity being known and is termed as the independent variable,
argument of the function, or its ‘input’ while the second quantity is produced
and is termed as the dependent variable, value of the function, or ‘output’.
• The function can be defined in various ways using a formula, by a plot or
graph, by an algorithm that computes it, or by a description of its properties.
• A proposition is a statement to which only one of the terms, true or false,
can be meaningfully applied.
• Logical operators are used to form new propositions or compound
propositions.
1.12 KEYWORDS
• Set: A set is a collection of any type of objects, things or numbers.

• Elements: The constituent members of a set are called elements of the set.
• Roser or tabulation method: It is the method to describe a set in which
each element of the set is enlisted within the braces.
• Finite set: It is the type of set in which there is a finite number of elements.
• Infinite set: It is the type of set in which there is an infinite number of
elements.
• Null set: It is the set which contains no elements.
• Disjoint sets: If two sets have no elements in common, then they are disjoint
sets.
• Universal set: It is the set of all objects relevant to a particular application.
• Equivalent sets: They refer to sets in which there is a one-to-one
correspondence between the elements.
• Domain: In mathematics, the domain (sometimes called the source) of a
given function is the set of ‘input’ values for which the function is defined.
• Codomain: in mathematics, the codomain or target set of a function is the
set Y into which all of the output of the function is constrained to fall. It is the
set Y in the notation f : X ® Y. The codomain is also sometimes referred to
as the range but that term is ambiguous as it may also refer to the image.
• Function: Function is a way of expressing relation between two sets by
use of symbols representing variables and symbols which define operations
on variables.
Self-Instructional
42 Material
• Mathematical function: The mathematical function describes the Set Theory
dependence between two quantities.
1.13 SELF ASSESSMENT QUESTIONS AND NOTES

EXERCISES
Short Answer Questions

1. Define set in minimum words.
2. What is a subset?
3. What is universal set?
4. Mention three basic operations on sets.
5. A set has three elements. How many subsets can it form?
6. What is the resultant set of two sets A and B when these are disjoint?
7. Define the term set equivalent.
8. Draw a Venn diagram of a three intersecting nonempty sets A, B and C
having a universal set U.
9. Differentiate between minset and maxset.
10. Define the concept of relation with reference to set theory.
11. What is equivalence class?
12. Define the term function.
13. What are into and onto functions?
14. Define one-to-one function.
15. What is another name for a function which is both one-one and onto?
16. Define inverse function.
17. Define the term mathematical logic.
18. What are logical operators? Define the various logical operators.
19. Define equivalence formula.
Long Answer Questions
1. Check the distributive laws for ∪ and ∩ and DeMorgan’s laws.
2. Determine if the following statements are true or false. Where A represents
any set.
(i) ϕ ⊆ A
(ii) A ⊆ A
(iii) (A) = A
(vi) {1, 3, 4} is a subset of {3, 2, 1, 4}.
Self-Instructional
Material 43
Set Theory (v) {3, 2, 1, 4} is a subset of {3, 1, 2,}.
(vi) The empty set is a subset of every set.
(vii) 1 is an element of {3, 2, 1, 4}.
NOTES (viii) A - (A - B) = B.
(xi) A ∩ (B - C) = (A ∩ B) - (A ∩ C).
(x) A ⊆ B and A ⊆ C then it implies that A ⊆ (B ∩ C).
(xi) (A ∩ B) U (A - B)= A.
(xii) If A ⊆ B and A ⊆ C then A ⊆ (B U C).
(xiii) A - (B - A) = A - B.
(xiv) A ⊆ B or A ⊆ C then it implies that A ⊆ (B ∩ C).
(xv) A U (B - C) = (A U B) - (A U C).
(xvi) If A ⊆ B or A ⊆ C it implies that A ⊆ (B U C).
3. Prove that two points (x0, y0) and (x1, y1) on a plane are equivalent if
y0 – x02 = y1 – x12. Further describe the equivalence classes.
4. Give an example of a set whose elements are sets.
5. Let A be a non-empty set. P(A) denotes the set of all subsets of A. P(A)
is called as power set of A. Find the power set of the following sets.
(i) A = {a, b} (ii) B = {1, 2, 3}
6. Suppose the given universal set µ = {1, 2, ..., 10}
Express the following sets with bit strings where ith bit in the string is 1 if i is
in the set and 0 otherwise.
(i) A = {4, 5, 6} (ii) B = {1, 2, 9, 10) (iii) C = {2, 3, 7, 8, 9}
Use bit strings to find:
(i) A∪B (ii) A∪C (iii) B∪C (iv) A∩B
(v) A∩C (vi) B∩C (vii) A∪B∪C (viii) A∩B∩C
7. Let {A1, A2,..., An} be a partition of a set X and let B be a nonempty
subset of X.
Prove that {Ai∩B / Ai∩B = φ} is a partition of X∩B.
8. How many different relations are there from a set of n elements to a set of
m elements?
9. Let R and S be two relations which are reflexive, symmetric and transitive.
Show that R∩S is also reflexive, symmetric and transitive.
10. How inverse functions are defined in case of trigonometric functions?
11. If a function f: [1, ∞) → [1, ∞) is defined as f(x) = 2x(x – 1), then what
is f – 1 (x)?
Self-Instructional
44 Material
12. Find whether each of the following functions from {1, 2, 3, 4} to itself is 1–1. Set Theory
(i) f(1) = 2; f(2) = 1; f(3) = 3; f(4) = 4
(ii) f(1) = 2; f(2) = 2; f(3) = 4; f(4) = 3
(iii) f(1) = 4; f(2) = 2; f(3) = 3; f(4) = 4.
13. Show that p is equivalent to the following formulae: NOTES
~ p → p ∧ p → p ∨ p → p ∨ (p ∧ p) p ∧ (p ∨ q) (p ∧ q) ∨ (p ∧ ~ q)
(p ∨ q) ∧ (p ∨ ~q)
14. Which of the following propositions generated by p, q and r are equivalent
to one another?
(i) (p ∧ r) ∨ q (ii) p ∨ (r ∨ q) (iii) r ∧ p (iv) ~ r ∨ q
(v) (p ∨ q) ∧ (r ∨ q) (vi) r → p (vii) r ∨ ~ p (viii) p → r
1.14 FURTHER READINGS
Munkres, James R. 1987. Topology a First Course. New Delhi: Prentice Hall of
India.
Dugundji, James. 1975. Topology. New Delhi: Prentice Hall of India.
Simmons, George F. 1963. Introduction to Topology and Modern Analysis.
US: McGraw Hill Inc.
Munkres, James R. 2011. Topology, 2nd edition. New Delhi: PHI Learning Pvt.
Ltd.
Basener, William F. Topology and Its Applications. New Jersey: John Wiley &
Sons, Inc.
Bourbaki, Nicolas. 1966. General Topology: Elements of Mathematics, Volume
2. United States: Addison-Wesley.
Kelley, John L. 1975. General Topology. New York: Springer-Verlag.
Willard, Stephen. 2004. General Topology. United States: Dover Publications.
Self-Instructional
Material 45
Set Theory and
Number System
UNIT 2 SET THEORY AND
NUMBER SYSTEM
NOTES
Structure
2.0 Introduction
2.1 Objectives
2.2 Construction of Number System
2.3 Set of Real Numbers
2.3.2 Summary of Properties of Algebraic Operations on Real Numbers
2.4 Positive and Negative Real Numbers
2.4.3 Well Ordering Property
2.5 Cartesian Product of Sets
2.5.1 Cartesian Product of Functions
2.6 Finite and Infinite Sets
2.7 Countable and Uncountable Sets
2.9 Summary
2.10 Key Words
2.0 INTRODUCTION
For any study of topology it is essential that basic logical and mathematical concepts
be studied and understood. In the previous unit we have discussed elementary
concepts of set theory towards study of logical concepts. In this unit we will discuss
the basic mathematical concepts required for our study of Topology, i.e., the
Number System.
You will study axioms of real numbers, Absolute value or modulus and
Interval notation. You will understand positive and negative real numbers discussing
set and section of integers, well ordering property, Archimedean ordering property
and strong induction principle. You will describe Cartesian product of sets
mentioning Cartesian square and power, infinite products, Cartesian product of
functions and two sets. You will analyse various types of sets, such as finite, infinite,
countable and uncountable sets.
Self-Instructional
46 Material
Set Theory and
2.1 OBJECTIVES Number System
After going through this unit, you will be able to:

• Construct concept of number system with naïve and axiomatic approach NOTES
• Differentiate in real numbers, integers, natural numbers, rational and irrational
numbers
• Interpret axioms and properties of real numbers, modulus and interval
notation
• Understand well ordering property, Archimedean ordering property and
strong induction principle
• Explain Cartesian product of a family of sets and infinite products
• Describe concept of finite, infinite, countable and uncountable sets
2.2 CONSTRUCTION OF NUMBER SYSTEM
There are two ways of understanding and building the concepts of Number system.
The Naive approach and the Axiomatic approach.
In this Naive Set Theory approach is to build the Real number system from the
basics of set theory. In this approach each type of number system is assumed to
be a set. Properties of the set are assumed and the reasons for such assumptions
are stated. However, this approach is more based on logical understanding and
less on mathematical concern.
A second way of approaching the study of number system is to assume that the
number systems exist with certain unambiguously stated properties. Then it is
essential to prove these properties. In other words it is required that the number
system be described by some axioms and then prove these axioms. In this chapter
we will follow this approach. We will state few axioms for the real number system
and then prove the properties.
2.3 SET OF REAL NUMBERS
Rationals and irrationals together constitute the real number system.

Any real number is either rational or irrational. Any point on the number line is
related to some corresponding real number uniquely and each real number is related
to some corresponding point on the number line uniquely.
Self-Instructional
Material 47
Set Theory and The classification of the set of all real numbers is shown in Figure below.
Number System
Real Numbers
NOTES
Rational Numbers Irrational Numbers
Positive Integers Positive Fractions

Negative Integers Negative Fractions
Zero
Fig. 2.1 Classification of Real Numbers
The real number system can be presented as a deductive logical system. By

the use of the properties of this system and the operations performed therein we
can understand the reasoning behind any steps in mathematical methods connected
with real numbers. The operations on real numbers are applicable to rational and
irrational numbers.
The real number system is fundamental to mathematical analysis. It may be defined
as a complete, simply ordered field thus suggesting that it is a system which is (i) a
field (ii) simply ordered, and (iii) complete.
We divide the axioms for real numbers into three groups.
1. The axioms of the field.
2. The axioms of order.
3. The axioms of completeness.
The meanings of fields, simple order and completeness will be clear from the
axioms which are discussed below and which are used in all the familiar algebraic
manipulations. In practice these laws are used with great rapidity so that often we
are not even aware of the fact that we are using them.
1. The Axioms of the Field: A field is a set of numbers which contains the
sum, the difference, the product and the quotient (except division by zero)
of any two numbers in the set. When subjected to these operations the
resulting numbers continue to remain in the field.
There are six axioms of a field for addition and multiplication.
Let a, b, c be real numbers. Then we have the following axioms.
(i) The Axiom of Closure: There is a unique real number a + b which is
the result of addition of b to a. Similarly there is a unique real number a .b which
is obtained by multiplying a by b.
The sum a + b is a unique real number
The product a .b is a unique real number.
Self-Instructional
48 Material
(ii) The Axiom of Commutation: a + b and b + a are the same real Set Theory and
Number System
number. Similarly a .b and b . a are the same real number.
a + b = b + a, a + (b + c) = (b + c) + a, – 6 + 11 = + 11 – 6
a . b = b .a, a(bc) = (bc)a, 3.5 = 5.3
NOTES
(iii) The Axiom of Association: Any two of a, b, c, may be added to the
third and the result will always be the same, viz., a + b + c which is uniquely
defined.
The product of any two of a, b, c, by the third is the same viz., abc which is
uniquely defined.
a + (b + c) = (a + b) + c = (a + c) + b = a + b + c
a (bc) = (ab) c = (ac) b = abc
5 + (3 + 4) = 3 + 4 + 5, 5(3.4) = 3.4.5
(iv) The Axiom of Distribution: The distribution law connects the two
operations of addition and multiplication.
The product of a and b + c is the same real number as the sum of ab and
ac.
a(b + c) = ab + ac; (a + b) (c + d) = ac + ad+ bc + bd
(v) The Axiom of Identity: The addition of zero to any number does not
change the number. Zero is called the identity element for addition as it leaves the
number unchanged.
a+0=0+a=a
The multiplication by 1 leaves the number unchanged. 1 is the identity element
for multiplication. For each and every a, a .1 and a are the same real number.
a . 1 = 1 . a = a
(vi) The Inverse Axiom: For all a,
a + (– a) = 0
– a is called the additive inverse of + a
+ a is called the additive inverse of – a
For all a, a ≠ 0
1
a 1
a
1
is called the multiplicative inverse of a
a
1
a is called the multiplicative inverse of .
a
The following statements may be regarded as theorems.
1. If a + a = a then a is equal to 0
Proof: a+a=a Hypothesis
∴ a + a + (–a) = a + (– a)
Self-Instructional
Material 49
Set Theory and ∴ a + [a + (–a)] = a + (– a) Association
Number System
∴ a+0=0
∴ a=0
NOTES 2. If a is a real number then a .0 = 0
Proof: 0+0=0
∴ a (0 + 0) = a .0
∴ a.0+a.0=a.0 Distribution
∴ a.0=0
3. If a = b, then – a = – b
4. There is no real number a which is a reciprocal of 0.
Proof: Let there be a real number a which is a reciprocal of 0, then a . 0 =
1 .
But a . 0 = 0 so that 0 = 1 which is absurd (Every real number a, other than
zero has a unique reciprocal 1/a).
5. If a + c = b + c then a = b
Proof: a + c + (– c) = b + c + (– c)
∴ a + [c + (– c)] =b + [c + (– c)] Association
∴ a+0=b+0
∴ a = b.
6. If ac = bc and c ≠ b then a = b
1 1
Proof: (ac ) (bc )
c c
1 1
∴ a c b c Association
c c
∴ a .1 = b.1
∴ a=b
7. If a + b = 0, then b = – a
Proof: – a + (a + b) = – a + 0
∴ (– a + a) + b = – a + 0
∴ 0+b =–a+0
∴ b = – a.
1
8. If ab = 1, a ≠ 0, then b =
a
Self-Instructional
50 Material
Set Theory and
1 1 Number System
Proof: (ab) = 1 .
a a
1 1
∴ b a 1 NOTES
a a
1
∴ b ⋅1 = 1 ⋅
a
1
∴ b
a
9. b(–a) = – (ab).
10. (–a) (– b)= ab.
11. a(b –c) = ab – ac
Proof: a(b – c) = a[b + (–c)]
= a . b + a(–c)]
= ab – ac.
12. a – 0 = a.
13. a + a =2a.
a c ac
14. if b 0, d 0.
b d bd
15. –(a + b) = – a – b.
16. b + (a – b) = a.
a –a a
17. – – .
b b –b
a b a b
18. .
c c c
19. – a + (– a) = (–2) . a
b
=
20. If b = ax, then x , a≠0
a
21. (ab)–1 = a–1 b–1 , i.e., the reciprocal of the product is the product of the
reciprocals.
Proof: (ab) (a–1 b–1) = a[b (a–1 b–1)] = a[bb–1)a–1]
= a [1 . a–1] = a . a–1 = 1. Hence, the result.
a c
22. If= a c, b ≠ 0
, then=
b b
Self-Instructional
Material 51
Set Theory and 23. – (a + b) = (–a) + (– b)
Number System
24. (x – a) (x + a) = x2 – a2
25. (a – b)2 = a2 + 2ab +b2
NOTES 2. The Axioms of Order: A field is said to be ordered if it satisfies the
properties of trichotomy, transitivity, addition and multiplication. This means
that real numbers can be thought of as being arranged on the number line.
A real number a is positive if a > 0 and negative if a < 0.
Zero is neither positive nor negative.
If a, b are real then a a.
There are six axioms of an ordered field.
Let a, b, c be real numbers.
(i) The Axiom of Trichotomy
If a, b are real then one and only one of the following statements is
true: a < b, a = b, a > b
(ii) The Axiom of Transitivity
If a > b and b > c then a > c
If a b then a + c > b + c
(iv) The Axiom of Multiplication
If a > b and c > 0 then ac > bc
(v) The Axiom of Extent: If a < b there exist real numbers c, d such
that
c < a, b < d
(vi) The Axiom of Density: If a b if and only if – a < – b
Proof: a > b :. a + [(– a) + – (b)] > b + [(– a) + (– b)]
:. [a + (– a)] + (–b) > (b + (– b)] + (–a)
:. 0 + (– b) > 0 + (– a) or – b > – a.
27. If a > 0, then – a < 0.
28. If a > 0 and b > 0, then ab > 0
29. If a > b and c > d, then a + c > b + d.
Self-Instructional
52 Material
Proof: a + c > b + c, b + c > b + d. Set Theory and
Number System
:. a + c > b + d.
30. If a > b and c < 0, then ac < bc
Proof: a (–c) > b(– c) NOTES
:. – ac > – bc
:. ac < bc.
An inequality is reversed if we multiply both sides by the same negative
number.
Thus – 5 > – 7 gives 7 > 5 or 5 < 7
Absolute Value or Modulus: Some quantities like price, demand, supply never
take negative values while other quantities like profit, utility, etc., may be either
positive or negative. Often we need to use quantity regardless of its sign. It is
called the absolute value of the quantity.
The absolute value of a real number a is denoted by | a |. Thus | – 2 | = 2, |2
| = 2. The absolute value of a real number a is defined by the following conditions.
|a| = a if a > 0
|a| = – a if a < 0
|a| = 0 if a = 0
The square of the absolute value of a number is the square of the number.
|a|2 = |a2| ,|–a|2 = a2
31. For every a, | – a | ≤ a ≤ |a|
32. |ab| =|a| |b| Thus |5.3| = | 5 | | 3 | =15.
33. |a + b| ≤ | a | +| b |. Thus |5 + 3| ≤ | 5 | + | 3 | = 8.
and |5 + (–3)| < | 5 | +| –3 | is < 8.
34. | a | ≥ a for every a.
35. | – a | = | a | for every a.
36. Let a > 0 then | x| < a if and only if – a < x < a.
Proof: If x > 0 then –a < x, i.e., |x| < a when – a < x < a
If x < 0 then – a < x, i.e., if |x| < a then – a < x < 0 (refer Figure below)
Combining we get – a < x < a
| x | < a implies – a < x < a
–a 0 +a
|x|<a
Fig. 2.2 |x|<a

Self-Instructional
Material 53
Set Theory and 3. The Axiom of Completeness: This axiom is a subtle characterising property
Number System
of the real number system. It is sometimes called the least upper bound
axiom. It states that every set which has an upper bound has a least upper
bound. Every set which has a lower bound has a greatest lower bound.
NOTES
Consider the approximate values of 3 .There are several approximations
; 1.7, 1.73, 1.732,....
Since 1.7 < 1.73 < 1.732 < ... < 3 , i.e., each value is less than 3 and
none equals 3 . We say 3 is an upper bound of the set.
{1.7, 1.73, 1.732,...}
There are other upper bounds but 3 is the best. It is the least upper
bound.
An upper bound t of a set is said to be the least upper bound if no upper
bound is less than t.
A lower bound v is the greatest lower bound if no lower bound is greater
than v.
The set of positive integers has no upper bound.
The set of negative integers has no lower bound.
Interval Notation: An interval is a special type of point set. Since there are an
infinite number of real numbers between any two real numbers, intervals of real
numbers are also infinite sets.
A closed interval is written [a, b] or a ≤ x ≤ b where a < b. The end points
a, b of a closed interval are elements of the interval, i.e., a, b belong to the
interval. Thus x can take the values a, b and all the values between a, b.
An open interval is written (a, b) or a < x < b where a < b. The end
points a, b do not belong to the interval. Here x can take any values between the
numbers a, b.
A partially open, i.e., half open, half closed interval is written a < x ≤ b or
(a, b].
A partially open, i.e., half closed; half open interval is written a ≤ x b is called a null interval. The null interval
contains no points. For example, 4 ≤ x ≤ 0 is null since both the inequalities 4 ≤
x and x ≤ 0 cannot be satisfied for any number x.
An interval may be bounded or unbounded. If an interval contains all points
less than a certain number b, it is said to be unbounded from below. It is written –
Self-Instructional ∞ < x ≤ b in the closed form and written ∞ < x < b in the open form.
54 Material
If an interval contains all points more than a certain number a, it is said to Set Theory and
Number System
be unbounded from above. It is written a ≤ x < ∞ in the closed form and written
a < x < ∞ in the open form.
If a, b are given numbers, an interval a ≤ x ≤ b is said to be bounded.
NOTES
If an interval extends to infinity on either side it is said to be unbounded and
written –∞ < x < ∞.
2.3.2 Summary of Properties of Algebraic Operations on Real
Numbers
Let a, b, c be real numbers.
Properties of +
(i) The sum a + b is unique Closure and Uniqueness
(ii) a + b = b + a Commutation
(iii) (a + b) + c = a + (b + c) Association
(iv) a + 0 = a for all a Identity
(v) a + (–a) = 0 for all a Inverse
Properties of ×
(i) The product a . b is unique Closure and Uniqueness
(ii) a . b = b . a Commutation
(iii) (a . b) c = a (b . c) Association
(iv) a . 1 = a for all a Identity
1
(v) a . =1 for all a ( ≠ 0) Inverse
a
Properties of =
(i) a = a Reflexivity
(ii) a = b implies b = a Symmetry
(iii) a = b and b = c implies a = c Transitivity
Properties of <
(i) One and only one of the following
is true: a = b, a < b, b < a Trichotomy
(ii) If a 0 then ac < bc Multiplication
(v) For real a, b however close
there exists a real c such that
a<c, the same will be the properties but with > symbol.
Self-Instructional
Material 55
Set Theory and
Number System
Check Your Progress
1. What is the real number system?
NOTES 2. What are the various groups of the axioms of the real number system?
3. What is a field in set theory?
4. State the axiom of order.
5. What do you understand by absolute value of the quantity?
6. What is the axiom of completeness?
2.4 POSITIVE AND NEGATIVE REAL NUMBERS
Let us define number p ∈ R if p > 0 and to be negative if p < 0. The set of all
positive real Numbers is denoted as R+ and the set of all real non-negative real
numbers as Ř+.
Before we define the set of integers, let us define an inductive set. A set X of real
numbers is said to be inductive if it satisfies following two properties:-
(a) Number 1 ∈ X.
(b) If x ∈ X, then x + 1 also ∈ X
Let us assume a set X comprising of all inductive subsets of R, then Z+; a set of all
positive integers; is collection of all elements of X. This can be proved because R+
is inductive, since it has 1 as element and the property that if x > 0 then x + 1 > 0
means that x + 1 is an element of R+ for all x.
Therefore Z+ is a subset of R+.
It implies that the elements of Z+ are all positive and the least number is 1.
Therefore, it is an inductive set. From this we now define Z the set of integers as a
set whose elements are 0 (zero), all elements of Z+ and negatives of all elements of
set Z+. Following can be proved for the set of integers Z:-
(a) Addition, subtraction and multiplication of integers would result in an
integer.
(b) Division of integers may or may not result in an integer.
(c) For any integer x, there is no integer y which is x < y < x+1.
Let n be a positive integer and let Sn denote the set of all positive integers less than
n, then Sn is called a section of positive integers. Therefore, elements of Sn are all
integers from 1 to N-1.
Self-Instructional
56 Material
2.4.3 Well Ordering Property Set Theory and
Number System
Theorem 1: It states that every non-empty subset of Z+ has a smallest element.
Proof: Let X be a set which is subset of Z+ and has no least number. It implies that
integer 1 ∉ X, since otherwise it would have been the least integer of X. Now, let NOTES
Y be a set of positive integers which is = Xc. Then 1 must belong to Y. Let us
assume n a positive integer such that all integers ≤ n ∈ Y. It can be stated that n +
1 must belong to X since it is complement of Y. However, then n+1 should be the
least element of X, since all positive integers less than N+1 are elements of Y. This
is contradictory to our first assumption, thus it can be concluded that X is an
empty set.
Theorem 2: If X is a set of positive integers and if Sn ⊂ Z+ means that n ∈ X, , then
X = Z+.
Proof : Let us state that X ≠ Z+. Let m be the smallest positive integer that is not in
X. So m ∉ X. Then every positive integer less than m is in X. From definition of
section of positive integers it implies that Sm ⊂ X. Then in accordance with the
hypothesis m ∈ X which is contrary to assumption. Therefore It implies that
X = Z+.
It states that the set Z+ does not have an upper bound in the set of Real
Numbers R.
Proof: Let us assume that Z+ has an upper bound. Since Z+ ⊂ R, from property 7
it implies that it has a least upper bound, let it be ‘u’. Then there is a positive
integer n such that it is greater than u – 1, otherwise u would not be upper bound.
Then n + 1 > u which cannot be true. Therefore Z+ does not have an upper bound.
Check Your Progress

7. Define an inductive set.
8. What is meant by section of integers?
9. State well ordering property.
10. What does Archimedean ordering property state?
2.5 CARTESIAN PRODUCT OF SETS

Let A and B be two sets. The Cartesian product of A and B is defined as:
A × B = {a, b)/a ∈ A; b ∈ B}
i.e., the set of all ordered pairs (ai, bj) for every ai ∈ A; bj ∈ B.
Self-Instructional
Material 57
Set Theory and For example, A = {1, 2}, B = {a, b, c}
Number System
A × B = {(1, a), (2, a), (1, b), (2, b), (1, c), (2, c)}
B × A = {(a, 1), (a, 2), (b, 1), (b, 2), (c,1), (c, 2)}
NOTES (Clearly A × B ≠ B × A)
Note: You can represent the Cartesian product as a rectangular array having n
rows and m columns labelled in order as a1, a2, ..., an and b1, b2,...,bn
respectively.
In the field of mathematics, product of two sets is known as Cartesian product.
It is in fact, a direct product for these two sets. The name of such a product
bears the name of René Descartes who formulated analytic geometry. Cartesian
product of two sets A, which is a set of points on x-axis, and B, which is set
of all points on y-axis, is given as A × B. It shows a set of ordered pairs having
first component that belongs to set A and second component belonging to set
B and it represents the entire x – y plane. A Cartesian product is mathematically
shown as:
A × B = {(x, y) | x ∈ A and y ∈ B}
A pack playing cards contains 52 elements having four sets as club, hearts,
diamond and spade, with each containing 13 elements, 2, 3, 4, 5, 6, 7, 8, 9,
10, Jack, Queen, King and Ace. Thus, there are two sets, one set having four
suits and each suit is a set of thirteen elements, and the corresponding Cartesian
product contains 13 × 4 = 52 elements of all possible playing cards
{(2, Spade), (3, Spade), ..., (Ace, Spade), (2, Hearts), ..., (King, Club), (Ace,
Club)}.
A table can represent Cartesian product of two finite sets where one is the set
of rows whereas another is the set of columns. This forms ordered pairs that
refer to cells in this table. An element of set is located in a cell by mentioning
row and column number. Cartesian products of two sets are not commutative
as you find in cases product of two numbers. This can happen only when two
input sets are the same.
Let there be four sets M, N, P and Q.
Cartesian product is commutative when sets of two inputs are the same. If
different, they are not commutative since ordered pairs are reversed and even
if same elements are there, pairing differs.
This is mathematically expressed as:

M×N≠N×M
For example,
{2, 5} × {6, 7} = {(2, 6), (2, 7), (5, 6), (5, 7)} and {6, 7} × {2, 5} =
{(6, 2), (6, 5), (7, 2), (7, 5)}
Self-Instructional
58 Material
But one exception is there, if you take an empty set or equal sets. Set Theory and
Number System
M× φ≠φ× M
Also, if there are two equal sets M and N and M = N, then
NOTES
M×N=N×M
Cartesian product is not associative: This fact is expressed mathematically
as follows:
(M × N) × P ≠ M × (N × P)
Cartesian product with intersections: Here we can interchange B and C and

intersection with product as shown follows:
(M ∩ N) × (P ∩ Q) = (M × P) ∩ (N × Q)
But this may not be true, if you use union instead of intersection.
(M ∪ N) × (P ∪ Q) ≠ (M × P) ∪ (N × Q)
Cartesian product is distributive over intersection and union: This fact is

expressed as follows:
(M) × (N ∩ P) = (M × N) ∩ (M × P) and,
(M) × (N ∪ P) = (M × N) ∪ (M × P)
n-ary Product
Generalization can be made for a Cartesian product over n sets A1, ..., An:
This is mathematically expressed as:
A1 × …. × An = {(a1, ….., an) : ai ∈ Ai}
It shows an n-tuples set. If these tuples are in form of ordered pairs in a nested
structure, then these are given as (A1 × ... × An – 1) × An.
Cartesian Square and Cartesian Power
Cartesian square of a set P is a binary Cartesian product P2 = P × P. For
example, if R represents a set of real numbers, two-dimensional plane can be
shown as R2 = R × R and all points or any point as an ordered pair of (x, y)
where x ∈ R and y ∈ R. This, in fact, denotes a coordinate system in two
dimensions.
Cartesian power of a set P is defined as:
Pn = P × P × P × …. × P = {(x1, x2, ….. xn) | x1∈P ∧ x2∈P ∧ x3∈P ∧
…. ∧ xn∈P}
….. n times
Self-Instructional
Material 59
Set Theory and If you take the example of a set of real numbers R, then Rn is the general case
Number System
and R3 = R × R × R is the case of a three-dimentional plane.
Infinite Products
NOTES You can define a Cartesian product for any number of sets when n becomes
very large, may be tending to infinity. If I denotes a set of index, then collection
of index set is given as {Xi | i ∈ I} indexed by I, then Cartesian product will
be:
∏ X { f : I →  X | ( ∀i )( f (i) ∈ X )},
i∈I
i
i∈I
i i
Here, the set containing all functions has its definition on index set as a function’s
value corresponding to particular index i may be taken as an element that belongs
to Xi.
Also, in case of each j contained in I, you may show the projection as:
π j : ∏ Xi → X j ,
i∈I
And is defined as πj(f) = f(j).
This is known as jth projection map.

You can show an important case when the index set is the set N of natural numbers.
In such a case, Cartesian product has a set containing infinite sequences having ith
term that corresponds to set Xi. Consider elements of,
∞
∏ �
=  ω =  ×  × ...
n =1
This may be viewed as vector having infinite number of components in the set of
real numbers.
There is occurrence of Cartesian exponentiation of special case when all Xi
factors involved in the product are the same set X. In this case,
∏X =∏X
i∈I
i
i∈I
Denotes the set of all functions mapped from I to X. Such a situation is important
for studying cardinal exponentiation.
Seeing in the light of facts as presented for infinite Cartesian product, finite
Cartesian products are taken to be a special case. In such an interpretation, an
n-tuple is function on {1, 2, 3, 4, ..., n} assuming value at i as ith element of
the tuple.
Self-Instructional
60 Material
2.5.1 Cartesian Product of Functions Set Theory and
Number System
If function f is defined as f : X → Y and g as g : A → B, their Cartesian product
is defined as f × g : (X × A) → (Y × B) as,
(f × g) (a, b) = (f (a), g(b) NOTES
Such a definition may also get extended to tuples as well as collections of functions
tending to infinity.
Let A and B be two sets. The set of all ordered pairs (a, b) such that a ∈ A,
b ∈ B is called the Cartesian product of A and B and is denoted by A × B.
Notes:1. The ordered pair (a, b) is not the same as the set {a, b}.
2. Two ordered pairs (a, b) and (c, d) are equal if and only if a = c
and b = d.
3. For the ordered pair (a, b), a is called the first coordinate and b is
second coordinate.
For example, let A ={1, 2, 3}, B = {4, 5}. Then A × B = {(1, 4), (1, 5), (2, 4),
(2, 5), (3, 4), (3, 5)} and B × A = {(4, 1), (5, 1), (4, 2), (5, 2), (4, 3), (5, 3)}. This
shows that A × B ≠ B × A.
Example 1: Let A be any set. Then A × φ and φ × A are empty sets.
Solution: Suppose if possible A × φ be not empty.
Then, there is some x ∈ A × φ
By definition, x = (a, b) where a ∈ A, b ∈ φ.
This is absurd as φ is empty.
Hence, A × φ = φ. Similarly φ × A = φ.
Example 2: Let A, B, C be three sets. Then,
A × (B ∪ C) = (A × B) ∪ (A × C)
Solution: Let x ∈ A × (B ∪ C).
Then, x = (a, d) where a ∈ A, d ∈ B ∪ C
Now, if d ∈ B, then x ∈ A × B
and if d ∈ C, then x ∈ A × C
In any case, x ∈ (A × B) ∪ (A × C)
Therefore, A × (B ∪ C) ⊆ (A × B) ∪ (A × C)
Similarly, (A × B) ∪ (A × C) ⊆ A × (B ∪ C )
This proves the result.
Example 3: Let A, B, C be three sets. Then,
A × (B – C) = (A × B) – (A × C)
Self-Instructional
Material 61
Set Theory and Solution: Let (a, d) ∈ A × (B – C)
Number System
Then, a ∈ A, d ∈ B and d ∉ C
So, (a, d) ∈ A × B and (a, d) ∉ A × C
NOTES Therefore, (a, d) ∈ (A × B) – (A × C)
This proves A × (B – C) ⊆ (A × B) – (A × C).
To prove the other side containment we proceed as under:
Let, x ∈ (A × B) – (A × C)
Then, x is an element of A × B but it does not belong to A × C.
This means that x = (a, b) where a ∈ A, b ∈ B but b ∉ C,
Otherwise, x = (a, b) ∈ A × C
This implies that, b ∈ B – C.
Therefore, x ∈ A × (B – C)
Hence, (A × B) – (A × C) ⊆ A × (B – C).
Example 4: If the set A has m elements and the set B has n elements, how many
elements does A × B have?
Solution: Let a ∈ A. Then number of elements of A × B with first coordinate as
a is n. But a can be chosen in m ways. So, the number of distinct elements of
A × B is mn.
Example 5: If A = {1, 4}, B = {4, 5}, C = {5, 7}
Find (i) (A × B) ∪ (A × C) (ii) (A × B) ∩ (A × C)
Solution: (i) By Example 1.36, (A × B) ∪ (A × C) = A × (B ∪ C)
Now, B ∪ C = {4, 5, 7}
So, A × (B ∪ C) = {(1, 4), (4, 4), (1, 5), (4, 5), (1, 7 ), (4, 7}
= (A × B) ∪ (A × C)
(ii) Now, A × B = {(1, 4), (4, 4), (1, 5), (4, 5)},
A × C = {(1, 5), (1, 7), (4, 5), (4, 7)}
So, (A × B) ∩ (A × C) = {(1, 5), (4, 5)}.
2.6 FINITE AND INFINITE SETS
Infinite and finite sets are intuitively understood as sets having infinite or finite
elements. However, certain aspects of these sets need to be discussed to a greater
length.
From previous section it can be remembered that if n is a positive integer
then section Sn is a set of all positive integers less than n. Intuitively Sn can be
understood as a finite set. A set X is called a finite set if there exists a bijective
correspondence of all elements of X with a subset of Z+.
Self-Instructional
62 Material
In other words, X is finite if, Set Theory and
Number System
(a) It is an empty set. Or
(b) There is a bijection function f : X →→ { 1, 2, ......, n}.
It can be noticed that in case of (a) above cardinality of X = 0 and in case NOTES
of (b) cardinality of x is n.
Lemma 1: Consider a set of positive integers X. Let xi be an element of set X.
Then there is a bijective function f of the set X to the set (1, 2, ......m } where m is
a positive integer; if and only if there is a bijective function f1 of the set X - {xi} with
the set {1, 2, ......m-1}.
Proof: In order to prove the above postulate let us begin by first assuming that a
bijective function f1 exists such that,
f1 : X – {xi} →→ {1, 2, .......m-1}.
Let there be a function f: X →→ {1, 2, .....m}
For all f(a) = f1(a) for all a ∈ X – {xi} and
f(xi) = m.
It can straight away be noticed that f is bijective. In order to prove the
converse, let there exist a bijective function f such that
f: X →→ {1, 2, .....m}
Now, if f maps xi to number integer m, then the condition f: X – { xi} is the
desired bijective function of f – { xi } with {1, 2, ....... m-1}.
Let f(xi) = n, and x1 be the point of X such that f(x1) = m. Then, xi ≠ x1.
Define a new function g : X →→ {1, 2, .....m} such that
g(xi) = m
g(x1) = n
g(x) = f(x) for all x ∈ X – { xi } – { x1}
From above it can be noted that g is a bijection function and the restriction
g : X – { xi } is the bijection of X – { xi } with { 1, 2, ......m-1}.
2.7 COUNTABLE AND UNCOUNTABLE SETS
Intuitively it can be said that sets whose cardinality can be stated are countable
and the others are uncountable. However, there is a concept of countably infinite
sets that needs to be discussed here.
A set is said to be countably infinite if its elements can be put in one-to-
one correspondence with the set of positive integers Z+. For example a set of
integers given as {...-3, -2, -1, 0, 1, 2, 3, .....} is infinite but since we can count all
elements it is called as countably infinite set.
Self-Instructional
Material 63
Set Theory and Therefore, it can be stated that a set X is said to be countably infinite if
Number System
there exists a bijection function such that
f : X→→ Z+.
NOTES Taking the above example for the set of integers it can be seen that there
exists a bijection function f: Z →→ Z+ and it is defined as:
f(n) = 2n for all n > 0 and
f(n) = -2n + 1 for all n ≤ 0.
Thus a set X is said to be countable if it is either finite or countably infinite.
If the set is not countable then it is called uncounlable.
Theorem 3: Let X be a non-empty set. Then the following are equivalent.
(a) X is countable.
(b) There is a surjective function f : Z+ → → X.
(c) There is an injective function f1 : X → → Z+.
Proof: (a) → (b) If X is countably infinite, then there exists a bijection f :
Z+ →→ X. Therefore (b) is proven. If X is finite, then there is bijection function g
such that :
g : {1, . . . , m} → X for some m.
Then the function f : Z+ → → X can be exteneded to be given as:
f(i) = g(i) for 1 ≤ i ≤ n, and
f(i) = g(n) for i > n.
(b) → (c) Let f : Z+ → → X be a surjection, then we state that there
exists an injective function h: X → → Z+. We define
h(x) = smallest element of f-1 ({x})
Since f is surjective f-1 ({x}) is a non-empty set. Therefore, h is well defined.
Now if x ≠ x1 then the sets f-1 ({x}) ∩ f-1 ({x1}) = φ, which implies that
min-1 ({x}) ≠ min-1 ({x1}). Hence
f1(x) ≠ f1 (x1) and f1 : X → → Z+ is injective.
(c) → (a) Assume that f1 : X → → Z+ is an injection. We want to probe
that X is countable. By changing the range of f1, we have f1: X → f1 (X) which is a
bijection function of X. Now if we can prove that every subset of Z+ is countable
we can prove our theorem.
Lemma 2: If X is an infinite subset of Z+ then X is countably infinite.
Proof: Let X be an infinite subset of Z+. Then we define a function
g : Z+ → → X as follows. Let g(1) = smallest element of X. Since X is
infinite, it is a non-empty set. Therefore, function g: is well defined.
Now assuming g(1) .... g(m-1) are well defined we have
Self-Instructional
64 Material
g(m) = smallest element of { X : {g(1), . . . , g(m–1)}. Now since X is an Set Theory and
Number System
infinite set and { X : {g(1), . . . , g(m–1)} is a non-empty set, g(m) is well-defined.
Now, g(m + k) > g(m) for all m, k ∈ Z+.
By definition g(m + 1) > g(m) for all m ∈ Z+. NOTES
Then setting A = {k ∈ Z+: g(m + k) > g(m)} we note
1 ∈ A and if g(m+ (k – 1)) > g(m), then g(m + k) > g(m + (k – 1)) > g(m).
Therefore, A = Z+. Implies g(m + k) > g(m) for all m, k ∈ Z+.
Now assuming n,m ∈ Z+ and that n > m such that n = m + k. By the above
g(n) = g(m + k) > g(m) proving that g is an injection function. Next we prove that
g is a surjection. To do this we first show that g(m) ≥ m.
Let A = {m ∈ Z+ : g(m) ≥ m}. It can be seen that, 1 ∈ A. Now If x ∈ A, then
g(x + 1) > g(x) ≥ m so that g(x + 1) ≥ x + 1. Hence x + 1 ∈ A. Now by the
principle of mathematical induction A = Z+.
Now take x0 ∈ X. We have to show that g(y0) = x for some y0 ∈ Z+. If x0
= 1, then y0 = 1. So assume that x0 ≥ 2. Consider the set B = {x ∈ X| g(x) ≥ x0}.
Since g(x0) ≥ x0, the set B is non-empty and by well-ordering principle set B has
a smallest element.
Let y0 = the smallest element D. If y0 = 1, then g(y0) = smallest element of
X ≤ x0 ≤ g(y0). Thus g(y0) = x0. It may be safe to assume that x> smallest element
of X. Then g(y0) ≥ x0 > g(y0 – 1) > . . . > g(1). Therefore g(y0) = x0 implies that the
function g is a surjection.
Lemma 3: If two sets X and Y are countably infinite, then X × Y countably infinite.
Proof: X and Y are countably infinite, therefore there exists a surjective functions
f : Z+ → →X and f1 : Z+ → →Y. Let g : Z+ × Z+ → → X × Y by
F(x,y) = (f(x), f1(y)). The function F is surjective. Since Z+ × Z+ is countably
infinite, there is a bijection h : Z+ → → Z+ × Z+. Then G : Z+ × X × Y defined by
G = F • h is a surjection. Therefore the set X × Y is countable.
Lemma 4: A subset of a countable set is countable.
Proof: Let X be a countable set and let Y be a subset of X.
Then there exists an injective function f of X on Z+. Now the restriction of
the injective function f onto Y is an injection of Y on Z+.
Lemma 5: The set Z+ × Z+ is countable.
Proof: By the theorem proved above it would be adequate to define an injective
function f : Z+ × Z+ → → Z+.
Let f : Z+ × Z+ → → Z+ = f(x,y) = 2x 3y.
Let 2x 3y = 2k3l. If x < k, then 3y = 2k”x3l. The left hand side of this
equation is an odd number whereas the right hand side is an even number which is
not possible. Therefore x = k and 3y = 3l. Then also y = l. Hence f is injective.
Self-Instructional
Material 65
Set Theory and
Number System
Check Your Progress
11. Give definition of the Cartesian products.
NOTES 12. Give mathematical representation for the Cartesian product.
13. What is Cartesian square?
14. What is countably infinite set

QUESTIONS
1. The real number system is fundamental to mathematical analysis. It may be

defined as a complete, simply ordered field thus suggesting that it is a system
which is (i) a field (ii) simply ordered, and (iii) complete.
2. We divide the axioms for real numbers into three groups.
• The axioms of the field.
• The axioms of order.
• The axioms of completeness.
3. A field is a set of numbers which contains the sum, the difference, the product
and the quotient (except division by zero) of any two numbers in the set.
4. A field is said to be ordered if it satisfies the properties of trichotomy,
transitivity, addition and multiplication. This means that real numbers can be
thought of as being arranged on the number line.
5. Quantity regardless of its sign is called the absolute value of the quantity.
The absolute value of a real number a is denoted by | a |. Thus | – 2 | = 2,
|2 | = 2.
6. It is sometimes called the least upper bound axiom. It states that every set
which has an upper bound has a least upper bound. Every set which has a
lower bound has a greatest lower bound.
7. A set X of real numbers is said to be inductive if it satisfies following two
properties:-
(a) Number 1 ∈ X. (b) If x ∈ X, then x + 1 also ∈ X
8. Let n be a positive integer and let Sn denote the set of all positive integers
less than n, then Sn is called a section of positive integers.
9. It states that every non-empty subset of Z+ has a smallest element.
10. It states that the set Z+ does not have an upper bound in the set of Real
Numbers R.
11. Let A and B be two sets. The Cartesian product of A and B is defined as:
A × B = {a, b)/a ∈ A; b ∈ B}
Self-Instructional
66 Material
12. A Cartesian product is mathematically shown as: Set Theory and
Number System
A × B = {(x, y) | x ∈ A and y ∈ B}
13. Cartesian square of a set P is a binary Cartesian product P2 = P × P.
For example, if R represents a set of real numbers, two-dimensional plane
NOTES
can be shown as R2 = R × R and all points or any point as an ordered
pair of (x, y) where x ∈ R and y ∈ R. This, in fact, denotes a coordinate
system in two dimensions.
14. A set is said to be countably infinite if its elements can be put in one-to-
one correspondence with the set of positive integers Z+. For example a
set of integers given as {...-3, -2, -1, 0, 1, 2, 3, .....} is infinite but since
we can count all elements it is called as countably infinite set.
2.9 SUMMARY
• The real number system may be defined as a complete, simply ordered
field.
• A field is a set of numbers which contains the sum, the difference, the product
and the quotient (except division by zero) of any two numbers in the set.
• A field is said to be ordered if it satisfies the properties of trichotomy,
transitivity, addition and multiplication.
• Let A and B be two sets. The Cartesian product of A and B is defined as:
A × B = {a, b)/a ∈ A; b ∈ B}
• A Cartesian product is mathematically shown as:
A × B = {(x, y) | x ∈ A and y ∈ B}
• A binary operation on a set R is a function that maps Cartesian product or
R with R onto R.
• Addition, subtraction and multiplication of integers would result in an integer.
Division of integers may or may not result in an integer.
• Let n be a positive integer and let Sn denote the set of all positive integers
less than n, then Sn is called a section of positive integers.
• Every non-empty subset of Z+ has a smallest element. This property is called
well ordering property.
• Archimedean Ordering Property states that the set Z+ does not have an
upper bound in the set of Real Numbers.
• A set is said to be countably infinite if its elements can be put in one-to-one
correspondence with the set of positive integers Z+.
• Thus a set X is said to be countable if it is either finite or countably infinite.
If the set is not countable then it is called uncounlable.
• If X is an infinite subset of Z+ then X is countably infinite
Self-Instructional
Material 67
Set Theory and
Number System 2.10 KEY WORDS
• Real numbers: Rational numbers and irrational numbers together constitute

NOTES the real numbers.
• Ordered field: A field is said to be ordered if it satisfies the properties of
trichotomy, transitivity, addition and multiplication.
• Absolute value or modulus: A quantity regardless of its sign is called the
absolute value of the quantity.
• Interval notation: An interval is a special type of point set.
• Completeness or supremum property: It states that every set which has
an upper bound has a least upper bound. Every set which has a lower
bound has a greatest lower bound.
• Linear continuum: It is a linearly ordered set of more than one element
that is compactly ordered.
• Countable infinity: A set is said to be countably infinite if its elements can
be put in one-to-one correspondence with the set of positive integers.
• Uncountable set: A set is said to be uncountable if it contains too
many elements to be countable.
• Infinite set: If a set has an infinite number of elements it is an infinite set.
2.11 SELF ASSESSMENT QUESTIONS AND

EXERCISES

1. Write a short note on the axioms of the field with its proofs.
2. Describe the axioms of order briefly.
3. Briefly describe absolute value of the quantity.
4. Discuss the axiom of completeness in short.
5. Describe Cartesian square briefly.
6. Write a short note on infinite products.
7. Give a brief account of finite and infinite sets.
1. Discuss properties of real numbers with axiomatic approach.
2. Give a general account of positive and negative real numbers.
3. Explain Cartesian product of sets and their properties.
4. Give a general account of countable and uncountable sets.
Self-Instructional
68 Material
5. Prove the following for real numbers R, using properties defined in this unit: Set Theory and
Number System
(i) If a + b = a, then a = 0.
(ii) a(b + c) = ab + ac.
(iii) (-1) a = - a. NOTES
(iv) a (b - c) = ab - ac.
(v) If a ≠ 0 and ab = a, then b = 1.
(vi) (a/b)(c/d) = ac/bd for b & d ≠ 0.
(vii)If a > 0 and b > 0, then a + b > 0 and ab > 0.
(viii) If a > b and c < 0, then ac < bc.
6. Prove that for a set comprising of inductive sets, the intersection its elements
is inductive.
7. Show that every nonempty subset of Z that is bounded above has a largest
element.
8. Show there is a bijective correspondence of X × Y with Y × X.
9. Show that finite cartesian products and finite unions of finite sets are finite.
10. Depict the injective mapping of
f: {a, b, c} →→ {a, b, c, d, e}. Check if they are bijective.
11. Show that if X is not finite and X ⊂ Y, then Y is not finite.
• If X and Y are finite, check if the set of all functions f: X→→Y is finite.
• Show that a countable union of countable sets is countable.
India.
Ltd.
Sons, Inc.
Self-Instructional
Material 69
Infinite Sets
UNIT 3 INFINITE SETS

NOTES Structure
3.0 Introduction
3.1 Objectives
3.2 Infinite Sets
3.3 Infinite Set Theorem
3.4 Axiom of Choice
3.5 Well Ordered Sets
3.5.1 Properties
3.6 Well-Ordering Theorem
3.7 The Maximum Principle
3.8 Zorn’s Lemma
3.10 Summary
3.11 Key Words
3.0 INTRODUCTION
The concept of finite and infinite sets was discussed in the previous unit. We know
that an infinite set is a set whose elements cannot be counted. It can also be said
that a set which does not have an upper bound is infinite. More formally, we have
studied that a set can be called infinite if it has a bijection with a proper subset of
itself or if it has countably infinite subsets. In this unit you will study about infinite
sets and infinite set theorem. You will discuss well-ordered sets with their properties
and examples and well-ordering theorem. The maximum principle, maximal element
and Zorn’s lemma are also explained in this unit.
3.1 OBJECTIVES
• Comprehend concept of infinite and finite sets
• Understand the importance of axiom of choice and its equivalence
• To state and prove the existence of choice function
• Understand the concept of totally ordered and partially ordered sets
• State and prove the well ordering theorem
• State and prove the maximum principle
Self-Instructional • Comprehend the equivalence of Zorn’s lemma and axiom of choice
70 Material
Infinite Sets
3.2 INFINITE SETS
If a set has an infinite number of elements it is an infinite set. The elements of such
a set cannot be counted by a finite number. A set of points along a line or in a plane NOTES
is called a point set. A finite set has a finite subset. An infinite set may have an
infinite subset.
Examples of infinite sets: A few examples of infinite sets are given below:
(a) A set X comprising of all points in a plane is an infinite set.
(b) Z = {……… -2, -1, 0, 1, 2, ……….} i.e. set of all integers is an infinite
set.
(c) Set of all positive integers which are multiple of 5 is an infinite set.
Check Your Progress

1. Define an infinite set.
2. Give some examples of infinite sets.
3.3 INFINITE SET THEOREM
Theorem 1: Let X be a set such that:

(a) There exists an injective function f : Z+ →→ X.
(b) There exists a bijection of X with a proper subset of itself.
(c) X is infinite.
Proof : In order to prove the theorem we will first prove that if (a) is true it
implies (b), then we will prove that if (b) is true it implies (c), then finally if (c) is
true it implies (a).
Let f be an injective function defined as
f : Z+ →→ X. Let the image set f(Z+) be denoted by Y; and let f(n) be
denoted by xn. Now since f is injective, for all n ≠ m, xn ≠ xm.
Now let us assume a function f1
f1 : X→→X – {x1} such that
f1(xn) = xn+1 for all xn ∈ Y
f1(a) = a for all a ∈ X – Y
It can be seen from the above that the function f1 is a bijection.
Now for the second step; let us assume that Y is a proper subset of X and
f: X →→ Y is a bijection. By assumption, there is a bijection h: X →→
{1, 2, .....n} for some n. Then the composite h o f-1 is a bijection of Y with {1, 2,
....n}. This is a contradiction and cannot be true.
Self-Instructional
Material 71
Infinite Sets For the third step, we assume that X is infinite and define an injective function
f : Z+ →→ X by principle of induction. The set X is a non-empty set, so let us
assume an element x1 of X such that it is equal to f(1).
The set X – f({1, 2, ......n-1}) is a non-empty set because if it was empty,
NOTES
then the function f : {1, 2, ..... n-1} →→ X would be a surjective function and X
would be finite. Now we can select an element of set X – f ({1, 2, ...... n-1}) and
accept f(n) to be this element. Therefore, utilising the principle of induction we
have defined the function f for all n ∈ Z+.
It can be noted that the function f is injective. Let m < n. Then f(m) belongs
to the set f({l n — 1}), whereas f(n), by definition, does not. Therefore,
f(n) ≠ f(m).
3.4 AXIOM OF CHOICE
Axiom of Choice is a very important and interesting axiom which is extensively

utilised in mathematics. The Axiom can be stated in many ways. It is also true that
many seemingly unrelated statements on closer analysis appear to be equivalent to
it.
Definition. Let X be a non-empty collection of non-empty and disjoint sets, then
there exists a set Y consisting of exactly one element from each element of X. In
other words, a set Y such that Y is contained in the union of the elements of X, and
for each X ∈ X, the set X ∩ Y has only one element.
Another way of stating this axiom is that for any family X of nonempty and
disjoint sets, there exists a set that consists of exactly one element from each
element of X.
Example 1
Let X be the set of countries in the world. Now each country can be considered
as a set with the cities of that country as its elements. Then the union of X is the set
of all cities in the world. A function which picks up the capital city and matches it
with the country is a choice function. Similarly the function that matches the most
densely populated city or the largest city of each country with its country is also a
choice function.
Example 2
Let S be a set which has all pairs of shoes in the world as its elements. Then there
exists a function that picks the left shoe out of each pair. This is a choice function
for S.
It may be observed that in the examples quoted above and in any other
example that can be stated, the choice function can be defined as a rule that
identifies the element to be selected, i.e. select the capital city, select the largest
city, select the left shoe of the pair, in the above example. The rule that is defined
Self-Instructional
72 Material
seems to be fairly simple and straight forward no matter how dense or large the set Infinite Sets
might be. In fact no axiom is required for such decisions, a simple rule is adequate.
Therefore, what the Axiom of Choice does by a consequence is that it ensures
existence of a rule or function that will meet the Choice.
NOTES
Lemma. Let X be a non-empty collection of non-empty sets, then there exists a
function f such that it selects one member of each of the sets which are elements
of X.
f : X →→ U X for all X ∈ X, such that f(X) is an element of X
The function f is called choice function for X.
[Note the difference between this lemma and axiom of choice: sets are not required
to be disjoint]
Let X be an element of X. Then let XI = {(X,x) : x ∈ X).
In other words we have constructed XI as a collection of ordered pairs,
where the first element is the set X, and the second element is an element of X.
That is the set XI is a subset of the Cartesian product XI • U X for all X ∈ XI.
Since X is a collection of non-empty sets, means X has at least one element
x. Therefore, XI contains at least one element given as (X, x) implying it is non-
empty. It can now be seen that if XI1 and XI2 are two different sets belonging to X
then there corresponding elements (XI1, x1) and (XI2, x2) are different sice there
co-ordinates are different.
Now let us define another collection of sets Y such that
Y = { XI : X ∈ X];
Please note that Y by the definition above is a collection of disjoint nonempty
subsets of
XI • U X for all X ∈ XI
Now from the choice axiom we know that there exists a set Y consisting of
exactly one element from each element of Y. Now we need to prove that Y is the
rule for the desired choice function.
It can be seen that Y is a subset of XI • U X for all X ∈ XI.
Further, Y contains exactly one element from each set XI, therefore, for
each X ∈ X, the set Y contains only one ordered pair (X, x). Therefore, Y is the
rule for a function from the collection X to the set U X such that X ∈ X.
Also, if (X, x) ∈ Y, then x is an element of X, thus Y(X) is an element of X.
Check Your Progress

3. Define axiom of choice.
4. What is meant by partial order relation?
5. What do you mean by total order relation?
Self-Instructional
Material 73
Infinite Sets
3.5 WELL ORDERED SETS
Let us recapitulate from Unit 1, that a binary relation R on a set X is a subset of the
NOTES product X × X. Also recollect that a relation will have many properties. We had
introduced few properties in unit 1. We will recapitulate them here and add a few
more which are relevant to our discussion. We may recall that a relation R, for
ease of denoting, is written as x R y for all x, y ∈ X.
3.5.1 Properties
(a) Reflexivity: x R x is true for all x ∈ X
(b) Symmetry: if x R y then y R x for all x ∈ X
(c) Antisymmetry: if x R y and y R x then x = y for all x, y ∈ X
(d) Asymmetry: if x R y then not y R x for all x, y ∈ X
(e) Transitivity: if x R y and y R z then x R z
(f) Connex or Comparability: either x R y or y R x.
Recall from unit 1 that any relation which is reflexive, symmetric and
transitive is called an equivalence relation. Now we define some more types.
A relation which is reflexive, transitive and antisymmetric is called a partial
order. A relation which is antisymmetric, transitive and comparable is called to be
a total order. It may be argued that comparability implies reflexivity. Therefore,
total order is a special type of partial order but partial order need not be total
order.
A set X along with a binary relation R is called totally ordered if the relation
R is a total order. Similarly a set X along with a binary relation R is called partially
ordered if R is a partial order.
Now let us consider a set Y which is a subset of a partial order X and
y ∈ Y is such that, for every element y1∈Y, y ≤ y1, then y is called the least element
of Y.
A set X which is totally ordered set is called well-ordered if its each non-
empty subset has a minimum element. It may be observed that every finite set with
a total order is well-ordered.
Example 3
Let us consider the Cartesian product of Z+ with the set {A, B}
Z+ X {a, b} = {a1, a2, a3, ...........b1, b2, b3..........}
Alphabetical ordering has been applied on the product set above. In
accordance with the alphabetical ordering it can be assumed that the element that
comes first, or that is to the left is smaller than the one which comes later or the one
that is on the right. It can be noticed that each non-empty subset of the above set
Self-Instructional
will have a smallest element.
74 Material
Example 4 Infinite Sets
The set of positive integers is well ordered. However, set of integers is not well
ordered because the subset containing negative integers does not have a smallest
element. NOTES
Example 5
Consider a set A = Z+ x Z+. As in example 1 above, the set A can be represented
by dictionary order of an infinite sequence of infinite sequences.
Consider set B to be a subset of A, and C be the subset of Z+ such that its
elements are all first coordinates of elements of set B. Now let c0 be the smallest
element of C. Then we have a set Y as a non-empty subset of Z+ given as:
{y : c0 x y} for all y belonging to B
Now if y0 is the smallest element of Y then by dictionary order c0 x y0 is the
smallest element of B. Therefore A is well ordered.
From the discussion above following can be summarised:-
(a) Every subset of a well-ordered set A is well-ordered for the restriction
of order on A.
(b) If set X and Y are well-ordered sets, then X × Y is well-ordered in the
dictionary order.
Theorem 2: Every nonempty finite ordered set has the order type of a section of
the set of positive integers Z+, so it is well ordered.
Proof: In order to prove the theorem we first show that every finite ordered set X
has a smallest element.
If X has only one element, then that element is the smallest. Now, let it be
true for a subset having m - 1 elements, then let set X have m number of elements
and assume element x0 belongs to X. Then the set X – {x0} has the smallest
element as x1 then the smaller of {x0, x1} is the smallest element of X.
Next we prove that there exists an order-preserving bijection of X with
{1, 2, ........m } for all m. Once again if X has one element, this proof is trivial.
Now let us assume that it is true for subsets having m-1 elements. Now assume xm
is the largest element of X. By definition there exists an order preserving bijection
such that g : X – {x}→→{1, 2, ...... m-1}
Define an order preserving bijection f: X →→{1, 2, ....... m} by letting
f(x) = g(x) for x ≠ xm.

F(xm) = m.
Hence, a finite ordered set has only one order type.
Self-Instructional
Material 75
Infinite Sets
3.6 WELL-ORDERING THEOREM
For any set X there exists an order relation on X which is well-ordering. This
NOTES theorem is also called Zermelo’s theorem and was proved by Zermelo in 1904. It
is equivalent to Axiom of Choice. In Georg Cantor’s opinion the well-ordering
theorem is unobjectionable principle of thought. There has been protracted
debate as to the correctness of the proof given by Zermelo. The concept of well
ordering any arbitrary uncountable set without any positive procedure has been
contested by many mathematicians. On close study of the proof given by Zermelo
it was found that the proof could be suspected only on one point, that involving the
choice axiom. As a consequence many scholars rejected the choice axiom.
However, over the years mathematicians have come to accept the proof and the
theorem.
Corollary: There exist an uncountable number of well-ordered sets.
Lemma:There exists a well ordered set X having a largest element L such that the
section SL of X by L is uncountable but every other section of X is countable.
Proof: Let us assume that set A is an uncountable and well-ordered set.
Let B = {1, 2} x A in the alphabetical order; then some section of B. Let L
be the smallest element of B for which the section of B by is uncountable. Then let
X have this set and L as its elements. It needs to be born in mind that SL is an
uncountable well-ordered set all sections of which are countable. It is called a
minimal uncountable well-ordered set. One of the very important properties of
this set is discussed in the next theorem.
Theorem 3: If X is a countable subset of SL, then X has an upper bound in SL.
Proof: Assume that set X is a countable subset of SL. For each x ∈ X, the Section
Sx is countable. Therefore, the union Y = U Sx for all x ∈ X, is also countable.
Now as SL is uncountable, the set Y does not include all elements of SL. Let p be
an element of SL that is not in Y. Then the element p is an upper bound for X, since
if p < x for any x ∈ X, then p belongs to Sx and hence to Y in contradiction of our
selection.
3.7 THE MAXIMUM PRINCIPLE
It may be recalled that the axiom of choice leads to the theorem that every set can
be well-ordered. The axiom of choice has other equivalences that are very important
and of lot of consequence for mathematicians. These are collectively called as the
Maximum Principles. In the early 20th Century mathematicians like M Zorn, S
Bochner and K. Kuratowslu, used the well-ordering theorem to prove these. It is
only later that it was understood that they were equivalent to the well-ordering
theorem.
Prior stating the Theorem and its proof, we will need to define a partial order.
Self-Instructional
76 Material
Definition: For any set X, a relation R is called a strict partial order on X if R is Infinite Sets
Non-reflexive and Transitive. In other words:-

(a) If x R x is not true for all x ∈ X, and
(b) If x R y and y R z are true then x R z is true for all x, y and z ∈ X. NOTES
It may be noted that if R is a strict partial order on elements of X then it is
commonly denoted as  . The above two properties are the same as that of a
simple order minus the property of comparability. Therefore, if  is a strict partial
order on set X then there can be a subset of X whose all elements are comparable
under  . Then this subset of X is simply ordered by the relation  .
Let X be a set and assume  is a strict partial order on X, then there exists a
maximal simply ordered subset Y of X.
In order to explain this important theorem, we can put it in simple words
as that for every set X having a strict partial order  , there is a simply ordered set
Y which is subset of X; and there is no other subset of X which is simply ordered
and is a superset of Y.
Example 6
Consider a set of concentric rings. These rings can be considered as a combination
of sets. The outer most ring contains all the rings inside it. This is a maximal simply
ordered collection.
Example 7
Rectangular blocks of a planned city containing sub-blocks are a collection of
maximal simply ordered collection.
Proof: A simple explanation of the theorem and a logical construction to prove it
would be given in this section. Assume your house containing all house hold goods
as a set H. Now pick up any house hold item and keep it in an empty room R of
the house. Now pick up another item from the house and compare it with the first
one with respect to some comparison rule. If it is comparable then keep it in the
room R with the earlier item else discard it. Using the same rule of comparison
check all items of the house and all items that are comparable should be kept in R,
the others are to be discarded. In the end we will have a room R filled with items
(elements) that are comparable to each other by a specific rule and no other item
belonging to your house H is an element of this room R because it is not comparable.
Therefore, the room R is a simply ordered set which is a subset of H and it is
maximal since no other subset of H under the same rule can be larger.
The above proof seems logical and understandable for smaller sets. However,
in case of infinite sets the same needs to be discussed further. Let us take the case
of countably infinite set to begin with.
Self-Instructional
Material 77
Infinite Sets Let the above set H be a countably infinite set. Now let us do an indexing
function on all items of H bijectively with Z+ so that H = {h1, h2, h3, .....}. Indexing
helps in nomenclature of the elements of the set H.
Now let f be a function such that f: H →→ {0, 1}. In other words the
NOTES function f assigns value 0 to hi if we put the house hold item in room R and it
assigns value 1 to hi if we discard the item. That is f(i) = 0 for all hi comparable to
other elements. Implies:
{hj : j < i and f(j) = 0}
It can be seen from definition of recursive principle that the above equation
is a unique function f: H →→ {0, 1} and that the set of those hj for which f(j) is
equal to zero is maximal.
Now in the case where set H is not countable then we would need to use
the well-ordering theorem to prove. In this case let the items of set H be indexed
with the elements of a well-ordered set X such that
H = {hi : ∈ X}. In accordance with the well-ordering theorem, we know
that there exists a bijection between H and some well-ordered set X. Now, the
proof is simple and can be progressed as done in the case of countably infinite
case.
Consider a set X and let  be a strict partial order on X. If Y is a subset of X, an
upper bound on Y is an element x of X such that for every y in Y, either y = x or
y  c. A maximal element of X is an element m such that for no element x of X,
m  x is true.
3.8 ZORN’S LEMMA
Consider a set X that is strictly partially ordered. If every simply ordered subset of
X has an upper bound in X, then X has a maximal element.
Proof: Zorn’s lemma can be easily understood in relation with the maximum principle;
i.e for a set X maximum principle implies that X has a maximal simply ordered
subset Y. The hypothesis of Zorn’s lemma tells us that Y has an upper bound m in
X. The element m is then automatically a maximal element of X. For if m  n for
some element n of X, then the set Y U {n}, which properly contains Y, is simply
ordered because y  n for every b ∈ Y. This fact contradicts maximality of Y..
Check Your Progress

6. State well-ordering theorem.
7. What is a partial order?
8. Define the maximum principle theorem.
9. What do you understand by Zorn's lemma?
Self-Instructional
78 Material
Infinite Sets
QUESTIONS
1. If a set has an infinite number of elements it is an infinite set. NOTES
2. A few examples of infinite sets are given below:
(a) A set X comprising of all points in a plane is an infinite set.
(b) Z = {……… -2, -1, 0, 1, 2, ……….} i.e. set of all integers is an infinite
set.
(c) Set of all positive integers which are multiple of 5 is an infinite set.
3. Axiom of choice states that for any family X of nonempty and disjoint sets,
there exists a set that consists of exactly one element from each element of X.
4. A relation which is reflexive, transitive and antisymmetric is called a partial
order.
5. A relation which is antisymmetric, transitive and comparable is called to be
a total order.
6. Well-ordering theorem states that for any set X there exists an order relation
on X which is well-ordering.
7. For any set X, a relation R is called a strict partial order on X if R is Non-
reflexive and Transitive.
8. Let X be a set and assume  is a strict partial order on X, then there exists
a maximal simply ordered subset Y of X.
9. Consider a set X that is strictly partially ordered. If every simply ordered
subset of X has an upper bound in X, then X has a maximal element.
3.10 SUMMARY
• Let X be a non-empty collection of non-empty sets, then there exists a
function f such that it selects one member of each of the sets which are
elements of X.
• Arelation which is reflexive, transitive and antisymmetric is called a partial order.
• A relation which is antisymmetric, transitive and comparable is called to be
a total order.
• Every subset of a well-ordered set A is well-ordered for the restriction of
order on A.
• There exist an uncountable number of well-ordered sets.
• If X is a countable subset of SL, then X has an upper bound in SL
• If set X and Y are well-ordered sets, then X x Y is well-ordered in the
dictionary order.
• Every nonempty finite ordered set has the order type of a section of the set
of positive integers Z+, so it is well ordered.
Self-Instructional
Material 79
Infinite Sets • For any set X there exists an order relation on X which is well-ordering.
• The axiom of choice has other equivalences that are very important. These
are collectively called as the Maximum Principles.
• For any set X, a relation R is called a strict partial order on X if R is Non-
NOTES
reflexive and Transitive.
• Zorn’s Lemma states that if every simply ordered subset of a strictly partially
ordered set X has an upper bound in X, then X has a maximal element.
3.11 KEY WORDS

• Partial order: For any set a relation is called a strict partial order on the
set if the relation is non-reflexive and transitive.
• Axiom of choice: It states that for any family of no-empty and disjoint
sets, there exists a set that consists of exactly one element from each element
of that family.
• Totally ordered set: A set along with a binary relation is known as totally
ordered if the relation is a total order.
• Partially ordered set: A set along with a binary relation is known as partially
ordered if the relation is a partial order.
• Well-ordering theorem: It states that for any set there exists an order
relation on the set which is well-ordering.
• The maximum principle theorem: Let X be a set and assume p is a strict
partial order on X, then there exists a maximal simply ordered subset Y of X.
• Zorn’s lemma: Consider a set X that is strictly partially ordered. If every
simply ordered subset of X has an upper bound in X, then X has a maximal
element.
3.12 SELF ASSESSMENT QUESTIONS AND

EXERCISES

1. Describe the infinite set theorem.
2. Explain well-ordering theorem.
3. Write a short note on the maximum principle.
4. Show that if X is an infinite set and x belongs to X, then X – {x} is also
infinite.
5. If Y a subset of X is infinite, is X infinite?
6. Prove that if Y is an infinite set then Y x Y is also infinite?
7. Write a choice function for following sets:
Self-Instructional
• Set X which is a collection of nonempty subsets of Z+.
80 Material
• Set Y which is a collection of nonempty subsets of Z. Infinite Sets
• Set A which is a collection of nonempty subsets of Q where Q is a set of

all rational numbers.
• Set B which is a collection of nonempty subsets of N where N is a set of NOTES
all Natural numbers.
8. Write a short note on Zorn’s lemma.
1. Explain axiom of choice giving suitable examples.
2. Describe well-ordered sets with suitable examples.
3. Discuss the maximum principle theorem with examples.
4. Show that if function f: X →→ Y is injective and X is not empty, then the
function f has a left inverse.
5. Prove that if every subset of a countable set is countable.
6. Prove that if X1, X2, X3 ........ Xn are countable then {X1 x X2 x ........ Xn}
is countable.
7. Prove that union of a finite number of sets that are countable is countable.
8. Show that the well-ordering theorem implies the choice axiom.
9. Prove that a well-ordered set satisfies least upper bound property.
10. Given two sets X and Y show using the well-ordering theorem that either X
and Y have same cardinality, or one has cardinality lesser than the other.
11. Show that Zorn’s Lemma implies Kuratowski lemma which states that if X
is a collection of sets and if for every sub-collection Y of X that is simply
ordered by proper inclusion, the union of the elements of Y is contained in
X. Then X has an element that is properly contained in no other element
of Y.

India.
Ltd.
Sons, Inc.
Willard, Stephen. 2004. General Topology. United States: Dover Publications. Self-Instructional
Material 81
Topological Spaces:
An Introduction
BLOCK - II
TOPOLOGICAL SPACES
NOTES
UNIT 4 TOPOLOGICAL SPACES:

AN INTRODUCTION
Structure
4.0 Introduction
4.1 Objectives
4.2 Topological Spaces
4.2.1 Examples of Topological Spaces
4.2.2 Classification of Topological Spaces
4.3 Problems
4.5 Summary
4.6 Key Words
4.0 INTRODUCTION
A topological space may be defined as a set of points, along with a set

of neighbourhoods for each point, satisfying a set of axioms relating points and
neighbourhoods. Topological spaces are mathematical structures that authorize
the formal definition of concepts such as continuity, connectedness,
and convergence. The branch of mathematics that studies topological spaces is
known as point-set topology or general topology. In this unit you will define a
topological space in different equivalent ways and understand it with examples.
You will understand countable complement topology, continuous functions
topological constructions. You will analyse topological spaces with algebraic
structure and order structure giving their classification. You will describe Euclidean
spaces. Spectral, specialization preorder, Schwartz inequality and Minkowskis
inequality are also discussed in this unit.
4.1 OBJECTIVES

• Define a topological space in various equivalent ways
• Understand a topological space with examples
Self-Instructional
82 Material
• Comprehend continuous function, quotient space, homeomorphic space, Topological Spaces:
An Introduction
and topological constructions
• Analyse topological spaces with algebraic structure and order structure giving
their classification
NOTES
• Define spectral order and canonical preorder
• Prove and understand Schwartz inequality and Minkowskis inequality to
describe Euclidean spaces
4.2 TOPOLOGICAL SPACES
The word topology is used for a family of sets having definite properties that are
used to define a topological space, a basic object of topology. Topological spaces
are mathematical structures that authorize the formal definition of concepts such
as convergence, connectedness and continuity. Hence, the branch of mathematics
that studies topological spaces is called topology.
Definition
A topological space is a set X together with τ, a collection of subsets of X, satisfying
the following axioms:
1. The empty set and X are in τ.
2. τ is closed under arbitrary union.
3. τ is closed under finite intersection.
The collection τ is called a topology on X. The elements of X are usually called
points, though they can be any mathematical objects. A topological space in which
the points are functions is called a function space. The sets in τ are called the open
sets and their complements in X are called closed sets. A subset of X may be
neither closed nor open, either closed or open, or both. A set that is both closed
and open is called a clopen set. The following are examples of topological sets:
• X = {1, 2, 3, 4} and collection τ = {{ }, {1, 2, 3, 4}} of only the two
subsets of X required by the axioms form a topology, the trivial topology
(indiscrete topology).
• X = {1, 2, 3, 4} and collection τ = {{ }, {2}, {1, 2}, {2, 3}, {1, 2, 3}, {1,
2, 3, 4}} of six subsets of X forms a topology.
• X = {1, 2, 3, 4} and collection τ = P(X) (the power set of X) form a third
topology, the discrete topology.
• X = Z, the set of integers and collection τ equal to all finite subsets of the
integers plus Z itself is not a topology, because the union of all finite sets not
containing zero is infinite but is not all of Z, and so is not in τ.
Self-Instructional
Material 83
Topological Spaces: Equivalent Definitions
An Introduction
There are various additional equivalent ways to define a topological space.
Consequently, each of the following defines a category equivalent to the category
NOTES of topological spaces above. For example, using De Morgan’s laws, the axioms
defining open sets above become axioms defining closed sets:
1. The empty set and X are closed.
2. The intersection of any collection of closed sets is also closed.
3. The union of any pair of closed sets is also closed.
Using these axioms, another way to define a topological space is as a set X together
with a collection τ of subsets of X satisfying the following axioms:
1. The empty set and X are in τ.
2. The intersection of any collection of sets in τ is also in τ.
3. The union of any pair of sets in τ is also in τ.
Under this definition, the sets in the topology τ are the closed sets and their
complements in X are the open sets. Topological space can also be defined using
the Kuratowski closure axioms, which define the closed sets as the fixed points of
an operator on the power set of X. A neighbourhood of a point x is any set that has
an open subset containing x. The neighbourhood system at x consists of all
neighbourhoods of x. A topology can be determined by a set of axioms concerning
all neighbourhood systems.
Various types of topologies can be placed on a set to form a topological
space. When every set in a topology τ1 is also in a topology τ2, we say that τ2 is
better than τ1 and τ1 is coarser than τ2. A proof that relies only on the existence of
certain open sets will also hold for any better topology and similarly a proof that
relies only on certain sets not being open applies to any coarser topology. The
collection of all topologies on a given fixed set X forms a complete lattice: if F =
{τá : α in A} is a collection of topologies on X, then the meet of F is the intersection
of F and the join of F is the meet of the collection of all topologies on X that
contain every member of F.
Continuous Functions
A function between topological spaces is called continuous if the inverse image of
every open set is open. A homeomorphism is a bijection that is continuous and
whose inverse is also continuous. Two spaces are called homeomorphic if there
exists a homeomorphism between them. From the standpoint of topology,
homeomorphic spaces are essentially identical.
Self-Instructional
84 Material
4.2.1 Examples of Topological Spaces Topological Spaces:
An Introduction
A given set may have many different topologies. If a set is given a different topology,
it is viewed as a different topological space. Any set can be given the discrete
topology in which every subset is open. The only convergent sequences in this NOTES
topology are those that are eventually constant. Also, any set can be given the
trivial topology also termed as the indiscrete topology in which only the empty set
and the whole space are open. Every sequence in this topology converges to
every point of the space. This example shows that in general topological spaces,
limits of sequences need not be unique. However, often topological spaces must
be Hausdorff spaces where limit points are unique.
There are many ways of defining a topology on R, the set of real numbers.
The standard topology on R is generated by the open intervals. The set of all open
intervals forms a base or basis for the topology, meaning that every open set is a
union of some collection of sets from the base. In particular, this means that a set
is open if there exists an open interval of non zero radius about every point in the
set. More generally, the Euclidean spaces Rn can be given a topology. In the usual
topology on Rn the basic open sets are the open balls. Similarly, C and Cn have a
standard topology in which the basic open sets are open balls. Every metric space
can be given a metric topology, in which the basic open sets are open balls defined
by the metric. This is the standard topology on any normed vector space. On a
finite dimensional vector space this topology is the same for all norms.
Many sets of linear operators in functional analysis are endowed with
topologies that are defined by specifying when a particular sequence of functions
converges to the zero function. Any local field has a topology native to it and this
can be extended to vector spaces over that field. Every manifold has a natural
topology since it is locally Euclidean. Similarly, every simplex and every simplicial
complex inherits a natural topology from Rn.
The Zariski topology is defined algebraically on the spectrum of a ring or an
algebraic variety. On Rn or Cn, the closed sets of the Zariski topology are the
solution sets of systems of polynomial equations. A linear graph has a natural
topology that generalizes many of the geometric aspects of graphs with vertices
and edges. The Sierpiñski space is the simplest non-discrete topological space. It
has important relations to the theory of computation and semantics.
There exist numerous topologies on any given finite set. Such spaces are
termed as finite topological spaces. Any set can be given the cofinite topology in
which the open sets are the empty set and the sets whose complement is finite.
This is the smallest T1 topology on any infinite set.
Any set can be given the cocountable topology, in which a set is defined as
open if it is either empty or its complement is countable. When the set is uncountable, Self-Instructional
Material 85
Topological Spaces: this topology serves as a counterexample in many situations. The cocountable
An Introduction
topology or countable complement topology on any set X consists of the empty
set and all cocountable subsets of X, i.e., all sets whose complement in X is
countable. It follows that the only closed subsets are X and the countable subsets
NOTES
of X. Every set X with the cocountable topology is Lindelöf, since every nonempty
open set omits only countably many points of X. It is also T1, as all singletons are
closed. The only compact subsets of X are the finite subsets, so X has the property
that all compact subsets are closed, even though it is not Hausdorff if uncountable.
The real line can also be given the lower limit topology. Here, the basic
open sets are the half open intervals [a, b). This topology on R is strictly finer than
the Euclidean topology defined above; a sequence converges to a point in this
topology if and only if it converges from above in the Euclidean topology. This
example shows that a set may have many distinct topologies defined on it.
If Γ is an ordinal number, then the set Γ = [0, Γ) may be endowed with the
order topology generated by the intervals (a, b), [0, b) and (a, Γ) where a and b
are elements of Γ.
Topological Constructions
Every subset of a topological space can be given the subspace topology in which
the open sets are the intersections of the open sets of the larger space with the
subset. For any indexed family of topological spaces, the product can be given the
product topology, which is generated by the inverse images of open sets of the
factors under the projection mappings. For example, in finite products, a basis for
the product topology consists of all products of open sets. For infinite products,
there is the additional requirement that in a basic open set, all but finitely many of
its projections are the entire space.
A quotient space is defined as follows:
If X is a topological space and Y is a set, and if f : X → Y is a surjective function,
then the quotient topology on Y is the collection of subsets of Y that have open
inverse images under f. In other words, the quotient topology is the finest topology
on Y for which f is continuous. A common example of a quotient topology is when
an equivalence relation is defined on the topological space X. The map f is then the
natural projection onto the set of equivalence classes.
The Vietoris topology on the set of all non-empty subsets of a topological
space X, named for Leopold Vietoris, is generated by the following basis:
For every n-tuple U1, ..., Un of open sets in X, we construct a basis set
consisting of all subsets of the union of the Ui that have non-empty intersections
with each Ui.
Self-Instructional
86 Material
4.2.2 Classification of Topological Spaces Topological Spaces:
An Introduction
Topological spaces can be generally classified up to homeomorphism by their
topological properties. A topological property is a property of spaces that is invariant
under homeomorphisms. To prove that two spaces are not homeomorphic find a NOTES
topological property not shared by them. Examples of such properties include
connectedness, compactness and various separation axioms.
Topological Spaces with Algebraic Structure
For any algebraic objects we can introduce the discrete topology, under which the
algebraic operations are continuous functions. For any such structure that is not
finite, we often have a natural topology compatible with the algebraic operations in
the sense that the algebraic operations are still continuous. This leads to concepts
such as topological groups, topological vector spaces, topological rings and local
fields.
Topological Spaces with Order Structure
• Spectral: A space is spectral if and only if it is the prime spectrum of a ring
(Hochster theorem).
• Specialization preorder: In a space the specialization (or canonical)
preorder is defined by x ≤ y if and only if cl{x} ⊆ cl{y}. Here cl denotes
canonical preorder.
Euclidean Spaces
For each n ∈ N, let R denote the set of all ordered n-tuples x = (x1, x2,..., xn),
where, x1,..., xn are real numbers, called the coordinates of x. The elements of Rn
will be called points or vectors and will always be denoted by letters, a, b, c, x, y,
z, etc. Let y = (y1, y2,..., yn) and let a be a real number. We define the addition of
vectors and multiplication of a vector by a real number (called scalar) as follows:
x + y = (x1 + y1,..., xn + yn); αx = (α x1,...,α xn).
These definitions show that x + y ∈ Rn and αx ∈ Rn. It is easy to see that
for these operations the commutative, associative and distributive laws hold and
thus Rn is a vector space over the real field R. The zero element of Rn (usually
called the origin or the null vector) is the point 0, all of whose coordinates are
zero.
The scalar product or inner product of two vectors x and y is defined by,
n
x, y = Σ xi yi ,
i =1
1/ 2  n 2
Also the norm of x is defined by x = ( x, x) =  iΣ=1 xi 
 
Self-Instructional
Material 87
Topological Spaces: The vector space Rn with the preceding inner product and norm is called Euclidean
An Introduction
n-space.
In the sequel, we shall need the following inequalities.
NOTES (i) If z1, z2,..., zn are complex numbers (or in particular real numbers), then
| z1 + z2 + ... + z n | ≤ | z1 | + | z 2 | +...+ | zn | .
(ii) If zi, ωi (i = 1,...,n) are complex numbers, then

1/ 2 1/ 2
n
n  n 
Σ zi ωi ≤  Σ | zi |2   Σ | ωi |2  (Schwarz Inequality)
=i 1 =  i 1 =   i 1 
If ai, bi(i = 1,...,n) are real numbers, then the above inequality
1/ 2 1/ 2
n
 n
2   n
2 
reduces to Σ ai bi ≤  Σ a i   Σ bi 
=i 1 =i 1 =i 1    
(iii) If zi, ωi(i = 1,...,n) are complex numbers, then

1/ 2 1/ 2 1/ 2
n 2 n 2 n 2 
Σ |
 i 1 =z i + ωi | Σ |
  i 1 = zi |  +  iΣ1 | ωi |  (Minkowskis Inequality)
= 
Theorem 1: Let x, y, z ∈ Rn and let α be real. Then

(i) | x |≥ 0 , (ii)=
| x | 0=
if x 0,
(iii) |αx|=|α| | x|, (iv) | x, y | ≤ | x || y |,

(v) | x + y | ≤ | x | + | y |, (vi) | x − y | ≤ | x – y | + | y – z | .
Proof: The proofs of cases (i), (ii) and (iii) are trivial but obvious. To prove (iv),
by Schwarz inequality, we have
1/ 2 1/ 2
n  n
n

Σ xi yi ≤  Σ xi 2   Σ yi 2 
=i 1 =  i 1 =   i 1 
Hence, by the definition of scalar product and norm, we at once obtain |x.y|
< |x| |y|.
Again using case (iv), we have
|x + y|2 = (x + y) . (x + y) = x.x + 2x.y + y.y
< |x|2 +2| x | | y | + | y |2 = (| x | + | y |)2
so that |x + y| < | x | + | y |. Thus case (v) is proved.
Finally, case (vi) follows from case (v) by replacing x by x – y and y by
y – z.
Self-Instructional
88 Material
Topological Spaces:
4.3 PROBLEMS An Introduction
Following examples will help you understand the concept of topological space.
Consider that if (X, τ) is a topological space then a set A ⊆ X is said to be open NOTES
if A ∈ τ and A is said to be closed if Ac ∈ τ. Furthermore, if A is both open and
closed, then we say that A is clopen. The following examples will help you to
identify the open, closed and clopen sets of a topological space (X, τ).
Example 1. Let X = {a, b, c, d} and consider that the topology,
τ ={∅, {c}, {a, b}, {c, d}, {a, b, c}, X}
What are the open, closed, and clopen sets of X with respect to this topology
space?
Solution: We find the solution as follows.
The open sets of X are those sets which form τ:
Open sets of X = {∅, {c}, {a, b}, {c, d}, {a, b, c}, X}
The closed sets of X are the complements of all of the open sets:
Closed sets of X = {∅, {a, b, d}, {c, d}, {a, b}, {d}, X}
The clopen sets of X are the sets that are both open and closed:
Clopen sets of X = {∅, {a, b}, {c, d}, X}
Example 2. Prove that if X is a set and every A ⊆ X is clopen with respect to the
topology τ then τ is the discrete topology on X.
Solution. Let X be a set and let every A ⊆ X be clopen. Then every A ⊆ X is
open, i.e., every subset of X is open.
Therefore, τ = P(X).
Hence, τ is the discrete topology on X.
Example 3. Consider the topological space ( , τ) where τ is the co-finite
topology.
(1) Determine whether the set of even integers is open, closed, and/or clopen.
(2) Determine whether the set  \{1, 2, 3} is open, closed, and/or clopen.
(3) Determine whether the set{–1, 0, 1} is open, closed, and/or clopen.
Show that any nontrivial subset of  is never clopen.
Solution: The co-finite topology τ is described by:
τ = {U ⊆ X : U = ∅ or Uc is finite}
We first consider the set of even integers which we denote by,
E = {..., –2, 0, 2, ...}
Then the Ec is considered as the set of odd integers, i.e.,
Self-Instructional
Material 89
Topological Spaces: Ec = {..., –3, –1, 1, 3, ...} which is an infinite set. Therefore E ∉ τ so E is
An Introduction
not open.
Furthermore, we have that (Ec) c = E is an infinite set and Ec ∉ τ so E is not
closed either.
NOTES
Now consider the set  \{1, 2, 3}. We have that (  \{1, 2, 3})c =
{1, 2, 3} which is a finite set. Therefore  \{1, 2, 3} ∈ τ, so  \{1, 2, 3} is open.
Now consider the complement (  \{1, 2, 3})c = {1, 2, 3}. The complement
of this set is ({1, 2, 3})c =  \{1, 2, 3} which is an infinite set.
Therefore, ({1, 2, 3})c ∉ τ.
Hence,  \{1, 2, 3} is not closed.
Now we consider the set {–1, 0, 1}.
We have ({–1, 0, 1})c =  \{–1, 0, 1} which is an infinite set.
Therefore, {–1, 0, 1}∉ τ so {–1, 0, 1} is not open.
Now consider the complement ({–1, 0, 1})c =  \{–1, 0, 1}. The
complement of this set is {–1, 0, 1} is finite, thus ({–1, 0, 1})c ∈ τ. Hence,
{–1, 0, 1} is closed.
Finally, let A ⊆  be a nontrivial subset of  , i.e., A ≠ ∅ and A ≠  .
Suppose that A is clopen. Then A is both open and closed. Hence by definition, A
and Ac are both open. Hence Ac and A are both finite. But  =A ∩ Ac which
implies that  is a finite set - which is absurd since the set of integers is an infinite
set. Hence A cannot be clopen.
Example 4. Draw the following points in Euclidean two-dimensional space:
(2, 1), (–1, –3), (–0.5, –1.5) and (–4, 6)
Solution: The above mentioned points can be drawn in Euclidean two-dimensional
space as shown in the figure below of Euclidean Graph
Self-Instructional
90 Material
Topological Spaces:
An Introduction
Check Your Progress
1. What do you understand by a topological space?
2. Define a function space. NOTES
3. What is a continuous space?
4. What is meant by homeomorphic space?
5. What is a spectral space?
6. Give definition for a specialization preorder.

QUESTIONS
1. A topological space is a set X together with t, a collection of subsets of X,

satisfying the following axioms:
• The empty set and X are in τ.
• τ is closed under arbitrary union.
• τ is closed under finite intersection.
The collection τ is called a topology on X.
2. A topological space in which the points are functions is called a function
space.
3. A function between topological spaces is called continuous if the inverse
image of every open set is open.
4. A homeomorphism is a bijection that is continuous and whose inverse is
also continuous. Two spaces are called homeomorphic if there exists a
homeomorphism between them.
5. A space is spectral if and only if it is the prime spectrum of a ring (Hochster
theorem).
6. In a space the specialization (or canonical) preorder is defined by x ≤ y
if and only if cl{x} ⊆ cl{y}. Here cl denotes canonical preorder.
4.5 SUMMARY
• The word topology is used for a family of sets having definite properties
that are used to define a topological space, a basic object of topology.
• Topological spaces are mathematical structures that authorize the formal
definition of concepts such as continuity, connectedness, and convergence.
Self-Instructional
Material 91
Topological Spaces: • A topological space in which the points are functions is called a function
An Introduction
space.
• A function between topological spaces is called continuous if the inverse
image of every open set is open.
NOTES
• The countable topology or countable complement topology on any set X
consists of the empty set and all countable subsets of X, i.e., all sets whose
complement in X is countable.
• The quotient topology is the finest topology on Y for which f is continuous.
• A space is said to be spectral if and only if it is the prime spectrum of a ring.
• The vector space with the preceding inner product and norm is known as
Euclidean n-space.
4.6 KEY WORDS
• Function space: A topological space in which the points are functions is

called a function space.
• Continuous function: A function between topological spaces is called
continuous if the inverse image of every open set is open.
• The countable topology: The countable topology or countable complement
topology on any set X consists of the empty set and all countable subsets of
X, i.e., all sets whose complement in X is countable.
• The Sierpinski space: It is the simplest non-discrete topological space.
• Spectral space: A space is said to be spectral if and only if it is the prime
spectrum of a ring.
4.7 SELF ASSESSMENT QUESTIONS

AND EXERCISES

1. What is a topological space? Give various equivalent ways to define a
topological space.
2. Give brief account of topological constructions.
3. Analyse topological spaces giving their classification.
1. Give a detailed account of topological spaces giving suitable examples.
2. Explain the concept of topological constructions with the help of examples.
3. Explain Euclidean spaces using Schwartz inequality and Minkowskis
Self-Instructional inequality.
92 Material
Topological Spaces:
4.8 FURTHER READINGS An Introduction
India. NOTES
Ltd.
Sons, Inc.
Self-Instructional
Material 93
Order Topology
UNIT 5 ORDER TOPOLOGY

NOTES Structure
5.0 Introduction
5.1 Objectives
5.2 The Order Topology
5.3 The Product Topology on X × Y
5.3.2 Tychonoff Product Topology in Terms of Standard
Subbase and its Characterization
5.5 Summary
5.6 Key Words
5.0 INTRODUCTION
In this unit, you will learn about product topological spaces, nets and filters. Product
topology is the topology on the Cartesian product X × Y of two topological spaces
whose open sets are the unions of subsets A × B, where A and B are open subsets
of X and Y, respectively. This definition extends in a natural way to the Cartesian
product of any finite number n of topological spaces. The product topology is also
called Tychonoff topology. An order topology is a certain topology that can be
explained on any totally ordered set. If X is a totally ordered set, the order
topology on X is generated by the subbase of “open rays”. A topological
space X is known as orderable if there exists a total order on its elements such
that the order topology induced by that order and the given topology on X coincide.
Nets are used in general topology and analysis to instill non-metrizable topological
spaces with convergence properties. Filters are also used to define convergence
and are a generalization of nets.
5.1 OBJECTIVES

• Define product topological spaces and projection mappings
• Describe Tychonoff product topology in terms of standard subbase and its
characterization
• Explain separation axioms and product spaces
• Explicate local connectedness and compactness of product spaces
• State product space as first axiom space
Self-Instructional
94 Material
• Define nets and filters Order Topology
• Describe convergence of nets and filters
5.2 THE ORDER TOPOLOGY NOTES
In mathematics, an order topology is a certain topology that can be defined on

any totally ordered set. It is a natural generalization of the topology of the real
numbers to arbitrary totally ordered sets.
Definition. If X is a totally ordered set, then the order topology on X is generated
by the following given sub-base:
(a, ∞) = {x  a < x}
(–∞, b) = {x  x < b}
for all a, b in X. This is equivalent to the open intervals as,
(a, b) = {x  a < x < b}
This forms a base for the order topology.
Additionally, a topological space X is called orderable if there exists a total
order on its elements such that the order topology induced by that order and the
given topology on X coincide. The order topology makes X into a completely
normal Hausdorff space. The standard topologies on R, Q, Z and N are the order
topologies.
Definition. A topology defined on a totally ordered set X whose open sets are all
the finite intersections of subsets of the form,

Or,
Where .
The order topology of the real line is the Euclidean topology. The order
topology of is the discrete topology, since for all ,
is an open set.
Definition. If X is a simply ordered set, then there is a standard topology for X,
defined using the order relation termed as ‘Order Topology’.
Assume that X is a set having order relation <. Given a < b ∈ X, then there
are four subsets of X termed as intervals determined by a and b as follows:
Self-Instructional
Material 95
Order Topology
5.3 THE PRODUCT TOPOLOGY ON X × Y
In topology and related areas of mathematics, a product space is defined to be the

NOTES Cartesian product of a family of topological spaces equipped with a natural
topology called the product topology. The box topology agrees with the product
topology when the product is over only finitely many spaces. Wherein the product
topology makes the product space a categorical product of its factors, the box
topology is too fine. Hence the product topology is considered natural.
Let X be the (possibly infinite) Cartesian product of the topological
spaces Xi, indexed by i ∈ I such that,
X := ∏ X i
i∈I
and the canonical projections pi : X → Xi, then the product topology on X is

defined to be the coarsest topology, which means the topology with the fewest
open sets, for which all the projections pi are continuous. The product topology is
sometimes termed as the Tychonoff topology. The open sets in the product
topology are finite or infinite unions of sets of the form ∏U i , where each Ui is
open in Xi and Ui ≠ Xi only finitely many times.
The product topology on X is the topology generated by sets of the form pi–
1
(U), where i is in I and U is an open subset of Xi. We can also say that, the sets
{pi–1(U)} form a subbase for the topology on X. A subset of X is open iff it is a
possibly infinite union of intersections of finitely many sets of the form pi–1(U).
The pi–1(U) are sometimes called open cylinders and their intersections are cylinder
sets. We can describe a basis for the product topology using bases of the constituting
spaces Xi. A basis consists of sets ΠU i , where for all but finitely many i, Ui = Xi ,
and otherwise it is a basic open set of Xi. Particularly, for a finite product for the
product of two topological spaces, the products of base elements of the Xi give a
basis for the product ΠX i .
As a general rule, the product of the topologies of each Xi forms a basis for
the box topology on X. Although in general, the box topology is finer than the
product topology, but for finite products they coincide. If we start with the standard
topology on the real line R and define a topology on the product of n copies of R in
this manner, then we obtain the ordinary Euclidean topology on Rn. The Cantor
set is homeomorphic to the product of countably many copies of the discrete
space {0,1} and the space of irrational numbers is homeomorphic to the product
of countably many copies of the natural numbers, where again each copy carries
Self-Instructional the discrete topology.
96 Material
Let (X1, T1) and (X2, T2) be topological spaces and let Y be their Cartesian Order Topology
product, Y = X1 × X2 = {(x1, x2): x1 ∈ X1, x2 ∈ X2}. The sets of the form U × V,

with U ∈T1 and V ∈ T2, form a base and, since U × V = U × X2 ∩ X1 × V, the sets
{U × X2, X1 × V : U ∈ T1, V ∈ T2} constitute a subbase for the product topology.
NOTES
The projection maps, p1 and p2, on the Cartesian product X1 × X2, are
defined by
p1 : X1 × X2 → X1, (x1, x2) → x1
p2 : X1 × X2 → X1, (x1, x2) → x2.
Then the product topology is the weakest topology on the Cartesian product
X1 × X2 such that both p1 and p2 are continuous – the σ(X1, X2, { p1 , p2})-
topology.
We would like to generalize this to an arbitrary Cartesian product of
topological spaces. Let {(Xα, Tα): α ∈I} be a collection of topological spaces
indexed by the set I. We recall that
X = ΠαXα, the Cartesian product of the Xα’s, is defined to be the collection
of maps γ from I into the union  α Xα satisfying γ(α) ∈ Xα for each α ∈ I. Wee
can think of the value γ(α) as the α-coordinate of the point γ in X. The idea is to
construct a topology on X = ΠαXα built from the individual topologies Tα. There
are two possibilities. The first is the weakest topology on X with respect to which
all the projection maps pα → Xα are continuous. The second is to construct the
topology on X whose open sets are unions of ‘super rectangles’, that is, sets of the
form ΠαUα, where Uα ∈ Tα for every α ∈ I. In general, these two topologies are
not the same.
Definition: The product topology, denoted Tprod on the Cartesian product of the
topological spaces {(Xα, Tα): α ∈I} is the σ(ΠαXα, )-topology, where  is the
family of projection maps {pα : α ∈I}.
Note: Let G be a non empty open set in X, equipped with the product topology and let γ ∈ G.
Then, by definition of the topology, there exist α1,...., αn ∈I and open sets Uαi in Xαi, 1 ≤ i ≤ n,
such that
pα 1 (U α 1 ) ∩ ..... ∩ pα 1 (U α 1 ) ⊆ G .
−1 −1
γ∈
Hence there are open sets Sα, α ∈I, such that γ ∈ Πα Sα ⊆ G and where Sα
= Xα except possibly for at most a finite number of values of α in I. This means
that G can differ from X in at most a finite number of components.
Now let us consider the second candidate for a topology on X. Let  be
the topology on X with base given by the sets of the form Πα Vα, where Vα ∈ Tα
for α ∈I. Thus, a non empty set G in X belongs to  if and only if for any point x
in G there exist Vα ∈ Tα such that
Self-Instructional
Material 97
Order Topology X ∈ Πα Vα ⊆ G.
Here there is no requirement that all but a finite number of the Vα are equal
to the whole space Xα.
NOTES Definition: The topology on the Cartesian product ΠαXα constructed in this way
is called the box-topology on X and is denoted Tbox.
In general,  is strictly finer than the product topology, Tprod.
Theorem 1: A net (xλ) converges in (ΠαXα, Tprod) if and only if (pα(xλ)) converges
in (Xα, Tα) for each α ∈I.
Theorem 2: Suppose that  is any collection of subsets of a given set X satisfying
the finite intersection property. Then there is a maximal collection  containing 
and satisfying the finite intersection property, i.e., if
 ⊆ ′and if ′ satisfies the finite intersection property, then ′⊆ . Furthermore,
i. If A1,….., An ∈ , then A1 ∩ .... ∩ An ∈ , and
ii. If A is any subset of X such that A ∩ D ≠ φ for all D ∈ , then A ∈ .
Proof: As might be expected, we shall use Zorn’s lemma. Let  denote the
collection of those families of subsets of X which contain  and satisfy the finite
intersection property. Then  ∈ , so  is not empty. Evidently,  is ordered by
set-theoretic inclusion. Suppose that φ is a totally ordered set of families in . Let
A = 
∈φ
 . Then  ⊆ A, since  ⊆ , for all  ∈ φ. We shall show that A satisfies
the finite intersection property .To see this, let S1,…, Sn ∈A. Then each Si is an
element of some family i that belongs to φ. But φ is totally ordered and so there
is i0 such that i ⊆ i for all 1 ≤ i ≤ n. Hence S1∩….. ∩ Sn ≠ φ since  i0 satisfies
0
the finite intersection property. It follows that A is an upper bound for φ in .
Hence, by Zorn’s lemma,  contains a maximal element, , say.
i. Now suppose that A1, …., An ∈  and let B = A1 ∩ .... ∩ An. Let ' = 
∪ {B}. Then any finite intersection of members of ' is equal to a finite
intersection of members of . Thus ' satisfies the finite intersection property.
Clearly,  ⊆ ', and so, by maximality, we deduce that ' = . Thus
B ∈ .
ii. Suppose that A ⊆ X and that A ∩  ≠ φ for every D ∈ . Let ' =  ∪
{A}, and let D1,…., Dm ∈ '. If Di ∈ , for all 1 ≤ i ≤ m, then D1 ∩ ... ∩
Dm ≠ φ since  satisfies the finite intersection property. If Di ∈ A and some
Dj ≠ A, then D1 ∩ ... ∩ Dm has the form D1 ∩ ... ∩ Dk ∩ A with D1 ∩ ... ∩
D k ∈ . By (i), D 1 ∩ ... ∩ D k ∈  and so, by hypothesis,
A ∩ (D1 ... ∩ Dk) ≠ φ. Hence ' satisfies the finite intersection property
and, again by maximality, we have ' =  and thus A ∈ .
Self-Instructional
98 Material
We are now ready to prove Tychonov’s theorem which states that the Order Topology
product of compact topological spaces is compact with respect to the product

topology.
Theorem 3 (Tychonov’s theorem): Let {(Xα, Tα): α ∈I} be any given collection NOTES
of compact topological spaces. Then the Cartesian product (ΠαXα, Tprod),
equipped with the product topology is compact.
Proof: Let  be any family of closed subsets of ΠαXα satisfying the finite intersection
property. We must show that  F∈ F ≠ φ. By the previous Theorem 4.2, there is
a maximal family  of subsets of ΠαXα satisfying the finite intersection property
and with  ⊆  (Note that the members of  need not all be closed sets).
For each α ∈I, consider the family {pα(D): D ∈ }. Then this family satisfies
the finite intersection property because  does. Hence { pα (D ) :
D ∈ } satisfies the finite intersection property. But this is a collection of closed
sets in the compact space (Xα, Tα), and so D pα (D ) ≠ φ.

∈
That is, there is some xα ∈ Xα such that xα ∈ pα (D ) for every D ∈ . Let

x ∈ ΠαXα be given by pα(x) = xα, i.e., the αth coordinate of x is xα. Now, for any
α ∈I and for any D ∈ , xα ∈ pα (D ) implies that for any neighbourhood Uα of
xα we have Uα ∩ pα(D) ≠ φ. Hence p–1α( Uα) ∩ D ≠ φ for every D ∈ . By the
previous Theorem 4.2, it follows that pα–1( Uα) ∈ .
Hence, again by the previous Theorem 4.2, for any α1,..., αn∈I and
( )
neighbourhoods U α1 ,....,,U α n of xα1 ,...., xα n , respectively,, pα−11 U α1 ∩,.....,
( )
pα−1n U α n ∈ .
Furthermore, since  has the finite intersection property, we have that

( ) ( )
pα−11 U α1 ∩,....., pα−1n U α n ∩ D ≠ φ.
For every finite family α1,...., αn ∈I neighbourhoods U α1 ,...., U α n of

xα1 ,...., xα n , respectively, and every D ∈ .
We shall show that x ∈ D for every D ∈ . To see this, let G be any

neighbourhood of x. Then, by definition of the product topology, there is a finite
family α1,...., αm ∈I and open sets U α1 ,...., U α m such that
( ) ( )
x ∈ pα−11 U α1 ∩,....., pα−1m U α m ⊆ G.
Self-Instructional
Material 99
Order Topology But we have shown that for any D ∈ ,
( ) ( )
D ∩ pα−11 U α1 ∩,....., pα−1m U α m ≠ φ and therefore D ∩ G ≠ φ. We deduce
NOTES that x ∈ D , the closure of D, for any D ∈ . In particular, x ∈ F = F for every F
∈ . Thus, F
∈
F ≠ φ since it contains x. The result follows.

In mathematics, in general, a projection is a mapping of a set or of a mathematical
structure which is idempotent, i.e., a projection is equal to its composition with
itself. A projection may also refer to a mapping which has a left inverse. Both
these ideas are related. Let p be an idempotent map from a set E into itself (thus
p°p = IdE) and F = p(E) be the image of p. If we denote the map p viewed as a
map from E onto F by π and the injection of F into E by i, then we get i°π = IdF.
On the other hand, i°π = IdF implies that π°i is idempotent.
Initially, the notion of projection was introduced in Euclidean geometry to
denote the projection of the three-dimensional Euclidean space onto a plane. The
two main projections of this kind are
• Central projection: It is the projection from a point onto a plane. If C is
the center of projection, then the projection of a point P distinct from C is
the intersection with the plane of the line CP. The point C and the points P
such that the line CP is parallel to the plane do not have any image by the
projection.
• The projection onto a plane parallel to a direction D: The image of a
point P is the intersection with the plane of the line parallel to D passing
through P.
Definition: For each β∈Λ, the mapping πβ : πλ X λ → X β assigning to each
element <xλ> of πλ X λ its βth coordinate, πβ (< xλ > ) = xβ is known as the

projection mapping associated with the index β.
Consider the set πβ (Gβ ) where Gβ is an open subset of Xβ. It consists of

−1
all points p = {aλ ; λ ∈ Λ} in πλ X λ such that πβ ( p ) ∈ Gβ . In other words, πβ (Gβ )

−1
= πY
λ
λ where Y = G and Y = X whenever λ ≠ β that is π
β β λ λ β
−1
(Gβ) = X1 × X2 ×
...× Xβ−1 × Gβ × Xβ+1....× ...
Self-Instructional
100 Material
Definition: For each λ in an arbitrary index set Λ, let (Xλ, Tλ) be a topological Order Topology
space and let X = πλ X λ . Then the topology T for X, which has a subbase the
{ }
collection B* = π β−1 (Gλ ); λ ∈ ∧ and Gλ ∈ Tλ is called the product topology or NOTES
Tichonov topology for X and (X, T) is called the product space of the given spaces.
The collection B* is called the defining subbase for T. The collection B of all
finite intersection of elements of B* would then form the base for T.
Note: The projection mappings are continuous for Gβ in Tβ−open in Xβ ⇒ πβ (Gβ )

−1
∈ B* which is a subbase for T and therefore πβ (Gβ ) is T-open in

−1
X = πλ X λ .
Theorem 4: Let A be a member of the defining base for a product space

X = πλ X λ . Then the projection of A into any coordinate space is open.
Proof: Since A belongs to the defining base for X.
A = πλ {X λ ; λ ≠ α1 , α 2,.....α m }× Gα1 × ... × Gα m where Gαi is an open subset
of X αi . So for any projection πβ: X → Xβ,
 X β if β ≠ {α 1 , α 2 ,..., α m}
πβ(A) = G if β ∈ {α , α ,..., α }
 β 1 2 m
In either case πβ(A) is an open set.
Theorem 5: Every projection πβ : X → X β on a product space X = πλ X λ is

open.
Let G be an open subset of X. For every point p ∈ G, there is a member A
of the defining base of the product topology such that p ∈ A ⊂ G. Thus for any
projection πβ : X → X β , p ∈ G ⇒ πβ(P) ∈ πβ(A) ⊂ πβ(G).
But πβ(A) is an open set. Therefore, every point πβ(P) in πβ(G) belongs to
an open set πβ(A) which is contained in πβ(G) is an open set.
Note: As each projection is continuous and open, but projections are not closed maps, e.g.,
consider the space R × R with product topology.
Let H = {(x, y); x, y ∈ R and xy = 2}
Self-Instructional
Material 101
Order Topology Here H is closed in R × R but π1(H) = R ∼ (0)
is not closed with respect to the usual topology for R where π1 is the
projection in the first coordinate space R.
NOTES 5.3.2 Tychonoff Product Topology in Terms of Standard Subbase and
its Characterization
In topology, a subbase for a topological space X with topology T is a
subcollection B of T which generates T, such that T is the smallest topology
containing B. Following are some useful equivalent formulations of the definition:
Let X be a topological space with topology T. A subbase of this topology
T is defined as a subcollection B of T satisfying one of the two following equivalent
conditions:
1. The subcollection B generates the topology T. This implies that T is the
smallest topology containing B and so any topology U
on X containing B must also contain T.
2. The collection of open sets consisting of all finite intersections of elements
of B, together with the set X and the empty set, forms a basis for T. This
means that every non-empty proper open set in T can be written as
a union of finite intersections of elements of B. Clearly, given a point x in a
proper open set U, there are finitely many sets
S1, …, Sn of B, such that the intersection of these sets contains x and is
contained in U.
For any subcollection S of the power set P(X), there is a unique topology
having S as a subbase. Particularly, the intersection of all topologies
on X containing S satisfies this condition. In general, however, there is no unique
subbasis for a given topology. Thus, we can start with a fixed topology and find
subbases for that topology. We can also start with an arbitrary subcollection of the
power set P(X) and form the topology generated by that subcollection. Although,
we can freely use either equivalent definition above but in many cases, one of the
two conditions is more useful than the other.
Occasionally, a somewhat different definition of subbase is given which requires
that the subbase B cover X. In this case, X is an open set in the topology generated,
because it is the union of all the {Bi} as Bi ranges over B. This means that there can
be no confusion regarding the use of nullary intersections in the definition. However,
with this definition, the two definitions above do not remain equivalent. In other
words, there exist spaces X with topology T, such that there exists a
subcollection B of T such that T is the smallest topology containing B, yet B does
not cover X. In practice, this is a rare occurrence. For example, a subbase of a
space satisfying the T1 separation axiom must be a cover of that space.
Self-Instructional
102 Material
Let us consider an example first. Order Topology
Example 1: Consider the topology T = {φ, X, (a),(b, c)} on X = ( a, b, c) and the

topology T* = {φ, Y, (u)} on Y = (u, v). Determine the defining subbase B* of the
product topology on X × Y. NOTES
Solution:
X × Y = {(a, u), (a, v), (b, u), (b, v), (c, u), (c, v)} is the product set on
which the product topology is defined. The defining subbase B* is the class of
inverse sets π −x 1 (G ) and π −y1 (H ) where G is an open subset of X and H is an

open subset of Y. Computing, we have
π −x 1 ( X ) π y (Y ) = X × Y,
−1
π −x 1 (φ ) = π −x 1 (φ ) = φ
π −x 1 (a ) = {(a, u), (a, v)}
π −x 1 (b, c ) = {(b, u), (b, v), (c, u), (c, v)}
π −y1 (u ) = {(a, u), (b, u), (c, u)}
Hence, the defining subbase B* consists of the subsets of X × Y above. The

defining base B consists of finite intersections of members of the defining subbase,
that is,
B = {φ, X × Y, (a, u), (b, u), (c, u)}
{(a, u), (a, v)}, {(b, u), (b, v), (c, u), (c, v)}
{(a, u), (b, u), (c, u)}
Theorem 6: Let (Xλ, Tλ) be an arbitrary collection of topological spaces and let X
= πλ X λ . Let T be a topology for X. If T is the product topology for X, then T is
the smallest topology for X for which projections are continuous and conversely
also.
Proof: Let πλ be the λ-th projection map and let Gi be any Tλ-open subset of Xλ.
Then since T is the product topology for X, π λ −1 (Gλ ) is a member of the subbase
for T and hence π λ −1 (Gλ ) must be T-open. It follows that πλ is T- Tλ continuous.

Now let V be any topology on X such that πλ is V- Tλ continuous for each λ ∈ Λ.
Self-Instructional
Material 103
Order Topology
Then π λ −1 (Gλ ) is V-open for every Gλ ∈Tλ. Since V is a topology for X, V
contains all the unions of finite intersections of members of the collection { π λ −1 (Gλ ) ;
NOTES λ ∈ Λ and Gλ ∈Tλ}.
⇒ V contains T that is T is coarser than V. Thus T is the smallest topology
for X such that πλ is T– Tλ continuous for each λ ∈ Λ.
Conversely, let B* be the collection of all sets of the form π λ −1 (Gλ ) where
Gλ is an open subset of Xλ for λ ∈ Λ. Then by definition, a topology V for X will

make all the projections πλ continuous if and only if B* ⊂ V. Thus the smallest
topology for X which makes all the projections continuous, is the topology
determined by B* as a subbase.
Theorem 7: A function f : Y → X from a topological space Y into a product space
X = πλ X λ is continuous if and only if for every projection πβ : X → Xβ, the
composition mapping πβοf : Y → Xβ is continuous.
Proof: By the definition of product space, all projections are continuous. So if f is
continuous, then πβ οf being the composition of two continuous functions, is also
continuous.
On the other hand, suppose every composition function πβοf : Y → Xβ is
continuous. Let G be an open subset of Xβ. Then by the continuity of πβοf, (πβοf)−
1
(G) = f-–1 [πβ−1(G)] is an open set in Y. But the class of sets of the form πβ−1(G)
where G is an open subset of Xβ is the defining subbase for the product topology
on X. Since their inverse under f are open subsets of Y, f is a continuous function.
Note: The projection πx and πy of the product of two sets X and Y are the mappings of X × Y
onto X and Y respectively defined by setting πx (<x, y>) = x and πy (<x, y>) = y.
Theorem 8: If X and Y are topological spaces, the family of all sets of the form V
× W with V open in X and W open in Y is a base for a topology for
X × Y.
Proof: Since the set X × Y is itself of the required form, X × Y is the union of all the
members of the family. Now let <x, y> ∈ (V1 × W1) ∩ (V2 × W2) with V1 and V2
open in X and W1 and W2 open in Y. Then <x, y> ∈ (V1 ∩ V2) × (W1 × W2) = (V1
× W1) ∩ (V2 × W2) with V1 ∩ V2 open in X and W1 ∩ W2 open in Y. Then the family
is a base for topology for X × Y.
Theorem 9: Let Ci be a closed subset of a space Xi for i ∈ I. Then i∈πI Ci is a
Self-Instructional closed subset of i∈πI X i with respect to the product topology..

104 Material
Order Topology
Proof: Let X = i∈πI X i and C = i∈πI Ci . We claim X – C is an open set in the
product topology on X. Let x ∈ X – C. Then C = i π i−1 (Ci ) and so x ∉C implies

∈I
NOTES
that there exists j ∈I such that πj(x) ∉ Cj. Let Vj = Xj – Cj and let V = π j (V j ) .
−1
Then Vj is an open subset of Xj and so V is an open subset (in fact a member of the
standard subbase) in the product topology on X. Evidently πj(x) ∈ Vj and so x ∈
V. Moreover, C ∩ V = φ since πj(C) ∩ πj(V) = φ. So V ⊂ X – C. Thus, X – C is
a neighbourhood of each of its point. Therefore, X – C is open and C is closed
in X.
Check Your Progress

1. What do you mean by a product space?
2. Give definition for the product topology.
3. What does the Tychonov's theorem state?
4. What do you understand by a projection?
5. What is a subbase in topology?

QUESTIONS
1. A product space is defined to be the Cartesian product of a family of

topological spaces equipped with a natural topology called the product
topology.
2. The product topology, denoted Tprod on the Cartesian product of the
topological spaces {(Xα, Tα): α ∈I} is the σ(ΠαXα, )-topology, where 
is the family of projection maps {pα : α ∈I}.
3. Let {(Xα, Tα): α ∈I} be any given collection of compact topological spaces.
Then the Cartesian product (ΠαXα, Tprod), equipped with the product
topology is compact.
4. A projection is a mapping of a set or of a mathematical structure which is
idempotent, i.e., a projection is equal to its composition with itself. A
projection may also refer to a mapping which has a left inverse. Both these
ideas are related.
5. In topology, a subbase for a topological space X with topology T is a
subcollection B of T which generates T, such that T is the smallest topology
containing B.
Self-Instructional
Material 105
Order Topology
5.5 SUMMARY
• Product topology is the topology on the Cartesian product X×Y of two

NOTES topological spaces whose open sets are the unions of subsets A×B, where
A and B are open subsets of X and Y, respectively.
• The product topology is known as Tychonoff topology also.
• An order topology is a certain topology that can be explained on any totally
ordered set.
• A topological space X is known as orderable if there exists a total order
on its elements such that the order topology induced by that order and the
given topology on X coincide.
• A product space is defined as the Cartesian product of a family of topological
spaces equipped with a natural topology called the product topology.
• The Cantor set is homeomorphic to the product of countably many copies
of the discrete space {0, 1}.
• A net (xλ) converges in (ΠαXα, Tprod) if and only if (pα(xλ)) converges in
(Xα, Tα) for each α ∈I.
• If  ⊆ ′and if ′ satisfies the finite intersection property, then ′⊆ .
• Every projection πβ : X → X β on a product space X = πλ X λ is open.

• For any subcollection S of the power set P(X), there is a unique topology
having S as a subbase.
• A function f : Y → X from a topological space Y into a product space X =
π X λ is continuous if and only if for every projection π : X → X , the
λ β β
composition mapping πβοf : Y → Xβ is continuous.

• If X and Y are topological spaces, the family of all sets of the form V × W
with V open in X and W open in Y is a base for a topology for
X × Y.
5.6 KEY WORDS
• Product topology: It is the topology on the Cartesian product X×Y of two

topological spaces whose open sets are the unions of subsets A×B, where
A and B are open subsets of X and Y, respectively.
• Product space: It is defined to be the Cartesian product of a family of
topological spaces equipped with a natural topology called the product
topology.
Self-Instructional
106 Material
• Tychonov’s theorem: It states that the product of compact topological Order Topology
spaces is compact with respect to the product topology.

• Projection: it is a mapping of a set or of a mathematical structure which is
idempotent, i.e., a projection is equal to its composition with itself.
NOTES
• Central projection: Central projection is the projection from a point onto
a plane.
• Subbase: In topology, a subbase for a topological space X with topology
T is a sub collection B of T which generates T, such that T is the smallest
topology containing B.

AND EXERCISES

1. Write a short note on order topology.
2. Give a brief account of product topology.
3. Describe the Tychonov’s theorem briefly.
4. Discuss projection mappings using suitable theorems.
1. Explain the product topology on X × Y.
2. Discuss Tychonov’s product topology in terms of standard subbase and its
characterization with the help of examples.

India.
Ltd.
Sons, Inc.
Self-Instructional
Material 107
Topology: Subspace,
Closed Sets and
Hausdorff Spaces UNIT 6 TOPOLOGY: SUBSPACE,
CLOSED SETS AND
NOTES
HAUSDORFF SPACES
Structure
6.0 Introduction
6.1 Objectives
6.2 The Subspace Topology
6.2.2 Topology in Terms of Kuratowski Closure Operator and
Neighbourhood Systems
6.2.3 Dense Subsets
6.3 Closed Sets and Limit Points
6.3.1 Neighbourhoods; 6.3.2 Open Sets
6.3.3 Closed Sets
6.3.5 Closed Sets and Accumulation Points; 6.3.6 Closure
6.4 Hausdorff Spaces
6.6 Summary
6.7 Key Words
6.0 INTRODUCTION
A subspace of a topological space X is a subset S of X which is equipped with a

topology induced from that of X called the subspace topology. It is known as
the relative topology, or the induced topology, or the trace topology also. The
Kuratowski closure axioms are referred as a set of axioms that are used to define
a topology on a set. In this unit, you will learn about the subspace topology, relative
topology and topological groups. You will analyse topology in terms of Kuratowski
closure operator and neighbourhood systems interpreting Kuratowski closure
axioms. You will describe dense subsets, open sets, closed sets, limit point and
Neighbourhoods. You will deduce Bolzano-Weierstrass theorem. You will
understand Hausdorff spaces.
6.1 OBJECTIVES

• Understand subspace and relative topology, topological spaces and
topological groups
Self-Instructional
108 Material
• Analyse topology in terms of Kuratowski closure operator and Topology: Subspace,
Closed Sets and
neighbourhood systems interpreting Kuratowski closure axioms Hausdorff Spaces
• Comprehend dense subsets, open sets, closed sets, limit point and
Neighbourhoods
NOTES
• Prove and understand Bolzano-Weierstrass theorem
• Describe Hausdorff spaces
6.2 THE SUBSPACE TOPOLOGY
Consider a set X and a proper subset, φ ≠ Α ⊂ X. Then {φ, Α, X} is a topology

containing A. Actually, it is the smallest topology. Further, suppose φ ≠ B ≠ Α ⊂ X.
The smallest possible topology that contains both A, B is clearly {φ, Α, B, A∩B,
A∪B, X}. Similarly, if there are several different sets A1, …., An in the topology,
many other sets must be also there. This is the idea behind generating a topology.
Definition: Let (X, T) be a topological space. A set  ⊂ T is called a base for
T if,
T = {∪A: A ⊂ B}
Any G ∈  is called a basic open set. We will obtain the topology T by
taking all arbitrary unions of sets in .
Let us consider the following collection of subsets in R,
S = {(a, ∞): a ∈ R} ∪ {(−∞,b): b ∈ R}.
It is not a base for the standard topology of R, because the intersection of
two such subsets may not be in itself. However, these finite intersections are all the
open intervals and hence they form a base. This becomes the typical example for
a subbase.
Definition : Let (X, T) be a topological space. A set S ⊂ T is called a subbase if
{S1∩.....∩ Sn: Sj ∈ S, n∈ Z} is a base for T. Equivalently, T =  {B ⊂ X :  
for some finite subset  ⊂ S}.
Here, we can also say that T is generated by S. However, the same T may
be generated by different subbases. A topological space (X, T) may have different
bases or subbases.
Theorem 1: Any nonempty collection C ⊂ (X) defines a topology T such that C
is a subbase for T.
Proof: Let  ={   :  ⊂ C, #() < ∞}. Then, the topology is generated by C,
T = {   :  ⊂ }. In order to verify that T is a topology, use the De Morgan’ss
law.
Self-Instructional
Material 109
Topology: Subspace, However, not every C can be a base; additional conditions are needed.
Closed Sets and
Hausdorff Spaces The rest of the proof is left as an exercise.
NOTES
Topological Spaces: If X is a set, a family  of subsets of X defines a topology
on X if,
(i) φ ∈  , X∈ .
(ii) The union of any family of sets in  belongs to .
(iii) The intersection of a finite number of sets in  belongs to .
If  defines a topology on X, then we say that X is a topological space. The
sets in  are called open sets. The sets of the form X\U, U ∈ , are called closed
sets. If Y is a subset of X, then the closure of Y is the smallest closet set in X that
contains Y.
Let Y be a subset of a topological space X. Then we may define a topology
Y on Y, called the subspace or relative topology or the topology on Y induced by
the topology on X, by taking
Y = {Y∩ U | U∈ }.
A system  of subsets of X is called a basis (or base) for the topology  if
every open set is the union of certain sets in . Equivalently, for each open set U,
given any point x ∈ U, there exists B ∈  such that x ∈ B ⊂ U.
For example, the set of all bounded open intervals in the real line R forms a basis
for the usual topology on R.
Let x ∈ X. A neighbourhood of x is an open set containing x. Let x be the
set of all neighborhoods of x. A subfamily x of x is a basis or base at x, a
neighborhood basis at x, or a fundamental system of neighbourhoods of x, if for
each U∈x, there exists B∈x such that B ⊂ U. A topology on X may be specified
by giving a neighbourhood basis at every x∈X.
If X and Y are topological spaces, then there is a natural topology on the
Cartesian product X×Y that is defined in terms of the topologies on X and Y, called
the product topology. Let x∈X and y∈Y. The sets Ux× Vy as Ux ranges over all
neighbourhoods of x and Vy ranges over all neighbourhoods of y, forms a
neighbourhood basis at the point (x, y) ∈ X ×Y, for the product topology.
If X and Y are topological spaces, a function f: X → Y is continuous if
whenever U is an open set in Y, the set f–1(U)={x∈X|f(x)∈ U} is an open set in X.
A function f: X → Y is a homeomorphism of X onto Y if f is bijective and both f and
f–1 are continuous functions.
An open covering of a topological space X is a family of open sets having
Self-Instructional the property that every x∈X is contained in at least one set in the family. A subcover
110 Material
of an open covering is an open covering of X which consists of sets belonging to Topology: Subspace,
Closed Sets and
the open covering. A topological space X is compact if every open covering of X Hausdorff Spaces
contains a finite subcover.
A subset Y of a topological space X is compact if Y is compact in the subspace NOTES
topology. A topological space X is locally compact if for each x ∈ X there exists a
neighbourhood of x whose closure is compact.
A topological space X is Hausdorff (or T2) if given distinct points x and
y∈X, there exist neighbourhoods U of x and V of y such that U∩V=φ. A closed
subset of a locally compact Hausdorff space is locally compact.
Topological Groups
A topological group G is a group that is also a topological space, having the

property the maps (g1, g2) → g1g2 from G × G → G and g → g–1 from G to G
are continuous maps. In this definition, G × G has the product topology.
Lemma: Let G be a topological group. Then
(i) The map g → g–1 is a homeomorphism of G onto itself.
(ii) Fix g 0∈G. The maps g → g0g, g → gg0 and g → g0gg g0–1 are
homeomorphisms of G onto itself.
A subgroup H of a topological group G is a topological group in the subspace
topology. Let H be a subgroup of a topological group G and let p: G → G/H be
the canonical mapping of G onto G/H. We define a topology
UG/H on G/H, called the quotient topology, by G/H = {p(U)U∈ G}. Here, G
is the topology on G. By definition the canonical map p is open and continuous. If
H is a closed subgroup of G, then the topological space G/H is Hausdorff. If H is
a closed subgroup of G, then G/H is a topological group.
If G and G′are topological groups, a map f: G→ G′ is a continuous
homomorphism of G into G′ if f is a homomorphism of groups and f is a continuous
function. If H is a closed normal subgroup of a topological group G, then the
canonical mapping of G onto G/H is an open continuous homomorphism of G
onto G/H.
A topological group G is a locally compact group if G is locally compact as
a topological space.
Theorem 2: Let G be a locally compact group and let H be a closed subgroup of
G. Then,
(i) H is a locally compact group in the subspace topology.
(ii) If H is normal in G, then G/H is a locally compact group.
(iii) If G′ is a locally compact group, then G × G is a locally compact group in
the product topology. Self-Instructional
Material 111
Topology: Subspace, 6.2.2 Topology in Terms of Kuratowski Closure Operator and
Closed Sets and
Hausdorff Spaces Neighbourhood Systems
The Polish mathematician Kazimierz (Casimir) Kuratowski developed a radically

NOTES different approach to specifying a topology for a set. Kuratowski considered
particular functions from the set of subsets of K to the set of subsets of K as
explained below.
A topology for a set K is a collection of subsets of K such that,
• The union of any arbitrary subcollection is also a member of the collection.
• The intersection of finite numbers of members of the collection is also a
member of the collection.
• The null set belongs to the collection.
• The whole set K belongs to the collection.
The elements of the collection are called the open sets of the topology. The
openness of a set is not a property of the set itself but it refers only to the membership
of the set in the collection of subsets which is called the topology.
A set is defined as being closed with respect to a topology if its complement
is open with respect to the topology; i.e., if its complement belongs to the topology.
At least two sets, the null set and the whole set K are both open and closed in any
topology of K.
If the closed sets of a topology are given the open sets can easily be
constructed since they are simply the complements of the closed sets.
Kuratowski Closure Axioms
Every topological space consists of the following:
• A set of points.
• A class of subsets defined axiomatically as open sets.
• The set operations of union and intersection.
The class of open sets must be defined in such a way that the intersection of
any finite number of open sets is itself open and the union of any infinite collection
of open sets is likewise open. A point p is called a limit point of the set S if every
open set containing p also contains some point (s) of S (points other than p, should
p happen to lie in S ). The concept of limit point is fundamental to topology and it
can be used axiomatically to define a topological space by specifying limit points
for each set according to rules known as the Kuratowski closure axioms. Any set
of objects can be made into a topological space in various ways, but the usefulness
of the concept depends on the manner in which the limit points are separated from
Self-Instructional
each other.
112 Material
The Kuratowski closure axioms are referred as a set of axioms that are Topology: Subspace,
Closed Sets and
used to define a topology on a set. They were first introduced by Kuratowski, in Hausdorff Spaces
a slightly different form that applied only to Hausdorff spaces. In general topology,
if X is a topological space and A is a subset of X, then the closure of A in X is
NOTES
defined to be the smallest closed set containing A or equivalently the intersection
of all closed sets containing A. The closure operator C that assigns to each subset
of A its closure C (A) is thus a function from the power set of X to itself. The
closure operator satisfies the following axioms:
1. Isotonicity: Every set is contained in its closure.
2. Idempotence: The closure of the closure of a set is equal to the closure of
that set.
3. Preservation of Binary Unions: The closure of the union of two sets is
the union of their closures.
4. Preservation of Nullary Unions: The closure of the empty set is empty.
Definition: An operator C of ρ(X) into itself which satisfies the following four
properties mentioned in theorem 4 is called a closure operator on the set X.
Theorem 3: In the topological space (X, T), the closure operator has the following
properties.
(K1) C(φ) = φ
(K2) E ⊆ C(Ε)
(K3) C (C(Ε)) = C(Ε)
(K4) C (A∪B) = C(Α) ∪ C(Β)
Proof: (K1): Because the void set is closed and also we know that a set A is
closed if and only if,
A = C(Α), therefore it follows that C(φ) = φ.
(K2): It follows from the definition as C(Ε) is the smallest closed set
containing E.
(K3): Since C(Ε) is the smallest closed set containing E, we have C (C(Ε))
= C(Ε) by the result that a set is closed if and only if it is equal to its closure.
(K4): Since A ⊂ A∪B and B ⊂ A∪B, therefore
C(Α) ⊂ C (A∪B) and C(Β) ⊂ C (A∪B) and so
C(Α)∪C(Β) ⊂ C (A∪B) ...(1)
By (K2), we have
A ⊂ C(Α) and B ⊂ C(Β)
Therefore, A∪B ⊂ C(Α)∪C(Β)
Self-Instructional
Material 113
Topology: Subspace, Since C(Α) and C(Β) are closed sets and so C(Α)∪C(Β) is closed. By the
Closed Sets and
Hausdorff Spaces definition of closure, we have
C (A∪B) ⊂ C[C(Α)∪C(Β)] ...(2)
NOTES From Equations (1) and (2), we have
C (A∪B) = C(Α)∪C(Β).
Note: C(A ∩B) may not be equal to C(Α)∩C(Β). For example, if A = (0, 1), B = (1, 2), then C(Α)
= [0, 1], C(Β) = [1, 2].
Therefore,
C(Α)∩C(Β) = {1} where A∩B = φ
But C(φ) = φ. Therefore C (A∩B) = φ and thus C (A∩B) ≠ C(Α)∩C(Β).
Note: The closed sets are simply the sets which are fixed under the closure operator.
Theorem 4: Let C* be a closure operator defined on a set X. Let F be the family

of all subsets F of X for which C*(F) = F and let T be a family of all complements
of members of F. Then T is a topology for X and if C is the closure operator
defined by the topology T. Then C*(E) = C(E) for all subsets E ⊆ X.
Proof: Suppose Gλ∈T for all λ. We must show that ∪

λ
Gλ ∈ T,i.e., ∪G λ
λ
( ) ∈F .C
Thus, we must show that,
[( ) ]= (∪ G )
C* ∪
λ
Gλ
C
λ
λ
C
By (K ) (∪ G ) ⊆ C* [(∪ G ) ]
C C
2 λ λ
λ λ
So we need only to prove that,
C* ∪
λ
[( ) ] ⊆ (∪ G )
Gλ
C
λ
λ
C
By De Morgan’s Law, this reduces to the form,
C* ∩
λ
[
(Gλ ) C
] ⊆ ∩(G )
λ
λ
C
Since ( ∩
λ
(Gλ ) ) ⊆ ( (Gλ )C ) for each particular λ.
C
C*[ ∩
λ
(Gλ ) ] ⊆ C*[ (Gλ )C ] for each λ.
C
So, C*[ ∩
λ
(Gλ ) ] ⊆ ∩ C*[ (Gλ )C ]
C
λ
Self-Instructional
114 Material
Topology: Subspace,
But, Gλ∈Τ ⇒ (Gλ )C ∈F. Closed Sets and
Hausdorff Spaces
Hence, C*[ (Gλ )C ] = (Gλ )C

NOTES
Thus we have C*[ ∩
λ
(Gλ ) ] ⊆ ∩λ (Gλ )
C C
Consequently, if Gλ∈T, then ∪ Gλ ∈T.

λ
To check that φ, X ∈Τ, we observe that by Kuratowski closure axiom

(K2),
X ⊆ C*(X) ⊆ X ⇒ C*(X) = X ⇒ X ∈ F
Hence XC = φ ∈T.
Also by (Kurtowaski closure axiom K1) we have C*(φ) = φ ⇒ φ ∈ F
⇒ φC = X ∈T.
Finally consider that G1G2 ∈T. Then by hypothesis,
C*(G1)C = G1 C and C*(G2)C = G2C
We may now calculate,
C*[(G1∩ G2)C] =C*[ G1 C∪G2C ]
= C( G1 C)∪ C*( G2C)
= G1 C ∪ G2C = ( G1 ∩ G2)C
⇒ ( G1 ∩ G2)C ∈ F
⇒ G1 ∩ G2 ∈ T.
Because all the axioms for a topology are satisfied hence T is a topology.
We will now prove that C* = C.
We have discussed above that T is a topology for X. Thus members of T
are open sets therefore the closed sets are just the members of the family F.
By (K3), C*[ C*(E)] = C*(E)
This implies that C*(E) ∈ F. Now by axiom (K2) E ⊆ C*(E). Thus C*(E)
is a closed set containing E and hence C*(E) ⊇ C(E) ...(3)
The consder that C* (E) is the smallest closed set containing E. On the
other hand by axiom (K2),
E ⊆ C(E)∈ F.
So, C*(E) ⊆ C*(C(E)) = C(E) ...(4)
Thus by Equations (3) and (4),
C*(E) = C(E) for any subset E ⊆ X
Self-Instructional
Material 115
Topology: Subspace, 6.2.3 Dense Subsets
Closed Sets and
Hausdorff Spaces
Definition: Let A be a subset of the topological space (X, T). Then A is said to be
dense in X if A = X .
NOTES
Trivially the entire set X is always dense in itself. Q is dense in R since
Q = R.
Let T be finite complement topology on R. Then every infinite subset is
dense in R.
Theorem 5: A subset A of topological space (X, T) is dense in X iff for every
nonempty open subset B of X, A∩B ≠ φ.
Proof: Suppose A is dense in X and B is a nonempty open set in X. If A∩B = φ,
then A ⊆ X–B implies that A ⊂ X–B since X–B is closed. But then X–B
⊂ X contradicting such that A = X.
≠
Because A ⊂ X–B ⊂ X.
≠
Conversely assume that A meets every nonempty open subset of X. Thus

the only closed set containing A in X and consequently A = X. Hence A is dense in
X.
Theorem 6: In a topological space (X, T)
(i) Any set C, containing a dense set D, is a dense set.
(ii) If A is a dense set and B is dense on A, then B is also a dense set.
Proof: (i) Since D ⊂ C ⇒ D ⊂ C
But D = X, hence X ⊂ C also C ⊂ X so that C = X.

Thus C is dense in (X, T).
(ii) Since A is dense, A = X
Also B is dense on A.
⇒ Α ⊂ B ⇒ A ⊂ B = B (By closure property)
⇒ A⊂B
⇒ X = A⊂B
Thus B is dense in (X, T).
Self-Instructional
116 Material
Topology: Subspace,
Closed Sets and
Check Your Progress Hausdorff Spaces
1. What is a subbase?
2. What is a base for the topology? NOTES
3. What do you mean by an open covering?
4. What is a subcover?
5. What is a topological groups?
6.3 CLOSED SETS AND LIMIT POINTS
Let X be a metric space. All points and sets mentioned here are understood to be
elements and subsets of X.
(i) If r > 0, the set N (p, r) = {x ∈ X: d (p, x) < r}
is called a neighbourhood of a point p. The number r is called the radius of
N(p, r).
In the metric space R,∈ N (p, r) = {x ∈ R : | x – p | < r)
= {x ∈ R : p – r < x < p + r} = ]p – r, p + r[
Thus in this case, neighbourhood of p is an open interval with p as a mid-
point.
(ii) A point p is said to be a limit point of the set A if every neighbourhood of
p contains points of A other than p.
The set of all limit points of A is called the derived set of A and shall be
denoted by D (A).
1
The subset A = {1, 2
, 12 ...} of R has 0 as a limit point since for each
r > 0, we can choose a positive integer n0 such that 1/n0 < r and since 1/n0 ≠ 0, we
see that every neighbourhood N(0, r) of 0 contains a point of A other than 0.
The set 1 of integers has no limit point whereas the set of limit points of Q
(the set of rationals) is all of R as the reader can easily verify.
(iii) A point p is called isolated point of a set A if p ∈ A but p is not a limit
point of A.
(iv) Set A is said to be closed if D(A) ⊂ A, that is, if A contains all its limit
points.
(v) A point p is called an interior point of A if there exists a neighbourhood
N of p such that N ⊂ A.
Self-Instructional
Material 117
Topology: Subspace, The set of all interior points of A is called the interior of A and shall be
Closed Sets and
Hausdorff Spaces denoted by A°.
For example, if A = [0, 1], then A° = ]0, 1[.
NOTES (vi) A set A is said to be open if it contains a neighbourhood of each of its
points, that is, if to each p ∈ A, there exists a neighbourhood N(p) of p such that
N(p) ⊂ A.
Thus A is open if and only if every point of A is an interior point of A.
Thus for every r > 0, the open interval ] p – r, p + r[ is a neighbourhood of a point
p ∈ R so a subset A of R is open if and only if to each p ∈ A, there exists r > 0
such that
]p – r, p + r[ ⊂ A.
In particular, every open interval ]a, b[ is an open set.
For if p ∈ ]a, b[, take
r = min {p – a, b – p}. Then ]p – r, p + r [⊂] a, b[ showing that ]a, b[ is
open.
(vii) A set A is said to be perfect if A is closed and if every point of A is a
limit point of A.
(viii) The closure of a set A is the union of A with its derived set D(A) and
shall be denoted by A .
(ix) A set A is said to be dense in another set B if A ⊃ B.

Also, A is said to be dense in X or everywhere dense if A =X.
(x) A set A is said to be nowhere dense or non-dense if A contains no
neighbourhoods.
It is easy to see that a set A is nowhere dense if and only if ( A )º = Ø.
(xi) A set A is said to be bounded if there is a real number M and a point q
∈ X such that d(p, q) < M for all p ∈ A.
Theorem 7: In a metric space, every neighbourhood is an open set.
Proof: Let N(a, r) be a neighbourhood of any point a ∈ X so that N(a, r) =
{x ∈ X : d(a, x) < r}.
If p ∈ N(a, r) be arbitrary, then d(a, p) < r.
Let δ = r – d (a, p) > 0. We shall show that,
N (p, δ) ⊂ N(a, r).
Indeed y ∈ N (p, δ) implies d (p, y) < δ and the triangle inequality shows
that,
Self-Instructional
118 Material
d (a, y) < d (a, p) + d (p, y) < d (a, p) + δ Topology: Subspace,
Closed Sets and
= d (a, p) + r – d (a, p) = r. Hausdorff Spaces
This implies that y ∈ N (a, r).

Thus we have shown that, NOTES
y ∈ N (p, δ) ⇒ y ∈ N(a, r) and so N (p, δ) ⊂ N (a, r). Hence, N (a, r) is

neighbourhood of p and since p was any point in N (a, r), we conclude that
N (a, r) is an open set.
Theorem 8: Let p be a limit point of a subset A of a metric space. Then every
neighbourhood of p contains infinitely many points of A.
Proof: Suppose p has a neighbourhood N which contains only a finite number of
points of A. Let q1,...,qn be those points of N ∩ A, which are distinct from p. Let,
r = min {d (p, q) : 1 0 being the minimum of a finite set of positive numbers. The
neighbourhood N (p, r) contains no point of A different from p so that p is not a
limit point of A which is contradiction. Hence, every neighbourhood of p must
contain infinitely many points of A, thus establishing the theorem.
Corollary: A finite point set has no limit points.
Theorem 9: A set A is open if and only if its complement is closed.
Proof: Suppose A is open. To show that its complement A′ is closed. Let x be
any limit point of A′. Then every neighbourhood of x contains a point of A′. This
implies that no neighbourhood of x can be contained in A and so x is not an
interior point of A. Since A is open, this means that x ∈ A′ and consequently A′ is
closed.
Conversely, let A′ be closed and let x be an arbitrary point of A. Then
x ∉ A′. Since A′ is closed x cannot be limit point of A′. Hence, there exists a
neighbourhood N of x such that N contains no point of A′, that is, N ⊂ A. Thus, A
contains a neighbourhood of each of its points and so A is open.
Theorem 10: Let A be a closed subset of R which is bounded above. If u be the
least upper bound or lub of A, then u ∈ A.
Proof: Suppose u ∉ A. For every h > 0, there is a point x ∈ A such that u – h <
x < u, for otherwise u – h would be an upper bound of A. Thus every
neighbourhood of u contains a point x of A. Also x ≠ u since u ∉ A. It follows that
u is a limit point of A, which is not a point of A. Therefore, A is not closed which
contradicts the hypothesis. Hence u ∈ A as desired.
Note: If A is closed and bounded below and if l is greatest lower bound or glb of A, then
l ∈ A.
Self-Instructional
Material 119
Topology: Subspace, Proof is similar to that of the preceding theorem.
Closed Sets and
Hausdorff Spaces Theorem 11: Let (X, d) be a metric space. Then,
(i) The empty set ∅ and the whole space X are open as well as closed.
NOTES (ii) Union of an arbitrary collection of open sets is open.
(iii) Union of finite number of closed sets is open.
(iv) Intersection of an arbitrary collection of closed sets is closed.
Proof: To prove case (i), let {Aλ : λ∈A} be an arbitrary collection of open sets.
Let, A = ∪ {Aλ : λ∈ A}.
x ∈ A ⇒ x ∈ A for some λ ∈ A
⇒ There exists ∈ > 0 such that N( x, ∈) ⊂ Aλ [ Aλ is open]
⇒ N (x,∈) ⊂ A∈ [ Aλ ⊂ A]
⇒ A is open (By definition).
Proofs of Cases (ii) and (iii) at once follow by using De Morgan laws for
complements. Thus to prove case (ii) let Ai, i = 1, 2,..., n be a finite collection of
closed sets. Then,
Ai is closed ⇒ X – Ai is open V – i = 1, 2,...., n.
⇒ ∩ {X – Ai : i = 1, 2,..., n} is open by case (iii).
⇒ X – ∪ {Ai : i = 1, 2,..., n} is open.
[By De Morgan Law]
⇒ {Ai : i = 1, 2,..., n} is closed.
6.3.1 Neighbourhoods
A subset N of R is called a neighbourhood of a point p ∈R if N contains an open
interval containing p and contained in N, that is, if there exists on open interval ] a,
b [such that,
p ∈]a, b[ ⊂ N.
It immediately follows that an open interval is a neighbourhood of each of its
points. For practical purposes, it will therefore suffice to take open intervals
containing a point of its neighbourhoods.
Note if ]a, b[ is an open interval containing a point p so that a 0, such that ]p – ε, p + ε[ ⊂ ]a, b[. Choose any ε less than
the smaller of the two numbers p–a and b–p]. Clearly ]p–ε, p + ε[ is an open
interval containing p and so it is a neighbourhood of p. We shall use this form of
neighbourhood of p, usually called an e-neighbourhood of p and shall denote it by
Self-Instructional
120 Material
N(p, ε). We call ε as the radius of N(p, ε). The point p itself is a mid-point of Topology: Subspace,
Closed Sets and
centre of N(p, ε). It is evident that, Hausdorff Spaces
x ∈, (p, ε) if x – p < ε,
NOTES
We shall use the abbreviated form ‘nhd’ for the word ‘neighbourhood’.
3 5
(i) The closed interval [1, 3] is an nhd of 2 since ] , [ is an open interval
2 2
3 5
such that 2 ∈][ , [ ⊂ [1, 3]. But [1, 3] is not an nhd of 1 since there
2 2
exists no open interval which contains 1 and contained in [1, 3]. Similarly
[1, 3] is not an nhd of 3.
(ii) The set N of natural numbers is not nhd of any of its points since no open
interval can be a subset of N.
6.3.2 Open Sets
A subset G of R is called open if for every point p ∈ G, there exists an open
interval I such that p ∈ I ⊂ G.
This is equivalent to saying that G is open if for every p ∈ G, there exists ε
nhd N(p,ε) = ]p–ε, p + ε[such that N(p, ε) ⊂ G.
For example,
(i) Every open interval is an open set.
(ii) The empty set φ and the whole real line R are open sets. Since φ contains no
points, the preceding definition is satisfied. Hence φ is open.
To show that R is open, we observe that for every p ∈ R and every ε > 0,
we have ]p–ε, p + ε[ ⊂ R. Hence, R is open.
Now consider the following examples,
(i) The closed open interval [2, 3[ is not open, since there exists no ε-nhd of 2
contained in [2, 3[.
(ii) The set A={1/n : n ∈ N} is not open since no point of A has an ε-nhd contained
in A.
Theorem 12: The union of any collection of open sets is an open set.
Proof: Let C be any collection of open sets and let S be their union, that is, let S
=  {G : G ∈ C}. Let p ∈S. Then p must belong to at least one of the sets in C,
say p ∈ G. Since G is open there exists and ε-nhd N(p, ε) of p such that N(p, ε)
⊂ G. But G ⊂ S, and so N(p, ε) ⊂ S. Hence S is open.
Self-Instructional
Material 121
Topology: Subspace, Theorem 13: The intersection of a finite collection of open sets is open.
Closed Sets and
Hausdorff Spaces
n
Proof: Let S =  G , where each Gi is open. Assume p ∈S.

i =1
i
NOTES
If S is empty, there is nothing to prove. Then p ∈Gi for every i=1, 2,....,n.
Since Gi is open, there exists εi > 0 such that N(p, εi) ⊂ Gi, for every i = 1, 2,...,
n. Let ε = min [ε1, ε2,...., εn].
n
Then N(p, ε) ⊂ G
i =1
i = S. Hence S is open.
Note: The intersection of an infinite collection of open sets is not necessarily open. For
example, if Gn = ]–1/n, 1/n] (n ∈ N), then each Gn is open (being an open interval), but
n
G
i =1
n = {0} which is not open since there exists no ε > 0 such that]– ε, ε[ ⊂ {0}.
Example 1: Show that complement of every singleton set in R is open. More

generally, the complement of a finite set is open.
Solution: Let {x) be a singleton set in R. To show that its complement {x)’ is
open. Let y ∈{x}’. If {x}’ = φ, there is nothing to prove. Then y ≠ x. Set x – y =
r > 0. Let 0 < ε < r. Then N(y, ε)=] y–ε, y + ε[ does not contain x and therefore
N(y, ε) ⊂ {x)’. Hence {x}’ is open. Again, if A={x1, x2..., xn} is any finite subset
of R, then we can write A={x1}  {x2}  ...  {xn}. Then A’=[{x1}  ... 
{xn}]’= {x1}’  ...  {xn}’. Since each {x1}’ is open.
6.3.3 Closed Sets

Definition: A set F in R is called closed if its complement F is open.
For example, (i) Every closed interval [a,b] is closed, since its complement [a,b]'
=] –∞, a[  ] b, ∞[is open, being a union of two open intervals.
(ii) Every singletion set in R is closed. More generally every finite set in R is
closed.
(iii) The closed open interval [a,b[ is closed.
Theorem 14: (i) The union of a finite collection of closed sets is closed.
(ii) The intersection of an arbitary collection of closed sets is closed.
Proof: (i) Let Fi (i = 1,2,..., n) be a finite collection of closed sets. Then each Fi′
is open. By De Morgan law, we have Fi′ which is open, being the intersection of
finite collection of open sets. Hence Fi is closed.
Self-Instructional
122 Material
Let C be an arbitrary collection of closed sets. Then each F ∈ C is closed Topology: Subspace,
Closed Sets and
and so its complement F′ is open. By De Morgan law, we have (  F)′=(F ∈ C), Hausdorff Spaces
which is open. Hence  F (F ∈ C) is closed.

For example if A is open and B is closed, then show that AB is open sets and NOTES
BA=B  A', which is the intersection of two closes sets. Hence, AB is open and
BA is closed.
If A ⊂ R, then a point p ∈ R is called an accumulation point (or a limit point) of A
if every ε -nhd N(p, ε ) of p contains a point of A distinct from p.
The set of all accumulation points of A is called the first derived set (or
simply the derived set) of A and is denoted by D(A). The first derived set of D(A)
is called the second derived set of A and is denoted by D2(A).In general, nth
derived set of A is denoted by Dn(A).
For example,
(i) Every point of the closed interval [a,b] is an accumulation point of the set of
points in the open interval ]a,[b. So in this case D]a,b[=a,b].
(ii) 0 is the only accumulation point of the set A ={1/n:n ∈ N}.
Hence D(A)={0}.
(iii) Every real number is an accumulation point of the set Q of rational numbers
and so D(Q) = R.
(iv) If A = [2,3[, then D (A) = [2,3].
If A ⊂ R, then a point p ∈ R is called an adherent point of A if every
ε -nhd of p contains a point of A. The set of all adherent points of A is called the
adherence of A denoted by Adh (A).
Theroem 15: If p is an accumulation point of A,then every ∈ nhd of p contains
infinitely many points of A.
Proof: Assume the contrary, that is suppose there exists an ∈ nhd (b, ∈ ) = p
+ ∈ [of p which cantains only a finite number of point distinct from p, say p1, p2 , . .
p . Let r denote the smallest of the positive numbers.
. n,
p − p1 , p − pa , ...., p − p n .
Then N(p, r/2) = ]p–r/2, p + r/2[ is an ε-nhd of p which contains no points

of A distinct from p. This is a contradiction. Hence every ε-nhd of p must contain
infinitely many points of A.
Self-Instructional
Material 123
Topology: Subspace, A set is said to be of first species if it has only a finite number of derived
Closed Sets and
Hausdorff Spaces sets. It is said to be of second species if the number of its derived sets is infinite.
Note that if a set is of first species, then its last derived set must be empty.
NOTES A set whose (n + 1)th derived set is empty is called a set of nth order.
For example, the set Q of all rational numbers is of second species, since
D(Q) = R, D2(Q) = D(R) = R.
D3(Q) = D(R) = R, etc.
Hence, all the derived sets of Q are equal to R.
Consider that A = {1/n : n ∈ N}. Then D(A) = {0}. Since D(A) consists of a
single point, it cannot have any limit point and so D2(A) = φ. Therefore A is of first
species and first order.
1 1 1 1 1 1 1 1 1 1
Again let A = {1, , , + , , + , , + ....}. Then A has the limit
2 3 2 3 4 2 4 5 2 5
1 1 1 1
point 0 and also the limit point , for the subset {1, , , ,....} is dense at the
2 2 3 4
1 1 1 1 1 1
origin and the subset { , + , + ,....} is dense at . Therefore
2 2 3 2 4 2
1
D(A) = {0, } and D2(A) = φ. Hence A is of first species and first order..
2
1 1 2 1 1 1 1 1 1 1
For example, let A = {1, , ( ) , + ( )2, ( )3, + ( )3, ( )2 + ( )3,
2 2 2 2 2 2 2 2 2
1 1 1 1 1 1 1 1
( )4, + ( )4, ( )2 + ( )4, ( )3 + ( )4, ( )5,...}.
2 2 2 2 2 2 2 2
Then it is clear by inspection that,
1 1 2 1 3
D(A) = {0, , ( ) , ( ) , ....}, D2(A) = {0} and D3(A) = φ.
2 2 2
Hence in this case, A is of first species and second order.
Let the points of a set A be given by,
1 1 1 1
S1 + S2 + S3 + ,
3 5 7 11S4
Where S1, S2, S3, S4 each have all positive integral values.
Hence D(A) consists of the four sets of points given by,
Self-Instructional
124 Material
Topology: Subspace,
1 1 1 1 1 1 1 1 1 Closed Sets and
S1 + S2 + S3 , S1 + S2 +, S4 , S1 + S3 , Hausdorff Spaces
3 5 7 3 5 11 3 7 11S4
1 1 1
S 2 + S3 + and the six sets of the points, NOTES
5 7 11S4
1 1 1 1 1 1 1 1
S1 + S2 , S1 + S2 , S1 + S4 , S 2 + S3
3 5 3 7 3 11 5 7
1 1 1 1
S2 + S4 , S3 + and four sets of the points,
5 11 7 11S4
1 1 1 1
S1 , S2 , S3 , together with the single point 0.
3 5 7 11S4
D2(A) consists of the last ten of these sets and the point 0, D3(A) consists of the
last four sets and the point 0 and D4(A) consists of the point 0 only. Thus, the set
A is of the first species and fourth order.
Example 2: Show that, zeros of sin (1/x) form a set of first order, zeros of sin
 
   
 1   
   1 
1 form a set of second order; zeros of sin form a set of third
 sin   1
 x sin
 1
 
 sin x 
order, and so on.
1 1 1
Solution: The zeros of sin are given by sin =0, which gives = nπ or
x x x
1 1
x= , where n is an integer. Hence if A is the set of zeros of sin , then A
nπ x
1
consists of all of the form where n is an integer. Clearly D(A) = {0} and so A
nπ
is of first order.
1 1
Again sin 1 = 0, gives 1 = nπ, where n is an integer..
sin sin
x x
Self-Instructional
Material 125
Topology: Subspace,
Closed Sets and 1 1 1
Hausdorff Spaces Then sin = , from which the general value is given by,,
x nπ x
1 1
NOTES = nπ + sin–1 = where m is an integer
x nπ
1
or x= ....(1)
1 
−1 
mπ + sin  
 nπ 
 
 1 
Thus the zeros of sin 
1  form a set, say B, of points of the form (1). It
 sin 
 x
1
is clear that D(B) consists of points of the form and the point 0 and so D2(B)
mπ
consists of the single point 0. Hence B is of second order.
 
 
 
 1 
Similarly we can show that the zeros of sin form a set of third order, and
 1
 sin 1 
 
 sin x 
so on.
Theorem 16 (Bolzano-Weierstrass Theorem): A bounded infinite set of real
numbers has at least one limit point.
Proof: Let A be an infinite bounded subset of R. Then, there exist finite constants
m and M such that m ≤ a ≤ M for all a ∈A. At least one of the intervals [m,
(m+M), M] must contain an infinite number of points of A. We rename such an
1
interval as [a 1 +b 1 ]. Similarly, one of the intervals [a 1,
2
1
(a1 + b1), [a1 + b1], [ (a1 + b1), b1] contains infinitely many points of A and we
2
desingnate it as [a2,b2]. Now proceed with [a2, b2] as we did with [a1, b1]. Con-
tinuing in this way, we obtain a sequence of closed intervals {In}=
Self-Instructional
126 Material
Topology: Subspace,
M –m Closed Sets and
{[an, bn]} such that In ⊃ In +1 and [Ιn] = bn– an= →0 as n →∝. Hence In Hausdorff Spaces
2n
consists of a single point, say x0. We choose n such that bn–an<ε. Then In ⊂ ]xo–
ε, x0+ε[ and consequently the interval ]xo–ε, x0+ε[contains an infinite number of NOTES
points of A. It follows that x0 is a limit point of A. This completes the proof.
6.3.5 Closed Sets and Accumulation Points
A closed set was defined to be the complement of an open set. The Theorem 1.17
describes closed sets in another way.
Theorem 17: A set A is closed if and only if it contains all its accumulation points.
Proof: Assume A closed and P is an accumulation point of A. We have to prove
that P ∈A. suppose, if possible, P ∉A . Then P ∈A, and since A, is an open, there
exists an ∈-nhd N(p, ∈ )=]sP-, P+ ∈ [such that N (p , ∈ ) ⊂ A. Consequently N (p
, ∈) contains no point of A, contradicting the fact that p is an accumulation point of
A. Hence, we must have P ∈A.
Conversely, we assume that A contains all its accumulation points and show
that A is closed. Let P ∈A′. Then P ∉A, so by hypothesis p is not an accumulation
point of A. Hence there exists an ∈-nhd N (p , ∈ ) of p which contains no point of
A other then p. Since P ∉A, N((p , ∈ ) contains no point of A and consequently N
(p , ∈ ) ⊂ ∀A′. Therefore A′ is open, and hence A is closed.
Theorem 18: All the derived sets D (A), D2 (A), ... Dn (A),... of a given set A are
closed sets and each of these derivatives, after the first, consists of points belong-
ing to the preceding one and therefore to D (A).
Proof: We first prove that D (A) is closed. Let p be any accumulation point (limit
point) of D. Then every ∈-nhd of p contains infinitely many points of D (A) and
since point of D (A) is an accumulation point of A, every ∈-nhd of p must contain
infinitely many points of A. Thus, p is also a limit point of A and so p ∈D (A).
Therefore, D (A) contains all its accumulation points and so D (A) is closed. Again
since D2 (A) is the derived set of D (A), and so it must be closed as proved earlier.
Similarly D2 (A), ..Dn (A), ... are closed sets.
To prove the second part of the theorem, let x ∈ Dn (A), n ≥ 2 and sup-
pose, if possible, that p ∉D (A). Then there can be found an ∈-nhd of x which
contains only a finite number of points of A or no such points and this nhd would
therefore contain no points of D (A) and consequently it can contain no point of
D2 (A). D3 (A), ..., Dn (A) which is contrary to the hypothesis that x ∈ Dn (A).
Hence every point of Dn (A) (n ≥ 2) must belong to D (A).
Self-Instructional
Material 127
Topology: Subspace, 6.3.6 Closure
Closed Sets and
Hausdorff Spaces
The closure of a set A in R is the smallest closed set containing A and is denoted
by A .
NOTES
By this definition , A ⊂ A . Also A is always a closed set of A.
Theorem 19: Let A be a set in R. Then A = A  D (A), i.e., A is the set of all
adherent points of A.
Proof: We first observe that A  D (A) is closed. For if p is any limit of A  D (A).
then either p is a limit point of A or a limit of D (A). If p is a limit point of A, then
p ∈D (A). If p is a limit point of D(A), then since D (A) is closed p ∈D (A). So on
either case, p ∈D (A) and surely then p ∈ A  D (A). Hence A  D (A) is closed.
Now A  D (A) is a closed set containing A, and since A is the smallest

closed set containing A, we have
A ⊂ A  D (A). ...(5)
Also A ⊂ A ⇒ D (A) ⊂ D(A) .. (6)
Since A is closed, we have D ( A ) ⊂ A . ... (7)
∴ From Equations (6) and (7), D (A) ⊂ A .
Moreover, A ⊂ A , and D (A) A ⊂ A ⇒ A  D (A) ⊂ A .... (8)
∴ From Equations (5) and (8), A = A  D (A).

Theorem 20: Let A, B be subsets of R, Then:
(i) A ⊂ B ⇒ A ⊂ B , (ii) A  B ⊂ A  B .
(iii) A  B ⊂ A  B , (iv) A = A .
Proof: (i) Given A ⊂ B. But B ⊂ B always. Hence A ⊂ B, Thus B is a closed set

containing A. But A is the smallest closed set containing A. Hence A ⊂ B .
(ii) A ⊂ A  B ⇒ A ⊂ A  B and B ⊂ A  B⇒ B A  B by case (i).
Hence, A  B ⊂ A  B . ... (9)

Again A ⊂ A and B ⊂ B ⇒A  B ⊂ A  B . But A  B is closed, being the
union of two closed sets. Thus A  B is a closed set containing A  B. But A  B
is the smallest closed set containing A  B. Hence A  B ⊂ A  B
.... (10)
∴ From Equations (9) and (10), A  B = A  B .
Self-Instructional
128 Material
Topology: Subspace,
(iii) A  B ⊂ A⇒ A  B ⊂ A and A  B ⊂ B ⇒ A  B ⊂ B by case (i). Closed Sets and
Hausdorff Spaces
Hence A  B ⊂ A  B .
(iv) Since A is closed, hence A = A . NOTES
Consider the following examples:

(i) If Q is the set of rational numbers, then
D(Q) = R and so Q = Q  D (Q) = Q  R = R.
(ii) Let A =]2, 3[. Then D(A)=[2, 3] and so
A = A  D(A) = [2, 3].

(iii) Let A be any finite set in R. Since every finite set of real numbers is closed, we
have A =A.
6.4 HAUSDORFF SPACES
Theorem 21: Let X be a Hausdorff topological space. Then no net in X can have
two different limits.
Proof: Let X be a Hausdorff topological space and ( xλ )λ∈∧ be a net in X. Suppose
a, b ∈ X and we have both xλ → a and xλ → b . We claim a = b must hold.
If not, by the Hausdorff property of X, there are U, V ⊂ X open, disjoint
with a ∈ U and b ∈ V. By the definition of xn → a , there is λ a ∈ Λ so that
xλ ∈U ∀λ ≥ λ a . By the definition of xλ → b , there is λ b ∈ Λ so that xλ ∈ B ∀λ ≥ λb .
Since Λ is directed, there is λ ∈ Λ with λ ≥ λ a and λ ≥ λ b . Then both xλ ∈ U
and xλ ∈ V hold. But this leads to the contradiction xλ ∈ U ∩ V =θ.
Theorem 22: Let X be a topological space in which there is no net with two
different limits. Then X is Hausdorff.
Proof: Take a, b ∈ X with a ≠ b . Our claim is that there exist U and V open with
a ∈ U , b ∈ V and U ∩ V ≠ φ . If not, we have U ∩ V ≠ φ for any open U ,V ⊆ X
where a ∈ U , b ∈ V .
From this we need to find a net with two limits (which will be a and b). We
take for the index
= set Λ {(U ,V ) : U ,V ⊆ X open, a ∈ U , b ∈ V } where we define
the order (U1 ,V1 ) ≤ (U 2 ,V2 ) to mean that both U1 ⊇ U 2 and V1 ⊇ V2 hold. It is
straightforward to check that Λ is then a directed set. The least trivial part is to
show that (U1 ,V1 ),(U 2 ,V2 ) ∈ Λ implies there is (U 3 ,V3 ) ∈ Λ with (U1 ,V1 ) ≤ (U 3 ,V3 ) Self-Instructional
Material 129
Topology: Subspace,
Closed Sets and and (U 2 ,V2 ) ≤ (U 3 ,V3 ) . We just take U=
3 U 1 ∩ U 2 and V=
3 V1 ∩ V2 and check U3
Hausdorff Spaces
and V3 open, a ∈U 3 , b ∈ V3 and the four containments we need.
NOTES For each

= λ (U ,V ) ∈ Λ choose one xλ ∈ U ∩ V . Then ( xλ )λ∈Λ is a net in
X and we claim both xλ → a and xλ → b .
To verify xλ → a , take a neighbourhood N a ∈ a . Then

λ 0 (( N a )°, X ) ∈ Λ .
= If =λ (U ,V ) ∈ Λ satisfies λ ≥ λ0 , then
xλ ∈ U ∩ V ⊆ U ⊆ ( N a )° ⊆ N a . To verify xλ → b we argue in a similar way but
take
= λ 0 ( X , ( N b )°) .
Check Your Progress

6. What is a neighbourhood of a point?
7. What is an open set?
8. What is an accumulation point?

QUESTIONS
1. Let (X, T) be a topological space. A set S ⊂ T is called a subbase if

{S1∩.....∩ Sn: Sj ∈ S, n∈ Z} is a base for T. Equivalently, T =  {B
⊂ X :   for some finite subset  ⊂ S}.
2. A system  of subsets of X is called a basis (or base) for the topology  if
every open set is the union of certain sets in . Equivalently, for each open
set U, given any point x ∈ U, there exists B ∈  such that x ∈ B ⊂ U.
3. An open covering of a topological space X is a family of open sets having
the property that every x∈X is contained in at least one set in the family.
4. A subcover of an open covering is an open covering of X which consists of
sets belonging to the open covering.
5. A topological group G is a group that is also a topological space, having the
property the maps (g1, g2) → g1g2 from G × G → G and g → g–1 from G
to G are continuous maps.
6. A subset N of R is called a neighbourhood of a point p ∈R if N contains an
open interval containing p and contained in N, that is, if there exists on open
interval ] a, b [such that,
Self-Instructional
p ∈]a, b[ ⊂ N.
130 Material
7. A subset G of R is called open if for every point p ∈ G, there exists an open Topology: Subspace,
Closed Sets and
interval I such that p ∈ I ⊂ G. Hausdorff Spaces
8. If A ⊂ R, then a point p ∈ R is called an accumulation point (or a limit point)

of A if every ε -nhd N(p, ε ) of p contains a point of A distinct from p. NOTES
6.6 SUMMARY
1. A ny nonempty collection C ⊂ (X) defines a topology T such that C is a

subbase for T.
2. If  defines a topology on X, then we say that X is a topological space.
3. If X and Y are topological spaces, then there is a natural topology on the
Cartesian product X×Y that is defined in terms of the topologies on X and Y,
called the product topology.
4. A function f: X → Y is a homeomorphism of X onto Y if f is bijective and
both f and f–1 are continuous functions.
5. A subset Y of a topological space X is compact if Y is compact in the subspace
topology.
6. A topological space X is Hausdorff (or T2) if given distinct points x and
y∈X, there exist neighbourhoods U of x and V of y such that U∩V=φ.
7. We define a topology UG/H on G/H, called the quotient topology, by G/H =
{p(U)U∈ G}. Here, G is the topology on G.
8. If G and G′are topological groups, a map f: G→ G′ is a continuous
homomorphism of G into G′ if f is a homomorphism of groups and f is a
continuous function.
9. The elements of the collection are called the open sets of the topology. The
openness of a set is not a property of the set itself but it refers only to the
membership of the set in the collection of subsets which is called the topology.
10. A set is defined as being closed with respect to a topology if its complement
is open with respect to the topology; i.e., if its complement belongs to the
topology.
11. In general topology, if X is a topological space and A is a subset of X, then
the closure of A in X is defined to be the smallest closed set containing A or
equivalently the intersection of all closed sets containing A.
12. The closure operator C that assigns to each subset of A its closure C (A) is
thus a function from the power set of X to itself. The closure operator satisfies
the following axioms:
Self-Instructional
Material 131
Topology: Subspace, • Isotonicity: Every set is contained in its closure.
Closed Sets and
Hausdorff Spaces • Idempotence: The closure of the closure of a set is equal to the closure
of that set.
NOTES • Preservation of Binary Unions: The closure of the union of two sets is
the union of their closures.
• Preservation of Nullary Unions: The closure of the empty set is empty.
13. Let A be a subset of the topological space (X, T). Then A is said to be
dense in X if A = X .
14. A point p is called isolated point of a set A if p ∈ A but p is not a limit point
of A.
15. Set A is said to be closed if D(A) ⊂ A, that is, if A contains all its limit points.
16. A point p is called an interior point of A if there exists a neighbourhood N of
p such that N ⊂ A.
17. A set A is said to be open if it contains a neighbourhood of each of its
points, that is, if to each p ∈ A, there exists a neighbourhood N(p) of p such
that N(p) ⊂ A.
18. A set A is said to be perfect if A is closed and if every point of A is a limit
point of A.
19. The closure of a set A is the union of A with its derived set D(A) and shall
be denoted by A .
20. The union of any collection of open sets is an open set.
21. The union of a finite collection of closed sets is closed.
22. The intersection of an arbitary collection of closed sets is closed.
23. If A ⊂ R, then a point p ∈R is called an accumulation point (or a limit point)
of A if every ε -nhd N(p, ε ) of p contains a point of A distinct from p.
24. A set is said to be of first species if it has only a finite number of derived
sets. It is said to be of second species if the number of its derived sets is
infinite.
25. A bounded infinite set of real numbers has at least one limit point.
26. A set A is closed if and only if it contains all its accumulation points.
27. The closure of a set A in R is the smallest closed set containing A and is
denoted by A .
28. Let X be a Hausdorff topological space. Then no net in X can have two
different limits.
29. Let X be a topological space in which there is no net with two different
limits. Then X is Hausdorff.
Self-Instructional
132 Material
Topology: Subspace,
6.7 KEY WORDS Closed Sets and
Hausdorff Spaces
• Open covering: An open covering of a topological space X is a family of

open sets having the property that every x∈X is contained in at least one NOTES
set in the family.
• Sub Cover: A subcover of an open covering is an open covering of X
which consists of sets belonging to the open covering.
• Topological groups: A topological group G is a group that is also a
topological space, having the property the maps (g1, g2) → g1g2 from G ×
G → G and g → g–1 from G to G are continuous maps.
• Limit point: A point p is said to be a limit point of the set A if every
neighbourhood of p contains points of A other than p.
• Neighbourhood: A subset N of R is called a neighbourhood of a point
p ∈R if N contains an open interval containing p and contained in N, that is,
if there exists on open interval ] a, b [such that,
p ∈]a, b[ ⊂ N.
• Open sets: A subset G of R is called open if for every point p ∈ G, there
exists an open interval I such that p ∈ I ⊂ G.

AND EXERCISES

1. Give a brief description of subspace and relative topology.
2. Interpret topology in terms of Kuratowski closure operator and
Neighbourhood systems.
3. Describe dense subsets briefly.
4. Write a short note on limit points.
5. Discuss Bolzano-Weierstrass theorem in brief.
1. Discuss closed sets and limit points in detail
2. Give a detailed account of Kuratowski clouse axioms.
3. Give a comparative account of closed open sets and closed sets.
4. Explain Hausdorff spaces with suitable theorems.
Self-Instructional
Material 133
Topology: Subspace,
Closed Sets and 6.9 FURTHER READINGS
Hausdorff Spaces
NOTES India.
Ltd.
Sons, Inc.
Self-Instructional
134 Material
Continuous Function,
UNIT 7 CONTINUOUS FUNCTION, Product Topology and

Homeomorphism
PRODUCT TOPOLOGY AND

NOTES
HOMEOMORPHISM
Structure
7.0 Introduction
7.1 Objectives
7.2 Continuous Functions and Continuity of a Function
7.3 Homeomorphism
7.4 The Product Topology
7.6 Summary
7.7 Key Words
7.0 INTRODUCTION
A function for which sufficiently small changes in the input result in arbitrarily small
changes in the output is known as a continuous function. Otherwise, a function is
called a discontinuous function. A continuous function with a continuous inverse
function is known as a homeomorphism. Continuity of functions is one of the core
concepts of topology. A product space is the Cartesian product of a family
of topological spaces equipped with a natural topology known as the product
topology. In this unit you will study continuous functions and continuity of a function.
You will understand characterisation of continuous functions using pre-images.
You will learn general properties of continuous functions. You will describe
homeomorphisms. The product topology is also discussed in this unit.
7.1 OBJECTIVES

 Understand continuous function, continuity of functions and general
properties of continuous functions
 Analyse characterisation of continuous functions using pre-images
 Describe homeomorphisms
 Explain the importance of the product topology
Self-Instructional
Material 135
Product Topology and 7.2 CONTINUOUS FUNCTIONS AND
Homeomorphism
CONTINUITY OF A FUNCTION
NOTES D R is compact if and only if for any given open covering of D we can subtract
a finite sucovering. That is, given (G),  A, a collection of open subsets of R
(A an arbitrary set of indices) such that D  A G , then there exist finitely
many indices 1,...,n  A such that D  iN1 G1 .
Let D be an arbitrary subset of R. Then A  D is open in D (or relative

to D, or D-open) if and only if there exists G open subset of R such that
D = G D. Similarly we can define the notion of D-closed sets. Note that D is
both open and closed in D and so is .
D  R is connected if and only if  and D are the only subsets of D which
are both open in D and closed in D. In other words, if D = A B and A, B are
disjoint D-open subsets of D, then either A =  or B = 
Let D R, a  D a fixed element and f : D  R an arbitrary function. By
definition, f is continuous at a if and only if the following property holds:
  0, a   0
such that x  a  a  and x  D  f (x) – f (a)  

The last implication can be rewritten in terms of sets as follows:
f Ba  a   D  B f a ( )
Here, we use the notation Bx(r) : = (x – r, x + r).
Theorem 1: Let D R and f : D  R a function. Then the following propositions
are equivalent:
 f is continuous (on D).
 G  R open, f–1(G) is open in D.
 F  R closed, f–1(F) is closed in D.
Proof: a b. Let G  R open. Pick a  f–1(G). Then f (a)  G and since G is
open, there must exist  > 0 such that B f a   G . By continuity,,
corresponding to this  > 0 there exists  > 0 such that
f Ba   D  B f a  . But this places the entire set B0() D inside
f–1(G):
Self-Instructional
136 Material
Ba   D  f 1 G Product Topology and
Homeomorphism
Writing now  = a to mark the dependence of  on a and varying a 
–1
f (G), we obtain
NOTES
f 1 G   a f –1 G Ba  a D
which shows that f–1 (G) is open in D.

b c. Let F R a closed set, which is equivalent to saying that
G = GF (the complement in R) is open.
Then
f 1 F  x  D | f x  F  x  D | f x  G  D – f –1 G
Since the complement of a D-open subset of D is D-closed, it means that f

–1
(F) is closed in D if and only if f–1(G) is open in D.
c a: Left as an exercise.
Using this characterization, we can prove for example that the composition
of continuous functions is a continuous function.
Proposition: Assume f : D  R is continuous, g : E  R is continuous and f (D)
E. Then the function h := gof : D  M defined by h(x) = g(f(x)) is continuous.
Proof: Let G R an open set. Then h–1(G) = f–1(g–1(G)). But g–1(G) = V E,
for some open set V R. But then h–1(G) = f–1(V E) – f–1(V) is open in D. So
h is continuous.
Theorem 2: Assume f : D  R is a continuous function, such that f(x)  0,
x  D . Then h : D  R given by h(x) = 1/f(x), is continuous as well.
Proof: g : R – {0}  R g(x) = 1/x is continuous, f(D) R – {0}, hence h = gof
is continuous.
Theorem 3: A continuous function maps compact sets into compact sets.
Proof: In other words, assume f : D  R is continuous and D is compact. Then
we need to prove that the image f(D) is a compact subset of R. For that, we
consider an arbitrary open covering f(D) G of f(D) and we will try to find a
 
finite subcovering. Taking the preimage we have D 
f–1(G). But f–1(G) is
–1
open in D, so there must exist Va R open such that f (G) = V D. Then D

(V D) which simply means that D V . We thus arrived at an open
 
covering of D. So there must exist finitely many indices 1,..., N such that D
Self-Instructional
Material 137
, which implies the equality D = i 1 (Vi  D)  i 1 f Gi . But
Product Topology and N N N –1
Homeomorphism i 1 Gi
this implies in turn that f ( D )  iN1 Gi is compact.

NOTES
Theorem 4: A continuous function maps connected sets into connected sets.
In other words, assume f : D  R is continuous and D is connected. Then
f(D) is connected as well.
Proof: Assume f(D) is not connected. Then there must exist A, B disjoint, non-
empty subsets of f(D), both open relative to f(D), such that f(D) = A B. Being
open relative to f(D) simply means there exists U, V R open such that A = f(D)
U, B = f(D) V. So f(D) U  V. But this implies that
D  f–1(U) f–1(V). Since U, V are open, it follows that f–1(U) and f–1(V) are
open relative to D. But they are also disjoint. Since D is connected, it follows that
at least one of them, say f–1(U), is empty. But A U, so this forces
f (A) =  as well, which is impossible unless A =  (note that A is a subset of the
–1
image of f ), contradiction.
Theorem 5: A continuous function on a compact set is uniformly continuous.
Proof: Assume D compact and f : D  R continuous. Given > 0 we need to
find  > 0 such that if x, y  D and |x – y| < , then |f(x) – f(y)| < .
From the definition of continuity, given  > 0 and x  D, there exists
x  such that if |y – x| < x, then |f(y) – f(x)| < . Clearly D
1 
 x D B x       . From this open covering we can extract a finite
2 
subcovering (D is compact), meaning there must exists finitely many x1, x2, ....,xN
1
 D such that D   iN1 B xi (  xi (/2)).
2
1
Let now  = min{  xi (/2)}.
2
Take y, z  D arbitrary such that |y – z| < . The idea is that y will be
near some xj, which in turn places z near that same xj. But that forces both f(y),
f(z) to be close to f(xj) (by continuity at xj), and hence close to each other.
1
Since y  D, there must exist some j, 1 < j < N such that y  Bx (  x j
j 2
(/2)). Thus
1
 |y – xj|<  x (/2)
Self-Instructional 2 j
138 Material
1 Product Topology and
 but |y – z|< ()   x j (/2) Homeomorphism
2
1 NOTES
By the triangle inequality it follows that |z – x| <  x j (/2). So y, z are within
2
1
 x (/2) of x.
2 j
This implies that
 |f(y) – f(xj)|< /2
 |f(z) – f(xj)|< /2
By the triangle inequality once again we have | f(y) – f(z)| <.
Assume f is not uniformly continuous, meaning that there exists  > 0 such that no
1
 > 0 does the job. Checking what this means for  = , we see
n
1
that for any such 3n  1 there exist xn, yn  D such that |xn – yn| < and yet
n
|f(xn) – f(yn)| > . However D is compact; in particular any sequence in D has a
convergent subsequence whose limit belongs to D. Applying this principle twice
we find that there must exist n1< n2 < ... such that the subsequences xnk and
k 1
ynk
k 1
are convergent, and x = lim x xnk D, y = lim x ynk D. We have
the following:
1 1
 By construction, xnk – ynk   . Taking the limit, we find x = y..
nk k
 By continuity, lim k  f xn  f ( x) , since x  D. Also

k
lim k  f ynk  f ( y ) .
 Also by construction, f xnk – ynk > . Hence in the limit, |f(x) – f(y)|
>.
We thus reach a contradiction.
Self-Instructional
Material 139
Continuous Function, Proposition: Let D R. Then the following propositions are equivalent:
Product Topology and
Homeomorphism
a) D is compact
b) D is bounded and closed
NOTES
c) Every sequence in D has a convergent subsequence whose limit belongs
to D.
Proof: a b. D R = n 1  – n, n is an open covering of that D. Hence
N  1 such that D n 1  – n, n = (–N, N). This shows that D is bounded.

To prove D is closed, we prove that R – D is open. Let y  R – D. Then D
 1 1 
n 1  R  [ y – , ]  . This open covering must have a finite subcovering, so
 n n 
1 1
N  1 such that D  R – [ y  , y  ]. But this implies that
N N
 1 1
 y  , y    R – D . But y was chosen arbitrary in R – D, so this set is
 N N
open, and hence D itself is closed.
b c. This has to do with the fact that every bounded sequence has a convergent
subsequence.
c b. Here one shows D = D and this has to do with the fact that D is the set of
limits of convergent sequences of D, etc.

c a. Let D k 1 Gk be an arbitrary open covering of D.
Note: A covering by a countable collection of open sets is not the most general infinite open
covering one can imagine, of course; we need an intermediate step to prove that from any
open covering of D we can extract a countable subcovering, and this has to do with the fact
that R admits a countable dense set.

We will now prove that there exists n  1 such that D k 1 Gk . Assume this was

not the case. Then N  1 , there exists xn  D – k 1 Gk . But xn is a sequence
in D, so it must have a convergent subsequence; call it xn j , with limit in D. So

j 1
lim j  xn j  a  D . But a belongs to one of the Gi’s, say a  GN. Since GN is
open, it follows that xn j  GN , for j  j0 (j large enough). In particular this shows
Self-Instructional
140 Material
n
that for j large enough (larger than j0 and larger than N) we have xn j  GN  k j 1 , Product Topology and
Homeomorphism
since nj  j > N. This contradicts the defining property of xn’s.
Theorem 6: R is connected. NOTES
Proof: This can be restated as,  and R itself are the only subsets of R which are
both open and closed. To prove this, let E be a non-empty subset of R with this
property. We will prove that E = R. For that, take an arbitrary c  R. To prove
that c  E, we assume that c  E and look for a contradiction. Since E is non-
empty, it follows that E either has points to the left of c or to the right of c. Assume
that the former holds.
 Consider the set S = {x  E|x < c}. By construction, S is bounded from
above (c is an upper bound for S). Therefore we can consider
y = lub(S)  R.
 Input: E is closed. Then S = E  – , c is also closed. Then y  S = S,
so y < c.
 Input: E is open, y  S E and E is open. This means that there exists  >
0 such that (y – , y + ) E. Choose  small enough so that  < c – y. In
that case z = y +/2  (y – , y + ) E is an element of E with the
properties,
o z < c, hence z  S
o z>y
which is in contradiction with the defining property of y.
Theorem 7: The only connected subsets of R are the intervals (bounded or
unbounded, open or closed or neither).
Proof: First we prove that a connected subset of R must be an interval.
Let E R be a connected subset. We prove that if a < b  E, then [a,b]
E. In other words, together with any two elements, E contains the entire interval
between them. To see this, let c be a real number between a and b. Assume c 
E. Then E = A B, where A = (–, c) E and B = (c, +  E. Note that A
and B are disjoint subsets of D, both open relative to D. Since S is connected, at
least one of them should be empty, contradiction, since a  A and b  B. Thus c
 E.
To show that E is actually an interval, consider inf E and sup E. E is bounded.
Then m = inf E, M = sup E  R, and clearly E [m, M]. On the other hand, for
any given x  (m, M), there exists a,b  E such that a < x < b. That is because
m, M  E and one can find elements of E as close to m (respectively M) as
desired (draw a picture with the interval (m, M) and place a point x inside it). But
Self-Instructional
Material 141
Continuous Function, then [a,b] E, and in particular x  E. Since x was chosen arbitrarily in (m, M),
Homeomorphism we must have (m, M) E [m, M], so E is definitely an interval. Case two: E is
unbounded. With a similar argument, show that E is an unbounded interval.
NOTES Conversely, we need to show that intervals are indeed connected sets. The
proof is almost identical to that in the case where the interval is R itself.
Theorem 8: Let D R be compact and f : D  R be a continuous function. Then
there exists y1, y2  D such that f (y1)  f(x)  f(y2), x  D.
Proof: f(D) is a compact subset of R, so it is bounded and closed. This implies
that glb(f(D))  f(D) and lub(f(D))  f(D) as well. But then there must exist y1, y2
 D such that f(y1) = glb f(D) and f(y2) = lub f(D). But this implies f(D) [f(y1),
f(y2)] and we are done.
Note: We use the notation supx D f(x) to denote the lub of the image of D. In other words,
supx D f(x) = lub{f(y) | y  D}. The theorem says that if D is compact and f is continuous, then
supx D f(x) is finite, and moreover that there exists y1  D such that f(y1) = supx D f(y). If the
domain is not compact, one can find examples of continuous functions such that either i) sup
f = +  or such that ii) sup f is a real number but not in the image of f.
For case i), take f(x) = 1/x defined on (0,1]. For case ii), take f(x) = x defined on [0,1).
Theorem 9: A continuous (real-valued) function defined on an interval in R has
the intermediate value property.
Proof: Assume E is an interval in R and f: E  R a continuous function. Let a,b 
E (say a < b) and y a number between f(a) and f(b). The intermediate value
property is the statement that there exists c between a and b such that f(c) = y. But
this follows immediately from the fact that f(E) is an interval. E is an interval in R
E is connected f(E) is a connected subset of R f(E) is an interval in R.
7.3 HOMEOMORPHISM
Topological equivalence redirects here. There is no need of a continuous deformation

for two spaces to be homeomorphic.In the mathematical field of topology, a
homeomorphism or topological isomorphism (from the Greek words (homoios)’
means similar and (morphe)’ means shape which is taken form Latin deformation
of morphe is a bicontinuous function between two topological spaces.
Homeomorphisms are the isomorphisms in the category of topological spaces,
that is, they are the mappings which preserve all the topological properties of a
given space. Two spaces with a homeomorphism between them are called
homeomorphic, and from a topological viewpoint they are the same.
A topological space is a geometric object, and the homeomorphism is a
continuous stretching and bending of the object into a new shape. Thus, a square
Self-Instructional
and a circle are homeomorphic to each other, but a sphere and a donut are not.
142 Material
An often-repeated joke is that topologists can not tell the coffee cup from which Continuous Function,
they are drinking from the donut they are eating, since a sufficiently pliable donut Homeomorphism
could be reshaped to the form of a coffee cup by creating a dimple and progressively
enlarging it, while shrinking the hole into a handle.
NOTES
A homeomorphism maps points in the first object that are ‘close together’
to points in the second object that are close together and points in the first object
that are not close together to points in the second object that are not close together.
Topology is the study of those properties of objects that do not change when
homeomorphisms are applied.
A function ‘f’ between two topological spaces ‘X’ and ‘Y’ is called a
homeomorphism if it has the following properties:
 ‘f’ is a bijection (1-1 and onto).
 ‘f’ is continuous.
 The inverse function ‘f’ –1 is continuous (f is an open mapping).
A function with these three properties is sometimes called bicontinuous. If such a
function exists, we say ‘X’ and ‘Y’ are homeomorphic. A self-homeomorphism is
a homeomorphism of a topological space and itself. The homeomorphisms form
an equivalence relation on the class of all topological spaces. The resulting
equivalence classes are called homeomorphism classes. For example,
 The unit 2-disc D2 and the unit square in R2 are homeomorphic.
 The open interval (–1, 1) is homeomorphic to the real numbers R.
 The product space S1 and the two-dimensional torus are homeomorphic.
 Every uniform isomorphism and isometric isomorphism is a homeomorphism.
 Any 2-sphere with a single point removed is homeomorphic to the set of all
points in R2 (a 2-dimensional plane).
 Let A be a commutative ring with unity and let S be a mutiplicative subset of
A.
 An example of a continuous bijection that is not a homeomorphism is the
map that takes the half-open interval [0,1) and wraps it around the circle.
In this case the inverse — although it exists — fails to be continuous. The
primage of certain sets which are actual open in the relative topology of the
half-open inteval are not open in the more natural topology of the circle
(they are half-open intevals).
Homeomorphisms are the isomorphisms in the category of topological
spaces. As such, the composition of two homeomorphisms is again a
homeomorphism and the set of all self-homeomorphisms ‘X’ forms a group called
the homeomorphism group of ‘X’.
Self-Instructional
Material 143
Continuous Function, For some purposes, the homeomorphism group happens to be too big, but by
Homeomorphism means of the isotopy relation, one can reduce this group to the mapping class
group.
NOTES 1. Two homeomorphic spaces share the same topological properties. For
example, if one of them is compact, then the other is as well; if one of them
is connected, then the other is as well; if one of them is Hausdorff, then the
other is as well; their homology groups will coincide. Note however that
this does not extend to properties defined via a metric; there are metric
spaces which are homeomorphic even though one of them is complete and
the other is not.
2. A homeomorphism is simultaneously an open mapping and a closed mapping,
that is it maps open sets to open sets and closed sets to closed sets.
3. Every self-homeomorphism in S1 can be extended to a self-homeomorphism.
Check Your Progress

1. Write any two general properties of a continuous functions.
2. What does homeomorphism mean in topology?
3. A square and a circle are homeomorphic to each other, but a sphere and a
donut are not. Why?
4. Give an example of a continuous bijection that is not a homeomorphism.
7.4 THE PRODUCT TOPOLOGY
In topology and related fields of mathematics, there are many limitations that we
often make on the kinds of topological spaces that we wish to consider. Some of
these restrictions are given by the separation axioms. These separation axioms
are often termed as Tychonoff separation axioms, after Andrey Tychonoff. The
separation axioms are axioms only in the sense that, when defining the notion of
topological space, one could add these conditions as extra axioms to get a more
restricted notion of what a topological space is. The separation axioms are denoted
with the letter ‘T’ after the German Trennungsaxiom, meaning separation axiom.
The separation axioms are used to distinguish disjoint sets and distinct points.
It is not enough for elements of a topological space to be distinct. They have to
be topologically distinguishable. In the same way, it is not enough for subsets of
a topological space to be disjoint. They have to be separated in some way.
Suppose X is a topological space. Then the two points x and y in X are topologically
distinguishable if they do not have exactly the same neighbourhoods or we can
say that at least one of them has a neighbourhood that is not a neighbourhood of
Self-Instructional
144 Material
the other. If x and y are topologically distinguishable points, then the singleton Continuous Function,
sets {x} and {y} must be disjoint. Homeomorphism
Two points x and y are separated if each of them has a neighbourhood that
is not a neighbourhood of the other. More generally, two subsets A and B of X are NOTES
separated if each is disjoint from the other’s closure; the closures themselves do
not have to be disjoint. The points x and y are separated if and only if their singleton
sets {x} and {y} are separated. All of the remaining conditions for sets may also
be applied to points or to a point and a set by making use of singleton sets.
Additionally, subsets A and B of X are separated by neighbourhoods if they
have disjoint neighbourhoods. They are separated by closed neighbourhoods if
they have disjoint closed neighbourhoods. They are separated by a function if
there exists a continuous function f from the space X to the real line R such that
the image f(A) equals {0} and f(B) equals {1}. Lastly, they are precisely separated
by a function if there exists a continuous function f from X to R such that
the preimage f–1({0}) equals A and f –1({1}) equals B. Any two topologically
distinguishable points must be distinct and any two separated points must be
topologically distinguishable. Moreover, any two separated sets must be disjoint
and any two sets separated by neighbourhoods must be separated, and so on.
Theorem 10: A topological space X is Hausdorff if and only if the diagonal is
closed in X  X with the product topology.
Proof: Let D denote the diagonal {( x, x) | x  X } in X  X.
Suppose D is closed. Then the complement of D is open. We want to show
that X is Hausdorff. Let x  y . The point ( x, y ) lies in an open set disjoint from D.
In particular, there is a basis open set about ( x, y ) that does not intersect D. Let U
× V be such a basis open set so U and V are both open in XClearly, if y U  V 
then ( y, y)  U  V . But U × V does not intersect D, and hence U and V are
disjoint open sets.
Conversely, suppose X is Hausdorff. Then, we want to show that D is
closed.
We know that given x  y , there are disjoint open sets U and V containing
x and y respectively. Thus, any ( x, y ) lies inside an open set
U × V. Further, as U V is empty, the set U × V does not intersect D. Hence, for
every point outside D, there is a neighbourhood of the point outside D. Taking the
union of all these neighbourhoods, we conclude that the complement of D is open,
and hence that D is closed.
Though the two directions of proof seem almost identical to one another,
there is a subtle difference. In proving that the diagonal is closed from Hausdorffness,
Self-Instructional
Material 145
Continuous Function, all we need to use is that products of open sets are open. Thus, the same proof
Homeomorphism will go through if we add more open sets. On the other hand, the proof of
Hausdorffness from the diagonal being closed critically uses the fact that the so
called open rectangles the products of open setsform a basis.
NOTES
Theorem 11: The product of Hausdorff spaces is Hausdorff in the product
topology.
Proof: Let X and Y be the two Hausdorff spaces. Then, the product space is X 
Y.
Select the points ( x1 , y1 ) and ( x2 , y2 ) . Now either x1  x2 or y1  y2 .
If x1  x2 , first separate x1 and x2 in X. That is, choose disjoint open sets in

X : U1 containing x1 and U2 containing x2. Clearly U1 × Y and U2 × Y are disjoint
open sets containing ( x1 , y1 ) and ( x2 , y2 ) respectively..
If y1  y2 , then separate y1 and y2 in Y, say, by V1 and V2. Then X × V1 and

X × V2 are disjoint open sets containing ( x1 , y1 ) and ( x2 , y2 ) .
Theorem 12: Every subspace of a regular space is regular.
Proof: Let X be the regular topological space and A be a subset. Choose x  A
and C closed in A. For x  X, choose D, a closed subset of X such that D  A  C .
Such a D exists from the way the subspace topology is defined. Clearly, whatever
D is picked up for the purpose, x  D because the only points in D A are in a
set not containing x.
Since X is regular, we can find open sets U and V in X such that x U ,
C V , and U and V are disjoint. Now, U A and V A are disjoint open
subsets of A, with x  U  A and C  V  A .
The two important facts that we chose are that x being a point in the subspace,
remained a point in the whole space and every closed set in the subspace was an
intersection with the subspace of a closed set in the whole space.
Theorem 13: A product space X λ is first axiom iff each space X is first
λ 
axiom and all but a countable number are indiscrete.
Proof: Let X λ be first axiom. Since each space X is homeomorphic to set

λ 
E where each
Self-Instructional
146 Material
 Homeomorphism
 xλ  such that xλ  z λ if λ  β

 xβ is any point of X β and
E  NOTES
 z λ  is a fixed point of X  Xλ
 λ
and the first axiom of countability is both hereditary and topological, each space is
first axiom. Now if the space X is indiscrete, we may choose a point x X
which is contained in an open set GXIf Xis indiscrete, we choose any point
x XLet X  x and suppose BnnN is a countable open base at X. For
each integer n, the set Bn must contain a member of the Tichonov base of the form
Yλ where Y is open in X for all and Y X for all but a finite number of
λ    
values of n n λ n k n The collection of all the expected values of i
kn and n  is countable. For any other value of we choose x 
GX if Xwas not discrete, but π λ 1 Gλ would then be an open set containing
X which would not contain any Bn. Hence for all other values of X must be
indiscrete.
Now suppose that X is first axiom for all and indiscrete for iiN.
Let X  xbe an arbitrary point in πλ X λ , and let Bn, be a countable open
base at x We note that Bn,   x for all n if    i The family
is a countable collection of open sets in the product
space. The set of all finite intersections of members of this collection is also countable
and it is already an open base at x, as required.
Check Your Progress

5. When are two points topologically distinguishable?
6. When is a topological space Hausdorff?

QUESTIONS
1. (i) A continuous function maps compact sets into compact sets.

(ii) A continuous function maps connected sets into connected sets.
Self-Instructional
Material 147
Continuous Function, 2. In the mathematical field of topology, a homeomorphism or topological
Homeomorphism isomorphism (from the Greek words (homoios)’ means similar and (morphe)’
means shape which is taken form Latin deformation of morphe is a
bicontinuous function between two topological spaces.
NOTES
3. A topological space is a geometric object, and the homeomorphism is a
continuous stretching and bending of the object into a new shape. Thus, a
square and a circle are homeomorphic to each other, but a sphere and a
donut are not.
4. An example of a continuous bijection that is not a homeomorphism is the
map that takes the half-open interval [0,1) and wraps it around the circle.
5. the two points x and y in X are topologically distinguishable if they do not
have exactly the same neighbourhoods or we can say that at least one of
them has a neighbourhood that is not a neighbourhood of the other. If x and y
are topologically distinguishable points, then the singleton sets {x} and {y}
must be disjoint.
6. A topological space X is Hausdorff if and only if the diagonal is closed in X
 X with the product topology.
7.6 SUMMARY
 D R is compact if and only if for any given open covering of D we can

subtract a finite sucovering. That is, given (G),  A, a collection of open
subsets of R (A an arbitrary set of indices) such that D  A G , then
there exist finitely many indices 1,...,n  A such that D  iN1 G1 .
 D  R is connected if and only if  and D are the only subsets of D which

are both open in D and closed in D. In other words, if D = A B and A, B
are disjoint D-open subsets of D, then either A =  or B = 
 Assume f : D  R is a continuous function, such that f(x)  0, x  D .
Then h : D  R given by h(x) = 1/f(x), is continuous as well.
 A continuous function on a compact set is uniformly continuous.
 Let D R. Then the following propositions are equivalent:
a) D is compact
c) Every sequence inDhas a convergent subsequence whose limit belongs toD.
 The only connected subsets of R are the intervals (bounded or unbounded,
Self-Instructional
open or closed or neither).
148 Material
 Let D R be compact and f : D  R be a continuous function. Then there Continuous Function,
exists y1, y2  D such that f (y1)  f(x)  f(y2), x  D. Homeomorphism
 A continuous (real-valued) function defined on an interval in R has the

intermediate value property. NOTES
 Homeomorphisms are the isomorphisms in the category of topological
spaces, that is, they are the mappings which preserve all the topological
properties of a given space.
 A homeomorphism maps points in the first object that are ‘close together’
to points in the second object that are close together and points in the first
object that are not close together to points in the second object that are not
close together.
 A function ‘f’ between two topological spaces ‘X’ and ‘Y’ is called a
homeomorphism if it has the following properties:
 ‘f’ is a bijection (1-1 and onto).
 ‘f’ is continuous.
 The inverse function ‘f’ –1 is continuous (f is an open mapping).
A function with these three properties is sometimes called bicontinuous.
 Separation axioms are often termed as Tychonoff separation axioms,
after Andrey Tychonoff.
 The separation axioms are denoted with the letter ‘T’ after
the German Trennungsaxiom, meaning separation axiom.
 The separation axioms are used to distinguish disjoint sets and distinct points.
 two subsets A and B of X are separated if each is disjoint from the
other’s closure; the closures themselves do not have to be disjoint.
 Every subspace of a regular space is regular.
 A product space X λ is first axiom iff each space X is first axiom and
λ 
all but a countable number are indiscrete.
7.7 KEY WORDS
 Continuous function: A function for which sufficiently small changes in

the input result in arbitrarily small changes in the output is known as a
continuous function.
 Homeomorphism: A continuous function with a continuous inverse
function is known as a homeomorphism.
Self-Instructional
Material 149
Continuous Function,  Product topology: A product space is the Cartesian product of a family
Homeomorphism of topological spaces equipped with a natural topology known as
the product topology.
 Separation axioms: Separation axioms are used to to distinguish disjoint
NOTES
sets and distinct points. They are denoted with the letter “T”

AND EXERCISES

1. Write a short note on characterization of continuous functions using pre-
images.
2. Describe general properties of continuous functions briefly.
3. Give an alternative proof using sequences to show that a continuous function
on a compact set is uniformly continuous.
4. Show that a topological space X is Hausdorff if and only if the diagonal is
closed in X×X with the product topology.
1. Discuss continuous functions and continuity of a function giving examples.
2. Discuss homeomorphisms with suitable examples.
3. Give a detailed account of the product topology.

India.
Ltd.
Sons, Inc.
Self-Instructional
150 Material
Metric and Quotient
UNIT 8 METRIC AND QUOTIENT Topology
TOPOLOGY
NOTES
Structure
8.0 Introduction
8.1 Objectives
8.2 Constructing Continuous Functions
8.3 The Metric Topology
8.4 The Quotient Topology
8.6 Summary
8.7 Key Words
8.0 INTRODUCTION
A metric space is a kind of topological space. In a metric space any union of open
sets is open and any finite intersection of open sets is open. Consequently a metric
space meets the axiomatic requirements of a topological space and is thus a
topological space. This particular property of a metric space was used to define a
topological space. A quotient space, also known as an identification space, is the
result of identifying certain points of a given topological space. The quotient topology
consists of all sets with an open pre-image under the canonical projection map
that maps each element to its equivalence class. In this unit you will study construction
of continuous functions. You will describe the metric topology and their properties.
The quotient topology is also explained in this unit.
8.1 OBJECTIVES

• Understand the construction of continuous functions
• Describe the metric topology and their properties
• Explain quotient topology
8.2 CONSTRUCTING CONTINUOUS FUNCTIONS
Continuity of functions is one of the core concepts of topology. The special case is
defined as where the inputs and outputs of functions are real numbers. A stronger
form of continuity is uniform continuity. Any function from a discrete space to any
Self-Instructional
Material 151
Metric and Quotient other topological space is continuous and also any function from any topological
Topology
space to an indiscrete space is continuous. Any constant function is continuous
(regardless of the topologies on the two spaces). The pre-image under such a
function of any set containing the constant value is the whole domain, and the pre-
NOTES image of any set not containing the constant value is empty.
Let f :  →  be given by f(x) = x3. Then f is a continuous function from
usual to usual.
Rules for Constructing Continuous Functions
Let X, Y, and Z be topological spaces.
1. Constant Function: If f : X → Y maps all of X into a single point y0 ∈ Y,
then f is continuous.
2. Inclusion: If A is a subspace of X, the inclusion function j : A → X is
continuous.
3. Composites: If f : X → Y and g : Y → Z are continuous, then the map
g ° f : X → Z is continuous.
4. Restricting the Domain: If f : X → Y is continuous and if A is a subspace
of X, then the restricted function f |A : A → Y is continuous.
5. Restricting or Expanding the Range: Let f : X → Y be continuous. If X
is a subspace of Y containing the image set f(X), then the function g : X →
Z obtained by restricting the range of f is continuous. If Z is a space having
Y as a subspace, then the functions h : X → Z obtained by expanding the
range of f is continuous.
6. Local Formulation of Continuity: The map f : X → Y is continuous if X
can be written as the union of open sets Uα such that f |Uα is continuous for
each α.
Check Your Progress

1. Give definition of a constant t function.
2. What do you understand by restricting the domain?
8.3 THE METRIC TOPOLOGY
Let X be a non-empty set. A function d from X × X into R (the set of reals) is

called a metric (or distance function) if for all x, y, z ∈ X, the following conditions
are satisfied.
[m 1]: d (x, y) > 0.
[m 2]: d (x, y) = 0 if and only if x = y.
[m 3]: d (x, y) = d (y, x). (Symmetry)
Self-Instructional [m 4]: d (x, z) < d (x, y) + d (y, z). (Triangle Inequality)
152 Material
(i) The pair (X, d) is called a metric space and d (x, y) is called the distance Metric and Quotient
Topology
between the points x and y.
Another definition is, the diameter of a subset A of a metric space X, denoted
by δ (A), is defined by, NOTES
δ (A) = sup {d(x, y): x, y ∈ A}.
(ii) The distance between two subsets A, B, of X, denoted by d (A, B), is
defined by,
d (A, B) = inf {d (x, y): x ∈ A, y ∈ B}.
(iii) The distance between a point a ∈ X and a set A ⊂ X is defined by,
d (a, A) = inf {d(a, x): x ∈ A}.
(iv) A subset A of X is said to be bounded if δ (A) is finite. It follows that A is
bounded if there exists a real number M and a point q ∈ X such that d (p, q)
< M for all p ∈ A.
The most important examples of metric spaces, for our purposes, are the Euclidean
spaces Rn, in particular the real line R and the complex plane R2. The distance in
Rn is defined by,
d (x, y) = | x – y | (x, y ∈ Rn). ...(1.1)
The conditions [m1], [m2], [m3] and [m4] are satisfied by Theorem 1.1
and thus Rn is a metric space.
Another example is Let X be any non-empty set. For x, y ∈ X, define
0 if x = y
d ( x, y ) = 
1 if x ≠ y.
Then it is easy to see that d is a metric on X called the discrete metric.

It can also be defined as,
(i) Let ai < bi for i = 1,..., n. Then the set of all points x = (xi,...,xn) in Rn
whose coordinates satisfy the inequalities ai < xi < bi (1 0. An open (or closed) ball with centre at a and
radius r is defined to be set of all x ∈ Rn such that |x – a| < r (or | x – a | <
r and shall be denoted by,
B (a, r) (or B [a, r]), Thus
B (a, r) = {x ∈ Rn: | x – a | < r}
and B [a, r] = {x ∈ Rn:| x – a | < r},
Self-Instructional
Material 153
Metric and Quotient (iii) A subset A of Rn is called to be convex if,
Topology
λx + (1 – λ) y ∈ A
whenever x ∈ A, y ∈ A and 0 < λ < 1.
NOTES A metric space is a kind of topological space. In a metric space any union of open
sets is open and any finite intersection of open sets is open. Consequently a metric
space meets the axiomatic requirements of a topological space and is thus a
topological space. It was, in fact, this particular property of a metric space that
was used to define a topological space.
Theorem 1: The collection of open spheres in a set X with metric d is a base for
a topology on X.
Proof : Let d be a metric on a non-empty set X. The topology τ on X generated
by the collection of open spheres in X is called the metric topology.
The set X together with the topology x induced by the metric d is a metric
space. A metric space then can be viewed as a topological space in which the
topology is induced by a metric.
Lemma 1: Let d be the usual metric in three dimensional space R. Then the set of
open spheres in R3 constitute a base for a topology on R3. Thus the usual metric
on R3 induces the usual topology on R3, the collection of all open sets.
Lemma 2: Let d be the usual metric on the real line R, i.e., d(a, b) = |a – b|. Then
the open spheres in R correspond to the finite open intervals in R. Thus the usual
metric on R induces the usual topology, the set of all open intervals, on R.
Lemma 3: Let d be the trivial metric on some set X. Note that for any p ε X, S(p,
1/2) = {p}. Thus every singleton set (set consisting of only one element) is open
and consequently every set is open. Hence the trivial metric induces the discrete
topology on X.
Properties of Metric Topologies
Theorem 2: Let p be a point is a metric space X. Then the countable class of
open spheres {S(p, 1), S(p, 1/2), S(p, 1/3), S(p, 1/4), .....}is a local base at p.
Theorem 3: The closure A of a subset A of a metric space X is the set of points

whose distance from A is zero.
In a metric space all singleton sets {p} are closed.
Theorem 4: In a metric space, all finite sets are closed.
Following is an important ‘separation’ property of metric spaces.
Theorem 5: (Separation Axiom). Let A and B be closed disjoint subsets of a
metric space. Then there exist disjoint open sets G and H such that A ⊂ G and B ⊂ H.
Self-Instructional
154 Material
One might think that the distance between two disjoint closed sets would Metric and Quotient
Topology
be greater than zero. However, this is not necessarily the case as the following
example shows.
For example, the two sets: NOTES
A = {(x, y): xy ≥ l, x < 0}
B = {(x, y): xy ≥ l, x > 0}
are closed and they are disjoint. However, d(A, B) = 0.
Consider another example where let P(x1, y1) and Q(x2, y2) be two arbitrary
points in the plane R2. The usual metric d and the two metrics d1 and d2 defined
by,
d1(P, Q) = max (|x1 – x2|, |y1 – y2)
d2(P, Q) = |x1 – x2| + |y1 – y2|
All Induce the usual topology on the plane R2 since the collection of open spheres
of each metric is a base for the usual topology on R2. The open spheres of each of
the three metrics. Thus, the three metrics are equivalent.
Isometric Metric Spaces
A metric space (X, d) is isometric to a metric space (Y, e) if and only if there exists
a one-to-one onto function f: X → Y which preserves distances, i.e., for all p, q
∈ X,
d(p, q) = e(f(p), f(q)
Theorem 6: If the metric space (X, d) is isometric to (Y, e), then (X, d) is also
homeomorphic to (Y, e).
8.4 THE QUOTIENT TOPOLOGY
In topology and mathematics, a quotient space, also called an identification space,

is the result of identifying certain points of a given topological space. The points to
be identified are specified by an equivalence relation. This is commonly done in
order to construct new spaces from given ones. The quotient topology consists of
all sets with an open pre-image under the canonical projection map that maps
each element to its equivalence class.
Definition
Let (X, τX) be a topological space, and let ~ be an equivalence relation on X. The
quotient space, Y = X / ~ is defined to be the set of equivalence classes of elements
of X as follows:
Self-Instructional
Material 155
Metric and Quotient This is equipped with the topology where the open sets are defined to be those
Topology
sets of equivalence classes whose unions are open sets in X:
NOTES
Equivalently, we can define them to be those sets with an open pre-image under
the surjective map q : X ’‡ X / ~, which sends a point in X to the equivalence class
containing it:
The quotient topology is the final topology on the quotient space with respect to
the map q.
Check Your Progress

3. State the separation axiom.
4. What is meant by isometric metric space?
5. Give definition for the quotient space?

QUESTIONS
1. If f : X → Y maps all of X into a single point y0 ∈ Y, then f is continuous.
2. If f : X → Y is continuous and if A is a subspace of X, then the restricted
function f |A : A → Y is continuous.
3. Let A and B be closed disjoint subsets of a metric space. Then there exist
disjoint open sets G and H such that A ⊂ G and B ⊂ H.
4. A metric space (X, d) is isometric to a metric space (Y, e) if and only if there
exists a one-to-one onto function f: X → Y which preserves distances, i.e.,
for all p, q ∈ X,
d(p, q) = e(f(p), f(q)
5. Let (X, τX) be a topological space, and let ~ be an equivalence relation on
X. The quotient space, Y = X / ~ is defined to be the set of equivalence
classes of elements of X as follows:
8.6 SUMMARY
• Any function from a discrete space to any other topological space is

continuous and also any function from any topological space to an indiscrete
space is continuous.
Self-Instructional
156 Material
• The map f : X → Y is continuous if X can be written as the union of open Metric and Quotient
Topology
sets Uα such that f |Uα is continuous for each α.
• A subset A of X is said to be bounded if δ (A) is finite. It follows that A is
bounded if there exists a real number M and a point q ∈ X such that d (p, q)
NOTES
< M for all p ∈ A.
• The collection of open spheres in a set X with metric d is a base for a
topology on X.
• Let d be the usual metric in three dimensional space R. Then the set of open
spheres in R3 constitute a base for a topology on R3. Thus the usual metric
on R3 induces the usual topology on R3, the collection of all open sets.
• In topology and mathematics, a quotient space, also called an identification
space, is the result of identifying certain points of a given topological space.
The points to be identified are specified by an equivalence relation.
8.7 KEY WORDS
• Metric space: A metric space is a set together with a metric on the set.
• Quotient space: A quotient space (also called an identification space) is
the result of identifying certain points of a given topological space.
• Equivalence relation: It is a binary relation that is reflexive, symmetric
and transitive. The relation “is equal to” is the canonical example of an
equivalence relation.

AND EXERCISES

1. Describe the rules for construction of continuous functions.
2. Write properties of metric topologies.
1. Explain the method of constructing continuous functions giving its rules and
examples.
2. Give a detailed account of the metric topology.
3. Discuss the importance of quotient topology.
Self-Instructional
Material 157
Metric and Quotient
Topology 8.9 FURTHER READINGS
NOTES India.
Ltd.
Sons, Inc.
Self-Instructional
158 Material
Connected Spaces
and Sets
BLOCK - III
CONNECTED AND COMPACT SPACES
NOTES
UNIT 9 CONNECTED SPACES

AND SETS
Structure
9.0 Introduction
9.1 Objectives
9.2 Connected Spaces
9.3 Connected Sets in the Real Line
9.5 Summary
9.6 Key Words
9.0 INTRODUCTION
A connected space is a topological space that cannot be represented as

the union of two or more disjoint nonempty open subsets. Connectedness is one
of the principal topological properties that are used to distinguish topological spaces.
In general topology, compactness is a property that generalizes the notion of a
subset of Euclidean space being closed and bounded. A topological space
is sequentially compact if every infinite sequence of points sampled from the space
has an infinite subsequence that converges to some point of the space. The
term compact set is sometimes a synonym for compact space, but usually refers
to a compact subspace of a topological space. Typical examples of compact spaces
include spaces consisting not of geometrical points but of functions. The
term compact was introduced into mathematics by Maurice Fréchet in 1904. In
this unit, you will study connected spaces, connected components and disconnected
spaces with examples. You will understand path connectedness and arc
connectedness. You will describe locally connected space and their properties.
Connected sets in the real line is also explained in this unit.
9.1 OBJECTIVES
After going through this unit you will be able to:

• Understand connected spaces, connected components and disconnected
spaces Self-Instructional
Material 159
Connected Spaces • Analyse path connectedness and arc connectedness
and Sets
• Comprehend locally connected space and their properties
• Describe connected sets in the real line
NOTES
9.2 CONNECTED SPACES
In topology and related branches of mathematics, a connected space is a topological

space that cannot be represented as the union of two or more disjoint nonempty
open subsets.
Connectedness is one of the principal topological properties that is used to
distinguish topological spaces. A stronger notion is that of a path connected space,
which is a space where any two points can be joined by a path.
A subset of a topological space X is a connected set if it is a connected
space when viewed as a subspace of X.
As an example of a space that is not connected, one can delete an infinite
line from the plane. Other examples of disconnected spaces (that is, spaces that
are not connected) include the plane with a closed annulus removed, as well as the
union of two disjoint open disks in two dimensional Euclidean space.
Definition: A topological space X is said to be disconnected if it is the union of
two disjoint nonempty open sets. Otherwise, X is said to be connected. A subset
of a topological space is said to be connected if it is connected under its subspace
topology.
For a topological space X the following conditions are equivalent:
1. X is connected.
2. X cannot be divided into two disjoint nonempty closed sets.
3. The only subset of X which are both open and closed (clopen sets) are X
and the empty set.
4. The only subsets of X with empty boundary are X and the empty set.
5. X cannot be written as the union of two nonempty separated sets.
6. The only continuous functions from X to {0, 1} are constant.
Connected Components
The maximal connected subsets of a nonempty topological space are called the
connected components of the space. The components of any topological space X
from a partition of X: they are disjoint, nonempty and their union is the whole
space. Since we are insisting on calling the empty topological space connected,
we need a special convention here: the empty space has no connected components.
Self-Instructional
160 Material
Every component is a closed subset of the original space. It follows that, in the Connected Spaces
and Sets
case where their number is finite, each component is also an open subset. However,
if their number in infinite, this might not be the case; for example, the connected
components of the set of the rational numbers are the one-point sets, which are
NOTES
not open.
Let Γx be a connected component of x in a topological space X, and Γ′x be
the intersection of all open-closed sets containing x (called quasi-component of
x.) Then Γx ⊂ Γ′x where the equality holds if X is compact Hausdorff or locally
connected.
Disconnected Spaces
A space in which all components are one-point sets is called totally disconnected.
Related to this property, a space X is called totally separated if, for any two
elements x and y of X, there exist disjoint open neighborhoods U of x and V of y
such that X is the union of U and V. Clearly any totally separated space is totally
disconnected, but the converse does not hold. For example, take two copies of
the rational numbers Q and identify them at every point except zero. The resulting
space, with the quotient topology, is totally disconnected. However, by considering
the two copies of zero, is obvious that the space is not totally separated. In fact, it
is not even Hausdorff, and the condition of being totally separated is strictly stronger
than the condition of being Hausdorff.
The following are the examples:
• The closed interval [0, 2] in the standard subspace topology is connected;

although it can, for example, be written as the union of [0,1) and [1, 2], the
second set is not open in the aforementioned topology of [0, 2].
• The union of [0,1) and (1, 2] is disconnected; both of these intervals are
open in the standard topological space [0,1)∪(1, 2].
• (0,1)∪{3} is disconnected.
• A convex set is connected; it is actually simply connected.
• A Euclidean plane excluding the origin, (0,0) is connected but is not simply
connected. The three-dimensional Euclidean space without the origin is
connected and even simply connected. In contrast, the one-dimensional
Euclidean space without the origin is not connected.
• A Euclidean plane with a straight line removed is not connected since it
consists of two half-planes.
• The space of real numbers with the usual topology is connected.
• Any topological vector space over a connected field is connected.
Self-Instructional
Material 161
Connected Spaces • Every discrete topological space with at least two elements is disconnected,
and Sets
in fact such a space is totally disconnected. The simplest example is the
discrete two-point space.
NOTES • The Cantor set is totally disconnected; since the set contains uncountably
many points it has uncountably many components.
• If a space X is homotopy equivalent to a connected space, then X is itself
connected.
• The topologist’s sine curve is an example of a set that is connected but is
neither path connected nor locally connected.
• The general linear group GL(n, R)(that is, the group of n-by-n real matrices)
consists of two connected components: the one with matrices of positive
determinant and the other of negative determinant. In particular, it is not
connected. In contrast, GL(n,C) is connected. More generally, the set of
invertible bounded operators on a (complex) Hilbert space is connected.
• The spectrum of a commutative local ring is connected. More generally, the
spectrum of a commutative ring is connected if and only if it has no idempotent
≠ 0, if and only if the ring is not a product of two rings in a nontrivial way.
Path Connectedness
A path from a point x to a point y in a topological space X is a continuous function
f from the unit interval [0,1] to X with f(0) = x and f(1) = y. A path-component of
X is an equivalence class of X under the equivalence relation which makes x
equivalent to y if there is a path from x to y. The space X is said to be path-
connected (or pathwise connected or 0-connected) if there is atmost one path-
component, i.e., if there is a path joining any two points in X. Again, many others
exclude the empty space.
Every path-connected space is connected. The converse is not always true:
examples of connected spaces that are not path-connected include the extended
long line L* and the topologist’s sine curve.
However, subsets of the real line R are connected if and only if they are
path connected; these subsets are the intervals of R. Also, open subsets of Rn or
Cn are connected if and only if they are path-connected. Additionally, connectedness
and path-connectedness are the same for finite topological spaces.
Arc Connectedness
A space X is said to be arc-connected or arcwise connected if any two distinct
points can be joined by an arc, that is a path f which is a homeomorphism between
the unit interval [0,1] and its image f([0,1]). It can be shown any Housdorff space
which is path-connected is also arc-connected. An example of a space which is
Self-Instructional
162 Material
path-connected but not arc-connected is provided by adding a second copy 0′of Connected Spaces
and Sets
0 to the nonnegative real numbers [0,∞). One endows this set with a partial order
by specifying that 0′ < a for any positive number a, but leaving 0 and 0′
incomparable. One then endows this set with the order topology, that is one takes
NOTES
the open intervals (a, b) = {x|a < x < b} and the half-open intervals [0, a) = {x|0
≤ x < a}, [0′, a) ={x|0′ ≤ x < a} as a base for the topology. The resulting space
is a T1 space but not a Hausdorff space. Clearly 0 and 0′ can be connected by a
path but not an arc in this space.
Locally Connected Space
In topology and other branches of mathematics, a topological space X is locally
connected if every point admits a neighbourhood basis consisting entirely of open
connected sets.
Throughout the history of topology, connectedness and compactness have
been two of the most widely studied topological properties. Indeed, the study of
these properties even among subsets of Euclidean space, and the recognition of
their independence from the particular form of the Euclidean metric, played a large
role in clarifying the notion of a topological property and thus a topological space.
However, whereas the structure of compact subsets of Euclidean space was
understood quite early on via the Heine-Borel theorem, connected subsets of Rn.
(For n > 1) proved to be much more complicated. Indeed, while any compact
Hausdorff space is locally compact, a connected a space and even a connected
subset of the Euclidean plane need not be locally connected.
Although the basic point-set topology of manifolds is relatively simple, their
algebraic topology is far more complex. From this modern perspective, the stronger
property of local path connectedness turns out to be more important, for example,
in order for a space to admit a universal cover it must be connected and locally
path connected.
A space is locally connected if and only if for every open set U, the connected
components of U are open. It follows that a continuous function from a locally
connected space to a totally disconnected space must be locally constant. In fact
the openness of components is so natural that one must be sure to keep in mind
that it is not true in general: for instance Cantor space is totally disconnected but
not discrete.
The following example will make the concept clear:
Let X be a topological space, and let x be a point of X.
We say that X is locally connected at x if for every open set V containing x
there exists a connected, open set U with x ∈ U ⊂ V. The space X is said to be
locally connected if it is locally connected at x for all x in X. Self-Instructional
Material 163
Connected Spaces By contrast, we say that X is weakly locally connected at x if for every
and Sets
open set V containing x (or connected im Kleinen at x) there exists a connected
subset N of V such that x lies in the interior of N. An equivalent definition is: each
open set V containing x contains an open neighborhood U of x such that any two
NOTES
points in U lie in some connected subset of V. The space X is said to be weakly
locally connected if it is weakly locally connected at x for all x in X.
In other words, the only difference between the two definitions is that for
local connectedness at x we require a neighbourhood base of open connected
sets, whereas for weak local connectedness at x we require only a base of
neighbourhoods of x.
Evidently a space which is locally connected at x is weakly locally connected
at x. The converse does not hold. On the other hand, it is equally clear that a
locally connected space is weakly locally connected and here it turns out that the
converse does hold. A space which is weakly locally connected at all of its points
is necessarily locally connected at all of its points.
We say that X is locally path connected at x if for every open set V containing
x there exists a path connected, open set U with x ∈ U ⊂ V. The space X is said
to be locally path connected at x for all x in X.
Since path connected spaces are connected, locally path connected spaces
are locally connected.
The following examples will make the concept clear:
1. For any positive integer n, the Euclidean space Rn is connected and locally
connected.
2. The subspace [0,1]∪[2,3] of real line R1 is locally connected but not
connected.
3. The topologist’s sine curve is a subspace of the Euclidean plane which is
connected, but not locally connected.
4. The space Q of rational numbers endowed with the standard Euclidean
topology, is neither connected nor locally connected.
5. The comb space is path connected but not locally path connected.
6. Let X be a countably infinite set endowed with the cofinite topology. Then
X is locally connected (indeed hyperconnected) but not locally path
connected.
Properties
The following are the properties of connectedness:
1. Local connectedness is, by definition, a local property of topological spaces,

i.e., a topological property P such that a space X possesses property P if
Self-Instructional
164 Material
and only if each point x in X admits a neighbourhood base of sets which Connected Spaces
and Sets
have property P. Accordingly, all the metaproperties held by a local property
hold for local connectedness.
2. A space is locally connected if and only if it admits a base of connected NOTES
subsets.
3. The disjoint union  X i of a family {X } of spaces is locally connected if

i i
and only if each Xi is locally connected. In particular, since a single point is

certainly locally connected, it follows that any discrete space is locally
connected. On the other hand, a discrete space is totally disconnected, so
is connected only if it has at most one point.
4. Conversely, a totally disconnected space is locally connected if and only if
it is discrete. This can be used to explain the aforementioned fact that the
rational numbers are not locally connected.
9.3 CONNECTED SETS IN THE REAL LINE
The notion of connectedness is of fundamental importance in analysis. Before

giving a formal definition of connectedness in a metric space, we introduce the
notion of subspace.
Let (X, d) be a metric space and let A be a subset of X. Let d* denote
restriction of d to A × A, that is,
d* (x, y) = d (x, y)
Here x, y are points of A. Then d* is a metric for A called the induced
metric and the set A with metric d* is called subspace of X.
Thus, a subset A of X equipped with the induced metric is a metric space in
its own right and neighbourhoods, open sets and closed sets are defined as a
metric space. But an open set (closed set) of A need not be open (closed) when
regarded as a subset of X.
For example, if we regard the closed interval [0, 1] as a sub-space of R,
then the semi-open interval [0, 1[ is open in [0, 1] but not in R. In fact, if A is a
subspace of X and B ⊂ A, then
(i) B is open in if there exists a set G open in X such that
B = G ∩ A.
(ii) B is closed in A if there exists a set H closed in X such that
B = H ∩ A.
Self-Instructional
Material 165
Connected Spaces Note that the phrase ‘B is open in A’ means that B is open relative to the
and Sets
induced metric on A. Also ‘B is open in X ’ means that B is open with respect to
the metric on X.
NOTES Notes: (i) If A ⊂ X is open, then B ⊂ A is open in A if it is open in X.
(ii) If A ⊂ X is closed, then B ⊂ A is closed in A if it is closed in X.
Another definition is subset A of a metric space X is said to be disconnected
if it is the union of two nonempty disjoint sets both open in A such that,
C ∩ D = ∅ and C ∪ D = A.
It follows from the preceding definition that a subset of a metric space X is
disconnected if it is the union of two non-empty disjoint sets both closed in A.
We call C ∩ D the separation (or disconnection) of A.
It follows at once from definition that every singleton set is a connected set.
Theorem 1: R is connected.
Proof: Suppose, if possible, R is disconnected. Then there exist two non-empty,
disjoint, closed sets A and B such that R = A ∪ B. Since A, B are non-empty, we
can find a1 ∈ A and b1 ∈ B. Since A ∪ B = ∅, a1 ≠ b1, and so either a1 > b1 or a1
< b1. Suppose a1, < b1. Let I1 = ]a1, b1] so that I1 is a closed interval. Bisect I1 and
a1 + b1
observe that its mid-point must belong either to A or to B but not both
2
since A and B are disjoint. It follows that one of the two halves must have its left
end point in A and its right end point in B. We denote this interval by I2 = [a2, b2].
We bisect I2 and proceed as before. We continue this process ad infinitum. Evidently
I1 ⊃ I2 ⊃ I3 ⊃... Thus we obtain a nested sequence <In> of closed intervals such
that their length |In| → 0 as n → ∞. Hence, by the nested interval theorem, there
exists a unique point c which belongs to every In, that is
c ∈ ∩ {In : n ∈ N}.
It is easy to see that c is a limit point of both A and B. For if V (c, ∈) = ] c
– ∈, c +∈[ is any ∈-nhd of c, we can find a positive integer m0 so large that In ⊂
N (c, ∈) for all n > m0 and consequently N (c, ∈) contains infinite number of
points of both A and B. Since A and B are closed, c ∈ A and c ∈ B which is a
contradiction since A ∩ B = ∅.
Hence, R must be connected.
Theorem 2: A sebset A of R is connected if and only if it is an interval.
Proof: The ‘only if’ part. Let A be connected and suppose if possible, A is not an
interval. Then there exist real numbers a, p, b with a < p < b such that a, b ∈ A
but p ∉ A. Let, G = ] – ∞, p[ and H = ]p, x[.
Self-Instructional
166 Material
Then G, H are disjoint, nonempty open sets in R. They are nonempty since Connected Spaces
and Sets
a ∈ G and b ∈ H. Let
C = A ∩ G and D = A ∩ H.
Then, C and D are open in A. Further a ∈ C and b and D so that they are NOTES
nonempty. Also
C ⊂ G, D ⊂ H and G ∩ H = ∅ ⇒ C ∩ D = ∅,
and C ∪ D = (A ∩ G) ∪ (B ∩ H)
= A ∩ (G ∪ H) = A ∩ (R – {p}) = Α
[ p ∉ A ⇒ A ⊂ R – {p}]
Hence, C ∪ D is a separation of A and consequently A is disconnected
which is contradiction. Hence, A must be an interval.
The ‘if’ part. The proof of this part is exactly on the same lines and is left as
an exercise.
Check Your Progress

1. What do you mean by a connected space?
2. What is meant by connectedness?
3. When is a topological set space said to be connected?
4. What are connected components?
5. What is path connectedness?
6. Define the term arc connectedness.

QUESTIONS
1. A connected space is a topological space that cannot be represented as the

union of two or more disjoint nonempty open subsets.
2. Connectedness is one of the principal topological properties that is used to
distinguish topological spaces. A stronger notion is that of a path connected
space, which is a space where any two points can be joined by a path.
3. A topological space X is said to be disconnected if it is the union of two
disjoint nonempty open sets. Otherwise, X is said to be connected. A subset
of a topological space is said to be connected if it is connected under its
subspace topology.
4. The maximal connected subsets of a nonempty topological space are called
the connected components of the space.
Self-Instructional
Material 167
Connected Spaces 5. The space X is said to be path-connected (or pathwise connected or 0-
and Sets
connected) if there is atmost one path-component, i.e., if there is a path
joining any two points in X. Again, many others exclude the empty space.
NOTES 6. A space X is said to be arc-connected or arcwise connected if any two
distinct points can be joined by an arc, that is a path f which is a
homeomorphism between the unit interval [0,1] and its image f([0,1]).
9.5 SUMMARY
• In topology and related branches of mathematics, a connected space is a

topological space that cannot be represented as the union of two or more
disjoint nonempty open subsets.
• Connectedness is one of the principal topological properties that is used to
distinguish topological spaces. A stronger notion is that of a path connected
space, which is a space where any two points can be joined by a path.
• A subset of a topological space X is a connected set if it is a connected
space when viewed as a subspace of X.
• As an example of a space that is not connected, one can delete an infinite
line from the plane.
• A topological space X is said to be disconnected if it is the union of two
disjoint nonempty open sets. Otherwise, X is said to be connected. A subset
of a topological space is said to be connected if it is connected under its
subspace topology.
• The maximal connected subsets of a nonempty topological space are called
the connected components of the space.
• Let Γx be a connected component of x in a topological space X, and Γ′x be
the intersection of all open-closed sets containing x (called quasi-component
of x.) Then Γx ⊂ Γ′x where the equality holds if X is compact Hausdorff or
locally connected.
• A space in which all components are one-point sets is called totally
disconnected.
• Any topological vector space over a connected field is connected.
• Every discrete topological space with at least two elements is disconnected,
in fact such a space is totally disconnected. The simplest example is the
discrete two-point space.
• The Cantor set is totally disconnected; since the set contains uncountably
many points it has uncountably many components.
Self-Instructional
168 Material
• The space X is said to be path-connected (or pathwise connected or 0- Connected Spaces
and Sets
connected) if there is atmost one path-component, i.e., if there is a path
joining any two points in X. Again, many others exclude the empty space.
• A space X is said to be arc-connected or arcwise connected if any two NOTES
distinct points can be joined by an arc, that is a path f which is a
homeomorphism between the unit interval [0,1] and its image f([0,1]).
• In topology and other branches of mathematics, a topological space X is
locally connected if every point admits a neighbourhood basis consisting
entirely of open connected sets.
• A space is locally connected if and only if for every open set U, the connected
components of U are open.
• for local connectedness at x we require a neighbourhood base of open
connected sets, whereas for weak local connectedness at x we require
only a base of neighbourhoods of x.
• A space which is weakly locally connected at all of its points is necessarily
locally connected at all of its points.
• We say that X is locally path connected at x if for every open set V containing
x there exists a path connected, open set U with x ∈ U ⊂ V. The space X
is said to be locally path connected at x for all x in X.
• a subset A of X equipped with the induced metric is a metric space in its
own right and neighbourhoods, open sets and closed sets are defined as
metric space. But an open set (closed set) of A need not be open (closed)
when regarded as a subset of X.
• subset A of a metric space X is said to be disconnected if it is the union of
two nonempty disjoint sets both open in A such that,
C ∩ D = ∅ and C ∪ D = A.
9.6 KEY WORDS
• Connected space: The maximal connected subsets of a nonempty

topological space are called the connected components of the space.
• Metric space: A space in which all components are one-point sets is called
totally disconnected.
• Path connectedness: The space X is said to be path-connected (or
pathwise connected or 0-connected) if there is atmost one path-component,
i.e., if there is a path joining any two points in X. Again, many others exclude
the empty space.
Self-Instructional
Material 169
Connected Spaces • Arc connectedness: A space X is said to be arc-connected or arcwise
and Sets
connected if any two distinct points can be joined by an arc, that is a path f
which is a homeomorphism between the unit interval [0,1] and its image
f([0,1]).
NOTES
• Locally connected space: In topology and other branches of mathematics,
a topological space X is locally connected if every point admits a
neighbourhood basis consisting entirely of open connected sets.

AND EXERCISES

1. Write a short notes on the followings:
(i) Connected spaces
(ii) Disconnected spaces
(iii) Connected components
(iv) Path connectedness
2. Differentiate between arc connectedness and locally connected space.
3. Write properties of connectedness.
1. Discuss connected spaces with suitable examples.
2. Give a detailed of the connected sets in the real line.
India.
Ltd.
Sons, Inc.
Self-Instructional
170 Material
Local Connectedness
UNIT 10 LOCAL CONNECTEDNESS and Compact Spaces
AND COMPACT SPACES

NOTES
Structure
10.0 Introduction
10.1 Objectives
10.2 Local Connectedness and Compact Spaces
10.3 Compactness and Nets
10.4 Paracompact Spaces
10.6 Summary
10.7 Key Words
10.0 INTRODUCTION
Connectedness and compactness have been two of the most widely studied
topological properties throughout the history of topology. If a space is locally
connected at each of its points, we call the space locally connected. In general
topology, compactness is a property that generalizes the notion of a subset
of Euclidean space being closed and bounded. A topological space is compact if
every open cover of has a finite sub cover. In this unit, you will study local
connectedness and compact spaces. You will understand compactness, nets and
para-compact spaces applying some mathematical theorems.
10.1 OBJECTIVES

• Understand local connectedness and compact spaces
• Analyse compactness and nets
• Define paracompact spaces
10.2 LOCAL CONNECTEDNESS AND COMPACT

SPACES
Connectedness and compactness have been two of the most widely studied

topological properties throughout the history of topology. Certainly, the study of
these properties even among subsets of Euclidean space and the recognition of
their independence from the particular form of the Euclidean metric played a large
Self-Instructional
Material 171
Local Connectedness role in clarifying the notion of a topological property and thus a topological space.
and Compact Spaces
However, whereas the structure of compact subsets of Euclidean space was
understood quite early on via the Heine-Borel theorem, connected subsets
of Rn (for n > 1) proved to be much more complicated. Indeed, while any
NOTES
compact Hausdorff space is locally compact, a connected space – and even a
connected subset of the Euclidean plane – need not be locally connected.
In the latter part of the twentieth century, research trends shifted to more
intense study of spaces like manifolds which are locally well understood being locally
homeomorphic to Euclidean space but have complicated global behavior. This
means that although the basic point-set topology of manifolds is relatively simple
since manifolds are essentially metrizable according to most definitions of the
concept, their algebraic topology is far more complex. From this modern viewpoint,
the stronger property of local path connectedness turns out to be more important,
for example, in order for a space to admit a universal cover it must be connected
and locally path connected. A space is said to be locally connected iff for every
open set U, the connected components of U in the subspace topology are open.
A continuous function from a locally connected space to a totally disconnected
space must be locally constant.
Theorem 1: ∏ X λ is locally connected if and only if each space Xλ is locally

λ
connected and all but a finite number are connected.
Proof: Suppose ∏X
λ
λ is locally connected, and let xβ ∈ Xβ be contained in
some open set Yβ. Choose some point z = <zλ> with zβ = Xβ and we have z
belonging to the open set π β−1 (Yβ ). By local connectedness, there must exist a
connected open set G containing z and contained in π β−1 (Yβ ).Taking the β-th
projection, we see that zβ = xβ is contained in the connected open set πβ(G) which
is itself contained in Yβ and so Xβ is locally connected. Further, if z is any point of
the product space, it must be contained in some connected open set G. By
definition, z ∈ πY
λ
λ ⊆ G where Y is open in X for all λ and Y = X for all but a
λ λ λ λ
certain finite number of values of λ. But then the projections of G are connected
and are equal to Xλ, except for that finite number of values of λ.
Now suppose that Xλ is locally connected for old λ and connected for λ ≠
β1, β2, ...., βn. Let X = < xλ>λ be an arbitrary point of πY
λ
λ where Y is open in X
λ λ
for all λ and Yλ = Xλ for λ ≠ β1∗, β2∗, ...., βk*. Since xλ ∈ Yλ for all λ and Yλ is
locally connected, there is a connected open set Gλ in Xλ such that xλ ∈ Gλ ⊆ Yλ.
Self-Instructional
172 Material
Local Connectedness
Consider the subset πλ Z λ where Zλ = Gλ if λ = β1, β2, ...., βn, β1∗,...., βk* and and Compact Spaces
Zλ = Xλ otherwise. But by the result, ∏ X λ is connected if and only if each Xλ is

λ
NOTES
connected. This set is connected. Hence we have formed a connected open set
containing X and contained in ∏ Yλ .

λ
10.3 COMPACTNESS AND NETS
Definition: We say that a net {xλ } has x ∈ X as a cluster point if and only if for
each neighbourhood U of x and for each λ 0 ∈ Λ there exist some λ ≥ λ 0 such
that xλ ∈ U . In this case we say that {xλ } is cofinally (or frequently) in each
neighbourhood of x.
Theorem 2: A net {xλ } has y ∈ X as a cluster point if and only if it has a sub net,
which converges to y.
Proof: Let y be a cluster point of {xλ } . Define M =: {(λ,U ) : λ ∈ Λ,U a
neighbourhood of y such that xλ ∈ U } and order M as follows: (λ1 ,U1 ) ≤ (λ 2 ,U 2 )
if and only if λ1 ≤ λ 2 and U 2 ⊆ U1 . This is easily verified to be a direction on M.
Define ϕ : M → Λ by ϕ(λ,U ) =λ . Then ϕ is increasing and cofinal in Λ, so ϕ
defines a subnet of {xλ } . Let U0 be any neighbourhood of y and find λ 0 ∈ Λ such
that xλ 0 ∈ U 0 . Then (λ 0 ,U 0 ) ∈ M , and moreover,, (λ,U ) ≥ (λ 0 ,U 0 ) implies
U ⊆ U 0 , so that xλ ∈ U ⊆ U 0 . It follows that the subnet defined by ϕ converges to
y.
Suppose ϕ : M → Λ defines a subnet of {xλ } which converges to y. Then
for each neighbourhood U of y, there is some uU in M such that u ≥ uU implies
xϕ ( u ) ∈ U . Suppose a neighbourhood U of y and a point λ 0 ∈ Λ are given. Since
ϕ( M ) is cofinal in Λ, there is some u0 ∈ M such that ϕ(u0 ) ≥ λ 0 . But there is also
some uU ∈ M such that u ≥ uU implies xϕ( u ) ∈ U . Pick u* ≥ u0 and u* ≥ uU . Then

xλ* xϕ (u*) ∈U , since u* ≥ uU . Thus
ϕ(u*) = λ* ≥ λ 0 , since ϕ(u*) ≥ ϕ(u0 ) , and=
for any neighbourhood U of y and any λ 0 ∈ Λ , there is some λ* ≥ λ with xλ* ∈U .
It follows that y is a cluster point of {xλ } .
Self-Instructional
Material 173
Local Connectedness Theorem 3: A topological space X is compact if and only if every net on X has a
and Compact Spaces
convergent subnet on X.
Proof: Assume that X is compact and suppose that we have a net {xλ } that does
NOTES not has any convergent subnet. Hence, using the previous Theorem 4.23, the net
{xλ } does not has cluster points. This means that for each x ∈X we can find a
neighbourhood Ux of x and an index λx such that xλ ∉Ux for every λ ≥ λx. Since
X is compact then there exist x1, x2, …, xn ∈X such that X = 

i =1
U xi . Take any
λ ≥ λ x1 , λ x 2 ,..., λ xn . Then xλ ∉ X which is contradiction.

Assume that every net on X has a convergent subnet on X. We will show
 {Fi : i ∈ I} of closed subnets of X
that X is compact. To this end take a family=
with the finite intersection property, that is Fi1  Fi 2  ...  Fin ≠ φ for every
{i1 , i2 ,..., in } ⊆ I . We will show that  F ≠ φ . Define a net as follows: Let

i∈I
i
=Λ {{i1 , i2 ,..., in } : i1 , i2 ,..., in ∈ I and n ∈ N} .
And order Λ as follows:

= λ1 {i1 , i2 ,...,
= ik } ≤ λ 2 { j1 , j2 ,..., jn } if and only if
{i1 , i2 ,..., ik } ⊆ { j1 , j2 ,..., jn } . This is easily verified to be a direction on Λ. Since the
family F has the finite intersection property then for=
every λ {i1 , i2 ,..., in } ∈ Λ we
can find xλ ∈ Fi1  Fi 2 ,...,  Fi . Using our hypothesis, the net {xλ } has a
n
convergent subnet, let say {xλm } . That is, there exists x ∈ X such that xλm → x .
We will show that x ∈ Fi for all i ∈ I . Fix some Fi. Hence,there exists m0 such
that λ m 0 ≥ {i} . Thus, for =
every λ m {i1 , i2 ,..., in , i} ≥ λ m 0 ≥ {i} we have that
xλ m ∈ Fi1  Fi 2  ...  Fin  Fi ⊆ Fi . Since xλm → x and Fi is closed then x ∈ Fi .
This finishes the proof of the theorem.
10.4 PARACOMPACT SPACES
In mathematics, a paracompact space is a topological space in which every open

cover admits a locally finite open refinement. Paracompact spaces are sometimes
also required to be Hausdorff. Paracompact spaces were introduced by Dieudonné
(1944).
Let X be a topological space.
Definition: The space X is locally compact if each x ∈ X admits a compact
neighbourhood N.
Self-Instructional
174 Material
If X is locally compact and Hausdorff, then all compact sets in X are closed Local Connectedness
and Compact Spaces
and hence if N is a compact neighbourhood of x then N contains the closure the
open int (N) around x. Hence, in such cases every point x ∈ X lies in an open
cover whose closure is compact. Much more can be said about the local structure
NOTES
of locally compact Hausdorff spaces, though it requires some serious theorems in
topology (such as Urysohn’s lemma).
Lemma: If X is a locally compact Hausdorff space that is second countable, then
it admits a countable base of opens {Un} with compact closure.
Proof: Let {Vn} be a countable base of opens. For each x∈ X there exists an
open Ux around x with compact closure, yet some Vn(x) contains x and is contained
in Ux. The closure of Vn(x) is a closed subset of the compact U x , and so V n ( x ) is
also compact. Thus, the Vn’s with compact closure are a countable base of opens
with compact closure.
Definition: An open covering {Ui} of X refines an open covering {Vj} of X if
each Ui is contained in some Vj.
A simple example of a refinement is a subcover, but refinements allow much
great flexibility: none of the Ui’s needs to be a Vj. For example, the covering of a
metric space by open balls of radius 1 is refined by the covering by open balls of
1
radius .
2
Definition: An open covering {Ui} of X is locally finite if every x∈ X admits a
neighbourhood N such that N ∩ Ui is empty for all but finitely many i.
For example, the covering of R by open intervals (n–1, n+1) for n∈ Z is
locally finite, whereas the covering of (−1,1) by intervals (−1/n, 1/n) (for n ≥ 1)
barely fails to be locally finite: there is a problem at the origin (but nowhere else).
Definition: A topological space X is paracompact if every open covering admits
a locally finite refinement. It is traditional to also require paracompact spaces to be
Hausdorff, as paracompactness is never used away from the Hausdorff setting, in
contrast with compactness though many mathematicians implicity require compact
spaces to be Hausdorff too and they reserve a separate word (quasi-compact)
for compactness without the assumption of the Hausdorff condition.
Obviously any compact space is paracompact. Also, an arbitrary disjoint
union  Xi of paracompact spaces (given the topology wherein an open set is one
that meets each Xi is an open subset) is again paracompact. Note that it is not the
case that open covers of a paracompact space admit locally finite sub covers, but
rather just locally finite refinements. Indeed, we saw at the outset that Rn is
paracompact, but even in the real line, there exist open covers with no locally finite
Self-Instructional
Material 175
Local Connectedness sub cover: let Un = (−∞, n) for n ≥ 1. All Un’s contain (−∞, 0), and any sub
and Compact Spaces
collection of U ni ’s that covers R has to be infinite since each Un is bounded on the
right. Thus, no subcover can be locally finite near a negative number.
NOTES
In general, paracompactness is a slightly tricky property: there are counter
examples that show that an open subset of a paracompact Hausdorff space need
not be paracompact. Thus, to prove that an open subset of Rn is paracompact we
will have to use special features of Rn. However, just as closed subsets of compact
sets are compact, closed subsets of paracompact spaces are paracompact; the
argument is virtually the same as in the compact case (extend covers by using the
complement of the closed set). It is non-trivial theorem in topology that any metric
space is paracompact.
Theorem 4: Any second countable Hausdorff space X that is locally compact is
paracompact.
Proof: Let {Vn} be a countable base of opens in X. Let {Ui} be an open cover of
X for which we seek a locally finite refinement. Each x∈ X lies in some Ui and so
there exists a Vn(x) containing x with Vn(x) ⊆ Ui. The Vn(x)’s therefore constitute a
refinement of {Ui} that is countable. Since the property of one open covering
refining another is transitive, we therefore lose no generality by seeking locally
finite refinements of countable covers. By Lemma stated above, we can assume
that all V n are compact. Hence, we can restrict our attention to countable covers
by opens Un for which U n is compact. Since closure commutes with finite unions,
by replacing Un with  j ≤ n U j we preserve the compactness condition (as a finite

union of compact subsets is compact) and so we can assume that {Un} is an
increasing collection of opens with compact closure (with n ≥ 0). Since U n is
compact yet is covered by the open Ui’s, for sufficiently large N we have U n ⊆
UN. If we recursively replace Un+1 with such a UN for each n, then we can arrange
that U n ⊆ Un+1 for each n. Let K0 = U 0 and for n ≥ 1 let Kn = U n − Un−1 = U n ∩
(X− Un−1), so Kn is compact for every n (as it is closed in the compact U n ) but
for any fixed N we see that UN is disjoint from Kn for all n ≥ N.
Now we have a situation similar to the concentric shells in our proof of
paracompactness of Rn, and so we can carry over the argument from Euclidean
spaces as follows. We seek a locally finite refinement of {Un}. For n ≥ 2, the open
set Wn = Un+1− U n−2 contains Kn, so for each x ∈ Kn there exists some Vm ⊆ Wn
around x. There are finitely many such Vm’s that actually cover the compact Kn,
Self-Instructional
176 Material
and the collection of Vm’s that arise in this way as we vary n ≥ 2 is clearly a locally Local Connectedness
and Compact Spaces
finite collection of opens in X whose union contains X − U 0 . Throwing infinitely
many Vm’s contained in U1 that cover the compact U 0 thereby gives an open NOTES
cover of X that refines {Ui} and is locally finite.
Corollary: Let X be a Hausdorff topological premanifold. The following properties
of X are equivalent: its connected components are countable unions of compact
sets, its connected components are second countable, and it is paracompact.
Proof: If {U, V} is a separation of X and X is paracompact then it is clear that
both U and V are paracompact. Hence, since the connected components of X are
open, X is paracompact if and only if its connected components are paracompact.
We may therefore restrict our attention to connected X. For such X, we claim that
it is equivalent to require that X be a countable union of compact sets, that X be
second countable, and that X be paracompact. By the preceding theorem, if X is
second countable then it is paracompact. Since X is connected, Hausdorff, and
locally compact, if it is paracompact then it is a countable union of compacts.
Hence, to complete the cycle of implications it remains to check that if X is a
countable union of compacts then it is second countable. Let {Kn} be a countable
collection of compacts that cover X, so if {Ui} is a covering of X by open sets
homeomorphic to an open set in a Euclidean space we may find finitely many Ui’s
that cover X. Since each Ui is certainly second countable (being, open in a Euclidean
space), a countable base of opens for X is given by the union of countable bases
of opens for each of the Ui’s. Hence, X is second countable.
Check Your Progress

1. What is a locally connected space?
2. When a net does has a cluster point?
3. When is a topological space said to be compact?
4. What is a paracompact space?

QUESTIONS
1. A space is said to be locally connected iff for every open set U, the connected
components of U in the subspace topology are open. A continuous function
from a locally connected space to a totally disconnected space must be
locally constant.
Self-Instructional
Material 177
Local Connectedness
and Compact Spaces 2. We say that a net {xλ } has x ∈ X as a cluster point if and only if for each
neighbourhood U of x and for each λ 0 ∈ Λ there exist some λ ≥ λ 0 such
that xλ ∈ U .
NOTES
3. A topological space X is compact if and only if every net on X has a
4. A paracompact space is a topological space in which every open
cover admits a locally finite open refinement.
10.6 SUMMARY
In this unit, you have learned that:

• While any compact Hausdorff space is locally compact, a connected space
– and even a connected subset of the Euclidean plane – need not be locally
connected.
• ∏X
λ
λ is locally connected if and only if each space Xλ is locally connected
and all but a finite number are connected.
• By local connectedness, there must exist a connected open set G containing
z and contained in π β−1 (Yβ ).
• We say that a net {xλ } has x ∈ X as a cluster point if and only if for each
neighbourhood U of x and for each λ 0 ∈ Λ there exist some λ ≥ λ 0 such
that xλ ∈ U .
• A net {xλ } has y ∈ X as a cluster point if and only if it has a sub net, which
converges to y.
• A topological space X is compact if and only if every net on X has a
• A paracompact space is a topological space in which every open
cover admits a locally finite open refinement.
• The space X is locally compact if each x ∈ X admits a compact
neighbourhood N.
• If X is locally compact and Hausdorff, then all compact sets in X are closed
and hence if N is a compact neighbourhood of x then N contains the closure
the open int (N) around x.
Self-Instructional
178 Material
• If X is a locally compact Hausdorff space that is second countable, then it Local Connectedness
and Compact Spaces
admits a countable base of opens {Un} with compact closure.
• An open covering {Ui} of X refines an open covering {Vj} of X if each Ui
is contained in some Vj. NOTES
• An open covering {Ui} of X is locally finite if every x∈ X admits a
neighbourhood N such that N ∩ Ui is empty for all but finitely many i.
• A topological space X is paracompact if every open covering admits a
locally finite refinement.
• Any second countable Hausdorff space X that is locally compact is
paracompact.
10.7 KEY WORDS
• Local connectedness: If a space is locally connected at each of its points,

we call the space locally connected.
• Compact space: A topological space is compact if every open
cover of has a finite sub cover..
• Paracompact space: A paracompact space is a topological space in which
every open cover admits a locally finite open refinement.
• Net: In general topology a net is a generalization of the notion of a sequence.

AND EXERCISES

1. Describe local connectedness briefly.
2. Show that a topological space X is compact if and only if every net on X
has a convergent subnet on X
3. Prove that if X is a locally compact Hausdorff space that is second countable,
then it admits a countable base of opens with compact closure.
4. Show that any second countable Hausdorff space X that is locally compact
is paracompact.
1. Discuss compactness and nets.
2. Give a detailed account of limit point compactness.
Self-Instructional
Material 179
Local Connectedness
and Compact Spaces 10.8 FURTHER READINGS
NOTES India.
Ltd.
Sons, Inc.
Self-Instructional
180 Material
Compact Set and Limit
UNIT 11 COMPACT SET AND LIMIT Point Compactness
POINT COMPACTNESS
NOTES
Structure
11.0 Introduction
11.1 Objectives
11.2 Compact Set in the Real Line
Sequential Compactness
11.2.3 Continuous Functions and Compact Sets
11.3 Limit Point Compactness
11.4 Local Compactness
11.6 Summary
11.7 Key Words
11.0 INTRODUCTION
A topological space X is said to be limit point compact if every infinite subset

of X has a limit point in X. A topological space is locally compact if each point has
a relatively compact neighbourhood. Continuous image of a compact space is
compact. Local compactness is not preserved by continuous surjections. In this
unit you will study compact set in the real line. You will prove that every compact
subset of a metric space is closed and closed subsets of compact sets are compact.
You will discuss sequentially and countably compact sets to understand that a
compact metric space is sequentially compact. You will describe Bolzano-
Weierstrass property and sequential compactness, completeness and finite
intersection property. You will discuss continuous functions and compact sets,
characterisation of continuous functions using preimages and general properties of
continuous functions. Limit point compactness and local compactness is also
explained in this unit
11.1 OBJECTIVES

• Discuss compact set in the real line, sequentially and countably compact
sets
• Describe Bolzano-Weierstrass property and sequential compactness,
completeness and finite intersection property Self-Instructional
Material 181
Compact Set and Limit • Explain continuous functions and compact sets, characterisation of continuous
Point Compactness
functions
• Interpret limit point compactness and local compactness
NOTES
11.2 COMPACT SET IN THE REAL LINE
By an open cover of a subset A of a metric space X, we mean a collection

C = {Gλ : λ ∈ 1} of open subsets of X such that A ⊂ ∪ {Gλ : λ ∈ A}. We then say
that C covers A.
In particular, C is said to be an open cover of the metric space X if X = ∪
{Gλ : λ ∈ A}.
By a subcover of an open cover C of A, we mean a subcollection C′ of C′
such that C′ covers A.
An open cover of A is said to be finite if it consists of finite number of open
sets.
Another definition is, A subset of a metric space X is said to be compact if
every open cover of A has a finite subcover, that is, if for every collection
{Gλ : λ ∈ A} of open sets for which
A ⊂ ∪ {Gλ : λ ∈ A},
there exist finitely many sets G λ1,...,G λn among the G λ’s such that
A ⊂ Gλ1 ∪ ... ∪ Gλn .
In particular, the metric space X is said to be compact if for every collection

{Gλ : λ ∈ A; of open sets for which
X = ∪{Gλ : λ ∈ A},
there exist finitely many sets Gλ ,..., Gλ among the G λ ’ss such that
1 n
X = Gλ1 ∪ ... ∪ Gλ n
Theorem 1: Let Y be a subspace of a metric space X and let A ⊂ Y. Then A is

compact relative to X if and only if A is compact relative Y.
Proof: Let A be compact relative to X and let {Vλ, λ∈ A} be a collection of sets,
open relative to Y, which covers A so that A ⊂ ∪{Vλ : λ ∈ A}. Then there exists Gλ,
open relative to X, such that Vλ= Y ∩ Gλ for every λ ∈ A. It then follows that
A ⊂ ∪{Gλ : λ ∈ A},
that is, {Gλ : λ ∈ A} is an open cover of A relative to X. Since A is compact

Self-Instructional relative to X, there exist finitely many indices λ1,...,λn such that
182 Material
A ⊂ Gλ1 ∪,..., ∪Gλn . Point Compactness
Since A ⊂ Y, we have A = Y ∩ A.
Hence A ⊂ Y ∩ {Gλ ∪,..., ∪Gλ } = (Y ∩ Gλ ) ∪ ... ∪ (Y ∩ Gλ )
1 n 1 n NOTES
[Distributive law]
Since Y ∩ Gλ = Aλ {i = 1, 2,..., n}, we obtain

i i
A ⊂ Aλ1 ∪,..., ∪ Aλn . .....(1)

This shows that A is compact relative to Y.
Conversely, let A be compact relative to Y and let {Gλ : λ ∈ Λ} be a
collection of open subsets of X which cover A so that
A ⊂ ∪ {Gλ : λ ∈ Λ} .....(2)
Since A ⊂ Y, Equation (2.2) implies that
A ⊂ Y ∩ [∪ {Gλ : λ ∈ Λ} = ∪{Y ∩ Gλ : λ ∈ Λ} [Distributive law]
Since Y ∩ Gλ is open relative to Y, the collection
{Y ∩ Gλ : λ ∈ Λ}
is an open cover of A relative to Y. Since A is compact relative to Y, we must
have
A ⊂ (Y ∩ Gλ1) ∪.....∪ (Y ∩ Gλn) .....(3)
for some choice of finitely many indices λ1,...,λn. But (Equation 3) implies
that
A ⊂ Gλ1 ∪.....∪ Gλn.
It follows that A is compact relative to X.
Theorem 2: Every compact subset of a metric space is closed.
Proof: Let A be a compact subset of a metric space X. We shall prove that
X – A is an open subset of X. Let p ∈ X – A.
For each q ∈ A, let Nq (p) and M(q) be neighbourhoods of p and q,
1
respectively, of radius less than d (p, q) so that
2
Nq (p) ∩ M (q) = ∅
Then the collection
{M (q) : q ∈ A}
is an open cover of A. (Recall that neighbourhoods are open sets). Since A
is compact, there are finitely many points q1,...,qn in A such that Self-Instructional
Material 183
Compact Set and Limit A ⊂ M (q1) ∪, ...,∪ N(qn)
Point Compactness
......(4)
If N = N q1 ( p ) ,.....,  N qn ( p ) then N is a neighbourhood of p. Now

NOTES
N ⊂ N q1 ( p ) and M(qi) ∩ Nqi(p) = ∅ for i = 1,...,n
⇒ M(qi) ∩ N = ∅ for i = 1,...,n

⇒ ∪ {M(qi) ∩ N : i = 1,...,n = ∅
⇒ [∪ {M(qi) : i = 1,...,n}] ∩ N = ∅
[Distributive law]
⇒Υ∩N=∅
⇒ Ν ⊂ X – Y.
Thus we have shown that to each p ∈ X – Y, there exists a neighbourhood
N of p such that N ∈ X – Y and consequently X – Y is open. It follows that Y is
closed.
Theorem 3: Closed subsets of compact sets are compact.
Proof: Let Y be a compact subset of a metric space X and let F be a subset of Y,
closed relative to X. To show that F is compact, let
C = {Gλ : λ ∈ Λ}
be an open cover of F. Then the collection
D = {Gλ : λ ∈ Λ} ∪ {X – F}
forms an open cover of Y. Since Y is compact, there is a finite subcollection
D′ of D which covers Y, and hence F. If X – F is a member of D′, we may remove
it from D′ and still retain an open finite cover of F. We have thus shown that a finite
subcollection of C covers F. Hence, F is compact.
Corollary 1: If F is closed and Y is compact then F ∩ Y is compact.
Sequentially and Countably Compact Sets
Theorem 4: A compact metric space is sequentially compact.
Proof: Let A be an infinite set in a compact metric space X. To prove that A
has a limit point we must find a point p for which every open neighbourhood
of p contains infinitely many points of A. Suppose that no such point exists.
Then every point of X has an open neighbourhood containing only finitely many
points of A. These sets form an open cover of X and extracting a finite open
cover gives a covering of X meeting A in only finitely many points. This is
impossible since A ⊂ X and A is infinite.
Self-Instructional
184 Material
Corollary 2: In a compact metric space every bounded sequence has a convergent Compact Set and Limit
Point Compactness
subsequence.
Proof: Given the above limit point p, take xi1 to be in a 1-neighbourhood of p, xi2
to be in a 1/2 neighbourhood of p,... and we get a subsequence converging to p. NOTES
Together with the Heine-Borel theorem, this implies the Bolzano-Weierstrass
theorem.
Compactness vs Sequential Compactness
K is compact if every open cover of K contains a finite subcover. K is sequentially
compact if every infinite subset of K has a limit point in K.
Theorem 5: K is compact ⇔ K is sequentially compact.
The proof requires the introduction of two auxiliary notions:
A space X is separable if it admits a countable dense subset.
A collection {Va} of open subsets of X is said to be a base for X if the
following is true: for every x ∈ X and for every open set G ⊂ X such that
x ∈ G, there exists α such that x ∈ Vα ⊂ G.
In other words, every open subset of X decomposes as a union of a
subcollection of the Vα’s — the Vα’s ‘generate’ all open subsets. The family {Vα}
almost always contains infinitely many members (the only exception is if X is finite).
However, if X happens to be separable, then countably many open subsets are
enough to form a base (the converse statement is also true and is an easy exercise).
Lemma 1: Every separable metric space has a countable base.
Proof: Assume X is separable: by definition it contains a countable dense subset
P = {p1, p2,...}. Consider the countable collection of neighbourhoods {Nr(x), r ∈
Q, i = 1, 2,... }. We will show that it is a base by checking the definition.
Consider any open set G ⊂ X and any point x ⊂ G. Since G is open, there
exists r > 0 such that Nr(x) ⊂ G. Decreasing r if necessary we can assume without
loss of generality that r is rational. Since P is dense, by definition x is a limit point
r
of P, so Nr/2(x) contains a point of P. So there exists i such that d(x, pi) < .
2
Since r is rational, the neighbourhood Nr/2(pi) belongs to the chosen collection.
r
Moreover, Nr/2(pi) ⊂ Nr(x) ⊂ G. Finally, since d(x, pi) < we also have x ∈ Nr/
2
2
(pi). So the chosen collection is a base for X.
Self-Instructional
Material 185
Compact Set and Limit Lemma 2: If X is sequentially compact then it is separable.
Point Compactness
Proof: Fix δ > 0 and let x1 ∈ X. Choose x2 ∈ X such that d(x1, x2) > δ, if
possible. Having chosen x1,..., xj, choose xj+i (if possible) such that d(xi, xj+i) > δ
NOTES for all i = 1,... ,j. We first notice that this process has to stop after a finite number
of iterations. Indeed, otherwise we would obtain an infinite sequence of points xi
mutually distant by at least δ; since X is sequentially compact the infinite subset
{xi, i = 1,2,...} would admit a limit point y, and the neighbourhood Nδ/2(y) would
contain infinitely many of the xi’s, contradicting the fact that any two of them are
distant by at least d. So after a finite number of iterations we obtain x1,..., xj such
that Nδ(x1)∪... ∪Nδ(xj) = X (every point of X is at distance less than δ from one
of the xi’s).
1
We now consider this construction for δ = (n = 1, 2,...). For n = 1 the
n
construction gives points x11,..., x1j1 such that N1(x11) ∪......∪ N1(x1j1) = X, for n
= 2 we get x21,..., x2j2 such that N1/2(x21∪...∪N1/2(x2j2) X, and so on. Let S = {xki,
k ≥ 1,1 ≤ i ≤ jk}: clearly S is countable. We claim that S is dense (i.e., S = X).
Indeed, if x ∈ X and r > 0, the neighbourhood Nr(x) always contains at least a
1
point of S (choosing n so that < r, one of the xni’s is at distance less than r from
n
x), so every point of X either belongs to S or is a limit point of S, i.e., S = X.
At this point we know that every sequentially compact set has a countable
base. We now show that this is enough to get countable subcovers of any open
cover.
Lemma 3: If X has a countable base, then every open cover of X admits an at
most countable subcover.
Lemma 4: If {Fn} is a sequence of non-empty closed subsets of a sequentially
compact set K such that Fn ⊃ Fn + 1 for all n = 1, 2,..., then ∩∞n =1 Fn ≠ φ .
Proof: Take xn ∈ Fn for each integer n, and let E = {xn, n = 1, 2,... }. If E is finite
then one of the xi belongs to infinitely many Fn’s. Since F1 ⊃ F2 ⊃ ..., this implies
∞
that xi belongs to every Fn, and we get that y ∈ ∩n =1 Fn is not empty..
Assume now that E is infinite. Since K is sequentially compact, E has a limit
point y. Fix a value of n: every neighbourhood of y contains infinitely many points
of E; among them, we can find one which is of the form xi for i > n and therefore
belongs to Fn (because xi ∈ Fi ⊂ Fn). Since every neighbourhood of y contains a
point of Fn, we get that either y ∈ Fn, or y is a limit point of Fn; however, since Fn
Self-Instructional
186 Material
is closed, every limit point of Fn belongs to Fn. So in either case we conclude that Compact Set and Limit
Point Compactness
∞
y ∈ Fn. Since this holds for every n, we obtain that y ∈ ∩n =1 Fn , which proves
that the intersection is not empty.
NOTES
We can now prove the theorem. Assume that K is sequentially compact,
and let {Gα} be an open cover of K. By Lemma 1 and Lemma 2, K has a countable
base, so by Lemma 3 {Gα} admits an at most countable subcover that we will
denote by {Gi}i ≥ 1 . Our aim is to show that {Gi} admits a finite subcover (which
will also be a finite subcover of {Gα}. If {Gi} only contains finitely many members,
we are already done; so assume that there are infinitely many Gi’s and assume that
for every value of n we have G1∪ ..... ∪ Gn ⊄ K (else we have found a finite
subcover).
Let Fn = {x ∈ K, x ∈ G1∪ ..... ∪ Gn} = K ∩ Gnc ∩....∩ Gnc . Because the

Gi are open, Fn is closed; by assumption Fn is non-empty and clearly Fn ⊃ Fn+1
for all n. Therefore, applying Lemma 4 we obtain that ∩∞n =1 Fn ≠ φ and there
exists a point y ∈ K such that y ∉ G1∪ ..... ∪ Gn for every n. We conclude that
y ∉ ∪in=1 Gi , which is a contradiction since the open sets Gi cover K.
So there exists a value of n such that G1,..., Gn cover K. We conclude that
every open cover of K admits a finite subcover and therefore that K is compact.
We say that x is a cluster point for a sequence (xn) if for any N > 0 and any open
neighbourhood Ux of x, there is an n > N such that xn ∈ Ux.
Bolzano-Weierstrass Property
A topological space X satisfies the Bolzano-Weierstrass (B-W) property if every
sequence (xn) from X has at least one cluster point.
• If X is compact, then X satisfies B-W.
• Suppose X is compact, but there is sequence (xn) with no cluster point.
Then for every z ∈ X, there is an open neighbourhood Uz of z and Nz > 0
such that xn ∉ Uz for n ≥ Nz. Then since X ⊂ ∪z∈XUz and X is compact,
m
there is a finite set { zi }i =1 such that X ⊂ { zi }i =1 Uz1. But this contradicts xn
m
{ }
m
∉ ∪im=1U z , for all n ≥ max N zi .
i =1
Self-Instructional
Material 187
Compact Set and Limit Sequential Compactness
Point Compactness
Suppose (xn) is a sequence from X. Now consider any sequence (τn) of positive
( ) ( )
∞
NOTES integers such that τn < τn+i for all n. Then xτn ≡ xτn is called a subsequence
n =1
of (xn), for example,

• If (xn) is a sequence, then (x2, x4, x6, ...) is a subsequence of (xn).
• If (xn) converges, then every subsequence of (xn) converges to the same
limit.
We say that X is sequentially compact if every sequence (xn) in X
has a convergent subsequence.
• X is sequentially compact if and only if it satisfies B-W.
• Consider any sequence (xn) from X.
• Suppose X is sequentially compact. Then there is a subsequence ( xτn )
such that xτn → x ∈ X. Therefore, for any ε > 0, there is an N > 0 such
that n > N implies d( xτn , x) < ε. Therefore, xn ∈ Nε(x) for all n > τN,
which implies that (xn) satisfies B-W.
• Suppose X satisfies B-W so that there is a cluster point x ∈ X. We may
construct convergent sequence recursively as follows. Let τ1 = 1. For each
n choose τn ≥ τn–1 such that ( xτn ) ∈ N 1 ( x) . Then xτn → x .
n
• If X compact, then it is sequentially compact.

• Follows immediately from the fact that sequential compactness is equivalent
to B-W, which is implied by compactness.
Completeness
• If (X, d) is a compact space, then it is a complete space.
• Suppose X is compact and consider any Cauchy sequence (xn) from X.
Since X is compact, it is sequentially compact and therefore there is a
subsequence ( xτn ) such that xτn → x .
• We need to show that xn → x. Consider any ε > 0. Then (xn) Cauchy

ε
implies an N > 0 such that d(xn, xm) < for n, m ≥ N. But xτn → x also
2
ε
implies that we may choose N sufficiently large so that d( xτn , x) < .
Self-Instructional 2
188 Material
Then since τN ≥ N, we have, for any n > N, d{xn, x) ≤ d(xn, xτn ) + Point Compactness
ε ε
d(xτ, x) ≤ + = ε.
2 2
NOTES
The finite intersection property is a property of a collection of subsets of a set X.
A collection has this property if the intersection over any finite subcollection of the
collection is nonempty.
A centered system of sets is a collection of sets with the finite intersection
property.
Let X be a set with A = {Ai}i∈I, a family of subsets of X. Then the collection
A has the finite intersection property (fip), if any finite subcollection J ⊂ I has non-
empty intersection  Ai .
i∈J
Theorem 6: Let X be a compact Hausdorff space that satisfies the property

that no one-point set is open. If X has more than one point, then X is uncountable.
Before proving this, we give some examples:
1. We cannot eliminate the Hausdorff condition; a countable set with the
indiscrete topology is compact, has more than one point and satisfies the
property that no one point sets are open, but is not uncountable.
2. We cannot eliminate the compactness condition as the set of all rational
numbers shows.
3. We cannot eliminate the condition that one point sets cannot be open as a
finite space given the discrete topology shows.
Proof: Let X be a compact Hausdorff space. We will show that if U is a
nonempty, open subset of X and if x is a point of X, then there is a neighbourhood
V contained in U whose closure does not contains x (x may or may not be in
U). First of all, choose y in U different from x (if x is in U, then there must exist
such a y for otherwise U would be an open one- point set; if x is not in U, this
is possible since U is nonempty). Then by the Hausdorff condition, choose
disjoint neighbourhoods W and K of x and y, respectively. Then (K ∩ U) will
be a neighbourhood of y contained in U whose closure does not contains x as
desired.
Now suppose f is a bijective function from Z (the positive integers) to X.
Denote the points of the image of Z under f as {x1, x2, ...}. Let X be the first open
set and choose a neighbourhood U1 contained in X whose closure does not contains
Self-Instructional
Material 189
Compact Set and Limit x1. Secondly, choose a neighbourhood U2 contained in U1 whose closure does
Point Compactness
not contains x2. Continue this process whereby choosing a neighbourhood Un+1
contained in Un whose closure does not contains xn+1. Note that the collection
{Ui} for i in the positive integers satisfies the finite intersection property and hence
NOTES
the intersection of their closures is nonempty (by the compactness of X). Therefore
there is a point x in this intersection. No xi can belong to this intersection because
xi does not belongs to the closure of Ui. This means that x is not equal to xi for all
i and f is not surjective; a contradiction. Therefore, X is uncountable.
Corollary 3: Every closed interval [a, b] (a < b) is uncountable. Therefore, the
set of real numbers is uncountable.
Corollary 4: Every locally compact Hausdorff space that is also perfect is

uncountable.
Proof: Suppose X is a locally compact Hausdorff space that is perfect and

compact. Then it immediately follows that X is uncountable (from the theorem).
If X is a locally compact Hausdorff, perfect space that is not compact, then the
one-point compactification of X is a compact Hausdorff space that is also
perfect. It follows that the one-point compactification of X is uncountable.
Therefore X is uncountable (deleting a point from an uncountable set still retains
the uncountability of that set).
A collection A{ Aα }α∈I of subsets of a set X is said to have the finite
intersection property, abbreviated fip, if every finite subcollection {A1, A2,..., An}
of A satisifes  i =1 Ai ≠ φ .
n
The finite intersection property is most often used to give the following
equivalent condition for the compactness of a topological space (a proof of which
may be found here):
Proposition: A topological space X is compact if and only if for every collection
C = {Cα }α∈J of closed subsets of X having the finite intersection property has
nonempty intersection.
An important special case of the preceding condition is that in which C is a
countable collection of non-empty nested sets, i.e., when we have C1 ⊃ C2 ⊃ C3
⊃.... In this case, C automatically has the finite intersection property and if each Ci
is a closed subset of a compact topological space, then, by the proposition,

n
i =1
Ci ≠ φ .
Self-Instructional
190 Material
The fip characterization of compactness may be used to prove a general Compact Set and Limit
Point Compactness
result on the uncountability of certain compact Hausdorff spaces, and is also used
in a proof of Tychonoff’s theorem.
Theorem 7: A topological space is compact if and only if any collection of its NOTES
closed sets having the finite intersection property has non-empty intersection.
The preceding theorem is essentially the definition of a compact space rewritten
using de Morgan’s laws. The usual definition of a compact space is based on open
sets and unions. The above characterization, on the other hand, is written using
closed sets and intersections.
Proof: Suppose X is compact, i.e., any collection of open subsets that cover X
has a finite collection that also covers X. Further, suppose {Fi }i∈I is an arbitrary
collection of closed subsets with the finite intersection property. We claim that
∩ i∈I Fi is non-empty..
Suppose otherwise, i.e., suppose ∩ i∈I Fi = φ .
Then, X = ( F )  (F) (Here, the complement of a set A in X is

i∈I
i
c i∈I
i c
written as Ac). Since each Fi is closed, the collection { F i c }i∈ I is an open cover
for X. By compactness, there is a finite subset J ⊂ I such that X = ∪ i∈ J Fic . But
then X = ( ∪ i∈J Fi )c , so ∩i∈J Fi =

φ , which contradicts the finite intersection
property of {Fi }i∈I .

The proof in the other direction is analogous. Suppose X has the finite
intersection property. To prove that X is compact, let {Fi }i∈I be a collection of
open sets in X that cover X. We claim that this collection contains a finite
subcollection of sets that also cover X. The proof is by contradiction. Suppose
that X = ∪ i∈J Fi holds for all finite J ⊂ I . Let us first show that the collection of
closed subsets { F i c }i∈ I has the finite intersection property. If J is a finite subset of
I, then  i∈ J Fic = (  i∈ J Fi )c ≠ φ where the last assertion follows since J was
finite. Then, since X has the finite intersection property, φ ≠  i∈J Fic =(  i∈J Fi )c ,
this contradicts the assumption that { Fi }i∈I is a cover for X.
Self-Instructional
Material 191
Compact Set and Limit 11.2.3 Continuous Functions and Compact Sets
Point Compactness
D ∪ R is compact if and only if for any given open covering of D we can subtract
a finite sucovering. That is, given (Gα), α ∈ A, a collection of open subsets of R
NOTES (A an arbitrary set of indices) such that D ⊂ ∪α∈A Gα , then there exist finitely
many indices α1,...,αn ∈ A such that D ⊂ ∪=iN 1 Gα1 .
Let D be an arbitrary subset of R. Then A ⊂ D is open in D (or relative

to D, or D-open) if and only if there exists G open subset of R such that
D = G ∩ D. Similarly we can define the notion of D-closed sets. Note that D is
both open and closed in D and so is φ.
D ⊂ R is connected if and only if φ and D are the only subsets of D which
are both open in D and closed in D. In other words, if D = A ∪ B and A, B are
disjoint D-open subsets of D, then either A = φ or B = φ
Let D ⊆ R, a ∈ D a fixed element and f : D → R an arbitrary function. By
definition, f is continuous at a if and only if the following property holds:
∀ε > 0, ∃δa ( ε ) > 0
such that x − a < δa ( ε) and x ∈ D ⇒ f ( x) – f (a) < ε
The last implication can be rewritten in terms of sets as follows:
( )
f Ba ( δ a ( ε ) ) ∩ D ⊆ B f ( a ) (ε)
Here, we use the notation Bx(r) : = (x – r, x + r).
Characterization of Continuous Functions Using Preimages

Theorem 8: Let D ⊆ R and f : D → R a function. Then the following propositions
are equivalent:
• f is continuous (on D).
• ∀G ⊆ R open, f–1(G) is open in D.
• ∀F ⊆ R closed, f–1(F) is closed in D.
Proof: a ⇒ b. Let G ⊂ R open. Pick a ∈ f–1(G). Then f (a) ∈ G and since G is
open, there must exist ε > 0 such that B f ( a ) ( ε ) ⊆ G . By continuity,,
corresponding to this ε > 0 there exists δ > 0 such that
f ( Ba ( δ ) ∩ D ) ⊂ B f ( a ) ( ε ) . But this places the entire set B0(δ) ∩ D inside
f–1(G):
Self-Instructional
192 Material
Ba ( δ ) ∩ D ⊆ f −1 ( G ) Point Compactness
Writing now δ = δa to mark the dependence of δ on a and varying a ∈

f (G), we obtain
–1
NOTES
( )
f −1 ( G ) =∪ a∈ f –1 (G ) Ba ( δ a ) ∩ D
which shows that f–1 (G) is open in D.

b ⇔ c. Let F ⊆ R a closed set, which is equivalent to saying that
G = GF (the complement in R) is open.
Then
f −1 ( F ) ={ x ∈ D | f ( x ) ∈ F } ={ x ∈ D | f ( x ) ∉ G} =D – f –1 ( G )
Since the complement of a D-open subset of D is D-closed, it means that f

–1
(F) is closed in D if and only if f–1(G) is open in D.
c ⇒ a: Left as an exercise.
Using this characterization, we can prove for example that the composition
of continuous functions is a continuous function.
Proposition: Assume f : D → R is continuous, g : E → R is continuous and f (D)
⊆ E. Then the function h := gof : D → M defined by h(x) = g(f(x)) is continuous.
Proof: Let G ⊆ R an open set. Then h–1(G) = f–1(g–1(G)). But g–1(G) = V ∩ E,
for some open set V ⊆ R. But then h–1(G) = f–1(V ∩ E) – f–1(V) is open in D. So
h is continuous.
Theorem 9: Assume f : D → R is a continuous function, such that f(x) ≠ 0,
∀x ∈ D . Then h : D → R given by h(x) = 1/f(x), is continuous as well.
Proof: g : R – {0} → R g(x) = 1/x is continuous, f(D) ⊆ R – {0}, hence h = gof
is continuous.
General Properties of Continuous Functions
Theorem 10: A continuous function maps compact sets into compact sets.
Proof: In other words, assume f : D → R is continuous and D is compact. Then
we need to prove that the image f(D) is a compact subset of R. For that, we
consider an arbitrary open covering f(D) ⊆ ∪αGα of f(D) and we will try to find a
finite subcovering. Taking the preimage we have D ⊆ ∪αf–1(Gα). But f–1(Gα) is
open in D, so there must exist Va ⊆ R open such that f–1(Gα) = Vα ∩ D. Then D
⊆ ∪α (Vα ∩ D) which simply means that D ⊆ ∪αVα. We thus arrived at an open
covering of D. So there must exist finitely many indices α1,..., αN such that D ⊆
Self-Instructional
Material 193
Point Compactness N
∪iN=
1 (Vαi ∩ D ) =
∪=iN 1 Gαi , which implies the equality D = ∪i = 1 f
–1
( )
Gαi . But
N
this implies in turn that f ( D ) ⊆ ∪=i 1 Gαi is compact.
NOTES
Theorem 11: A continuous function maps connected sets into connected sets.
In other words, assume f : D → R is continuous and D is connected. Then
f(D) is connected as well.
Proof: Assume f(D) is not connected. Then there must exist A, B disjoint, non-
empty subsets of f(D), both open relative to f(D), such that f(D) = A ∪ B. Being
open relative to f(D) simply means there exists U, V ⊆ R open such that A = f(D)
∩ U, B = f(D) ∩ V. So f(D) ⊆ U ∪ V. But this implies that
D ⊂ f–1(U) ∩ f–1(V). Since U, V are open, it follows that f–1(U) and f–1(V) are
open relative to D. But they are also disjoint. Since D is connected, it follows that
at least one of them, say f–1(U), is empty. But A ⊆ U, so this forces
f–1(A) = φ as well, which is impossible unless A = φ (note that A is a subset of the
image of f ), contradiction.
Theorem 12: A continuous function on a compact set is uniformly continuous.
Proof: Assume D compact and f : D → R continuous. Given ε > 0 we need to
find δ (ε) > 0 such that if x, y ∈ D and |x – y| < δ(ε), then |f(x) – f(y)| < ε.
From the definition of continuity, given ε > 0 and x ∈ D, there exists
δx (ε) such that if |y – x| < δx(ε), then |f(y) – f(x)| < ε. Clearly D ⊆
1 
∪ x∈ D B x  δ ( ε / 2 )  . From this open covering we can extract a finite
2 
subcovering (D is compact), meaning there must exists finitely many x1, x2, ....,xN
1
ε D such that D ⊆ ∪ iN=1 B xi ( δ xi (ε/2)).
2
1
Let now δ(ε) = min{ δ xi (ε/2)}.
2
Take y, z ∈ D arbitrary such that |y – z| < δ(ε). The idea is that y will be
near some xj, which in turn places z near that same xj. But that forces both f(y),
f(z) to be close to f(xj) (by continuity at xj), and hence close to each other.
1
Since y ∈ D, there must exist some j, 1 < j < N such that y ∈ Bx ( δ x j (ε/
j 2
2)). Thus
Self-Instructional
194 Material
1 Point Compactness
• |y – xj|< δ x j (ε/2)
2
1 NOTES
• but |y – z|< δ(ε) ≤ δ x (ε/2)
2 j
1 1
By the triangle inequality it follows that |z – x| < δ x j (ε/2). So y, z are within δ x j
2 2
(ε/2) of x.
This implies that
• |f(y) – f(xj)|< ε/2
• |f(z) – f(xj)|< ε/2
By the triangle inequality once again we have | f(y) – f(z)| <ε.
Alternative proof using sequences: Assume f is not uniformly continuous,
meaning that there exists ε > 0 such that no δ > 0 does the job.
1
Checking what this means for δ = , we see that for any such 3n ≥ 1 there exist
n
1
xn, yn ∈ D such that |xn – yn| < and yet |f(xn) – f(yn)| > ε. However D is
n
compact; in particular any sequence in D has a convergent subsequence whose
limit belongs to D. Applying this principle twice we find that there must exist n1<
n2 < ... such that the subsequences xnk ( ) k ≥1

( )
and ynk k ≥1
are convergent, and x
= lim x→∞ xnk∈ D, y = lim x→∞ ynk∈ D. We have the following:
1 1
• By construction, xnk – ynk < ≤ . Taking the limit, we find x = y..
nk k
( )
• By continuity, lim k →∞ f xn = f ( x) , since x ∈ D. Also
k
( )
lim k →∞ f ynk = f ( y ) .
( ) ( )
• Also by construction, f xnk – ynk > ε. Hence in the limit, |f(x) – f(y)|
>ε.
We thus reach a contradiction.
Self-Instructional
Material 195
Compact Set and Limit Proposition: Let D ⊆ R. Then the following propositions are equivalent:
Point Compactness
a) D is compact
NOTES
c) Every sequence in D has a convergent subsequence whose limit belongs
to D.
Proof: a ⇒ b. D ⊆ R = ∪n =1 ∞ ( – n, n ) is an open covering of that D. Hence
∃N ≥ 1 such that D ⊆ ∪n =1 ∞ ( – n, n ) = (–N, N). This shows that D is bounded.

To prove D is closed, we prove that R – D is open. Let y ∈ R – D. Then D ⊆
 1 1 
∪∞n =1  R − [ y – , ]  . This open covering must have a finite subcovering, so
 n n 
1 1
∃N ≥ 1 such that D ⊆ R – [ y − , y + ]. But this implies that
N N
 1 1
 y − , y +  ⊆ R – D . But y was chosen arbitrary in R – D, so this set is
 N N
open, and hence D itself is closed.
b ⇒ c. This has to do with the fact that every bounded sequence has a convergent
subsequence.
c ⇒ b. Here one shows D = D and this has to do with the fact that D is the set
of limits of convergent sequences of D, etc.
c ⇒ a. Let D ⊆ ∪∞k =1 Gk be an arbitrary open covering of D.

Note: A covering by a countable collection of open sets is not the most general infinite open
covering one can imagine, of course; we need an intermediate step to prove that from any
open covering of D we can extract a countable subcovering, and this has to do with the fact
that R admits a countable dense set.
We will now prove that there exists n ≥ 1 such that D ⊆ ∪∞k =1 Gk . Assume this was
not the case. Then ∀N ≥ 1 , there exists xn ∈ D – ∪∞k =1 Gk . But xn is a sequence
in D, so it must have a convergent subsequence; call it xn j ( ) j ≥1

, with limit in D. So
lim j →∞ xn j = a ∈ D . But a belongs to one of the Gi’s, say a ∈ GN. Since GN is
open, it follows that xn j ∈ GN , for j ≥ j0 (j large enough). In particular this shows
Self-Instructional
196 Material
n
that for j large enough (larger than j0 and larger than N) we have xn j ∈ GN ⊆ ∪k =j 1 , Point Compactness
since nj ≥ j > N. This contradicts the defining property of xn’s.

Theorem 13: R is connected. NOTES
Proof: This can be restated as, φ and R itself are the only subsets of R which are
both open and closed. To prove this, let E be a non-empty subset of R with this
property. We will prove that E = R. For that, take an arbitrary c ∈ R. To prove
that c ∈ E, we assume that c ∉ E and look for a contradiction. Since E is non-
empty, it follows that E either has points to the left of c or to the right of c. Assume
that the former holds.
• Consider the set S = {x ∈ E|x < c}. By construction, S is bounded from
above (c is an upper bound for S). Therefore we can consider
y = lub(S) ∈ R.
• Input: E is closed. Then S = E ∩ ( – ∞, c ] is also closed. Then y ∈ S = S,
so y < c.
• Input: E is open, y ∈ S ⊆ E and E is open. This means that there exists ε >
0 such that (y – ε, y + ε) ⊆ E. Choose ε small enough so that ε < c – y. In
that case z = y +ε/2 ∈ (y – ε, y + ε) ⊆ E is an element of E with the
properties,
o z < c, hence z ∈ S
o z>y
which is in contradiction with the defining property of y.
Theorem 14: The only connected subsets of R are the intervals (bounded or
unbounded, open or closed or neither).
Proof: First we prove that a connected subset of R must be an interval.
Let E ⊆ R be a connected subset. We prove that if a < b ∈ E, then [a,b]
⊆ E. In other words, together with any two elements, E contains the entire interval
between them. To see this, let c be a real number between a and b. Assume c ∉
E. Then E = A ∪ B, where A = (–∞, c) ∩ E and B = (c, + ∞) ∩ E. Note that A
and B are disjoint subsets of D, both open relative to D. Since S is connected, at
least one of them should be empty, contradiction, since a ∈ A and b ∈ B. Thus c
∈ E.
To show that E is actually an interval, consider inf E and sup E. E is bounded.
Then m = inf E, M = sup E ∈ R, and clearly E ⊆ [m, M]. On the other hand, for
any given x ∈ (m, M), there exists a,b ∈ E such that a < x < b. That is because
m, M ∈ E and one can find elements of E as close to m (respectively M) as
desired (draw a picture with the interval (m, M) and place a point x inside it). But
Self-Instructional
Material 197
Compact Set and Limit then [a,b] ⊆ E, and in particular x ∈ E. Since x was chosen arbitrarily in (m, M),
Point Compactness
we must have (m, M) ⊆ E ⊆ [m, M], so E is definitely an interval. Case two: E is
unbounded. With a similar argument, show that E is an unbounded interval.
NOTES Conversely, we need to show that intervals are indeed connected sets. The
proof is almost identical to that in the case where the interval is R itself.
Theorem 15: Let D ⊆ R be compact and f : D → R be a continuous function.
Then there exists y1, y2 ∈ D such that f (y1) ≤ f(x) ≤ f(y2), ∀x ∈ D.
Proof: f(D) is a compact subset of R, so it is bounded and closed. This implies
that glb(f(D)) ∈ f(D) and lub(f(D)) ∈ f(D) as well. But then there must exist y1, y2
∈ D such that f(y1) = glb f(D) and f(y2) = lub f(D). But this implies f(D) ⊆ [f(y1),
f(y2)] and we are done.
Note: We use the notation supx ∈D f(x) to denote the lub of the image of D. In other words,
supx ∈D f(x) = lub{f(y) | y ∈ D}. The theorem says that if D is compact and f is continuous, then
supx ∈D f(x) is finite, and moreover that there exists y1 ∈ D such that f(y1) = supx ∈D f(y). If the
domain is not compact, one can find examples of continuous functions such that either i) sup
f = + ∞ or such that ii) sup f is a real number but not in the image of f.
For case i), take f(x) = 1/x defined on (0,1]. For case ii), take f(x) = x defined on [0,1).
Theorem 16: A continuous (real-valued) function defined on an interval in R has
the intermediate value property.
Proof: Assume E is an interval in R and f: E → R a continuous function. Let a,b ∈
E (say a < b) and y a number between f(a) and f(b). The intermediate value
property is the statement that there exists c between a and b such that f(c) = y. But
this follows immediately from the fact that f(E) is an interval. E is an interval in R
⇒ E is connected ⇒ f(E) is a connected subset of R ⇒ f(E) is an interval in R.
Check Your Progress

1. When is a subset of a metric space compact?
2. What is the base for a space X?
3. What is a cluster point for a sequence?
4. What is the subsequence for a sequence from a topological space?
11.3 LIMIT POINT COMPACTNESS
Theorem 17: Let f be a continuous mapping of a compact metric space X into a

metric spce Y. Then f [X] is compact.
In other words, continuous image of a compact space is compact.
Self-Instructional
198 Material
Proof: Let {Hλ:λ ∈ A} be an open cover of f [X]. Since f is continuous, f–1 [Hλ] is Compact Set and Limit
Point Compactness
an open set in X. It follows that the collection {f–1[Hλ]:λ ∈A} is an open cover of
X. Since X is compact, there exist finitely many indices λ1...., λn such that
X = f -1 [Hλ1]  ...  f–1 [Hλn) = f1 [Hλ1 ... Hλn]. NOTES
It follows that
f = [X] = f [f–1 (Hλ1  ...  Hλ1] ⊂ Hλn)  ...  Hλn
Hence f[X] is compact.
A mapping f of a set A into Rn is said to be bounded if there exists a real
number M such that | f ( x) | ≤ M for all x ∈ A.
Limits and Continuity
Let (X, d) and (Y, p) be two metric spaces and A ⊂ X . Suppose f maps A into Y,,
and p is a limit point of A. Then we say that f(x) tends to the limit q ∈ Y as x tends
to p if for every q > 0 there exists a δ > 0 such that
0 < d ( x, p) < δ ⇒ ρ ( f ( x), q) < ∈
lim
We then write f(x) → q as x → p or x → p f(x) = q.
Let (X, d) and (Y, p) be two metric spaces, A ⊂ X , p ∈ A and f maps A into
Y. Then we say that f is continuous at p if for every ∈> 0 there exists a aδ > 0
such that
x ∈ A, d ( x, p ) < δ ⇒ ρ ( f ( x), f ( p )) <∈
If f is continuous at every point of A, then f is said to be continuous on A or
simply continuous.
Continuity in Rn
Let A be a subset of Rn and let f be a mapping of A into Rm. Then f is said to be
continuous at a point p ∈ A if for every ∈> 0 there exists δ > 0 such that
| x – p |< δ ⇒| f(x) – f(p) |<∈ .
Example 1: Let (X, d) and (Y, p) be two metric spaces and p an isolated point of
A ⊂ X . Show that the map f: A → Y is continuous at p.
Solution: Let ∈> 0 be given. Since p is an isolated point of A, we can always find
a δ > 0 such that the only point x ∈ A for which d ( x, p) < δ is x = p. We then
have
Self-Instructional
Material 199
Point Compactness
ρ ( f ( x), f ( p)= ρ ( f ( p), f ( p))= 0 <∈ .
Hence f is continuous at p.
Theorem 18: Let (X, d) (Y, ρ ) and (Z, σ ) be three metric spaces, A ⊂ X f
NOTES
maps A into Y, g maps f [A] into Z, and h is a mapping of A into Z defined by
h( x) g ( f ( x))( x ∈ A)
=
(The mapping h is called the composition map of the functions f and g). If is
continuous at a point p ∈ A and if g is continuous at f(p) then h is continuous at p.
Proof: Let ∈> 0 be given. Since g is continuous at f(p) there exists η > 0 such
that
y ∈ f [ A], ρ ( y, f ( p )) < η ⇒ σ ( g ( y ), g ( f ( p )) <∈
Again since f is continuous at p there exists δ > 0 such that
x ∈ A, d ( x, p ) < δ ⇒ ρ ( f ( x), f ( p )) < η
Since f(x) ∈ f [ A] taking y = f(x) in the equation, it then follows from the
above equations that
x ∈ A, d ( x, p ) < δ ⇒ σ ( g ( f ( x)), g ( f ( p ))) <∈
⇒ σ ( h( x), h( p)) <∈ by def. of h.

This shows that h is continuous at p.
Theorem 19: Let(X, d) and (Y, ρ ) be two metric spaces. A mapping f of X into
Y is continuous X on if and only if f–1 [H] is open in X for every open set H in Y.
Proof: Let f be continuous on X and H an open set in Y. To show that f–1 [H] is
open in X. If f–1 [H] = φ, then f–1 [H] is surely open. If f–1 [H] ≠ φ, let p ∈ f −1[ H ]
be arbitrary. Then f ( p ) ∈ H . Since H is open, there exists ∈> 0 such that
N ( f ( p ),∈) ⊂ H
that is, ρ ( y, f ( p)) <∈⇒ y ∈ H .
Again since f is continuous at p, there exists δ > 0 such that
d ( x, p ) < δ ⇒ ρ ( f ( x), f ( p )) <∈ .
From (1) and (2), we conclude that
d ( x, p ) < δ ⇒ ρ ( f ( x) ∈ H ⇒ x ∈ f −1[ H ]
that is N ( p, δ ) ⊂ f −1[ H ] .
Thus we have shown that f–1 [H] contains an nhd of each of its points and
consequently it is open.
Self-Instructional
200 Material
Conversely, let f–1 [H] be open in X for every open set H in Y and let p be an Compact Set and Limit
Point Compactness
arbitrary point of X. We have to show that f is continuous at p. Let ∈> 0 be given.
Let
V= { y ∈ Y : ρ ( y, f ( p) <∈} . NOTES
Then V is an open set in Y and so by hypothesis f–1 [V] is an open set in X and
it contains p. Hence, by definition of open set, there exists, δ > 0 such that
N ( p, δ ) ⊂ f −1[V ] = d ( 12 (x1, x2), (y1, y2))
= (( 12 x1, x2), (y1, y2), ( 12 y1, 1

2 y2))
= √ [( 14 (x1 – x2)2 + 1
4 (y1 – y2)2]
1
= √[(x1 – x2) + (y1 – y2)]
2 2
2
1
= 2 d(x1 – y)
11.4 LOCAL COMPACTNESS

Many of important spaces occuring in analysis are not compact, but instead have
a local version of compactness. For example, Euclidean n-space is not compact,
but each point of En has a neighbourhood whose closure is compact.
Definition: A topological space (X, T) is locally compact if each point has a
relatively compact neighbourhood.
For example, En is locally compact; Bρn ( x,1) is compact for each
x ∈ En. Note that this example also shows that a locally compact subset of a
Hausdorff space need not be closed. Also, any infinite discrete space is locally
compact, but not compact. The set of rationals in E1 is not a locally compact
space.
Theorem 20: If (X, T) is a compact topological space, then X is locally compact.
Theorem 21: The following four properties are equivalent:
1. X is a locally compact Hausdorff space.
2. For each x ∈ X and each neighbourhood U(x), there is a relatively compact
open V with x ∈ V ⊂ V ⊂ U.
Self-Instructional
Material 201
Compact Set and Limit 3. For each compact C and open U ⊃ C, there is a relatively compact open V
Point Compactness
with C ⊂ V ⊂ V ⊂ U.
4. X has a basis consisting of relatively compact open sets.
NOTES Proof
(1) ⇒ (2) There is some open W with x ∈ W ⊂ W and W compact. Since W is
a regular space and W ∩ U is a neighbourhood of x in W , there is a set G
open in W such that x ∈ G ⊂ GW ⊂ W ∩ U. Now G = E∩ W , where E

is open in X and the desired neighbourhood of x in X is V = E∩W.
(2) ⇒ (3) For each c ∈ C find a relatively compact neighbourhood V(c) with
V (c) ⊂ U; since U is compact, finitely many of these neighbourhoods cover
C and therefore this union has compact closure.
(3) ⇒ (4) Let  be the family of all relatively compact open sets in X; since
each x ∈ X is compact, (3) asserts that  is a basis.
(4) ⇒ (1) is trivial.
Hence proved.
Local compactness is not preserved by continuous surjections. For example,
if (X, T) is any non-locally compact space, map f: X → X, the identity map. Then
f is a (D, T) continuous surjection, where D is the discrete topology on X. But
while (X, D) is locally compact, (X, T) is not by choice.
However, a continuous open map onto a Hausdroff space does preserve
local compactness.
Theorem 22: Let (Y, U) be a Hausdroff space. Let f : X → Y be a (T, U)
continuous, open surjection. Let X be T-locally compact, then Y is U-locally
compact.
Proof: For given y ∈ Y choose x ∈ X so that f(x) = y and choose a relatively
compact neighbourhood U(x). Because f is an open map, f(U) is a neighbourhood
of y, and because f (U ) is compact, we find from f (U ) ⊂ f (U ) = f (U ) that
f (U ) is compact.
Definition: Let (X, T) be a topological space and A ⊂ X. Then A is T-locally
compact if and only if A is TA locally compact.
Theorem 23: Let (X, T) be a local compact space and A ⊂ X. Then A is locally
compact if and only if for any x ∈ A there exists a T-neighbourhood V of x such
Self-Instructional
202 Material
that A ∩ ( A ∩ V ) is T-compact. Point Compactness
Example 2: A subspace of a locally compact space is not necessarily compact.

For example, the set if irrationals  is not locally compact in E1, although E1 is
NOTES
locally compact.
To see this, let V be any neighbourhood of π. If  ∩ (  ∩ V ) is compact
then  ∩ (  ∩ V ) is bounded and closed. For some ε > 0, ]π−ε, π+ε[ ⊂ V.

Choose any rational y with π−ε < y < π+ε. Then y is a cluster point of
 ∩ (  ∩ V ) , but y ∉  ∩ (  ∩ V ) as y ∉ . This means that  ∩ (  ∩ V ) is
not closed after all, a contradiction. Then  ∩ (  ∩ V ) cannot be compact, so 
is not locally compact.
As with subspaces, a product of locally compact spaces need not be locally
compact. If, however, the coordinate spaces are Hausdorff, and if enough of them
are compact, then the product will be locally compact.
Theorem 24: ∏ {Yα : α ∈ } is locally compact if and only if all the Yα are locally
compact Hausdroff spaces and at most finitely many are not compact.
Proof: Assume the condition holds. Given {yα} ∈ ∏ Yα , for each of the atmost
α
finitely many indices for which Yα is not compact, choose a relatively compact
neighbourhood Vαi ( yαi ) ; then < Vα1 ,...,Vα n > is a neighbourhood of {yα} and
< Vα1 ,..., Vα n > = < Vα ,..., Vα > is compact.
1 n
Conversely, assume ∏ Yα to be locally compact; since each projection pα

α
is a continuous open surjection, each Yα is certainly locally compact. But also,
choosing any relatively compact open V ⊂ ∏ Yα , each pα( V ) is compact and

α
since pα( V ) = Yα for all but atmost finitely many indices α, the result follows.
A one point compactification of a non-compact space is Hausdorff space
exactly when the space is Hausdorff and locally compact.
Theorem 25: Let (X, T) be a non-compact space and (Y, U) be an Alexandroff
one-point compactification of (X, T). Then (Y, U) is a Hausdorff space if and only
if (X, T) is Hausdorff and locally compact.
Self-Instructional
Material 203
Compact Set and Limit Theorem 26: Every locally compact Hausdorff space is completely regular.
Point Compactness
Proof: Let (X, T) be a locally compact Hausdorff space and the space (Y, U) be
an Alexandroff one-point compactification of (X, T). Since (Y, U) is a compact
NOTES Hausdorff space, then U is a normal topology. By Urysohn’s lemma, (Y, U) must
be completely regular. Then (X, T) is a subspace of a completely regular space
and so is also completely regular.
Check Your Progress

5. Define a locally compact space.
6. When does a one point compactification of a non-compact space is
Hausdorff space?

QUESTIONS
1. A subset of a metric space X is said to be compact if every open cover of

A has a finite subcover, that is, if for every collection
{Gλ : λ ∈ A} of open sets for which
A ⊂ ∪ {Gλ : λ ∈ A},
there exist finitely many sets Gλ1,...,Gλn among the Gλ’s such that
A ⊂ Gλ1 ∪ ... ∪ Gλn .
2. A collection {Va} of open subsets of X is said to be a base for X if the

3. x is a cluster point for a sequence (xn) if for any N > 0 and any open
neighbourhood Ux of x, there is an n > N such that xn ∈ Ux.
4. Suppose (xn) is a sequence from X. Now consider any sequence (τn) of
( ) ( )
∞
positive integers such that τn < τn+i for all n. Then xτn ≡ xτn is called
n =1
a subsequence of (xn)
5. A topological space (X, T) is locally compact if each point has a relatively
compact neighbourhood.
6. A one point compactification of a non-compact space is Hausdorff space
exactly when the space is Hausdorff and locally compact.
Self-Instructional
204 Material
11.6 SUMMARY Point Compactness
• By an open cover of a subset A of a metric space X, we mean a collection

C = {Gλ : λ ∈ 1} of open subsets of X such that A ⊂ ∪ {Gλ : λ ∈ A}. We NOTES
then say that C covers A.
• By a subcover of an open cover C of A, we mean a subcollection C′ of C′
such that C′ covers A.
• In particular, the metric space X is said to be compact if for every collection
{Gλ : λ ∈ A; of open sets for which
X = ∪{Gλ : λ ∈ A},
there exist finitely many sets Gλ ,..., Gλ among the Gλ’ss such that
1 n
X = Gλ1 ∪ ... ∪ Gλ n
• Every compact subset of a metric space is closed.

• A compact metric space is sequentially compact.
• In a compact metric space every bounded sequence has a convergent
subsequence.
• K is compact if every open cover of K contains a finite subcover. K is
sequentially compact if every infinite subset of K has a limit point in K.
• A collection {Va} of open subsets of X is said to be a base for X if the
• Every open subset of X decomposes as a union of a subcollection of the
Vα’s — the Vα’s ‘generate’ all open subsets. The family {Vα} almost always
contains infinitely many members (the only exception is if X is finite).
However, if X happens to be separable, then countably many open subsets
are enough to form a base (the converse statement is also true and is an
easy exercise).
• Every separable metric space has a countable base.
• If X is sequentially compact then it is separable.
• If X has a countable base, then every open cover of X admits an at most
countable subcover.
• If {Fn} is a sequence of non-empty closed subsets of a sequentially compact
set K such that Fn ⊃ Fn + 1 for all n = 1, 2,..., then ∩∞n =1 Fn ≠ φ .
Self-Instructional
Material 205
Compact Set and Limit • A topological space X satisfies the Bolzano-Weierstrass (B-W) property if
Point Compactness
every sequence (xn) from X has at least one cluster point.
• Suppose (xn) is a sequence from X. Now consider any sequence (τn) of
NOTES
( ) ( )
∞
positive integers such that τn < τn+i for all n. Then xτn ≡ xτn is called
n =1
a subsequence of (xn)
• A centered system of sets is a collection of sets with the finite intersection
property.
• Let X be a set with A = {Ai}i∈I, a family of subsets of X. Then the collection
A has the finite intersection property (fip), if any finite subcollection J ⊂ I
has non-empty intersection  Ai .
i∈J
• Let X be a compact Hausdorff space that satisfies the property that no

one-point set is open.
• Every closed interval [a, b] (a < b) is uncountable. Therefore, the set of

real numbers is uncountable.
• Every locally compact Hausdorff space that is also perfect is uncountable.
• A topological space X is compact if and only if for every collection C =

{Cα }α∈J of closed subsets of X having the finite intersection property has
nonempty intersection.
• D ∪ R is compact if and only if for any given open covering of D we

can subtract a finite sucovering.
• Let D ⊆ R and f : D → R a function. Then the following propositions

are equivalent:
ο f is continuous (on D).
ο ∀G ⊆ R open, f–1(G) is open in D.
ο ∀F ⊆ R closed, f–1(F) is closed in D.
• Assume f : D → R is continuous, g : E → R is continuous and f (D) ⊆ E.
Then the function h := gof : D → M defined by h(x) = g(f(x)) is continuous.
• A continuous function on a compact set is uniformly continuous.
• Let D ⊆ R. Then the following propositions are equivalent:
(a) D is compact
(b) D is bounded and closed
Self-Instructional
206 Material
(c) Every sequence in D has a convergent subsequence whose limit belongs Compact Set and Limit
Point Compactness
to D.
• The only connected subsets of R are the intervals (bounded or unbounded,
open or closed or neither). NOTES
• Let D ⊆ R be compact and f : D → R be a continuous function. Then there
exists y1, y2 ∈ D such that f (y1) ≤ f(x) ≤ f(y2), ∀x ∈ D.
• A continuous (real-valued) function defined on an interval in R has the
intermediate value property.
• Let f be a continuous mapping of a compact metric space X into a metric
spce Y. Then f [X] is compact.
In other words, continuous image of a compact space is compact.
• If f is continuous at every point of A, then f is said to be continuous on A or
simply continuous.
• Let A be a subset of Rn and let f be a mapping of A into Rm. Then f is said
to be continuous at a point p ∈ A if for every ∈> 0 there exists δ > 0 such
that
| x – p |< δ ⇒| f(x) – f(p) |<∈ .
• Let (X, d) (Y, ρ ) and (Z, σ ) be three metric spaces, A ⊂ X f maps A into
Y, g maps f [A] into Z, and h is a mapping of A into Z defined by
h( x) g ( f ( x))( x ∈ A)
=
• Let(X, d) and (Y, ρ ) be two metric spaces. A mapping f of X into Y is
continuous X on if and only if f–1 [H] is open in X for every open set H in Y.
• If (X, T) is a compact topological space, then X is locally compact.
• The following four properties are equivalent:
1. X is a locally compact Hausdorff space.
2. For each x ∈ X and each neighbourhood U(x), there is a relatively
compact open V with x ∈ V ⊂ V ⊂ U.
3. For each compact C and open U ⊃ C, there is a relatively compact open
V with C ⊂ V ⊂ V ⊂ U.
4. X has a basis consisting of relatively compact open sets.
• Let (Y, U) be a Hausdroff space. Let f : X → Y be a (T, U) continuous,
open surjection. Let X be T-locally compact, then Y is U-locally compact.
• Let (X, T) be a topological space and A ⊂ X. Then A is T-locally compact
if and only if A is TA locally compact.
Self-Instructional
Material 207
Compact Set and Limit • Let (X, T) be a local compact space and A ⊂ X. Then A is locally compact
Point Compactness
if and only if for any x ∈ A there exists a T-neighbourhood V of x such that
A ∩ ( A ∩ V ) is T-compact.
NOTES
• ∏{Y α : α ∈ } is locally compact if and only if all the Yα are locally
compact Hausdroff spaces and at most finitely many are not compact.
• Let (X, T) be a non-compact space and (Y, U) be an Alexandroff one-point
compactification of (X, T). Then (Y, U) is a Hausdorff space if and only if
(X, T) is Hausdorff and locally compact.
11.7 KEY WORDS
• Limit point compactness: A topological space X is said to be limit point

compact if every infinite subset of X has a limit point in X.
• Local compactness: A topological space is locally compact if each point
has a relatively compact neighbourhood.
• Finite intersection property: It is a property of a collection of subsets of
a set X. A collection has this property if the intersection over any finite
sublocation of the collection is nonempty.

AND EXERCISES

1. Describe compact set in the real line.
2. Give an analytical description of compactness and sequential compactness.
3. Explain the finite intersection property.
4. Discuss general properties of continuous functions.
1. Discuss Bolzano-Weierstrass property and sequential compactness.
2. Give a detailed account of limit point compactness.
3. Give a detailed account of continuous functions and compact sets.
4. Explain limit point compactness in detail with the help of examples.
5. Discuss local compactness in detail with the help of examples.
Self-Instructional
208 Material
11.9 FURTHER READINGS Point Compactness
India. NOTES
Ltd.
Sons, Inc.
Self-Instructional
Material 209
Countability and
Separation Axioms
BLOCK - IV
COUNTABILITY AXIOMS AND NORMAL SPACES
NOTES
UNIT 12 COUNTABILITY AND

SEPARATION AXIOMS
Structure
12.0 Introduction
12.1 Objectives
12.2 Axioms of Countability
12.3 The Separation Axioms
12.3.2 Convergence to to Space
12.5 Summary
12.6 Key Words
12.0 INTRODUCTION
An axiom of countability is a property of distinct mathematical objects that asserts

the existence of a countable set with certain properties. Without such an axiom,
such a set might not provably exist. In topology and related fields of mathematics,
there are several restrictions that one often makes on the kinds of topological
spaces that one wishes to consider. Some of these restrictions are given by
the separation axioms. These are sometimes called Tychonoff separation axioms,
after Andrey Tychonoff. In this unit, you will study the axioms of countability and
the separation axioms. You will understand Hausdorff spaces, principle of extension
of identities and convergence of T0 space. You will discuss first and second countable
spaces. You will understand Lindelof’s theorems and characterization of compact
sets on R, separable spaces, separability.
12.1 OBJECTIVES

• Discuss the axioms of countability and the separation axioms
Self-Instructional
210 Material
• Describe Hausdorff spaces, principle of extension of identities and Countability and
Separation Axioms
convergence of T0 space
• Explain first and second countable spaces
• Interpret Lindelof’s theorems and characterization of compact sets on R NOTES
• Discuss separable spaces and separability
12.2 AXIOMS OF COUNTABILITY
Following are the axioms of countability specifically used for topological spaces.
First Axiom of Countability
A topological space X is said to satisfy the First Axiom of Countability if, for
every x ∈ X there exists a countable collection � of neighbourhoods of x, such
that if N is any neighbourhood of x, then there exists U ∈ � with U ⊆ N.
A topological space that satisfies the first axiom of countability is said
to be First Countable.
All metric spaces satisfy the first axiom of countability because for any
neighbourhood N of a point x, there is an open ball within N, and the countable
collection of neighbourhoods of x that are where , has the
neighbourhood where .
Theorem 1. If a topological space satisfies the first axiom of countability, then for
any point x of closure of a set S, there is a sequence {ai} of points within S which
converges to x.
Proof: Let {Ai} be a countable collection of neighbourhoods of x such that for
any neighbourhood N of x, there is an Ai such that Ai ⊂ N. Define,
Then form a sequence {ai} such that Ai ⊂ Bi. Consequently, {ai} converges
to x.
Theorem 2. Let X be a topological space satisfying the first axiom of countability.
Then, a subset A of X is closed if and only if all convergent sequences {xn} ⊂ A
which converge to an element of X converge to an element of A.
Proof: Suppose that {xn} converges to x within X. The point x is a limit point of
{xn} and thus is a limit point of A, and since A is closed, it is contained within A.
Conversely, suppose that all convergent sequences within A converge to an element
within A, and let x be any point of contact for A. Then by the theorem above, there
is a sequence {xn} which converges to x, and so x is within A. Thus, A is closed.
Self-Instructional
Material 211
Countability and Second Axiom of Countability
Separation Axioms
A topological space is said to satisfy the Second Axiom of Countability if it
has a countable base. Consequently, the topological space that satisfies the second
NOTES axiom of countability is said to be Second Countable.
Fundamentally, the topological space that satisfies the second axiom of
countable is first countable, since the countable collection of neighbourhoods of a
point can be all neighbourhoods of the point within the countable base, so that any
neighbourhood N of that point must contain at least one neighbourhood A within
the collection, and A must be a subset of N.
Theorem 3. If a topological space X satisfies the second axiom of countability,
then all open covers of X have a countable subcover.
Proof: Let be an open cover of X, and let B be a countable base for X. B
covers X. For all points x, select an element of , Cx which contains x, and an
element of the base Bx, which contains x and is a subset of Cx (which is possible
because B is a base). { Bx} forms a countable open cover for X. For each Bx,
select an element of which contains Bx, and this is a countable subcover of .
Check Your Progress

1. When does a topological space satisfy the first axiom of countability?
2. What is meant by a first countable topological space?
12.3 THE SEPARATION AXIOMS
The separation axioms Ti specify the degree to which distinct points or closed sets
may be separated by open sets. These axioms are statements about the richness
of topology.
Definition (Ti axioms): Let (X,  ) be a topological space.
T0 axiom : If a, b are two distinct elements in X, there exists an open set U
∈  such that either a ∈ U and b ∉U, or b ∈U and a ∉U (i.e., U containing
exactly one of these points).
T1 axiom: If a, b ∈ X and a ≠ b, there exist open sets Ua, Ub ∈  containing
a, b respectively, such that b ∉ Ua, and a ∉ Ub.
T2 axiom: If a, b ∈ X, a ≠ b, there exist disjoint open sets Ua, Ub ∈ 
containing a, b respectively.
T3 axiom: If A is a closed set and b is a point in X such that b ∉ A, there exist
disjoint open sets UA, Ub ∈  containing A and b respectively.
T4 axiom : If A and B are disjoint closed sets in X, there exist disjoint open
sets UA, UB ∈  containing A and B respectively.
Self-Instructional
212 Material
T5 axiom : If A and B are separated sets in X, there exist disjoint open sets Countability and
Separation Axioms
UA , UB ∈  containing A and B respectively.
If (X,  ) satisfies a Ti axiom, X is called a Ti space. A T0 space is sometimes
called a Kolmogorov space and a T1 space, a Frechet space. A T2 is called a NOTES
Hausdorff space.
Each of axioms in Definition above is independent of the axioms for a
topological space; in fact there exist examples of topological spaces which fail to
satisfy any Ti. But they are not independent of each other, for instance, axiom T2
implies axiom T1, and axiom T1 implies T0.
More importantly than the separation axioms themselves is the fact that they
can be employed to define successively stronger properties. To this end, we note
that if a space is both T3 and T0 it is T2, while a space that is both T4 and T1 must
be T3. The former spaces are called regular, and the latter normal.
Specifically a space X is said to be regular if and only if it is both a T0 and a
T3 space, normal if and only if it is both a T1 and T4 space, completely normal if
and only if it is both a T1 and a T5 space. Then we have the following implications:
Completely normal ⇒ Normal ⇒ Regular ⇒ Hausdorff ⇒ T1 ⇒ T0
The use of terms ‘regular’ and ‘normal’ is not uniform throughout the
literature. While some authors use these terms interchangeably with ‘T3 space’
and ‘T4 space’ respectively, others refer to our T3 space as a ‘regular’ space and
vice versa, and similarly permute ‘T4 space’ and ‘normal’. This allows the
successively stronger properties to correspond to increasing Ti axioms.
Theorem 4: Let (X,  ) be a topological space. Then the following statements are
equivalent:
1. (T2 axiom). Any two distinct points of X have disjoint neighbourhoods.
2. The intersection of the closed neighborhoods of any point of X consists of
that point alone.
3. The diagonal of the product space X × X is a closed set.
4. For every set I, the diagonal of the product space Y + XI is close in Y.
5. No filter on X has more than one limit point.
6. If a filter  on X converges to x, then x is the only cluster point of .
Proof: We will proof the implications:
(1) ⇒ (2) ⇒ (6) ⇒ (5) ⇒ (1)
(1) ⇒ (4) ⇒ (3) ⇒ (1)
Self-Instructional
Material 213
Countability and (1) ⇒ (2) : If x ≠ y there is an open neighbourhood U of x and an open
Separation Axioms
neighbourhood V of y such that U ∩ V =∅ ; hence y ∉ U .
(2) ⇒ (6) : Let x ≠ y ; then there is a closed neighbourhood V of x such

NOTES
that y ∉V , and by hypothesis there exists M ∈F such that M ⊂ V ; thus
M ∩ CV = ∅ . But CV is a neighbourhood of y; hence y is not a cluster point
of F .
(6) ⇒ (5) : Clear, since every limit point of a filter is also a cluster point.
(5) ⇒ (1) : Suppose x ≠ y and that every neighbourhood V of x meets
every neighbourhood W of y. Then the sets V ∩ W form a basis of a filter, which
has both x and y as limits points, which is contrary to hypothesis.
(1) ⇒ (4) : Let ( x ) = ( xi ) be a point of XI which does not belong to the
diagonal ∆. Then there are at least two indices λ, µ such that xλ ≠ xµ . Let Vλ
(respectively Vµ) be a neighbourhood of xλ (respectively xµ) in X, such that
∅ ; then the set W = Vλ × Vµ × ∏ X i (where=
Vλ ∩ Vµ = X i X if i ≠ λ, µ ) is a
i ≠λ λ µ
neighbourhood of x in XI which does not meet ∆. Hence ∆ is closed in XI.

(4) ⇒ (3) : Obvious.
(3) ⇒ (1) : If x ≠ y then ( x, y ) ∈ X × X is not in the diagonal ∆, hence
there is a neighbourhood V of x and a neighbourhood W of y in X such that
(V × W ) ∩ ∆ = ∅ , which means that V ∩ W = ∅.
Let f : X → Y be a mapping of a set X into a Hausdorff space Y; then it

follows immediately from Theorem 2.24 that f has at most one limit with respect
to a filter F on X, and that if f has y as a limit with respect to F , then y is the only
cluster point of f with respect to F .
Theorem 5: Let f, g be two continuous mappings of a topological space X into a
Hausdorff space Y; then the set of all x ∈X such that f ( x) = g ( x) is closed in X.
Corollary 1 (Principle of extension of identities): Let f, g be two continuous
mappings of a topological space X into a Hausdorff space Y. If f ( x) = g ( x) at all
points of a dense subset of X, then f = g.
In other words, a continuous map of X into Y (Hausdorff) is uniquely
determined by its values at all points of a dense subset of X.
Corollary 6: If f is a continuous mapping of a topological space X into a Hausdorff
space Y, then the growth of f is closed in X × Y.
Self-Instructional
214 Material
Countability and
For this graph is the set of all ( x, y) ∈ X × Y such that f ( x) = y and the two Separation Axioms
mappings ( x, y ) → f ( x) are continuous.
The invariance properties of Hausdorff topologies are:
NOTES
Theorem 7:
1. Hausdorff topologies are invariant under closed bijections.
2. Each subspace of a Hausdorff space is also a Hausdorff space.
3. The Cartesian product ∏ { X α | α ∈A } is Hausdorff if and only if each Xα

is Hausdorff.
Proof:
1. Since a closed bijection is also an open map, the images of disjoint

neighborhoods are disjoint neighbourhoods and the result follows.
2. Let A ⊂ X and p, q ∈ A ; since there are disjoint neighbourhoods U(p),
U(q) in X, the neighbourhoods U ( p ) ∩ A and U (q) ∩ A in A are also
disjoint.
3. Assume that each Xα is Hausdorff and that { pα } ≠ {qα } ; then pα ≠ qα for
some α. So choosing the disjoint neighbourhoods U ( pα ) , U (qα ) gives the
required disjoint neighbourhoods (U ( pα )) , (U ( qα )) in ∏

α
X α . Conversely,,
if ∏X
α
α is Hausdorff, then each Xα is homeomorphic to some slice in
∏Xα
α , so by (2) (since the Hausdorff property is a topological invariant),
Xα is Hausdorff.
Theorem 8: If every point of a topological space X has a closed neighbourhood,
which is a Hausdorff subspace of X, then X is Hausdorff.
12.3.2 Convergence to T0 Space
Definition : Let (X, T) be a topological space and x ∈ X. Let <xn> be a sequence
of points in X. Then the sequence has limit x or converges to x written as lim xn =
x or xn → x if and only if for every open set G containing x there exists an integer
N(G) such that xn ∈ G whenever n > N(G).
A sequence will be called convergent if and only if there is at least one point
to which it converges. Every subsequence of a convergent sequence is also
convergent and has the same limits. The convergence of a sequence and its limits
are not affected by a finite number of alternations in the sequence, including the Self-Instructional
Material 215
Countability and adding or removing of a finite number of terms of the sequence. It is the failure of
Separation Axioms
limits of sequences to be unique that makes this concept unsatisfactory in general
topological spaces. For example let T be the trivial topology on a set X and let
<xn> be a sequence in X and x be any member of X, then <xn> → x.
NOTES
However in a Hausdorff space, a convergent sequence has a unique limit as
the following theorem shows.
Theorem 9: In a Hausdorff space, a convergent sequence has a unique limit.
Proof: Suppose a sequence <xn> converges to two distinct points x and x* in a
Hausdorff space X. By the Hausdorff property, there exists two disjoint open sets
G and G* such that x ∈G and x* ∈ G*. Since xn → x, there exists an integer N
such that xn ∈ G whenever n > N. Also xn → x*, there exists an integer N such
that xn ∈G* whenever n > N*. If m is any integer greater than both N and N*,
then xm must be in both G and G* which contradicts that G and G* are disjoint.
Note: The converse of this theorem is not true.
Theorem 10: If <xn> is a sequence of distinct points of a subset E of a topological

space X which converges to a point x ∈ X then x is a limit point of the set E.
Proof: If x belongs to the open set G, then there exists an integer N(G) such that,
xn ∈G for all n > N(G). Since the points xn’s are distinct, at most one of them
equals x and so E ∩ G − {x} ≠ φ; this implies that x is a limit point of E.
Note: The converse of this theorem is not true, even in a Hausdorff space.
Theorem 11: If f is a continuous mapping of the topological space X into the

topological space X*, and <xn> is a sequence of points of X, which converges to
the point x ∈ X, then the sequence <f(xn)> converges to the point f(x) ∈ X*.
Proof: If f(x) belongs to the open set G* in X*, then f-1( G*) is an open set in
X containing x, since f is continuous and we know that if f is continuous, then
inverse image of every open set is open, then there must exist an integer N such
that xn ∈ f–1( G*), whenever n > N. Thus we have f(xn) ∈ G* when n > N and
so f(xn) → f(x). Hence <f(xn)> converges to the point f(x) ∈ X*.
Note: The converse of this theorem is also not true even in a Hausdorff space, that is, the
mapping f for which xn → x implies f(xn) → f(x), may be continuous. For example, let X be the
Hausdorff space of ordinals less than or equal to the first uncountable ordinal r with order
topology. The real valued function f, defined by setting f(α) = 0 if α < r and f(r) = 1 is not
continuous at r, even though it does preserve convergent sequences.
Theorem 12: An infinite Hausdorff space X contains an infinite sequence of non-

empty disjoint open sets.
Proof: If X has no limit point, then X must have the discrete topology since singletons
are closed in a Hausdorff space. Thus any infinite sequence of distinct points of X
Self-Instructional would serve as desired sequence.
216 Material
Suppose, then that x is a limit point of X. Choose x1 to be any point of X Countability and
Separation Axioms
different from x. Since X is Hausdorff, there exists two disjoint open sets G1 and
V1 such that x1 ∈ G1 and x ∈ V1. Since x is a limit point of X belonging to the open
set V1, there exists some point x2 ∈ X ∩ V1 − {x}. Again since X is Hausdorff,
NOTES
there exist two disjoint open sets G2* and V2* such that x2 ∈ G2*and x ∈ V2*. If
we let G2 = G2* ∩ V1 and V2 = V2* ∩ V1, then G2 and V2 are disjoint open sets
contained in V1 and hence disjoint from G1 containing x2 and x respectively.
We will now proceed by using an inductive argument. Since we have already
defined the points {xk} and the open sets {Gk} and {Vk} with the properties that xk
∈ Gk ⊆ Vk–1, x ∈ Vk ⊆ Vk–1 and Gk ∩ Vk = φ for all k ≤ n. Now x is a limit point
of X belonging to the open set Vn and so there exists some point xn+1 ∈ X ∩ Vn −
{x}. Since X is Hausdorff, there exist two disjoint open sets G*n+1 and V*n+1 such
that xn+1 ∈ G*n+1 and x ∈ V*n+1. If we let Gn+1 = G*n+1 ∩ Vn and Vn+1 = V*n+1 ∩
Vn, then Gn+1 and Vn+1 are two disjoint open sets contained in Vn ( and hence
disjoint from Gn) containing xn+1 and x respectively. Since the sets {Vn} are monotonic
decreasing, we see that Gn+1 is not only disjoint from Gn but is also disjoint from
Gk for k ≤ n. Since xn ∈ Gn, the infinite sequence < Gn > defined by induction is
the desired sequence of nonempty, disjoint open sets.
First Countable Space

A topological space X is called a first countable space if it satisfies the following
axiom, called the first axiom of countability:
For each point p ∈ X there exists a countable class Bp of open sets containing p
such that every open set G containing p also contains a member of Bp. In other
words, a topological space X is a first countable space if and only if there exists a
countable local base at every point p ∈ X.
A first countable, separable Hausdorff space (in particular, a separable metric
space) has at most the continuum cardinality c. In such a space, closure is
determined by limits of sequences and any sequence has at most one limit, so
there is a surjective map from the set of convergent sequences with values in the
countable dense subset to the points of X. A separable Hausdorff space has
cardinality at most 2c where c is the cardinality of the continuum. For this closure
is characterized in terms of limits of filter bases: if Y is a subset of X and z is a point
of X, then z is in the closure of Y if and only if there exists a filter base B consisting
of subsets of Y which converges to z. The cardinality of the set S(Y) of such filter
[Y ]
bases is at most 2 2 . Moreover, in a Hausdorff space, there is at most one limit
to every filter base. Therefore, there is a surjection S(Y) → X when Y = X . The
Self-Instructional
Material 217
Countability and same arguments establish a more general result: suppose that a Hausdorff
Separation Axioms
topological space X contains a dense subset of cardinality k. Then X has cardinality
at most 22k and cardinality at most 2k if it is first countable. The product of at most
continuum many separable spaces is a separable space. In particular the space RR
NOTES
of all functions from the real line to itself, endowed with the product topology, is a
separable Hausdorff space of cardinality 2c. More generally, if k is any infinite
cardinal, then a product of at most 2k spaces with dense subsets of size at most k
has itself a dense subset of size atmost k.
Example 1: Let X be a metric space. Let p ∈ X. The countable class of open
spheres {S(p, 1), S(p, 1/2), S(p, 1/3),...} with center at p is a local base at p. Thus
every metric space satisfies the first axiom of countability.
Example 2: Let X be any discrete space and let p ∈ X. A local base at point p is
the singleton set {p} — which is countable. Thus every discrete space satisfies the
first axiom of countability.
The first uncountable ordinal ω1 in its order topology is not separable.
The Banach space l∞ of all bounded real sequences, with the supremum norm, is
not separable.
Second Countable Space
A topological space X with topology τ is called a second countable space if it
satisfies the following axiom, called the second axiom of countability. There exists
a countable base B for the topology τ. For example, the class of open intervals (a,
b) with rational end points — i.e., a, b ∈ Q where Q is the set of rational numbers
— is countable and is a base for the usual topology on the real line R. Thus R
satisfies the second axiom of countability and is thus a second countable space.
Consider the real line R with the discrete topology D. Now the one and
only base for a discrete topology on a set X is that collection B of all the singleton
sets of X. We now note that R is non-countable and thus the class of singleton sets
{p} of R is non-countable. Thus the topological space R with the discrete topology
D does not satisfy second axiom of countability. By the same logic, the topological
space Q of rational numbers with the discrete topology D does satisfy second
axiom of countability.
If B is a countable base for a space X, and if Bp consists of the members of
B which contain the point p ∈ X, then Bp is a countable local base at p Any
second-countable space is separable: if {Un} is a countable basis, choosing any
xn ∈ Un gives a countable dense subset. Conversely, a metrizable space is separable
if and only if it is second countable if and only if it is Lindelöf.
An arbitrary subspace of a second countable space is second countable;
Self-Instructional
subspaces of separable spaces need not be separable.
218 Material
A product of at most continuum many separable spaces is separable. A Countability and
Separation Axioms
countable product of second countable spaces is second countable, but an
uncountable product of second countable spaces need not even be first countable.
Any continuous image of a separable space is separable, even a quotient of NOTES
a second countable space need not be second countable.
The property of separability does not in and of itself give any limitations on
the cardinality of a topological space: any set endowed with the trivial topology is
separable, as well as second countable, quasi-compact and connected. The ‘trouble’
with the trivial topology is its poor separation properties: its Kolmogorov quotient
is the one-point space.
Theorem 13: A function defined on a first countable space X is continuous at p ∈
X if and only if it is sequentially continuous at p.
In other words, if a topological space X satisfies the first axiom of countability,
then f: X→Y is continuous at p ∈ X if and only if for every sequence {an} in X
converging to p, the sequence {f(an)} in Y converges to f(p), i.e.,
an p ⇒ f (an ) → f ( p)
Theorem 14: A second countable space is also first countable.

Let S be a set. Let A be a subset of S. Then a collection C of subsets of S is
a cover of A if A is a subset of the union of the members of C, i.e.,
A ⊂  {c : c ∈ C}
If each member of C is an open subset of S, then C is called an open cover

of A. If C contains a countable subclass which also is a cover of A, then C is said
to be reducible to a countable cover of A.
Theorem 15: Let A be any subset of a second countable space X. Then every
open cover of A is reducible to a countable cover.
Theorem 16: Let X be a second countable space. Then every base B for X is
reducible to a countable base for X.
Lindelof space: A topological space X is called a Lindelof space if every open
cover of X is reducible to a countable cover.
Thus, every second countable space is a Lindelof space.
Let C={Aλ:λ∈Α} be a collection of sets of real numbers. We say that C is a cover
(or covering) of a set A of real numbers if each point of A belongs to Aλ for same
λ∈A, that is, if A ⊂  {Aλ:λ∈Α}. If C is a collection of open sets, then C is called
an open covering of A. Self-Instructional
Material 219
Countability and If C' is a cover of A such that C' ⊂ C, is called a subcover of A.
Separation Axioms
A set A is said to be compact if each open cover of A has a finite subcover.
Example 3: Let C ={]–n, n[:n∈N}
NOTES and C'={]–3n, 3n[:n∈N}.
Then C and C' are both open covers of R. Also C' is a subcover of C.
Theorem 17 (Lindelof): Let C be a collection of open sets of real numbers.
Then there exists a countable subcollection {G1} of C such that
∞
 {G:G∈C}=  Gi..
n=1
Proof: Let S=  {G:G ∈ C} and let x∈S. Then there is at least one G ∈ C such
that x∈G. Since G is open, there exists an open interval Ix with centre at x such
that Ix ⊂ G. Since every interval Ix contains infinitely many rational points we can
find an open interval J x with rational end points such that
x ∈ Jx ⊂ Ix. Since the collection {Jx}, x ∈ S, is countable, and
S =  {Jx:x ∈ S}.
For each interval in {Jx}, choose a set G in C which contains it. This gives
a countable subcollection
∞
{Gi }i =1
∞
= of C and S =  Gi
i =1
∞
Hence ∪{G : G ∈ C} = S =  Gi .
i =1
Theorem 18 (Lindelof covering theorem): Let A be a set of real numbers and

let C be an open cover of A. Then there exists a countable subcollection of C
which also covers A.
Proof: Since C is an open cover of A, we have
A⊂∪{G : G ∈ C}.
Now show that there exists a countable subcollection {Gi }i =1 of C such

∞
that
∞
∪{G : G ∈ C} = S =  Gi
i =1
∞
and so A =  Gi Hence the theorem.
Self-Instructional i =1
220 Material
The Heine-Borel covering theorem states that from any open covering of an Countability and
Separation Axioms
arbitrary set A of real numbers, we can extract a countable covering. The Heine-
Borel theorem tells us that if, in addition, we know that A is closed and bounded,
we can reduce the covering to a finite covering. The proof makes use of the
NOTES
nested interval theorem.
Theorem 19 (Heine-Borel): Let F be a closed and bounded set of real numbers.
Then each open covering of F has a finite subcovering. That is, if C is a collection
of open sets such that F ⊂ ∪{G : G ∈ C}, then there exists a finite subcollection
n
(G1 G2,...,Gn) of C such that F ⊂  Gi .
i =1
In other words, every closed and bounded set of real numbers is compact.
Proof: Since F is bounded, it is contained in some closed and bounded interval
[a, b]. Let C* be the collection obtained by adding F' (the complement of F) to
C; that is, C* = C ∪{F'}. Since F is closed, F' is open and so C' is a collection of
open sets. By hypothesis, F ⊂ ∪{G : G ∈ C}, and so
R = F∪F' ⊂ [∪{G : G ∈ C}] ∪ F' = ∪{G : G ∈ C*}
We now show that [a, b] is covered by a finite sub-collection of C. Suppose the
contrary to be true. Now if I0= [a, b] connot be covered by a finite subcollection
1 1
of C*, then one of the intervals [a, (a + b)], [ (a + b), b] cannot be so
2 2
covered. We rename such an interval as [a1, b2]. Similarly, one of the intervals
 1  1  cannot be covered by a finite subcollection
 a1 , 2 ( a1 + b1 )  ,  2 ( a1 + b1 ) , b1 
of C*. We designate such an interval as [a2, b2]. Continuing in this way, we obtain
a sequence of closed intervals
{In} = {[an, bn]} such that In ⊂ In+l
b–a
and =
I n bn –=
an → C as n → ∞ .
2n
∞
Hence by the nested interval theorem,  I n consists of a single point, say
n =1
x0. This point x0 must belong to one of the members, say G0 of C*.
Since G 0 is an open set and x 0 ∈ G 0, there exists ε > 0 such that ]
b−a
x0 – ε, x0+ ε [⊂ G0. Also we can choose k so large that < ε . Then
2k
I k ⊂]x0 – ε, x0 + ε[⊂ G0 and so Ik is covered by a single member of C*. But this
Self-Instructional
Material 221
Countability and contradicts the constructed property of the members of {In : n ∈ N}. Hence [a,
Separation Axioms
b] must be covered by a finite subcollection of C* and hence F must also be
covered by a finite subcollection of C*. If this finite subcollection does not contain
F', it is a subcollection of C and the conclusion of our theorem holds. If the
NOTES
subcollection contains F', denote it by {Gl G2...,Gn, F'}. Then F ⊂ F' ∪
G1∪G2∪...∪Gn. Since no point of F is contained in F', we have F ⊂ G1 ∪ G2
∪.....∪ Gn, and the collection {G1, G2,..., Gn} is a finite subcollection of C which
covers F.
This proves the theorem.
The converse of the preceding theorem is given in the next theorem.
Theorem 20: Compact subsets of R are closed and bounded.
Proof: Let A be any compact subset of R. If An=]–n, n[, then the collection
C = {An : n ∈ N} is evidently an open cover of R and so an open cover of A.
Since A is compact, there exist finitely many positive integers n1,n2...nk such that
{ }
the subcollection An1 , An2 ,...., Ank of C covers A. Let n0= max {n1, n2...,nk],
then evidently A ⊂ An0 =

] − n0 , n0[. This implies that A is bounded.
If we can show that no point of R – A can be a limit point of A, then A will

be closed. So let a ∈ R. Then a ∉ A. Consider the family of closed sets Fn= [a –
1 /n, a + 1] for each n ∈ N. Then C′ = {R – Fn : n ∈ N} is a collection of open
∞
sets. Also evidently  Fn = {a} . Since a ∉ A, we have,
n =1
A ⊂ [R – ∩{Fn : n ∈ N}] =
∪{R – Fn : n ∈ N ] [De Morgan law].
Thus A is covered by the collection C. Hence by compactness of A, there

exists finitely many positive integers m1; m2,...,ms such that every point of A is
contained in one of the open sets R – Fm , R – Fm ,....., R – Fm . Hence if x ∈ A,
1 2 s
then for some i ∈{1, 2, 3,...,s}, x ∈ R – Fm ,which implies that no point of A is

i
contained in Fmi – [a – 1/mi, a + 1/mi]. This implies that a is not a limit point of A.
Hence A is closed.
A Characterization of Compact Sets on R
Theorem 21: A subset of R is compact if and only if it is closed and bounded.
Self-Instructional
222 Material
Theorem 22: R is not compact. Countability and
Separation Axioms
Proof: Let An=] – n, n[. Then clearly C = {An : n ∈ N} is an open cover of R. If
{A n1 , }
An2 ,...., Ank be any finite subfamily of C, let n0= max {n1, n2,...,nk}. Then
NOTES
n0 ∉ Ani , for any i = l, 2,...,k.
It follows that no finite subfamily of C can cover R. Hence R is not compact.

Theorem 23: Show that open intervals on 1 are not compact.
Proof: Let I = ]a, b[ be any open interval on R.
If An= ]a + 1/ n, b[ , then evidently the collection C = {An : n ∈ N} is an open

∞
cover of ]a, b[ since  An =]a, b[ . But it is not possible to find a finite subcollection
n =1
{ }
of C which covers A. For, if C' = An1 , An2 ,...., Ank be any finite subcollection of
C, let n0 = max {n1 n2 ,....., nk } . Then it is evident that the subset ]a, a + 1/n0] of
A is not covered by C'. Thus we have shown that there exists an open cover of A
which does not admit of a finite subcover. Hence ]a, b[ is not compact.
A topological space is called separable if it contains a countable dense subset;
that is, there exists a sequence { xn }n =1 of elements of the space such that every
∞
nonempty open subset of the space contains at least one element of the sequence.
In particular, every continuous function on a separable space whose image is a
subset of a Hausdorff space is determined by its values on the countable dense
subset.
In general, separability is a technical hypothesis on a space which is quite
useful and among the classes of spaces studied in geometry and classical analysis
generally considered to be quite mild. It is important to compare separability with
the related notion of second countability, which is in general stronger but equivalent
on the class of metrizable spaces. Let us consider some examples of separable
space.
• Every compact metric space (or metrizable space) is separable.
• Any topological space which is the union of a countable number of separable
subspaces is separable. Together, these first two examples give a different
proof that n-dimensional Euclidean space is separable.
Self-Instructional
Material 223
Countability and • The space of all continuous functions from a compact subset of Rn into R is
Separation Axioms
separable.
• It follows easily from the Weierstrass approximation theorem that the set
NOTES Q[t] of polynomials with rational coefficients is a countable dense subset of
the space C([0,1]) of continuous functions on the unit interval [0, 1] with
the metric of uniform convergence. The Banach-Mazur theorem asserts
that any separable Banch space is isometrically isomorphic to a closed
linear subspace of C([0, 1]).
• The Lebesuge spaces Lp are separable for any 1 < p < ∞.
• A Hilbert space is separable if and only if it has countable orthonormal
basis; it follows that any separable, infinite-dimensional Hilbert space is
isometric to  2 .
• An example of a separable space that is not second-countable is Rllt,the
set of real numbers equipped with the lower limit topology.
• A topological space X is separable if and only if there exists a finite or
denumerable subset A of X such that the closure of A is the entire space i.e.,
A = X.
• The real line R with the usual topology is separable since the set Q of rational
numbers is denumerable and is dense in R, i.e., Q = R .
• Every second countable space is separable but not every separable space
is second countable. For example, the real line R with the topology generated
by the closed-open intervals [a, b) is a classic example of a separable space
which does not satisfy the second axiom of countability.
Check Your Progress

3. Define the principle of extension of identities.
4. What do you understand by a convergent sequence?
5. What is meant by the Lindel of covering theorem?
6. What is a separable topological space?

QUESTIONS
1. A topological space X is said to satisfy the First Axiom of Countability if,

for every x ∈ X there exists a countable collection � of neighbourhoods of
x, such that if N is any neighbourhood of x, then there exists U ∈ � with
Self-Instructional
U ⊆ N.
224 Material
2. A topological space that satisfies the first axiom of countability is said to be Countability and
Separation Axioms
First Countable.
3. Let f, g be two continuous mappings of a topological space X into a
Hausdorff space Y. If f ( x) = g ( x) at all points of a dense subset of X, then NOTES
f = g.
4. A sequence will be called convergent if and only if there is at least one point
to which it converges. Every subsequence of a convergent sequence is also
convergent and has the same limits.
5. Let A be a set of real numbers and let C be an open cover of A. Then there
exists a countable subcollection of C which also covers A.
6. A topological space is called separable if it contains a countable dense
subset; that is, there exists a sequence { xn }n =1 of elements of the space
∞
such that every nonempty open subset of the space contains at least one
element of the sequence.
12.5 SUMMARY
• The separation axioms Ti specify the degree to which distinct points or

closed sets may be separated by open sets.
• Let (X, T ) be a topological space. Then the following statements are
equivalent:
ο (T2 axiom). Any two distinct points of X have disjoint neighbourhoods.
ο The intersection of the closed neighborhoods of any point of X consists

of that point alone.
ο The diagonal of the product space X × X is a closed set.
ο For every set I, the diagonal of the product space Y + XI is close in Y.
ο No filter on X has more than one limit point.
ο If a filter  on X converges to x, then x is the only cluster point of .
• Let f, g be two continuous mappings of a topological space X into a
Hausdorff space Y; then the set of all x ∈X such that f ( x) = g ( x) is closed
in X.
• If f is a continuous mapping of a topological space X into a Hausdorff space
Y, then the growth of f is closed in X × Y.
• If every point of a topological space X has a closed neighbourhood, which
is a Hausdorff subspace of X, then X is Hausdorff.
Self-Instructional
Material 225
Countability and • The convergence of a sequence and its limits are not affected by a finite
Separation Axioms
number of alternations in the sequence, including the adding or removing of
a finite number of terms of the sequence.
NOTES • In a Hausdorff space, a convergent sequence has a unique limit.
• If <xn> is a sequence of distinct points of a subset E of a topological space
X which converges to a point x ∈ X then x is a limit point of the set E.
• If f is a continuous mapping of the topological space X into the topological
space X*, and <xn> is a sequence of points of X, which converges to the
point x ∈ X, then the sequence <f(xn)> converges to the point f(x) ∈ X*.
• An infinite Hausdorff space X contains an infinite sequence of non-empty
disjoint open sets.
• A function defined on a first countable space X is continuous at p ∈ X if and
only if it is sequentially continuous at p.
• A second countable space is also first countable.
• Let A be any subset of a second countable space X. Then every open
cover of A is reducible to a countable cover.
• Let X be a second countable space. Then every base B for X is reducible
to a countable base for X.
12.6 KEY WORDS
• Separation axioms: Separation axioms specify the degree to which distinct

points or closed sets may be separated by open sets.
• Hausdorff space: It is a topological space in which each pair of distinct
points can be separated by a disjoint open set.
• First countable space: A topological space X is called a first countable
space if it satisfies the first axiom of countability.
• Lindelof space: A topological space X is called a Lindelof space if every
open cover of X is reducible to a countable cover.

AND EXERCISES

1. Write a short note on the axioms of countability.
2. Discuss convergence to T0 space.
Self-Instructional
226 Material
3. Describe Lindelof covering theorem. Countability and
Separation Axioms
4. What do you understand by characterisation of compact sets on R?
NOTES
1. Give a detailed account of the separation axioms.
2. Describe first and second countable spaces.
3. Explain separable spaces and separability.
India.
Ltd.
Sons, Inc.
Self-Instructional
Material 227
Normal Spaces
UNIT 13 NORMAL SPACES

NOTES Structure
13.0 Introduction
13.1 Objectives
13.2 Normal Spaces
13.3 The Urysohn’s Lemma
13.4 Tietze Extension Theorem
T1
13.4.2 Completely Regular Space and 3 Space
2

13.6 Summary
13.7 Key Words
13.0 INTRODUCTION
A topological space X is a normal space if, given any disjoint closed sets E and F,

there are neighbourhoods U of E and V of F that are also disjoint.This condition
says that E and F can be separated by neighbourhoods. Urysohn’s lemma states
that a topological space is normal if and only if any two disjoint closed subsets can
be separated by a continuous function. Urysohn’s lemma is commonly used to
construct continuous functions with various properties on normal spaces. It is
widely applicable since all metric spaces and all compact Hausdorff spaces are
normal. The lemma is generalized by (and usually used in the proof of) the Tietze
extension theorem. The lemma is named after the mathematician Pavel Samuilovich
Urysohn. In this unit, you will learn about normal spaces. A regular space is a
topological space in which every neighbourhood of a point contains a closed
neighbourhood of the same point. You will discuss the Urysohn’s lemma and Tietze
extension theorem. You will understand complete regularity and normality.
13.1 OBJECTIVES

• Understand normal spaces
• Discuss the Urysohn’s lemma
• Describe Tietze extension theorem
• Interpret the Urysohn’s lemma and Tietze extension theorem
• Learn complete regularity and normality
Self-Instructional
228 Material
Normal Spaces
13.2 NORMAL SPACES
A topological space X is a regular space if, given any nonempty closed set F and
any point x, such that x ∉ F, there exists a neighbourhood U of x and a NOTES
neighbourhood V of F that are disjoint or we can say that it must be possible to
separate x and F with disjoint neighbourhoods.
If a topological space is both regular and a Hausdorff space then it is said to
be a T3 space or regular Hausdorff space. A Hausdorff space or T2 space is a
topological space in which any two distinct points are separated by neighbourhoods.
Also, a space is T3 iff it is both regular and T0. A T0 or Kolmogorov space is a
topological space, wherein any two distinct points are topologically distinguishable,
i.e., for every pair of distinct points, at least one of them has an open neighborhood
not containing the other. In fact, if a space is Hausdorff then it is T0 and each T0
regular space is Hausdorff, since given two distinct points, at least one of them
misses the closure of the other one. So by regularity there exist disjoint
neighbourhoods separating one point from the closure of the other.
A topological space is said to be topologically regular if every point has an
open neighbourhood that is regular. Clearly, every regular space is locally regular,
but the converse is not true.
Normal Spaces
A topological space X is said to be a normal space if, given any disjoint closed
sets E and F, there are open neighbourhoods U of E and V of F that are also
disjoint. This condition implies that E and F can be separated by neighbourhoods.
U V
E F
The closed sets E and F, represented in the Figure by closed disks on

opposite sides of the picture, are separated by their respective neighbourhoods U
and V, represented by larger, but still disjoint open disks.
A T4 space is a normal T1 space X. This is equivalent to X being Hausdorff
and normal. A completely normal space or a hereditarily normal space is a
topological space X in which every subspace of X with subspace topology is a
normal space. It turns out that X is completely normal if and only if every two
Self-Instructional
Material 229
Normal Spaces separated sets can be separated by neighbourhoods. A completely T4 space or
T5 space is a completely normal Hausdorff topological space X, or every subspace
of X must be a T4 space.
NOTES A perfectly normal space is a topological space X in which every two
disjoint non-empty closed sets E and F can be precisely separated by a continuous
function f from X to the real line R. The preimages of {0} and {1} under f are,
respectively, E and F. In this definition, the real line can be replaced with the unit
interval [0, 1].
A locally normal space is a topological space where every point has an
open neighbourhood that is normal. Every normal space is locally normal, but the
converse is not true.
Check Your Progress

1. Define a regular space.
2. What is a normal space?
3. What is a complete normal space?
4. What do you mean by a perfectly normal space?
13.3 THE URYSOHN’S LEMMA
Theorem 1 (Urysohn’s Lemma): Let X be a topological space and let any two
disjoint closed sets A, B in X can be separated by open neighbourhoods. Then
there is a continuous function f : X → [0, 1] such that f | A ≡ 1 and
f | B ≡ 0.
Proof: Here, define f as the pointwise limit of a sequence of functions. Any
collection of sets r = (A0, A1,…, Ar) is an admissible chain if A = A0 ⊂ A1 ⊂, ....,
0 0
⊂ Ar ⊂ X \B and A k −1 ⊂ A k
,0 ≤ k ≤ r . The set A k +1
\ A k −1 is the kth step domain
of Ur , where Ar+1 = X and A–1 = φ.
Fig. 3.1 An Admissible Chain

Self-Instructional
230 Material
Each pair of adjacent shaded regions represents a step domain. We will Normal Spaces
prove this theorem with the help of a series of lemmas.

Lemma 1: Each x∈ X lies in some step domain for any Ur.
Proof: Take x ∈ X and any admissible chain Ur. Let k, 0 ≤ k ≤ r +1, be the NOTES
0 0
smallest number such that x ∈ A . Then x ∈ A k \ A k − 2 .
k
Lemma 2: Each step domain is open.
( )
0 0
Proof: Since A k +1
\ A k −1 = A k +1  X \ A k −1 is the finite intersection of open sets,
hence it is open. For any Ur, define the uniform step function fr: X → [0, 1] as,
fr|A ≡ 1, fr|(X \Ar) ≡ 0 and fr|(Ak\Ak–1) ≡ 1−k/r, 1 ≤ k ≤ r
Lemma 3: If x and y are in the same step domain, then |fr(x) − fr(y)| ≤ 1/r.
0 0
Proof: Let x, y ∈ A k +1
\ A k −1 . If both x and y are in A k +1
or Ak, then by definition
0
of fr, fr(x) = fr(y). Hence | fr(x) − fr(y)|= 0. If x ∈ A k +1
and y ∈ Ak, then fr(x) =
1− (k+1)/r and fr(y) = 1 − k/r. So |fr(x) − fr(y)| = 1/r.
The above three lemmas will be used in the last step of the proof.
Now, let the admissible chain 2r–1=(A0, A′1, …, A′r, Ar) be a refinement of
the admissible chain r =(A0, A1, …, Ar).
We can say that, the refinement 2r–1 of the admissible chain r contains
every set in r, and for every i ≥ 1 contains a set A′i such that Ai −1 ⊂ Α′i ⊂ Ai.
Naturally, refinements place new sets between each pair of sets in the original
admissible chain.
Lemma 4: Every admissible chain has a refinement.
0
Proof: It is sufficient to show that for any subsets M, N of X, with M ⊂ N , there
0 0
0
 0

exists L ⊂ X with M ⊂ L ⊂ L ⊂ N . Now since M ⊂ N , M   X \ N = φ 
 
0
and since (X \ N ) is the complement of an open set and therefore closed, there
0
exist disjoint open sets U, V, with M ⊂ U and (X \ N ) ⊂ V. Again since U and
V are disjoint, U ⊂ (X \V). Also because (X \V) is closed and U is contained in
0
every closed set containing U, so U ⊂ (X \V). Moreover, (X \ N ) ⊂ V means (X
Self-Instructional
Material 231
Normal Spaces
0 0 0
\V) ⊂ N . Putting all this collectively gives, M ⊂ U ⊂ U ⊂ ( X \ V ) ⊂ N . Let
L = U and the proof is complete.
NOTES Lemma 5: Let r be an admissible chain with r + 1 elements and s be a
refinement with 2r+1 elements. Then |fr(x) − fs(x)| ≤ 1/(2r).
Proof: Suppose x ∈ Ak\Ak–1, where Ak, Ak–1 ∈ Ur. Then, fr(x) = 1 − k/r. Also, s
= (A0, A′1, A1, …, A′j, Aj, …, A′k, Ak) = ( A0 , A1' , A2' ,...., A(2 k −1)' , A2 k , A( 2 r −1)' , A2 r ' ).
Now, x is either in Ak\A′k = A2k\A(2k – 1) or in A′k\Ak−1 = A(2k – 1). Therefore either,
fs(x) = 1 − (2k)/(2r) = fr(x) or, fs(x) = 1−(2k−1)/(2r) = fr(x) + 1/(2r). Either
way we get the desired result.
Now we will define the sequence. Let 0 = (Α, X \B) and let n+1 be a
refinement of n.
By Lemma 4, every admissible chain has a refinement. So we get a sequence
of admissible chains. Let fn be the uniform step function on the nth admissible
chain.
Lemma 6: The sequence {fn(x)} converges for each x ∈ X.
Proof: From the definition of the uniform step functions, the sequence is bounded
above by 1. Now it remains to prove that the sequence is non-decreasing. Note
first that 0 contains one term excluding A itself and therefore by definition of
refinement, 1 will contain 2 terms excluding A.
Applying induction,  n contains 2n terms excluding A. Notice that for x ∉
Aj\Aj–1 ∀ Aj, Aj–1 ∈ r, fk(x) is either 0 or 1, i.e., constant and constant sequences
converge. Suppose x ∈ Aj\Aj–1, where Aj, Aj–1∈ Ur. Then fk(x) = 1−j/k.
Furthermore,  k +1 = (A 0 , A′ 1 , A 1 , …, A′ j, A j ,…, A′ k , A k ) =
( A0 , A1' , A2' ,...., A(2 j −1) , A2 j ,....., A(2 k −1)' , A2 k ' ) and x is either in A j \
A' j = A2 j \ A(2 j −1)' or in A′j\Aj–1 = A(2 j −1)' \ A( 2 j − 2 )' . This implies,
fk+1(x) = 1−(2j)\(2k) = fk(x)

or
fk+1 = 1−(2j−1)\(2k) ≥ fk(x)
This proves that the sequence is nondecreasing and hence convergent,
because bounded monotonic sequences converge.
For each x, let f(x) = limn→∞ fn(x). Because each fn is constantly 1 on A and
0 on B, f will also have this property. For proving that f is continuous, it is sufficient
to show that if we take any f(x) ∈ [0, 1] and any open set (a, b) ⊂ [0, 1] containing
Self-Instructional
232 Material
f(x), then there is an open set U ⊂ X such that x ∈ U and f(U) ⊂ (f(x) − ε, f(x) Normal Spaces
+ ε). To prove this, we have to show one more lemma.

Lemma 7: For fixed x and any n,|f(x) − fn(x)| ≤ 1/2n.
NOTES
Proof: |f(x) − fn(x)| = | lim kk → ∞ f k ( x ) − f n (x ) |
≥n
= | lim k →∞ ( f k ( x ) − f n ( x )) | = lim k →∞ | ( f k ( x ) − f k −1 ( x )) +
k ≥n k ≥n
+ ( f k −1 ( x ) − f k −2 ( x )) + ( f n+1 ( x ) − f n ( x )) |
≤ lim k →∞ (| f k ( x ) − f k −1 ( x ) | + | f k −1 ( x ) − f k −2 ( x ) | +.....+ | f n+1 ( x ) − f n ( x ) |)

k ≥n
(
≤ lim k →∞ 1 / 2 k + 1 / 2 k −1 + .... + 1 / 2 n +1 )
k ≥n
(∑ )
∞
∑1 / 2 k ∞
= = 1/ 2 n k −1
1/ 2k = 1/ 2n
k = n +1
Take n large enough so that 3/2n < ε, and suppose x lies in the kth step domain,
0
Sk = A k +1
\ A k −1 (Since by Lemma 1, every x lies in some step function).
Furthermore, by Lemma 2, this step domain is an open neighbourhood of

x. Take any y ∈ Sk. Then by Lemmas 3 and 6,
| f (x ) − f ( y ) |
=| f ( x ) − f n ( x ) + f n ( x ) − f n ( y ) + f n ( y ) − f ( y ) |
≤ | f (x ) − f n ( x ) | + | f n (x ) − f n ( y ) | + | f n ( y ) − f ( y ) |
≤ 1 / 2 n + 1 / 2 n + 1 / 2 n = 3 / 2 n < ε . So every y ∈ Sk maps into (a, b), which
proves that f is continuous.
13.4 TIETZE EXTENSION THEOREM
Before going to main theorem, Lemma 8 is considered.

Lemma 8: If X is a normal topological space and A is closed in X, then for any
continuous function f: A → R such that |f(x) < 1, there is a continuous function g:
Self-Instructional
Material 233
Normal Spaces
1 2
X → R such that |g(x)| < for x ∈ X, and |f(x) – g(x)| ≤
3 3
for X ∈ A.
NOTES
 1   1  
Proof: The sets f −1   – ∞ –   and f −1   , ∞   are disjoint and closed in
 3   3 
A. Since A is closed, they are also closed in X. Since X is normal, then by Urysohn’s
 1 1
lemma and the fact that [0, 1] is homomorphic to  – ,  , there is a continuous
 3 3
 1 1  –1  1  1
function g: X →  – ,  such that g  f  −∞, − c   = − and
 3 3   3  3
 1   1 1
g  f –1  , ∞   =. Thus | g ( X ) |≤ for x ∈ X. Now, if – ∞ ≤ f(X) ≤ − 1 ,
  3  3 3 3
1 2 1
then |g(x)| ≤ − and thus f ( x) – g ( x) ≤ . Similarly if ≤ f ( x) ≤ 1, then g(x)
3 3 3
1 2 1 1
= and thus f ( x) – g ( x) ≤ . Finally, for |f(x)| ≤ we have that |g(x)| ≤ ,
3 3 3 3
2 2
and so f ( x) – g ( x) ≤ . Hence f ( x) – g ( x) ≤ holds for all x ∈ A.
3 3
Theorem 2: First suppose that for any continuous function on a closed subset
there is a continuous extension. Let C and d be disjoint and closed in X. Define f:
C ∪ D → R by f(x) = 0 for x ∈ C and f(x) = 1 for x ∈ D. Now f is continuous
and we can extend it to a continuous function F: X → R. By Urysohn’s lemma, x
is normal because F is continuous function such that F(x) = 0 for x ∈ C and F(x)
= 1 for x ∈ D.
Conversely, let X be normal and A be closed in X. By the Lemma 8,
1
there is a continuous function g0: X → R such that g 0 ( x ) ≤ for x ∈ X
3
1
and f ( x ) – g 0 ( x ) ≤
for x ∈ A. Since (f – g0): A → R is continuous, the
3
lemma tells us that there is a continuous function g1: X → R such that
1 2 22
g1 ( x ) ≤   for x ∈ X and f ( x) – g 0 ( x) – g1 ( x) ≤   for x ∈ A.
Self-Instructional 3 3 33
234 Material
By repeated application of the lemma we can constuct a sequence of continuous Normal Spaces
n
1 2
function g0 , g1 , g 2 ,..... , such that g n ( x) ≤   for all x ∈ X, and
3 3
NOTES
n
2
f ( x) − g 0 ( x) − g1 ( x) − g 2 ( x) – ...... ≤   for x ∈ A.
3
n ∞ n
1 2 1 2
Define F ( x) = ∑ n=0 g n ( x) . Since g n ( x) ≤   and
∞
3 3
∑ 3  3 
n=0
∞
converges as a geometric series, then ∑ gn ( x ) converges absolutely and
n =0
∞ n
1 2
uniformly, so F is a continuous function defined everywhere. Moreover, ∑ 3  3  =
n =0  
1, implies that |F(x)| ≤ 1.
k +1
2
Now, for x ∈ A, we have that f ( x)∑ n =0 g n ( x) ≤  
k
and as k goes
3
to infinity, the right side goes to zero and so the sum goes to F(x). Thus |f(x) –
F(x)| = 0 Therefore f extends F.
Notes: If f was a function satisfying |f(x)| < 1, then the theorem can be
strengthended. Find an extension F of f. The set B F–1 ({–1} ∪ {1}) is closed and
disjoint from A because |F(x)| = |f(x)| < 1 for x ∈ A. By Urysohn’s lemma there is
a continuous function f such that φ(A) = {1} and φ(B) = {0}. Hence φ(x)φ(x) is
a continuous extension of φ(x) and has the property that |F(x)f(x)| < 1.
If f is unbounded, then Tietze extension theorem holds as well. To see that
consider t(x) = tan–1(x)/(n/2). The function t . f has the property that (t . f) (x) <
for x ∈ a, and so it can be extended to a continuous function h: X → R which has
the property |h(x)| < 1. Hence t–1 . h is a continuous extension of f.
Completely Normal Spaces

Tietze introduced completely normal spaces in 1923.
Definition: A topological space (X, T) is called completely normal if and only if it
satisfies the statement given as: if A and B are two separated subsets of X, then
there exist two disjoint open sets G and H such that A ⊂ G and B ⊂ H.
Self-Instructional
Material 235
Normal Spaces Definition: A T5 space is a completely normal T1 space.
Theorem 3: Every completely normal space is normal and consequently every
T5 space is a T4 space.
NOTES Proof: Suppose (X, T) is a completely normal space and A and B are two closed
subsets of X such that A ∩ B = φ. Now, as A and B are closed, we have
C(A) = A, C(B) = B ⇒C(A) ∩ B = φ, A ∩ C(B) = φ
Hence A and B are separated subsets of X. Now, by complete normality,
there exist open sets G and H such that A ⊂ G, B ⊂ H and G ∩ H = φ. This
implies that (X, T) is normal. We know that, a T5 space is T1 also. Therefore T5 is
both normal as well as T1. Hence every T5 space is T4.
Theorem 4: Complete normality is a topological property.
Proof: Consider a completely normal space (X, T) and let (Y, T*) be its
homeomorphic image under a homeomorphism f. We have to prove that
(Y, T*) is completely normal. Let A and B be any two separated subsets of Y such
that,
A∩C(B) = φ, B∩C(A) = φ
Now, as f is continuous mapping, therefore
C[f –1(A)] ⊂ f –1[C(A)] and C[f –1(B)] ⊂ f –1[C(B)]
Hence, f –1(A) ∩ C[f –1 (B)] ⊂ f –1(A) ∩f –1[C(B)]
=f –1[A ∩ C(B)] = f –1(φ) = φ
And
C[f –1(A)] ∩ f –1 (B) ⊂ f –1[C(A)] ∩ f –1(B)
=f –1[C(A) ∩ B] = f –1(φ) = φ
Thus f –1(A) and f –1(B) are two separated subsets of X. Since (X, T) is
completely normal, there exist T-open sets G and H such that,
f –1(A) ⊂ G, f –1(B) ⊂ H and G∩H = φ
So, we get that
A = f [f –1(A)] ⊂ f (G)
B = f [f –1(B)] ⊂ f (H) (Because of ontoness)
And f (G) ∩ f (H)=f (G∩H) = f (φ) = φ (Because f is 1–1)
Also, since f is a open map, f (G) and f (H) are T* open sets. Thus we have
shown that for any two separated subsets A, B of Y, there exist T* open subsets
G1 = f (G) and H1 = f (H)
such that A ⊂ G1, B ⊂ H1 and G1 ∩ H1= φ.
Self-Instructional
236 Material
Hence the theorem is proved. Normal Spaces
Corollary: The property of a space being T5 space is a topological property.

Proof: A T5 space is a completely normal T1 space. Since the properties of a
space being a T1 space and of being a completely normal space, both are NOTES
topological, therefore the property of a space being a T5 space is also topological.
Theorem 5: Complete normality is a hereditary property.
Proof: Suppose that (X, T) is a completely normal space and (Y, T*) is any
subspace of (X, T). We will be proving that (Y, T*) is also completely normal. Let
A, B be T* separated subsets of (Y, T*). We have,
A∩C*(B) = φ and B∩C*(A) = φ
Also C*(A) = C(A) ∩ Y and C*(B) = C(B) ∩ Y
Therefore,
φ = A ∩ C*(B) = A ∩ [C(B) ∩ Y] = (A∩C(B)) ∩ Y
=A∩C(B)
In the same way,
φ = B ∩ C*(A) = B∩ [C(A) ∩Y] = (B∩C(A)) ∩ Y
=B ∩ C(A)
So A and B are T separated. Hence by complete normality of X, there exist
T-open sets G and H such that,
A ⊂ G, B ⊂ H and G∩H = φ
Since A and B are subsets of Y,
A ⊂ G∩Y, B ⊂ H∩Y
And (G∩Y) ∩ (H∩Y) = (G∩H) ∩ Y = φ ∩ Y = φ
Hence we can say that (Y, T*) is completely normal.
Corollary: The property of a space being T5 space is a hereditary property.
Proof: Again, the property of a space being T1 as well as being completely normal
is hereditary. Therefore, we can conclude that the property of a space being T5 is
hereditary.
Theorem 6: A topological space X is completely normal if and only if every
subspace of X is normal.
Proof: Consider a completely normal space (X, T) and let (Y < T*) be any
subspace of (X, T). We will show that (Y, T*) is normal. Let F1 and F2 be any pair
of T* closed subsets of Y such that F1∩F2 = φ. We will denote the T* closure of
F1 and F2 by C*(F1) and C*(F2) and their T closure by C(F1) and C(F2),
respectively. Self-Instructional
Material 237
Normal Spaces As F1 and F2 are T* closed,
C*(F1) = F1 and C*(F2) = F2
Also, C*(F1) = Y ∩ C(F1), C*(F2) = Y ∩ C(F2)
NOTES Therefore, F1 ∩ C(F2) = C*(F1) ∩ C(F2)
= (Y∩C(F1)) ∩ C(F2)
= (Y∩C(F1)) ∩ (Y∩C(F2))
= C*(F1) ∩ C*(F2)
= F1∩F2 = φ
In the same way, F2 ∩ C(F1) = φ.
We can now conclude that F1 and F2 are two separated subsets of X.
From the definition of complete normality, there exist T open sets G and H such
that F1 ⊂ G, F2 ⊂ H and G∩H = φ. Then the sets G1 = Y∩G and H1 = Y∩H are
T* open sets such that,
F1 ⊂ G1, F2 ⊂ H1 and
G1 ∩ H1 = (Y ∩ G) ∩ (Y ∩ H)
= Y ∩ (G∩H) = Y ∩ φ = φ
This implies that (Y, T*) is normal.
Conversely suppose that (Y, T*) is normal. Consider two separated subsets
A and B of X.
Let Y = X – (C(A) ∩ C(B)). Then Y is T open subset of X.
The sets Y∩C(A) and Y∩C(B) are T* closed such that,
(Y∩C(A)) ∩ (Y∩C(B)) = Y∩ (C(A) ∩ C(B))
= [X–(C(A) ∩ C(B))] ∩ [C(A) ∩ C(B)]
=φ
Therefore by the normality of Y, there exist T* open subsets G, H of Y such
that
Y∩C(A) ⊂ G, Y∩C(B) ⊂ H …(1)
And G∩H = φ
Again, since G and H are T* open sets, there exist T* open subsets G1, H1
of Y such that,
G=Y∩G1, H = Y∩H1
And since Y is T-open, we conclude that G and H are also T-open sets.
Additionally, since
Self-Instructional
238 Material
Y = X–[C(A) ∩ C(B)] Normal Spaces
Also, A and B are separated sets of X since

Y = X–[C(A) ∩ C(B)]
= [X–C(A)] ∪ [X–C(B)] NOTES
But, X–C(A) ⊃ B and X–C(B) ⊃ A

B ⊂ Y and A ⊂ Y
Hence it follows from Equation (1) that A ⊂ G, B ⊂ H and G∩H = φ
...(2)
Also A and B are separated since B ⊂ X–C(A).
Thus we have proved that for any pair A, B of separated subsets of X, there
exist T open subsets G and H which satisfy Equation (2). Therefore (X, T) is
completely normal.
Note: Every completely normal space is normal but the converse may not be true. For example,
consider
X = {a, b, c, d}
T = {φ, (a), (a, c), (a, b, c), X}
Here (X, T) is normal since φ and X are the only disjoint closed subsets of
X. But the subspace Y = {a, b, c} of X is not normal. If T* is a relative topology
in Y, then
T* = {φ, {a}, {a, b}, {a, c}, Y}.
Here {b} and {c} are disjoint T* closed subsets of Y but there are no
disjoint open sets G and H such that {b} ⊂ G and {c} ⊂ H. Therefore the subspace
(Y, T*) is not normal. So we conclude that the space (X < T) is not completely
normal
13.4.2 Completely Regular Space and T3 12 Space
Definition: A topological space (X, T) is said to be completely regular iff it satisfies

the axiom given as:
If F is a closed subset of X and x is a point of X not in F, then there exists a
continuous map f : X → [0, 1] such that f (x) = 0 and f (x) = 1.
Definition: A completely regular T1 space is known as a Tichonov space or T3 12

space.
Theorem 7: Every completely regular space is regular and consequently every
Tichonov space is a T3 space.
Self-Instructional
Material 239
Normal Spaces Proof: Consider (X, T) to be a completely regular space. Let F be a closed
subset of X and let x be point of x not in F, i.e., x ∈ X–F. From the property of
complete regularity, there exists a continuous map f : X → [0, 1] such that
f (X) = 0 and f (F) = {1}. Also [0, 1] with usual topology is a Hausdorff space.
NOTES
Therefore there exist open sets G and H of [0, 1] such that,
0 ∈ G, 1 ∈ H and G∩H = φ.
Since f is continuous, f –1(G) and f –1(H) are T-open subsets of X such that
f –1(G) ∩ f –1(H) = f –1[G∩H] = f –1[φ] = φ
Additionally,
f(x) = 0 ∈ G implies x ∈ f –1(G)
and f(F) = {1} ∈ H implies F ⊂ f –1(H).
Thus there exist disjoint T-open sets f –1(G) and f –1(H) that contain x and
F, respectively. We infer that (X, T) is regular. Moreover since every Tychonov
space is both a completely regular and T1 space, we get that every Tychonov
space is a T3 space.
Theorem 8: Every T4 space is a Tychonov space.
Proof: Consider (X, T) to be a T4 space. Then we can say that it is normal and T1
space. Hence we now only have to show that (X, T) is completely regular. Let F
be a T closed subset of X and let x be a point of X such that x ∉ F. Since the
space is T1, {x} is a closed subset of X. Thus {x} and F are closed subsets of X.
Again since the space is normal, by Urysohn’s lemma, there exists a continuous
mapping f : X → [0, 1] such that
f [(x)] = {0} and f (F) = {1}
i.e., f (x) = 0 and f (F) = 1.
Corollary: Every compact Hausdorff space is a Tychonov space.
Proof: As every compact Hausdorff space is a normal space, hence it is also
Tychonov space.
Theorem 9: Complete regularity is a topological property.
Proof: Let (X, T) be a completely regular space and let (Y, V) be a homeomorphic
image of (X, T) under a homeomorphism f. To show that (Y, V) is completely
regular, let F be a V-closed subset of Y and let y be a point of Y such that y ∉ F.
Since f is one-one onto, there exists a point x ∈ X such that f(x) = y ⇔ x = f –1(Y).
Again since f is a continuous map, f –1(F) is a T-closed subset of X. Further y ∉ F
⇒ f –1(y) ∉ f –1(F) ⇒ x ∉ f –1(F). Thus f –1(F) is a T-closed subset of X and x =
f –1(y) is a point of X such that x ∉ f –1(F). Hence by complete regularity of X there
exists a continuous mapping g of X into [0, 1] such that
Self-Instructional
240 Material
g[f –1(y)] = g(x) = 0 and g[f –1(F)] = {1} Normal Spaces
i.e., (gοf –1)(y) = 0 and (gοf –1)(F) = {1}

Since f is homeomorphism, f –1 is a continuous mapping of Y onto X. Also
g is a continuous map of X into [0, 1]. It follows that gοf –1is a continuous map of NOTES
Y into [0, 1]. Here we have shown that for each V-closed subset F of Y and each
point y ∈ Y–F, there exists a continuous map h = gοf –1 of Y into [0, 1] such that
h(y) = 0 and h(F) = {1}. Hence we infer that (Y, V) is completely regular.
Theorem 10: Complete regularity is hereditary property.
Proof: Consider (X, T) to be a completely regular space and let (Y, T*) be a
subspace of X. Let F* be a closed subset of Y and y be a point of Y such that y ∉
F*. Since F* is T* closed, there exists a T-closed subset F of X such that F* =
Y∩F. Also,
y ∉ F* ⇒ y ∉ Y∩F
⇒y∉F [Since y ∈ Y]
And,
y∈Y⇒y∈X
This is a T-closed subset of X and y is a point of X such that y ∉ F. So by
the property of complete regularity of X, there exists a continuous map f of X into
[0, 1] such that
f(y) = 0 and f(F) = {1}
Let g denote the restriction of f to Y. Then g is continuous mapping of Y into
[0, 1]. Now by definition of g,
g(x) = f(x) ∀ x ∈Y
Hence
f(y) = 0, g(y) = 0
and since f(x) = 1 ∀ x ∈ F and F* ⊂ F, we have
g(x) = f(x) = 1∀x ∈ F*
so that g(F*) = {1}.
Here we have proved that for each T* closed subset F* of Y and each
point y ∈ Y–F*, there exists a continuous map g of Y into [0, 1] such that g(y) =
0 and g(F*) = {1}.
Note: The property of a space of being a Tychonov space is both topological and hereditary
property.
Self-Instructional
Material 241
Normal Spaces Theorem 11: A normal space is completely regular iff it is regular.
Proof: Now, as every completely regular space is regular, we only need to show
that any normal regular space is completely regular. Let F be a closed subset of X
NOTES not containing the point x so that x belongs to the open set X–F. Since the space
X is regular, there exists an open set G such that x∈G and C(G) ⊂ X–F so that
F ∩ C(G) = φ
Thus C(G) and F are disjoint closed subsets of a normal space X. Hence
by Urysohn’s lemma, there exists a continuous mapping f : X → [0, 1] such that
f(F) = {1} and f[C(G)] = {0}
Also x ∈ G and f[C(G)] = {0} implies that f(x) = 0. Therefore it follows
that (X, T) is completely regular.
Example 1: Consider a completely regular space (X, T). Prove that if F is a T-
closed subset of X and p ∉ F, then there exists a continuous mapping f of X into
[0, 1] such that f(p) = 1 and f(F) = {0}.
Since (X, T) is completely regular, there exists a continuous map g of X into
[0, 1] such that
g(p) = 0 and g(F) = {1}.
Now consider the mapping f : X → [0, 1] defined by setting f(x) = 1–g(x)
∀ x ∈ X.
Since constant functions are continuous, it follows that f is continuous.
Additionally, f ( p) = 1–g(p) = 1–0 = 1

f(x) = 1–g(x) = 1–1 ∀ x ∈ F
=0
so that f(F) = {0}.
Example 2: Consider the topology T on R defined as: T consists of φ, R and all
open sets of the form [–∞, a] such that a ∈ R. Prove the following:
(i) (R, T) is normal
(ii) (R, T) is not regular
(iii) (R, T) is not T4
Solution: (i) Here the only disjoint closed subsets of R are of the form φ and [a,
∞] and for each such pair, there exist disjoint open sets φ and R such that φ ⊂ φ
and [a, ∞) ⊂ R. So we conclude that (R, T) is normal.
(ii) Consider the closed set F = [1, ∞) and the point 0. Here 0 ∉ F. But the
only open set containing F is R which must intersect every open set containing
Self-Instructional 0. Hence there exist no open sets G and H such that
242 Material
0 ∈G, F ⊂ H and G∩H = φ. Normal Spaces
This implies that the space (R, T) is not regular.

(iii) The space (R, T) is not T1 since no singleton subset of R is T-closed.
Therefore the space is not T4. NOTES
Example 3: If x and y are two distinct points of a Tychonoff space (X, T), then
there exists a real valued continuous mapping f of X such that f (x) ≠ f (y).
Solution: As (X, T) is a T1-space, the singleton subset {y} is T-closed and since
x and y are distinct points, x ∉ {Y}. From the property of complete regularity of
X, there exists a real valued continuous mapping f of X such that,
f(x) = 0 and f[{y}] = {1}
This implies,
f(x) = 0 and f(y) = 1
But 0 ≠ 1 implies f(x) ≠ f(y).
Notes: The following hierarchy exists:
a) Completely normality implies normality
b) Complete regularity implies regularity
c) Regularity implies Hausdorffness
d) Hausdorffness implies T1-ness
e) T1-ness implies T0-ness
Check Your Progress

5. State the Urysohn's lemma.
6. What is a completely normal topological space?

QUESTIONS
1. A topological space X is a regular space if, given any nonempty closed set
F and any point x, such that x ∉ F, there exists a neighbourhood U of x and
a neighbourhood V of F that are disjoint or we can say that it must be
possible to separate x and F with disjoint neighbourhoods.
2. A topological space X is said to be a normal space if, given any disjoint
closed sets E and F, there are open neighbourhoods U of E and V of F that
are also disjoint.
3. A completely normal space or a hereditarily normal space is a topological
space X in which every subspace of X with subspace topology is a normal
space. Self-Instructional
Material 243
Normal Spaces 4. A perfectly normal space is a topological space X in which every two disjoint
non-empty closed sets E and F can be precisely separated by a continuous
function f from X to the real line R.
NOTES 5. Let X be a topological space and let any two disjoint closed sets A, B in X
can be separated by open neighbourhoods. Then there is a continuous
function f : X → [0, 1] such that f | A ≡ 1 and f | B ≡ 0.
6. A topological space (X, T) is called completely normal if and only if it satisfies
the statement given as: if A and B are two separated subsets of X, then there
exist two disjoint open sets G and H such that A ⊂ G and B ⊂ H.
13.6 SUMMARY
• A topological space X is a regular space if, given any nonempty closed set
F and any point x, such that x ∉ F, there exists a neighbourhood U of x
and a neighbourhood V of F that are disjoint or we can say that it must be
possible to separate x and F with disjoint neighbourhoods.
• If a topological space is both regular and a Hausdorff space then it is said to
be a T3 space or regular Hausdorff space.
• A topological space is said to be topologically regular if every point has an
open neighbourhood that is regular.
• A completely T4 space or T5 space is a completely normal Hausdorff
topological space X, or every subspace of X must be a T4 space.
• A locally normal space is a topological space where every point has an
open neighbourhood that is normal.
• Let X be a topological space and let any two disjoint closed sets A, B in X
can be separated by open neighbourhoods. Then there is a continuous
function f : X → [0, 1] such that f | A ≡ 1 and f | B ≡ 0.
• If X is a normal topological space and A is closed in X, then for any continuous
function f: A → R such that |f(x) < 1, there is a continuous function g: X →
R such th
13.7 KEY WORDS
• Regular space: A topological space X is a regular space if, given any

nonempty closed set F and any point x, such that x ∉ F, there exists a
neighbourhood U of x and a neighbourhood V of F that are disjoint or we
can say that it must be possible to separate x and F with disjoint
neighbourhoods.
Self-Instructional
244 Material
• Normal space: A topological space X is said to be a normal space if, given Normal Spaces
any disjoint closed sets E and F, there are open neighbourhoods U of E

and V of F that are also disjoint.
• Completely normal space: A completely normal space or a hereditarily
NOTES
normal space is a topological space X in which every subspace of X with
subspace topology is a normal space.
• Perfectly normal space: A perfectly normal space is a topological space
X in which every two disjoint non-empty closed sets E and F can be precisely
separated by a continuous function f from X to the real line R.
• Completely regular space: A topological space (X, T) is said to be
completely regular iff it satisfies the axiom given as:
If F is a closed subset of X and x is a point of X not in F, then there exists
a continuous map f : X → [0, 1] such that f (x) = 0 and f (x) = 1.

AND EXERCISES

1. Describe normal spaces briefly.
2. Write a short note on completely regular space.
1. Describe the Urysohn’s lemma.
2. Explain Tietze extension theorem.
3. Discuss complete regularity and normality.

India.
Ltd.
Sons, Inc.
Willard, Stephen. 2004. General Topology. United States: Dover Publications. Self-Instructional
Material 245
The Uryshon’s
Metrization Theorem
UNIT 14 THE URYSHON’S
METRIZATION THEOREM
NOTES
Structure
14.0 Introduction
14.1 Objectives
14.2 The Uryshon’s Metrization and Embedding Theorem
14.4 Summary
14.5 Key Words
14.0 INTRODUCTION
One of the first widely recognized metrization theorems was Urysohn’s metrization

theorem. This states that every Hausdorff second countable regular space is
metrizable. Every second-countable manifold is metrizable. Urysohn’s Theorem
can be restated as: A topological space is separable and metrizable if and only if it
is regular, Hausdorff and second-countable. A space is said to be locally
metrizable if every point has a metrizable neighbourhood. In this unit, you will
discuss the Uryshon’s metrization theorem, characterisation of the embedding
topology, composition of embedding and characterisation of the product topology.
You will be able to explain embedding lemma and Tychonoff’s embedding theorem.
14.1 OBJECTIVES
• Discuss Uryshon’s metrization theorem
• Understand characterisation of the embedding topology
• Analyse composition of embedding and characterisation of the product
topology
• Describe embedding lemma and Tychonoff’s embedding theorem
14.2 THE URYSHON’S METRIZATION AND

EMBEDDING THEOREM
Determining if two given spaces are homeomorphic is one of the fundamental

problems in topology.
Self-Instructional
246 Material
Definition: A one-one and onto (bijection) continuous map f : X → Y is a The Uryshon’s
Metrization Theorem
homeomorphism if its inverse is continuous.
A bijection f : X → Y induces a bijection between subsets of X and subsets
of Y and it is a homeomorphism iff this bijection restricts to a bijection,
NOTES
U → f (U )
{Open (or closed) subsets of X } {Open (or closed) subsets of Y }
f −1 (V ) ← V
between open (or closed) subsets of X and open (or closed) subsets of Y.
Definition: Suppose X is a set, Y a topological space and f : X → Y an injective
map. The embedding topology on X (for the map f) is the collection,
f –1(Y) = { f –1(V)|V ⊂ Y open} of subsets of X.
The subspace topology for A ⊂ X is the embedding topology for the inclusion
map A → X.
Theorem 1 (Characterization of the embedding topology): Let X has the
embedding topology for the map f : X → Y. Then,
1. X → Y is continuous.
2. For any map A → X into X,
f
A → X is continuous iff A → X → Y is continuous.
The embedding topology is the only topology on X with these two properties.
The embedding topology is the most common topology on X such that f : X → Y
is continuous.
g
Proof: The reason is that A → X is continuous.
g f
⇔ g–1(X) ⊂ A ⇔ g–1(f –1Y) ⊂ A ⇔ (fg)–1 (Y) ⊂ A ⇔ A → X → Y
is continuous by definition of the embedding topology. The identity map of X is a
homeomorphism whenever X is equipped with a topology with these two properties.
Definition: An injective continuous map f : X → Y is an embedding if the topology
on X is the embedding topology for f, i.e., X = f –1Y.
Any injective map f : X → Y induces a bijection between subsets of X and
subsets of f (X) and it is an embedding iff this bijection restricts to a bijection,
U → f (U )
{Open (or closed) subsets of X } {Open (or closed) subsets of f ( X )}
f −1 (V ) ← V
between open (or closed) subsets of X and open (or closed) subsets of f (X).
Alternatively, the injective map f : X → Y is an embedding iff the bijective
corestriction f (X)| f : X → f (X) is a homeomorphism. An embedding is a
homeomorphism followed by an inclusion. The inclusion A → X of a subspace is
an embedding. Any open (or closed) continuous injective map is an embedding.
For example, the map f (x) = 3x + 1 is a homeomorphism from R → R.
Self-Instructional
Material 247
The Uryshon’s Lemma: If f : X → Y is a homeomorphism (embedding) then the corestriction of
Metrization Theorem
the restriction f (A)| f \ A: A → f (A) (B| f \ A: A → B) is a homeomorphism
(embedding) for any subset A of X (and any subset B of Y containing f (A)). If the
maps fj : Xj → Yj are homeomorphisms (embeddings) then the product map
NOTES
∏ f :∏ X
j j → Y j is a homeomorphism (embedding).
Proof: In case of homeomorphisms employ that there is a continuous inverse in
both cases. In case of embeddings, employ that an embedding is a homeomorphism
followed by an inclusion map.
f g
Lemma 2 (Composition of embeddings): Let X → Y → Z be continuous
maps. Then f and g are embeddings implies that g ο f is an embedding which in
turn implies that f is an embedding.
Proof: For proving the second implication, first note that f is an injective continuous
map. Let U ⊂ X be open. Since g ο f is an embedding, U =
(g ο f )–1 W for some open W ⊂ Z. But (g ο f )–1 = f –1g–1W where g–1W is open
in Y since g is contimuous. This shows that f is an embedding.
Theorem 2 (Characterization of the product topology): Given the product
topology ∏ Y j . Then,
1. The projections π j : ∏ Y j → Y j are continuous, and
2. For any map f : X→ ∏

Yj
j∈J
into the product space we have,
X→∏ → ∏ Y j → Y is continuous.
f f π
Yj j
j∈J
is continuous ⇔ ∀ j ∈ J: X j∈J j
The product topology is the only topology on the product set with these
two properties.
Proof: Let TX be the topology on X and Tj the topology on Y j. Then
S Π =  j∈J π −j 1 ( j ) is a subbasis for the product topology on ∏ Y j . Therefore,

j∈J
f : X →∏
Yj
is continuous ⇔ f –1(  j∈J π j ( j ) ) ⊂ X
−1
j∈J
⇔ (  j∈J f (π j ( j )) ) ⊂ TX
−1 −1
⇔ ∀ j ∈ J: ( π j ο f ) −1 ( j ) ⊂  X
⇔ ∀ j ∈ J: π j ο f is continuous by definition of continuity

Now, we have to show that the product topology is the unique topology
with these properties. Take two copies of the product set ∏

Xj
j∈J
. Provide one
Self-Instructional copy with the product topology and the other copy with some topology that has
248 Material
the two properties of the above theorem. Then the identity map between these The Uryshon’s
Metrization Theorem
two copies is a homeomorphism.
Theorem 3: Let (Xj)j∈J be an indexed family of topological spaces with subspaces
Aj ⊂ Xj. Then ∏A
j∈J
j is a subspace of ∏X
j∈J
j . NOTES
1. ∏A =∏Aj j
2. (∏ A )° ⊂ ∏ A
j
°
j and equality holds if Aj = Xj for all but finitely many j ∈
J.
Proof: (1) Let (xj) be a point of ∏ X j . Since S Π =  j∈J π j ( j ) is a subbasis
−1
for the product topology on ∏X j , we have
(xj) ∈ ∏ A j ⇔ ∀ k ∈ J: π k−1 (U k ) ∩ ∏ A j ≠ φ for all neighbourhoods Uk

of xk.
⇔ ∀ k ∈ J: Uk ∩ Ak ≠ φ for all neighbourhoods Uk of xk
⇔ ∀ k ∈ J: xk ∈ Ak
⇔ (xj) ∏ A j
(2) (∏ A j )° ⊂ ∏ A°j because πj is an open map so that πj ( (∏ A j )° ) ⊂
A°j for all j ∈ J. If Aj = Xj for all but finitely many j ∈ J then ∏A °
j ⊂
(∏ A j )° because ∏ A°j is open and contained in ∏ A j .
It follows that a product of closed sets is closed.
Note: A product of open sets need not be open in the product topology.
Theorem 4 (Embedding lemma): Let  be a family of mappings where each
member f ∈  maps X → Yf. Then,
1. The evaluation mapping e: X → ∏ f ∈
Y f defined by πf οe(x) = f (x), for
all x ∈ X, is continuous.
2. The mapping e is an open mapping onto e(X) if  distinguishes points and
closed sets.
3. The mapping e is one-to-one if and only if  distinguishes points.
4. The mappping e is an embedding if  distinguished points F distinguishes
points and closed sets.
Proof: (1) Let πg: ∏ f ∈ Y f → Yg be the projection map to the space Yg. Then
πgοe = g so that πgοe is continuous. Therefore e must be continuous as g is
continuous.
Self-Instructional
Material 249
The Uryshon’s (2) Suppose that U is open in X and x ∈ U. Choose f ∈ such that f(x)
Metrization Theorem
∉ f ( X \ U ) . The set B = {z ∈ e(X)| π f (z) ∉ f ( X \ U ) } is a
neighbourhood of e(x) as the set is open (it is defined for components not
NOTES
being in the closed set f ( X \ U ) and clearly e(x) ∈ B. Moreover
πf (B) ⊂ f(U) by construction. It is now claimed that f(U) ⊂ πf (B). This
follows trivially from the definition of a family of functions distinguishing
points and closed sets. Therefore f (U) = πf (B) and subsequently f (U) is
an open subset of πgοe(X). Therefore the evaluation map is an open
mapping.
(3) The definition of distinguishing points implies injectivity.
(4) Combining a, b and c, we see that X ≅ e(X) as e is a continuous, open,
injective, surjective (as a continuous map is always surjective onto its image)
map.
Definition: If X is a space and A, a set then by the power XA we mean the
product space ΠαXα, where Xα =X, for each α ∈ A. Any power of [0, 1] is called
a cube. A map e: X → Y is an embedding iff the map e: X → e(X) is a
homeomorphism. If there is an embedding e: X →Y then we say that X can be
embedded in Y.
Theorem 5 (Tychonoff’s embedding theorem): A space is Tychonoff iff it can
be embedded in a cube.
Proof: ⇒ Let X be a Tychonoff space and let A = {f : X → [0, 1] / f is continuous}.
Define e: X → [0, 1]A by e(x)(f) = f (x).
(i) e is injective: If x, y ∈ X with x ≠ y, then there is f ∈A so that f(x) = 0 and
f(y) = 1. Then e(x)(f) ≠ e(y)(f), so e(x) ≠ e(y).
(ii) e is continuous: This is immediate since πf e = f.
(iii) e: X → e(X) carries open sets of X to open subsets of e(X): For let U be
open in X and let x ∈ U. Then there is f ∈ A so that f(x) = 0 and f(X – U)
= 1. Let V = π −f 1 ([0, 1)), an open subset of [0, 1]A. Then e(x) ∈ V and if y
∈ X is such that e(y) ∈ V, then e(y)(f) ∈ [0, 1), so f(y) < 1 and y ∈ U. Thus
e(x) ∈ V ∩ e(X) ⊂ e(U).
(i), (ii) and (iii) together imply that e is an embedding.
⇐: [0, 1] is clearly so [0, 1]A is Tychonoff for any A. Any subspace of a
Tychonoff space is Tychonoff. Thus if X can be embedded in a cube, then X is
homeomorphic to a Tychonoff space and so is itself Tychonoff.
Theorem 6: Let (T, ) be the 3-point topological space defined by
T = {0, 1, 2} and  = { ϕ, {0}, T}. Let (X, ) be any topogical space and
suppose that  ∩ X=ϕ. Then there is an embedding e: X →   ∪ X.
Self-Instructional
250 Material
Proof: For each U ∈ , define fU: X → T by fU(y) = 0 if y ∈ U and fU(y)=1 if y The Uryshon’s
Metrization Theorem
∉ U. Then fU is continuous. For each x ∉ X, define fx: X → T by fx(y) = 2 if y =
x and fx(y) = 1 if y ≠ x. Then fx is also continuous.
Define e by ei(y)=fi(y) for each i ∈  ∪ X. Then
NOTES
(i) e is injective, for if x, y ∈ X with x ≠ y then ex(y) = 1 but ex(x) = 2, so ex(x)
≠ ex(y) and hence e(x) ≠ e(y).
(ii) e is continuous because each fi is continuous.
(iii) e is open into e(X), for if U ∈  and x ∈ U then V = πU−1 (0) is open in T
∪X
. Furthermore, so πUe(x)=0, so e(x) ∈ V while if y ∈ X is such that e(y)
∈ V then πUe(y)= 0 and hence y ∈ U. Thus V ∩ e(X) ⊂ e().
Theorem 7 (Urysohn’s metrization theorem): Suppose (X, ) is a regular
topological space with a countable basis , then X is metrizable.
Proof: Let (X, ) be a regular metrizable space with countable basis . For this
proof, we will first create a countable collection of functions {fn}n∈N, where fm:X
→ R for all m ∈ N, such that given any x ∈ X and any open neighbourhood U of
x there is an index N such that fN(x) > 0 and zero outside of U. We will then use
these functions to imbed X in Rw.
Let x ∈ X and let U be any open neighbourhood of x. There exists Bm ∈ 
such that x ∈ Bm. Now, since X has a countable basis and is regular, we know that
X is normal. Next, as Bm is open, there exists some Bn ∈  such that Bn ⊂ Bm.
Thus we now have two closed sets Bn and X \ Bm, and so we can apply Urysohn’ss
lemma to give us a continuous function gn,m: X → R such that gn,m( Bn ) = {1} and
gn,m(X \ Bm) = {0}. Notice here that this function satisfies requisite: gn,m(y) = 0 for
y ∈ X \ Bm and gn,m(x) > 0. Here, g was indexed purposely, as it shows us that
{gn,m} is indexed by N×N, which is countable (since the cross product of two
countable sets is countable). Considering this, relable the functions {gn,m}n,m∈N as
{fn}n∈N.
We now imbed X in the metrizable space Rw. Let F: X → Rw where F(x) =
(f1(x), f2(x), f3(x), …), where fn are the functions constructed above. We claim
that F is an imbedding of X into Rw.
For F to be an imbedding it is required of F to be homeomorphic onto its
image. First, this needs that F should be a continuous bijection onto its image. We
know that F is continuous as each of its component functions fN are continuous by
construction. Now we show that F is an injection.
Let x, y ∈ X be distinct. From the Hausdorff condition there exist open sets
Ux and Uy such that x ∈ Ux, y ∈ Uy with Ux ∩ Uy= φ. By the construction of our
Self-Instructional
Material 251
The Uryshon’s maps f there exists an index N ∈ N such that fN(Ux) > 0 and FN(X \ Ux) = 0. It
Metrization Theorem
follows that fN(x) ≠ fN(y) and so F(x) ≠ F(y). Hence, F is injective.
Now, as it is clear that F is surjective onto its image F(X), all that is left to
show is that F is an embedding. We will show that for any open set U ∈ X, F(U)
NOTES
is open in Rw. Let U ⊂ X be open and let x ∈ U. Pick an index N such that fN(x)
> 0 and fN (X \U) = 0. Let F(x) = z ∈ F(U). Let V = π −N1 ((0, ∞)), i.e., all elements
of Rw with a positive Nth coordinate. Now let W = F(X) ∩ V. We claim that z ∈W
⊂ F(U) showing that F(U) can be written as a union of open sets, hence making
it open.
First we show that W is open in F(X). We know that V is an open set in Rw.
W = F(X) ∩ V, and W is open by the definition of the subspace topology.
Thereafter, we will first show that f(x) = z ∈ W and then W ⊂ F(U). To
prove our first claim, F(x) = z ⇒ (F(x)) = fN(x) > 0 ⇒ – π N(z) = π N(F(x)) =
fN(x) > 0 ⇒ π N(z) > 0 which means that z ∈ π −N1 (V) and also z ∈ F(X) ⇒ z ∈
F(X) ∩V = W. Now we show that W ⊂ F(U). Let y ∈ W. This means y ∈ F(X)
∩ V = W.
Now we show that W ⊂ F(U). Let y ∈ W. This means y ∈ F(X) ∩ V. This
means there exists some w ∈ X such that F(w) = y. But, since y ∈ V we have that:
π N(y) = π N(F(w)) = fN(w) > 0 since y ∈ V, but fN(w) = 0 for all w ∈ X \U
and so y ∈ F(U).
In conclusion, as we have shown that F: X → Rw is a map that preserves
open sets in both directions and bijective onto its image, we have shown that F is
an embedding of the space X into the metrizable space Rw and X is therefore
metrizable, the metric being given by the induced metric from Rw.
Example 1: The topology generated by the dictionary ordering on R2 is metrizable.
Proof: From previous Theorem 3.19, all we have to do for showing that R2 is
metrizable in the dictionary ordering is to prove that this space is regular with a
countable basis.
Now, since the set {(a, b), (c, d)| a ≤ c, b < d; a, b, c, d ∈ R} is a basis for
the dictionary ordering on R2 and the set of intervals with rational end-points are a
basis for the usual topology on R, it follows that the set {(a, b), (c, d)|a ≤ c, b <
d; a, b, c, d ∈ Q } is a countable basis for the dictionary ordering.
Now we will show that the dictionary ordering is regular. Let a ∈ R2 and B
⊆ R2 such that B is closed in the dictionary ordering and a ∉ B. Let ε = inf {d(a,
b)| b ∈ B}. We know that ε is greater than 0, for otherwise a would be an
accumulation point of B, which is a contradiction. It follows that the open sets ((a,
a–ε/2), (a, a+ε/2)) and  b∈B
((b, b–ε/2), (b, b+ε/2)) are disjoint open sets
containing a and B, respectively. Hence, the dictionary ordering over R2 is
Self-Instructional metrizable, since it is regular and has a countable basis.
252 Material
Note: In this proof we have shown that a sequence of functions {fn}n∈N with the property The Uryshon’s
Metrization Theorem
that for each x ∈ X and each neighbourhood U of x there is some n ∈ N such that fn(x) > 0 and
fn(y) > 0 for all y ∈X \U, gives us an imbedding F: X → Rw. Notice that we have the very similar
result if we have a sequence of functions {fj}j∈J with same properties as above: given any x
∈ X and any neighbourhood U of x there exists j∈J such that fj(x) > 0 and fj(y) = 0 for all y ∈X NOTES
\U, then we have an imbedding from X → Rj given by F(x) = (fj(x))j∈J. This is known as the
imbedding theorem and is a generalization of Urysohn’s metrization theorem.
Check Your Progress

1. Define homeomorphism.
2. Give definition of embedding.
3. State Tychonoff's embedding theorem.
4. What is the Urysohn's metrization theorem?
5. When is a map an embedding?

QUESTIONS
1. A one-one and onto (bijection) continuous map f : X → Y is a
2. An injective continuous map f : X → Y is an embedding if the topology on X
is the embedding topology for f, i.e., X = f –1Y.
3. A space is Tychonoff iff it can be embedded in a cube.
4. Suppose (X, ) is a regular topological space with a countable basis ,
then X is metrizable.
5. A map e: X → Y is an embedding iff the map e: X → e(X) is a
homeomorphism. If there is an embedding e: X →Y then we say that X can
be embedded in Y.
14.4 SUMMARY
• A one-one and onto (bijection) continuous map f : X → Y is a
• Suppose X is a set, Y a topological space and f : X → Y an injective map.
The embedding topology on X (for the map f) is the collection,
f –1(Y) = { f –1(V)|V ⊂ Y open} of subsets of X.
• The injective map f : X → Y is an embedding iff the bijective corestriction f
(X)| f : X → f (X) is a homeomorphism.
• If f : X → Y is a homeomorphism (embedding) then the corestriction of the
restriction f (A)| f \ A: A → f (A) (B| f \ A: A → B) is a homeomorphism
(embedding) for any subset A of X (and any subset B of Y containing f (A)). Self-Instructional
Material 253
The Uryshon’s • A space is Tychonoff iff it can be embedded in a cube.
Metrization Theorem
• Suppose (X, ) is a regular topological space with a countable basis ,
then X is metrizable.
NOTES
14.5 KEY WORDS
• Tychonoff’s embedding theorem: A space is Tychonoff iff it can be

embedded in a cube.
• Urysohn’s metrization theorem: Suppose (X, T) is a regular topological
space with a countable basis B, then X is metrizable.

AND EXERCISES

1. Write a short note on embedding lemma and Tychonoff’s embedding.
2. Describe characterisation of the embedding topology.
3. Explain characterisation of the product topology.
1. Discuss the Urysohn’s embedding theorem.
2. Describe the Urysohn’s metrization theorem.

India.
Ltd.
Sons, Inc.
Self-Instructional
254 Material

M - SC - (Mathematics) - 311 14 - Topology - I PDF

Uploaded by

Copyright:

Available Formats

M - SC - (Mathematics) - 311 14 - Topology - I PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

M - SC - (Mathematics) - 311 14 - Topology - I PDF

Uploaded by

Copyright:

Available Formats

ALAGAPPA UNIVERSITY

[Accredited with ‘A+’ Grade by NAAC (CGPA:3.64) in the Third Cycle

Directorate of Distance Education

"The copyright shall be vested with Alagappa University"

Vikas® is the registered trademark of Vikas® Publishing House Pvt. Ltd.

BLOCK I: FUNDAMENTALS, FINITEAND INFINITE SETS

BLOCK II: TOPOLOGICAL SPACES

BLOCK III: CONNECTED AND COMPACT SPACES

BLOCK I: FUNDAMENTALS, FINITE AND INFINITE SETS

BLOCK III: CONNECTED AND COMPACT SPACES

BLOCK IV: COUNTABILITY AXIOMS AND NORMAL SPACES

UNIT 1 SET THEORY

After studying this unit, you will be able to:

set V belong to the set V.

1.2.4 Empty Set or Null Set

Example 9: If N = { 1, 2, 3 .......} and

subset. An infinite set may have an infinite subset.

Fig. 1.1 Disjoint Sets

1.2.9 Overlapping Sets

If an element x belongs to a set A, then it is written as x ∈ A.

Check Your Progress

1.3 SUBSET OF SETS

Set A is called a subset of B if all elements of A are also the elements of B. It is

Fig. 1.2 Subset

This is called the inclusion relation. Every element of Y is also an element of X,

1.3.2 Transitivity of Subsets

Check Your Progress

1.4 SET OPERATORS

1.4.1 Cardinality of a Set

Then B – C = {1, b, d} and C – B = { a, f, 2 },

1.4.6 Venn Diagram

Fig. 1.3 Set Operation on Venn Diagram

Fig. 1.4 Minset on Venn Diagram

Check Your Progress

Important laws of sets are listed as follows:

Check Your Progress

1.6 APPLICATIONS OF SET THEORY

Set theory has applications in different branches of mathematics. This is so because

same domains in each record of the relation.

(ii) How many read two Consecutive issues?

1.7 RELATION OF SETS

aRb = {(1,a),(1,c), (3,a), (3,c)}

Let us consider a different example

Check Your Progress

a unique element of the codomain or the codomain consists of only

Fig. 1.6 Inverse Function

Fig. 1.7 Composition of Function

(i) (f o g) (x) = f(g(x)) = f(3x + 2)

1.9.2 Logical Operators

10. p ∨ (q ∧ r) ⇔ (p ∨ q) ∧ (p ∨ r) distributive of ∨ over ∧

11. p ∨ 1 ⇔ 1 (Null) or Domination law 1

12. p ∧ 0 ⇔ 0 (Null) or Domination law 2

13. p ∧ 1 ⇔ p Identity law 1

14. p ∨ 0 ⇔ p Identity law 2

15. p ∨ ~ p ⇔ 1 Negation law 1

16. p ∧ ~ p ⇔ 0 Negation law 2

17. ~ (~ p) ⇔ p Double negation law (involution)

18. p → q ⇔ ~ p ∨ q Implication law

19. p ↔ q ⇔ (p → q) ∧ (q → p) Equivalence law