A NEIGHBORHOOD TREATMENT OF GENERAL TOPOLOGICAL SPACES*

Similar documents
Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008

CHAPTER 7. Connectedness

CONCERNING CONNECTED AND REGULAR POINT SETS*

DISTANCE FUNCTIONS AND THE METRIZATION PROBLEM*

A PROPERTY OF CONTINUITY*

DEFINITION IN TERMS OF ORDER ALONE IN THE LINEAR CONTINUUM AND IN WELL-ORDERED SETS*

ON IRREDUNDANT SETS OF POSTULATES* BY

A SYSTEM OF AXIOMATIC SET THEORY PART VI 62

RELATIVELY UNIFORM CONVERGENCE OF SEQUENCES OF FUNCTIONS*

STRONGLY CONNECTED SPACES

Hierarchy among Automata on Linear Orderings

TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS IV

Chapter 1 The Real Numbers

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

2. The Concept of Convergence: Ultrafilters and Nets

JUST THE MATHS UNIT NUMBER 9.3. MATRICES 3 (Matrix inversion & simultaneous equations) A.J.Hobson

Nets and filters (are better than sequences)

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION

("-1/' .. f/ L) I LOCAL BOUNDEDNESS OF NONLINEAR, MONOTONE OPERA TORS. R. T. Rockafellar. MICHIGAN MATHEMATICAL vol. 16 (1969) pp.

2.31 Definition By an open cover of a set E in a metric space X we mean a collection {G α } of open subsets of X such that E α G α.

CHAPTER 5. The Topology of R. 1. Open and Closed Sets

Set, functions and Euclidean space. Seungjin Han

The boundary of a shape and its classification

Set theory and topology

Sets, Functions and Metric Spaces

Analysis I. Classroom Notes. H.-D. Alber

Introduction to Turing Machines. Reading: Chapters 8 & 9

AN AXIOMATIC BASIS FOR PLANE GEOMETRY*

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

U e = E (U\E) e E e + U\E e. (1.6)

Problems for Chapter 3.

Class Notes on Poset Theory Johan G. Belinfante Revised 1995 May 21

ON SPACES IN WHICH COMPACT-LIKE SETS ARE CLOSED, AND RELATED SPACES

MAT 3271: Selected solutions to problem set 7

MATH 54 - TOPOLOGY SUMMER 2015 FINAL EXAMINATION. Problem 1

Criteria for existence of semigroup homomorphisms and projective rank functions. George M. Bergman

Slow P -point Ultrafilters

Math 117: Topology of the Real Numbers

Sequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.

MA651 Topology. Lecture 9. Compactness 2.

SUMS PROBLEM COMPETITION, 2000

FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets

Convergence and submeasures in Boolean algebras

FUNDAMENTAL GROUPS AND THE VAN KAMPEN S THEOREM

Boolean Algebras. Chapter 2

arxiv: v2 [math.gn] 1 Apr 2012

f(s)ds, i.e. to write down the general solution in

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

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

Limitations of Efficient Reducibility to the Kolmogorov Random Strings

FACTORIZATION AND THE PRIMES

Axioms for Set Theory

Prime and irreducible elements of the ring of integers modulo n

ON DUALITY IN PROXIMITY SPACES

Cardinality and ordinal numbers

Economics 204 Fall 2011 Problem Set 2 Suggested Solutions

Filters in Analysis and Topology

Math 308 Midterm November 6, 2009

Convexity in R n. The following lemma will be needed in a while. Lemma 1 Let x E, u R n. If τ I(x, u), τ 0, define. f(x + τu) f(x). τ.

HOMEWORK #2 - MA 504

Splitting a Default Theory. Hudson Turner. University of Texas at Austin.

DR.RUPNATHJI( DR.RUPAK NATH )

Integration on Measure Spaces

Czechoslovak Mathematical Journal

HANDOUT AND SET THEORY. Ariyadi Wijaya

function provided the associated graph function g:x -) X X Y defined

Contents. Index... 15

Topological properties

Large Sets in Boolean and Non-Boolean Groups and Topology

Lecture Topic 4: Chapter 7 Sampling and Sampling Distributions

ON THE CORE OF A GRAPHf

Propositional and Predicate Logic - II

Intrinsic products and factorizations of matrices

Chapter 2: Linear Independence and Bases

Introduction to Sets and Logic (MATH 1190)

Introduction to Metalogic 1

Denotational Semantics

Scott Taylor 1. EQUIVALENCE RELATIONS. Definition 1.1. Let A be a set. An equivalence relation on A is a relation such that:

Tree sets. Reinhard Diestel

A POSTULATIONAL CHARACTERIZATION OF STATISTICS

1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3

TRUTH-THEORIES FOR FRAGMENTS OF PA

A SECOND COURSE IN GENERAL TOPOLOGY

Definitions & Theorems

Introduction to Topology

Set theory. Math 304 Spring 2007

Appendix B Convex analysis

s P = f(ξ n )(x i x i 1 ). i=1

