Baire Spaces and the Wijsman Topology Jiling Cao Auckland University of Technology New Zealand This is joint work with Artur H. Tomita São Paulo University,

Slides:



Advertisements
Similar presentations
Abbas Edalat Imperial College London Contains joint work with Andre Lieutier (AL) and joint work with Marko Krznaric (MK) Data Types.
Advertisements

The proof is quite similar to that of a previous result: a compact subspace of a Hausdorff is closed. Theorem: If topological X  space is compact and.
6.896: Topics in Algorithmic Game Theory Lecture 20 Yang Cai.
Lecture 7 Surreal Numbers. Lecture 7 Surreal Numbers.
Week 21 Basic Set Theory A set is a collection of elements. Use capital letters, A, B, C to denotes sets and small letters a 1, a 2, … to denote the elements.
Progressively Finite Games
Lecture 6 Hyperreal Numbers (Nonstandard Analysis)
Chaper 3 Weak Topologies. Reflexive Space.Separabe Space. Uniform Convex Spaces.
Christos alatzidis constantina galbogini.  The Complexity of Computing a Nash Equilibrium  Constantinos Daskalakis  Paul W. Goldberg  Christos H.
1 Introduction to Computability Theory Lecture12: Reductions Prof. Amos Israeli.
Screenability and classical selection principles Liljana Babinkostova Boise State University.
Selective screenability, products and topological groups Liljana Babinkostova Boise State University III Workshop on Coverings, Selections and Games in.
1 Numerical geometry of non-rigid shapes Mathematical background Mathematical background Tutorial 1 © Maks Ovsjanikov, Alex & Michael Bronstein tosca.cs.technion.ac.il/book.
I. Isomorphisms II. Homomorphisms III. Computing Linear Maps IV. Matrix Operations V. Change of Basis VI. Projection Topics: Line of Best Fit Geometry.
Introduction 0-dimensional space X is 0-dimensional iff for each open cover U of X there is a disjoint refinement that is still an open cover of X.
Copyright © Cengage Learning. All rights reserved.
CS 2210 (22C:019) Discrete Structures Sets and Functions Spring 2015 Sukumar Ghosh.
Chapter 4: A Universal Program 1. Coding programs Example : For our programs P we have variables that are arranged in a certain order: Y 1 X 1 Z 1 X 2.
Rational and Real Numbers The Rational Numbers are a field Rational Numbers are an integral domain, since all fields are integral domains What other properties.
Lecture II.  Using the example from Birenens Chapter 1: Assume we are interested in the game Texas lotto (similar to Florida lotto).  In this game,
Topological Nets and Filters Mark Hunnell. Outline 1.Motivations for Nets and Filters 2.Basic Definitions 3.Construction of Equivalence 4.Comparison and.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Department of Mathematics
Metric Topology
Teaching Students to Prove Theorems Session for Project NExT Fellows Presenter: Carol S. Schumacher Kenyon College and.
Section 1.8. Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness Proofs.
Network Systems Lab. Korea Advanced Institute of Science and Technology No.1 Appendix A. Mathematical Background EE692 Parallel and Distribution Computation.
General (point-set) topology Jundong Liu Ohio Univ.
استاد : دکتر گلبابایی In detail this means three conditions:  1. f has to be defined at c.  2. the limit on the left hand side of that equation has.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
Chapter 3 L p -space. Preliminaries on measure and integration.
Copyright © Cengage Learning. All rights reserved. CHAPTER 7 FUNCTIONS.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Mathematical Proofs. Chapter 1 Sets 1.1 Describing a Set 1.2 Subsets 1.3 Set Operations 1.4 Indexed Collections of Sets 1.5 Partitions of Sets.
CS201: Data Structures and Discrete Mathematics I
Discrete Mathematics R. Johnsonbaugh
Week 6 - Friday.  What did we talk about last time?  Solving recurrence relations.
March 24, 2006 Fixed Point Theory in Fréchet Space D. P. Dwiggins Systems Support Office of Admissions Department of Mathematical Sciences Analysis Seminar.
Naïve Set Theory. Basic Definitions Naïve set theory is the non-axiomatic treatment of set theory. In the axiomatic treatment, which we will only allude.
Chapter SETS DEFINITION OF SET METHODS FOR SPECIFYING SET SUBSETS VENN DIAGRAM SET IDENTITIES SET OPERATIONS.
Word : Let F be a field then the expression of the form a 1, a 2, …, a n where a i  F  i is called a word of length n over the field F. We denote the.
Defining Liveness by Bowen Alpern and Fred B. Schneider Presented by Joe Melnyk.
Rules of the game  You will work with your Unit 3 group  We will have 4 rounds of 6 questions each. Most are multiple choice; some are fill in the blank.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/27/2009.
Problem Statement How do we represent relationship between two related elements ?
Revision lecture MA30041: Metric Spaces. Just to become familiar with the clicker: What day of the week is today? 1.Sunday 2.Monday 3.Tuesday 4.Wednesday.
Sets Definition: A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
SECTION 9 Orbits, Cycles, and the Alternating Groups Given a set A, a relation in A is defined by : For a, b  A, let a  b if and only if b =  n (a)
Preliminaries 1. Zorn’s Lemma Relation S: an arbitary set R SXS R is called a relation on S.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
CS Lecture 26 Monochrome Despite Himself. Pigeonhole Principle: If we put n+1 pigeons into n holes, some hole must receive at least 2 pigeons.
Linear Programming Back to Cone  Motivation: From the proof of Affine Minkowski, we can see that if we know generators of a polyhedral cone, they.
Let X be a metric space. A subset M of X is said to be  Rare(Nowhere Dense) in X if its closure M has no interior points,  Meager(of First Category)
Summary of the Last Lecture This is our second lecture. In our first lecture, we discussed The vector spaces briefly and proved some basic inequalities.
Week 8 - Monday.  What did we talk about last time?  Properties of functions  One-to-one  Onto  Inverses  Cardinality.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
1-1 Copyright © 2013, 2005, 2001 Pearson Education, Inc. Section 2.4, Slide 1 Chapter 2 Sets and Functions.
Chapter 5 Limits and Continuity.
Department of Mathematics
Chapter 3 The Real Numbers.
Continuity of Darboux functions Nikita Shekutkovski, Beti Andonovic
Chapter 3 The Real Numbers.
Compactness in Metric space
Some Review Problems for Math 141 Final
Chapter 3 The Real Numbers.
Alternating tree Automata and Parity games
Chapter 3 The Real Numbers.
Chapter 5 Limits and Continuity.
Preliminaries on normed vector space
Presentation transcript:

