startegies and tactics in measure games
play

Startegies and tactics in measure games Grzegorz Plebanek, Piotr - PDF document

Startegies and tactics in measure games Grzegorz Plebanek, Piotr Borodulin-Nadzieja Lecce, December 2005 1 Game For a family of sets J we consider game BM ( J ) with two players ( Empty , who starts the game with an element of J and Non- empty


  1. Startegies and tactics in measure games Grzegorz Plebanek, Piotr Borodulin-Nadzieja Lecce, December 2005 1

  2. Game For a family of sets J we consider game BM ( J ) with two players ( Empty , who starts the game with an element of J and Non- empty ). Players have to choose sets from J included in the last move of the adversary. Empty wins if the intersection of the game is empty. Strategy A function σ : J <ω − → J is called winning strategy for Nonempty in BM ( J ) if � K n � = ∅ , n ∈ ω whenever ( K n ) n ∈ ω is a sequence in J such that K n +1 ⊆ σ ( K 0 , ..., K n ) for every n . 2

  3. Topology If ( X, τ ) is a topological space, we can con- sider a game BM ( τ \ {∅} ). It is usually called a Choquet game. It is convenient to say that a topological space X is Choquet if Nonempty has a winning strategy in BM ( X ). Theorem (Oxtoby) A nonempty topological space X is a Baire space iff Empty has no win- ning strategy in the game BM ( X ) Corollary Every Choquet space is Baire. 3

  4. Measures For a measure µ on Σ we can consider a game BM (Σ + ). We will say that a measure µ | Σ is weakly α -favourable if Nonempty has a winning strategy in BM (Σ + ). Theorem (Fremlin) Every weakly α -favourable measure is perfect. Explanation A measure ( X, Σ , µ ) is perfect if for every measurable function f : X → [0 , 1] and every E ∈ Borel ([0 , 1]) such that f − 1 ( E ) ∈ Σ we can find a borel set B ⊆ E such that µf − 1 ( E ) = µf − 1 ( B ) . 4

  5. Strategy A function σ : J <ω − → J is called winning strategy for Nonempty in BM ( J ) if � K n � = ∅ , n ∈ ω whenever ( K n ) n ∈ ω is a sequence in J such that K n +1 ⊆ σ ( K 0 , ..., K n ) for every n . Tactic A function τ : J − → J is called winning tactic for Nonempty in BM ( J ) if � K n � = ∅ , n ∈ ω whenever ( K n ) n ∈ ω is a sequence in J such that K n +1 ⊆ τ ( K n ) for every n . 5

  6. Theorem (Debs) There is a class J for which Nonempty has a winning strategy in BM ( J ) but doesn’t have any winning tactic. Example Let Baire be the algebra of subsets of [0 , 1] with the Baire property, and M the ideal of meager subsets of [0 , 1]. Denote by J the family Baire \ M . Nonempty has a winning strategy in BM ( J ). Nonempty doesn’t have a winning tactic in BM ( J ). 6

  7. Fact Nonempty doesn’t have a winning tactic in BM ( J ). Let U be a countable base for the topology of [0 , 1], not containing the empty set. Assume for the contradiction that there is a winning tactic for Nonempty in BM ( J ). Denote it by τ . For every U ∈ U there is a V ∈ U ( good for U ) such that for every M ∈ M V ⊆ ∗ τ ( U \ N ) . ∀ M ∈ M ∃ N ∈ M N ⊇ M Construct a sequence ( V n ) n ∈ ω such that V n +1 is good for V n for every n and � n ∈ ω V n contains at most one point. The sequence ( V n ) n ∈ ω is a framework of the play for which Nonempty’s tactic fails. 7

  8. We will say that a measure µ | Σ is weakly α - favourable if Nonempty has a winning strategy in BM (Σ + ). We will say that a measure µ | Σ is α -favourable if Nonempty has a winning tactic in BM (Σ + ). Problem Is every weakly α -favourable measure α -favourable? 8

  9. countably compact = ⇒ α -favourable = ⇒ weakly ⇒ perfect α -favourable = Definition Family of sets K is countably com- pact if for every sequence ( K n ) n ∈ ω of sets from K such that its every finite intersection is non- empty, we have � K n � = ∅ . n ∈ ω Definition (Marczewski) Measure µ | Σ is count- ably compact if it is inner regular with respect to some countably compact class K , it means for every E ∈ Σ we have µ ( E ) = sup { µ ( K ): K ∈ K , K ⊆ E } . 9

  10. Question Does every measure defined on sub- σ -algebra Σ of Borel ([0 , 1]) need to be count- ably compact? Theorem (Fremlin) Every measure defined on Σ ⊆ Borel ([0 , 1]) is weakly α -favourable. Theorem (Plebanek, PBN) A measure µ | Σ (where Σ as above) is countably compact pro- vided there is a family { B α } α<ω 1 of analytic sets, such that µ is regular with respect to the family of those E ∈ Σ for which there is α < ω 1 such that E ⊆ B α is closed in B α . Theorem (Plebanek, PBN) Every measure de- fined on sub- σ -algebra of Borel ([0 , 1]) is an im- age of a monocompact measure. 10

  11. Theorem (Fremlin) Every measure defined on Σ ⊆ Borel ([0 , 1]) is weakly α -favourable. • for n ∈ ω and ψ ∈ ω n denote V ( ψ ) = { x ∈ N : x ( k ) ≤ ψ ( k ) for all k < n } ; • let A n be n -th move of Nonempty and B n - n -th move of his adversary; • let F n ∈ Closed ([0 , 1] × ω ω ) such that π ( F n ) = A n ; • Nonempty will construct inductively collec- tion of functions ( φ n ) n ∈ ω from ω ω such that µ ∗ ( Y n ) > 0, where n � Y n = π ( F k ∩ ([0 , 1] × V ( φ k | n )) k =0 11

  12. • Nonempty will construct inductively collec- tion of functions ( φ n ) n ∈ ω from ω ω such that µ ∗ ( Y n ) > 0, where n � Y n = π ( F k ∩ ([0 , 1] × V ( φ k | n )) k =0 and play the measurable hull of Y n as B n ; • consider any sequence x n ∈ Y n , which is convergent (to some x ∈ [0 , 1]); • fix k ∈ ω ; • for every n ≥ k we can find y n ∈ F k ∩ ([0 , 1] × V ( φ k | n )) moreover we can assume that ( y n ) n con- verges to some y ∈ ω ω ; • then ( x, y ) ∈ F k and thus x ∈ A k but k was arbitrary.

  13. References: • D. H. Fremlin, Weakly α -favourable mea- sure spaces , Fundamenta Mathematicae 165 (2000). • G. Debs, Strat´ egies gagnantes dans cer- tains jeux topologiques , Fundamenta Math- ematicae 126 (1985). • G. Plebanek, PBN, On compactness of mea- sures on Polish spaces , Illinois Journal of Mathematics 42 (2005), no 2. 12

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend