Compactly Choquet-complete spaces III: products and continuous almost open images

The compactly Choquet-complete spaces were introduced in [1], and we had started to study them last time and the month before. We had shown that compactly Choquet-complete spaces are completely Baire, and that the class of compactly Choquet-complete spaces contains the LCS-complete spaces (the Gδ subspaces of locally compact sober spaces), and were closed under taking closed subspaces.

We continue our list, and we will show that the class of compactly Choquet-complete spaces is closed under countable products and under images by continuous almost open surjective maps.

The case of countable products will be interesting in that we will need to simulate countably many games in parallel; and if infinitely many games must be simulated, then we will start them later and later, so that only finitely many games are being simulated at each individual step of the game.

As a reminder, the strong Choquet game is played between two players, α and β. Player β starts the game by picking a point x0 and an open neighborhood V0 of x0. Then α replies with an open neighborhood U0 of x0 included in V0; β picks a possibly different point x1 in U0, an open neighborhood V1 of x1 included in U0; α replies with an open neighborhood U1 of x1 included in V1; β picks a possibly different point x2 in U1, an open neighborhood V2 of x2 included in U1, and so on. After both players have played for as many turns as there are natural numbers, α is declared to win if ∩n ∈ N Un (which is also equal to ∩n ∈ N Vn) is non-empty. Otherwise, β wins. We say that α wins compactly if and only if ∩n ∈ N Un is a non-empty compact set Q and the sets Un form a base of open neighborhoods of Q; α wins convergently if and only if it wins compactly and Q is the upward closure of a point x.

Each player plays according to a strategy: σ for α, τ for β. Player α finds Un as σ(x0V0U0x1, V1U1, ···, xnVn), and player β finds the pair xnVn as τ(x0V0U0x1V1U1, ···, xn–1Vn–1Un–1). A strategy σ for α that wins compactly (resp., convergently) against every possible strategy τ that β uses is compactly winning (resp., convergently winning). A space is compactly Choquet-complete (resp., convergence Choquet-complete) if and only if α has a compactly (resp., convergently) winning strategy.

A stationary strategy for α is one that only depends on the last pair xnVn played by β, and we write σ(xnVn) instead of σ(x0V0U0x1, V1U1, ···, xnVn) in that case. A space is stationary compactly Choquet-complete (resp., stationary convergence Choquet-complete) if and only if α has a stationary compactly (resp., stationary convergently) winning strategy.

Products of compactly Choquet-complete spaces

We will see that countable products Πi ∈ I Xi of compactly Choquet-complete spaces Xi are compactly Choquet-complete. Finite products are pretty easy to deal with: we play compactly winning strategies in each space Xi in parallel. In the infinite countable case, we need a new trick.

Let us see right away why uncountable products do not preserve compact Choquet-completeness. We will write points of a product Πi ∈ I Xi in bold face, as x, and open subsets as U, V, W, similarly. The product topology on Πi ∈ I Xi is generated by open rectangles, which are products Πi ∈ I Ui where each Ui is open in Xi and Ui=Xi for all i except for finitely many. We will call support of such an open rectangle the (finite) collection of indices i ∈ I such that UiXi.