Baire Spaces and the Wijsman Topology Jiling Cao Auckland University of Technology New Zealand This is joint work with Artur H. Tomita São Paulo University, Brazil International Conference on Topology and its Applications 2007 December 3-7, Kyoto, Japan

What is the Wijsman topology?  It originates in the study of convergence of convex sets in Euclidean space by R. Wijsman in 1960s. The general setting was developed in 1980s.  Let (X,d) be a metric space. If x is a point in X, and A is a nonempty closed subset of X: xA The gap between A and x is: d(A,x) = inf { d(a,x): a in A }.

 Define F(X) = {all nonempty closed subset of X }. If A runs through F(X) and x runs through X, we have a two-variable mapping: d(·,·): F(X) x X → R.  For any fixed A in F(X), it is well-known (and simple) that d(A,·): (X,d) → (R, T u ) is a continuous mapping.  What will happen if we consider d(·, x): F(X) → (R, T u ) for all fixed x in X ?

 The Wijsman topology T wd on F(X), is the weakest topology such that for each x in X, the mapping d(·,x) is continuous.  By definition, a subbase for the Wijsman topology is  In the past 40 years, this topology has been extensively investigated. For more details, refer to the book, “Topologies on closed and closed convex sets”, by G. Beer in 1993.

Some basic properties  The Wijsman topology is not a topological invariant.  For each A in F(X), A ↔ d(A,·): (X,d) → (R, T u ). Then, (F(X), T wd ) embeds in C p (X) as a subspace. Thus, (F(X), T wd ) is a Tychonoff space.  Theorem For a metric space (X,d), the following are equivalent: (1) (F(X), T wd ) is metrizable; (2) (F(X), T wd ) is second countable; (3) (F(X), T wd ) is first countable; (4) X is separable. (Cornet, Francaviglia, Lechicki, Levi).

