03.dvi @ Applied General TopologyUniversidad Polit�ecnica de ValenciaVolume 1, No. 1, 2000pp. 29 - 43 Some properties of o-bounded and strictlyo-bounded groupsC. Hern�andez, D. Robbie, M. Tkachenko�Abstract. We continue the study of (strictly) o-boundedtopological groups initiated by the �rst listed author and solvetwo problems posed earlier. It is shown here that the product ofa Comfort-like topological group by a (strictly) o-bounded groupis (strictly) o-bounded. Some non-trivial examples of strictly o-bounded free topological groups are given. We also show thato-boundedness is not productive, and strict o-boundedness can-not be characterized by means of second countable continuoushomomorphic images.2000 AMS Classi�cation: Primary 54H11, 22A05; Secondary 22D05, 54C50Keywords: o-bounded group, strictly o-bounded group, @0-bounded group,OF-undetermined group, Comfort-like group1. IntroductionThe class of �-compact topological groups has many nice properties. Forexample, every �-compact group is countably cellular [11] and perfectly �-normal [13, 15]. The subgroups of �-compact groups inherit these properties,but clearly need not be �-compact. The notions of o-boundedness and stricto-boundedness introduced by O. Okunev and M. Tkachenko respectively, wereconsidered in [9]. The idea was to �nd a wider class of topological groups asclose to the class of �-compact groups as possible which is additionally closedunder taking subgroups. Let us recall the corresponding de�nitions.A topological group G is called o-bounded if for every sequence fUn : n 2 Ngof open neighborhoods of the neutral element in G, there exists a sequencefFn : n 2 Ng of �nite subsets of G such that G = Sn2N Fn � Un. It is clearthat all �-compact groups as well as their subgroups are o-bounded. In a sense,o-bounded groups have to be small: the group R! fails to be o-bounded [9,�The research is partially supported by Consejo Nacional de Ciencias y Tecnolog��a (CONA-CyT) of Mexico, grant no. 400200-5-28411E, and grant for Special Studies Program (Long)The University of Melbourne (Science Faculty). 30 C. Hern�andez, D. Robbie, M. TkachenkoExample 2.6]. The class of o-bounded groups has good categorical properties:all subgroups and all continuous homomorphic images of an o-bounded groupare o-bounded [9]. It was not known, however, whether this class was �nitelyproductive [9, Problem 5.2]. We show in Example 2.12 that there exists asecond countable o-bounded group G whose square is not o-bounded. Actually,the group G �rst appeared in [9, Example 6.1] in order to distinguish the classesof o-bounded and strictly o-bounded groups. However, the properties of thisgroup were not completely exhausted there. As is shown in [4], the group G isadditionally analytic, that is, G is a continuous image of a separable completemetric space.To de�ne strictly o-bounded groups, we need to describe the OF-game (see[9] or [14]). Suppose that G is a topological group and that two players, say Iand II, play the following game. Player I chooses an open neighborhood U1 ofthe identity in G, and player II responds choosing a �nite subset F1 of G. Inthe second turn, player I chooses another neighborhood U2 of the identity inG and player II chooses a �nite subset F2 of G. The game continues this wayuntil we have the sequences fUn : n 2 Ng and fFn : n 2 Ng. Player II winsif G = S1n=1 Fn � Un. Otherwise, player I wins. The group G is called strictlyo-bounded if player II has a winning strategy in the OF-game on G. It is easy tosee that �-compact groups are strictly o-bounded and every strictly o-boundedgroup is o-bounded. As we mentioned above, o-bounded groups need not bestrictly o-bounded. In addition, there are lots of strictly o-bounded groupsthat are neither �-compact nor isomorphic to subgroups of �-compact groups[9, Example 3.1]. However, an o-bounded continuous homomorphic image of aWeil-complete group is �-bounded, hence strictly o-bounded [3]. All this makesthe problem of studying the properties of these two classes of topological groupsfairly interesting.The class of o-bounded groups is not productive in view of Example 2.12.However, we have no examples of strictly o-bounded groups G and H such thatthe product G � H is not strictly o-bounded (see Problem 4.1). On the otherhand, it was known that a product of an o-bounded group by a �-compact groupwas o-bounded [9, Theorem 5.3], and a similar result for strictly o-boundedgroups was recently proved by Jian He (see Theorem 2.7) who in fact hasproved the result with `�-bounded' instead of `�-compact' and by a methodthat extends the o-bounded result as well. It turns out that there are manytopological groups G (far from being �-compact) with the property that theproduct G �H is (strictly) o-bounded for every (strictly) o-bounded group H.Let G be a �-product of countable discrete groups endowed with the @0-boxtopology. We shall call any subgroup of such a group G a Comfort-like group.(It was W. Comfort who proved that every �-product of countable discretespaces with the @0-box topology inherited from the whole product is Lindel�of,see [5]). We prove in Section 2 that multiplication by a Comfort-like groupG does not destroy (strict) o-boundedness: the product G � H is (strictly) o-bounded for every (strictly) o-bounded group H. It is also shown that thefree topological group F(X) is strictly o-bounded whenever X is the one-point Some properties of o-bounded and strictly o-bounded groups 31Lindel�o�cation of any uncountable discrete space (Theorem 2.8). In fact, theproduct F(X) � H is strictly o-bounded for every strictly o-bounded group H(see Theorem 2.11).It is clear that every o-bounded group is @0-bounded in the sense of [6],that is, it can be covered by countably many translates of any neighborhoodof the identity. By Theorem 4.1 of [9], if G is @0-bounded and all secondcountable continuous homomorphic images of G are o-bounded, then G itselfis o-bounded. In Section 3 we use � to construct an o-bounded group G whosesecond countable continuous homomorphic images are countable (hence strictlyo-bounded), but G itself is not strictly o-bounded. Therefore, the class ofstrictly o-bounded groups is considerably more complicated than that of o-bounded groups. In other words, strict o-boundedness is not re ected in theclass of second countable groups.The group G in Theorem 3.1 has another interesting feature. Let us call atopological group H OF-undetermined if neither player I nor player II has awinning strategy in the OF-game in H. It was an open problem whether thereexist OF-undetermined groups. It turns out that the group G in Example3.1 is OF-undetermined. We do not know, however, if such a group can beconstructed in ZFC. Another problem is considered by T. Banakh in [4]: Doesthere exist a metrizable OF-undetermined group? He shows that such groupsexist under Martin's Axiom and have necessarily to be second countable.1.1. Notation and terminology. We denote by N the positive integers, by Zthe additive group of integers, and by R the group of reals. A topological groupG is called @0-bounded [6] if countably many translates of every neighborhoodof the identity in G cover the group G. By a result of [6], G is @0-bounded ifand only if it is topologically isomorphic to a subgroup of a direct product ofsecond countable topological groups. This class of groups is closed under takingdirect products, subgroups and continuous homomorphic images.We say that H is a P-group if the intersection of any countable family of opensets in H is open. Every topological group H admits a �ner group topologythat makes it a P-group: a base of such a topology consists of all G�-subsets ofH.If X is a subset of a group G, we use hXi to denote the subgroup of Ggenerated by X. Finally, the families of all non-empty �nite and countablesubsets of a set A will be denoted by [A] 1 and x1 � � �xn�1 = f �u,where f 2 hKi and u 2 UK.If xn 2 D�nK, then it is clear that uxn 2 UK, hence g = f�uxn 2 hKi�Un. Onthe other hand, if xn is in K, then for UK to be a normal subgroup, u0 = x�1n uxnis in UK. Therefore, g = fxn � u0 2 hKi � UK. This �nishes the proof. �Proof of Theorem 2.8. For every K 2 [D]�!, let fgKn : n 2 Ng be an enu-meration of the group hKi. Without loss of generality, we may suppose thatplayer I chooses open sets of the form UK (Lemma 2.9 applies here). If playerI chooses UK1, player II chooses F1 = fgK11 g. In general, if player I choosesUKn, then player II chooses Fn = fgKij : 1 � i;j � ng. We can also as-sume that K1 � K2 � ��� � Kn � ��� . Let K = S1i=1 Ki. Observe thathKi = S1n=1hKni = S1n=1 Fn. Finally, since UK � UKn for each n, Lemma 2.10implies thatF(D�) = hKi � UK = � 1[n=1 Fn� � UK = 1[n=1(Fn � UK) � 1[n=1 Fn � UKn:Then, F(D�) is strictly o-bounded. �In fact, the above theorem admits a stronger form.Theorem 2.11. The product F(D�)�H is strictly o-bounded for each strictlyo-bounded group H.Proof. We can modify slightly the proof of Theorem 2.6 and obtain the proofof our theorem. Indeed, the sets UK are now the normal subgroups of F(D�)generated by D� n K, where K 2 [D]�!. These sets were used in the proof ofTheorem 2.8 and, as before, form a base for the identity that has the followingproperties:(1) each UK is a normal subgroup of F(D�);(2) the subsets UK are clopen in F(D�);(3) jF(D�)=UKj � @0 for each K 2 [D]�!.We may suppose that player I chooses neighborhoods of the form Ui � Vi,where Ui and Vi are neighborhoods of the identity e of F(D�) and eH of Hrespectively, and Ui = UKi, where Ki is in [D]�!, i 2 N.As in the proof of Theorem 2.8, we choose an enumeration fgKn : n 2 Ng ofhKi, and put En = fxKij : i;j � ng. At this point, the proof of the theoremcontinues in the same way as the proof of Theorem 2.6. �The following example shows that the class of o-bounded groups is not �nitelymultiplicative. This answers the corresponding problem posed in [9] in thenegative. It turns out that the o-bounded group G from [9, Example 8] suits.Example 2.12. There exists a second countable o-bounded topological groupG such that G � G is not o-bounded. 38 C. Hern�andez, D. Robbie, M. TkachenkoFor every x 2 R!, de�ne suppx = fn 2 N : x(n) 6= 0g. Let fnk(x) : k 2 !gbe the enumeration of suppx in the increasing order. Denote by X the set ofall x 2 R! such that limk!1 x(nk)nk+1(x) = 0:Consider the subgroup G of R! generated by X, i.e., G = hXi. In what followswe use the additive notation for the group operation in R! .We already know that G is o-bounded. We shall prove that G2 is not o-bounded describing a sequence fUn : n 2 Ng of open neighborhoods of theidentity e 2 G for which no sequence of �nite subsets fEn : n 2 Ng in Gwill make G2 = S1n=1[(En � En) + (Un � Un)]. For every n 2 N, let Un =G \ Q1j=1 Vn;j, where Vn;j = (�1;1) for 0 � j � n and Vn;j = R if j > n. Now,when considering En +Un the only coordinates of the elements En that matterare 0;1; : : : ;n since Un is unrestricted on ! nn coordinates. So, we may as wellonly consider En where the elements have 0 at each of the !nn places. Moreover,we can assume that En � En+1. Let An = maxfjz(i)j : z 2 En; 0 � i � ng.Observe that A0 < A1 < � � � . We shall prove that G2 6= S1n=1[(En � En) +(Un � Un)] for any �nite subsets En � G. That is, there exists at least onepair of elements x, y 2 G such that (x;y) =2 S1n=1[(En � En) + (Un � Un)]. Weconstruct x and y as follows. Choose n0 = 0, n1 = 1 and set x(0) = x0 > An1.We now choose any n2 such that x0=n2 < 1=2. Now, for all i, 0 < i < n2, we putx(i) = 0. Let y(n1) = yn1 > An2. Then we choose n3 2 ! so that yn1=n3 < 1=3.We set y(j) = 0 if 0 � j < n1 or n1 < j < n3. We continue in this way tode�ne numbers fnk : k 2 !g. We put x(nk) = xnk > Ank+1 for k even and suchthat x(nk)=nk+2 < 1=(k + 2). The other values for x(j) so far unde�ned forj < nk+2 are set as 0. Similarly, if k is odd, then de�ne y(nk) = ynk > Ank+1and nk+2 is de�ned so that y(nk)=nk+2 < 1=(k + 2). It is clear that x,y 2 G.We claim that (x;y) =2 S1n=1[(En � En) + (Un � Un)]. Indeed, suppose thatn 2 N and that nk � n < nk+1. If k is even, then xnk > Ank+1 � An, sox =2 En + Un. If k is odd, then ynk > Ank+1 � An, so y =2 En + Un. Hence(x;y) =2 S1n=0[(En�En)+(Un�Un)]. This shows that G2 is not o-bounded. �3. An example of an OF-undetermined groupBy Theorem 4.1 of [9], an @0-bounded group G is o-bounded if and onlyif all second countable continuous homomorphic images of G are o-bounded.Here we show that strictly o-bounded groups cannot be characterized this way,thus answering [9, Problem 4.2] in the negative. In addition, the group G weconstruct below will be OF-undetermined, that is, neither player I nor playerII has a winning strategy in the OF-game on G.Theorem 3.1. Under �, there exists a topological group G with the followingproperties:(a) every countable intersection of open sets in G is open;(b) the image f(G) is countable for every continuous homomorphism f :G ! H to a second countable topological group H; in particular, G iso-bounded; Some properties of o-bounded and strictly o-bounded groups 39(c) G is OF-undetermined, hence not strictly o-bounded.Proof. We shall construct G as a subgroup of the group Z!1 endowed withthe @0-box topology, where the group Z has the discrete topology. This willguarantee (a). For every � < !1, let �� : Z!1 ! Z� be the projection andK� be the kernel of ��. Then K� is an open subgroup of Z!1, and we putN� = G \ K�. Clearly, the family fN� : � < !1g forms a decreasing base atthe neutral element of G. The subgroup G of Z!1 will also satisfy the followingstrong condition:(B) jGj = @1, but ��(G) is countable for each � < !1.Let us show that (B) implies (b). Suppose that f : G ! H is a continuoushomomorphism to a second countable topological group H. Choose a countablebase fUn : n 2 Ng at the neutral element of H. For every n 2 N, thereexists an ordinal �n < !1 such that N�n � f�1(Un). Let � be a countableordinal satisfying �n < � for each n 2 N. Then N� � kerf, so by Lemma2.1 there exists a homomorphism g : ��(G) ! H such that f = g � ��. Sincethe group ��(G) is countable by (B), we have jf(G)j � j��(G)j � !. Clearly,every countable group is o-bounded, so Theorem 4.1 of [9] implies that G iso-bounded.The di�cult part of our construction is to guarantee (c). This requires somepreliminary work. For a point x 2 Z!1, put supp(x) = f� < !1 : x(�) 6= 0gand consider the subgroup � of Z!1 de�ned by� = fx 2 Z!1 : jsupp(x)j � !g:It is clear that j�j = c = @1. Actually, our group G will be constructedas a subgroup of �. Since fN� : � < !1g is a base at the neutral elementof G, we can assume without loss of generality that player I always makes hischoice from this family, and this choice, say N�, is de�ned by the correspondingordinal �. Therefore, every possible winning strategy for player II is a function : Seq ! [G]