QUOTIENT AND PSEUDO-OPEN IMAGES OF SEPARABLE METRIC SPACES

Similar documents
Topology and its Applications

On first and second countable spaces and the axiom of choice

Introduction to Computational Manifolds and Applications

CSE 20 DISCRETE MATH. Fall

SOLUTIONS FOR PROBLEM SET 4

BAND SURGERY ON KNOTS AND LINKS, III

Outline. Sets of Gluing Data. Constructing Manifolds. Lecture 3 - February 3, PM

TOPOLOGY, LIMITS OF COMPLEX NUMBERS. Contents 1. Topology and limits of complex numbers 1

DVA325 Formal Languages, Automata and Models of Computation (FABER)

Unique Sequences Containing No k-term Arithmetic Progressions

Zhanjiang , People s Republic of China

Solutions for the Practice Questions

The Strong Finiteness of Double Mersenne Primes and the Infinity of Root Mersenne Primes and Near-square Primes of Mersenne Primes

Ky Fan minimax inequalities for set-valued mappings

ON MODULI FOR WHICH THE FIBONACCI SEQUENCE CONTAINS A COMPLETE SYSTEM OF RESIDUES S. A. BURR Belt Telephone Laboratories, Inc., Whippany, New Jersey

KY FAN S INEQUALITIES FOR VECTOR-VALUED MULTIFUNCTIONS IN TOPOLOGICAL ORDERED SPACES

ON SPLITTING UP PILES OF STONES

Carmen s Core Concepts (Math 135)

Finite and Infinite Sets

Cardinality revisited

Countability. Jason Filippou UMCP. Jason Filippou UMCP) Countability / 12

#A13 INTEGERS 15 (2015) THE LOCATION OF THE FIRST ASCENT IN A 123-AVOIDING PERMUTATION

ON COMMUTATION PROPERTIES OF THE COMPOSITION RELATION OF CONVERGENT AND DIVERGENT PERMUTATIONS (PART I)

Pattern Avoidance in Unimodal and V-unimodal Permutations

Variations on a Theme of Sierpiński

NON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday

Sets. Definition A set is an unordered collection of objects called elements or members of the set.

Cardinality of Accumulation Points of Infinite Sets

MATHEMATICS 152, FALL 2004 METHODS OF DISCRETE MATHEMATICS Outline #10 (Sets and Probability)

1. The empty set is a proper subset of every set. Not true because the empty set is not a proper subset of itself! is the power set of A.

Cardinality. Hebrew alphabet). We write S = ℵ 0 and say that S has cardinality aleph null.

The Cauchy Criterion

A theorem on the cores of partitions

18 Completeness and Compactness of First-Order Tableaux

arxiv: v3 [math.co] 4 Dec 2018 MICHAEL CORY

Classes of permutations avoiding 231 or 321

Göttlers Proof of the Collatz Conjecture

Math 127: Equivalence Relations

Formal Verification. Lecture 5: Computation Tree Logic (CTL)

Permutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors.

Restricted Permutations Related to Fibonacci Numbers and k-generalized Fibonacci Numbers

1. Functions and set sizes 2. Infinite set sizes. ! Let X,Y be finite sets, f:x!y a function. ! Theorem: If f is injective then X Y.

Non-overlapping permutation patterns

Some Fine Combinatorics

Simple permutations and pattern restricted permutations

MAT 243 Final Exam SOLUTIONS, FORM A

Discrete Math Class 4 ( )

Finite homomorphism-homogeneous permutations via edge colourings of chains

Measure Preserving Isomorphisms

SYMMETRIES OF FIBONACCI POINTS, MOD m

The tenure game. The tenure game. Winning strategies for the tenure game. Winning condition for the tenure game

A Combinatorial Proof of the Log-Concavity of the Numbers of Permutations with k Runs

Tilings with T and Skew Tetrominoes

arxiv: v2 [math.pr] 20 Dec 2013

1.6 Congruence Modulo m

Final exam. Question Points Score. Total: 150

Permutation Tableaux and the Dashed Permutation Pattern 32 1

MATH 225: Foundations of Higher Matheamatics. Dr. Morton. Chapter 2: Logic (This is where we begin setting the stage for proofs!)

Applications of Fermat s Little Theorem and Congruences

LUCAS-SIERPIŃSKI AND LUCAS-RIESEL NUMBERS

The congruence relation has many similarities to equality. The following theorem says that congruence, like equality, is an equivalence relation.

Primitive Roots. Chapter Orders and Primitive Roots

LEFT ZEROID AND RIGHT ZEROID ELEMENTS OF SEMIRINGS

Odd king tours on even chessboards

CHARACTERIZATION OF RINGS USING QUASIPROJECTIVE MODULES. II

Primitive permutation groups with finite stabilizers

Corners in Tree Like Tableaux

CLASS NOTES. A mathematical proof is an argument which convinces other people that something is true.

Bishop Domination on a Hexagonal Chess Board

Minimal tilings of a unit square

Modular Arithmetic. Kieran Cooney - February 18, 2016

Determinants, Part 1

Wilson s Theorem and Fermat s Theorem

Periodic Complementary Sets of Binary Sequences

Enumeration of Two Particular Sets of Minimal Permutations

Permutations and codes:

PRIMES IN SHIFTED SUMS OF LUCAS SEQUENCES. Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania

Domination game and minimal edge cuts

THE GAME CREATION OPERATOR

International Journal of Mathematical Archive-5(6), 2014, Available online through ISSN

An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g.,

Strongly nonlinear elliptic problem without growth condition

Perfect Difference Families and Related Variable-Weight Optical Orthogonal Codess

Introduction to Modular Arithmetic

December 12, W. O r,n r

To be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we. The first (and most delicate) case concerns 2

The Hex game and its mathematical side

PERMUTATIONS AS PRODUCT OF PARALLEL TRANSPOSITIONS *

Error-Correcting Codes for Rank Modulation

arxiv:math/ v1 [math.cv] 12 Dec 2005

Class 8 - Sets (Lecture Notes)

ALGEBRA: Chapter I: QUESTION BANK

A NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA

A CONJECTURE ON UNIT FRACTIONS INVOLVING PRIMES

Some t-homogeneous sets of permutations

Notes for Recitation 3

THE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS

Math236 Discrete Maths with Applications

arxiv: v1 [math.co] 24 Nov 2018

On shortening u-cycles and u-words for permutations

Transcription:

proceedings of the american mathematical society Volume 33, Number 2, June 1972 QUOTIENT AND PSEUDO-OPEN IMAGES OF SEPARABLE METRIC SPACES PAUL L. STRONG Abstract. Ernest A. Michael has given a characterization of the regular quotient images of separable metric spaces. His result is generalized here to a characterization of the Tl quotient images of separable metric spaces (which are the same as the Tt quotient images of second countable spaces). This result is then used to characterize the HausdorfF pseudo-open images of separable metric spaces. 1. Introduction. A space is a k-space if a subset F is closed whenever F(~\K is closed in K for every compact set K. A space is sequential if a subset Fis closed whenever no sequence in F converges to a point not in F. A space is Fréchet if for each subset A and point x e cl A, there is a sequence in A converging to x. (It is easy to see that first countable spaces are Fréchet, Fréchet spaces are sequential, and sequential spaces are fc-spaces.) A network in a space [1] is a collection of subsets cp such that given any open subset U and xeu, there is a member P of cp such that x e F<= U. A k-network (called a pseudobase by Michael [5]) is a collection of subsets cp such that given any compact subset K and any open set U containing K, there is a P e cp such that K^P^i U.x A cs-network [4] is a collection of subsets cp such that given any convergent sequence xn->-x and any open set U containing x, there is a P e cp and a positive integer m such that {x}u{;cn n=/w}<=pc: U. (Note that any /c-network is a cj-network, which is in turn a network, and any cs-network cp which is closed under finite unions satisfies the property that given any convergent sequence x ->-x and any open U containing {x}kj{xn\n=\, 2, }, there is a Peep such that {x}kj{xn}<=p<= U.) Received by the editors March 31, 1971. AMS 1970 subject classifications. Primary 54C10, 54D55; Secondary 54D50, 54E99. Key words and phrases. Fréchet spaces, sequential spaces, network, -network, cs-network, X0-spaces, sequence-covering mappings, quotient mappings, pseudo-open mappings, separable metric spaces, second countable spaces. 1 Paul O'Meara's definition of a -network (Proc. Amer. Math. Soc. 29 (1971), 183-189) requires only that there be a finite union R of members of <p such that K^R^U. Clearly, a space with a countable -network in this sense has one in our sense, and conversely. 582 American Mathematical Society 1972

IMAGES OF SEPARABLE METRIC SPACES 583 Theorem 1. The following properties of a Tx-space X are equivalent: (a) X is a sequential space with a countable k-network. (b) X is a sequential space with a countable cs-network. (c) X is a quotient space of a separable metric space. (d) X is a quotient space of a second countable space. For a Hausdorff space X, these properties are equivalent to (e) X is a k-space with a countable k-network. Michael used property (e) to characterize the regular quotient images of separable metric spaces [5, Corollary 11.5, p. 999].2 His proof remains valid for Hausdorff spaces. Theorem 2. The following properties of a Hausdorff space X are equivalent : (a) X is a Fréchet space with a countable k-network. (b) X is a Fréchet space with a countable cs-network. (c) X is a pseudo-open image of a separable metric space. (d) X is a pseudo-open image of a second countable space. All mappings are assumed to be continuous and onto unless otherwise noted. Many of the ideas used in proving Theorem 1 can be found in [5]. The author would like to thank his teachers, Professors M.-E. Hamstrom and Ross L. Finney, for their advice and encouragement. He is also indebted to the referee, whose suggestions were extremely helpful. 2. Proof of Theorem 1. The following result, which is analogous to [5, Proposition 2.1, p. 984], will be needed. Proposition 3. If X is a Tx sequential space with a countable csnetwork, then X has a countable k-network. In fact, any Tx quotient space of X is a sequential space with a countable k-network Proof. We prove the second statement, from which the first trivially follows. Let/: X-*- F be a quotient mapping where Y is Tv Since every quotient space of a sequential space is sequential [2, Proposition 1.2, p. 109], we need only show that Y has a countable -network. Let y be a countable cj-network for X which is closed under finite unions. We shall show that cp={f(b)\b e y) is a -network for Y. Let K he a compact subset of Y contained in an open set U. Letf(Bi), f(b2), be the members of cp which are contained in U, and let An f(bx)kj- KJf(Bn). Since cp clearly forms a network in Y, we know that Xe U L4»}- We need to show that K^An-f(Bx^- -U5J for some n. 1 Michael calls a regular space with a countable -network an X0-space.

584 P. L. STRONG [June Assume the contrary and choosey in K An for each n. Since K<= \J {An} and since the A 's are increasing, the set S={yn} is infinite. Since K is compact, this set has a cluster pointy in K, so that S {y'} is not closed in K, and hence not in U. Now f\f~1(u) is a quotient mapping since U is open, so f~xis {y'}) is not closed in f~xiu). Since open subsets of sequential spaces are sequential [2, Proposition 1.9, p. 110], there exists a sequence {xk} in f~x(s {y'}) converging to a point x in f~x(u) f~x(s {/}). Since Y is 7\, each/-1(y ) is closed, and so the sequence {xk} must contain points from infinitely many of the f~xiyn)- Now {x}u{xk} is a convergent sequence contained in an open set f~l(u), hence we can find a member Bey such that {x}kj{xk}<=-b<=.f~l(u). Then f(b)<^u, so B=B for some n. But this implies that An contains infinitely many of the yn's, contradicting our choice of them above. This contradiction shows that cp is a Ac-network in Y. We shall also use the following result, whose proof is due to Michael [5, Proposition 10.2, p. 994]. Proposition 4 (Michael). A T0-space has a countable network if and only if it is a continuous image of a separable metric space. The following analogues of compact-covering maps and kix) [5, p. 990] will be used. A mapping/: X-+Y is sequence-covering [6] if, given any convergent sequence yn->y0 in Y, there exists a convergent sequence xn-*x0 in X such that fixn)=y, n=0, 1, 2,. Given a space X, let ax [3, p. 52] be the set X with topology consisting of the sequentially open3 sets of X. The following facts are easily checked: (1) ax is a sequential space. (2) A' is a sequential space iff X=aX. (3) X and ox have the same convergent sequences. (4) If/: X-* Y is continuous, then so is the induced function/, : ax~*a Y. (If U is sequentially open in Y,f~x(U) is sequentially open in X.) The following result is analogous to [5, Lemma 11.2, p. 998] and has a straightforward proof due to Siwiec [6, Theorem 4.1]. Proposition 5. Any sequence-covering mapping whose range is sequential is a quotient mapping. Finally, we have the following analogue to [5, Theorem 11.4, p. 998]. 3 A subset U of X is sequentially open if each sequence in X converging to a point in U is eventually in U.

