Dominating and unbounded free sets
A set \(F\subseteq X\) is said to be free for a set \(E\subseteq X\times X\) if \((x,y)\notin E\) whenever \(x\) and \(y\) are two distinct elements of~\(F\). A subset \(F\) of \({}^\omega\omega\) is \(\sigma\)-bounded (bounded) if it is bounded with respect to~\(\leq^*\)-ordering (\(\leq\)-ordering). A cofinal subset of \(({}^\omega\omega,\leq^*)\) is called dominating. The authors prove that if \(X={}^\omega\omega\) then every analytic set in~\({}^\omega\omega\times{}^\omega\omega\) with \(\sigma\)-bounded sections has a closed free set which is not \(\sigma\)-bounded. They also show that the result cannot be strengthened: there exists a closed set with bounded sections which has no dominating analytic free set, and there exists a closed set with non-dominating sections for which every analytic free set is \(\sigma\)-bounded. Under the assumption that all projective games are determined the condition of analyticity can be replaced by projectivity.
- Dominating projective sets in the Baire space
- Projective Hausdorff gaps
- Dense free sets
- Canonical behavior of Borel functions on superperfect rectangles
- On effective \(\sigma \)-boundedness and \(\sigma \)-compactness
- Non-meager free sets for meager relations on Polish spaces
- Mycielski among trees
- Around the Eggleston theorem
This page was built for publication: Dominating and unbounded free sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4254621)
