The Euclidean Topology

Similar documents
CHAPTER 7. Connectedness

1111: Linear Algebra I

TOPOLOGICAL ASPECTS OF YAO S ROUGH SET

CHAPTER 1. Preliminaries. 1 Set Theory

4 Limit and Continuity of Functions

Characterisation of Accumulation Points. Convergence in Metric Spaces. Characterisation of Closed Sets. Characterisation of Closed Sets

Chapter 1 The Real Numbers

Generell Topologi Exercise Sheet 2

Chapter 4. Measure Theory. 1. Measure Spaces

Topological properties

CSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University. Name: ID#: Section #: Score: / 4

This chapter contains a very bare summary of some basic facts from topology.

3 COUNTABILITY AND CONNECTEDNESS AXIOMS

1111: Linear Algebra I

MA651 Topology. Lecture 10. Metric Spaces.

CHAPTER 6. Copyright Cengage Learning. All rights reserved.

MA651 Topology. Lecture 9. Compactness 2.

1.4 Equivalence Relations and Partitions

We have seen that for a function the partial derivatives whenever they exist, play an important role. This motivates the following definition.

Basic Definitions: Indexed Collections and Random Functions

30.1 Continuity of scalar fields: Definition: Theorem: Module 10 : Scaler fields, Limit and Continuity

Introduction to Topology

In this initial chapter, you will be introduced to, or more than likely be reminded of, a

Math 730 Homework 6. Austin Mohr. October 14, 2009

M17 MAT25-21 HOMEWORK 6

CLASS NOTES FOR APRIL 14, 2000

2. Introduction to commutative rings (continued)

43.1 Vector Fields and their properties

Chapter 5 Random vectors, Joint distributions. Lectures 18-23

Lebesgue Measure. Dung Le 1

MATH10040: Chapter 0 Mathematics, Logic and Reasoning

Generell Topologi. Richard Williamson. May 6, 2013

Through level curves and contour lines give some information about the function

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION

Abstract Measure Theory

Footnotes to Linear Algebra (MA 540 fall 2013), T. Goodwillie, Bases

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products


Chapter 3 Continuous Functions

Chapter 2: Linear Independence and Bases

MAS221 Analysis Semester Chapter 2 problems

c i r i i=1 r 1 = [1, 2] r 2 = [0, 1] r 3 = [3, 4].

STA2112F99 ε δ Review

MAT 3271: Selected solutions to problem set 7

Homework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4

MORE ON CONTINUOUS FUNCTIONS AND SETS

Relations and Equivalence Relations

Lecture 12: Multiple Random Variables and Independence

Set Theory Basics of Set Theory. 6.2 Properties of Sets and Element Argument. 6.3 Algebraic Proofs 6.4 Boolean Algebras.

On convergent power series

Basic Measure and Integration Theory. Michael L. Carroll

Introduction to Mathematical Programming IE406. Lecture 3. Dr. Ted Ralphs

MAS3706 Topology. Revision Lectures, May I do not answer enquiries as to what material will be in the exam.

A NEIGHBORHOOD TREATMENT OF GENERAL TOPOLOGICAL SPACES*

Definition For a set F, a polynomial over F with variable x is of the form

MATH 426, TOPOLOGY. p 1.

Metric Spaces Lecture 17

THE CANTOR GAME: WINNING STRATEGIES AND DETERMINACY. by arxiv: v1 [math.ca] 29 Jan 2017 MAGNUS D. LADUE

Prime Properties of the Smallest Ideal of β N

CHAPTEER - TWO SUBGROUPS. ( Z, + ) is subgroup of ( R, + ). 1) Find all subgroups of the group ( Z 8, + 8 ).

Fourth Week: Lectures 10-12

Math 203A - Solution Set 1

Metric spaces and metrizability

Real Variables: Solutions to Homework 3

CONSTRUCTION OF THE REAL NUMBERS.

Logic, Proof, Axiom Systems

Exam 2 extra practice problems

10.1.1Theorem: Module 4 : Local / Global Maximum / Minimum and Curve Sketching

Sanjay Mishra. Topology. Dr. Sanjay Mishra. A Profound Subtitle

Connectedness. Proposition 2.2. The following are equivalent for a topological space (X, T ).

Glossary of Logical Terms

ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS

Lecture 1: September 25, A quick reminder about random variables and convexity

Algebraic Geometry. Andreas Gathmann. Class Notes TU Kaiserslautern 2014

Elementary constructions on sets

Class IX Chapter 5 Introduction to Euclid's Geometry Maths

2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.

Some Basic Logic. Henry Liu, 25 October 2010

Lecture Notes DRE 7007 Mathematics, PhD

ALGEBRAIC GROUPS. Disclaimer: There are millions of errors in these notes!

Modal and temporal logic

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 1. I. Foundational material

MATH 23b, SPRING 2005 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Midterm (part 1) Solutions March 21, 2005

Set, functions and Euclidean space. Seungjin Han

Notes on the Point-Set Topology of R Northwestern University, Fall 2014

2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31

ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

106 CHAPTER 3. TOPOLOGY OF THE REAL LINE. 2. The set of limit points of a set S is denoted L (S)

