• Non ci sono risultati.

Descriptive set theory

N/A
N/A
Protected

Academic year: 2021

Condividi "Descriptive set theory"

Copied!
422
0
0

Testo completo

(1)

Descriptive set theory

(2)

Descriptive set theory: classical and effective

I Classical descriptive set theory was founded by people like Baire, Borel, Lebesgue, Luzin, Suslin, Sierpinskpi and others in the first two decades of the XXth century. It studies the descriptive complexity of sets of real numbers.

I Effective descriptive set theory was created later by introducing into the classical theory the new and powerful tools developed from recursion theory.

(3)

Descriptive set theory: classical and effective

I Classical descriptive set theory was founded by people like Baire, Borel, Lebesgue, Luzin, Suslin, Sierpinskpi and others in the first two decades of the XXth century. It studies the descriptive complexity of sets of real numbers.

I Effective descriptive set theory was created later by introducing into the classical theory the new and powerful tools developed from recursion theory.

(4)

Basic review on topological and metric spaces

Let X be a topological space.

I X is T1if given x , y ∈ X there is a neighbourhood of x that does not contain y (and viceversa); equivalently, every singleton is closed.

I X is regular if X is T1and whenever x ∈ X , A ⊆ X , A is closed and x /∈ A, point x and set A have disjoint neighbourhoods; equivalently, x is T1and for all x and any open neighbourhood U of x , there is an open neighbourhood V of x with ¯V ⊆ U.

I X is normal if X is T1and any two disjoint closed subsets have disjoint neighbourhoods.

I X is Baire if the intersection of countably many open dense sets is dense.

I A subset of X is Gδ if it is a countable intersection of open sets. The complement of a Gδ is an Fσ set: a countable union of closed sets.

I If (X , d ) is a metric space, then d0= 1+dd is a metric compatible with d . Notice that d0 ≤ 1 and d is complete iff d0 is complete.

(5)

Basic review on topological and metric spaces

Let X be a topological space.

I X is T1if given x , y ∈ X there is a neighbourhood of x that does not contain y (and viceversa); equivalently, every singleton is closed.

I X is regular if X is T1and whenever x ∈ X , A ⊆ X , A is closed and x /∈ A, point x and set A have disjoint neighbourhoods; equivalently, x is T1and for all x and any open neighbourhood U of x , there is an open neighbourhood V of x with ¯V ⊆ U.

I X is normal if X is T1and any two disjoint closed subsets have disjoint neighbourhoods.

I X is Baire if the intersection of countably many open dense sets is dense.

I A subset of X is Gδ if it is a countable intersection of open sets. The complement of a Gδ is an Fσ set: a countable union of closed sets.

I If (X , d ) is a metric space, then d0= 1+dd is a metric compatible with d . Notice that d0 ≤ 1 and d is complete iff d0 is complete.

(6)

Basic review on topological and metric spaces

Let X be a topological space.

I X is T1if given x , y ∈ X there is a neighbourhood of x that does not contain y (and viceversa); equivalently, every singleton is closed.

I X is regular if X is T1and whenever x ∈ X , A ⊆ X , A is closed and x /∈ A, point x and set A have disjoint neighbourhoods;

equivalently, x is T1and for all x and any open neighbourhood U of x , there is an open neighbourhood V of x with ¯V ⊆ U.

I X is normal if X is T1and any two disjoint closed subsets have disjoint neighbourhoods.

I X is Baire if the intersection of countably many open dense sets is dense.

I A subset of X is Gδ if it is a countable intersection of open sets. The complement of a Gδ is an Fσ set: a countable union of closed sets.

I If (X , d ) is a metric space, then d0= 1+dd is a metric compatible with d . Notice that d0 ≤ 1 and d is complete iff d0 is complete.

(7)

Basic review on topological and metric spaces

Let X be a topological space.

I X is T1if given x , y ∈ X there is a neighbourhood of x that does not contain y (and viceversa); equivalently, every singleton is closed.

I X is regular if X is T1and whenever x ∈ X , A ⊆ X , A is closed and x /∈ A, point x and set A have disjoint neighbourhoods; equivalently, x is T1and for all x and any open neighbourhood U of x , there is an open neighbourhood V of x with ¯V ⊆ U.

I X is normal if X is T1and any two disjoint closed subsets have disjoint neighbourhoods.

I X is Baire if the intersection of countably many open dense sets is dense.

I A subset of X is Gδ if it is a countable intersection of open sets. The complement of a Gδ is an Fσ set: a countable union of closed sets.

I If (X , d ) is a metric space, then d0= 1+dd is a metric compatible with d . Notice that d0 ≤ 1 and d is complete iff d0 is complete.

(8)

Basic review on topological and metric spaces

Let X be a topological space.

I X is T1if given x , y ∈ X there is a neighbourhood of x that does not contain y (and viceversa); equivalently, every singleton is closed.

