descriptive set theory and model theory second lecture · example (finite measured boolean...

88
Descriptive Set Theory and Model Theory Second Lecture Christian Rosendal, University of Illinois at Chicago Thematic Program on Model Theory, Notre Dame, June 2016 Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 1 / 22

Upload: others

Post on 15-Jul-2020

3 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Descriptive Set Theory and Model TheorySecond Lecture

Christian Rosendal,University of Illinois at Chicago

Thematic Program on Model Theory,Notre Dame, June 2016

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 1 / 22

Page 2: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Overview of the four lectures:

1 Polish groups and ample generics (w/ A. S. Kechris)

2 Topological rigidity of automorphism groups (w/ A. S. Kechris)

3 Coarse geometry of Polish groups

4 Geometry of automorphism groups

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 2 / 22

Page 3: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Fraısse classes and limits

In the following L will always denote a countable first-order language andK will be a class of finitely generated L-structures.

Definition

K is said to have the hereditary property (HP) provided that, if A ∈ K andB is a finitely generated L-structure embeddable in A, then also B ∈ K.

Definition

K has the joint embedding property (JEP) provided that, for allB1,B2 ∈ K, there is some C ∈ K into which both B1 and B2 embed.

B1 B2• •

C

������

@@

@@@I•

ζ1 ζ2

• •

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 3 / 22

Page 4: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Fraısse classes and limits

In the following L will always denote a countable first-order language andK will be a class of finitely generated L-structures.

Definition

K is said to have the hereditary property (HP) provided that, if A ∈ K andB is a finitely generated L-structure embeddable in A, then also B ∈ K.

Definition

K has the joint embedding property (JEP) provided that, for allB1,B2 ∈ K, there is some C ∈ K into which both B1 and B2 embed.

B1 B2• •

C

������

@@

@@@I•

ζ1 ζ2

• •

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 3 / 22

Page 5: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Fraısse classes and limits

In the following L will always denote a countable first-order language andK will be a class of finitely generated L-structures.

Definition

K is said to have the hereditary property (HP) provided that, if A ∈ K andB is a finitely generated L-structure embeddable in A, then also B ∈ K.

Definition

K has the joint embedding property (JEP) provided that, for allB1,B2 ∈ K, there is some C ∈ K into which both B1 and B2 embed.

B1 B2• •

C

������

@@

@@@I•

ζ1 ζ2

• •

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 3 / 22

Page 6: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Fraısse classes and limits

In the following L will always denote a countable first-order language andK will be a class of finitely generated L-structures.

Definition

K is said to have the hereditary property (HP) provided that, if A ∈ K andB is a finitely generated L-structure embeddable in A, then also B ∈ K.

Definition

K has the joint embedding property (JEP) provided that, for allB1,B2 ∈ K, there is some C ∈ K into which both B1 and B2 embed.

B1 B2• •

C

������

@@

@@@I•

ζ1 ζ2

• •

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 3 / 22

Page 7: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

K has the amalgamation property (AP) provided that, for allA,B1,B2 ∈ K and embeddings ηi : A→ Bi , there is some C ∈ K andembeddings ζi : Bi → C so that ζ1 ◦ η1 = ζ2 ◦ η2.

A

B1 B2

��������7

SSSSSSSSo

• •

η1 η2

C

������

@@

@@@I•

ζ1 ζ2

• •

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 4 / 22

Page 8: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

K has the amalgamation property (AP) provided that, for allA,B1,B2 ∈ K and embeddings ηi : A→ Bi , there is some C ∈ K andembeddings ζi : Bi → C so that ζ1 ◦ η1 = ζ2 ◦ η2.

A

B1 B2

��������7

SSSSSSSSo

• •

η1 η2

C

������

@@

@@@I•

ζ1 ζ2

• •

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 4 / 22

Page 9: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

K has the amalgamation property (AP) provided that, for allA,B1,B2 ∈ K and embeddings ηi : A→ Bi , there is some C ∈ K andembeddings ζi : Bi → C so that ζ1 ◦ η1 = ζ2 ◦ η2.

A

B1 B2

��������7

SSSSSSSSo

• •

η1 η2

C

������

@@

@@@I•

ζ1 ζ2

• •

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 4 / 22

Page 10: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

K is a Fraısse class if K satisfies (HP), (JEP) and (AP) and, moreover,there are only countably many isomorphism types of structures in K.

Observe that by (HP), a Fraısse classe is automatically closed underisomorphism.

Examples (Examples of Fraısse classes)

The class of all finite linear orderings.

The class of all finite Boolean algebras.

The class of all finite graphs.

The class of all finite metric spaces with distances in Q.

The class of all finite groups.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 5 / 22

Page 11: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

K is a Fraısse class if K satisfies (HP), (JEP) and (AP) and, moreover,there are only countably many isomorphism types of structures in K.

Observe that by (HP), a Fraısse classe is automatically closed underisomorphism.

Examples (Examples of Fraısse classes)

The class of all finite linear orderings.

The class of all finite Boolean algebras.

The class of all finite graphs.

The class of all finite metric spaces with distances in Q.

The class of all finite groups.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 5 / 22

Page 12: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

K is a Fraısse class if K satisfies (HP), (JEP) and (AP) and, moreover,there are only countably many isomorphism types of structures in K.

Observe that by (HP), a Fraısse classe is automatically closed underisomorphism.

Examples (Examples of Fraısse classes)

The class of all finite linear orderings.

The class of all finite Boolean algebras.

The class of all finite graphs.

The class of all finite metric spaces with distances in Q.

The class of all finite groups.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 5 / 22

Page 13: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

K is a Fraısse class if K satisfies (HP), (JEP) and (AP) and, moreover,there are only countably many isomorphism types of structures in K.

Observe that by (HP), a Fraısse classe is automatically closed underisomorphism.

Examples (Examples of Fraısse classes)

The class of all finite linear orderings.

The class of all finite Boolean algebras.

The class of all finite graphs.

The class of all finite metric spaces with distances in Q.

The class of all finite groups.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 5 / 22

Page 14: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

K is a Fraısse class if K satisfies (HP), (JEP) and (AP) and, moreover,there are only countably many isomorphism types of structures in K.

Observe that by (HP), a Fraısse classe is automatically closed underisomorphism.

Examples (Examples of Fraısse classes)

The class of all finite linear orderings.

The class of all finite Boolean algebras.

The class of all finite graphs.

The class of all finite metric spaces with distances in Q.

The class of all finite groups.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 5 / 22

Page 15: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

K is a Fraısse class if K satisfies (HP), (JEP) and (AP) and, moreover,there are only countably many isomorphism types of structures in K.

Observe that by (HP), a Fraısse classe is automatically closed underisomorphism.

Examples (Examples of Fraısse classes)

The class of all finite linear orderings.

The class of all finite Boolean algebras.

The class of all finite graphs.

The class of all finite metric spaces with distances in Q.

The class of all finite groups.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 5 / 22

Page 16: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

K is a Fraısse class if K satisfies (HP), (JEP) and (AP) and, moreover,there are only countably many isomorphism types of structures in K.

Observe that by (HP), a Fraısse classe is automatically closed underisomorphism.

Examples (Examples of Fraısse classes)

The class of all finite linear orderings.

The class of all finite Boolean algebras.

The class of all finite graphs.

The class of all finite metric spaces with distances in Q.

The class of all finite groups.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 5 / 22

Page 17: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Example (Finite measured Boolean algebras)

For every dyadic rational r = k2n ∈ [0, 1], let Pr be a unary predicate.

Let also K denote the class of all finite Boolean algebras expanded withthe predicates {Pr}r so that

µ(x) = r ⇔ Pr (x)

defines a probability measure on the algebra.

Then K is the Fraısse class of all finite dyadic probability algebras.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 6 / 22

Page 18: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Example (Finite measured Boolean algebras)

For every dyadic rational r = k2n ∈ [0, 1], let Pr be a unary predicate.

Let also K denote the class of all finite Boolean algebras expanded withthe predicates {Pr}r so that

µ(x) = r ⇔ Pr (x)

defines a probability measure on the algebra.

Then K is the Fraısse class of all finite dyadic probability algebras.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 6 / 22

Page 19: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Example (Finite measured Boolean algebras)

For every dyadic rational r = k2n ∈ [0, 1], let Pr be a unary predicate.

Let also K denote the class of all finite Boolean algebras expanded withthe predicates {Pr}r so that

µ(x) = r ⇔ Pr (x)

defines a probability measure on the algebra.

Then K is the Fraısse class of all finite dyadic probability algebras.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 6 / 22

Page 20: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

A structure K is said to be ultrahomogeneous if every isomorphism

φ : A→ B

between finitely generated substructures A,B ⊆ K extends to a fullautomorphism of K.

Definition

If K is a structure, the age of K is the class of all finitely generatedstructures embeddable in K.

Theorem (R. Fraısse)

If K is a Fraısse class, then there is a (unique up to isomorphism)countable ultrahomogeneous structure K, called its Fraısse limit, so thatK = Age K.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 7 / 22

Page 21: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

A structure K is said to be ultrahomogeneous if every isomorphism

φ : A→ B

between finitely generated substructures A,B ⊆ K extends to a fullautomorphism of K.

Definition

If K is a structure, the age of K is the class of all finitely generatedstructures embeddable in K.

Theorem (R. Fraısse)

If K is a Fraısse class, then there is a (unique up to isomorphism)countable ultrahomogeneous structure K, called its Fraısse limit, so thatK = Age K.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 7 / 22

Page 22: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

A structure K is said to be ultrahomogeneous if every isomorphism

φ : A→ B

between finitely generated substructures A,B ⊆ K extends to a fullautomorphism of K.

Definition

If K is a structure, the age of K is the class of all finitely generatedstructures embeddable in K.

Theorem (R. Fraısse)

If K is a Fraısse class, then there is a (unique up to isomorphism)countable ultrahomogeneous structure K, called its Fraısse limit, so thatK = Age K.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 7 / 22

Page 23: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Examples (Examples of Fraısse limits)

(Q, <) is the limit of the class of all finite linear orderings.

The countable atomless Boolean algebra B∞ = clopen(2N) is thelimit of the class of all finite Boolean algebras.

The random graph R is the limit of the class of all finite graphs.

The rational Urysohn metric space QU is the limit of the class of allfinite metric spaces with distances in Q.

The algebra of clopen subsets of the Cantor group∏n

Z/2Z

equipped with Haar measure µ is the limit of the class of all finitedyadic probability algebras.

Hall’s universal locally finite group is the limit of the class of all finitegroups.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 8 / 22

Page 24: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Examples (Examples of Fraısse limits)

(Q, <) is the limit of the class of all finite linear orderings.

The countable atomless Boolean algebra B∞ = clopen(2N) is thelimit of the class of all finite Boolean algebras.

The random graph R is the limit of the class of all finite graphs.

The rational Urysohn metric space QU is the limit of the class of allfinite metric spaces with distances in Q.

The algebra of clopen subsets of the Cantor group∏n

Z/2Z

equipped with Haar measure µ is the limit of the class of all finitedyadic probability algebras.

Hall’s universal locally finite group is the limit of the class of all finitegroups.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 8 / 22

Page 25: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Examples (Examples of Fraısse limits)

(Q, <) is the limit of the class of all finite linear orderings.

The countable atomless Boolean algebra B∞ = clopen(2N) is thelimit of the class of all finite Boolean algebras.

The random graph R is the limit of the class of all finite graphs.

The rational Urysohn metric space QU is the limit of the class of allfinite metric spaces with distances in Q.

The algebra of clopen subsets of the Cantor group∏n

Z/2Z

equipped with Haar measure µ is the limit of the class of all finitedyadic probability algebras.

Hall’s universal locally finite group is the limit of the class of all finitegroups.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 8 / 22

Page 26: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Examples (Examples of Fraısse limits)

(Q, <) is the limit of the class of all finite linear orderings.

The countable atomless Boolean algebra B∞ = clopen(2N) is thelimit of the class of all finite Boolean algebras.

The random graph R is the limit of the class of all finite graphs.

The rational Urysohn metric space QU is the limit of the class of allfinite metric spaces with distances in Q.

The algebra of clopen subsets of the Cantor group∏n

Z/2Z

equipped with Haar measure µ is the limit of the class of all finitedyadic probability algebras.

Hall’s universal locally finite group is the limit of the class of all finitegroups.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 8 / 22

Page 27: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Examples (Examples of Fraısse limits)

(Q, <) is the limit of the class of all finite linear orderings.

The countable atomless Boolean algebra B∞ = clopen(2N) is thelimit of the class of all finite Boolean algebras.

The random graph R is the limit of the class of all finite graphs.

The rational Urysohn metric space QU is the limit of the class of allfinite metric spaces with distances in Q.

The algebra of clopen subsets of the Cantor group∏n

Z/2Z

equipped with Haar measure µ is the limit of the class of all finitedyadic probability algebras.

Hall’s universal locally finite group is the limit of the class of all finitegroups.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 8 / 22

Page 28: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Examples (Examples of Fraısse limits)

(Q, <) is the limit of the class of all finite linear orderings.

The countable atomless Boolean algebra B∞ = clopen(2N) is thelimit of the class of all finite Boolean algebras.

The random graph R is the limit of the class of all finite graphs.

The rational Urysohn metric space QU is the limit of the class of allfinite metric spaces with distances in Q.

The algebra of clopen subsets of the Cantor group∏n

Z/2Z

equipped with Haar measure µ is the limit of the class of all finitedyadic probability algebras.

Hall’s universal locally finite group is the limit of the class of all finitegroups.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 8 / 22

Page 29: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Note that by Stone duality, automorphisms of B∞ = clopen(2N)correspond to homeomorphisms of Cantor space 2N.

Thus, Aut(B∞) = Homeo(2N).

Similarly, viewing 2N as the Cantor group∏

n Z/2Z, the group ofmeasure-preserving automorphisms of the clopen algebra of the Cantorgroup can be identified with the group

Homeo(2N, µ)

of measure-preserving homeomorphisms of Cantor space.

Here, if Ns = {x ∈ 2N | s ⊆ x} is a basic open set determined by a finitebinary string s ∈ 2n, we have

µ(Ns) = 2−n.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 9 / 22

Page 30: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Note that by Stone duality, automorphisms of B∞ = clopen(2N)correspond to homeomorphisms of Cantor space 2N.

Thus, Aut(B∞) = Homeo(2N).

Similarly, viewing 2N as the Cantor group∏

n Z/2Z, the group ofmeasure-preserving automorphisms of the clopen algebra of the Cantorgroup can be identified with the group

Homeo(2N, µ)

of measure-preserving homeomorphisms of Cantor space.

Here, if Ns = {x ∈ 2N | s ⊆ x} is a basic open set determined by a finitebinary string s ∈ 2n, we have

µ(Ns) = 2−n.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 9 / 22

Page 31: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Note that by Stone duality, automorphisms of B∞ = clopen(2N)correspond to homeomorphisms of Cantor space 2N.

Thus, Aut(B∞) = Homeo(2N).

Similarly, viewing 2N as the Cantor group∏

n Z/2Z, the group ofmeasure-preserving automorphisms of the clopen algebra of the Cantorgroup can be identified with the group

Homeo(2N, µ)

of measure-preserving homeomorphisms of Cantor space.

Here, if Ns = {x ∈ 2N | s ⊆ x} is a basic open set determined by a finitebinary string s ∈ 2n, we have

µ(Ns) = 2−n.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 9 / 22

Page 32: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Note that by Stone duality, automorphisms of B∞ = clopen(2N)correspond to homeomorphisms of Cantor space 2N.

Thus, Aut(B∞) = Homeo(2N).

Similarly, viewing 2N as the Cantor group∏

n Z/2Z, the group ofmeasure-preserving automorphisms of the clopen algebra of the Cantorgroup can be identified with the group

Homeo(2N, µ)

of measure-preserving homeomorphisms of Cantor space.

Here, if Ns = {x ∈ 2N | s ⊆ x} is a basic open set determined by a finitebinary string s ∈ 2n, we have

µ(Ns) = 2−n.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 9 / 22

Page 33: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Automorphism groups of Fraısse limits

Suppose that K is the Fraısse limit of some Fraısse class K and let Aut(K)denote its automorphism group.

We equip Aut(K) with the permutation group topology whose basic opensets are of the form

[φ : B → C ] = {g ∈ Aut(K) | g extends φ}= {g ∈ Aut(K) | g(b) = φ(b) for all b ∈ B},

where φ is an isomorphism between finitely generated substructuresB,C ⊆ K.

This can be seen to be a group topology meaning that the groupmultiplication and inversion are continuous operations on Aut(K).

Also, as K is ultrahomogeneous, any φ : B → C defines a non-empty set[φ : B → C ].

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 10 / 22

Page 34: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Automorphism groups of Fraısse limits

Suppose that K is the Fraısse limit of some Fraısse class K and let Aut(K)denote its automorphism group.

We equip Aut(K) with the permutation group topology whose basic opensets are of the form

[φ : B → C ] = {g ∈ Aut(K) | g extends φ}= {g ∈ Aut(K) | g(b) = φ(b) for all b ∈ B},

where φ is an isomorphism between finitely generated substructuresB,C ⊆ K.

This can be seen to be a group topology meaning that the groupmultiplication and inversion are continuous operations on Aut(K).

Also, as K is ultrahomogeneous, any φ : B → C defines a non-empty set[φ : B → C ].

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 10 / 22

Page 35: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Automorphism groups of Fraısse limits

Suppose that K is the Fraısse limit of some Fraısse class K and let Aut(K)denote its automorphism group.

We equip Aut(K) with the permutation group topology whose basic opensets are of the form

[φ : B → C ] = {g ∈ Aut(K) | g extends φ}= {g ∈ Aut(K) | g(b) = φ(b) for all b ∈ B},

where φ is an isomorphism between finitely generated substructuresB,C ⊆ K.

This can be seen to be a group topology meaning that the groupmultiplication and inversion are continuous operations on Aut(K).

Also, as K is ultrahomogeneous, any φ : B → C defines a non-empty set[φ : B → C ].

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 10 / 22

Page 36: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Automorphism groups of Fraısse limits

Suppose that K is the Fraısse limit of some Fraısse class K and let Aut(K)denote its automorphism group.

We equip Aut(K) with the permutation group topology whose basic opensets are of the form

[φ : B → C ] = {g ∈ Aut(K) | g extends φ}= {g ∈ Aut(K) | g(b) = φ(b) for all b ∈ B},

where φ is an isomorphism between finitely generated substructuresB,C ⊆ K.

This can be seen to be a group topology meaning that the groupmultiplication and inversion are continuous operations on Aut(K).

Also, as K is ultrahomogeneous, any φ : B → C defines a non-empty set[φ : B → C ].

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 10 / 22

Page 37: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

A n-system over K is a tuple

S = 〈A, φ1 : B1 → C1, . . . , φn : Bn → Cn〉,

where A,Bi ,Ci ∈ K, the Bi and Ci are substructures of A and φi areisomorphisms from Bi to Ci .

Let also Knp denote the class of all n-systems over K.

If T = 〈D, ψ1 : E1 → F1, . . . , ψn : En → Fn〉 is another n-system, then anembedding of S into T is an isomorphic embedding

ι : A→ D

so that ι[Bi ] ⊆ Ei , ι[Ci ] ⊆ Fi and the diagram commutes for all i .

Bi Ci

Ei Fi

φi

ι ι

ψi

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 11 / 22

Page 38: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

A n-system over K is a tuple

S = 〈A, φ1 : B1 → C1, . . . , φn : Bn → Cn〉,

where A,Bi ,Ci ∈ K, the Bi and Ci are substructures of A and φi areisomorphisms from Bi to Ci .

Let also Knp denote the class of all n-systems over K.

If T = 〈D, ψ1 : E1 → F1, . . . , ψn : En → Fn〉 is another n-system, then anembedding of S into T is an isomorphic embedding

ι : A→ D

so that ι[Bi ] ⊆ Ei , ι[Ci ] ⊆ Fi and the diagram commutes for all i .

Bi Ci

Ei Fi

φi

ι ι

ψi

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 11 / 22

Page 39: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

A n-system over K is a tuple

S = 〈A, φ1 : B1 → C1, . . . , φn : Bn → Cn〉,

where A,Bi ,Ci ∈ K, the Bi and Ci are substructures of A and φi areisomorphisms from Bi to Ci .

Let also Knp denote the class of all n-systems over K.

If T = 〈D, ψ1 : E1 → F1, . . . , ψn : En → Fn〉 is another n-system, then anembedding of S into T is an isomorphic embedding

ι : A→ D

so that ι[Bi ] ⊆ Ei , ι[Ci ] ⊆ Fi and the diagram commutes for all i .

Bi Ci

Ei Fi

φi

ι ι

ψi

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 11 / 22

Page 40: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

A n-system over K is a tuple

S = 〈A, φ1 : B1 → C1, . . . , φn : Bn → Cn〉,

where A,Bi ,Ci ∈ K, the Bi and Ci are substructures of A and φi areisomorphisms from Bi to Ci .

Let also Knp denote the class of all n-systems over K.

If T = 〈D, ψ1 : E1 → F1, . . . , ψn : En → Fn〉 is another n-system, then anembedding of S into T is an isomorphic embedding

ι : A→ D

so that ι[Bi ] ⊆ Ei , ι[Ci ] ⊆ Fi and the diagram commutes for all i .

Bi Ci

Ei Fi

φi

ι ι

ψi

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 11 / 22

Page 41: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

The class of n-systems Knp has the joint embedding property (JEP)

provided that, for all S0,S1 ∈ Knp, there is some R ∈ Kn

p into which bothS0 and S1 embed.

S0 S1• •

R

������

@@

@@@I•

ζ1 ζ2

• •

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 12 / 22

Page 42: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

The class of n-systems Knp has the joint embedding property (JEP)

provided that, for all S0,S1 ∈ Knp, there is some R ∈ Kn

p into which bothS0 and S1 embed.

S0 S1• •

R

������

@@

@@@I•

ζ1 ζ2

• •

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 12 / 22

Page 43: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

The class of n-systems Knp has the joint embedding property (JEP)

provided that, for all S0,S1 ∈ Knp, there is some R ∈ Kn

p into which bothS0 and S1 embed.

S0 S1• •

R

������

@@

@@@I•

ζ1 ζ2

• •

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 12 / 22

Page 44: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

The class of n-systems Knp has the weak amalgamation property (WAP)

provided that, for all S ∈ Knp, there is some S ∈ Kn

p and embedding

ι : S→ S so that the following property holds:

For all pairs of systems and embeddings ηi : S→ Ti , i = 0, 1, there are asystem and embeddings ζi : Ti → R, so that

ζ0 ◦ η0 ◦ ι = ζ1 ◦ η1 ◦ ι.

By changing S, one may always assume that ι is actually the inclusionmap.

Such an S is said to be an amalgamation base over S.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 13 / 22

Page 45: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

The class of n-systems Knp has the weak amalgamation property (WAP)

provided that, for all S ∈ Knp, there is some S ∈ Kn

p and embedding

ι : S→ S so that the following property holds:

For all pairs of systems and embeddings ηi : S→ Ti , i = 0, 1, there are asystem and embeddings ζi : Ti → R, so that

ζ0 ◦ η0 ◦ ι = ζ1 ◦ η1 ◦ ι.

By changing S, one may always assume that ι is actually the inclusionmap.

Such an S is said to be an amalgamation base over S.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 13 / 22

Page 46: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

The class of n-systems Knp has the weak amalgamation property (WAP)

provided that, for all S ∈ Knp, there is some S ∈ Kn

p and embedding

ι : S→ S so that the following property holds:

For all pairs of systems and embeddings ηi : S→ Ti , i = 0, 1, there are asystem and embeddings ζi : Ti → R, so that

ζ0 ◦ η0 ◦ ι = ζ1 ◦ η1 ◦ ι.

By changing S, one may always assume that ι is actually the inclusionmap.

Such an S is said to be an amalgamation base over S.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 13 / 22

Page 47: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Definition

The class of n-systems Knp has the weak amalgamation property (WAP)

provided that, for all S ∈ Knp, there is some S ∈ Kn

p and embedding

ι : S→ S so that the following property holds:

For all pairs of systems and embeddings ηi : S→ Ti , i = 0, 1, there are asystem and embeddings ζi : Ti → R, so that

ζ0 ◦ η0 ◦ ι = ζ1 ◦ η1 ◦ ι.

By changing S, one may always assume that ι is actually the inclusionmap.

Such an S is said to be an amalgamation base over S.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 13 / 22

Page 48: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Weak amalgamation in terms of arrows

S

6

ι

• S�������>

ZZ

ZZZ

ZZ}

