ultrafilters closure operators and the axiom of choice
play

Ultrafilters, Closure operators and the Axiom of Choice Gonc alo - PowerPoint PPT Presentation

Ultrafilters, Closure operators and the Axiom of Choice Gonc alo Gutierres CMUC/Universidade de Coimbra It is well known that, in a topological space, the open sets can be characterized using filter convergence. In ZF , we cannot replace


  1. Ultrafilters, Closure operators and the Axiom of Choice Gonc ¸alo Gutierres – CMUC/Universidade de Coimbra It is well known that, in a topological space, the open sets can be characterized using filter convergence. In ZF , we cannot replace filters by ultrafilters. It can be proven that the ultrafilter convergence determines the open sets for every topological space if and only if the Ultrafilter Theorem holds. More, we can also prove that the Ultrafilter Theorem is equivalent to the fact that u X = k X for every topological space X , where k is the usual Kuratowski closure operator and u is the ultrafilter closure, with u X ( A ) := { x ∈ X : ( ∃U ultrafilter in X )[ U converges to x and A ∈ U ] } . These facts arise two different questions that we will try to answer in this talk. 1. Under which set theoretic conditions the equality u = k is true in some subclasses of topological spaces, such as first countable spaces, metric spaces or { R } . 2. Is there any topological space X for which u X � = k X , but the open sets are characterized by the ultrafilter convergence?

  2. ZF – Zermelo-Fraenkel set theory without the Axiom of Choice. ZFC – Zermelo-Fraenkel set theory with the Axiom of Choice.

  3. ZF – Zermelo-Fraenkel set theory without the Axiom of Choice. ZFC – Zermelo-Fraenkel set theory with the Axiom of Choice. UFT – Ultrafilter Theorem: every filter over a set can extended to an ultrafilter. CUF – Countable Ultrafilter Theorem: the Ultrafilter Theorem holds for filters with a countable base. CUF( R ) – the Ultrafilter Theorem holds for filters in R with a countable base.

  4. ZF – Zermelo-Fraenkel set theory without the Axiom of Choice. ZFC – Zermelo-Fraenkel set theory with the Axiom of Choice. UFT – Ultrafilter Theorem: every filter over a set can extended to an ultrafilter. CUF – Countable Ultrafilter Theorem: the Ultrafilter Theorem holds for filters with a countable base. CUF( R ) – the Ultrafilter Theorem holds for filters in R with a countable base. CC – the Axiom of Countable Choice. Every countable family of non-empty sets has a choice function.

  5. Topological spaces ( X, T ) – topological space A ⊆ X Theorem 1 [ZFC] x ∈ A ⇐ ⇒ ( ∃ U ultrafilter in X )[ U → x and A ∈ U ]

  6. Topological spaces ( X, T ) – topological space A ⊆ X Theorem 1 [ZFC] x ∈ A ⇐ ⇒ ( ∃ U ultrafilter in X )[ U → x and A ∈ U ] Theorem 2 [ZFC] A ∈ T ⇐ ⇒ [ U → x ∈ A = ⇒ A ∈ U ]

  7. Equivalent are:

  8. Equivalent are: The Ultrafilter Theorem;

  9. Equivalent are: The Ultrafilter Theorem; For every topological space ( X, T ) and A ⊆ X x ∈ A ⇐ ⇒ ( ∃ U ultrafilter in X )[ U → x and A ∈ U ] ;

  10. Equivalent are: The Ultrafilter Theorem; For every topological space ( X, T ) and A ⊆ X x ∈ A ⇐ ⇒ ( ∃ U ultrafilter in X )[ U → x and A ∈ U ] ; For every topological space ( X, T ) and A ⊆ X A ∈ T ⇐ ⇒ [ U → x ∈ A = ⇒ A ∈ U ] .

  11. Ultrafilter Closure Operator u X ( A ) := { x ∈ X : ( ∃ U in X )[ U → x and A ∈ U ] }

  12. Ultrafilter Closure Operator u X ( A ) := { x ∈ X : ( ∃ U in X )[ U → x and A ∈ U ] } u X ( A ) := � { B : A ⊆ B and u X ( B ) = B } ˆ

  13. Ultrafilter Closure Operator u X ( A ) := { x ∈ X : ( ∃ U in X )[ U → x and A ∈ U ] } u X ( A ) := � { B : A ⊆ B and u X ( B ) = B } ˆ k X ( A ) denotes the usual closure.

  14. Ultrafilter Closure Operator u X ( A ) := { x ∈ X : ( ∃ U in X )[ U → x and A ∈ U ] } u X ( A ) := � { B : A ⊆ B and u X ( B ) = B } ˆ k X ( A ) denotes the usual closure. For all X , u X = k X . Theorem 1 For all X , ˆ u X = k X . Theorem 2

  15. Question Is the ultrafilter closure idempotent? ( u = ˆ u ?)

  16. Question Is the ultrafilter closure idempotent? ( u = ˆ u ?) Is there a topological space X for which ˆ u X = k X but u X � = k X ?

  17. Question Is the ultrafilter closure idempotent? ( u = ˆ u ?) Is there a topological space X for which ˆ u X = k X but u X � = k X ? The Ultrafilter Theorem is not equivalent to u = ˆ u .

  18. Diagonal Ultrafilter UX – the set of all ultrafilters in X . Let X ∈ U 2 X and U ∈ UX , X → U if for all A ∈ U , {U ∈ UX : ( ∃ x ∈ A )[ U → x } ∈ X .

  19. Diagonal Ultrafilter UX – the set of all ultrafilters in X . Let X ∈ U 2 X and U ∈ UX , X → U if for all A ∈ U , {U ∈ UX : ( ∃ x ∈ A )[ U → x } ∈ X . m X ( X ) := { A ⊆ X : X ∈ U 2 A } Proposition [ZF] X → U → x = ⇒ m X ( X ) → x

  20. Example If:

  21. Example If: 1. there is a set with no free ultrafilters,

  22. Example If: 1. there is a set with no free ultrafilters, 2. there is a free ultrafilter on N ,

  23. Example If: 1. there is a set with no free ultrafilters, 2. there is a free ultrafilter on N , 3. every infinite set can be mapped onto N ;

  24. Example If: 1. there is a set with no free ultrafilters, 2. there is a free ultrafilter on N , 3. every infinite set can be mapped onto N ; then there is a topological space where the ultrafilter closure is not idempotent.

  25. Example If: 1. there is a set with no free ultrafilters, 2. there is a free ultrafilter on N , 3. every infinite set can be mapped onto N ; then there is a topological space where the ultrafilter closure is not idempotent. Is there any model of ZF where these three conditions are satisfied?

  26. Other classes The following conditions are equivalente to CUF :

  27. Other classes The following conditions are equivalente to CUF : (i) u = k in the class of the first countable spaces;

  28. Other classes The following conditions are equivalente to CUF : (i) u = k in the class of the first countable spaces; (ii) ˆ u = k in the class of the first countable spaces;

  29. Other classes The following conditions are equivalente to CUF : (i) u = k in the class of the first countable spaces; (ii) ˆ u = k in the class of the first countable spaces; (iii) u = k in the class of the metric spaces;

  30. Other classes The following conditions are equivalente to CUF : (i) u = k in the class of the first countable spaces; (ii) ˆ u = k in the class of the first countable spaces; (iii) u = k in the class of the metric spaces; (iv) ˆ u = k in the class of the metric spaces.

  31. Other classes The following conditions are equivalente to CUF : (i) u = k in the class of the first countable spaces; (ii) ˆ u = k in the class of the first countable spaces; (iii) u = k in the class of the metric spaces; (iv) ˆ u = k in the class of the metric spaces. CC + N has a free ultrafilter = ⇒ CUF

  32. Real space The following conditions are equivalente to CUF( R ) :

  33. Real space The following conditions are equivalente to CUF( R ) : (i) u R = k R ;

  34. Real space The following conditions are equivalente to CUF( R ) : (i) u R = k R ; (ii) u = k in the class of the second countable T 0 -spaces;

  35. Real space The following conditions are equivalente to CUF( R ) : (i) u R = k R ; (ii) u = k in the class of the second countable T 0 -spaces; (iii) ˆ u = k in the class of the second countable T 0 -spaces.

  36. Real space The following conditions are equivalente to CUF( R ) : (i) u R = k R ; (ii) u = k in the class of the second countable T 0 -spaces; (iii) ˆ u = k in the class of the second countable T 0 -spaces. AC ( R ) ⇒ CC ( R ) + N has a free ultrafilter ⇒ CUF( R )

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