Approximation of analytic by Borel sets and definable countable chain conditions

A. S. Kechris, S. Solecki

Research output: Contribution to journalArticlepeer-review

Abstract

Let I be a σ-ideal on a Polish space such that each set from I is contained in a Borel set from I. We say that I fails to fulfil the Σ 1 1 countable chain condition if there is a Σ 1 1 equivalence relation with uncountably many equivalence classes none of which is in I. Assuming definable determinacy, we show that if the family of Borel sets from I is definable in the codes of Borel sets, then each Σ 1 1 set is equal to a Borel set modulo a set from I iff I fulfils the Σ 1 1 countable chain condition. Further we characterize the σ-ideals I generated by closed sets that satisfy the countable chain condition or, equivalently in this case, the approximation property for Σ 1 1 sets mentioned above. It turns out that they are exactly of the form MGR(F)={A : ∀F ∈ F A ∩F is meager in F} for a countable family F of closed sets. In particular, we verify partially a conjecture of Kunen by showing that the σ-ideal of meager sets is the unique σ-ideal on R, or any Polish group, generated by closed sets which is invariant under translations and satisfies the countable chain condition.

Original languageEnglish (US)
Pages (from-to)343-356
Number of pages14
JournalIsrael Journal of Mathematics
Volume89
Issue number1-3
DOIs
StatePublished - Oct 1995
Externally publishedYes

ASJC Scopus subject areas

  • General Mathematics

Fingerprint

Dive into the research topics of 'Approximation of analytic by Borel sets and definable countable chain conditions'. Together they form a unique fingerprint.

Cite this