Module 7 : Applications of Integration - I. Lecture 20 : Definition of the power function and logarithmic function with positive base [Section 20.

Some Basic Notations Of Set Theory

On minimal models of the Region Connection Calculus

Chapter 1. Measure Spaces. 1.1 Algebras and σ algebras of sets Notation and preliminaries

Solutions to Tutorial 8 (Week 9)

Economics 204 Summer/Fall 2017 Lecture 1 Monday July 17, 2017

Rough Sets. V.W. Marek. General introduction and one theorem. Department of Computer Science University of Kentucky. October 2013.

31.1.1Partial derivatives

Advanced Calculus: MATH 410 Professor David Levermore 28 November 2006

Math 203A - Solution Set 1

2 Equivalence Relations

3.C. Further comments on axioms for geometry

Transcription:

Lecture note /topology / lecturer :Zahir Dobeas AL -nafie The Euclidean Topology Introduction In a movie or a novel there are usually a few central characters about whom the plot revolves. In the story of topology, the euclidean topology on the set of real numbers is one of the central characters. Indeed it is such a rich example that we shall frequently return to it for inspiration and further examination. Let R denote the set of all real numbers. In Chapter 1 we defined three topologies that can be put on any set: the discrete topology, the indiscrete topology and the finite-closed topology. o we know three topologies that can be put on the set R. ix other topologies on R were defined in Exercises 1.1 #5 and #9. In this chapter we describe a much more important and interesting topology on R which is known as the euclidean topology. An analysis of the euclidean topology leads us to the notion of "basis for a topologyô. In the study of Linear Algebra we learn that every vector space has a basis and every vector is a linear combination of members of the basis. imilarly, in a topological space every open set can be expressed as a union of members of the basis. Indeed, a set is open if and only if it is a union of members of the basis. 1

2 2.1 The Euclidean Topology on R Definition. A subset of R is said to be open in the euclidean topology on R if it has the following property: ( ) For each x, there exist a,b in R, with a < b, such that x (a,b). Notation. Whenever we refer to the topological space R without specifying the topology, we mean R with the euclidean topology. Remarks. (i) The "euclidean topologyô is a topology. We are required to show that satisfies conditions (i), (ii), and (iii) of Definitions. We are given that a set is in if and only if it has property. Firstly, we show that R. Let x R. If we put a = x 1 and b = x+1, then x (a,b) R; that is, R has property and so R. econdly, Ø as Ø has property by default. Now let {A : J}, for some index set J, be a family of members of. Then we have to show that A ; that is, we have to show that A has property. Let x A. Then x A k, for some k J. As A k, there exist a and b in R with a < b such that x (a,b) A k. As k J, A k A and so x (a,b) A. H ence A and thus is in, as required. has property Finally, let A 1 and A 2 be in. We have to prove that A 1 A 2. o let y A 1 A 2. Then y A 1. As A 1, there exist a and b in R with a < b such that y (a,b) A 1. Also y A 2. o there exist c and d in R with c < d such that y (c,d) A 2. Let e be the greater of a and c, and f the smaller of b and d. It is easily checked that e < y < f, and so y (e,f). As (e,f) (a,b) A 1 and (e,f) (c,d) A 2, we deduce that y (e,f) A 1 A 2. Hence A 1 A2 has property and so is in. Thus is indeed a topology on R.

3 We now proceed to describe the open sets and the closed sets in the euclidean topology on R. In particular, we shall see that all open intervals are indeed open sets in this topology and all closed intervals are closed sets. (ii) Let r,s R with r < s. In the euclidean topology on R, the open interval (r,s) does indeed belong to and so is an open set. We are given the open interval (r,s). We must show that (r,s) is open in the euclidean topology; that is, we have to show that (r,s) has property ( ) of Definition 2.1.1. o we shall begin by letting x (r,s). We want to find a and b in R with a < b such that x (a,b) (r,s). Let x (r,s). Choose a = r and b = s. Then clearly x (a,b) (r,s). o (r,s) is an open set in the euclidean topology. (iii) The open intervals (r, ) and (,r) are open sets in R, for every real number r. Firstly, we shall show that (r, ) is an open set; that is, that it has property ( ). To show this we let x (r, ) and seek a,b R such that x (a,b) (r, ). Let x (r, ). Put a = r and b = x + 1. Then x (a,b) (r, ) and so (r, ). A similar argument shows that (,r) is an open set in R.

4 (iv) It is important to note that while every open interval is an open set in R, the converse is false. Not all open sets in R are intervals. For example, the set (1, 3) (5, 6) is an open set in R, but it is not an open interval. Even the set (2n, n=1 2n + 1) is an open set in R. (v) For each c and d in R with c < d, the closed interval [c,d] is not an open set in R. We have to show that [c,d] does not have property ( ). To do this it sufces to find any one x such that there is no a,b having property ( ). Obviously c and d are very special points in the interval [c,d]. o we shall choose x = c and show that no a,b with the required property exist. We use the method of proof called proof by contradiction. We suppose that a and b exist with the required property and show that this leads to a contradiction, that is something which is false. Consequently the supposition is false! Hence no such a and b exist. Thus [c,d] does not have property ( ) and so is not an open set. Observe that c [c,d]. uppose there exist a and b in R with a < b such that c (a,b) [c,d]. c +a 2 2 Then c (a,b) implies a < c < b and so a < < c < b. Thus c +a (a,b) and c +a / [c,d]. Hencee 舀 2 (a,b) 6 [c,d], which is a contradiction. o there do not exist a and b such that c (a,b) [c,d]. Hence [c,d] does not have property ( ) and so [c,d] /.