T0 T1• •

η0 η1

R

��������

@@@

@@@@I

• •

ζ0 ζ1

η0 ◦ ι η1 ◦ ι

����������7

SSSSSSSSSSo

��������

@@@

@@@@I

• •

The green diagram commutes.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 14 / 22

Page 49: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Weak amalgamation in terms of arrows

S

6

ι

• S�������>

ZZ

ZZZ

ZZ}

T0 T1• •

η0 η1

R

��������

@@@

@@@@I

• •

ζ0 ζ1

η0 ◦ ι η1 ◦ ι

����������7

SSSSSSSSSSo

��������

@@@

@@@@I

• •

The green diagram commutes.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 14 / 22

Page 50: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Weak amalgamation in terms of arrows

S

6

ι

• S

�������>

ZZ

ZZZ

ZZ}

T0 T1• •

η0 η1

R

��������

@@@

@@@@I

• •

ζ0 ζ1

η0 ◦ ι η1 ◦ ι

����������7

SSSSSSSSSSo

��������

@@@

@@@@I

• •

The green diagram commutes.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 14 / 22

Page 51: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Weak amalgamation in terms of arrows

S

6

ι

• S�������>

ZZ

ZZZ

ZZ}

T0 T1• •

η0 η1

R

��������

@@@

@@@@I