Counterexample A. Let I be an uncountable index set, and let Xi be the space of real numbers R, with its usual metric topology. Taking R is not important; the important thing is that the spaces Xi are not compact (and non-empty). Let us imagine that α has a compactly winning strategy σ on Πi ∈ I Xi = RI. We define a strategy τ for β as follows: initially, β produces x0V0 where x0 is an arbitrary point of Πi ∈ I Xi, and V0 ≝ Πi ∈ I Xi. Given a history x0V0U0x1V1U1, ···, xn–1Vn–1Un–1, where n≥1, β produces xnxn–1, and an open rectangle Vn containing xn and included in Un–1 (we don’t care which). Since σ is compactly winning, Q ≝ ∩n ∈ N Un is compact and non-empty. Since UnVnUn–1 for every n≥1, Q is also equal to ∩n ∈ N Vn. Now each Vn is an open rectangle; let Jn be its support. Since Vn+1UnVn for every n ∈ N, Jn+1Jn. Let J be the union ∪n ∈ N Jn. Every Jn is finite, so J is countable, and therefore I–J is uncountable, in particular non-empty. By definition, each Vn is a product of open subsets of each Xi, and all those at indices in I–J (hence in I–Jn) are equal to Xi. Therefore we can write Vn as Vn × Πi ∈ I–J Xi where Vn is an open rectangle in Πi ∈ J Xi. In particular, Q = ∩n ∈ N Vn × Πi ∈ I–J Xi. We fix an index i in I–J, and we write πi for projection of Πi ∈ I Xi onto Xi. This is a continuous map, so πi[Q] is compact. But πi[Q] = πi[∩n ∈ N Vn × Πi ∈ I–J Xi] = Xi (the latter holds because ∩n ∈ N Vn × Πi ∈ I–J Xi = Q is non-empty), which is not compact.

This is to be contrasted with the fact that arbitrary products of Choquet-complete spaces are Choquet-complete, a result I will leave as an exercise.

In order to show that finite or countable products of compactly Choquet-complete spaces are compactly Choquet-complete spaces, we will need an extension of Wallace’s theorem, already mentioned in the November 2023 post (Appendix A): given two topological spaces X and Y, a compact subset Q of X, a compact subset Q’ of Y, and an open neighborhood W of Q × Q’, there is an open neighborhood U of Q in X and an open neighborhood V of Q’ in Y such that U × W. The extension to come works for arbitrary products, not just finite or countable products.

Lemma B.  Let (Xi)i ∈ I be a family of topological spaces, and let Qi be a compact subset of Xi, one for each i ∈ I.  For every open neighborhood W of Πi ∈ I Qi in Πi ∈ I Xi, there is a family (Ui)i ∈ I of open subsets of Xi, one for each i ∈ I, such that Qi  ⊆ Ui for every i ∈ IUi=Xi for all i except for finitely many, and Πi ∈ I Ui  ⊆ W.

Proof. If some Qis empty, then this is obvious: we take the empty set for UiXj for Ufor every ji, and this fits the bill.  Hence we will assume that every Qi is non-empty.  This will only be important near the end of the proof.

We first prove this when I is finite.  Let X1, …, Xn be n topological spaces, Qi be a compact subsets of Xi, one for each ∈ {1, ···, n}, and W be an open neighborhood of Q1 × ··· × Qn in X1 × ··· × Xn.  We show the claim by induction on n.  If n=0, then Q1 × ··· × Qn and X1 × ··· × Xn contain exactly one element, and the claim is trivial.  Otherwise, Q1 × ··· × Qn–1 is compact in X1 × ··· × Xn–1 by Tychonoff’s theorem (Theorem 4.5.12 in the book), and (Q1 × ··· × Qn–1) × Qn is included in W.  By Wallace’s theorem, there is an open subset U of X1 × ··· × Xn–1 and an open subset Un of Xn such that Q1 × ··· × Qn–1 ⊆ UQn ⊆ Un, and U × Un ⊆  W.  By induction hypothesis, there are open subsets U1, …, Un–1 of X1, …, Xn–1 such thatQ1 ⊆ U1, …, Qn–1 ⊆ Un–1 and U1 × ··· × Un–1 ⊆ U.  In particular, U1 × ··· × Un ⊆ × Un ⊆  W.

Second, we prove the lemma in the general case, where I is no longer assumed to be finite. For short, let us call open rectangle any product Πi ∈ I Ui  of open subsets Ui of Xi, one for each i ∈ I, such that Ui=Xi for all i except for finitely many. We will say that such an open rectangle is supported on a given set J of indices included in I if and only if the indices i such that UiXi are all in J.

