Mad families, definability, and ideals (Part 2) David Schrittesser - - PowerPoint PPT Presentation

mad families definability and ideals part 2
SMART_READER_LITE
LIVE PREVIEW

Mad families, definability, and ideals (Part 2) David Schrittesser - - PowerPoint PPT Presentation

Mad families, definability, and ideals (Part 2) David Schrittesser (KGRC) joint with Asger Trnquist and Karen Haga Descriptive Set Theory in Torino August 17 DST Torino Schrittesser Mad families, part 2 17 1 / 15 Overview Definable


slide-1
SLIDE 1

Mad families, definability, and ideals (Part 2)

David Schrittesser (KGRC) joint with Asger Törnquist and Karen Haga Descriptive Set Theory in Torino

August 17

Schrittesser Mad families, part 2 DST Torino ´ 17 1 / 15

slide-2
SLIDE 2

Overview

1

Definable mad families under Projective Determinacy

2

J -mad families, for Borel ideals J other than Fin.

Schrittesser Mad families, part 2 DST Torino ´ 17 2 / 15

slide-3
SLIDE 3

Definable mad families under Projective Determinacy

Theorem

Assuming the Axiom of Projective Determinacy (PD), there are no infinite projective mad families. Our methods also give results under AD, but not all of them are new:

Theorem (Neeman-Norwood)

Assuming the Axiom of Determinacy holds in L(R), there are no infinite mad families in L(R). We concentrate on PD. Our proofs use:

1

Every projective set is Suslin

2

Reasonably definable forcing cannot change the projective theory

Schrittesser Mad families, part 2 DST Torino ´ 17 3 / 15

slide-4
SLIDE 4

Definable mad families under Projective Determinacy

Theorem

Assuming the Axiom of Projective Determinacy (PD), there are no infinite projective mad families. Our methods also give results under AD, but not all of them are new:

Theorem (Neeman-Norwood)

Assuming the Axiom of Determinacy holds in L(R), there are no infinite mad families in L(R). We concentrate on PD. Our proofs use:

1

Every projective set is Suslin

2

Reasonably definable forcing cannot change the projective theory

Schrittesser Mad families, part 2 DST Torino ´ 17 3 / 15

slide-5
SLIDE 5

Definable mad families under Projective Determinacy

Theorem

Assuming the Axiom of Projective Determinacy (PD), there are no infinite projective mad families. Our methods also give results under AD, but not all of them are new:

Theorem (Neeman-Norwood)

Assuming the Axiom of Determinacy holds in L(R), there are no infinite mad families in L(R). We concentrate on PD. Our proofs use:

1

Every projective set is Suslin

2

Reasonably definable forcing cannot change the projective theory

Schrittesser Mad families, part 2 DST Torino ´ 17 3 / 15

slide-6
SLIDE 6

The analytic case

Theorem

There are no infinite Σ1

1 mad families.

Proof ideas Suppose A = p[T] is an infinite a.d.-family. Let MA+ be Mathias forcing ‘relative to A’. MA+ ˙ xG is a.d. from every x ∈ (p[T])V[G]. The formula Σ1

2 formula

V[G] (∃x)(∀y ∈ A) x = y ∧ x ∩ y ∈ Fin is true in V[G] and so by Shoenfied absoluteness, also in V. This proof straightforwardly lifts to Σ1

n using PD.

Schrittesser Mad families, part 2 DST Torino ´ 17 4 / 15

slide-7
SLIDE 7

The analytic case

Theorem

There are no infinite Σ1

1 mad families.

Proof ideas Suppose A = p[T] is an infinite a.d.-family. Let MA+ be Mathias forcing ‘relative to A’. MA+ ˙ xG is a.d. from every x ∈ (p[T])V[G]. The formula Σ1

2 formula

V[G] (∃x)(∀y ∈ A) x = y ∧ x ∩ y ∈ Fin is true in V[G] and so by Shoenfied absoluteness, also in V. This proof straightforwardly lifts to Σ1

n using PD.

Schrittesser Mad families, part 2 DST Torino ´ 17 4 / 15

slide-8
SLIDE 8

The analytic case

Theorem

There are no infinite Σ1

1 mad families.

Proof ideas Suppose A = p[T] is an infinite a.d.-family. Let MA+ be Mathias forcing ‘relative to A’. MA+ ˙ xG is a.d. from every x ∈ (p[T])V[G]. The formula Σ1

2 formula

V[G] (∃x)(∀y ∈ A) x = y ∧ x ∩ y ∈ Fin is true in V[G] and so by Shoenfied absoluteness, also in V. This proof straightforwardly lifts to Σ1