• •

ζ0 ζ1

η0 ◦ ι η1 ◦ ι

����������7

SSSSSSSSSSo

��������

@@@

@@@@I

• •

The green diagram commutes.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 14 / 22

Page 52: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Weak amalgamation in terms of arrows

S

6

ι

• S�������>

ZZ

ZZZ

ZZ}

T0 T1• •

η0 η1

R

��������

@@@

@@@@I

• •

ζ0 ζ1

η0 ◦ ι η1 ◦ ι

����������7

SSSSSSSSSSo

��������

@@@

@@@@I

• •

The green diagram commutes.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 14 / 22

Page 53: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Weak amalgamation in terms of arrows

S

6

ι

• S�������>

ZZ

ZZZ

ZZ}

T0 T1• •

η0 η1

R

��������

@@@

@@@@I

• •

ζ0 ζ1

η0 ◦ ι η1 ◦ ι

����������7

SSSSSSSSSSo

��������

@@@

@@@@I

• •

The green diagram commutes.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 14 / 22

Page 54: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

An amalgamation basis for dyadic measure algebras

SupposeS = 〈A, φ1 : B1 → C1, . . . , φn : Bn → Cn〉

is an n-system of dyadic measure algebras.

Without loss of generality, we may suppose that A is a finite subalgebra ofthe algebra clopen(2N) of clopen subsets of Cantor space with measure µ.