Completeness properties Theorem (Effros, 1965): If X is a Polish space, then there is a compatible metric d on X such that (F(X), T wd ) is Polish. Theorem (Beer, 1991): If (X,d) is a complete and separable metric space, then (F(X), T wd ) is Polish. Theorem (Constantini, 1995): If X is a Polish space, then (F(X), T wd ) is Polish for every compatible metric d on X. Example (Constantini, 1998): There is a complete metric space (X,d) such that (F(X), T wd ) is not Čech-complete.

Baire spaces  A space X is Baire if the intersection of each sequence of dense open subsets of X is dense in X; and a Baire space X is called hereditarily Baire if each nonempty closed subspace of X is Baire. Baire Category Theorem: Every Čech-complete space is hereditarily Baire.  Concerning Baireness of the Wijsman topology, we have the following known result: Theorem (Zsilinszky, 1998): If (X,d) is a complete metric space, then (F(X), T wd ) is Baire.

Theorem (Zsilinszky, 20??): Let X be an almost locally separable metrizable space. Then X is Baire if and only if (F(X), T wd ) is Baire for each compatible metric d on X.  A space is almost locally separable, provided that the set of points of local separability is dense. In a metrizable space, this is equivalent to having a countable- in-itself π-base. Corollary (Zsilinszky, 20??): A space X is separable, metrizable and Baire if and only if (F(X), T wd ) is a metrizable and Baire space for each compatible metric d on X.

 Motivated by the previous results, Zsilinszky posed two open questions. The first one is: Question 1 (Zsilinszky, 1998): Suppose that (X,d) is a complete metric space. Must (F(X), T wd ) be hereditarily Baire?  Therefore, the answer to Question 1 is negative. Theorem (Chaber and Pol, 2002): Let X be a metrizable space such that the set of points in X without any compact neighbourhood has weight. Then for any compatible metric d on X, embeds in (F(X), T wd ) as closed subspace. In particular, the Wijsman hyperspace contains a closed copy of rationals.

 The second question was posed by Zsilinszky at the 10 th Prague Toposym in Question 2 (Zsilinszky, 2006): Suppose that (X,d) is a metric hereditarily Baire space. Must (F(X), T wd ) be Baire?  The main purpose of this talk is to present an affirmative answer to Question 2. To achieve our goal, we shall need three tools:  The ball proximal topology on F(X).  The pinched-cube topology on the countable power of X.  A game-theoretic characterization of Baireness.

The ball proximal topology  For each open subset E of X, we define The ball proximal topology T bpd on F(X) has a subbase where  In general, T wd is coarser than but different from T bpd on F(X). Thus, the identity mapping i : (F(X), T bpd ) → (F(X), T wd ) is continuous, but is not open in general.

 For each nonempty open subset U in (F(X), T bpd ), i (U) has nonempty interior in (F(X), T wd ).  A mapping f: X → Y is called feebly open if f(U) has nonempty interior for every nonempty open set U of X.  Similarly, a mapping f: X → Y is called feebly continuous whenever the pre-image of an open set is nonempty, the pre- image has a nonempty interior. Theorem (Frolik, 1965; Neubrunn, 1977): Let f: X → Y be a feebly continuous and feebly open bijection. Then X is Baire if and only if Y is Baire. Theorem (Zsilinszky, 20??): Let (X,d) be a metric space. Then (F(X), T bpd ) is Baire if and only if ( F(X), T wd ) is Baire.

