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

ultrafilters closure operators and the axiom of choice
SMART_READER_LITE
LIVE PREVIEW

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


slide-1
SLIDE 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 uX = kX for every topological space X, where k is the usual Kuratowski closure operator and u is the ultrafilter closure, with uX(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 uX = kX, but the open sets are

characterized by the ultrafilter convergence?

slide-2
SLIDE 2

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

slide-3
SLIDE 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.

slide-4
SLIDE 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.

slide-5
SLIDE 5

Topological spaces

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

slide-6
SLIDE 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]

slide-7
SLIDE 7

Equivalent are:

slide-8
SLIDE 8

Equivalent are: The Ultrafilter Theorem;

slide-9
SLIDE 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] ;

slide-10
SLIDE 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] .

slide-11
SLIDE 11

Ultrafilter Closure Operator

uX(A) := {x ∈ X : (∃ U in X)[U → x and A ∈ U]}

slide-12
SLIDE 12

Ultrafilter Closure Operator

uX(A) := {x ∈ X : (∃ U in X)[U → x and A ∈ U]} ˆ uX(A) := {B : A ⊆ B and uX(B) = B}

slide-13
SLIDE 13

Ultrafilter Closure Operator

uX(A) := {x ∈ X : (∃ U in X)[U → x and A ∈ U]} ˆ uX(A) := {B : A ⊆ B and uX(B) = B} kX(A) denotes the usual closure.

slide-14
SLIDE 14

Ultrafilter Closure Operator

uX(A) := {x ∈ X : (∃ U in X)[U → x and A ∈ U]} ˆ uX(A) := {B : A ⊆ B and uX(B) = B} kX(A) denotes the usual closure. Theorem 1 For all X, uX = kX. Theorem 2 For all X, ˆ uX = kX.

slide-15
SLIDE 15

Question

Is the ultrafilter closure idempotent? (u = ˆ u?)

slide-16
SLIDE 16

Question

Is the ultrafilter closure idempotent? (u = ˆ u?) Is there a topological space X for which ˆ uX = kX but uX = kX?

slide-17
SLIDE 17

Question

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

slide-18
SLIDE 18

Diagonal Ultrafilter

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

slide-19
SLIDE 19

Diagonal Ultrafilter

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

slide-20
SLIDE 20

Example

If:

slide-21
SLIDE 21

Example

If:

  • 1. there is a set with no free ultrafilters,
slide-22
SLIDE 22

Example

If:

  • 1. there is a set with no free ultrafilters,
  • 2. there is a free ultrafilter on N,
slide-23
SLIDE 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;
slide-24
SLIDE 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.

slide-25
SLIDE 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?

slide-26
SLIDE 26

Other classes

The following conditions are equivalente to CUF:

slide-27
SLIDE 27

Other classes

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

slide-28
SLIDE 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;

slide-29
SLIDE 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;

slide-30
SLIDE 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.

slide-31
SLIDE 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

slide-32
SLIDE 32

Real space

The following conditions are equivalente to CUF(R):

slide-33
SLIDE 33

Real space

The following conditions are equivalente to CUF(R): (i) uR = kR ;

slide-34
SLIDE 34

Real space

The following conditions are equivalente to CUF(R): (i) uR = kR ; (ii) u = k in the class of the second countable T0-spaces;

slide-35
SLIDE 35

Real space

The following conditions are equivalente to CUF(R): (i) uR = kR ; (ii) u = k in the class of the second countable T0-spaces; (iii) ˆ u = k in the class of the second countable T0-spaces.

slide-36
SLIDE 36

Real space

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