CHAOTIC UNIMODAL AND BIMODAL MAPS

Boolean Algebra CHAPTER 15

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

A NOTE ON LINEAR FUNCTIONALS R. P. BOAS, JR., AND J. W. TUKEY

CHAPTER 1. Preliminaries. 1 Set Theory

Continued fractions for complex numbers and values of binary quadratic forms

LECTURE 3 Functional spaces on manifolds

An Algebraic Interpretation of the Multiplicity Sequence of an Algebraic Branch

Mathematics Review for Business PhD Students

VC-DENSITY FOR TREES

The natural numbers. Definition. Let X be any inductive set. We define the set of natural numbers as N = C(X).

MA103 Introduction to Abstract Mathematics Second part, Analysis and Algebra

Transcription:

J 933-] GENERAL TOPOLOGICAL SPACES 401 A NEIGHBORHOOD TREATMENT OF GENERAL TOPOLOGICAL SPACES* BY W. O. GORDON In this paper we deal with all the subsets of a space R of elements called points. Each point p of R may have associated with it certain subsets of R called neighborhoods of p so that it is determined by some rule whether or not any particular set is a neighborhood of any particular point. In the most general case no assumptions are made such as that every point has at least one neighborhood associated with it, or that the point p is an element of the neighborhood associated with it. The purpose of this paper will be to consider (1) the various ways of defining limit point in terms of neighborhoods; (2) what properties must be assumed concerning the neighborhoods in order that limit point have certain well known properties. We shall start with the following new definition of limit point which, although somewhat peculiar in character, is found to be most convenient for the case of the general topological space, f DEFINITION A. A point p is said to be a limit point of a set E if every neighborhood of p that contains C(E)% contains at least one point of E. DEFINITION B. A point p is said to be interior to the set E if it is not a limit point of C(E). THEOREM 1. The set N is a neighborhood of the point p if and only if p is interior to N. PROOF. (1) Suppose p were not interior to N; then p would be a limit point of C(N) and hence every neighborhood of p that contains the complement of C(N) must contain a point of C(N). Now N is a neighborhood of p by hypothesis, but it contains no point of C(N), which gives us a contradiction. (2) If p is not a limit point of C(N), then there is a neighborhood of p which contains N but no point of C(N), hence N is the neighborhood. * Presented to the Society, June 22, 1933. f M. Fréchet, Les Espaces Abstraites, p. 166; E. W. Chittenden, Transactions of this Society, vol. 31 (1929), pp. 290-321. I The symbol C(E) means the complement of the set E. The whole definition implies that p is a limit point of E if C(E) is not a neighborhood of p.