I X is regular if X is T1and whenever x ∈ X , A ⊆ X , A is closed and x /∈ A, point x and set A have disjoint neighbourhoods; equivalently, x is T1and for all x and any open neighbourhood U of x , there is an open neighbourhood V of x with ¯V ⊆ U.

I X is normal if X is T1and any two disjoint closed subsets have disjoint neighbourhoods.

I X is Baire if the intersection of countably many open dense sets is dense.

I A subset of X is Gδ if it is a countable intersection of open sets. The complement of a Gδ is an Fσ set: a countable union of closed sets.

I If (X , d ) is a metric space, then d0= 1+dd is a metric compatible with d . Notice that d0 ≤ 1 and d is complete iff d0 is complete.

(9)

Basic review on topological and metric spaces

Let X be a topological space.

I X is T1if given x , y ∈ X there is a neighbourhood of x that does not contain y (and viceversa); equivalently, every singleton is closed.

I X is regular if X is T1and whenever x ∈ X , A ⊆ X , A is closed and x /∈ A, point x and set A have disjoint neighbourhoods; equivalently, x is T1and for all x and any open neighbourhood U of x , there is an open neighbourhood V of x with ¯V ⊆ U.

I X is normal if X is T1and any two disjoint closed subsets have disjoint neighbourhoods.

I X is Baire if the intersection of countably many open dense sets is dense.

I A subset of X is Gδ if it is a countable intersection of open sets. The complement of a Gδ is an Fσ set: a countable union of closed sets.

I If (X , d ) is a metric space, then d0= 1+dd is a metric compatible with d . Notice that d0 ≤ 1 and d is complete iff d0 is complete.

(10)

Basic review on topological and metric spaces

Let X be a topological space.

I X is T1if given x , y ∈ X there is a neighbourhood of x that does not contain y (and viceversa); equivalently, every singleton is closed.

I X is regular if X is T1and whenever x ∈ X , A ⊆ X , A is closed and x /∈ A, point x and set A have disjoint neighbourhoods; equivalently, x is T1and for all x and any open neighbourhood U of x , there is an open neighbourhood V of x with ¯V ⊆ U.

I X is normal if X is T1and any two disjoint closed subsets have disjoint neighbourhoods.

I X is Baire if the intersection of countably many open dense sets is dense.

I A subset of X is Gδ if it is a countable intersection of open sets.

The complement of a Gδ is an Fσ set: a countable union of closed sets.

I If (X , d ) is a metric space, then d0= 1+dd is a metric compatible with d . Notice that d0 ≤ 1 and d is complete iff d0 is complete.

(11)

Basic review on topological and metric spaces

Let X be a topological space.

I X is T1if given x , y ∈ X there is a neighbourhood of x that does not contain y (and viceversa); equivalently, every singleton is closed.

I X is regular if X is T1and whenever x ∈ X , A ⊆ X , A is closed and x /∈ A, point x and set A have disjoint neighbourhoods; equivalently, x is T1and for all x and any open neighbourhood U of x , there is an open neighbourhood V of x with ¯V ⊆ U.

I X is normal if X is T1and any two disjoint closed subsets have disjoint neighbourhoods.

I X is Baire if the intersection of countably many open dense sets is dense.

I A subset of X is Gδ if it is a countable intersection of open sets. The complement of a Gδ is an Fσ set: a countable union of closed sets.

I If (X , d ) is a metric space, then d0= 1+dd is a metric compatible with d . Notice that d0 ≤ 1 and d is complete iff d0 is complete.

(12)

Basic review on topological and metric spaces

Let X be a topological space.

I X is T1if given x , y ∈ X there is a neighbourhood of x that does not contain y (and viceversa); equivalently, every singleton is closed.

I X is regular if X is T1and whenever x ∈ X , A ⊆ X , A is closed and x /∈ A, point x and set A have disjoint neighbourhoods; equivalently, x is T1and for all x and any open neighbourhood U of x , there is an open neighbourhood V of x with ¯V ⊆ U.

I X is normal if X is T1and any two disjoint closed subsets have disjoint neighbourhoods.

I X is Baire if the intersection of countably many open dense sets is dense.

I A subset of X is Gδ if it is a countable intersection of open sets. The complement of a Gδ is an Fσ set: a countable union of closed sets.

I If (X , d ) is a metric space, then d0= 1+dd is a metric compatible with d .

Notice that d0 ≤ 1 and d is complete iff d0 is complete.

(13)

Basic review on topological and metric spaces

Let X be a topological space.

I X is T1if given x , y ∈ X there is a neighbourhood of x that does not contain y (and viceversa); equivalently, every singleton is closed.

I X is regular if X is T1and whenever x ∈ X , A ⊆ X , A is closed and x /∈ A, point x and set A have disjoint neighbourhoods; equivalently, x is T1and for all x and any open neighbourhood U of x , there is an open neighbourhood V of x with ¯V ⊆ U.

I X is normal if X is T1and any two disjoint closed subsets have disjoint neighbourhoods.

I X is Baire if the intersection of countably many open dense sets is dense.

