Complexity of Ramsey null sets

DOI10.1016/J.AIM.2012.03.001MaRDI QIDQ436231zbMATHOpenAlexFDO

Authors Marcin Sabok

Publication date 20 July 2012

Published in Advances in Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1003.5983

zbMATH Keywords

\(\sigma\)-idealPolish spaceMathias forcing\(\Sigma^1_2\)-complete setsRamsey measurable setsRamsey null setsZFC-correct

Mathematics Subject Classification ID

Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Descriptive set theory (03E15) Other aspects of forcing and Boolean-valued models (03E40) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05)

Abstract: We show that the set of codes for Ramsey positive analytic sets is $mathbf{Sigma}_2^1$-complete. This is a one projective-step higher analogue of the Hurewicz theorem saying that the set of codes for uncountable analytic sets is $mathbf{Sigma}_1^1$-complete. This shows a close resemblance between the Sacks forcing and the Mathias forcing. In particular, we get that the $sigma$-ideal of Ramsey null sets is not ZFC-correct. This solves a problem posed by Ikegami, Pawlikowski and Zapletal.

Recommendations

• Ramsey sets, the Ramsey ideal, and other classes overR
• Possibly there is no uniformly completely Ramsey null set of size 2^ω
• On completely Ramsey sets
• Uniformly completely Ramsey sets
• Some remarks on totally imperfect sets

Cites work

• scientific article; zbMATH DE number 4068856 (Why is no real title available?)
• A new proof that analytic sets are Ramsey
• Borel sets and Ramsey's theorem
• Descriptive set theory
• Every analytic set is Ramsey
• Forcing absoluteness and regularity properties
• Forcing idealized
• Introduction to Ramsey space
• Linear algebraic groups and countable Borel equivalence relations
• On the concept of 𝑃𝑖₁¹-completeness
• On the determinacy of games on ordinals
• Polarized partitions on the second level of the projective hierarchy
• Set Theory
• Some Complete ∑ 1 2 Sets in Harmonic Analysis
• Topology and descriptive set theory
• \(\Delta^ 1_ 2\)-sets of reals

Cited in

(13)

• Proper forcing and rectangular Ramsey theorems
• Ramsey sets, the Ramsey ideal, and other classes overR
• Matrices of completely Ramsey sets with infinitely many rows
• Filter-Laver measurability
• The Null Space Problem I. Complexity
• Complexity of Computing the Anti-Ramsey Numbers for Paths.
• Ramsey type properties of ideals
• A complexity problem for Borel graphs
• Polarized partitions on the second level of the projective hierarchy
• The complexity of irredundant sets parameterized by size
• Playing with Mathias
• scientific article; zbMATH DE number 549852 (Why is no real title available?)
• A characterization of \(\mathbf {\Sigma}_{2}^{1}\) sets

This page was built for publication: Complexity of Ramsey null sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436231)