By definition of the product topology, W is a union of open rectangles.  Πi ∈ I Qi is compact by Tychonoff’s theorem (Theorem 4.5.12 in the book) and is included in W, hence is included in finitely may open rectangles R1, …, Rn included in W.  Each of these rectangles is supported on a finite subset of I, and by taking their union, we obtain a finite subset J of I such that R1, …, Rare all supported on J.  Let π be the projection map from Πi ∈ I Xi onto Πj ∈ J Xj.  This is a continuous map, so the image π[Πi ∈ I Qi] is compact in Πj ∈ J Xj; alternatively, π[Πi ∈ I Qi] is the product Πj ∈ J Qj (I will let you check this; this is where we need every Qj to be non-empty!). The image π[R1 ∪ ··· ∪ Rn] is equal to π[R1] ∪ ··· ∪ π[Rn], which is a union of open rectangles in Πj ∈ J Xj.  Hence π[R1 ∪ ··· ∪ Rn] is open in Πj ∈ J Xj, and it contains the product of compact sets π[Πi ∈ I Qi] = Πj ∈ J Qj.  By the first part of this proof (the case of finite products), there are open subsets Uj of Xj, one for each j ∈ J, such that Qj  ⊆ Uj for every j ∈ J, and Πj ∈ J Uj ⊆ π[R1 ∪ ··· ∪ Rn].  We let UiXi for all i in IJ, and this completes the proof.  Then Qi  ⊆ Ui for every i ∈ IUi=Xi for all i except for finitely many, and Πi ∈ I Ui = π–1 (Πj ∈ J Uj) ⊆ π–1 (π[R1] ∪ ··· ∪ π[Rn]) = π–1 (π[R1]) ∪ ··· ∪ π–1(π[Rn]), and the latter is equal to R1 ∪ ··· ∪ Rn (because each rectangle among R1, …, Rn is supported on J), which is included in W. ☐

We use this to show that finite products compactly Choquet-complete spaces are compactly Choquet-complete. The case of countable products will require an additional trick, and we prefer to show a simpler version first.

Proposition C. The class of compactly Choquet-complete spaces is closed under finite products.  Similarly for stationary compactly Choquet-complete spaces, for convergence Choquet-complete spaces, for stationary convergence Choquet-complete spaces.

Proof. Let (Xi)i ∈ I be a finite family of topological spaces, and for each i ∈ I, let σi be a compactly winning strategy for player α on Xi (resp., and stationary).

We build a (stationary if every σi is stationary) compactly winning strategy for α on Πi ∈ I Xi as follows.  For every point x of Πi ∈ I Xi, we will write x[i] for its component i, namely its image under projection πi, in Xi; there will be sequences of points xn below, and they should not ne confused with the component x[n].  For every open subset W of Πi ∈ I Xi, we will also write W[i] for the projection of W onto component i, namely {x[i] | x ∈ W}.  For every open subset W of Πi ∈ I XiW[i] is open.  We stress the fact that, in general, Πi ∈ I W[i] ≠ W, except (and this is an important exception) when W is an open rectangle.

Given that β has just played xnVn, α finds an open rectangle Wn containing xn and included in Vn.  For each i∈ IWn[i] is an open subset of Xi, and Πi ∈ I Wn[i] = Wn… because Wn is an open rectangle.  Player α then computes Un ≝ Πi ∈ I σi(x0[i], V0[i], U0[i], x1[i], V1[i], U1[i], ···, xn[i], Vn[i]) (in the stationary case, just Πi ∈ I  σi(xn[i], Vn[i])).  In other words, player α simulates playing in each space Xi in parallel. This product Un is open because the index set I is finite. And Un is the value of the desired strategy σ on the history x0V0U0x1V1U1, ···, xnVn (resp, on xnVn in the stationary case). For future reference, we note that U= Πi ∈ I Un[i].

