Searcharxiv⌕ Search

arXiv subjects

Marcin Sabok

Publications and source records attributed to Marcin Sabok.

28 records · Page 2Linked to original sources

Topological representations

This paper studies the combinatorics of ideals which recently appeared in ergodicity results for analytic equivalence relations. The ideals have the following topological representation. There is a separable metrizable space $X$, a $σ$-ideal $I$ on $X$ and a dense countable subset $D$ of $X$ such that the ideal consists of those subsets of $D$ whose closure belongs to $I$. It turns out that this definition is indepedent of the choice of $D$. We show that an ideal is of this form if and only if it is dense and countably separated. The latter is a variation of a notion introduced by Todor\vcević for gaps. As a corollary, we get that this class is invariant under the Rudin--Blass equivalence. This also implies that the space $X$ can be always chosen to be compact so that $I$ is a $σ$-ideal of compact sets. We compute the possible descriptive complexities of such ideals and conclude that all analytic equivalence relations induced by such ideals are $\mathbfΠ^0_3$. We also prove that a coanalytic ideal is an intersection of ideals of this form if and only if it is weakly selective.

math.LO↗

Extreme amenability of abelian $L_0$ groups

We show that for any abelian topological group $G$ and arbitrary diffused submeasure $μ$, every continuous action of $L_0(μ,G)$ on a compact space has a fixed point. This generalizes earlier results of Herer and Christensen, Glasner, Furstenberg and Weiss, and Farah and Solecki. This also answers a question posed by Farah and Solecki. In particular, it implies that if $H$ is of the form $L_0(μ,\mathbb{R})$, then $H$ is extremely amenable if and only if $H$ has no nontrivial characters, which gives an evidence for an affirmative answer to a question of Pestov. The proof is based on estimates of chromatic numbers of certain graphs on $\mathbb{Z}^n$. It uses tools from algebraic topology and builds on the work of Farah and Solecki.

math.FA↗

Bounded forcing axioms and Baumgartner's conjecture

We study the spectrum of forcing notions between the iterations of $σ$-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of $α$-proper forcings for indecomposable countable ordinals as well as the Axiom A forcings. We focus on the bounded forcing axioms for the hierarchy of $α$-proper forcings and connect them to a hierarchy of weak club guessing principles. We show that they are, in a sense, dual to each other. In particular, these weak club guessing principles separate the bounded forcing axioms for distinct countable indecomposable ordinals. In the study of forcings completely embeddable into an iteration of $σ$-closed followed by ccc forcing, we present an equivalent characterization of this class in terms of Baumgartner's Axiom A. This resolves a well-known conjecture of Baumgartner from the 1980's.

math.LO↗

Complexity of Ramsey null sets

We show that the set of codes for Ramsey positive analytic sets is $\mathbfΣ^1_2$-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Σ^1_1$-complete. This shows a close resemblance between the Sacks forcing and the Mathias forcing. In particular, we get that the $σ$-ideal of Ramsey null sets is not ZFC-correct. This solves a problem posed by Ikegami, Pawlikowski and Zapletal.

math.LO↗

Forcing properties of ideals of closed sets

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. For $σ$-ideals generated by closed sets we also study the degrees of reals added in the forcing extensions. Among corollaries of our results, we get necessary and sufficient conditions for a $σ$-ideal $I$ generated by closed sets, under which every Borel function can be restricted to an $I$-positive Borel set on which it is either 1-1 or constant.

math.LO↗

Forcing, games and families of closed sets

We propose a new, game-theoretic, approach to the idealized forcing, in terms of fusion games. This generalizes the classical approach to the Sacks and the Miller forcing. For definable ($\mathbfΠ^1_1$ on $\mathbfΣ^1_1) $σ$-ideals we show that if a $σ$-ideal is generated by closed sets, then it is generated by closed sets in all forcing extensions. We also prove an infinite-dimensional version of the Solecki dichotomy for analytic sets. Among examples, we investigate the $σ$-ideal $\E$ generated by closed null sets and $σ$-ideals connected with not piecewise continuous functions.

math.LO↗

The Solecki dichotomy for functions with analytic graphs

A dichotomy discovered by Solecki says that a Baire class 1 function from a Souslin space into a Polish space either can be decomposed into countably many continuous functions, or else contains one particular function which cannot be so decomposed. In this paper we generalize this dichotomy to arbitrary functions with analytic graphs. We provide a "classical" proof, which uses only elementary combinatorics and topology.

math.GN↗

A dichotomy for Borel functions

The dichotomy discovered by Solecki in \cite{Sol} states that any Baire class 1 function is either $σ$-continuous or "includes" the Pawlikowski function $P$. The aim of this paper is to give an argument which is simpler than the original proof of Solecki and gives a stronger statement: a dichotomy for all Borel functions.

math.GN↗

A note on ccc forcings

The aim of this short note is to communicate a simple solution to the problem posed in [1] as Question 7.2.7: is it true that for every ccc $σ$-ideal I any I-positive Borel set contains modulo I an I-positive closed set?

math.LO↗

$σ$-continuity and related forcings

The Steprans forcing notion arises as a quotient of Borel sets modulo the ideal of $σ$-continuity of a certain Borel not $σ$-continuous function. We give a characterization of this forcing in the language of trees and using this characterization we establish such properties of the forcing as fusion and continuous reading of names. Although the latter property is usually implied by the fact that the associated ideal is generated by closed sets, we show it is not the case with Steprans forcing. We also establish a connection between Steprans forcing and Miller forcing thus giving a new description of the latter. Eventually, we exhibit a variety of forcing notions which do not have continuous reading of names in any presentation.

math.LO↗