Since A is finite, there is a large enough k , so that all the elements of Aare unions of basic open sets Ns , where s ∈ 2k .

So let A ⊇ A be the algebra with atoms {Ns}s∈2k .

Now, b ∈ B1 and φ1(b) ∈ C1 have the same measure and thus are theunion of the same number of atoms Ns of A.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 15 / 22

Page 55: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

An amalgamation basis for dyadic measure algebras

SupposeS = 〈A, φ1 : B1 → C1, . . . , φn : Bn → Cn〉

is an n-system of dyadic measure algebras.

Without loss of generality, we may suppose that A is a finite subalgebra ofthe algebra clopen(2N) of clopen subsets of Cantor space with measure µ.

Since A is finite, there is a large enough k , so that all the elements of Aare unions of basic open sets Ns , where s ∈ 2k .

So let A ⊇ A be the algebra with atoms {Ns}s∈2k .

Now, b ∈ B1 and φ1(b) ∈ C1 have the same measure and thus are theunion of the same number of atoms Ns of A.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 15 / 22

Page 56: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

An amalgamation basis for dyadic measure algebras

SupposeS = 〈A, φ1 : B1 → C1, . . . , φn : Bn → Cn〉

is an n-system of dyadic measure algebras.

Without loss of generality, we may suppose that A is a finite subalgebra ofthe algebra clopen(2N) of clopen subsets of Cantor space with measure µ.

