We prove a partition theorem for analytic sets, namely, if X is an analytic set in a Polish space and [X]n = K0 ∪ K1 with K0 open in the relative topology, and the partition satisfies a finitary condition, then either there is a perfect K0-homogeneous subset or X is a countable union of K1-homogeneous subsets. We also prove a partition theorem for analytic sets in the three-dimensional case. Finally, we give some applications of the theorems.

We isolate several large classes of definable proper forcings and show how they include many partial orderings used in practice.

I describe several ways in which forcing arguments can be used to yield clean and conceptual proofs of nonreducibility, ergodicity and other results in the theory of analytic equivalence relations. In particular, I present simple Borel equivalence relationsE, Fsuch that a natural proof of nonreducibility ofEtoFuses the independence of the Singular Cardinal Hypothesis at ℵω.

With every σ-ideal I on a Polish space we associate the σ-ideal I* generated by the closed sets in I. We study the forcing notions of Borel sets modulo the respective σ-ideals I and I* and find connections between their forcing properties. To this end, we associate to a σ-ideal on a Polish space an ideal on a countable set and show how forcing properties of the forcing depend on combinatorial properties of the ideal. We also study the 1—1 or (...) constant property of σ-ideals, i.e., the property that every Borel function defined on a Borel positive set can be restricted to a positive Borel set on which it either 1—1 or constant. We prove the following dichotomy: if I is a σ-ideal generated by closed sets, then either the forcing P I adds a Cohen real, or else I has the 1—1 or constant property. (shrink)