For every i ∈ I, since σi is compactly winning, Qi ≝ ∩n ∈ N Un[i] is compact and non-empty in Xi, and the sets Un[i] form a base of open neighborhoods of Qi when n varies over N.  Let Q ≝ Πi ∈ I Qi.  By Tychonoff’s theorem (Theorem 4.5.12 in the book), Q is compact in Πi ∈ I Xi.  It is also non-empty.  For every n ∈ N, we have Qi∞ ⊆ Un[i] for every i ∈ I, so Q ⊆ Un.

It remains to show that for every open neighborhood W of Q in Πi ∈ I Xi, there is an n ∈ N such that Un ⊆ W.  By Lemma B (our extension of Wallace’s theorem), there is an open rectangle U (hence U = Πi ∈ I U[i]) such that Qi∞ ⊆ U[i] for every i ∈ I, and U ⊆ W.  For every i ∈ IQi∞ ⊆ U[i]; since the sets Un[i] form a base of open neighborhoods of Qi when n varies over N, there is a natural number ni such that Uni[i] ⊆ U[i].  We use the fact that I is finite in order to find a natural number n larger than or equal to ni for every i ∈ I.  Then Un[i] ⊆ U[i] for every i ∈ I. Hence Un= Πi ∈ I Un[i] ⊆ Πi ∈ I U[i] = U ⊆ W.

When all the strategies σi are stationary, the strategy we have built is stationary.  Hence products of stationary compactly Choquet-complete spaces are stationary compactly Choquet-complete.

If the spaces Xi are (stationary) convergence Choquet-complete, then every Qi∞ is of the form ↑xi for some point xi of Xi, so Q = ↑x where x ≝ (xi)i ∈ I.  This shows that Πi ∈ I Xi is (stationary) convergence Choquet-complete.  ☐

The case of infinite countable products is more difficult.

We cannot let α play in all spaces Xi at once in parallel (using strategy σi), because the products of open sets Un[i] would in general fail to be open. Fortunately, the open rectangle Wn that player α built in the proof of Proposition C above… is an open rectangle, hence has a finite support J, and we only need to apply the strategies σi in the finitely many spaces Xi such that iJ. For the other indices i, we let Un[i] be Xi, and then U= Πi ∈ I Un[i] will be an open rectangle.

This solves one problem. Unfortunately, for any given index i, this strategy may decide to never play inside space Xi, if i happens to belong the support of no open rectangle Wn played during the game. In that case, Un[i] will be equal to Xi for every nN, and therefore Qi ≝ ∩n ∈ N Un[i] will be equal to Xi, which may fail to be compact. The solution is to force α to eventually play in every Xi. We will maintain a finite set Jn of indices iI in which we will let α play. Jn will increase (or stay the same) when n increases, and we will force it contain n if n is not already in it.

Theorem D.  The class of compactly Choquet-complete spaces is closed under countable products.  Similarly for convergence Choquet-complete spaces.

Proof.  Since the case of finite products has already been dealt with in Proposition C, we assume a countably infinite (Xi)i ∈ N of topological spaces, indexed by N, and for each i ∈ N, we let σi be a compactly winning strategy for player α on Xi (resp., and stationary).

We build a memoryful compactly winning strategy for α on Πi ∈ N Xi as follows. The memory will consist of a set Jn–1 of positions, as described above (starting with J–1 ≝ ∅), and also, for each jJn–1, of the time (= step number in the game) nj at which we started playing in space Xj.

At step n of the game, where β has just played xnVn, player α finds an open rectangle Wn containing xn and included in Vn, as in the proof of Proposition C.  Let Jn be the union of Jn–1 (from the memory), the support of Wn, and {n} (in order to force α to play in space Xn). We memorize Jn for the next step. For every jJnJn–1, we also memorize njn: we will start playing in those spaces Xj right now, at step n. Then α plays Un ≝ Πi ∈ I Un[i] where:

  • Un[i] ≝ Xi if iNJn (we are not playing in that Xi yet);
  • Un[j] ≝ σj(xnj[j], Vnj[j], Unj[j], xnj+1[j], Vnj+1[j], Unj+1[j], ···, xn[j], Vn[j]) for every jJn: not σj(x0[j], V0[j], U0[j], x1[j], V1[j], U1[j], ···, xn[j], Vn[j])! We need to simulate a game that starts at step nj, hence σj only sees the points and open sets played at step nj and later, but cannot see any previous item in the history. (It does not matter that β can see previous parts of the history.)

