Complexity of Ramsey null sets

DOI10.1016/J.AIM.2012.03.001zbMATH Open1259.03062arXiv1003.5983OpenAlexW1986518393MaRDI QIDQ436231FDOQ436231

Authors: Marcin Sabok 

Publication date: 20 July 2012

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

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.

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

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

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)

Cites Work

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

Cited In (11)

• Complexity of Computing the Anti-Ramsey Numbers for Paths.
• Polarized partitions on the second level of the projective hierarchy
• Ramsey sets, the Ramsey ideal, and other classes overR
• The Null Space Problem I. Complexity
• Title not available (Why is that?)
• Proper forcing and rectangular Ramsey theorems
• A characterization of \(\mathbf {\Sigma}_{2}^{1}\) sets
• Filter-Laver measurability
• Playing with Mathias
• The complexity of irredundant sets parameterized by size
• A complexity problem for Borel graphs

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)