The pinched-cube topology  The idea of pinched-cube topologies originates in McCoy’s work in  The term was first used by Piotrowski, Rosłanowski and Scott in  Let (X,d) be a metric space. Define ∆ d = { finite unions of proper closed balls in X }.  For B in ∆ d, and U i (i < n) disjoint from B, we define The collection of sets of this form is a base for a topology T pd on, called the pinched-cube topology.

Theorem (Cao and Tomita): Let (X,d) be a metric space. If with T pd is Baire, then (F(X), T bpd ) is Baire.  Let be the subspace of (F(X), T bpd ) consisting of all separable subsets of X. Define by letting It can be checked that f is continuous, and feebly open. Then, it follows that (F(X), T bpd ) is Baire.

 Now, we consider the Choquet game played in X.  There are two players, β and α, who select nonempty open sets in X alternatively with β starting first: We claim that α wins a play if Otherwise, we say that β has won the play already.  Without loss of generality, we can always restrict moves of β and α in a base or π-base of X. The Choquet game

 Baireness of a space can be characterized by applying the Choquet game. Theorem (Oxtoby, Krom, Saint-Raymond): A space X is not a Baire space if and only if β has a winning strategy.  This theorem was first given by J. Oxtoby in Then, it was re-discovered by M. R. Krom in 1974, and later on by J. Saint-Raymond in  By a strategy for the player β, we mean a mapping defined for all finite sequences of moves of α. A winning strategy for β is a strategy which can be used by β to win each play no matter how α moves in the game.

Theorem (Cao and Tomita): Let (X,d) be a metric space. If with the Tychonoff topology is Baire, then with T pd is also Baire.  The basic idea is to apply the game characterization of Baireness. Suppose that with the Tychonoff topology is Baire. Pick up any strategy σ for β in T pd. Suppose that with the Tychonoff topology is Baire. Pick up any strategy σ for β in T pd. We apply σ to construct inductively a strategy Θ for β in the Tychonoff topology. Since Θ is not a wining strategy for β in the Tychonoff topology, it can be show that σ is not a winning for β in T pd either. Main results

Theorem (Cao and Tomita): Let (X,d) be a metric and hereditarily Baire space. Then (F(X), T wd ) is Baire.  Note that the Tychonoff product of any family of metric hereditarily Baire spaces is Baire (Chaber and Pol, 2005). It follows that with the Tychonoff topology is Baire, and thus with T pd is Baire. By one of the previous theorems, (F(X), T pd ) is a Baire space. Finally, by another previous theorem, (F(X), T wd ) is Baire.

Comparison and examples  For a space X, recall that the Vietoris topology T v on F(X) has as a base, where  The relationship between the Vietoris topology and the Wijsman topologies is given in the next result. Theorem (Beer, Lechicki, Levi, Naimpally, 1992): Let X be a metrizable space. Then, on F(X), T v = sup { T wd : d is a compatibe metric on X }. T v = sup { T wd : d is a compatibe metric on X }.

 For a metric space (X,d), we have the following diagram: Baire Baire (F(X), T V ) Baire (F(X), T wd ) Baire (F(X), T V ) Baire (F(X), T wd ) Baire Baire Baire

Example (Pol, 20??): There is a separable metric (X,d) which is of the first Baire category such that (F(X), T wd ) is Baire.  Consider equipped with the metric defined by Let be the subspace consisting of sequences which are eventually equal to zero. This subspace is of the first Baire category. The product space is a separable metric space which is of the first Baire category. It can be shown that (F(X), T wd ) is Baire.

Example (Cao and Tomita): There is a metric Baire space (X,d) such that (F(X), T wd ) is Baire, but with the Tychonoff topology is not Baire.  Let be a family of disjoint stationary subsets of. For each, we put. Let be the metric space defined before. On, we consider the metric defined by Then, the required space will be equipped with the product metric from.

Thank You