Since A is finite, there is a large enough k , so that all the elements of Aare unions of basic open sets Ns , where s ∈ 2k .

So let A ⊇ A be the algebra with atoms {Ns}s∈2k .

Now, b ∈ B1 and φ1(b) ∈ C1 have the same measure and thus are theunion of the same number of atoms Ns of A.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 15 / 22

Page 57: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

An amalgamation basis for dyadic measure algebras

SupposeS = 〈A, φ1 : B1 → C1, . . . , φn : Bn → Cn〉

is an n-system of dyadic measure algebras.

Without loss of generality, we may suppose that A is a finite subalgebra ofthe algebra clopen(2N) of clopen subsets of Cantor space with measure µ.

Since A is finite, there is a large enough k , so that all the elements of Aare unions of basic open sets Ns , where s ∈ 2k .

So let A ⊇ A be the algebra with atoms {Ns}s∈2k .

Now, b ∈ B1 and φ1(b) ∈ C1 have the same measure and thus are theunion of the same number of atoms Ns of A.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 15 / 22

Page 58: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

An amalgamation basis for dyadic measure algebras

SupposeS = 〈A, φ1 : B1 → C1, . . . , φn : Bn → Cn〉

is an n-system of dyadic measure algebras.

Without loss of generality, we may suppose that A is a finite subalgebra ofthe algebra clopen(2N) of clopen subsets of Cantor space with measure µ.

Since A is finite, there is a large enough k , so that all the elements of Aare unions of basic open sets Ns , where s ∈ 2k .

So let A ⊇ A be the algebra with atoms {Ns}s∈2k .

Now, b ∈ B1 and φ1(b) ∈ C1 have the same measure and thus are theunion of the same number of atoms Ns of A.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 15 / 22

Page 59: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Mapping these atoms bijectively to each other, we may extend φ1 to ameasure-preserving automorphism

φ1 : A→ A.

Doing this for all φ1, . . . , φn, we have a natural extension

S = 〈A, φ1 : A→ A, . . . , φn : A→ A〉

ofS = 〈A, φ1 : B1 → C1, . . . , φn : Bn → Cn〉.

It is now fairly easy to see that any two systems embedding S may in factbe amalgamated over S and not just over S.