402 W. O. GORDON [June, From this theorem it can be seen that with Definition A the general topological space can be considered as a neighborhood space. For if we take for the neighborhoods of each point p all sets to which p is interior, then by Theorem 1, Definition A will define limit point correctly. DEFINITION C. A space is said to be monotonie* if it has the property that for every point p and set A, if p is a limit point of A it is a limit point of every set containing A, This can be written in symbols :f If A<B, ÛienA'<B', or {A +B) f >A'+B'. THEOREM 2. The space R is monotonie if and only if it has the property that if the set N is a neighborhood of the point p, so is every set containing N. The proof of Theorem 2 follows easily from Definition C and will be omitted. DEFINITION D. A space is said to have the partition propertyi if whenever p is a limit point of (A+B), it is a limit point of either,4 or B. In symbols {A +B)'<A'+B'. THEOREM 3. A necessary and sufficient condition that a space R have the partition property is that if M and N are neighborhoods of the point p, so is their logical product M-N. PROOF. First, suppose p were not a limit point of either A or B. Then C(A) and C(B) would be neighborhoods of p and so would their logical product C(A) - C(B) = C(A +B) ; then C{A + B) would be a neighborhood of p and consequently p could not be a limit point of A+B, contrary to hypothesis. Secondly, suppose M-N were not a neighborhood; then p is a limit point of C(M-N) which is equal to C(M) + C(N), and hence p is a limit point either of C(M) or C(N), so that neither M nor N could be a neighborhood of p, contrary to hypothesis. DEFINITION E. A set is closed if it contains all of its limit points. * Dorothy McCoy, Tôhoku Mathematical Journal, vol. 33 (1930), pp. 88-116. t The symbol < in A < B means "A is contained in B". The symbol A ' means the set of limit points of the set A. The symbol > in (A -\-B) ' > A ' -\-B ' means that (A+B)' includes^' +B'. X See Dorothy McCoy, loc. cit.

1933-1 GENERAL TOPOLOGICAL SPACES 403 DEFINITION F. A set is said to be open if every point of it is interior to it. Thus an open set is the complement of a closed set, and conversely. DEFINITION G. The set of all limit points of the set A is called the derived set, A '. DEFINITION H. If all the derived sets in the space R are closed, that is, if (A ') r <A ', the space R is said to be accessible. THEOREM 4. A space R is accessible if and only if it is true that whenever N is a neighborhood of a point p, then the set of all points of which N is a neighborhood is also a neighborhood of the point p. PROOF. First, let I be the set of all points of which N is a neighborhood. By Theorem 1, I consists of all points that are not limit points of C(N); hence C{I) = (C(N))' which is closed by hypothesis. Hence C(I) is closed and therefore I is open, and, consequently, ƒ is a neighborhood of p. Secondly, suppose p is a limit point of A 1 but not of A ; then C(A) is a neighborhood of p, and so /, which is the set of all points of which C(A) is a neighborhood, is a neighborhood of p by hypothesis, but I=C(A') and hence p is not a limit point of A', contrary to hypothesis. COROLLARY. The space R is accessible if and only if the set of all points interior to any set is an open set. DEFINITION I. A space R is said to have the non-singular* property if whenever p is a limit point of the set A it is a limit point of A p. THEOREM 5. The space R is non-singular if and only if whenever p is a limit point of the set A, every neighborhood of p which contains C(A) contains a point of A other than p. PROOF. First, suppose there exists a neighborhood of p which includes C(A) but contains no point x of A other than p. The complement of this neighborhood is equal to A or A p\ p is a limit point of the complement of this neighborhood N and therefore N could not be a neighborhood of p, contrary to assumption. Secondly, suppose the space R were non-singular; then C(A p) which is equal to C(A)+p would be a neighborhood of p and therefore contain a point of A other than p, but this is impossible. * Dorothy McCoy, loc. cit.

404 W. O. GORDON [June, THEOREM 6. The space R is monotonie if and only if whenever p is a limit point of the set A, every neighborhood of the point p contains a point of A. This follows easily and the proof will be omitted. DEFINITION J. A space R is said to have the infinite property if whenever p is a limit point of the set A it is a limit point of the set A x,x being a set containing a single point. THEOREM 7. The space R has the infinite property if and only if whenever p is a limit point of the set A, every neighborhood of p which contains the complement of A contains an infinite number of points of A. PROOF. First, suppose there exists a neighborhood of p, N p, which contains C(A) and has only a finite number of points of the set A. Call this finite set F. Now p is a limit point of A F by hypothesis and N P = C(A F) which is equal to C(A) + F, and therefore N p must contain a point of A F by the definition of limit point, but this is impossible since N p contains only C(A) and the finite set F. Secondly, suppose p is a limit point of A+F (the set F being finite) but not of A. Then C(A) is a neighborhood of p and contains C(A+F) and hence by hypothesis must have an infinite set of points of A+F, but these must be in F, which is finite, and so we have a contradiction. DEFINITION K. TWO systems of neighborhoods {M p } and {N p } of a point p are said to be equivalent if every M p contains an N p and every N p contains an M v. THEOREM 8. If in a monotonie space R, a system of neighborhoods { M p } of the point p is equivalent to the set of all neighborhoods {Np} of p, then p is a limit point of the set S if and only if every M p contains a point of the set S. This follows easily from Theorem 6 and the proof will be omitted. CONCLUSION. It is possible to define limit point in terms of neighborhood in the following four ways, each of which is, in a sense, more special than the preceding. 1. A point p is a limit point of the set S if every neighborhood of p which contains the complement of S also contains a point of the set S.

1933-] GENERAL TOPOLOGICAL SPACES 405 2. A point p is a limit point of the set S if every neighborhood of p contains a point of the set S. 3. A point p is a limit point of the set 5 if every neighborhood of p contains a point of the set S other than p. 4. A point p is a limit point of the set S if every neighborhood of p contains an infinite number of points of the set 5. Definition 1 is the one we have used throughout. Although unusual in its form, it has the advantage that it implies no properties of limit point and hence can be used in the most general topological spaces. In particular it does not imply the monotonie property, which distinguishes it from all previous neighborhood definitions of limit point. Hence it can be used in connection with the notion of sequential limit point, which does not have the monotonie property, or with the notion of boundary point. Other non-monotonic relations between point and set will suggest themselves, which can now be treated in terms of neighborhood, using Definition 1. Definition 2 is the simplest of these definitions. It obviously implies the monotonie property. Theorem 6 shows that every monotonie space can be treated as a neighborhood space using this definition of limit point. Although Definition 2 is very simple and leads to a very neat treatment of the most general monotonic space, it does not seem to have been considered in the literature. This definition acquires added importance when it is remembered that Chittenden (loc. cit.) has shown that in the most general topological space one can redefine limit point so as to make the space monotonie. Definition 3 is one of the usual ways of defining limit point in terms of neighborhood and is used by Fréchet* for his very general F-spaces. If we use this definition the space is necessarily monotonie and non-singular. In connection with Theorem 1, Theorems 5 and 6 show that in any monotonie and nonsingular space we can define limit point in terms of neighborhood using Definition 3. Similarly Definition 4 implies the monotonie and infinite properties, and Theorems 6 and 7 show that this definition, with neighborhoods defined as suggested by Theorem 1, can be used in the most general space having these two properties. THE PENNSYLVANIA STATE COLLEGE * Les Espaces Abstraites, p. 172.