Classes of Baire spaces defined by topological games
Abstract
The article studies topological games that arise in the study of the continuity of operations in groups with topology, such as paratopological and semitopological groups. These games are modifications of the Banach–Mazur game.
Given a two-player game of the Banach–Mazur type, we define -Baire, -nonmeager and -spaces. A space is a -Baire if the second player does not have a winning strategy in . The classes of -nonmeager spaces and -spaces are defined similarly, with the help of modifications of the game .
For the games under consideration, equivalent games are found, which facilitates studying the relationship between the resulting classes of spaces and determining which spaces belong to these classes. For this purpose, we introduce a modification of the Banach–Mazur game with four players.
Results of this paper find application in the study the continuity of operations in groups with topology.
keywords:
Baire space , nonmeager space , topological games , classes of Baire spaces ,MSC:
[2010] 54B10 , 54C30 , 54C05 , 54C201 Introduction
A space is called Baire (nonmeager) if for any family of open dense subsets the intersection is dense in (nonempty).
Baire spaces play an important role in mathematics. Particularly strong results have been obtained in the class of metric spaces. We note the following two results, in which, in addition to being Baire, an important role is played by metrizability.
- 1.
- 2.
To extend these results from metric spaces to larger classes of spaces, topological games are widely used. An important role in applications of the Baire property is played by topological games that are modifications of the Banach–Mazur game [6, 7], with the help of which a characterization of Baire spaces, the Banach–Oxtoby theorem, was proved (see the Theorem 2): a space is Baire if and only if the second player has no winning strategy in the game .
A standard scheme for extending results of the first and second types from metric Baire spaces to larger classes is as follows.
-
1.
A modification of the game is defined so that, for the class of spaces on which the player in the game does not have a winning strategy, theorems known for metrizable Baire spaces remain valid.
-
2.
Spaces from the class are found. As a rule, these are Baire spaces from some ’traditional’ class of spaces . Then, theorems that: if is a Baire space, then are proved.
In this paper, the class is a subclass of the class of Baire spaces obtained by using a modification of the Banach–Mazur game . We refer to spaces in this class as -Baire spaces; see Section 4. A space is -Baire if player does not have a winning strategy in . The classes of -nonmeager spaces and -spaces are defined similarly, with the help of modifications of the game .
If is a Baire space and is a -space, then is a -Baire space (Proposition 15). Exploring -spaces is much easier than -Baire spaces. Some of the -spaces are described in Theorem 4. Proposition 15 and Theorem 4 allow us to find -Baire spaces. The author does not know if there is a -Baire space that is not a -space; see Problem 1 (1).
For the games under consideration, equivalent games are found, which facilitates studying the relationship between the resulting classes of spaces and determining which spaces belong to these classes. For this purpose, we introduce a modification of the Banach–Mazur game with four players; see Section 6.
The concept of a Baire space is closely related to the concept of a nonmeager space.
Theorem 1.
-
(1)
Baire spaces are nonmeager.
-
(2)
An open subset of a Baire space is a Baire space.
-
(3)
A space is Baire if and only if every open subspace of is a nonmeager space.
-
(4)
A space is nonmeager if and only if there exists an open nonempty Baire subspace of .
-
(5)
A homogeneous nonmeager space is a Baire space.
In the article, generalizations of Baire and nonmeager spaces are constructed in parallel, and the relationships (1)–(5) between Baire and nonmeager spaces are checked.
In [8, 9] the -Baire property was found, which implies the continuity of operations in groups. The -Baire property is defined with the help of semineighborhoods of the diagonal. Paper [10] also contains properties of Baire type, which are defined by using semineighborhoods of the diagonal. It establishes a relationship between the generalizations of the Baire property obtained with the help of topological games in this paper and those obtained with the help of semineighborhoods of the diagonal.
The results of this paper are used in [11] to study the continuity of group operations in right-topological groups.
2 Definitions and notation
The sign will be used for equality by definition.
2.1 Definitions and notation from set theory
The family of all subsets of a set is denoted by . The family of all nonempty subsets of a set is denoted by : .
If is a subset of a set , then we denote by the complement to . We use this notation in situations where it is clear from the context which set is meant.
An indexed set is a function on such that for . If the elements of an indexed set are themselves sets, then is also called an indexed family of sets; is a function on : for . For a nonempty , we denote
The projection from onto will be denoted by . We assume that if is the empty set:
The Cartesian product is the set of functions defined on the set such that for all . We denote
Let . As is customary in set theory, we identify a function with its graph. If and , then is the function defined by
Let us introduce a special notation for when and are functions:
Functions with a finite domain are sets of the form
for . We will use the notation
In particular,
2.2 Definitions and notation from topology
We denote by the set of all homeomorphisms of the space onto itself.
A subset of a topological space is called locally dense, or nearly open, or preopen if .
Let . If is the union of a countable number of nowhere dense sets, then is called a meager set. Nonmeager sets are called sets of the second Baire category. A subset of is said to be residual, or comeager, if is a meager set.
A space is called a space of the first Baire category, or a meager spaces, if the set is of the first Baire category in the space . A space is called a space of the second Baire category, or nonmeager spaces, if is not a meager space. A space in which every residual set is dense is called a Baire space. A space is nonmeager if and only if some open subspace is a Baire space.
A family of nonempty subsets of is called a -net if for any open nonempty there exists an such that .
A -network consisting of open sets is called a -base.
A subset is said to be regular open if .
A space is called quasi-regular if for every nonempty open there exists a nonempty open such that .
A space is semiregular if has a base consisting of regular open sets.
A space is called -semiregular [12] (or nearly regular [13]) if has a -base consisting of regular open sets.
For a cardinal , a set is called a set of type if is an intersection of open sets. A space is called an absolute space if is of type in some compact extension.
A space is regular at a point if for any neighborhood of the point there exists a neighborhood such that .
A space is semiregular at a point if there is a base at the point consisting of regular open sets.
A space is feebly compact if any locally finite family of open sets is finite.
For and we denote
A space is called developable if there exists a sequence of open covers such that for any the family is a base at the point .
A family of open nonempty sets in is called an outer base of if for each and for each open there exists a such that .
If is a sequence of subsets of a space , then the set
is called the upper limit of the sequence of sets .
If is a sequence of points in the space , then we denote
We denote by the space of ultrafilters on , the Stone-Čech extension of the discrete space . We denote by — the set of nonprincipal ultrafilters.
Let be a sequence of points in a space , and let be a nonprincipal ultrafilter. A point is called the -limit of a sequence if for any neighborhood of . We will write for the -limit .
3 Modifications of the Banach-Mazur game
In this section, we use topological games; the basic concepts and terminology for them can be found in [14, 15, 16, 8, 9]. A precise definition of a game is given in Section 6. In this section, we assume that there are two players, and . Let be a game in which a player has a winning strategy. Let us call this game -favorable. If there is no such strategy, then is a -unfavorable game.
If the definition of the game depends on only one parameter, namely, some space , that is, , then we say that the space is -favorable if the game is -favorable and the space is -unfavorable if the game is is -unfavorable.
Let and be two games with players and . We say that the games and are equivalent if the game is -favorable if and only if the game is -favorable for all . We will write for equivalent games.
Let be a space. We set and denote
We put
Let be some -base of the space . Let us define as follows. For we put
Obviously, , and if the space is quasiregular, then .
Games and
Let and . There are two players, and . These games differ in the first move of a player . On the first move, player chooses in the game and in the game . Player chooses . On the th move, chooses and chooses . After a countable number of moves, the winner is determined: player wins if .
We put
Definition 1.
Let be a space. A family is called monolithic if the following condition is satisfied:
-
Let and . If for , then .
Remark 1.
Proposition 1.
Let be a space, , . If is a monolithic family, then
Remark 2.
Let
Games and
Let be a -net of . Take and . There are two players, and . These games are distinguished by the first move of player . On the first move, chooses in and in . Player chooses and , . On th move chooses and chooses and , . After a countable number of moves, the winner is determined: player wins if .
We put
Definition 2.
Let be a space. A family is called monolithic if the following condition is satisfied:
-
Let and . If for , then .
Proposition 2.
Let be a space, be a -net of , , . If is a monolithic family, then
Let . We put
Proposition 3.
If is a space, , -net of , and , then
Proof.
For the outcome of the games and does not depend on the choice of , so the strategies from the games and are suitable for the games and . ∎
Proposition 3 shows that () games are a special case of () games.
Proof of Proposition 1.
Proposition 4.
Let be a space. Suppose that , , and are -nets of the space , and the following conditions are met:
-
(1)
for there is an such that and for there is an such that ;
-
(2)
if and for , then .
Then
Proof.
Fix and so for and for .
Suppose that the player in the game has a winning strategy . Let us describe a winning strategy for in the game . We put
Let player in the game have a winning strategy . Then a winning strategy for in the game is as follows. On the th move player chooses an open and , , . We put
For the game the proof is similar. ∎
Definition 3.
A strategy of player in games will be called regular if for .
Proposition 5.
Let be a quasi-regular space, be one of the games , , , , where , be a -net of , , and be monolithic families.
-
(1)
If has a winning strategy in , then there is a winning regular strategy.
-
(2)
Suppose that player has chosen a strategy in and player has a strategy that outperforms the strategy . Then player has a regular strategy that outperforms the strategy .
4 Generalization of Baire and nonmeager spaces through games
Let be a space, . We denote
We put . This is the classical Banach–Mazur game. We put .
Theorem 2 (Banach–Oxtoby [14]; see also [15, 16]).
Let be a space.
-
(1)
is Baire if and only if is -unfavorable;
-
(2)
is nonmeager if and only if is -unfavorable.
Definition 4.
Let be a space, let and let . We say that the space is
-
1.
-nonmeager if is -unfavorable;
-
2.
-Baire if is -unfavorable;
-
3.
a -space if is -favorable.
Proposition 6.
Let be a space and let .
-
(1)
If is -nonmeager, then is -nonmeager.
-
(2)
If is -Baire, then is -Baire.
-
(3)
If is a -space, then is a -space.
Proof.
In the games and player i uses the strategy from the games and , respectively. ∎
Proposition 7.
Let be a space, and let be a monolithic family.
-
(1)
If is nonmeager and is a -space, then is -nonmeager.
-
(2)
If is a Baire space and is a -space, then is a -Baire space.
Remark 3.
In [16] Theorem 4.3 was proved, which is similar to 7. The paper [16] considered the game , which differs slightly from by the payoff function: in the game player wins if , and in the game , if . For used in most of applications, the games and are equivalent. Below, after Proposition 10, we give another proof of Proposition 7.
We put
Definition 5.
Let be a space, be a -net , and . We say that the space
-
1.
-nonmeager if is -unfavorable;
-
2.
-Baire if is -unfavorable;
-
3.
a -space if is -favorable.
Proposition 8.
Let be a space, be -nets , and .
-
(1)
If is -nonmeager, then is -nonmeager.
-
(2)
If is -Baire, then is -Baire.
-
(3)
If is a -space, then -space.
Proof.
In the games and player uses the strategy from the games and , respectively. ∎
For we set
Proposition 9.
Let be a space, -network , , and .
-
(1)
If is -nonmeager, then is -nonmeager.
-
(2)
If is -Baire, then is -Baire.
Proof.
Statement (1) is equivalent to saying that if is -favorable, then is -favorable. The strategy for in the game is that chooses according to the winning strategy in the game and , , arbitrarily. Statement (2) can be proved in the same way as (1). ∎
Proposition 10.
Let be a space, be a -net , and be a monolithic family.
-
(1)
If is nonmeager and is a -space, then is -nonmeager.
-
(2)
If is a Baire space and is a -space, then is a -Baire space.
Remark 4.
Proof of Proposition 7.
Let , , and . Proposition 3 implies that the games , and are equivalent to the games , and , respectively. Consequently, the properties of being -nonmeager, -Baire, and -spaces coincide with the properties of being -nonmeager, -Baire, and -spaces, respectively. The fact that is monolithic implies that is monolithic. Now Proposition 7 follows from Proposition 10. ∎
For we define the families . We say that a sequence belongs to if condition is met:
-
;
-
there is a sequence such that
-
for and for every there is an such that .
-
Note that if is a regular space, then the condition is equivalent to the condition
-
-
for , the subspace is compact and .
-
We denote
A sequence is included in if and only if .
We put
Note that
-
1.
if and only if and for any sequence , for of open nonempty sets we have ;
-
2.
if and only if and for any sequence of points , for , we have .
The following proposition is easily verified.
Proposition 11.
For any space the families and are monolithic for and .
For we define the games
where | |||||
For and we define the games
where | |||||
Definition 6.
Let be a space, . We say that the space
-
1.
-nonmeager if is -unfavorable;
-
2.
-Baire if is -unfavorable;
-
3.
a -space if is -favorable.
The class of -spaces will be denoted as .
Let and . We say that the space
-
1.
-nonmeager if is -unfavorable;
-
2.
-Baire if is -unfavorable;
-
3.
a -space if is -favorable.
The class of -spaces will be denoted as .
Definition 7.
Let be a space and let . We say that a point is -point if there exists a such that .
Recall that a point is called a -point if there exist a such that and any sequence , for , accumulates to some point; see [17]. If is a regular space, then is a -point if and only if is a -point. Spaces of point-countable type are precisely spaces in which each point is a -point. A point is a -point if and only if this point has a countable base.
The following proposition is a direct consequence of the definitions.
Proposition 12.
Let be a space, and let . If is a -nonmeager (-Baire) space, then there are -points in (the set of -points is dense in ).
Definition 8 ([8, 9]).
Let be a space, and let . We call -dense if and for any countable family of open subsets of the family is locally finite if and only if the family is locally finite in .
For a Tychonoff , is -dense in if and only if is dense in and -embedded in .
Proposition 13 ([8, 9]).
If is a quasi-regular space, then . Let .
-
(1)
If is a -nonmeager (-Baire) space, then is a -nonmeager (-Baire) space.
-
(2)
Let be a quasi-regular space and be -dense in . A space is -nonmeager (-Baire) if and only if is -nonmeager (-Baire).
Proof.
(1) Each strategy of player in the game on is assigned a strategy on . Let be the open subsets of constructed on the th move. According to the strategy on , the player chooses a set open in depending on the sets . The open set is chosen in such a way that and . If wins the game, then it wins the game as well.
(2) By virtue of (1), it suffices to show that if is -dense in , then if is a -nonmeager (-Baire) space, then so is . By Proposition 5, has a regular strategy on . The regular strategy of player in the game on is associated with the strategy on . Let open sets of the space be constructed on the th move. In accordance with the strategy on , player chooses a set open in depending on the sets . We set . If wins the game, then it wins the game as well. ∎
Proposition 14.
Let be a space. In the diagrams below, the arrow
means that
-
(1)
if is an -nonmeager space, then is a -nonmeager space;
-
(2)
if is an -Baire space, then is a -Baire space;
-
(3)
if is an -space, then is a -space.
The bottom arrow means that -nonmeager and -Baire imply nonmeager and Baire.
5 and spaces
In this section, we study and spaces. The relationship between these spaces is shown by the following statement, which follows from Propositions 7 and 10.
Proposition 15.
Let be a space, and let , where , and .
-
(1)
If is nonmeager and is a -space, then is -nonmeager.
-
(2)
If is a Baire space and is a -space, then is a -Baire space.
Proposition 16.
If is a space, , , and , then
where and . If is a -base in , then , and if the space is quasi-regular, then . Moreover, the following assertions hold:
-
(1)
if and only if is -favorable.
-
(2)
if and only if is -favorable.
-
(3)
if and only if is -favorable if and only if is -favorable, where .
-
(4)
if , then for any there exists a winning strategy for player such that the following condition is satisfied: if player chooses at step , then chooses .
-
(5)
if , then for any there exists a winning strategy for player such that the condition is satisfied: if player chooses at step , then chooses .
-
(6)
if , then there exists a winning strategy for player such that the following condition is satisfied: if player chooses at step and , then chooses .
Proof.
The equivalence of games and assertions (1) and (2) follow from Propositions 1 and 11. Assertion (3) follows from Proposition 4.
Let us prove (4). Let be a winning strategy for . We define a strategy . Suppose that and on the first moves sets , , , …, , are chosen. Player chooses as prescribed by the strategy . If and , then . Otherwise, for .
Let us prove (5). Let be a winning strategy for . We define a strategy . Suppose that and on the first moves sets , , , , …, , , are selected. Player chooses as prescribed by the strategy . If and , then . Otherwise, for .
Let us prove (6). Let be a winning strategy for . We define a strategy . Suppose that and on the first moves sets , , , , …, , , . Player chooses as prescribed by the strategy . If and , then . Otherwise, for . ∎
Let be an index set, be a space, and for ; we set . For we denote . The family
is a base of the space .
Proposition 16 implies the following assertion.
Proposition 17.
Let , , be an index set, be a space for each , and . Let , , , and . Then
-
(1)
if and only if is -favorable;
-
(2)
if and only if is -favorable;
-
(3)
if and only if is -favorable.
Proposition 18.
If , and , , then .
Proof.
Let and be winning strategies for on and , respectively. Let us describe a winning strategy for . It follows from Proposition 17 that it suffices to consider the case when the player chooses sets of the form . At the th step, we put , , and . ∎
Proposition 19.
Let , and let for . Then .
Proof.
Assertion 1.
Let be a quasi-regular space, , , for , , and . Suppose that the following condition is met:
-
1.
if , and for each there exists , such that , then either or .
Then is -favorable.
Proof.
Let us describe a winning strategy for . Let . For , at the th step the player chooses in such a way that the following conditions are satisfied:
-
1.
;
-
2.
for some .
∎
Theorem 3.
-
(1)
.
-
(2)
Let , , and . Then .
-
(3)
Let and for . Then .
-
(4)
For , if and are open subspaces, then .
-
(5)
For , if the space is locally (that is, any point has a neighborhood ), then .
-
(6)
If is a quasi-regular space and belongs to one of the classes , , listed below, then is a -space:
-
metrizable spaces, Moore spaces, developable space, semiregular -spaces, and semiregular spaces with a countable network;
-
compact spaces, -spaces, semiregular strongly -spaces;
-
countably compact spaces, semiregular -spaces, -spaces;
-
feebly compact spaces.
-
Proof.
Item (1) follows from Proposition 14, item (2) follows from Proposition 18, and item (3) follows from Proposition 19.
Let us prove (4). Player has a winning strategy on .
Let us prove (5). After the first move, player chooses such that and then follows the winning strategy for .
Let us prove (6). Let be the topology of and . For we denote
If is locally finite, then . For and we construct as in Assertion 1.
-
Let be a developable space. Take a development of the space .
Let be a semiregular -space. Let be a sequence of locally finite families such that is a network. We set .
-
Let be a compact space. We put .
Let be a -space. We set equal to the family from the definition of -spaces (Definition 3.15, [18]).
Let be a strongly -spaces. We put , where is a -discrete family in Definition 4.13 of [18].
-
Let be a countably compact space. We put .
Let be a -space. We put , where is a -discrete family in Definition 4.13 of [18].
Let be a -space. We set equal to the family in Definition 3.1 of [18]).
-
Let be a feebly compact space. We put .
∎
Proof.
Open sets of the form , where and , form a base of the space . Let us define a winning strategy for . By Proposition 16, it suffices to consider the case when players and choose open sets of the form and chooses sets of the form , and . On the th move, we choose open nonempty and according to strategies on and , where and is the choice of at the th step. Let . Let us check that the player won.
Let . Let . Let for and
The family is a filter on . Let be some ultrafilter containing . There is for which . Then . ∎
Proof.
By virtue of proposition 17 (3), it suffices to consider the case when players and choose sets from .
Let us define a winning strategy for player . Let be a winning strategy for on satisfying condition (6) in Proposition 16. Suppose that moves are made and sets , , , for are chosen. We put
for and . Since for almost all , we have . ∎
Proposition 22.
Let be a -space for . Then is a -space.
Proof.
Theorem 4.
-
(1)
In the diagram below, each arrow means that .
-
(2)
Let , be a -space and be a -space. Then is a -space.
-
(3)
Let be an index set, and be a -space for . Then is a -space.
-
(4)
Let be a -space for . Then is a -space.
-
(5)
For and , if and is an open subspace, then .
-
(6)
For and , if is locally (i.e., any point has a neighborhood ), then .
-
(7)
If is a quasi-regular space and belongs to one of the classes for and listed below, then is a -space:
-
metrizable spaces, Moore spaces, developable spaces, semiregular -spaces and semiregular spaces with a countable network, compact spaces, -spaces, semiregular strongly -spaces;
-
countably compact spaces, semiregular -spaces, -spaces;
-
feebly compact spaces.
-
Proof.
Item (1) follows from Proposition 14, item (2) follows from Proposition 20, item (3) follows from Proposition 21 and item (4) follows from Proposition 22.
Let us prove (5). Player follows a winning strategy for .
Let us prove (6). After the first move, player chooses such that , then follows the winning strategy for .
Item (7) follows from Theorem 3. ∎
6 Modifications of the Banach–Mazur game with four players
To formulate and prove the results of this section, it is necessary to define the game and related concepts precisely.
6.1 General definition of a game.
The game is defined by the following components:
-
(P)
, a set of players;
-
()
, an indexed family of strategies of players, in which each player has a nonempty set of strategies . A set
is the strategy space in the game;
-
(R)
, a set of plays, a record of the players’ moves after they implement their strategies;
-
()
, the outcome function, implementation of player strategies during the game, forming a play in the set of plays ;
-
, the family of outcomes of the game: determines the payoff for player ;
-
()
, the payoff function, which determines the game outcome: , where .
The game goes as follows:
-
1.
each player chooses a strategy ;
-
2.
players play the game according to their chosen strategies and obtain a play , where ;
-
3.
the payoff function determines the result of the play : , where is the payoff for player .
We consider games with , where , i.e., when is a Boolean function, is treated as false and as true. The result of a game is interpreted as the payoff of player : wins if and loses if . Such games will be called games with a Boolean payoff function.
A game with a Boolean payoff function is called a zero-sum game if for any play there exists a unique player for which equals . For games with two players, a zero-sum game is a game in which the first player’s gain is the second player’s loss and the first player’s loss is the second player’s gain, i.e., if .
The player is called nature if is identically equal to zero.
A coalition is any set of players. The set is the opposite coalition. A set
is called the set of coalition strategies of and , a coalition strategy of .
If a game has a Boolean payoff function, then we denote
For , if and only if for some .
A coalition strategy for a coalition is called -winning if for all . A game is called -favorable if the coalition has a -winning strategy. A game is -unfavorable if there is no -winning strategy.
The following assertion is checked directly.
Assertion 2.
Let . If the game is -favorable, then is -favorable. If the game is -unfavorable, then is -unfavorable.
For , the strategy is called -winning if the strategy of the coalition is -winning. The game is -favorable if it is -favorable, and the game is -unfavorable if it is -unfavorable.
Let , let be a strategy of , and let be a coalition. We define games and . The components of the games and are the same, the difference is in the payoff function for the player . The game is defined by the following components:
-
(P)
, a set of players;
-
()
, a family of strategies;
-
(R)
, a set of games like in the game ;
-
()
, for , the outcome function;
-
Boolean game;
-
()
, the payoff functions: if , and .
We call a coalition nature if each player in the coalition is nature, that is, . A coalition is called dummy if is nature and for any coalition it is -favorable if and only if the game is -favorable.
The following proposition follows from the definitions.
Proposition 23.
Let be a game with a Boolean payoff function, be the set of players in the game , be a coalition, be the opposite coalition, and . Then the following assertions hold.
-
(1)
The game is a zero-sum game for all .
-
(2)
The game is a zero-sum game if and only if the coalition is nature. In this case the game is the same as for all .
-
(3)
Let be nature. A coalition is a dummy coalition if and only if for any .
6.2 Definition of the game
Let be a space, and let . Suppose that is a -net of , and .
Game parameters: and .
Game set of players: (four-players game).
The th move: On the th move, players choose sets
in details:
player | selection | |
---|---|---|
, | ||
, | ||
, |
For we denote
On the first move, for , the choice of players is
player | choice | choice definition |
---|---|---|
and | ||
, and | ||
On the th move, for , we determine the choice of players is
player | choice | choice definition |
---|---|---|
, and | ||
Note that for
The conditions for players to win: Player wins if . Player wins if . Players and are nature, which means that they always lose.
6.3 Definition of the game
Let be the space, and .
Game parameters: and .
The set of players in the game: (two-player game).
The th move: On the th move, players choose sets
On the first move, for , player chooses , and player chooses , . On the th move, for , player chooses , , and player chooses , .
The conditions for players to win: Player wins if , otherwise wins.
6.4 Relationship between the , and games
We denote , and . From the construction we see that the following assertion holds.
Assertion 3.
The Banach–Oxtoby Theorem 2 implies the following proposition.
Proposition 24.
Let be a space, and let . The game is -unfavorable if and only if is Baire for some .
6.5 Properties of the game
We fix a mapping for which the following condition is satisfied: if and , then
-
1.
if ;
-
2.
if ;
-
3.
otherwise.
Notation of game components of the game : For , we denote by the strategy of player , and put . We denote by the outcome function, , where is the set of plays.
Assertion 4.
Let . There is a strategy such that for any there exists so for , ,
condition is met:
-
(a)
for
-
(1)
;
-
(2)
;
-
(3)
.
-
(1)
-
(b)
if the family is monolithic and , then .
Proof.
Let and be strategies for which (a) holds. Item (b) follows from the definition of monolithic and item (a). On the first move, for , the choice of players is:
strategy | choice | definition of choice |
---|---|---|
, | ||
On the th move, for , the choice of players is:
strategy | choice | definition of choice |
---|---|---|
, | ||
∎
Assertion 5.
Let . There is a strategy such that for any there exists so for , ,
condition is met:
-
(a)
for
-
(1)
;
-
(2)
;
-
(3)
;
-
(1)
-
(b)
if the family is monolithic and , then .
Proof.
Let and be strategies for which (a) holds. Item (b) follows from the definition of monolithic and item (a). On the first move, for , the choice of players is:
strategy | choice | definition of choice |
---|---|---|
On the th move, for , the choice of players is:
strategy | choice | definition of choice |
---|---|---|
∎
Theorem 5.
Let be a space, , be a -net of , and a family be monolithic. Let .
-
(1)
The game is -favorable if and only if is -favorable.
-
(2)
The game is -favorable if and only if is -favorable.
-
(3)
The game is -unfavorable if and only if is -unfavorable.
-
(4)
The game is -unfavorable if and only if is -unfavorable.
Proof.
Items (3) and (4) follow from (1) and (2).
Let us prove (1). By Assertion 2, it suffices to show that if the game is -favorable, then is -favorable. Let be a -winning strategy. Let be the strategy from Assertion 4. Let us show that is a winning strategy for player . Let . Assertion 4 (b) and the fact that is monolithic imply that there exists such that for , ,
the following condition is satisfied: if , then . Since is a -winning strategy, we have . Hence , and player wins with the strategy .
Let us prove (2). By Assertion 2, it suffices to show that if is -favorable, then is -favorable. Let be a -winning strategy. Let be the strategy from Assertion 5. Let us show that is a winning strategy for player . Let . Assertion 5 (b) and the fact that is monolithic imply that there exists such that for , ,
the following condition is satisfied: if , then . Since is a -winning strategy, we have . Hence , and player wins with the strategy . ∎
The definition of the game and Theorem 5 imply the following result.
Theorem 6.
Let be a space, , be a -net of , , , and . Let . Then the following assertions hold.
-
(1)
The coalition is nature in the game .
-
(2)
If the family is monolithic, then is a dummy coalition.
Assertion 6.
Let be a strategy of the coalition , and let . If the game is -favorable, then there exists a winning strategy for player in the game such that player chooses on the first move, i.e., .
Assertion 7.
Let . If the game is -favorable, then there exists a winning strategy for player in the game such that player chooses on the first move, i.e. .
Proof.
Let be a winning strategy for player in the game . Let us define a winning strategy for player in the game . On the first move, player chooses . On the th move, player chooses
∎
Assertion 8.
Let , , and be the outcome function in the game . There is a strategy of player in the game such any strategy of player in the game there exists a strategy such that , ,
satisfy the condition
-
for and , for .
Proof.
Let us define the desired strategies and . On the first move, for , we define the choice of players as
move | strategy | choice | choice definition |
---|---|---|---|
0 | |||
0 | |||
0 | |||
0 | |||
0 | |||
1 | |||
0 | , |
On the th move, the choice of players is
move | strategy | choice | choice definition |
---|---|---|---|
n | |||
n | |||
n | |||
n | |||
n+1 | |||
n | , |
∎
Theorem 7.
Let be a space, , be a -net of , and . Let , , , and . If is -favorable and is -unfavorable, then is -unfavorable.
Proof.
Let . We need to find strategies such that for , and
we have .
Since is -unfavorable, it follows from Proposition 24 that there exists a Baire subspace . Let be a winning strategy for player in the game . Assertion 7 implies that there exists a winning strategy for player in the game under which player chooses on the first move. Let be the strategy of player in the game from Assertion 8. Since is a Baire space, it follows by the Banach–Oxtoby Theorem 2, that the game is -unfavorable. Therefore, there is a strategy of player in the game such that for and
we have
From Assertion 8 it follows that there exists an such that and
satisfy the condition
-
for and , for .
Hence and . Since the strategy is winning for in the game , it follows that . We obtain . ∎
6.6 Relationship between the , and games
Let . We define a strategy for player : at the th step, player chooses and . Let us define a strategy for player : at the th step player chooses and . The strategy is a strategy of the coalition . From the construction of games we see that the following assertion holds.
Assertion 9.
Let us define a strategy for player : at the th step player chooses and . Let us define a strategy for player : at the th step player chooses and . The strategy is a strategy of the coalition . From the construction of games we see that the following assertion holds.
Assertion 10.
Proposition 25 (Proposition 2).
Let be a space, be a -net of , , and . If is a monolithic family, then
Proposition 26 (Proposition 10).
Let be a space, be a -net , and be a monolithic family. Suppose that is a -space. Then the following assertions hold.
-
(1)
If is nonmeager, then is -nonmeager.
-
(2)
If is Baire, then is -Baire.
Proof.
Let us prove (1). Assertion 3 and the Banach–Oxtoby Theorem 2 imply that is nonmeager if and only if the game is -unfavorable. Theorem 7 implies that the game is -unfavorable and, moreover, -unfavorable. Theorem 5 implies that the game is -unfavorable. Assertion 10 implies that the game is -unfavorable, i.e., is a -nonmeager space.
Let us prove (2). It follows from Assertion 3 and the Banach-Oxtoby Theorem 2 that is Baire if and only if the game is -unfavorable. Theorem 7 implies that the game is -unfavorable and, moreover, -unfavorable. Theorem 5 implies that the game is -unfavorable. Assertion 10 implies that the game is -unfavorable, i.e. is a -nonmeager space. ∎
7 Examples and questions
In this section, we study how different the introduced classes of spaces are.
The following diagram shows the relationship of the most interesting classes of spaces.
Any arrow means that any -Baire space is a -Baire space and the converse is not true.
The diagram follows from Proposition 14. Counterexamples will be constructed below.
We denote by the discrete two-point space . The base of the topology in is formed by sets of the form
for finite disjoint .
Assertion 11.
Let be a regular space without isolated points.
-
(1)
If is compact, then is -Baire.
-
(2)
If is -nonmeager, then contains an infinite compact set.
-
(3)
If is countably compact, then is -Baire.
-
(4)
If is -nonmeager, then contains a non-discrete countable space.
-
(5)
If is pseudocompact, then is -Baire.
-
(6)
If is -nonmeager, then contains points with a countable base of neighborhoods.
-
(7)
If is -nonmeager, then contains -points.
-
(8)
If is a product of locally compact spaces (for example, ), then is -Baire.
Let us give examples that distinguish the classes of spaces under consideration. In the examples below, : means that is an -Baire space that is not -nonmeager.
Example 1.
Example 2.
Example 3.
: . The space is a compact space without points of countable character (see Assertion 11 (1) and (6)).
Example 4.
: . Consider
Let us show that is -favorable. A winning strategy for is as follows. We choose such that . Let . Then is compact.
Let us show that is -favorable. A winning strategy for is as follows. Choose such that , and , , . Then is a discrete and closed sequence in .
Problem 1.
Let .
-
(1)
Does there exist a -Baire space that is not a -space?
-
(2)
Is the class of -spaces multiplicative? That is it true that if , then ?
-
(3)
Let and be -Baire spaces, and let be a Baire space. Is it true that is a -Baire space?
The smallest class of spaces among those listed above is the class of -spaces, and the largest one is the class of -spaces.
Problem 2.
Let be a regular -Baire space.
-
(1)
Is it true that is a -space and contains a dense metrizable Baire subspace?
-
(2)
Is it true that is a -space?
A space is called weakly pseudocompact if there exists a compact Hausdorff extension of the space in which the space is -dense, i.e., intersects any nonempty subset of [4]. It is clear that the product of weakly pseudocompact spaces is weakly pseudocompact; in particular, the product of pseudocompact spaces is weakly pseudocompact.
The next question is a version of Problem 1 (2) and (3).
Problem 3.
Let be a weakly pseudocompact space (a product of pseudocompact spaces). Which of the following classes does belong to:
-
-spaces, -Baire spaces, -spaces, -Baire spaces?
Problem 4.
Let and be (completely) regular countably compact spaces. Which of the following classes does the product belong to:
-
-spaces, -Baire spaces, -spaces, -Baire spaces, -spaces, -Baire spaces, -spaces, -Baire spaces?
Recall that a group with a topology in which multiplication is continuous is called a paratopological group. A group with a topology in which multiplication is separately continuous is called a semitopological group. In [22, Theorem 2.6] it is proved that a pseudocompact paratopological group is a topological group. Every weakly pseudocompact semitopological group G of countable -character is a topological group metrizable by a complete metric (see [4, Corollary 2.28]).
Problem 5.
Let be a weakly pseudocompact (a product of pseudocompact spaces, a product of two countably compact spaces) paratopological group. Is it true that is a topological group?
Note that [11, Theorem 14] implies that a paratopological -Baire group is a topological group.
References
- [1] R. Baire, Sur les fonctions de variables réelles, Annali di Matematica Pura ed Applicata (1898-1922) 3 (1) (1899) 1–123.
- [2] I. Namioka, Separate continuity and joint continuity, Pacific Journal of Mathematics 51 (2) (1974) 515–531.
- [3] J. P. R. Christensen, Joint continuity of separately continuous functions, Proceedings of the American Mathematical Society 82 (3) (1981) 455–461.
- [4] A. Arhangel’skii, E. Reznichenko, Paratopological and semitopological groups versus topological groups, Topology and its Applications 151 (1-3) (2005) 107–119.
-
[5]
J. Cao, R. Drozdowski, Z. Piotrowski, Weak
continuity properties of topologized groups, Czechoslovak Mathematical
Journal 60 (1) (2010) 133–148.
URL http://eudml.org/doc/37996 -
[6]
R. Telegársky, Topological
games: On the 50th anniversary of the Banach Mazur game, Rocky Mountain
Journal of Mathematics 17 (2) (1987) 227 – 276.
doi:10.1216/RMJ-1987-17-2-227.
URL https://doi.org/10.1216/RMJ-1987-17-2-227 -
[7]
J. P. Revalski,
The banach-mazur game: History and recent developments, in:
Seminar notes, Pointe-a-Pitre, Guadeloupe, France, 2004.
URL http://www1.univ-ag.fr/aoc/activite/revalski/revalski/revalski/Banach-MazurGame.pdf -
[8]
E. Reznichenko, Continuity of the
inverse, in russian (2008).
arXiv:2106.01803.
URL http://gtopology.math.msu.su/erezn-ci - [9] E. Reznichenko, Continuity of the inverse in groups, Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika (4) (2022) 63–67.
- [10] E. Reznichenko, Generalization of Bair spaces using diagonal, arXiv e-prints (2022) 35arXiv:2203.09389, doi:https://doi.org/10.48550/arXiv.2203.09389.
-
[11]
E. Reznichenko, Continuity in right
semitopological groups (2022).
doi:10.48550/ARXIV.2205.06316.
URL https://arxiv.org/abs/2205.06316 - [12] O. Ravsky, Paratopological groups ii, Matematychni Studii 16 (1) (2001) 93–101.
-
[13]
Z. A. Ameen, Almost somewhat
near continuity and near regularity, Moroccan Journal of Pure and Applied
Analysis 7 (1) (2021) 88–99.
doi:doi:10.2478/mjpaa-2021-0009.
URL https://doi.org/10.2478/mjpaa-2021-0009 - [14] J. C. Oxtoby, The Banach-Mazur game and Banach category theorem, Princeton University Press, Princeton, NJ, 1957, pp. 159–163.
-
[15]
F. Galvin, R. Telgársky,
Stationary
strategies in topological games, Topology and its Applications 22 (1) (1986)
51–69.
doi:https://doi.org/10.1016/0166-8641(86)90077-5.
URL https://www.sciencedirect.com/science/article/pii/0166864186900775 -
[16]
A. V. Arhangel’skii, M. M. Choban, P. S. Kenderov,
Topological
games and continuity of group operations, Topology and its Applications
157 (16) (2010) 2542–2552.
doi:https://doi.org/10.1016/j.topol.2010.08.001.
URL https://www.sciencedirect.com/science/article/pii/S0166864110002440 - [17] E. Michael, A note on closed maps and compact sets, Israel Journal of Mathematics 2 (1964) 173–176.
- [18] G. Gruenhage, Generalized Metric Spaces, Elsevier Science Publishers B. V., 1984, pp. 423–502. doi:10.1016/B978-0-444-86580-9.50013-6.
-
[19]
D. Shakhmatov,
A
pseudocompact tychonoff space all countable subsets of which are closed and
-embedded, Topology and its Applications 22 (2) (1986) 139–144.
doi:https://doi.org/10.1016/0166-8641(86)90004-0.
URL https://www.sciencedirect.com/science/article/pii/0166864186900040 - [20] E. Reznichenko, A pseudocompact space in which only sets of complete cardinality are not closed and not discrete, Moscow Univ. Math. Bull. 6 (1989) 69–70.
-
[21]
E. Reznichenko,
Homogeneous
subspaces of products of extremally disconnected spaces, Topology and its
Applications 284 (2020) 107403.
doi:https://doi.org/10.1016/j.topol.2020.107403.
URL https://www.sciencedirect.com/science/article/pii/S016686412030345X -
[22]
E. Reznichenko,
Extension
of functions defined on products of pseudocompact spaces and continuity of
the inverse in pseudocompact groups, Topology and its Applications 59 (3)
(1994) 233–244.
doi:https://doi.org/10.1016/0166-8641(94)90021-3.
URL https://www.sciencedirect.com/science/article/pii/0166864194900213