One simply uses the free product amalgamation over A.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 16 / 22

Page 60: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Mapping these atoms bijectively to each other, we may extend φ1 to ameasure-preserving automorphism

φ1 : A→ A.

Doing this for all φ1, . . . , φn, we have a natural extension

S = 〈A, φ1 : A→ A, . . . , φn : A→ A〉

ofS = 〈A, φ1 : B1 → C1, . . . , φn : Bn → Cn〉.

It is now fairly easy to see that any two systems embedding S may in factbe amalgamated over S and not just over S.

One simply uses the free product amalgamation over A.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 16 / 22

Page 61: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Mapping these atoms bijectively to each other, we may extend φ1 to ameasure-preserving automorphism

φ1 : A→ A.

Doing this for all φ1, . . . , φn, we have a natural extension

S = 〈A, φ1 : A→ A, . . . , φn : A→ A〉

ofS = 〈A, φ1 : B1 → C1, . . . , φn : Bn → Cn〉.

It is now fairly easy to see that any two systems embedding S may in factbe amalgamated over S and not just over S.

One simply uses the free product amalgamation over A.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 16 / 22

Page 62: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Mapping these atoms bijectively to each other, we may extend φ1 to ameasure-preserving automorphism

φ1 : A→ A.

Doing this for all φ1, . . . , φn, we have a natural extension

S = 〈A, φ1 : A→ A, . . . , φn : A→ A〉

ofS = 〈A, φ1 : B1 → C1, . . . , φn : Bn → Cn〉.

It is now fairly easy to see that any two systems embedding S may in factbe amalgamated over S and not just over S.

One simply uses the free product amalgamation over A.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 16 / 22

Page 63: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Free product amalgamation D ⊗AE of two extensions D and E of A:

a1⊗a1

a2⊗a2

a3⊗a3

a4⊗a4

a1 a2 a3 a4

a1

a2

a3

a4

D

E

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 17 / 22

Page 64: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Criterion for ample generics

Theorem

Let K be a Fraısse class and K denote its corresponding Fraısse limit.Then Aut(K) has ample generics if and only if Kn

p has the jointembedding and weak amalgamation properties for all n.

Idea of proof: Suppose that Kp has the weak amalgamation property.

Then the conjugacy action Aut(K) y Aut(K) satisfies the condition:

For any non-empty open V ⊆ Aut(K) and identity neighbourhoodU ⊆ Aut(K), there is a smaller non-empty open set W ⊆ V so that theaction of U on W is topologically transitive.

Similarly, the joint embedding property ensures Aut(K) y Aut(K) istopologically transitive. Taken together, there exists a comeagre conjugacyclass in Aut(K).

So let us check this condition.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 18 / 22

Page 65: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Criterion for ample generics

Theorem

Let K be a Fraısse class and K denote its corresponding Fraısse limit.Then Aut(K) has ample generics if and only if Kn

p has the jointembedding and weak amalgamation properties for all n.

Idea of proof: Suppose that Kp has the weak amalgamation property.

Then the conjugacy action Aut(K) y Aut(K) satisfies the condition:

For any non-empty open V ⊆ Aut(K) and identity neighbourhoodU ⊆ Aut(K), there is a smaller non-empty open set W ⊆ V so that theaction of U on W is topologically transitive.

Similarly, the joint embedding property ensures Aut(K) y Aut(K) istopologically transitive. Taken together, there exists a comeagre conjugacyclass in Aut(K).

So let us check this condition.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 18 / 22

Page 66: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Criterion for ample generics

Theorem

Let K be a Fraısse class and K denote its corresponding Fraısse limit.Then Aut(K) has ample generics if and only if Kn

p has the jointembedding and weak amalgamation properties for all n.

Idea of proof: Suppose that Kp has the weak amalgamation property.

Then the conjugacy action Aut(K) y Aut(K) satisfies the condition:

For any non-empty open V ⊆ Aut(K) and identity neighbourhoodU ⊆ Aut(K), there is a smaller non-empty open set W ⊆ V so that theaction of U on W is topologically transitive.

Similarly, the joint embedding property ensures Aut(K) y Aut(K) istopologically transitive. Taken together, there exists a comeagre conjugacyclass in Aut(K).

So let us check this condition.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 18 / 22

Page 67: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Criterion for ample generics

Theorem

Let K be a Fraısse class and K denote its corresponding Fraısse limit.Then Aut(K) has ample generics if and only if Kn

p has the jointembedding and weak amalgamation properties for all n.

Idea of proof: Suppose that Kp has the weak amalgamation property.

Then the conjugacy action Aut(K) y Aut(K) satisfies the condition:

For any non-empty open V ⊆ Aut(K) and identity neighbourhoodU ⊆ Aut(K), there is a smaller non-empty open set W ⊆ V so that theaction of U on W is topologically transitive.

Similarly, the joint embedding property ensures Aut(K) y Aut(K) istopologically transitive. Taken together, there exists a comeagre conjugacyclass in Aut(K).

So let us check this condition.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 18 / 22

Page 68: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Criterion for ample generics

Theorem

Let K be a Fraısse class and K denote its corresponding Fraısse limit.Then Aut(K) has ample generics if and only if Kn

p has the jointembedding and weak amalgamation properties for all n.

Idea of proof: Suppose that Kp has the weak amalgamation property.

Then the conjugacy action Aut(K) y Aut(K) satisfies the condition:

For any non-empty open V ⊆ Aut(K) and identity neighbourhoodU ⊆ Aut(K), there is a smaller non-empty open set W ⊆ V so that theaction of U on W is topologically transitive.

Similarly, the joint embedding property ensures Aut(K) y Aut(K) istopologically transitive.

Taken together, there exists a comeagre conjugacyclass in Aut(K).

So let us check this condition.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 18 / 22

Page 69: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Criterion for ample generics

Theorem

Let K be a Fraısse class and K denote its corresponding Fraısse limit.Then Aut(K) has ample generics if and only if Kn

p has the jointembedding and weak amalgamation properties for all n.

Idea of proof: Suppose that Kp has the weak amalgamation property.

Then the conjugacy action Aut(K) y Aut(K) satisfies the condition:

For any non-empty open V ⊆ Aut(K) and identity neighbourhoodU ⊆ Aut(K), there is a smaller non-empty open set W ⊆ V so that theaction of U on W is topologically transitive.