n using PD.

Schrittesser Mad families, part 2 DST Torino ´ 17 4 / 15

slide-9
SLIDE 9

The analytic case

Theorem

There are no infinite Σ1

1 mad families.

Proof ideas Suppose A = p[T] is an infinite a.d.-family. Let MA+ be Mathias forcing ‘relative to A’. MA+ ˙ xG is a.d. from every x ∈ (p[T])V[G]. The formula Σ1

2 formula

V[G] (∃x)(∀y ∈ A) x = y ∧ x ∩ y ∈ Fin is true in V[G] and so by Shoenfied absoluteness, also in V. This proof straightforwardly lifts to Σ1

n using PD.

Schrittesser Mad families, part 2 DST Torino ´ 17 4 / 15

slide-10
SLIDE 10

The analytic case

Theorem

There are no infinite Σ1

1 mad families.

Proof ideas Suppose A = p[T] is an infinite a.d.-family. Let MA+ be Mathias forcing ‘relative to A’. MA+ ˙ xG is a.d. from every x ∈ (p[T])V[G]. The formula Σ1

2 formula

V[G] (∃x)(∀y ∈ A) x = y ∧ x ∩ y ∈ Fin is true in V[G] and so by Shoenfied absoluteness, also in V. This proof straightforwardly lifts to Σ1

n using PD.

Schrittesser Mad families, part 2 DST Torino ´ 17 4 / 15

slide-11
SLIDE 11

The analytic case

Theorem

There are no infinite Σ1

1 mad families.

Proof ideas Suppose A = p[T] is an infinite a.d.-family. Let MA+ be Mathias forcing ‘relative to A’. MA+ ˙ xG is a.d. from every x ∈ (p[T])V[G]. The formula Σ1

2 formula

V[G] (∃x)(∀y ∈ A) x = y ∧ x ∩ y ∈ Fin is true in V[G] and so by Shoenfied absoluteness, also in V. This proof straightforwardly lifts to Σ1

n using PD.

Schrittesser Mad families, part 2 DST Torino ´ 17 4 / 15

slide-12
SLIDE 12

Lemma

MA+ ˙ xG is a.d. from every x ∈ (p[T])V[G]. Note that it is easier to see that MA+ ˙ xG is a.d. from every x ∈ (p[T])V, i.e., from A. Proof ideas Let Z = {x ∈ p[T] | x ∩ xG / ∈ Fin}. Show |Z| ≤ 1. Supposing Z = ∅, let x be its unique element. x is definable from [xG]E0. Show that x ∈ V, i.e., x ∈ A. Contradiction!

Schrittesser Mad families, part 2 DST Torino ´ 17 5 / 15

slide-13
SLIDE 13

Lemma

MA+ ˙ xG is a.d. from every x ∈ (p[T])V[G]. Note that it is easier to see that MA+ ˙ xG is a.d. from every x ∈ (p[T])V, i.e., from A. Proof ideas Let Z = {x ∈ p[T] | x ∩ xG / ∈ Fin}. Show |Z| ≤ 1. Supposing Z = ∅, let x be its unique element. x is definable from [xG]E0. Show that x ∈ V, i.e., x ∈ A. Contradiction!

Schrittesser Mad families, part 2 DST Torino ´ 17 5 / 15

slide-14
SLIDE 14

Lemma

MA+ ˙ xG is a.d. from every x ∈ (p[T])V[G]. Note that it is easier to see that MA+ ˙ xG is a.d. from every x ∈ (p[T])V, i.e., from A. Proof ideas Let Z = {x ∈ p[T] | x ∩ xG / ∈ Fin}. Show |Z| ≤ 1. Supposing Z = ∅, let x be its unique element. x is definable from [xG]E0. Show that x ∈ V, i.e., x ∈ A. Contradiction!

Schrittesser Mad families, part 2 DST Torino ´ 17 5 / 15

slide-15
SLIDE 15

Lemma

MA+ ˙ xG is a.d. from every x ∈ (p[T])V[G]. Note that it is easier to see that MA+ ˙ xG is a.d. from every x ∈ (p[T])V, i.e., from A. Proof ideas Let Z = {x ∈ p[T] | x ∩ xG / ∈ Fin}. Show |Z| ≤ 1. Supposing Z = ∅, let x be its unique element. x is definable from [xG]E0. Show that x ∈ V, i.e., x ∈ A. Contradiction!

Schrittesser Mad families, part 2 DST Torino ´ 17 5 / 15

slide-16
SLIDE 16

Lemma

MA+ ˙ xG is a.d. from every x ∈ (p[T])V[G]. Note that it is easier to see that MA+ ˙ xG is a.d. from every x ∈ (p[T])V, i.e., from A. Proof ideas Let Z = {x ∈ p[T] | x ∩ xG / ∈ Fin}. Show |Z| ≤ 1. Supposing Z = ∅, let x be its unique element. x is definable from [xG]E0. Show that x ∈ V, i.e., x ∈ A. Contradiction!

Schrittesser Mad families, part 2 DST Torino ´ 17 5 / 15

slide-17
SLIDE 17

There are two non-trivial steps in the previous sketch:

1

|{x ∈ p[T] | x ∩ xG / ∈ Fin}| ≤ 1. This uses heavily some property of the ideal Fin.

2

If a real x in V[G] is definable from [xG]E0, x is in V. This uses that

◮ that A+ is σ-closed (uses that A is infinite!) ◮ thus, MA+ is σ∗-closed in second component ◮ that MA+ is homogeneous ‘under finite changes’ Schrittesser Mad families, part 2 DST Torino ´ 17 6 / 15

slide-18
SLIDE 18

Other ideals

Let J be an ideal on ω. Two sets A, A′ ⊆ ω are called J -almost disjoint iff A ∩ A′ ∈ J . Let J + = P(ω) \ J A set A ⊂ P(ω) is called a J -almost disjoint family iff A ⊆ J + and any two distinct sets in A are J -almost disjoint. J -mad families are defined analogously.

Schrittesser Mad families, part 2 DST Torino ´ 17 7 / 15

slide-19
SLIDE 19

Other Borel ideals

Martin Goldstern asked: Question: Is there an analytic J -mad family where J is the harmonic ideal: X ∈ J ⇐ ⇒

  • n∈X

1/n < ∞ The answer in this case is no; and as before the proof lifts under PD (and lifts further under AD).

Schrittesser Mad families, part 2 DST Torino ´ 17 8 / 15

slide-20
SLIDE 20

Fix a σ∗-closed Borel ideal J and a Suslin infinite J -a.d. family A ⊆ P(ω), A = p[T]. Denote (J , A)+ by the co-ideal of the ideal generated by A ∪ J .

Lemma

(J , A)+ is σ∗-closed. The obvious forcing M(J ,A)+ is homogeneous under changes in J and σ∗-closed in the second part We need more to show two more crucial properties: M(J ,A)+ ˙ xG / ∈ J V[G] M(J ,A)+ {x ∈ p[T] | ˙ xG ∩ x ∈ J V[G]} has at most one element.

Schrittesser Mad families, part 2 DST Torino ´ 17 9 / 15

slide-21
SLIDE 21

Fix a σ∗-closed Borel ideal J and a Suslin infinite J -a.d. family A ⊆ P(ω), A = p[T]. Denote (J , A)+ by the co-ideal of the ideal generated by A ∪ J .

Lemma

(J , A)+ is σ∗-closed. The obvious forcing M(J ,A)+ is homogeneous under changes in J and σ∗-closed in the second part We need more to show two more crucial properties: M(J ,A)+ ˙ xG / ∈ J V[G] M(J ,A)+ {x ∈ p[T] | ˙ xG ∩ x ∈ J V[G]} has at most one element.

Schrittesser Mad families, part 2 DST Torino ´ 17 9 / 15

slide-22
SLIDE 22

Fix a σ∗-closed Borel ideal J and a Suslin infinite J -a.d. family A ⊆ P(ω), A = p[T]. Denote (J , A)+ by the co-ideal of the ideal generated by A ∪ J .

Lemma

(J , A)+ is σ∗-closed. The obvious forcing M(J ,A)+ is homogeneous under changes in J and σ∗-closed in the second part We need more to show two more crucial properties: M(J ,A)+ ˙ xG / ∈ J V[G] M(J ,A)+ {x ∈ p[T] | ˙ xG ∩ x ∈ J V[G]} has at most one element.

Schrittesser Mad families, part 2 DST Torino ´ 17 9 / 15

slide-23
SLIDE 23

Fix a σ∗-closed Borel ideal J and a Suslin infinite J -a.d. family A ⊆ P(ω), A = p[T]. Denote (J , A)+ by the co-ideal of the ideal generated by A ∪ J .

Lemma

(J , A)+ is σ∗-closed. The obvious forcing M(J ,A)+ is homogeneous under changes in J and σ∗-closed in the second part We need more to show two more crucial properties: M(J ,A)+ ˙ xG / ∈ J V[G] M(J ,A)+ {x ∈ p[T] | ˙ xG ∩ x ∈ J V[G]} has at most one element.