I A subset of X is Gδ if it is a countable intersection of open sets. The complement of a Gδ is an Fσ set: a countable union of closed sets.

I If (X , d ) is a metric space, then d0= 1+dd is a metric compatible with d . Notice that d0 ≤ 1 and d is complete iff d0 is complete.

(14)

Basic review on topological and metric spaces

Urysohn’s theorem. Let X be second countable. Then X is metrisable iff it is regular.

Urysohn’s lemma. If X is metrisable and A, B ⊆ X are closed and disjoint, then ∃f : X → [0, 1] continuous s.t. f (A) ⊆ {0}, f (B) ⊆ {1}. Tietze’s extension theorem. If X is metrisable, A ⊆ X is closed and f : A → R is continuous, then ∃g : X → R continuous s.t. f ⊆ g . If moreover sup f ≤ M, then one can find g with sup g ≤ M.

(15)

Basic review on topological and metric spaces

Urysohn’s theorem. Let X be second countable. Then X is metrisable iff it is regular.

Urysohn’s lemma. If X is metrisable and A, B ⊆ X are closed and disjoint, then ∃f : X → [0, 1] continuous s.t. f (A) ⊆ {0}, f (B) ⊆ {1}.

Tietze’s extension theorem. If X is metrisable, A ⊆ X is closed and f : A → R is continuous, then ∃g : X → R continuous s.t. f ⊆ g . If moreover sup f ≤ M, then one can find g with sup g ≤ M.

(16)

Basic review on topological and metric spaces

Urysohn’s theorem. Let X be second countable. Then X is metrisable iff it is regular.

Urysohn’s lemma. If X is metrisable and A, B ⊆ X are closed and disjoint, then ∃f : X → [0, 1] continuous s.t. f (A) ⊆ {0}, f (B) ⊆ {1}.

Tietze’s extension theorem. If X is metrisable, A ⊆ X is closed and f : A → R is continuous, then ∃g : X → R continuous s.t. f ⊆ g .

If moreover sup f ≤ M, then one can find g with sup g ≤ M.

(17)

Basic review on topological and metric spaces

Urysohn’s theorem. Let X be second countable. Then X is metrisable iff it is regular.

Urysohn’s lemma. If X is metrisable and A, B ⊆ X are closed and disjoint, then ∃f : X → [0, 1] continuous s.t. f (A) ⊆ {0}, f (B) ⊆ {1}.

Tietze’s extension theorem. If X is metrisable, A ⊆ X is closed and f : A → R is continuous, then ∃g : X → R continuous s.t. f ⊆ g . If moreover sup f ≤ M, then one can find g with sup g ≤ M.

(18)

Trees

Definition

I T is a (descriptive) tree on set A if T is non-empty, T ⊆ A and T is closed under subsequences.

I If T is a tree on A, then [T ] = {f ∈ AN| ∀n f |n∈ T } is the body of T .

Example. [2] = 2Nis the Cantor space.

(19)

Trees

Definition

I T is a (descriptive) tree on set A if T is non-empty, T ⊆ A and T is closed under subsequences.

I If T is a tree on A, then [T ] = {f ∈ AN| ∀n f |n∈ T } is the body of T .

Example. [2] = 2Nis the Cantor space.

(20)

Trees

Definition

I T is a (descriptive) tree on set A if T is non-empty, T ⊆ A and T is closed under subsequences.

I If T is a tree on A, then [T ] = {f ∈ AN| ∀n f |n∈ T } is the body of T .

Example. [2] = 2N

is the Cantor space.

(21)

Trees

Definition

I T is a (descriptive) tree on set A if T is non-empty, T ⊆ A and T is closed under subsequences.

I If T is a tree on A, then [T ] = {f ∈ AN| ∀n f |n∈ T } is the body of T .

Example. [2] = 2Nis the Cantor space.

(22)

A metric on AN

d (a, b) =

 0 if a = b

1

2n if n is least with a(n) 6= b(n) is a ultrametric on AN, i.e. a metric such that

d (a, b) ≤ max(d (a, c), d (c, b)). Exercise. Check this.

Open balls centered in g ∈ ANare sets of the form Ng |n = {f ∈ AN| g |n= f |n} for n ∈ N.

Thus d is compatible with the product topology on AN, where A is given the discrete topology.

(23)

A metric on AN

d (a, b) =

 0 if a = b

1

2n if n is least with a(n) 6= b(n) is a ultrametric on AN, i.e. a metric such that

d (a, b) ≤ max(d (a, c), d (c, b)). Exercise. Check this.

Open balls centered in g ∈ ANare sets of the form Ng |n = {f ∈ AN| g |n= f |n} for n ∈ N.

Thus d is compatible with the product topology on AN, where A is given the discrete topology.

(24)

A metric on AN

d (a, b) =

 0 if a = b

1

2n if n is least with a(n) 6= b(n)

is a ultrametric on AN, i.e. a metric such that d (a, b) ≤ max(d (a, c), d (c, b)).

Exercise. Check this.