Similarly, the joint embedding property ensures Aut(K) y Aut(K) istopologically transitive. Taken together, there exists a comeagre conjugacyclass in Aut(K).

So let us check this condition.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 18 / 22

Page 70: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Criterion for ample generics

Theorem

Let K be a Fraısse class and K denote its corresponding Fraısse limit.Then Aut(K) has ample generics if and only if Kn

p has the jointembedding and weak amalgamation properties for all n.

Idea of proof: Suppose that Kp has the weak amalgamation property.

Then the conjugacy action Aut(K) y Aut(K) satisfies the condition:

For any non-empty open V ⊆ Aut(K) and identity neighbourhoodU ⊆ Aut(K), there is a smaller non-empty open set W ⊆ V so that theaction of U on W is topologically transitive.

Similarly, the joint embedding property ensures Aut(K) y Aut(K) istopologically transitive. Taken together, there exists a comeagre conjugacyclass in Aut(K).

So let us check this condition.Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 18 / 22

Page 71: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

First, by shrinking V and U, we may suppose that they have the form

V = [φ : B → C ]

andU = [id : A→ A]

for some finitely generated substructures B,C ⊆ A ⊆ K.

Applying the weak amalgamation property to the system

S = 〈A, φ : B → C 〉,

we obtain an amalgamation basis S = 〈A, φ : B → C 〉 over S.

Since K is ultrahomogeneous, we may suppose that actually

A ⊆ A ⊆ K,

whence we have a non-empty open subset

W = [φ : B → C ] ⊆ V .

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 19 / 22

Page 72: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

First, by shrinking V and U, we may suppose that they have the form

V = [φ : B → C ]

andU = [id : A→ A]

for some finitely generated substructures B,C ⊆ A ⊆ K.

Applying the weak amalgamation property to the system

S = 〈A, φ : B → C 〉,

we obtain an amalgamation basis S = 〈A, φ : B → C 〉 over S.

Since K is ultrahomogeneous, we may suppose that actually

A ⊆ A ⊆ K,

whence we have a non-empty open subset

W = [φ : B → C ] ⊆ V .

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 19 / 22

Page 73: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

First, by shrinking V and U, we may suppose that they have the form

V = [φ : B → C ]

andU = [id : A→ A]

for some finitely generated substructures B,C ⊆ A ⊆ K.

Applying the weak amalgamation property to the system

S = 〈A, φ : B → C 〉,

we obtain an amalgamation basis S = 〈A, φ : B → C 〉 over S.

Since K is ultrahomogeneous, we may suppose that actually

A ⊆ A ⊆ K,

whence we have a non-empty open subset

W = [φ : B → C ] ⊆ V .

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 19 / 22

Page 74: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

To see that the action of U on W is topologically transitive, suppose

Wi = [ψi : Ei → Fi ] ⊆ W = [φ : B → C ]

for i = 0, 1, are two open subsets.

We can assume that φ ⊆ ψi and find Di ⊆ K containing all of Ei ,Fi , A.

Then there is a system 〈L, α : M → N〉 with L ⊆ K and embeddings

ηi : 〈Di , ψi : Ei → Fi 〉 → 〈L, α : M → N〉

so that η0|A = η1|A.

Extending ηi to full automorphisms gi of K, we have

g0|A = g1|A and ∅ 6= [α : M → N] ⊆ g0[W0] ∩ g1[W1].

Then g−10 g1 ∈ U = [id : A→ A] and g−10 g1[W1] ∩W0 6= ∅, showing thatthe action U y W is topologically transitive.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 20 / 22

Page 75: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

To see that the action of U on W is topologically transitive, suppose

Wi = [ψi : Ei → Fi ] ⊆ W = [φ : B → C ]

for i = 0, 1, are two open subsets.

We can assume that φ ⊆ ψi and find Di ⊆ K containing all of Ei ,Fi , A.

Then there is a system 〈L, α : M → N〉 with L ⊆ K and embeddings

ηi : 〈Di , ψi : Ei → Fi 〉 → 〈L, α : M → N〉

so that η0|A = η1|A.

Extending ηi to full automorphisms gi of K, we have

g0|A = g1|A and ∅ 6= [α : M → N] ⊆ g0[W0] ∩ g1[W1].

Then g−10 g1 ∈ U = [id : A→ A] and g−10 g1[W1] ∩W0 6= ∅, showing thatthe action U y W is topologically transitive.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 20 / 22

Page 76: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

To see that the action of U on W is topologically transitive, suppose

Wi = [ψi : Ei → Fi ] ⊆ W = [φ : B → C ]

for i = 0, 1, are two open subsets.

We can assume that φ ⊆ ψi and find Di ⊆ K containing all of Ei ,Fi , A.

Then there is a system 〈L, α : M → N〉 with L ⊆ K and embeddings

ηi : 〈Di , ψi : Ei → Fi 〉 → 〈L, α : M → N〉

so that η0|A = η1|A.

Extending ηi to full automorphisms gi of K, we have

g0|A = g1|A and ∅ 6= [α : M → N] ⊆ g0[W0] ∩ g1[W1].

Then g−10 g1 ∈ U = [id : A→ A] and g−10 g1[W1] ∩W0 6= ∅, showing thatthe action U y W is topologically transitive.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 20 / 22

Page 77: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

To see that the action of U on W is topologically transitive, suppose

Wi = [ψi : Ei → Fi ] ⊆ W = [φ : B → C ]

for i = 0, 1, are two open subsets.

We can assume that φ ⊆ ψi and find Di ⊆ K containing all of Ei ,Fi , A.

Then there is a system 〈L, α : M → N〉 with L ⊆ K and embeddings

ηi : 〈Di , ψi : Ei → Fi 〉 → 〈L, α : M → N〉

so that η0|A = η1|A.

Extending ηi to full automorphisms gi of K, we have

g0|A = g1|A and ∅ 6= [α : M → N] ⊆ g0[W0] ∩ g1[W1].

Then g−10 g1 ∈ U = [id : A→ A] and g−10 g1[W1] ∩W0 6= ∅, showing thatthe action U y W is topologically transitive.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 20 / 22

Page 78: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

To see that the action of U on W is topologically transitive, suppose

Wi = [ψi : Ei → Fi ] ⊆ W = [φ : B → C ]