Since Jn is finite, Un ≝ Πi ∈ N Un[i] is an open rectangle. For every i ∈ N, the time ni at which α starts playing in space Xi exists. Indeed, nJn, so we even have nin. Since σi is compactly winning, Qi ≝ ∩nni Un[i] is compact and non-empty in Xi, and the sets Un[i] form a base of open neighborhoods of Qi when n varies over the natural numbers ≥ ni.  Let Q ≝ Πi ∈ N Qi.  By Tychonoff’s theorem (Theorem 4.5.12 in the book), Q is compact in Πi ∈ N Xi.  It is also non-empty.  For every n ∈ N, for every i ∈ N, we have Qi∞ ⊆ Un[i] if nni (since Qi ≝ ∩nni Un[i]) but also if n<ni (since then Un[i]=Xi), so Q ⊆ Un.

It remains to show that for every open neighborhood W of Q in Πi ∈ N Xi, there is an n ∈ N such that Un ⊆ W.  By Lemma B, there is an open rectangle U (hence U = Πi ∈ N U[i]) such that Qi∞ ⊆ U[i] for every i ∈ I, and U ⊆ W.  Since U is an open rectangle, the collection of indices i ∈ N such that U[i]≠Xi is finite, call it J.  It is easy to see that Jn contains {0, 1, …, n} for every n ∈ N. Hence JJn for every natural number larger than or equal to m, where m is any fixed natural number larger than or equal to every element of J. For every j ∈ JQj∞ ⊆ U[j]; since the sets Un[j] with nnj form a base of open neighborhoods of Qj, there is a natural number mjnj such that Umj[j] ⊆ U[j].  We use the fact that J is finite in order to find a natural number n larger than or equal to mj for every j ∈ J, and larger than or equal to m.  Then Un[j] ⊆ U[j] for every j ∈ J. For every ∈ NJUn[i] ⊆ U[i] holds trivially because U[i]=Xi, by definition of J. Hence Un= Πi ∈ N Un[i] ⊆ Πi ∈ I U[i] = U ⊆ W.

If the spaces Xi are convergence Choquet-complete, then every Qi∞ is of the form ↑xi for some point xi of Xi, so Q = ↑x where x ≝ (xi)i ∈ I.  This shows that Πi ∈ I Xi is convergence Choquet-complete.  ☐

Images under continuous (almost) open maps

The images of Choquet-complete spaces under continuous open surjective maps are Choquet-complete (Exercise 7.6.19 in the book), and similarly with convergence Choquet-complete spaces (Exercise 7.6.20 in the book).  We adapt the technique to compactly Choquet-complete spaces, and we also take the opportunity to show that this still holds for continuous almost open maps.  A function f : X → Y is almost open if and only if ↑f[U] is open for every open subset U of X; it would be open if and only if f[U] itself, without the need for taking upward closures, were open for every open subset U of X.

Theorem E. The following classes are closed under images by continuous almost open surjective maps: Choquet-complete spaces, convergence Choquet-complete spaces, compactly Choquet-complete spaces and their stationary variants.

Proof. Let f : X → Y be a continuous almost open surjective map.  Since f is surjective, using the Axiom of Choice, there is a function s : Y → X such that f o s = idY.  The function s is not in general continuous.