Open balls centered in g ∈ ANare sets of the form Ng |n = {f ∈ AN| g |n= f |n} for n ∈ N.

Thus d is compatible with the product topology on AN, where A is given the discrete topology.

(25)

A metric on AN

d (a, b) =

 0 if a = b

1

2n if n is least with a(n) 6= b(n) is a ultrametric on AN, i.e. a metric such that

d (a, b) ≤ max(d (a, c), d (c, b)).

Exercise. Check this.

Open balls centered in g ∈ ANare sets of the form Ng |n = {f ∈ AN| g |n= f |n} for n ∈ N.

Thus d is compatible with the product topology on AN, where A is given the discrete topology.

(26)

A metric on AN

d (a, b) =

 0 if a = b

1

2n if n is least with a(n) 6= b(n) is a ultrametric on AN, i.e. a metric such that

d (a, b) ≤ max(d (a, c), d (c, b)).

Exercise. Check this.

Open balls centered in g ∈ ANare sets of the form Ng |n = {f ∈ AN| g |n= f |n} for n ∈ N.

Thus d is compatible with the product topology on AN, where A is given the discrete topology.

(27)

A metric on AN

d (a, b) =

 0 if a = b

1

2n if n is least with a(n) 6= b(n) is a ultrametric on AN, i.e. a metric such that

d (a, b) ≤ max(d (a, c), d (c, b)).

Exercise. Check this.

Open balls centered in g ∈ ANare sets of the form Ng |n = {f ∈ AN| g |n= f |n} for n ∈ N.

Thus d is compatible with the product topology on AN, where A is given the discrete topology.

(28)

A metric on AN

Proposition

d is a complete metric.

Proof.

Let fn be a Cauchy sequence in AN. For any m, eventually all fn’s will have the first n digits fixed. These digits define an element f ∈ ANsuch that limn→∞fn= f .

Notice that AN is separable if (and only if) A is at most countable. This is a first example and will consitute the motivating example for the first fundamental definition, that of a Polish space.

(29)

A metric on AN

Proposition

d is a complete metric.

Proof.

Let fn be a Cauchy sequence in AN.

For any m, eventually all fn’s will have the first n digits fixed. These digits define an element f ∈ ANsuch that limn→∞fn= f .

Notice that AN is separable if (and only if) A is at most countable. This is a first example and will consitute the motivating example for the first fundamental definition, that of a Polish space.

(30)

A metric on AN

Proposition

d is a complete metric.

Proof.

Let fn be a Cauchy sequence in AN. For any m, eventually all fn’s will have the first n digits fixed.

These digits define an element f ∈ ANsuch that limn→∞fn= f .

Notice that AN is separable if (and only if) A is at most countable. This is a first example and will consitute the motivating example for the first fundamental definition, that of a Polish space.

(31)

A metric on AN

Proposition

d is a complete metric.

Proof.

Let fn be a Cauchy sequence in AN. For any m, eventually all fn’s will have the first n digits fixed. These digits define an element f ∈ AN

such that limn→∞fn= f .

Notice that AN is separable if (and only if) A is at most countable. This is a first example and will consitute the motivating example for the first fundamental definition, that of a Polish space.

(32)

A metric on AN

Proposition

d is a complete metric.

Proof.

Let fn be a Cauchy sequence in AN. For any m, eventually all fn’s will have the first n digits fixed. These digits define an element f ∈ ANsuch that limn→∞fn= f .

Notice that AN is separable if (and only if) A is at most countable. This is a first example and will consitute the motivating example for the first fundamental definition, that of a Polish space.

(33)

A metric on AN

Proposition

d is a complete metric.

Proof.

Let fn be a Cauchy sequence in AN. For any m, eventually all fn’s will have the first n digits fixed. These digits define an element f ∈ ANsuch that limn→∞fn= f .

Notice that AN is separable if (and only if) A is at most countable.

This is a first example and will consitute the motivating example for the first fundamental definition, that of a Polish space.

(34)

A metric on AN

Proposition

d is a complete metric.

Proof.

Let fn be a Cauchy sequence in AN. For any m, eventually all fn’s will have the first n digits fixed. These digits define an element f ∈ ANsuch that limn→∞fn= f .

Notice that AN is separable if (and only if) A is at most countable.

This is a first example and will consitute the motivating example for the first fundamental definition, that of a Polish space.

(35)

Basics on trees

Definition

A tree T is pruned if it has no terminal nodes: ∀t ∈ T ∃s ∈ T t ⊂ s. Example. Finite non-empty trees are not pruned.

Exercise. The map T 7→ [T ] is a bijection between pruned trees on A and closed subsets of AN. Its inverse is F 7→ TF = {x |n| x ∈ F , n ∈ N}. Some induced trees. If T is a tree on A and s ∈ A, then the following are trees on A:

I Ts = {t ∈ A| st ∈ T }

I T[s]= {t ∈ T | t is compatible with s}

(36)

Basics on trees

Definition

A tree T is pruned if it has no terminal nodes:

∀t ∈ T ∃s ∈ T t ⊂ s. Example. Finite non-empty trees are not pruned.

Exercise. The map T 7→ [T ] is a bijection between pruned trees on A and closed subsets of AN. Its inverse is F 7→ TF = {x |n| x ∈ F , n ∈ N}. Some induced trees. If T is a tree on A and s ∈ A, then the following are trees on A:

I Ts = {t ∈ A| st ∈ T }

I T[s]= {t ∈ T | t is compatible with s}

(37)

Basics on trees

Definition

A tree T is pruned if it has no terminal nodes: ∀t ∈ T ∃s ∈ T t ⊂ s.

Example. Finite non-empty trees are not pruned.

Exercise. The map T 7→ [T ] is a bijection between pruned trees on A and closed subsets of AN. Its inverse is F 7→ TF = {x |n| x ∈ F , n ∈ N}. Some induced trees. If T is a tree on A and s ∈ A, then the following are trees on A:

I Ts = {t ∈ A| st ∈ T }

I T[s]= {t ∈ T | t is compatible with s}

(38)

Basics on trees

Definition

A tree T is pruned if it has no terminal nodes: ∀t ∈ T ∃s ∈ T t ⊂ s.

Example. Finite non-empty trees are not pruned.

Exercise. The map T 7→ [T ] is a bijection between pruned trees on A and closed subsets of AN. Its inverse is F 7→ TF = {x |n| x ∈ F , n ∈ N}. Some induced trees. If T is a tree on A and s ∈ A, then the following are trees on A:

I Ts = {t ∈ A| st ∈ T }

I T[s]= {t ∈ T | t is compatible with s}

(39)

Basics on trees

Definition

A tree T is pruned if it has no terminal nodes: ∀t ∈ T ∃s ∈ T t ⊂ s.

Example. Finite non-empty trees are not pruned.

Exercise. The map T 7→ [T ] is a bijection between pruned trees on A and closed subsets of AN. Its inverse is F 7→ TF = {x |n| x ∈ F , n ∈ N}.

Some induced trees. If T is a tree on A and s ∈ A, then the following are trees on A:

I Ts = {t ∈ A| st ∈ T }

I T[s]= {t ∈ T | t is compatible with s}

(40)

Basics on trees

Definition

A tree T is pruned if it has no terminal nodes: ∀t ∈ T ∃s ∈ T t ⊂ s.

Example. Finite non-empty trees are not pruned.

Exercise. The map T 7→ [T ] is a bijection between pruned trees on A and closed subsets of AN. Its inverse is F 7→ TF = {x |n| x ∈ F , n ∈ N}.

Some induced trees. If T is a tree on A and s ∈ A, then the following are trees on A:

I Ts = {t ∈ A| st ∈ T }

I T[s]= {t ∈ T | t is compatible with s}

(41)

Basics on trees

Definition

A tree T is pruned if it has no terminal nodes: ∀t ∈ T ∃s ∈ T t ⊂ s.

Example. Finite non-empty trees are not pruned.

Exercise. The map T 7→ [T ] is a bijection between pruned trees on A and closed subsets of AN. Its inverse is F 7→ TF = {x |n| x ∈ F , n ∈ N}.

Some induced trees. If T is a tree on A and s ∈ A, then the following are trees on A:

I Ts = {t ∈ A | st ∈ T }

I T[s]= {t ∈ T | t is compatible with s}

(42)

Basics on trees

Definition

A tree T is pruned if it has no terminal nodes: ∀t ∈ T ∃s ∈ T t ⊂ s.

Example. Finite non-empty trees are not pruned.

Exercise. The map T 7→ [T ] is a bijection between pruned trees on A and closed subsets of AN. Its inverse is F 7→ TF = {x |n| x ∈ F , n ∈ N}.

Some induced trees. If T is a tree on A and s ∈ A, then the following are trees on A:

I Ts = {t ∈ A | st ∈ T }

I T[s]= {t ∈ T | t is compatible with s}

(43)

Basics on trees

Definition

Let T a tree on A and S a tree on B.

A function ϕ : T → S is monotone if

∀t1, t2∈ T (t1⊆ t2⇒ ϕ(t1) ⊆ t2)

Let D(ϕ) = {x ∈ [T ] | limn→∞length(ϕ(x |n)) = +∞}. Then one can define