for i = 0, 1, are two open subsets.

We can assume that φ ⊆ ψi and find Di ⊆ K containing all of Ei ,Fi , A.

Then there is a system 〈L, α : M → N〉 with L ⊆ K and embeddings

ηi : 〈Di , ψi : Ei → Fi 〉 → 〈L, α : M → N〉

so that η0|A = η1|A.

Extending ηi to full automorphisms gi of K, we have

g0|A = g1|A and ∅ 6= [α : M → N] ⊆ g0[W0] ∩ g1[W1].

Then g−10 g1 ∈ U = [id : A→ A] and g−10 g1[W1] ∩W0 6= ∅, showing thatthe action U y W is topologically transitive.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 20 / 22

Page 79: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Examples (Automorphism groups with ample generics)

Homeo(2N, µ),

Aut(R) (E. Hrushovski),

Aut(T∞, r), where T∞ is the countably regular rooted tree and r isan arbitrary vertex,

Aut(B∞) = Homeo(2N) (A. Kwiatkowska),

Isom(QU) (S. Solecki).

Theorem (Hodges–Hodkinson–Lascar–Shelah, Ben Yaacov–Tsankov)

Let M be a countable ℵ0-stable and ℵ0-categorical structure.Then Aut(M) has an open subgroup with ample generics.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 21 / 22

Page 80: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Examples (Automorphism groups with ample generics)

Homeo(2N, µ),

Aut(R) (E. Hrushovski),

Aut(T∞, r), where T∞ is the countably regular rooted tree and r isan arbitrary vertex,

Aut(B∞) = Homeo(2N) (A. Kwiatkowska),

Isom(QU) (S. Solecki).

Theorem (Hodges–Hodkinson–Lascar–Shelah, Ben Yaacov–Tsankov)

Let M be a countable ℵ0-stable and ℵ0-categorical structure.Then Aut(M) has an open subgroup with ample generics.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 21 / 22

Page 81: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Examples (Automorphism groups with ample generics)

Homeo(2N, µ),

Aut(R) (E. Hrushovski),

Aut(T∞, r), where T∞ is the countably regular rooted tree and r isan arbitrary vertex,

Aut(B∞) = Homeo(2N) (A. Kwiatkowska),

Isom(QU) (S. Solecki).

Theorem (Hodges–Hodkinson–Lascar–Shelah, Ben Yaacov–Tsankov)

Let M be a countable ℵ0-stable and ℵ0-categorical structure.Then Aut(M) has an open subgroup with ample generics.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 21 / 22

Page 82: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Examples (Automorphism groups with ample generics)

Homeo(2N, µ),

Aut(R) (E. Hrushovski),

Aut(T∞, r), where T∞ is the countably regular rooted tree and r isan arbitrary vertex,

Aut(B∞) = Homeo(2N) (A. Kwiatkowska),

Isom(QU) (S. Solecki).

Theorem (Hodges–Hodkinson–Lascar–Shelah, Ben Yaacov–Tsankov)

Let M be a countable ℵ0-stable and ℵ0-categorical structure.Then Aut(M) has an open subgroup with ample generics.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 21 / 22

Page 83: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Examples (Automorphism groups with ample generics)

Homeo(2N, µ),

Aut(R) (E. Hrushovski),

Aut(T∞, r), where T∞ is the countably regular rooted tree and r isan arbitrary vertex,

Aut(B∞) = Homeo(2N) (A. Kwiatkowska),

Isom(QU) (S. Solecki).

Theorem (Hodges–Hodkinson–Lascar–Shelah, Ben Yaacov–Tsankov)

Let M be a countable ℵ0-stable and ℵ0-categorical structure.Then Aut(M) has an open subgroup with ample generics.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 21 / 22

Page 84: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Examples (Automorphism groups with ample generics)

Homeo(2N, µ),

Aut(R) (E. Hrushovski),

Aut(T∞, r), where T∞ is the countably regular rooted tree and r isan arbitrary vertex,

Aut(B∞) = Homeo(2N) (A. Kwiatkowska),

Isom(QU) (S. Solecki).

Theorem (Hodges–Hodkinson–Lascar–Shelah, Ben Yaacov–Tsankov)

Let M be a countable ℵ0-stable and ℵ0-categorical structure.Then Aut(M) has an open subgroup with ample generics.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 21 / 22

Page 85: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

Examples (Automorphism groups with ample generics)

Homeo(2N, µ),

Aut(R) (E. Hrushovski),

Aut(T∞, r), where T∞ is the countably regular rooted tree and r isan arbitrary vertex,

Aut(B∞) = Homeo(2N) (A. Kwiatkowska),

Isom(QU) (S. Solecki).

Theorem (Hodges–Hodkinson–Lascar–Shelah, Ben Yaacov–Tsankov)

Let M be a countable ℵ0-stable and ℵ0-categorical structure.Then Aut(M) has an open subgroup with ample generics.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 21 / 22

Page 86: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

For another example of groups with open subgroups having amplegenerics, consider Aut(T∞).

Aut(T∞) does not have ample generics, since there are two types ofautomorphisms of the tree, namely elliptic and hyperbolic.

On the other hand, the vertex stabiliser Aut(T∞, r) is an open subgroup,which consists only of elliptic elements and does have ample generics.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 22 / 22

Page 87: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

For another example of groups with open subgroups having amplegenerics, consider Aut(T∞).

Aut(T∞) does not have ample generics, since there are two types ofautomorphisms of the tree, namely elliptic and hyperbolic.

On the other hand, the vertex stabiliser Aut(T∞, r) is an open subgroup,which consists only of elliptic elements and does have ample generics.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 22 / 22

Page 88: Descriptive Set Theory and Model Theory Second Lecture · Example (Finite measured Boolean algebras) For every dyadic rational r = k 2n 2[0;1], let P r be a unary predicate. Let also

For another example of groups with open subgroups having amplegenerics, consider Aut(T∞).

Aut(T∞) does not have ample generics, since there are two types ofautomorphisms of the tree, namely elliptic and hyperbolic.

On the other hand, the vertex stabiliser Aut(T∞, r) is an open subgroup,which consists only of elliptic elements and does have ample generics.

Christian Rosendal Descriptive Set Theory and Model Theory Notre Dame, June 2016 22 / 22