1972] IMAGES OF SEPARABLE METRIC SPACES 585 Theorem 6. The following properties of a Tx-space are equivalent: (a) X has a countable cs-network. (b) X is the image, under a sequence-covering mapping, of a separable metric space. (c) ax is the image, under a sequence-covering quotient mapping, of a separable metric space. (d) ax is a quotient space of a separable metric space. (e) cx is a quotient space of a second countable space. The proof is analogous to Michael's: (a) >-(b). Let X be a F0-space with a countable «-network cp. Let S={0}'vJ{1/m ;i=1, 2, } with topology inherited from the real line. Let Xs be the set of mappings from 5 into X (i.e., the set of convergent sequences in X) with the compact-open topology. Then Xs is a F0-space with a countable network. (Letting y be a countable basis for 5 which is closed under finite unions, the set of finite intersections of sets of the form {u e Xs\u(c\ 0cF}, where Qey and P e cp, form a network for Xs.) Hence, by Proposition 4, there exists a separable metric space M and a mapping g: M->-Xs. Let co : Xs x S-+X be the evaluation mapping w(u, s)=u(s). (co is continuous since S is compact.) It is easily checked that/=«o(gx ls) is a sequence-covering mapping from M x S to X. (b)-»(c). This follows easily from the facts about ax quoted above and from Proposition 5. (c) (d) (e). Obvious. (e)-"(a). By Proposition 3, ax has a countable cr-network which, by fact (3) above, is also a countable es-network for X. Proof of Theorem 1. All implications except (e)->-(a) are either obvious or follow trivially from Theorem 6 or Proposition 3. (e)-»-(a). Let X be a Hausdorff -space with a countable -network cp. We must show that X is sequential. If fcx is not closed, then there is a compact subset K of X such that Fr\K is not closed in K. Since {KC\P\P e cp} is a countable -network for K, K is a metric space [4, Property C, p. 983]. ({\ntk(kc\p)\p e cp} is a countable basis for K.) Since F Hi K is not closed in K, there exists a sequence in Ft~\K converging to a point in K (FC\K). Hence we have a sequence in F converging to a point not in F. 3. Proof of Theorem 2. We shall use the following proposition which has an easy proof due to S. P. Franklin (see [2, Proposition 2.3, p. 113]). Proposition 7. (i) Iff:X-> Y is a quotient mapping and Y is Hausdorff and Fréchet, then f is pseudo-open, (ii) // X is Fréchet and f:x-*y is pseudo-open, then Y is Fréchet.

586 P. L. STRONG Proof of Theorem 2. (a)->-(b). Obvious. (b)-»-(c). If X is a Fréchet space with a countable cs-network, then, by Theorem 1, there exists a separable metric space M and a quotient mapping/: M->X. By Proposition 7,/is pseudo-open. (c)»(d). Obvious. (d)-»-(a). If X is a pseudo-open image of a second countable space, then X is Fréchet by Proposition 7, and X has a countable /c-network by Theorem 1. References 1. A. V. Arhangel'skil, Mappings and spaces, Uspehi Mat. Nauk 21 (1966), no. 4 (130), 133-184 = Russian Math. Surveys 21 (1966), no. 4, 115-162. MR 37 #3534. 2. S. P. Franklin, Spaces in which sequences suffice, Fund. Math. 57 (1965), 107-115. MR 31 #5184. 3. -, Spaces in which sequences suffice. II, Fund. Math. 61 (1967), 51-56. MR 36 #5882. 4. Joe A. Guthrie, A characterization ofh0-spaces, Gen. Topology Appl. 1 (1971), 105-110. 5. E. A. Michael, H -spaces, J. Math. Mech. 15 (1966), 983-1002. MR 34 #6723. 6. Frank Siwiec, Sequence-covering and countable bi-quotient mappings, Gen. Topology Appl. 1 (1971), 143-154. Department of Mathematics, Bucknell University, Lewisburg, Pennsylvania 17837