We start with stationary strategies.  Given a stationary strategy σ for α on X, we build a stationary strategy σ’ for α on Y by letting σ'(ynVn) be Un ≝ ↑f[U’n] where U’n ≝ σ(s(yn), f–1(Vn)). We have yn ∈ Un = ↑f[U’n] because s(yn) ∈ U’n, so yn = f(s(yn)) ∈ f[U’n]; and Un = ↑f[U’n] ⊆ Vn, too: since U’n ⊆ f–1(Vn), we obtain f[U’n] ⊆ Vn hence also ↑f[U’n] ⊆ Vn since Vn is upwards-closed.

If σ is winning (in the sense used for plain Choquet-completeness), then ∩n ∈ N U’is  non-empty.  We pick a point x in ∩n ∈ N U’n, and then f(x) is in every f[U’n], hence in every Un = ↑f[U’n], hence in ∩n ∈ N Un.  If σ is convergent winning, then we can pick x so that the sets U’n form a base of open neighborhoods of x.  For every open neighborhood U of f(x), x is in f–1(U), and therefore U’n is included in f–1(U) for some n ∈ N.  Then f[U’n] is included in U, and since U is upwards-closed, Un = ↑f[U’n] is included in U.

If σ is compactly winning, then ∩n ∈ N U’n is a compact non-empty set Q’, and the sets U’n form a base of open neighborhoods of Q’.  Let Q ≝ ∩n ∈ N Un.  We claim that Q = ↑f[Q’].  That is not completely obvious, since direct images under f do not in general commute with unions, and similarly for upward closures. Since Q’ ⊆ U’n for every n ∈ N, ↑f[Q’] ⊆ ↑f[U’n] = Un for every n ∈ N, so ↑f[Q’] ⊆ Q. Conversely, since Q is an intersection of upwards-closed sets, Q is itself upwards-closed, i.e., saturated.  In order to show that Q∞ ⊆ ↑f[Q’], it suffices to show that every open neighborhood U of ↑f[Q’] contains Q.  Since ↑f[Q’] ⊆ UQ’∞ is included in f–1(U).  Since the sets U’n form a base of open neighborhoods of Q’, one of them is included in f–1(U).  Then f[U’n] ⊆ U, hence Un = ↑f[U’n] ⊆ U since U is upwards-closed.  Now Q ⊆ Un, so Q ⊆ U.  This concludes our argument showing that Q∞ ⊆ ↑f[Q’], and therefore that Q∞ = ↑f[Q’].  In passing, we have shown that for every open neighborhood U of ↑f[Q’], there is an n ∈ N such that Un = ↑f[U’n] ⊆ U.  Therefore the sets Un form a base of open neighborhoods of Q.  It follows that σ’ is compactly winning.

In the general case, we are given a strategy σ for α on X, not necessarily stationary.  We build a memoryful strategy σ’ for α on Y as follows.  The memory will consist of a list of open subsets U’0U’1, ···, U’n–1 of X.  Given a history y0V0U0y1V1U1, ···, ynVn on Y, we form a corresponding history s(y0), f–1(V0), U’0s(y1), f–1(V1), U’1, ···, s(yn), f–1(Vn) on X.  Notice that we completely ignore U0U1, ···, Un–1, and we use the memory U’0U’1, ···, U’n–1  instead.  We apply σ to that history, obtaining an open subset U’n of X that contains s(yn) and is included in f–1(Vn).  Then we add U’to the memory, this obtaining U’0U’1, ···, U’n–1U’n as new memory, and we return Un ≝ ↑f[U’n] as the value of σ'(y0V0U0y1V1U1, ···, ynVn) we were seeking to define.

Now let us assume that β plays according to some strategy τ on Y.  We obtain a mirror strategy τ’ for β on X by letting τ'(x0V’0U’0x1V’1U’1, ···, xn–1V’n–1U’n–1) be  xnV’n where ynVn ≝ τ(f(x0), ↑f[V’0], ↑f[U’0], f(x1), ↑f[V’1], ↑f[U’1], ···, f(xn–1), ↑f[V’n–1], ↑f[U’n–1]), xn ≝ s(yn) and V’n ≝ f–1(Vn).

The key point is that: (*) for every open subset of Y, ↑f[f–1(V)] = V.  Indeed, in one direction for every y ∈ V, since f is surjective, we can write y as f(x) for some x ∈ X.  Then x ∈ f–1(V), so y = f(x) ∈ f[f–1(V)] ⊆ ↑f[f–1(V)].  In the other direction, we wish to show ↑f[f–1(V)] ⊆ V.  Since V is upwards-closed, it suffices to show f[f–1(V)] ⊆ V.  Every point in the left-hand side if equal to f(x) for some x ∈ f–1(V), and then f(x) ∈ V, which shows the claim.

If α plays according to σ’ and β plays according to τ on (the σ’/τ scenario), then we produce the following items:

  • y0V0 ≝ τ();
  • U0 ≝ ↑f[U’0], where U’0 ≝ σ(s(y0), f–1(V0));
  • y1V1 ≝ τ(y0V0U0);
  • U1 ≝ ↑f[U’1], where U’1 ≝ σ(s(y0), f–1(V0), U’0s(y1), f–1(V1)); note that U’0 is obtained from the memory;
  • etc.

If α plays according to σ and β plays according to τ’ on (the σ/τ’ scenario), then we produce the following items:

  • x0V’0 where y0V0 ≝ τ(), x0 ≝ s(y0) and V’0 ≝ f–1(V0);
  • U’0 ≝ σ(x0V’0); this is the same  U’0 as in the σ’/τ scenario;
  • x1V’1 where y1V1 ≝ τ(f(x0), ↑f[V’0], ↑f[U’0]), x1 ≝ s(y1) and V’1 ≝ f–1(V1); now  f(x0)=f(s(y0)),  ↑f[V’0] = ↑f[f–1(V0)] = V0 by (*), so defining  U0 ≝ ↑f[U’0], as in the σ’/τ scenario, y1V1 is equal to τ(y0V0U0),  as in the σ’/τ scenario;
  • U’1 ≝ σ(x0V’0U’0x1V’1); since  x0=s(y0), V’0=f–1(V0), x1=s(y1), and V’1 = f–1(V1), this is the same U’1 as in the σ’/τ scenario;
  • etc.

In the end, we obtain the same sets U’n and Un = ↑f[U’n] in both scenarios.

Then ∩n ∈ N U’n is non-empty, or the sets U’n form a base of open neighborhoods of some point x, or of some non-empty compact set Q’, depending on whether σ is winning, convergent winning, or compactly winning.  By the same argument as in the stationary cases, ∩n ∈ N Un is non-empty, or the sets Un form a base of open neighborhoods of some point x, or of some non-empty compact set Q ≝ ∩n ∈ N Un which we prove equal to ↑f[Q’], depending on whether σ is winning, convergent winning, or compactly winning.  Hence σ’ is winning, convergent winning, or compactly winning, depending on the case.  ☐

  1. Matthew de Brecht, Jean Goubault-Larrecq, Xiaodong Jia, and Zhenchao Lyu. Domain-complete and LCS-complete Spaces. In Proceedings of the International Symposium on Domain Theory (ISDT’19), volume 345 of Electronic Notes in Theoretical Computer Science, pages 3–35, Yangzhou, China, June 2019. Elsevier Science Publishers. doi:10.1016/j.entcs.2019.07.014.
  2. Choquet, Gustave. 1969. Lectures on Analysis. Mathematics Lecture Note Series, vol. I – Integration and Topological Vector Spaces. W.A. Benjamin, Inc.
  3. Dorais, François G., and Mummert, Carl. 2010. Stationary and Convergent Strategies in Choquet Games. Fundamenta Mathematicae 209:59–79.
  4. de Brecht, Matthew.  2013. Quasi-Polish spaces, Annals of Pure and Applied Logic 164:356–381.
  5. Isbell, John R. 1975. Function spaces and adjoints, Mathematica Scandinavica 36:317–339.
jgl-2011

Jean Goubault-Larrecq (October 20th, 2025)