ϕ(x ) = [

n∈N

ϕ(x |n) ∈ [S ]

Exercise. D(ϕ) is Gδ in [T ] and ϕ: D(ϕ) → [S ] is continuous.

(44)

Basics on trees

Definition

Let T a tree on A and S a tree on B. A function ϕ : T → S is monotone if

∀t1, t2∈ T (t1⊆ t2⇒ ϕ(t1) ⊆ t2)

Let D(ϕ) = {x ∈ [T ] | limn→∞length(ϕ(x |n)) = +∞}. Then one can define

ϕ(x ) = [

n∈N

ϕ(x |n) ∈ [S ]

Exercise. D(ϕ) is Gδ in [T ] and ϕ: D(ϕ) → [S ] is continuous.

(45)

Basics on trees

Definition

Let T a tree on A and S a tree on B. A function ϕ : T → S is monotone if

∀t1, t2∈ T (t1⊆ t2⇒ ϕ(t1) ⊆ t2)

Let D(ϕ) = {x ∈ [T ] | limn→∞length(ϕ(x |n)) = +∞}.

Then one can define

ϕ(x ) = [

n∈N

ϕ(x |n) ∈ [S ]

Exercise. D(ϕ) is Gδ in [T ] and ϕ: D(ϕ) → [S ] is continuous.

(46)

Basics on trees

Definition

Let T a tree on A and S a tree on B. A function ϕ : T → S is monotone if

∀t1, t2∈ T (t1⊆ t2⇒ ϕ(t1) ⊆ t2)

Let D(ϕ) = {x ∈ [T ] | limn→∞length(ϕ(x |n)) = +∞}. Then one can define

ϕ(x ) = [

n∈N

ϕ(x |n)

∈ [S]

Exercise. D(ϕ) is Gδ in [T ] and ϕ: D(ϕ) → [S ] is continuous.

(47)

Basics on trees

Definition

Let T a tree on A and S a tree on B. A function ϕ : T → S is monotone if

∀t1, t2∈ T (t1⊆ t2⇒ ϕ(t1) ⊆ t2)

Let D(ϕ) = {x ∈ [T ] | limn→∞length(ϕ(x |n)) = +∞}. Then one can define

ϕ(x ) = [

n∈N

ϕ(x |n)∈ [S]

Exercise. D(ϕ) is Gδ in [T ] and ϕ: D(ϕ) → [S ] is continuous.

(48)

Basics on trees

Definition

Let T a tree on A and S a tree on B. A function ϕ : T → S is monotone if

∀t1, t2∈ T (t1⊆ t2⇒ ϕ(t1) ⊆ t2)

Let D(ϕ) = {x ∈ [T ] | limn→∞length(ϕ(x |n)) = +∞}. Then one can define

ϕ(x ) = [

n∈N

ϕ(x |n)∈ [S]

Exercise. D(ϕ) is Gδ in [T ] and ϕ: D(ϕ) → [S ] is continuous.

(49)

Polish spaces

Definition

I A Polish space is a separable, completely metrisable topological space

I A Polish metric space is a separable metric space (X , d ) such that d is complete

Basic properties.

I Any Polish space is second countable and normal

I A finite or countable product of Polish spaces is Polish

I (Baire category theorem) Polish spaces are Baire (in fact every completely metrisable space is Baire)

I A quotient of a Polish space and a subspace of a Polish space are not necessarily Polish

I A closed subspace of a Polish space is Polish

(50)

Polish spaces

Definition

I A Polish space is a separable, completely metrisable topological space

I A Polish metric space is a separable metric space (X , d ) such that d is complete

Basic properties.

I Any Polish space is second countable and normal

I A finite or countable product of Polish spaces is Polish

I (Baire category theorem) Polish spaces are Baire (in fact every completely metrisable space is Baire)

I A quotient of a Polish space and a subspace of a Polish space are not necessarily Polish

I A closed subspace of a Polish space is Polish

(51)

Polish spaces

Definition

I A Polish space is a separable, completely metrisable topological space

I A Polish metric space is a separable metric space (X , d ) such that d is complete

Basic properties.

I Any Polish space is second countable and normal

I A finite or countable product of Polish spaces is Polish

I (Baire category theorem) Polish spaces are Baire (in fact every completely metrisable space is Baire)

I A quotient of a Polish space and a subspace of a Polish space are not necessarily Polish

I A closed subspace of a Polish space is Polish

(52)

Polish spaces

Definition

I A Polish space is a separable, completely metrisable topological space

I A Polish metric space is a separable metric space (X , d ) such that d is complete

Basic properties.

I Any Polish space is second countable and normal

I A finite or countable product of Polish spaces is Polish

I (Baire category theorem) Polish spaces are Baire (in fact every completely metrisable space is Baire)

I A quotient of a Polish space and a subspace of a Polish space are not necessarily Polish

I A closed subspace of a Polish space is Polish

(53)

Polish spaces

Definition

I A Polish space is a separable, completely metrisable topological space

I A Polish metric space is a separable metric space (X , d ) such that d is complete

Basic properties.

I Any Polish space is second countable and normal

I A finite or countable product of Polish spaces is Polish

I (Baire category theorem) Polish spaces are Baire (in fact every completely metrisable space is Baire)

I A quotient of a Polish space and a subspace of a Polish space are not necessarily Polish

I A closed subspace of a Polish space is Polish

(54)

Polish spaces

Definition

I A Polish space is a separable, completely metrisable topological space

I A Polish metric space is a separable metric space (X , d ) such that d is complete

Basic properties.

I Any Polish space is second countable and normal

I A finite or countable product of Polish spaces is Polish

I (Baire category theorem) Polish spaces are Baire (in fact every completely metrisable space is Baire)

I A quotient of a Polish space and a subspace of a Polish space are not necessarily Polish

I A closed subspace of a Polish space is Polish

(55)

Polish spaces

Definition

I A Polish space is a separable, completely metrisable topological space

I A Polish metric space is a separable metric space (X , d ) such that d is complete

Basic properties.

I Any Polish space is second countable and normal

I A finite or countable product of Polish spaces is Polish

I (Baire category theorem) Polish spaces are Baire (in fact every completely metrisable space is Baire)

I A quotient of a Polish space and a subspace of a Polish space are not necessarily Polish

I A closed subspace of a Polish space is Polish

(56)

First examples.

I All countable discrete spaces

I Cantor space 2N

Exercise. Prove that is homeomorphic to the 13-Cantor set E1

3 ⊆ [0, 1] via x 7→P n=0

2x (n) 3n+1 I Baire space NN

Exercise. Prove that it is homeomorphic to R \ Q (equivalently, to (R \ Q) ∩ [0, 1]), using continued fractions.

I Rn, RN

I ]0, 1[, {z ∈ C | |z| = 1}, [0, 1]

I Hilbert cube [0, 1]N

I All separable Banach spaces

Exercise. Compact metrisable spaces are Polish.

(57)

First examples.

I All countable discrete spaces

I Cantor space 2N

Exercise. Prove that is homeomorphic to the 13-Cantor set E1

3 ⊆ [0, 1] via x 7→P n=0

2x (n) 3n+1 I Baire space NN

Exercise. Prove that it is homeomorphic to R \ Q (equivalently, to (R \ Q) ∩ [0, 1]), using continued fractions.

I Rn, RN

I ]0, 1[, {z ∈ C | |z| = 1}, [0, 1]

I Hilbert cube [0, 1]N

I All separable Banach spaces

Exercise. Compact metrisable spaces are Polish.

(58)

First examples.

I All countable discrete spaces

I Cantor space 2N

Exercise. Prove that is homeomorphic to the 13-Cantor set E1

3 ⊆ [0, 1] via x 7→P n=0

2x (n) 3n+1 I Baire space NN

Exercise. Prove that it is homeomorphic to R \ Q (equivalently, to (R \ Q) ∩ [0, 1]), using continued fractions.

I Rn, RN

I ]0, 1[, {z ∈ C | |z| = 1}, [0, 1]

I Hilbert cube [0, 1]N

I All separable Banach spaces

Exercise. Compact metrisable spaces are Polish.

(59)

First examples.

I All countable discrete spaces

I Cantor space 2N

Exercise. Prove that is homeomorphic to the 13-Cantor set E1

3 ⊆ [0, 1]

via x 7→P n=0

2x (n) 3n+1 I Baire space NN

Exercise. Prove that it is homeomorphic to R \ Q (equivalently, to (R \ Q) ∩ [0, 1]), using continued fractions.

I Rn, RN

I ]0, 1[, {z ∈ C | |z| = 1}, [0, 1]

I Hilbert cube [0, 1]N

I All separable Banach spaces

Exercise. Compact metrisable spaces are Polish.

(60)

First examples.

I All countable discrete spaces

I Cantor space 2N

Exercise. Prove that is homeomorphic to the 13-Cantor set E1

3 ⊆ [0, 1] via x 7→P n=0

2x (n) 3n+1

I Baire space NN

Exercise. Prove that it is homeomorphic to R \ Q (equivalently, to (R \ Q) ∩ [0, 1]), using continued fractions.

I Rn, RN

I ]0, 1[, {z ∈ C | |z| = 1}, [0, 1]

I Hilbert cube [0, 1]N

I All separable Banach spaces

Exercise. Compact metrisable spaces are Polish.

(61)

First examples.

I All countable discrete spaces

I Cantor space 2N

Exercise. Prove that is homeomorphic to the 13-Cantor set E1

3 ⊆ [0, 1] via x 7→P n=0

2x (n) 3n+1 I Baire space NN

Exercise. Prove that it is homeomorphic to R \ Q (equivalently, to (R \ Q) ∩ [0, 1]), using continued fractions.

I Rn, RN

I ]0, 1[, {z ∈ C | |z| = 1}, [0, 1]

I Hilbert cube [0, 1]N

I All separable Banach spaces

Exercise. Compact metrisable spaces are Polish.

(62)

First examples.

I All countable discrete spaces

I Cantor space 2N

Exercise. Prove that is homeomorphic to the 13-Cantor set E1

3 ⊆ [0, 1] via x 7→P n=0

2x (n) 3n+1 I Baire space NN

Exercise. Prove that it is homeomorphic to R \ Q (equivalently, to (R \ Q) ∩ [0, 1])

, using continued fractions.

I Rn, RN

I ]0, 1[, {z ∈ C | |z| = 1}, [0, 1]

I Hilbert cube [0, 1]N

I All separable Banach spaces

Exercise. Compact metrisable spaces are Polish.

(63)

First examples.

I All countable discrete spaces

I Cantor space 2N

Exercise. Prove that is homeomorphic to the 13-Cantor set E1

3 ⊆ [0, 1] via x 7→P n=0

2x (n) 3n+1 I Baire space NN

Exercise. Prove that it is homeomorphic to R \ Q (equivalently, to (R \ Q) ∩ [0, 1]), using continued fractions.

I Rn, RN

I ]0, 1[, {z ∈ C | |z| = 1}, [0, 1]

I Hilbert cube [0, 1]N

I All separable Banach spaces

Exercise. Compact metrisable spaces are Polish.

(64)

First examples.

I All countable discrete spaces

I Cantor space 2N

Exercise. Prove that is homeomorphic to the 13-Cantor set E1

3 ⊆ [0, 1] via x 7→P n=0

2x (n) 3n+1 I Baire space NN

Exercise. Prove that it is homeomorphic to R \ Q (equivalently, to (R \ Q) ∩ [0, 1]), using continued fractions.

I Rn, RN

I ]0, 1[, {z ∈ C | |z| = 1}, [0, 1]

I Hilbert cube [0, 1]N

I All separable Banach spaces

Exercise. Compact metrisable spaces are Polish.

(65)

First examples.

I All countable discrete spaces

I Cantor space 2N

Exercise. Prove that is homeomorphic to the 13-Cantor set E1

3 ⊆ [0, 1] via x 7→P n=0

2x (n) 3n+1 I Baire space NN

Exercise. Prove that it is homeomorphic to R \ Q (equivalently, to (R \ Q) ∩ [0, 1]), using continued fractions.

I Rn, RN

I ]0, 1[, {z ∈ C | |z| = 1}, [0, 1]

I Hilbert cube [0, 1]N

I All separable Banach spaces

Exercise. Compact metrisable spaces are Polish.

(66)

First examples.

I All countable discrete spaces

I Cantor space 2N

Exercise. Prove that is homeomorphic to the 13-Cantor set E1

3 ⊆ [0, 1] via x 7→P n=0

2x (n) 3n+1 I Baire space NN

Exercise. Prove that it is homeomorphic to R \ Q (equivalently, to (R \ Q) ∩ [0, 1]), using continued fractions.

I Rn, RN

I ]0, 1[, {z ∈ C | |z| = 1}, [0, 1]

I Hilbert cube [0, 1]N

I All separable Banach spaces

Exercise. Compact metrisable spaces are Polish.

(67)

First examples.

I All countable discrete spaces

I Cantor space 2N

Exercise. Prove that is homeomorphic to the 13-Cantor set E1

3 ⊆ [0, 1] via x 7→P n=0

2x (n) 3n+1 I Baire space NN

Exercise. Prove that it is homeomorphic to R \ Q (equivalently, to (R \ Q) ∩ [0, 1]), using continued fractions.

I Rn, RN

I ]0, 1[, {z ∈ C | |z| = 1}, [0, 1]

I Hilbert cube [0, 1]N

I All separable Banach spaces

Exercise. Compact metrisable spaces are Polish.

(68)

First examples.

I All countable discrete spaces

I Cantor space 2N

Exercise. Prove that is homeomorphic to the 13-Cantor set E1

3 ⊆ [0, 1] via x 7→P n=0

2x (n) 3n+1 I Baire space NN

Exercise. Prove that it is homeomorphic to R \ Q (equivalently, to (R \ Q) ∩ [0, 1]), using continued fractions.

I Rn, RN

I ]0, 1[, {z ∈ C | |z| = 1}, [0, 1]

I Hilbert cube [0, 1]N

I All separable Banach spaces

Exercise. Compact metrisable spaces are Polish.

Riferimenti

Documenti correlati

The consistent version of Miner’s rule (according to the FKM-Guideline) with an allowable damage sum D crit = 0.3 adopted in combination with 2.5% percentile (p2.5%) of the S-N

La fundación del monasterio de Santa Clara de Plasencia fue una empresa llevada a efecto gra- cias al empeño de un miembro de un linaje de la aristocracia urbana de la ciudad, los

(Marcone, Rosendal) The relation of continuous embeddability on dendrites is a universal analytic

Mimicking some of the Wadge’s constructions on the Baire space, there are candidate operations performing task 1... .). Mimicking some of the Wadge’s constructions on the Baire

I (Gao, C.; 2001) The isomorphism relation on countable Boolean algebras; the homeomorphism relation on zero-dimensional compact metric spaces; the conjugacy relation on the group

Leaving out of consideration the membership relator ∈ for the time being, in this note we provide a complete taxonomy of the polynomial and the NP-complete fragments involving,

The infinity axiom rarely plays a role in appli- cations to algorithms; nevertheless the availability of all resources of ZFC is important in general: for example,

In any case, any mathematical method that has been used to prove a theorem of the appropriate form has in fact been used to show that a particular Diophantine equation has no