Schrittesser Mad families, part 2 DST Torino ´ 17 9 / 15

slide-24
SLIDE 24

Submeasures and ideals

A submeasure is a function Φ: P(ω) → [0, ∞] such that X ⊆ Y ⇒ Φ(X) ≤ Φ(Y) for any X, Y ∈ P(ω) Φ(X ∪ Y) ≤ Φ(X) + Φ(Y) for any X, Y ∈ P(ω) Φ({n}) < ∞ for any n ∈ ω Φ is lower semi-continuous. I.e., Φ(X) = lim

n Φ(X ∩ n)

Any submeasure gives rise to an ideal Fin(Φ) by letting Fin(Φ) = {X ∈ P(ω) | Φ(X) < ∞}

Schrittesser Mad families, part 2 DST Torino ´ 17 10 / 15

slide-25
SLIDE 25

Generalization to finite part of submeasure

The previous arguments go through for ideals of the form Fin(Φ) where Φ is a submeasure. In particular this answers Goldstern’s question. If J = Fin(Φ)+ J is σ∗-closed. For any J -a.d. family A, MJ ,A+ is ‘homogeneous under changes

  • n sets in J ’ and σ∗-closed on the second part.

MJ ,A+ φ( ˙ xG) = ∞, i.e., ˙ xG / ∈ J V[G] MJ ,A+ {x ∈ p[T] | ˙ xG ∩ x ∈ J V[G]} has at most one element.

Schrittesser Mad families, part 2 DST Torino ´ 17 11 / 15

slide-26
SLIDE 26

What about ideals which are not of this form?

Let J be any ideal. Define an ideal Jω on ω × ω by: X ∈ Jω ⇐ ⇒ (∀n ∈ ω) X(n) ∈ J That is, Jω the ideal generated by sets of the form

  • n∈ω

{n} × Jn, where (Jn)n∈ω is any sequence from J .

Observation

Let J be any non-trivial ideal. There is a countable J ω-mad family, namely {{ n} × ω | n ∈ ω}. In particular such ideals appear cofinally in the Borel hierarchy.

Schrittesser Mad families, part 2 DST Torino ´ 17 12 / 15

slide-27
SLIDE 27

What about ideals which are not of this form?

Let J be any ideal. Define an ideal Jω on ω × ω by: X ∈ Jω ⇐ ⇒ (∀n ∈ ω) X(n) ∈ J That is, Jω the ideal generated by sets of the form

  • n∈ω

{n} × Jn, where (Jn)n∈ω is any sequence from J .

Observation

Let J be any non-trivial ideal. There is a countable J ω-mad family, namely {{ n} × ω | n ∈ ω}. In particular such ideals appear cofinally in the Borel hierarchy.

Schrittesser Mad families, part 2 DST Torino ´ 17 12 / 15

slide-28
SLIDE 28

What about ideals which are not of this form?

Let J be any ideal. Define an ideal Jω on ω × ω by: X ∈ Jω ⇐ ⇒ (∀n ∈ ω) X(n) ∈ J That is, Jω the ideal generated by sets of the form

  • n∈ω

{n} × Jn, where (Jn)n∈ω is any sequence from J .

Observation

Let J be any non-trivial ideal. There is a countable J ω-mad family, namely {{ n} × ω | n ∈ ω}. In particular such ideals appear cofinally in the Borel hierarchy.

Schrittesser Mad families, part 2 DST Torino ´ 17 12 / 15

slide-29
SLIDE 29

Fubini product ideals

Consider the ideal Fin × Fin on ω × ω, defined as follows: For X ⊆ ω × ω (letting X(n) = {m | (n, m) ∈ X}), define X ∈ Fin × Fin ⇐ ⇒ {n ∈ ω | X(n) / ∈ Fin} ∈ Fin Using ‘Fubini products’, we can define Finα, for every α < ω1. Each Finα is a definable ideal (in fact, Borel). The Finα appear cofinally in the Borel hierarchy.

Theorem

For each α < ω1, There is no analytic Finα-mad family Under the Axiom of Projective Determinacy, there is no infinite projective Finα-mad family Under the Axiom of Determinacy, there is no infinite Finα-mad family in L(R).

Schrittesser Mad families, part 2 DST Torino ´ 17 13 / 15

slide-30
SLIDE 30

Question:

Can we characterize the analytic, or at least the Borel ideals J ⊆ P(ω) such that there is no analytic infinite J -mad family?

Schrittesser Mad families, part 2 DST Torino ´ 17 14 / 15

slide-31
SLIDE 31

Grazie mille!

Schrittesser Mad families, part 2 DST Torino ´ 17 15 / 15